YES(?,O(1)) * Step 1: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True (1,1) 1. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && A = B && C = D && E = F] 2. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && A = B && C = D && E = F] 3. start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A = 0 && B = 0 && C = D && E = F] 4. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 (?,1) && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] 5. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 (?,1) && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] 6. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [-1 + E >= 0 (?,1) && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] 7. lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-2 + E >= 0 (?,1) && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] 8. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-1 + E >= 0 (?,1) && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && E = 40 && C = 100 && A = 0 && B = 0] Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{1,2,3},1->{4,5,7},2->{4,5,7},3->{6,8},4->{4,5,7},5->{4,5,7},6->{6,8},7->{},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,5),(1,7),(2,4),(2,7),(3,8),(4,5),(5,4)] * Step 2: FromIts WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True (1,1) 1. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && A = B && C = D && E = F] 2. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && A = B && C = D && E = F] 3. start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A = 0 && B = 0 && C = D && E = F] 4. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 (?,1) && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] 5. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 (?,1) && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] 6. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [-1 + E >= 0 (?,1) && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] 7. lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-2 + E >= 0 (?,1) && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] 8. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-1 + E >= 0 (?,1) && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && E = 40 && C = 100 && A = 0 && B = 0] Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{1,2,3},1->{4},2->{5},3->{6},4->{4,7},5->{5,7},6->{6,8},7->{},8->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A = 0 && B = 0 && C = D && E = F] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [-1 + E >= 0 && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-1 + E >= 0 && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && E = 40 && C = 100 && A = 0 && B = 0] Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Rule Graph: [0->{1,2,3},1->{4},2->{5},3->{6},4->{4,7},5->{5,7},6->{6,8},7->{},8->{}] + Applied Processor: AddSinks + Details: () * Step 4: Decompose WORST_CASE(?,O(1)) + Considered Problem: Rules: start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A = 0 && B = 0 && C = D && E = F] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [-1 + E >= 0 && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-1 + E >= 0 && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && E = 40 && C = 100 && A = 0 && B = 0] stop(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(exitus616,6);(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Rule Graph: [0->{1,2,3},1->{4},2->{5},3->{6},4->{4,7},5->{5,7},6->{6,8},7->{10,11},8->{9}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | +- p:[6] c: [6] | +- p:[5] c: [5] | `- p:[4] c: [4] * Step 5: AbstractSize WORST_CASE(?,O(1)) + Considered Problem: (Rules: start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [E + -1*F >= 0 && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A = 0 && B = 0 && C = D && E = F] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [-1 + E >= 0 && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-2 + E >= 0 && -102 + C + E >= 0 && 98 + -1*C + E >= 0 && 100 + -1*C >= 0 && -100 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [-1 + E >= 0 && -101 + C + E >= 0 && 99 + -1*C + E >= 0 && -1 + B + E >= 0 && -1 + -1*B + E >= 0 && -1 + A + E >= 0 && -1 + -1*A + E >= 0 && 100 + -1*C >= 0 && 100 + B + -1*C >= 0 && 100 + -1*B + -1*C >= 0 && 100 + A + -1*C >= 0 && 100 + -1*A + -1*C >= 0 && -100 + C >= 0 && -100 + B + C >= 0 && -100 + -1*B + C >= 0 && -100 + A + C >= 0 && -100 + -1*A + C >= 0 && -1*B >= 0 && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && E = 40 && C = 100 && A = 0 && B = 0] stop(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(exitus616,6);(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Rule Graph: [0->{1,2,3},1->{4},2->{5},3->{6},4->{4,7},5->{5,7},6->{6,8},7->{10,11},8->{9}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | +- p:[6] c: [6] | +- p:[5] c: [5] | `- p:[4] c: [4]) + Applied Processor: AbstractSize Minimize + Details: () * Step 6: AbstractFlow WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [A,B,C,D,E,F,0.0,0.1,0.2] start0 ~> start [A <= B, B <= B, C <= D, D <= D, E <= F, F <= F] start ~> lbl111 [A <= A, B <= B, C <= 100*K, D <= D, E <= 2*K, F <= F] start ~> lbl111 [A <= A, B <= B, C <= 100*K, D <= D, E <= 2*K, F <= F] start ~> lbl91 [A <= A, B <= B, C <= 100*K, D <= D, E <= K, F <= F] lbl111 ~> lbl111 [A <= A, B <= B, C <= C, D <= D, E <= 41*K, F <= F] lbl111 ~> lbl111 [A <= A, B <= B, C <= C, D <= D, E <= 41*K, F <= F] lbl91 ~> lbl91 [A <= A, B <= B, C <= C, D <= D, E <= 40*K, F <= F] lbl111 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl91 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0 <= 40*K + E] lbl91 ~> lbl91 [A <= A, B <= B, C <= C, D <= D, E <= 40*K, F <= F] + Loop: [0.1 <= 219*K + C + E] lbl111 ~> lbl111 [A <= A, B <= B, C <= C, D <= D, E <= 41*K, F <= F] + Loop: [0.2 <= 219*K + C + E] lbl111 ~> lbl111 [A <= A, B <= B, C <= C, D <= D, E <= 41*K, F <= F] + Applied Processor: AbstractFlow + Details: () * Step 7: Lare WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.1,0.2] start0 ~> start [B ~=> A,D ~=> C,F ~=> E] start ~> lbl111 [K ~=> C,K ~=> E] start ~> lbl111 [K ~=> C,K ~=> E] start ~> lbl91 [K ~=> C,K ~=> E] lbl111 ~> lbl111 [K ~=> E] lbl111 ~> lbl111 [K ~=> E] lbl91 ~> lbl91 [K ~=> E] lbl111 ~> stop [] lbl91 ~> stop [] stop ~> exitus616 [] stop ~> exitus616 [] stop ~> exitus616 [] + Loop: [E ~+> 0.0,K ~*> 0.0] lbl91 ~> lbl91 [K ~=> E] + Loop: [C ~+> 0.1,E ~+> 0.1,K ~*> 0.1] lbl111 ~> lbl111 [K ~=> E] + Loop: [C ~+> 0.2,E ~+> 0.2,K ~*> 0.2] lbl111 ~> lbl111 [K ~=> E] + Applied Processor: Lare + Details: start0 ~> exitus616 [B ~=> A ,K ~=> C ,K ~=> E ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.2 ,K ~+> tick ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.2 ,K ~*> tick] + lbl91> [K ~=> E,E ~+> 0.0,E ~+> tick,tick ~+> tick,K ~*> 0.0,K ~*> tick] + lbl111> [K ~=> E ,C ~+> 0.1 ,C ~+> tick ,E ~+> 0.1 ,E ~+> tick ,tick ~+> tick ,K ~*> 0.1 ,K ~*> tick] + lbl111> [K ~=> E ,C ~+> 0.2 ,C ~+> tick ,E ~+> 0.2 ,E ~+> tick ,tick ~+> tick ,K ~*> 0.2 ,K ~*> tick] YES(?,O(1))