MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  evalgcdstart(A,B)    -> evalgcdentryin(A,B)      True                 (1,1)
          1.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= A]             (?,1)
          2.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= B]             (?,1)
          3.  evalgcdentryin(A,B)  -> evalgcdbb7in(B,A)        [A >= 1 && B >= 1]   (?,1)
          4.  evalgcdbb7in(A,B)    -> evalgcdbb4in(A,B)        [A >= 1 + B]         (?,1)
          5.  evalgcdbb7in(A,B)    -> evalgcdbb4in(A,B)        [B >= 1 + A]         (?,1)
          6.  evalgcdbb7in(A,B)    -> evalgcdreturnin(A,B)     [B = A]              (?,1)
          7.  evalgcdbb4in(A,B)    -> evalgcdbb5in(A,B)        [A >= 1 + B]         (?,1)
          8.  evalgcdbb4in(A,B)    -> evalgcdbb6in(A,B)        [B >= A]             (?,1)
          9.  evalgcdbb5in(A,B)    -> evalgcdbb7in(A + -1*B,B) [-1 + A + -1*B >= 0] (?,1)
          10. evalgcdbb6in(A,B)    -> evalgcdbb7in(A,-1*A + B) [-1*A + B >= 0]      (?,1)
          11. evalgcdreturnin(A,B) -> evalgcdstop(A,B)         True                 (?,1)
        Signature:
          {(evalgcdbb4in,2)
          ;(evalgcdbb5in,2)
          ;(evalgcdbb6in,2)
          ;(evalgcdbb7in,2)
          ;(evalgcdentryin,2)
          ;(evalgcdreturnin,2)
          ;(evalgcdstart,2)
          ;(evalgcdstop,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,8),(5,7)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0.  evalgcdstart(A,B)    -> evalgcdentryin(A,B)      True                 (1,1)
          1.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= A]             (?,1)
          2.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= B]             (?,1)
          3.  evalgcdentryin(A,B)  -> evalgcdbb7in(B,A)        [A >= 1 && B >= 1]   (?,1)
          4.  evalgcdbb7in(A,B)    -> evalgcdbb4in(A,B)        [A >= 1 + B]         (?,1)
          5.  evalgcdbb7in(A,B)    -> evalgcdbb4in(A,B)        [B >= 1 + A]         (?,1)
          6.  evalgcdbb7in(A,B)    -> evalgcdreturnin(A,B)     [B = A]              (?,1)
          7.  evalgcdbb4in(A,B)    -> evalgcdbb5in(A,B)        [A >= 1 + B]         (?,1)
          8.  evalgcdbb4in(A,B)    -> evalgcdbb6in(A,B)        [B >= A]             (?,1)
          9.  evalgcdbb5in(A,B)    -> evalgcdbb7in(A + -1*B,B) [-1 + A + -1*B >= 0] (?,1)
          10. evalgcdbb6in(A,B)    -> evalgcdbb7in(A,-1*A + B) [-1*A + B >= 0]      (?,1)
          11. evalgcdreturnin(A,B) -> evalgcdstop(A,B)         True                 (?,1)
        Signature:
          {(evalgcdbb4in,2)
          ;(evalgcdbb5in,2)
          ;(evalgcdbb6in,2)
          ;(evalgcdbb7in,2)
          ;(evalgcdentryin,2)
          ;(evalgcdreturnin,2)
          ;(evalgcdstart,2)
          ;(evalgcdstop,2)}
        Flow Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{7},5->{8},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:
          evalgcdstart(A,B)    -> evalgcdentryin(A,B)       True
          evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)      [0 >= A]
          evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)      [0 >= B]
          evalgcdentryin(A,B)  -> evalgcdbb7in(B,A)         [A >= 1 && B >= 1]
          evalgcdbb7in(A,B)    -> evalgcdbb4in(A,B)         [A >= 1 + B]
          evalgcdbb7in(A,B)    -> evalgcdbb4in(A,B)         [B >= 1 + A]
          evalgcdbb7in(A,B)    -> evalgcdreturnin(A,B)      [B = A]
          evalgcdbb4in(A,B)    -> evalgcdbb5in(A,B)         [A >= 1 + B]
          evalgcdbb4in(A,B)    -> evalgcdbb6in(A,B)         [B >= A]
          evalgcdbb5in(A,B)    -> evalgcdbb7in(A + -1*B,B)  [-1 + A + -1*B >= 0]
          evalgcdbb6in(A,B)    -> evalgcdbb7in(A,-1*A + B)  [-1*A + B >= 0]
          evalgcdreturnin(A,B) -> evalgcdstop(A,B)          True
        Signature:
          {(evalgcdbb4in,2)
          ;(evalgcdbb5in,2)
          ;(evalgcdbb6in,2)
          ;(evalgcdbb7in,2)
          ;(evalgcdentryin,2)
          ;(evalgcdreturnin,2)
          ;(evalgcdstart,2)
          ;(evalgcdstop,2)}
        Rule Graph:
          [0->{1,2,3},1->{11},2->{11},3->{4,5,6},4->{7},5->{8},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:
          evalgcdstart.0(A,B)     -> evalgcdentryin.1(A,B)       True
          evalgcdstart.0(A,B)     -> evalgcdentryin.2(A,B)       True
          evalgcdstart.0(A,B)     -> evalgcdentryin.3(A,B)       True
          evalgcdentryin.1(A,B)   -> evalgcdreturnin.11(A,B)     [0 >= A]
          evalgcdentryin.2(A,B)   -> evalgcdreturnin.11(A,B)     [0 >= B]
          evalgcdentryin.3(A,B)   -> evalgcdbb7in.4(B,A)         [A >= 1 && B >= 1]
          evalgcdentryin.3(A,B)   -> evalgcdbb7in.5(B,A)         [A >= 1 && B >= 1]
          evalgcdentryin.3(A,B)   -> evalgcdbb7in.6(B,A)         [A >= 1 && B >= 1]
          evalgcdbb7in.4(A,B)     -> evalgcdbb4in.7(A,B)         [A >= 1 + B]
          evalgcdbb7in.5(A,B)     -> evalgcdbb4in.8(A,B)         [B >= 1 + A]
          evalgcdbb7in.6(A,B)     -> evalgcdreturnin.11(A,B)     [B = A]
          evalgcdbb4in.7(A,B)     -> evalgcdbb5in.9(A,B)         [A >= 1 + B]
          evalgcdbb4in.8(A,B)     -> evalgcdbb6in.10(A,B)        [B >= A]
          evalgcdbb5in.9(A,B)     -> evalgcdbb7in.4(A + -1*B,B)  [-1 + A + -1*B >= 0]
          evalgcdbb5in.9(A,B)     -> evalgcdbb7in.5(A + -1*B,B)  [-1 + A + -1*B >= 0]
          evalgcdbb5in.9(A,B)     -> evalgcdbb7in.6(A + -1*B,B)  [-1 + A + -1*B >= 0]
          evalgcdbb6in.10(A,B)    -> evalgcdbb7in.4(A,-1*A + B)  [-1*A + B >= 0]
          evalgcdbb6in.10(A,B)    -> evalgcdbb7in.5(A,-1*A + B)  [-1*A + B >= 0]
          evalgcdbb6in.10(A,B)    -> evalgcdbb7in.6(A,-1*A + B)  [-1*A + B >= 0]
          evalgcdreturnin.11(A,B) -> evalgcdstop.12(A,B)         True
        Signature:
          {(evalgcdbb4in.7,2)
          ;(evalgcdbb4in.8,2)
          ;(evalgcdbb5in.9,2)
          ;(evalgcdbb6in.10,2)
          ;(evalgcdbb7in.4,2)
          ;(evalgcdbb7in.5,2)
          ;(evalgcdbb7in.6,2)
          ;(evalgcdentryin.1,2)
          ;(evalgcdentryin.2,2)
          ;(evalgcdentryin.3,2)
          ;(evalgcdreturnin.11,2)
          ;(evalgcdstart.0,2)
          ;(evalgcdstop.12,2)}
        Rule Graph:
          [0->{3},1->{4},2->{5,6,7},3->{19},4->{19},5->{8},6->{9},7->{10},8->{11},9->{12},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:
        evalgcdstart.0(A,B)     -> evalgcdentryin.1(A,B)       True
        evalgcdstart.0(A,B)     -> evalgcdentryin.2(A,B)       True
        evalgcdstart.0(A,B)     -> evalgcdentryin.3(A,B)       True
        evalgcdentryin.1(A,B)   -> evalgcdreturnin.11(A,B)     [0 >= A]
        evalgcdentryin.2(A,B)   -> evalgcdreturnin.11(A,B)     [0 >= B]
        evalgcdentryin.3(A,B)   -> evalgcdbb7in.4(B,A)         [A >= 1 && B >= 1]
        evalgcdentryin.3(A,B)   -> evalgcdbb7in.5(B,A)         [A >= 1 && B >= 1]
        evalgcdentryin.3(A,B)   -> evalgcdbb7in.6(B,A)         [A >= 1 && B >= 1]
        evalgcdbb7in.4(A,B)     -> evalgcdbb4in.7(A,B)         [A >= 1 + B]
        evalgcdbb7in.5(A,B)     -> evalgcdbb4in.8(A,B)         [B >= 1 + A]
        evalgcdbb7in.6(A,B)     -> evalgcdreturnin.11(A,B)     [B = A]
        evalgcdbb4in.7(A,B)     -> evalgcdbb5in.9(A,B)         [A >= 1 + B]
        evalgcdbb4in.8(A,B)     -> evalgcdbb6in.10(A,B)        [B >= A]
        evalgcdbb5in.9(A,B)     -> evalgcdbb7in.4(A + -1*B,B)  [-1 + A + -1*B >= 0]
        evalgcdbb5in.9(A,B)     -> evalgcdbb7in.5(A + -1*B,B)  [-1 + A + -1*B >= 0]
        evalgcdbb5in.9(A,B)     -> evalgcdbb7in.6(A + -1*B,B)  [-1 + A + -1*B >= 0]
        evalgcdbb6in.10(A,B)    -> evalgcdbb7in.4(A,-1*A + B)  [-1*A + B >= 0]
        evalgcdbb6in.10(A,B)    -> evalgcdbb7in.5(A,-1*A + B)  [-1*A + B >= 0]
        evalgcdbb6in.10(A,B)    -> evalgcdbb7in.6(A,-1*A + B)  [-1*A + B >= 0]
        evalgcdreturnin.11(A,B) -> evalgcdstop.12(A,B)         True
        evalgcdstop.12(A,B)     -> exitus616(A,B)              True
        evalgcdstop.12(A,B)     -> exitus616(A,B)              True
        evalgcdstop.12(A,B)     -> exitus616(A,B)              True
        evalgcdstop.12(A,B)     -> exitus616(A,B)              True
        evalgcdstop.12(A,B)     -> exitus616(A,B)              True
        evalgcdstop.12(A,B)     -> exitus616(A,B)              True
        evalgcdstop.12(A,B)     -> exitus616(A,B)              True
      Signature:
        {(evalgcdbb4in.7,2)
        ;(evalgcdbb4in.8,2)
        ;(evalgcdbb5in.9,2)
        ;(evalgcdbb6in.10,2)
        ;(evalgcdbb7in.4,2)
        ;(evalgcdbb7in.5,2)
        ;(evalgcdbb7in.6,2)
        ;(evalgcdentryin.1,2)
        ;(evalgcdentryin.2,2)
        ;(evalgcdentryin.3,2)
        ;(evalgcdreturnin.11,2)
        ;(evalgcdstart.0,2)
        ;(evalgcdstop.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->{11},9->{12},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,16,12,9,14,17] c: []
MAYBE