MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalfstart(A,B) -> evalfentryin(A,B) True (1,1) 1. evalfentryin(A,B) -> evalfbb3in(B,A) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && 0 >= A] (?,1) 3. evalfbb3in(A,B) -> evalfbb4in(A,B) [-1 + B >= 0 && A >= 1] (?,1) 4. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + C] (?,1) 5. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= 1] (?,1) 6. evalfbb4in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 7. evalfbbin(A,B) -> evalfbb1in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B >= 1 + A] (?,1) 8. evalfbbin(A,B) -> evalfbb2in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= B] (?,1) 9. evalfbb1in(A,B) -> evalfbb3in(1 + A,B) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] (?,1) 10. evalfbb2in(A,B) -> evalfbb3in(A + -1*B,B) [A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B) -> evalfstop(A,B) [-1 + B >= 0] (?,1) Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbb4in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2)} Flow Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B) -> evalfentryin(A,B) True (1,1) 1. evalfentryin(A,B) -> evalfbb3in(B,A) [A >= 1 && B >= 1 + A] (1,1) 2. evalfbb3in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && 0 >= A] (1,1) 3. evalfbb3in(A,B) -> evalfbb4in(A,B) [-1 + B >= 0 && A >= 1] (?,1) 4. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + C] (?,1) 5. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= 1] (?,1) 6. evalfbb4in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (1,1) 7. evalfbbin(A,B) -> evalfbb1in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B >= 1 + A] (?,1) 8. evalfbbin(A,B) -> evalfbb2in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= B] (?,1) 9. evalfbb1in(A,B) -> evalfbb3in(1 + A,B) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] (?,1) 10. evalfbb2in(A,B) -> evalfbb3in(A + -1*B,B) [A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B) -> evalfstop(A,B) [-1 + B >= 0] (1,1) Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbb4in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2)} Flow Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(9,2)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. evalfstart(A,B) -> evalfentryin(A,B) True (1,1) 1. evalfentryin(A,B) -> evalfbb3in(B,A) [A >= 1 && B >= 1 + A] (1,1) 2. evalfbb3in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && 0 >= A] (1,1) 3. evalfbb3in(A,B) -> evalfbb4in(A,B) [-1 + B >= 0 && A >= 1] (?,1) 4. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + C] (?,1) 5. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= 1] (?,1) 6. evalfbb4in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (1,1) 7. evalfbbin(A,B) -> evalfbb1in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B >= 1 + A] (?,1) 8. evalfbbin(A,B) -> evalfbb2in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= B] (?,1) 9. evalfbb1in(A,B) -> evalfbb3in(1 + A,B) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] (?,1) 10. evalfbb2in(A,B) -> evalfbb3in(A + -1*B,B) [A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B) -> evalfstop(A,B) [-1 + B >= 0] (1,1) Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbb4in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2)} Flow Graph: [0->{1},1->{3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{3},10->{2,3},11->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B) -> evalfentryin(A,B) True (1,1) 1. evalfentryin(A,B) -> evalfbb3in(B,A) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && 0 >= A] (?,1) 3. evalfbb3in(A,B) -> evalfbb4in(A,B) [-1 + B >= 0 && A >= 1] (?,1) 4. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + C] (?,1) 5. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= 1] (?,1) 6. evalfbb4in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 7. evalfbbin(A,B) -> evalfbb1in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B >= 1 + A] (?,1) 8. evalfbbin(A,B) -> evalfbb2in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= B] (?,1) 9. evalfbb1in(A,B) -> evalfbb3in(1 + A,B) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] (?,1) 10. evalfbb2in(A,B) -> evalfbb3in(A + -1*B,B) [A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B) -> evalfstop(A,B) [-1 + B >= 0] (?,1) 12. evalfreturnin(A,B) -> exitus616(A,B) True (?,1) Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbb4in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{2,3},2->{11,12},3->{4,5,6},4->{7,8},5->{7,8},6->{11,12},7->{9},8->{10},9->{2,3},10->{2,3} ,11->{},12->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(9,2)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. evalfstart(A,B) -> evalfentryin(A,B) True (1,1) 1. evalfentryin(A,B) -> evalfbb3in(B,A) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && 0 >= A] (?,1) 3. evalfbb3in(A,B) -> evalfbb4in(A,B) [-1 + B >= 0 && A >= 1] (?,1) 4. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && 0 >= 1 + C] (?,1) 5. evalfbb4in(A,B) -> evalfbbin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && C >= 1] (?,1) 6. evalfbb4in(A,B) -> evalfreturnin(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 7. evalfbbin(A,B) -> evalfbb1in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B >= 1 + A] (?,1) 8. evalfbbin(A,B) -> evalfbb2in(A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= B] (?,1) 9. evalfbb1in(A,B) -> evalfbb3in(1 + A,B) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] (?,1) 10. evalfbb2in(A,B) -> evalfbb3in(A + -1*B,B) [A + -1*B >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] (?,1) 11. evalfreturnin(A,B) -> evalfstop(A,B) [-1 + B >= 0] (?,1) 12. evalfreturnin(A,B) -> exitus616(A,B) True (?,1) Signature: {(evalfbb1in,2) ;(evalfbb2in,2) ;(evalfbb3in,2) ;(evalfbb4in,2) ;(evalfbbin,2) ;(evalfentryin,2) ;(evalfreturnin,2) ;(evalfstart,2) ;(evalfstop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{3},2->{11,12},3->{4,5,6},4->{7,8},5->{7,8},6->{11,12},7->{9},8->{10},9->{3},10->{2,3},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,9,7,4,5,10,8] c: [] MAYBE