MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0.  evalloopsstart(A,B)    -> evalloopsentryin(A,B)    True         (1,1)
          1.  evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)      [A >= 0]     (?,1)
          2.  evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          3.  evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)      [A >= 0]     (?,1)
          4.  evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          5.  evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)      [A >= 2]     (?,1)
          6.  evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)      [1 >= A]     (?,1)
          7.  evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)      [A >= 1 + B] (?,1)
          8.  evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)      [B >= A]     (?,1)
          9.  evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)    True         (?,1)
          10. evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B) True         (?,1)
          11. evalloopsreturnin(A,B) -> evalloopsstop(A,B)       True         (?,1)
        Signature:
          {(evalloopsbb1in,2)
          ;(evalloopsbb3in,2)
          ;(evalloopsbb4in,2)
          ;(evalloopsbb5in,2)
          ;(evalloopsbb6in,2)
          ;(evalloopsentryin,2)
          ;(evalloopsreturnin,2)
          ;(evalloopsstart,2)
          ;(evalloopsstop,2)}
        Flow Graph:
          [0->{1,2},1->{3,4},2->{11},3->{5,6},4->{11},5->{7,8},6->{10},7->{9},8->{10},9->{7,8},10->{3,4},11->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  evalloopsstart(A,B)    -> evalloopsentryin(A,B)    True         (1,1)
          1.  evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)      [A >= 0]     (1,1)
          2.  evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)   [0 >= 1 + A] (1,1)
          3.  evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)      [A >= 0]     (?,1)
          4.  evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)   [0 >= 1 + A] (1,1)
          5.  evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)      [A >= 2]     (?,1)
          6.  evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)      [1 >= A]     (?,1)
          7.  evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)      [A >= 1 + B] (?,1)
          8.  evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)      [B >= A]     (?,1)
          9.  evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)    True         (?,1)
          10. evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B) True         (?,1)
          11. evalloopsreturnin(A,B) -> evalloopsstop(A,B)       True         (1,1)
        Signature:
          {(evalloopsbb1in,2)
          ;(evalloopsbb3in,2)
          ;(evalloopsbb4in,2)
          ;(evalloopsbb5in,2)
          ;(evalloopsbb6in,2)
          ;(evalloopsentryin,2)
          ;(evalloopsreturnin,2)
          ;(evalloopsstart,2)
          ;(evalloopsstop,2)}
        Flow Graph:
          [0->{1,2},1->{3,4},2->{11},3->{5,6},4->{11},5->{7,8},6->{10},7->{9},8->{10},9->{7,8},10->{3,4},11->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,4),(5,8)]
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0.  evalloopsstart(A,B)    -> evalloopsentryin(A,B)    True         (1,1)
          1.  evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)      [A >= 0]     (1,1)
          2.  evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)   [0 >= 1 + A] (1,1)
          3.  evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)      [A >= 0]     (?,1)
          4.  evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)   [0 >= 1 + A] (1,1)
          5.  evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)      [A >= 2]     (?,1)
          6.  evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)      [1 >= A]     (?,1)
          7.  evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)      [A >= 1 + B] (?,1)
          8.  evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)      [B >= A]     (?,1)
          9.  evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)    True         (?,1)
          10. evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B) True         (?,1)
          11. evalloopsreturnin(A,B) -> evalloopsstop(A,B)       True         (1,1)
        Signature:
          {(evalloopsbb1in,2)
          ;(evalloopsbb3in,2)
          ;(evalloopsbb4in,2)
          ;(evalloopsbb5in,2)
          ;(evalloopsbb6in,2)
          ;(evalloopsentryin,2)
          ;(evalloopsreturnin,2)
          ;(evalloopsstart,2)
          ;(evalloopsstop,2)}
        Flow Graph:
          [0->{1,2},1->{3},2->{11},3->{5,6},4->{11},5->{7},6->{10},7->{9},8->{10},9->{7,8},10->{3,4},11->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  evalloopsstart(A,B)    -> evalloopsentryin(A,B)    True         (1,1)
          1.  evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)      [A >= 0]     (?,1)
          2.  evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          3.  evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)      [A >= 0]     (?,1)
          4.  evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          5.  evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)      [A >= 2]     (?,1)
          6.  evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)      [1 >= A]     (?,1)
          7.  evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)      [A >= 1 + B] (?,1)
          8.  evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)      [B >= A]     (?,1)
          9.  evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)    True         (?,1)
          10. evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B) True         (?,1)
          11. evalloopsreturnin(A,B) -> evalloopsstop(A,B)       True         (?,1)
          12. evalloopsreturnin(A,B) -> exitus616(A,B)           True         (?,1)
        Signature:
          {(evalloopsbb1in,2)
          ;(evalloopsbb3in,2)
          ;(evalloopsbb4in,2)
          ;(evalloopsbb5in,2)
          ;(evalloopsbb6in,2)
          ;(evalloopsentryin,2)
          ;(evalloopsreturnin,2)
          ;(evalloopsstart,2)
          ;(evalloopsstop,2)
          ;(exitus616,2)}
        Flow Graph:
          [0->{1,2},1->{3,4},2->{11,12},3->{5,6},4->{11,12},5->{7,8},6->{10},7->{9},8->{10},9->{7,8},10->{3,4}
          ,11->{},12->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,4),(5,8)]
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        0.  evalloopsstart(A,B)    -> evalloopsentryin(A,B)    True         (1,1)
        1.  evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)      [A >= 0]     (?,1)
        2.  evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
        3.  evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)      [A >= 0]     (?,1)
        4.  evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
        5.  evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)      [A >= 2]     (?,1)
        6.  evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)      [1 >= A]     (?,1)
        7.  evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)      [A >= 1 + B] (?,1)
        8.  evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)      [B >= A]     (?,1)
        9.  evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)    True         (?,1)
        10. evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B) True         (?,1)
        11. evalloopsreturnin(A,B) -> evalloopsstop(A,B)       True         (?,1)
        12. evalloopsreturnin(A,B) -> exitus616(A,B)           True         (?,1)
      Signature:
        {(evalloopsbb1in,2)
        ;(evalloopsbb3in,2)
        ;(evalloopsbb4in,2)
        ;(evalloopsbb5in,2)
        ;(evalloopsbb6in,2)
        ;(evalloopsentryin,2)
        ;(evalloopsreturnin,2)
        ;(evalloopsstart,2)
        ;(evalloopsstop,2)
        ;(exitus616,2)}
      Flow Graph:
        [0->{1,2},1->{3},2->{11,12},3->{5,6},4->{11,12},5->{7},6->{10},7->{9},8->{10},9->{7,8},10->{3,4},11->{}
        ,12->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12]
        |
        `- p:[3,10,6,8,9,7,5] c: [5]
           |
           +- p:[7,9] c: []
           |
           `- p:[3,10,6] c: [3]
MAYBE