MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  evalwisestart(A,B)    -> evalwiseentryin(A,B)   True                       (1,1)
          1.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + A]               (?,1)
          2.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + B]               (?,1)
          3.  evalwiseentryin(A,B)  -> evalwisebb6in(B,A)     [A >= 0 && B >= 0]         (?,1)
          4.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [B >= 3 + A]               (?,1)
          5.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [A >= 3 + B]               (?,1)
          6.  evalwisebb6in(A,B)    -> evalwisereturnin(A,B)  [2 + A >= B && 2 + B >= A] (?,1)
          7.  evalwisebb3in(A,B)    -> evalwisebb4in(A,B)     [A >= 1 + B]               (?,1)
          8.  evalwisebb3in(A,B)    -> evalwisebb5in(A,B)     [B >= A]                   (?,1)
          9.  evalwisebb4in(A,B)    -> evalwisebb6in(A,1 + B) True                       (?,1)
          10. evalwisebb5in(A,B)    -> evalwisebb6in(1 + A,B) True                       (?,1)
          11. evalwisereturnin(A,B) -> evalwisestop(A,B)      True                       (?,1)
        Signature:
          {(evalwisebb3in,2)
          ;(evalwisebb4in,2)
          ;(evalwisebb5in,2)
          ;(evalwisebb6in,2)
          ;(evalwiseentryin,2)
          ;(evalwisereturnin,2)
          ;(evalwisestart,2)
          ;(evalwisestop,2)}
        Flow Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{4,5,6},10->{4,5,6}
          ,11->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(4,7),(5,8)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0.  evalwisestart(A,B)    -> evalwiseentryin(A,B)   True                       (1,1)
          1.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + A]               (?,1)
          2.  evalwiseentryin(A,B)  -> evalwisereturnin(A,B)  [0 >= 1 + B]               (?,1)
          3.  evalwiseentryin(A,B)  -> evalwisebb6in(B,A)     [A >= 0 && B >= 0]         (?,1)
          4.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [B >= 3 + A]               (?,1)
          5.  evalwisebb6in(A,B)    -> evalwisebb3in(A,B)     [A >= 3 + B]               (?,1)
          6.  evalwisebb6in(A,B)    -> evalwisereturnin(A,B)  [2 + A >= B && 2 + B >= A] (?,1)
          7.  evalwisebb3in(A,B)    -> evalwisebb4in(A,B)     [A >= 1 + B]               (?,1)
          8.  evalwisebb3in(A,B)    -> evalwisebb5in(A,B)     [B >= A]                   (?,1)
          9.  evalwisebb4in(A,B)    -> evalwisebb6in(A,1 + B) True                       (?,1)
          10. evalwisebb5in(A,B)    -> evalwisebb6in(1 + A,B) True                       (?,1)
          11. evalwisereturnin(A,B) -> evalwisestop(A,B)      True                       (?,1)
        Signature:
          {(evalwisebb3in,2)
          ;(evalwisebb4in,2)
          ;(evalwisebb5in,2)
          ;(evalwisebb6in,2)
          ;(evalwiseentryin,2)
          ;(evalwisereturnin,2)
          ;(evalwisestart,2)
          ;(evalwisestop,2)}
        Flow Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{8},5->{7},6->{11},7->{9},8->{10},9->{4,5,6},10->{4,5,6},11->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          evalwisestart(A,B)    -> evalwiseentryin(A,B)    True
          evalwiseentryin(A,B)  -> evalwisereturnin(A,B)   [0 >= 1 + A]
          evalwiseentryin(A,B)  -> evalwisereturnin(A,B)   [0 >= 1 + B]
          evalwiseentryin(A,B)  -> evalwisebb6in(B,A)      [A >= 0 && B >= 0]
          evalwisebb6in(A,B)    -> evalwisebb3in(A,B)      [B >= 3 + A]
          evalwisebb6in(A,B)    -> evalwisebb3in(A,B)      [A >= 3 + B]
          evalwisebb6in(A,B)    -> evalwisereturnin(A,B)   [2 + A >= B && 2 + B >= A]
          evalwisebb3in(A,B)    -> evalwisebb4in(A,B)      [A >= 1 + B]
          evalwisebb3in(A,B)    -> evalwisebb5in(A,B)      [B >= A]
          evalwisebb4in(A,B)    -> evalwisebb6in(A,1 + B)  True
          evalwisebb5in(A,B)    -> evalwisebb6in(1 + A,B)  True
          evalwisereturnin(A,B) -> evalwisestop(A,B)       True
        Signature:
          {(evalwisebb3in,2)
          ;(evalwisebb4in,2)
          ;(evalwisebb5in,2)
          ;(evalwisebb6in,2)
          ;(evalwiseentryin,2)
          ;(evalwisereturnin,2)
          ;(evalwisestart,2)
          ;(evalwisestop,2)}
        Rule Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{8},5->{7},6->{11},7->{9},8->{10},9->{4,5,6},10->{4,5,6},11->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          evalwisestart.0(A,B)     -> evalwiseentryin.1(A,B)    True
          evalwisestart.0(A,B)     -> evalwiseentryin.2(A,B)    True
          evalwisestart.0(A,B)     -> evalwiseentryin.3(A,B)    True
          evalwiseentryin.1(A,B)   -> evalwisereturnin.11(A,B)  [0 >= 1 + A]
          evalwiseentryin.2(A,B)   -> evalwisereturnin.11(A,B)  [0 >= 1 + B]
          evalwiseentryin.3(A,B)   -> evalwisebb6in.4(B,A)      [A >= 0 && B >= 0]
          evalwiseentryin.3(A,B)   -> evalwisebb6in.5(B,A)      [A >= 0 && B >= 0]
          evalwiseentryin.3(A,B)   -> evalwisebb6in.6(B,A)      [A >= 0 && B >= 0]
          evalwisebb6in.4(A,B)     -> evalwisebb3in.8(A,B)      [B >= 3 + A]
          evalwisebb6in.5(A,B)     -> evalwisebb3in.7(A,B)      [A >= 3 + B]
          evalwisebb6in.6(A,B)     -> evalwisereturnin.11(A,B)  [2 + A >= B && 2 + B >= A]
          evalwisebb3in.7(A,B)     -> evalwisebb4in.9(A,B)      [A >= 1 + B]
          evalwisebb3in.8(A,B)     -> evalwisebb5in.10(A,B)     [B >= A]
          evalwisebb4in.9(A,B)     -> evalwisebb6in.4(A,1 + B)  True
          evalwisebb4in.9(A,B)     -> evalwisebb6in.5(A,1 + B)  True
          evalwisebb4in.9(A,B)     -> evalwisebb6in.6(A,1 + B)  True
          evalwisebb5in.10(A,B)    -> evalwisebb6in.4(1 + A,B)  True
          evalwisebb5in.10(A,B)    -> evalwisebb6in.5(1 + A,B)  True
          evalwisebb5in.10(A,B)    -> evalwisebb6in.6(1 + A,B)  True
          evalwisereturnin.11(A,B) -> evalwisestop.12(A,B)      True
        Signature:
          {(evalwisebb3in.7,2)
          ;(evalwisebb3in.8,2)
          ;(evalwisebb4in.9,2)
          ;(evalwisebb5in.10,2)
          ;(evalwisebb6in.4,2)
          ;(evalwisebb6in.5,2)
          ;(evalwisebb6in.6,2)
          ;(evalwiseentryin.1,2)
          ;(evalwiseentryin.2,2)
          ;(evalwiseentryin.3,2)
          ;(evalwisereturnin.11,2)
          ;(evalwisestart.0,2)
          ;(evalwisestop.12,2)}
        Rule Graph:
          [0->{3},1->{4},2->{5,6,7},3->{19},4->{19},5->{8},6->{9},7->{10},8->{12},9->{11},10->{19},11->{13,14,15}
          ,12->{16,17,18},13->{8},14->{9},15->{10},16->{8},17->{9},18->{10},19->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        evalwisestart.0(A,B)     -> evalwiseentryin.1(A,B)    True
        evalwisestart.0(A,B)     -> evalwiseentryin.2(A,B)    True
        evalwisestart.0(A,B)     -> evalwiseentryin.3(A,B)    True
        evalwiseentryin.1(A,B)   -> evalwisereturnin.11(A,B)  [0 >= 1 + A]
        evalwiseentryin.2(A,B)   -> evalwisereturnin.11(A,B)  [0 >= 1 + B]
        evalwiseentryin.3(A,B)   -> evalwisebb6in.4(B,A)      [A >= 0 && B >= 0]
        evalwiseentryin.3(A,B)   -> evalwisebb6in.5(B,A)      [A >= 0 && B >= 0]
        evalwiseentryin.3(A,B)   -> evalwisebb6in.6(B,A)      [A >= 0 && B >= 0]
        evalwisebb6in.4(A,B)     -> evalwisebb3in.8(A,B)      [B >= 3 + A]
        evalwisebb6in.5(A,B)     -> evalwisebb3in.7(A,B)      [A >= 3 + B]
        evalwisebb6in.6(A,B)     -> evalwisereturnin.11(A,B)  [2 + A >= B && 2 + B >= A]
        evalwisebb3in.7(A,B)     -> evalwisebb4in.9(A,B)      [A >= 1 + B]
        evalwisebb3in.8(A,B)     -> evalwisebb5in.10(A,B)     [B >= A]
        evalwisebb4in.9(A,B)     -> evalwisebb6in.4(A,1 + B)  True
        evalwisebb4in.9(A,B)     -> evalwisebb6in.5(A,1 + B)  True
        evalwisebb4in.9(A,B)     -> evalwisebb6in.6(A,1 + B)  True
        evalwisebb5in.10(A,B)    -> evalwisebb6in.4(1 + A,B)  True
        evalwisebb5in.10(A,B)    -> evalwisebb6in.5(1 + A,B)  True
        evalwisebb5in.10(A,B)    -> evalwisebb6in.6(1 + A,B)  True
        evalwisereturnin.11(A,B) -> evalwisestop.12(A,B)      True
        evalwisestop.12(A,B)     -> exitus616(A,B)            True
        evalwisestop.12(A,B)     -> exitus616(A,B)            True
        evalwisestop.12(A,B)     -> exitus616(A,B)            True
        evalwisestop.12(A,B)     -> exitus616(A,B)            True
        evalwisestop.12(A,B)     -> exitus616(A,B)            True
        evalwisestop.12(A,B)     -> exitus616(A,B)            True
        evalwisestop.12(A,B)     -> exitus616(A,B)            True
      Signature:
        {(evalwisebb3in.7,2)
        ;(evalwisebb3in.8,2)
        ;(evalwisebb4in.9,2)
        ;(evalwisebb5in.10,2)
        ;(evalwisebb6in.4,2)
        ;(evalwisebb6in.5,2)
        ;(evalwisebb6in.6,2)
        ;(evalwiseentryin.1,2)
        ;(evalwiseentryin.2,2)
        ;(evalwiseentryin.3,2)
        ;(evalwisereturnin.11,2)
        ;(evalwisestart.0,2)
        ;(evalwisestop.12,2)
        ;(exitus616,2)}
      Rule Graph:
        [0->{3},1->{4},2->{5,6,7},3->{19},4->{19},5->{8},6->{9},7->{10},8->{12},9->{11},10->{19},11->{13,14,15}
        ,12->{16,17,18},13->{8},14->{9},15->{10},16->{8},17->{9},18->{10},19->{20,21,22,23,24,25,26}]
  + 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]
        |
        `- p:[8,13,11,9,14,17,12,16] c: []
MAYBE