NO
* Step 1: TrivialSCCs NO
    + 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:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths NO
    + Considered Problem:
        Rules:
          0.  evalgcdstart(A,B)    -> evalgcdentryin(A,B)      True                 (1,1)
          1.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= A]             (1,1)
          2.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= B]             (1,1)
          3.  evalgcdentryin(A,B)  -> evalgcdbb7in(B,A)        [A >= 1 && B >= 1]   (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,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,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 3: Looptree NO
    + Considered Problem:
        Rules:
          0.  evalgcdstart(A,B)    -> evalgcdentryin(A,B)      True                 (1,1)
          1.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= A]             (1,1)
          2.  evalgcdentryin(A,B)  -> evalgcdreturnin(A,B)     [0 >= B]             (1,1)
          3.  evalgcdentryin(A,B)  -> evalgcdbb7in(B,A)        [A >= 1 && B >= 1]   (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,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,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:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10,11]
          |
          `- p:[4,9,7,10,8,5] c: []

NO