MAYBE
* Step 1: UnsatRules 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:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [2]
* Step 2: 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)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,1,3,4,5},3->{},4->{0,1,3,4,5},5->{0,1,3,4,5},6->{0,1,3,4,5}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(4,3),(4,5),(5,0),(5,1),(5,4)]
* Step 3: FromIts 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)
        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:
        FromIts
    + Details:
        ()
* Step 4: Unfold MAYBE
    + Considered Problem:
        Rules:
          f2(A,B)   -> f1(C,D)       [0 >= 1 + C && A = 14]
          f2(A,B)   -> f2(C,B)       [C >= 0 && A = 14]
          f2(A,B)   -> f1(-1 + A,C)  [13 >= A && 0 >= A]
          f2(A,B)   -> f2(-1 + A,B)  [A >= 15 && A >= 1]
          f2(A,B)   -> f2(-1 + A,B)  [13 >= A && A >= 1]
          f300(A,B) -> f2(A,B)       True
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Rule Graph:
          [0->{},1->{0,1,3,4,5},3->{},4->{0,1,4},5->{3,5},6->{0,1,3,4,5}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 5: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f2.0(A,B)   -> f1.7(C,D)       [0 >= 1 + C && A = 14]
          f2.1(A,B)   -> f2.0(C,B)       [C >= 0 && A = 14]
          f2.1(A,B)   -> f2.1(C,B)       [C >= 0 && A = 14]
          f2.1(A,B)   -> f2.3(C,B)       [C >= 0 && A = 14]
          f2.1(A,B)   -> f2.4(C,B)       [C >= 0 && A = 14]
          f2.1(A,B)   -> f2.5(C,B)       [C >= 0 && A = 14]
          f2.3(A,B)   -> f1.7(-1 + A,C)  [13 >= A && 0 >= A]
          f2.4(A,B)   -> f2.0(-1 + A,B)  [A >= 15 && A >= 1]
          f2.4(A,B)   -> f2.1(-1 + A,B)  [A >= 15 && A >= 1]
          f2.4(A,B)   -> f2.4(-1 + A,B)  [A >= 15 && A >= 1]
          f2.5(A,B)   -> f2.3(-1 + A,B)  [13 >= A && A >= 1]
          f2.5(A,B)   -> f2.5(-1 + A,B)  [13 >= A && A >= 1]
          f300.6(A,B) -> f2.0(A,B)       True
          f300.6(A,B) -> f2.1(A,B)       True
          f300.6(A,B) -> f2.3(A,B)       True
          f300.6(A,B) -> f2.4(A,B)       True
          f300.6(A,B) -> f2.5(A,B)       True
        Signature:
          {(f1.7,2);(f2.0,2);(f2.1,2);(f2.3,2);(f2.4,2);(f2.5,2);(f300.6,2)}
        Rule Graph:
          [0->{},1->{0},2->{1,2,3,4,5},3->{6},4->{7,8,9},5->{10,11},6->{},7->{0},8->{1,2,3,4,5},9->{7,8,9},10->{6}
          ,11->{10,11},12->{0},13->{1,2,3,4,5},14->{6},15->{7,8,9},16->{10,11}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 6: Failure MAYBE
  + Considered Problem:
      Rules:
        f2.0(A,B)   -> f1.7(C,D)       [0 >= 1 + C && A = 14]
        f2.1(A,B)   -> f2.0(C,B)       [C >= 0 && A = 14]
        f2.1(A,B)   -> f2.1(C,B)       [C >= 0 && A = 14]
        f2.1(A,B)   -> f2.3(C,B)       [C >= 0 && A = 14]
        f2.1(A,B)   -> f2.4(C,B)       [C >= 0 && A = 14]
        f2.1(A,B)   -> f2.5(C,B)       [C >= 0 && A = 14]
        f2.3(A,B)   -> f1.7(-1 + A,C)  [13 >= A && 0 >= A]
        f2.4(A,B)   -> f2.0(-1 + A,B)  [A >= 15 && A >= 1]
        f2.4(A,B)   -> f2.1(-1 + A,B)  [A >= 15 && A >= 1]
        f2.4(A,B)   -> f2.4(-1 + A,B)  [A >= 15 && A >= 1]
        f2.5(A,B)   -> f2.3(-1 + A,B)  [13 >= A && A >= 1]
        f2.5(A,B)   -> f2.5(-1 + A,B)  [13 >= A && A >= 1]
        f300.6(A,B) -> f2.0(A,B)       True
        f300.6(A,B) -> f2.1(A,B)       True
        f300.6(A,B) -> f2.3(A,B)       True
        f300.6(A,B) -> f2.4(A,B)       True
        f300.6(A,B) -> f2.5(A,B)       True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
        f1.7(A,B)   -> exitus616(A,B)  True
      Signature:
        {(exitus616,2);(f1.7,2);(f2.0,2);(f2.1,2);(f2.3,2);(f2.4,2);(f2.5,2);(f300.6,2)}
      Rule Graph:
        [0->{19,21,24,26,27},1->{0},2->{1,2,3,4,5},3->{6},4->{7,8,9},5->{10,11},6->{17,18,20,22,23,25},7->{0}
        ,8->{1,2,3,4,5},9->{7,8,9},10->{6},11->{10,11},12->{0},13->{1,2,3,4,5},14->{6},15->{7,8,9},16->{10,11}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]
        |
        +- p:[2,8,4,9] c: []
        |
        `- p:[11] c: [11]
MAYBE