MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B,C) -> f2(A + -1*B,1 + B,C) [A >= 1] (?,1)
          1. f3(A,B,C) -> f2(A,B,C)            [B >= 1] (1,1)
          2. f2(A,B,C) -> f4(A,B,D)            [0 >= A] (?,1)
          3. f3(A,B,C) -> f4(A,B,D)            [0 >= B] (1,1)
        Signature:
          {(f2,3);(f3,3);(f4,3)}
        Flow Graph:
          [0->{0,2},1->{0,2},2->{},3->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B,C) -> f2(A + -1*B,1 + B,C) [A >= 1] (?,1)
          1. f3(A,B,C) -> f2(A,B,C)            [B >= 1] (1,1)
          2. f2(A,B,C) -> f4(A,B,D)            [0 >= A] (1,1)
          3. f3(A,B,C) -> f4(A,B,D)            [0 >= B] (1,1)
        Signature:
          {(f2,3);(f3,3);(f4,3)}
        Flow Graph:
          [0->{0,2},1->{0,2},2->{},3->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f2(A,B,C) -> f2(A + -1*B,1 + B,C) [A >= 1] (?,1)
        1. f3(A,B,C) -> f2(A,B,C)            [B >= 1] (1,1)
        2. f2(A,B,C) -> f4(A,B,D)            [0 >= A] (?,1)
        3. f3(A,B,C) -> f4(A,B,D)            [0 >= B] (1,1)
        4. f3(A,B,C) -> exitus616(A,B,C)     True     (1,1)
        5. f2(A,B,C) -> exitus616(A,B,C)     True     (?,1)
      Signature:
        {(exitus616,3);(f2,3);(f3,3);(f4,3)}
      Flow Graph:
        [0->{0,2,5},1->{0,2,5},2->{},3->{},4->{},5->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5]
        |
        `- p:[0] c: []
MAYBE