MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. evalEx7start(A,B,C)    -> evalEx7entryin(A,B,C)   True                   (1,1)
          1. evalEx7entryin(A,B,C)  -> evalEx7bb3in(A,B,1 + A) [A >= 1 && B >= 1 + A] (?,1)
          2. evalEx7bb3in(A,B,C)    -> evalEx7bbin(A,B,C)      [A >= 1 + C]           (?,1)
          3. evalEx7bb3in(A,B,C)    -> evalEx7bbin(A,B,C)      [C >= 1 + A]           (?,1)
          4. evalEx7bb3in(A,B,C)    -> evalEx7returnin(A,B,C)  [C = A]                (?,1)
          5. evalEx7bbin(A,B,C)     -> evalEx7bb3in(A,B,0)     [C >= 1 + B]           (?,1)
          6. evalEx7bbin(A,B,C)     -> evalEx7bb3in(A,B,1 + C) [B >= C]               (?,1)
          7. evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C)      True                   (?,1)
        Signature:
          {(evalEx7bb3in,3);(evalEx7bbin,3);(evalEx7entryin,3);(evalEx7returnin,3);(evalEx7start,3);(evalEx7stop,3)}
        Flow Graph:
          [0->{1},1->{2,3,4},2->{5,6},3->{5,6},4->{7},5->{2,3,4},6->{2,3,4},7->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,4)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. evalEx7start(A,B,C)    -> evalEx7entryin(A,B,C)   True                   (1,1)
          1. evalEx7entryin(A,B,C)  -> evalEx7bb3in(A,B,1 + A) [A >= 1 && B >= 1 + A] (?,1)
          2. evalEx7bb3in(A,B,C)    -> evalEx7bbin(A,B,C)      [A >= 1 + C]           (?,1)
          3. evalEx7bb3in(A,B,C)    -> evalEx7bbin(A,B,C)      [C >= 1 + A]           (?,1)
          4. evalEx7bb3in(A,B,C)    -> evalEx7returnin(A,B,C)  [C = A]                (?,1)
          5. evalEx7bbin(A,B,C)     -> evalEx7bb3in(A,B,0)     [C >= 1 + B]           (?,1)
          6. evalEx7bbin(A,B,C)     -> evalEx7bb3in(A,B,1 + C) [B >= C]               (?,1)
          7. evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C)      True                   (?,1)
        Signature:
          {(evalEx7bb3in,3);(evalEx7bbin,3);(evalEx7entryin,3);(evalEx7returnin,3);(evalEx7start,3);(evalEx7stop,3)}
        Flow Graph:
          [0->{1},1->{3},2->{5,6},3->{5,6},4->{7},5->{2,3,4},6->{2,3,4},7->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          evalEx7start(A,B,C)    -> evalEx7entryin(A,B,C)    True
          evalEx7entryin(A,B,C)  -> evalEx7bb3in(A,B,1 + A)  [A >= 1 && B >= 1 + A]
          evalEx7bb3in(A,B,C)    -> evalEx7bbin(A,B,C)       [A >= 1 + C]
          evalEx7bb3in(A,B,C)    -> evalEx7bbin(A,B,C)       [C >= 1 + A]
          evalEx7bb3in(A,B,C)    -> evalEx7returnin(A,B,C)   [C = A]
          evalEx7bbin(A,B,C)     -> evalEx7bb3in(A,B,0)      [C >= 1 + B]
          evalEx7bbin(A,B,C)     -> evalEx7bb3in(A,B,1 + C)  [B >= C]
          evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C)       True
        Signature:
          {(evalEx7bb3in,3);(evalEx7bbin,3);(evalEx7entryin,3);(evalEx7returnin,3);(evalEx7start,3);(evalEx7stop,3)}
        Rule Graph:
          [0->{1},1->{3},2->{5,6},3->{5,6},4->{7},5->{2,3,4},6->{2,3,4},7->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          evalEx7start.0(A,B,C)    -> evalEx7entryin.1(A,B,C)    True
          evalEx7entryin.1(A,B,C)  -> evalEx7bb3in.3(A,B,1 + A)  [A >= 1 && B >= 1 + A]
          evalEx7bb3in.2(A,B,C)    -> evalEx7bbin.5(A,B,C)       [A >= 1 + C]
          evalEx7bb3in.2(A,B,C)    -> evalEx7bbin.6(A,B,C)       [A >= 1 + C]
          evalEx7bb3in.3(A,B,C)    -> evalEx7bbin.5(A,B,C)       [C >= 1 + A]
          evalEx7bb3in.3(A,B,C)    -> evalEx7bbin.6(A,B,C)       [C >= 1 + A]
          evalEx7bb3in.4(A,B,C)    -> evalEx7returnin.7(A,B,C)   [C = A]
          evalEx7bbin.5(A,B,C)     -> evalEx7bb3in.2(A,B,0)      [C >= 1 + B]
          evalEx7bbin.5(A,B,C)     -> evalEx7bb3in.3(A,B,0)      [C >= 1 + B]
          evalEx7bbin.5(A,B,C)     -> evalEx7bb3in.4(A,B,0)      [C >= 1 + B]
          evalEx7bbin.6(A,B,C)     -> evalEx7bb3in.2(A,B,1 + C)  [B >= C]
          evalEx7bbin.6(A,B,C)     -> evalEx7bb3in.3(A,B,1 + C)  [B >= C]
          evalEx7bbin.6(A,B,C)     -> evalEx7bb3in.4(A,B,1 + C)  [B >= C]
          evalEx7returnin.7(A,B,C) -> evalEx7stop.8(A,B,C)       True
        Signature:
          {(evalEx7bb3in.2,3)
          ;(evalEx7bb3in.3,3)
          ;(evalEx7bb3in.4,3)
          ;(evalEx7bbin.5,3)
          ;(evalEx7bbin.6,3)
          ;(evalEx7entryin.1,3)
          ;(evalEx7returnin.7,3)
          ;(evalEx7start.0,3)
          ;(evalEx7stop.8,3)}
        Rule Graph:
          [0->{1},1->{4,5},2->{7,8,9},3->{10,11,12},4->{7,8,9},5->{10,11,12},6->{13},7->{2,3},8->{4,5},9->{6},10->{2
          ,3},11->{4,5},12->{6},13->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        evalEx7start.0(A,B,C)    -> evalEx7entryin.1(A,B,C)    True
        evalEx7entryin.1(A,B,C)  -> evalEx7bb3in.3(A,B,1 + A)  [A >= 1 && B >= 1 + A]
        evalEx7bb3in.2(A,B,C)    -> evalEx7bbin.5(A,B,C)       [A >= 1 + C]
        evalEx7bb3in.2(A,B,C)    -> evalEx7bbin.6(A,B,C)       [A >= 1 + C]
        evalEx7bb3in.3(A,B,C)    -> evalEx7bbin.5(A,B,C)       [C >= 1 + A]
        evalEx7bb3in.3(A,B,C)    -> evalEx7bbin.6(A,B,C)       [C >= 1 + A]
        evalEx7bb3in.4(A,B,C)    -> evalEx7returnin.7(A,B,C)   [C = A]
        evalEx7bbin.5(A,B,C)     -> evalEx7bb3in.2(A,B,0)      [C >= 1 + B]
        evalEx7bbin.5(A,B,C)     -> evalEx7bb3in.3(A,B,0)      [C >= 1 + B]
        evalEx7bbin.5(A,B,C)     -> evalEx7bb3in.4(A,B,0)      [C >= 1 + B]
        evalEx7bbin.6(A,B,C)     -> evalEx7bb3in.2(A,B,1 + C)  [B >= C]
        evalEx7bbin.6(A,B,C)     -> evalEx7bb3in.3(A,B,1 + C)  [B >= C]
        evalEx7bbin.6(A,B,C)     -> evalEx7bb3in.4(A,B,1 + C)  [B >= C]
        evalEx7returnin.7(A,B,C) -> evalEx7stop.8(A,B,C)       True
        evalEx7stop.8(A,B,C)     -> exitus616(A,B,C)           True
        evalEx7stop.8(A,B,C)     -> exitus616(A,B,C)           True
      Signature:
        {(evalEx7bb3in.2,3)
        ;(evalEx7bb3in.3,3)
        ;(evalEx7bb3in.4,3)
        ;(evalEx7bbin.5,3)
        ;(evalEx7bbin.6,3)
        ;(evalEx7entryin.1,3)
        ;(evalEx7returnin.7,3)
        ;(evalEx7start.0,3)
        ;(evalEx7stop.8,3)
        ;(exitus616,3)}
      Rule Graph:
        [0->{1},1->{4,5},2->{7,8,9},3->{10,11,12},4->{7,8,9},5->{10,11,12},6->{13},7->{2,3},8->{4,5},9->{6},10->{2
        ,3},11->{4,5},12->{6},13->{14,15}]
  + 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]
        |
        `- p:[4,8,2,7,10,3,5,11] c: []
MAYBE