YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,D,H) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> cut(A,0,C,D,1,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 4. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 5. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,-1 + E,F,-1 + G,H) [G >= 2 && E >= 2 && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 6. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,-1 + E,F,-1 + G,H) [E >= 2 && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 7. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + G,H) [G >= 2 && 1 >= E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 8. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + G,H) [1 >= E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 9. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,1 + E,F,-1 + G,H) [G >= 2 && A >= 2 + E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,1 + E,F,-1 + G,H) [A >= 2 + E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 11. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,0,F,-1 + G,H) [G >= 2 && 1 + E >= A && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 12. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,0,F,-1 + G,H) [A >= 1 && A >= 2 && G = 1 && 1 + E = A && D = A] (?,1) 13. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{5,6,7,8,9,10,11,12},2->{},3->{5,6,7,8,9,10,11,12},4->{},5->{5,6,7,8,9,10,11,12},6->{},7->{5,6,7 ,8,9,10,11,12},8->{},9->{5,6,7,8,9,10,11,12},10->{},11->{5,6,7,8,9,10,11,12},12->{},13->{0,1,2,3,4}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,D,H) [0 >= A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (1,1) 3. start(A,B,C,D,E,F,G,H) -> cut(A,0,C,D,1,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (1,1) 4. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (1,1) 5. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,-1 + E,F,-1 + G,H) [G >= 2 && E >= 2 && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 6. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,-1 + E,F,-1 + G,H) [E >= 2 && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 7. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + G,H) [G >= 2 && 1 >= E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 8. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + G,H) [1 >= E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 9. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,1 + E,F,-1 + G,H) [G >= 2 && A >= 2 + E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,1 + E,F,-1 + G,H) [A >= 2 + E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 11. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,0,F,-1 + G,H) [G >= 2 && 1 + E >= A && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 12. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,0,F,-1 + G,H) [A >= 1 && A >= 2 && G = 1 && 1 + E = A && D = A] (1,1) 13. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{5,6,7,8,9,10,11,12},2->{},3->{5,6,7,8,9,10,11,12},4->{},5->{5,6,7,8,9,10,11,12},6->{},7->{5,6,7 ,8,9,10,11,12},8->{},9->{5,6,7,8,9,10,11,12},10->{},11->{5,6,7,8,9,10,11,12},12->{},13->{0,1,2,3,4}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [11] * Step 3: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,D,H) [0 >= A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (1,1) 3. start(A,B,C,D,E,F,G,H) -> cut(A,0,C,D,1,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (1,1) 4. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (1,1) 5. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,-1 + E,F,-1 + G,H) [G >= 2 && E >= 2 && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 6. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,-1 + E,F,-1 + G,H) [E >= 2 && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 7. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + G,H) [G >= 2 && 1 >= E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 8. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + G,H) [1 >= E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 9. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,1 + E,F,-1 + G,H) [G >= 2 && A >= 2 + E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,1 + E,F,-1 + G,H) [A >= 2 + E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 12. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,0,F,-1 + G,H) [A >= 1 && A >= 2 && G = 1 && 1 + E = A && D = A] (1,1) 13. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{5,6,7,8,9,10,12},2->{},3->{5,6,7,8,9,10,12},4->{},5->{5,6,7,8,9,10,12},6->{},7->{5,6,7,8,9,10 ,12},8->{},9->{5,6,7,8,9,10,12},10->{},12->{},13->{0,1,2,3,4}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,5) ,(1,6) ,(1,12) ,(3,5) ,(3,6) ,(3,10) ,(5,12) ,(7,5) ,(7,6) ,(7,12)] * Step 4: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,D,H) [0 >= A && B = C && D = A && E = F && G = H] (1,1) 1. start(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (1,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (1,1) 3. start(A,B,C,D,E,F,G,H) -> cut(A,0,C,D,1,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (1,1) 4. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (1,1) 5. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,-1 + E,F,-1 + G,H) [G >= 2 && E >= 2 && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 6. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,-1 + E,F,-1 + G,H) [E >= 2 && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 7. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + G,H) [G >= 2 && 1 >= E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 8. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + G,H) [1 >= E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 9. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,1 + E,F,-1 + G,H) [G >= 2 && A >= 2 + E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,1 + E,F,-1 + G,H) [A >= 2 + E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (1,1) 12. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,0,F,-1 + G,H) [A >= 1 && A >= 2 && G = 1 && 1 + E = A && D = A] (1,1) 13. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{7,8,9,10},2->{},3->{7,8,9,12},4->{},5->{5,6,7,8,9,10},6->{},7->{7,8,9,10},8->{},9->{5,6,7,8,9 ,10,12},10->{},12->{},13->{0,1,2,3,4}] + Applied Processor: AddSinks + Details: () * Step 5: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,D,H) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> cut(A,0,C,D,1,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 4. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 5. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,-1 + E,F,-1 + G,H) [G >= 2 && E >= 2 && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 6. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,-1 + E,F,-1 + G,H) [E >= 2 && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 7. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + G,H) [G >= 2 && 1 >= E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 8. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + G,H) [1 >= E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 9. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,1 + E,F,-1 + G,H) [G >= 2 && A >= 2 + E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,1 + E,F,-1 + G,H) [A >= 2 + E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 12. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,0,F,-1 + G,H) [A >= 1 && A >= 2 && G = 1 && 1 + E = A && D = A] (?,1) 13. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 15. cut(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(cut,8);(exitus616,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{5,6,7,8,9,10,12,15},2->{},3->{5,6,7,8,9,10,12,15},4->{},5->{5,6,7,8,9,10,12,15},6->{},7->{5,6,7 ,8,9,10,12,15},8->{},9->{5,6,7,8,9,10,12,15},10->{},12->{},13->{0,1,2,3,4,14},14->{},15->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,5) ,(1,6) ,(1,12) ,(3,5) ,(3,6) ,(3,10) ,(5,12) ,(7,5) ,(7,6) ,(7,12)] * Step 6: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,D,H) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> cut(A,0,C,D,1,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 4. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 5. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,-1 + E,F,-1 + G,H) [G >= 2 && E >= 2 && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 6. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,-1 + E,F,-1 + G,H) [E >= 2 && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 7. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + G,H) [G >= 2 && 1 >= E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 8. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + G,H) [1 >= E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 9. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,1 + E,F,-1 + G,H) [G >= 2 && A >= 2 + E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,1 + E,F,-1 + G,H) [A >= 2 + E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 12. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,0,F,-1 + G,H) [A >= 1 && A >= 2 && G = 1 && 1 + E = A && D = A] (?,1) 13. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 15. cut(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(cut,8);(exitus616,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{7,8,9,10,15},2->{},3->{7,8,9,12,15},4->{},5->{5,6,7,8,9,10,15},6->{},7->{7,8,9,10,15},8->{} ,9->{5,6,7,8,9,10,12,15},10->{},12->{},13->{0,1,2,3,4,14},14->{},15->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,12,13,14,15] | `- p:[7,5,9] c: [9] | +- p:[5] c: [5] | `- p:[7] c: [7] * Step 7: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,D,H) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 3. start(A,B,C,D,E,F,G,H) -> cut(A,0,C,D,1,F,-1 + D,H) [A >= 2 && B = C && D = A && E = F && G = H] (?,1) 4. start(A,B,C,D,E,F,G,H) -> stop(A,0,C,D,0,F,-1 + D,H) [D = 1 && B = C && A = 1 && E = F && G = H] (?,1) 5. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,-1 + E,F,-1 + G,H) [G >= 2 && E >= 2 && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 6. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,-1 + E,F,-1 + G,H) [E >= 2 && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 7. cut(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,0,F,-1 + G,H) [G >= 2 && 1 >= E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 8. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,0,F,-1 + G,H) [1 >= E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 9. cut(A,B,C,D,E,F,G,H) -> cut(A,E,C,D,1 + E,F,-1 + G,H) [G >= 2 && A >= 2 + E && G >= 1 && E >= 0 && A >= 1 + G && A >= E + G && D = A] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,1 + E,F,-1 + G,H) [A >= 2 + E && E >= 0 && A >= 2 && A >= 1 + E && G = 1 && D = A] (?,1) 12. cut(A,B,C,D,E,F,G,H) -> stop(A,E,C,D,0,F,-1 + G,H) [A >= 1 && A >= 2 && G = 1 && 1 + E = A && D = A] (?,1) 13. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) 14. start(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) 15. cut(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(cut,8);(exitus616,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{7,8,9,10,15},2->{},3->{7,8,9,12,15},4->{},5->{5,6,7,8,9,10,15},6->{},7->{7,8,9,10,15},8->{} ,9->{5,6,7,8,9,10,12,15},10->{},12->{},13->{0,1,2,3,4,14},14->{},15->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,12,13,14,15] | `- p:[7,5,9] c: [9] | +- p:[5] c: [5] | `- p:[7] c: [7]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 8: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,0.0,0.0.0,0.0.1] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= D, H <= H] start ~> cut [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= D, H <= H] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= 0*K, H <= H] start ~> cut [A <= A, B <= 0*K, C <= C, D <= D, E <= K, F <= F, G <= D, H <= H] start ~> stop [A <= A, B <= 0*K, C <= C, D <= D, E <= 0*K, F <= F, G <= 0*K, H <= H] cut ~> cut [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= D, H <= H] cut ~> stop [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= 0*K, H <= H] cut ~> cut [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= A, H <= H] cut ~> stop [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= 0*K, H <= H] cut ~> cut [A <= A, B <= E, C <= C, D <= D, E <= D, F <= F, G <= D, H <= H] cut ~> stop [A <= A, B <= E, C <= C, D <= D, E <= D, F <= F, G <= 0*K, H <= H] cut ~> stop [A <= A, B <= E, C <= C, D <= D, E <= 0*K, F <= F, G <= 0*K, H <= H] start0 ~> start [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F, G <= H, H <= H] start ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] cut ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0 <= G] cut ~> cut [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= A, H <= H] cut ~> cut [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= D, H <= H] cut ~> cut [A <= A, B <= E, C <= C, D <= D, E <= D, F <= F, G <= D, H <= H] + Loop: [0.0.0 <= K + E] cut ~> cut [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= D, H <= H] + Loop: [0.0.1 <= G] cut ~> cut [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= A, H <= H] + Applied Processor: FlowAbstraction + Details: () * Step 9: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,0.0,0.0.0,0.0.1] start ~> stop [D ~=> G,K ~=> E] start ~> cut [D ~=> G,K ~=> E] start ~> stop [K ~=> E,K ~=> G] start ~> cut [D ~=> G,K ~=> B,K ~=> E] start ~> stop [K ~=> B,K ~=> E,K ~=> G] cut ~> cut [D ~=> E,D ~=> G] cut ~> stop [D ~=> E,K ~=> G] cut ~> cut [A ~=> G,K ~=> E] cut ~> stop [K ~=> E,K ~=> G] cut ~> cut [D ~=> E,D ~=> G,E ~=> B] cut ~> stop [D ~=> E,E ~=> B,K ~=> G] cut ~> stop [E ~=> B,K ~=> E,K ~=> G] start0 ~> start [A ~=> D,C ~=> B,F ~=> E,H ~=> G] start ~> exitus616 [] cut ~> exitus616 [] + Loop: [G ~=> 0.0] cut ~> cut [A ~=> G,K ~=> E] cut ~> cut [D ~=> E,D ~=> G] cut ~> cut [D ~=> E,D ~=> G,E ~=> B] + Loop: [E ~+> 0.0.0,K ~+> 0.0.0] cut ~> cut [D ~=> E,D ~=> G] + Loop: [G ~=> 0.0.1] cut ~> cut [A ~=> G,K ~=> E] + Applied Processor: LareProcessor + Details: start0 ~> stop [A ~=> B ,A ~=> D ,A ~=> E ,A ~=> G ,A ~=> 0.0 ,A ~=> 0.0.1 ,C ~=> B ,K ~=> B ,K ~=> E ,K ~=> G ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] start0 ~> exitus616 [A ~=> D ,A ~=> E ,A ~=> G ,A ~=> 0.0 ,A ~=> 0.0.1 ,C ~=> B ,F ~=> E ,H ~=> G ,K ~=> B ,K ~=> E ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,K ~*> 0.0.0 ,K ~*> tick] + cut> [A ~=> G ,D ~=> E ,D ~=> G ,E ~=> B ,G ~=> 0.0 ,G ~=> 0.0.1 ,K ~=> E ,E ~+> 0.0.0 ,E ~+> tick ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,G ~*> tick] + cut> [D ~=> E,D ~=> G,E ~+> 0.0.0,E ~+> tick,tick ~+> tick,K ~+> 0.0.0,K ~+> tick] + cut> [A ~=> G,G ~=> 0.0.1,K ~=> E,G ~+> tick,tick ~+> tick] YES(?,POLY)