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