MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B,C)   -> f1(A + B,B,D) [0 >= 1 + A + B] (?,1)
          1. f2(A,B,C)   -> f2(A + B,B,C) [A + B >= 0]     (?,1)
          2. f300(A,B,C) -> f2(A,B,C)     True             (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{},1->{0,1},2->{0,1}]
        
    + 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)   -> f1(A + B,B,D) [0 >= 1 + A + B] (1,1)
          1. f2(A,B,C)   -> f2(A + B,B,C) [A + B >= 0]     (?,1)
          2. f300(A,B,C) -> f2(A,B,C)     True             (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f2(A,B,C)   -> f1(A + B,B,D)    [0 >= 1 + A + B] (?,1)
        1. f2(A,B,C)   -> f2(A + B,B,C)    [A + B >= 0]     (?,1)
        2. f300(A,B,C) -> f2(A,B,C)        True             (1,1)
        3. f2(A,B,C)   -> exitus616(A,B,C) True             (?,1)
      Signature:
        {(exitus616,3);(f1,3);(f2,3);(f300,3)}
      Flow Graph:
        [0->{},1->{0,1,3},2->{0,1,3},3->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3]
        |
        `- p:[1] c: []
MAYBE