MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (?,1)
          1. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          2. f2(A,B)   -> f1(-1 + A,C) [A >= 15 && 0 >= A]    (?,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (?,1)
          4. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)      True                   (1,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,2,3,4,5},2->{},3->{},4->{0,1,2,3,4,5},5->{0,1,2,3,4,5},6->{0,1,2,3,4,5}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (1,1)
          1. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          2. f2(A,B)   -> f1(-1 + A,C) [A >= 15 && 0 >= A]    (1,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (1,1)
          4. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)      True                   (1,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,2,3,4,5},2->{},3->{},4->{0,1,2,3,4,5},5->{0,1,2,3,4,5},6->{0,1,2,3,4,5}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(4,2),(4,3),(4,5),(5,0),(5,1),(5,2),(5,4),(6,2)]
* Step 3: UnreachableRules MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (1,1)
          1. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          2. f2(A,B)   -> f1(-1 + A,C) [A >= 15 && 0 >= A]    (1,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (1,1)
          4. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)      True                   (1,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,3,4,5},2->{},3->{},4->{0,1,4},5->{3,5},6->{0,1,3,4,5}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [2]
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (1,1)
          1. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (1,1)
          4. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)      True                   (1,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,3,4,5},3->{},4->{0,1,4},5->{3,5},6->{0,1,3,4,5}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f1(C,D)        [0 >= 1 + C && A = 14] (?,1)
          1. f2(A,B)   -> f2(C,B)        [C >= 0 && A = 14]     (?,1)
          3. f2(A,B)   -> f1(-1 + A,C)   [13 >= A && 0 >= A]    (?,1)
          4. f2(A,B)   -> f2(-1 + A,B)   [A >= 15 && A >= 1]    (?,1)
          5. f2(A,B)   -> f2(-1 + A,B)   [13 >= A && A >= 1]    (?,1)
          6. f300(A,B) -> f2(A,B)        True                   (1,1)
          7. f2(A,B)   -> exitus616(A,B) True                   (?,1)
        Signature:
          {(exitus616,2);(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,3,4,5,7},3->{},4->{0,1,3,4,5,7},5->{0,1,3,4,5,7},6->{0,1,3,4,5,7},7->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(4,3),(4,5),(5,0),(5,1),(5,4)]
* Step 6: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f2(A,B)   -> f1(C,D)        [0 >= 1 + C && A = 14] (?,1)
        1. f2(A,B)   -> f2(C,B)        [C >= 0 && A = 14]     (?,1)
        3. f2(A,B)   -> f1(-1 + A,C)   [13 >= A && 0 >= A]    (?,1)
        4. f2(A,B)   -> f2(-1 + A,B)   [A >= 15 && A >= 1]    (?,1)
        5. f2(A,B)   -> f2(-1 + A,B)   [13 >= A && A >= 1]    (?,1)
        6. f300(A,B) -> f2(A,B)        True                   (1,1)
        7. f2(A,B)   -> exitus616(A,B) True                   (?,1)
      Signature:
        {(exitus616,2);(f1,2);(f2,2);(f300,2)}
      Flow Graph:
        [0->{},1->{0,1,3,4,5,7},3->{},4->{0,1,4,7},5->{3,5,7},6->{0,1,3,4,5,7},7->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,3,4,5,6,7]
        |
        +- p:[1,4] c: []
        |
        `- p:[5] c: [5]
MAYBE