MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalcyclicstart(A,B,C) -> evalcyclicentryin(A,B,C) True (1,1) 1. evalcyclicentryin(A,B,C) -> evalcyclicbb3in(A,B,1 + A) [A >= 0 && B >= 1 + A] (?,1) 2. evalcyclicbb3in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C = A] (?,1) 3. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && A >= 1 + C] (?,1) 4. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + A] (?,1) 5. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + D] (?,1) 6. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1] (?,1) 7. evalcyclicbb4in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 8. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,1 + C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= C] (?,1) 9. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,0) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + B] (?,1) 10. evalcyclicreturnin(A,B,C) -> evalcyclicstop(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) Signature: {(evalcyclicbb3in,3) ;(evalcyclicbb4in,3) ;(evalcyclicbbin,3) ;(evalcyclicentryin,3) ;(evalcyclicreturnin,3) ;(evalcyclicstart,3) ;(evalcyclicstop,3)} Flow Graph: [0->{1},1->{2,3,4},2->{10},3->{5,6,7},4->{5,6,7},5->{8,9},6->{8,9},7->{10},8->{2,3,4},9->{2,3,4},10->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalcyclicstart(A,B,C) -> evalcyclicentryin(A,B,C) True (1,1) 1. evalcyclicentryin(A,B,C) -> evalcyclicbb3in(A,B,1 + A) [A >= 0 && B >= 1 + A] (1,1) 2. evalcyclicbb3in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C = A] (1,1) 3. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && A >= 1 + C] (?,1) 4. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + A] (?,1) 5. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + D] (?,1) 6. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1] (?,1) 7. evalcyclicbb4in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (1,1) 8. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,1 + C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= C] (?,1) 9. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,0) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + B] (?,1) 10. evalcyclicreturnin(A,B,C) -> evalcyclicstop(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (1,1) Signature: {(evalcyclicbb3in,3) ;(evalcyclicbb4in,3) ;(evalcyclicbbin,3) ;(evalcyclicentryin,3) ;(evalcyclicreturnin,3) ;(evalcyclicstart,3) ;(evalcyclicstop,3)} Flow Graph: [0->{1},1->{2,3,4},2->{10},3->{5,6,7},4->{5,6,7},5->{8,9},6->{8,9},7->{10},8->{2,3,4},9->{2,3,4},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(1,3),(9,4)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. evalcyclicstart(A,B,C) -> evalcyclicentryin(A,B,C) True (1,1) 1. evalcyclicentryin(A,B,C) -> evalcyclicbb3in(A,B,1 + A) [A >= 0 && B >= 1 + A] (1,1) 2. evalcyclicbb3in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C = A] (1,1) 3. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && A >= 1 + C] (?,1) 4. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + A] (?,1) 5. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + D] (?,1) 6. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1] (?,1) 7. evalcyclicbb4in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (1,1) 8. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,1 + C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= C] (?,1) 9. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,0) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + B] (?,1) 10. evalcyclicreturnin(A,B,C) -> evalcyclicstop(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (1,1) Signature: {(evalcyclicbb3in,3) ;(evalcyclicbb4in,3) ;(evalcyclicbbin,3) ;(evalcyclicentryin,3) ;(evalcyclicreturnin,3) ;(evalcyclicstart,3) ;(evalcyclicstop,3)} Flow Graph: [0->{1},1->{4},2->{10},3->{5,6,7},4->{5,6,7},5->{8,9},6->{8,9},7->{10},8->{2,3,4},9->{2,3},10->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalcyclicstart(A,B,C) -> evalcyclicentryin(A,B,C) True (1,1) 1. evalcyclicentryin(A,B,C) -> evalcyclicbb3in(A,B,1 + A) [A >= 0 && B >= 1 + A] (?,1) 2. evalcyclicbb3in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C = A] (?,1) 3. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && A >= 1 + C] (?,1) 4. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + A] (?,1) 5. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + D] (?,1) 6. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1] (?,1) 7. evalcyclicbb4in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 8. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,1 + C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= C] (?,1) 9. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,0) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + B] (?,1) 10. evalcyclicreturnin(A,B,C) -> evalcyclicstop(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 11. evalcyclicreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalcyclicbb3in,3) ;(evalcyclicbb4in,3) ;(evalcyclicbbin,3) ;(evalcyclicentryin,3) ;(evalcyclicreturnin,3) ;(evalcyclicstart,3) ;(evalcyclicstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2,3,4},2->{10,11},3->{5,6,7},4->{5,6,7},5->{8,9},6->{8,9},7->{10,11},8->{2,3,4},9->{2,3,4} ,10->{},11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(1,3),(9,4)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. evalcyclicstart(A,B,C) -> evalcyclicentryin(A,B,C) True (1,1) 1. evalcyclicentryin(A,B,C) -> evalcyclicbb3in(A,B,1 + A) [A >= 0 && B >= 1 + A] (?,1) 2. evalcyclicbb3in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C = A] (?,1) 3. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && A >= 1 + C] (?,1) 4. evalcyclicbb3in(A,B,C) -> evalcyclicbb4in(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + A] (?,1) 5. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + D] (?,1) 6. evalcyclicbb4in(A,B,C) -> evalcyclicbbin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1] (?,1) 7. evalcyclicbb4in(A,B,C) -> evalcyclicreturnin(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 8. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,1 + C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && B >= C] (?,1) 9. evalcyclicbbin(A,B,C) -> evalcyclicbb3in(A,B,0) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= 1 + B] (?,1) 10. evalcyclicreturnin(A,B,C) -> evalcyclicstop(A,B,C) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 11. evalcyclicreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalcyclicbb3in,3) ;(evalcyclicbb4in,3) ;(evalcyclicbbin,3) ;(evalcyclicentryin,3) ;(evalcyclicreturnin,3) ;(evalcyclicstart,3) ;(evalcyclicstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{4},2->{10,11},3->{5,6,7},4->{5,6,7},5->{8,9},6->{8,9},7->{10,11},8->{2,3,4},9->{2,3},10->{} ,11->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | `- p:[4,8,5,3,9,6] c: [] MAYBE