YES(?,POLY) * Step 1: UnsatRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (?,1) 4. lbl121(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [G >= C && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (?,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 9. lbl141(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [0 >= A && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{4,5,6},3->{},4->{10},5->{4,5,6},6->{7,8,9},7->{10},8->{4,5,6},9->{7,8,9},10->{},11->{0,1 ,2}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [4,9] * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (?,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (?,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{5,6},3->{},5->{5,6},6->{7,8},7->{10},8->{5,6},10->{},11->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(8,6)] * Step 3: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = A && E = F && G = H] (?,1) 1. start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] (?,1) 2. start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] (?,1) 3. lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] (?,1) 5. lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] (?,1) 6. lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] (?,1) 7. lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] (?,1) 8. lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] (?,1) 10. cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] (?,1) 11. start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True (1,1) Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Flow Graph: [0->{},1->{3},2->{5,6},3->{},5->{5,6},6->{7,8},7->{10},8->{5},10->{},11->{0,1,2}] + Applied Processor: FromIts + Details: () * Step 4: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: start(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = A && E = F && G = H] start(A,B,C,D,E,F,G,H) -> lbl6(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] start(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] lbl6(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] lbl121(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] lbl121(A,B,C,D,E,F,G,H) -> lbl141(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] lbl141(A,B,C,D,E,F,G,H) -> cut(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] lbl141(A,B,C,D,E,F,G,H) -> lbl121(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] cut(A,B,C,D,E,F,G,H) -> stop(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] start0(A,B,C,D,E,F,G,H) -> start(A,C,C,A,F,F,H,H) True Signature: {(cut,8);(lbl121,8);(lbl141,8);(lbl6,8);(start,8);(start0,8);(stop,8)} Rule Graph: [0->{},1->{3},2->{5,6},3->{},5->{5,6},6->{7,8},7->{10},8->{5},10->{},11->{0,1,2}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = A && E = F && G = H] start.1(A,B,C,D,E,F,G,H) -> lbl6.3(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] start.2(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] start.2(A,B,C,D,E,F,G,H) -> lbl121.6(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] lbl6.3(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] lbl121.5(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] lbl121.5(A,B,C,D,E,F,G,H) -> lbl121.6(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] lbl121.6(A,B,C,D,E,F,G,H) -> lbl141.7(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] lbl121.6(A,B,C,D,E,F,G,H) -> lbl141.8(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] lbl141.7(A,B,C,D,E,F,G,H) -> cut.10(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] lbl141.8(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] cut.10(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] start0.11(A,B,C,D,E,F,G,H) -> start.0(A,C,C,A,F,F,H,H) True start0.11(A,B,C,D,E,F,G,H) -> start.1(A,C,C,A,F,F,H,H) True start0.11(A,B,C,D,E,F,G,H) -> start.2(A,C,C,A,F,F,H,H) True Signature: {(cut.10,8) ;(lbl121.5,8) ;(lbl121.6,8) ;(lbl141.7,8) ;(lbl141.8,8) ;(lbl6.3,8) ;(start.0,8) ;(start.1,8) ;(start.2,8) ;(start0.11,8) ;(stop.12,8)} Rule Graph: [0->{},1->{4},2->{5,6},3->{7,8},4->{},5->{5,6},6->{7,8},7->{9},8->{10},9->{11},10->{5,6},11->{},12->{0} ,13->{1},14->{2,3}] + Applied Processor: AddSinks + Details: () * Step 6: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = A && E = F && G = H] start.1(A,B,C,D,E,F,G,H) -> lbl6.3(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] start.2(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] start.2(A,B,C,D,E,F,G,H) -> lbl121.6(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] lbl6.3(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] lbl121.5(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] lbl121.5(A,B,C,D,E,F,G,H) -> lbl121.6(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] lbl121.6(A,B,C,D,E,F,G,H) -> lbl141.7(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] lbl121.6(A,B,C,D,E,F,G,H) -> lbl141.8(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] lbl141.7(A,B,C,D,E,F,G,H) -> cut.10(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] lbl141.8(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] cut.10(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] start0.11(A,B,C,D,E,F,G,H) -> start.0(A,C,C,A,F,F,H,H) True start0.11(A,B,C,D,E,F,G,H) -> start.1(A,C,C,A,F,F,H,H) True start0.11(A,B,C,D,E,F,G,H) -> start.2(A,C,C,A,F,F,H,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True Signature: {(cut.10,8) ;(exitus616,8) ;(lbl121.5,8) ;(lbl121.6,8) ;(lbl141.7,8) ;(lbl141.8,8) ;(lbl6.3,8) ;(start.0,8) ;(start.1,8) ;(start.2,8) ;(start0.11,8) ;(stop.12,8)} Rule Graph: [0->{18},1->{4},2->{5,6},3->{7,8},4->{17},5->{5,6},6->{7,8},7->{9},8->{10},9->{11},10->{5,6},11->{15,16} ,12->{0},13->{1},14->{2,3}] + 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] | `- p:[5,10,8,6] c: [6,8,10] | `- p:[5] c: [5] * Step 7: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: start.0(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [0 >= A && B = C && D = A && E = F && G = H] start.1(A,B,C,D,E,F,G,H) -> lbl6.3(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && B = C && D = A && E = F && G = H] start.2(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] start.2(A,B,C,D,E,F,G,H) -> lbl121.6(A,B,C,D,1,F,0,H) [A >= 1 && C >= 1 + A && B = C && D = A && E = F && G = H] lbl6.3(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [A >= 1 && A >= C && G = H && E = F && D = A && B = C] lbl121.5(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] lbl121.5(A,B,C,D,E,F,G,H) -> lbl121.6(A,B,C,D,1 + E,F,G,H) [A >= 1 + E && C >= 1 + G && A + C >= 3 + G && A >= E && E >= 1 && G >= 0 && C >= 1 + A && D = A && B = C] lbl121.6(A,B,C,D,E,F,G,H) -> lbl141.7(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] lbl121.6(A,B,C,D,E,F,G,H) -> lbl141.8(A,B,C,D,0,F,1 + G,H) [C >= 1 + G && A + C >= 3 + G && A >= 1 && G >= 0 && C >= 1 + A && E = A && D = A && B = C] lbl141.7(A,B,C,D,E,F,G,H) -> cut.10(A,B,C,D,E,F,G,H) [A >= 2 && C >= 1 + A && C >= 1 && G = C && E = 0 && D = A && B = C] lbl141.8(A,B,C,D,E,F,G,H) -> lbl121.5(A,B,C,D,1 + E,F,G,H) [A >= 1 && C >= 1 + G && A >= 2 && C >= 1 + A && G >= 1 && C >= G && E = 0 && D = A && B = C] cut.10(A,B,C,D,E,F,G,H) -> stop.12(A,B,C,D,E,F,G,H) [C >= 1 + A && A >= 2 && E = 0 && G = C && D = A && B = C] start0.11(A,B,C,D,E,F,G,H) -> start.0(A,C,C,A,F,F,H,H) True start0.11(A,B,C,D,E,F,G,H) -> start.1(A,C,C,A,F,F,H,H) True start0.11(A,B,C,D,E,F,G,H) -> start.2(A,C,C,A,F,F,H,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True stop.12(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True Signature: {(cut.10,8) ;(exitus616,8) ;(lbl121.5,8) ;(lbl121.6,8) ;(lbl141.7,8) ;(lbl141.8,8) ;(lbl6.3,8) ;(start.0,8) ;(start.1,8) ;(start.2,8) ;(start0.11,8) ;(stop.12,8)} Rule Graph: [0->{18},1->{4},2->{5,6},3->{7,8},4->{17},5->{5,6},6->{7,8},7->{9},8->{10},9->{11},10->{5,6},11->{15,16} ,12->{0},13->{1},14->{2,3}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18] | `- p:[5,10,8,6] c: [6,8,10] | `- p:[5] c: [5]) + Applied Processor: AbstractSize Minimize + Details: () * Step 8: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,0.0,0.0.0] start.0 ~> stop.12 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start.1 ~> lbl6.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start.2 ~> lbl121.5 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= 0*K, H <= H] start.2 ~> lbl121.6 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= 0*K, H <= H] lbl6.3 ~> stop.12 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl121.5 ~> lbl121.5 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl121.5 ~> lbl121.6 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl121.6 ~> lbl141.7 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= C, H <= H] lbl121.6 ~> lbl141.8 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= C, H <= H] lbl141.7 ~> cut.10 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] lbl141.8 ~> lbl121.5 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= G, H <= H] cut.10 ~> stop.12 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] start0.11 ~> start.0 [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F, G <= H, H <= H] start0.11 ~> start.1 [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F, G <= H, H <= H] start0.11 ~> start.2 [A <= A, B <= C, C <= C, D <= A, E <= F, F <= F, G <= H, H <= H] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] stop.12 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0 <= K + B + C + G] lbl121.5 ~> lbl121.5 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] lbl141.8 ~> lbl121.5 [A <= A, B <= B, C <= C, D <= D, E <= K, F <= F, G <= G, H <= H] lbl121.6 ~> lbl141.8 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= C, H <= H] lbl121.5 ~> lbl121.6 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] + Loop: [0.0.0 <= A + E] lbl121.5 ~> lbl121.5 [A <= A, B <= B, C <= C, D <= D, E <= D, F <= F, G <= G, H <= H] + Applied Processor: AbstractFlow + Details: () * Step 9: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,0.0,0.0.0] start.0 ~> stop.12 [] start.1 ~> lbl6.3 [] start.2 ~> lbl121.5 [K ~=> E,K ~=> G] start.2 ~> lbl121.6 [K ~=> E,K ~=> G] lbl6.3 ~> stop.12 [] lbl121.5 ~> lbl121.5 [D ~=> E] lbl121.5 ~> lbl121.6 [D ~=> E] lbl121.6 ~> lbl141.7 [C ~=> G,K ~=> E] lbl121.6 ~> lbl141.8 [C ~=> G,K ~=> E] lbl141.7 ~> cut.10 [] lbl141.8 ~> lbl121.5 [K ~=> E] cut.10 ~> stop.12 [] start0.11 ~> start.0 [A ~=> D,C ~=> B,F ~=> E,H ~=> G] start0.11 ~> start.1 [A ~=> D,C ~=> B,F ~=> E,H ~=> G] start0.11 ~> start.2 [A ~=> D,C ~=> B,F ~=> E,H ~=> G] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] stop.12 ~> exitus616 [] + Loop: [B ~+> 0.0,C ~+> 0.0,G ~+> 0.0,K ~+> 0.0] lbl121.5 ~> lbl121.5 [D ~=> E] lbl141.8 ~> lbl121.5 [K ~=> E] lbl121.6 ~> lbl141.8 [C ~=> G,K ~=> E] lbl121.5 ~> lbl121.6 [D ~=> E] + Loop: [A ~+> 0.0.0,E ~+> 0.0.0] lbl121.5 ~> lbl121.5 [D ~=> E] + Applied Processor: Lare + Details: start0.11 ~> exitus616 [A ~=> D ,C ~=> B ,C ~=> G ,F ~=> E ,H ~=> G ,K ~=> E ,A ~+> 0.0.0 ,A ~+> tick ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,C ~*> 0.0 ,C ~*> tick ,K ~*> 0.0 ,K ~*> tick] + lbl121.6> [C ~=> G ,D ~=> E ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,C ~+> 0.0 ,C ~+> tick ,D ~+> 0.0.0 ,D ~+> tick ,G ~+> 0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,C ~*> tick ,D ~*> tick ,G ~*> tick ,K ~*> tick] lbl121.6> [C ~=> G ,D ~=> E ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,C ~+> 0.0 ,C ~+> tick ,D ~+> 0.0.0 ,D ~+> tick ,E ~+> 0.0.0 ,E ~+> tick ,G ~+> 0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,C ~*> tick ,D ~*> tick ,E ~*> tick ,G ~*> tick ,K ~*> tick] + lbl121.5> [D ~=> E,A ~+> 0.0.0,A ~+> tick,E ~+> 0.0.0,E ~+> tick,tick ~+> tick] YES(?,POLY)