YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,0,M,N) [1 >= A && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,0,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,1,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 3. lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl13(A,L,C,D,E,F,G,H,I,J,K,1 + L,M,N) [D >= H && D >= 1 && 1 + H >= D && A >= 1 + D && N = A && 1 + L = D && J = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl91(A,B,C,D,E,O,G,H,I,J,K,L,M,N) [D >= H && D >= 1 && A >= 1 + D && 1 + H >= D && J = A && 1 + L = D && N = A] (?,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,H,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,J,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 7. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N) [2 + H >= A && A >= 2 && A >= 1 + H && 1 + L = A && 2 + B = A && 1 + D = A && N = A && J = A] (?,1) 8. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,1 + L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 10. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> start(A,C,C,E,E,G,G,I,I,K,K,M,M,A) True (1,1) Signature: {(lbl13,14);(lbl53,14);(lbl91,14);(start,14);(start0,14);(stop,14)} Flow Graph: [0->{},1->{4,5,6},2->{4,5,6},3->{7,8,9},4->{3},5->{4,5,6},6->{4,5,6},7->{},8->{4,5,6},9->{4,5,6},10->{0,1 ,2}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,0,M,N) [1 >= A && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,0,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,1,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (1,1) 3. lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl13(A,L,C,D,E,F,G,H,I,J,K,1 + L,M,N) [D >= H && D >= 1 && 1 + H >= D && A >= 1 + D && N = A && 1 + L = D && J = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl91(A,B,C,D,E,O,G,H,I,J,K,L,M,N) [D >= H && D >= 1 && A >= 1 + D && 1 + H >= D && J = A && 1 + L = D && N = A] (?,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,H,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,J,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 7. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N) [2 + H >= A && A >= 2 && A >= 1 + H && 1 + L = A && 2 + B = A && 1 + D = A && N = A && J = A] (1,1) 8. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,1 + L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 10. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> start(A,C,C,E,E,G,G,I,I,K,K,M,M,A) True (1,1) Signature: {(lbl13,14);(lbl53,14);(lbl91,14);(start,14);(start0,14);(stop,14)} Flow Graph: [0->{},1->{4,5,6},2->{4,5,6},3->{7,8,9},4->{3},5->{4,5,6},6->{4,5,6},7->{},8->{4,5,6},9->{4,5,6},10->{0,1 ,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(5,4),(5,5),(5,6),(6,4),(6,5),(6,6)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,0,M,N) [1 >= A && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,0,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,1,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (1,1) 3. lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl13(A,L,C,D,E,F,G,H,I,J,K,1 + L,M,N) [D >= H && D >= 1 && 1 + H >= D && A >= 1 + D && N = A && 1 + L = D && J = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl91(A,B,C,D,E,O,G,H,I,J,K,L,M,N) [D >= H && D >= 1 && A >= 1 + D && 1 + H >= D && J = A && 1 + L = D && N = A] (?,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,H,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,J,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 7. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N) [2 + H >= A && A >= 2 && A >= 1 + H && 1 + L = A && 2 + B = A && 1 + D = A && N = A && J = A] (1,1) 8. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,1 + L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 10. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> start(A,C,C,E,E,G,G,I,I,K,K,M,M,A) True (1,1) Signature: {(lbl13,14);(lbl53,14);(lbl91,14);(start,14);(start0,14);(stop,14)} Flow Graph: [0->{},1->{4,5,6},2->{4,5,6},3->{7,8,9},4->{3},5->{},6->{},7->{},8->{4,5,6},9->{4,5,6},10->{0,1,2}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,0,M,N) [1 >= A && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,0,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,1,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 3. lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl13(A,L,C,D,E,F,G,H,I,J,K,1 + L,M,N) [D >= H && D >= 1 && 1 + H >= D && A >= 1 + D && N = A && 1 + L = D && J = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl91(A,B,C,D,E,O,G,H,I,J,K,L,M,N) [D >= H && D >= 1 && A >= 1 + D && 1 + H >= D && J = A && 1 + L = D && N = A] (?,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,H,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,J,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 7. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N) [2 + H >= A && A >= 2 && A >= 1 + H && 1 + L = A && 2 + B = A && 1 + D = A && N = A && J = A] (?,1) 8. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,1 + L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 10. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> start(A,C,C,E,E,G,G,I,I,K,K,M,M,A) True (1,1) 11. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) 12. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) 13. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) Signature: {(exitus616,14);(lbl13,14);(lbl53,14);(lbl91,14);(start,14);(start0,14);(stop,14)} Flow Graph: [0->{},1->{4,5,6,11},2->{4,5,6,11},3->{7,8,9,12},4->{3},5->{4,5,6,11},6->{4,5,6,11},7->{},8->{4,5,6,11} ,9->{4,5,6,11},10->{0,1,2,13},11->{},12->{},13->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(5,4),(5,5),(5,6),(6,4),(6,5),(6,6)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,0,M,N) [1 >= A && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,0,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,1,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 3. lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl13(A,L,C,D,E,F,G,H,I,J,K,1 + L,M,N) [D >= H && D >= 1 && 1 + H >= D && A >= 1 + D && N = A && 1 + L = D && J = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl91(A,B,C,D,E,O,G,H,I,J,K,L,M,N) [D >= H && D >= 1 && A >= 1 + D && 1 + H >= D && J = A && 1 + L = D && N = A] (?,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,H,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,J,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 7. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N) [2 + H >= A && A >= 2 && A >= 1 + H && 1 + L = A && 2 + B = A && 1 + D = A && N = A && J = A] (?,1) 8. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,1 + L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 10. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> start(A,C,C,E,E,G,G,I,I,K,K,M,M,A) True (1,1) 11. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) 12. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) 13. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) Signature: {(exitus616,14);(lbl13,14);(lbl53,14);(lbl91,14);(start,14);(start0,14);(stop,14)} Flow Graph: [0->{},1->{4,5,6,11},2->{4,5,6,11},3->{7,8,9,12},4->{3},5->{11},6->{11},7->{},8->{4,5,6,11},9->{4,5,6,11} ,10->{0,1,2,13},11->{},12->{},13->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13] | `- p:[4,8,3,9] c: [9] | `- p:[3,4,8] c: [8] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,0,M,N) [1 >= A && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,0,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1,E,F,G,1,I,2,K,0,M,N) [A >= 2 && B = C && D = E && F = G && H = I && J = K && L = M && N = A] (?,1) 3. lbl91(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl13(A,L,C,D,E,F,G,H,I,J,K,1 + L,M,N) [D >= H && D >= 1 && 1 + H >= D && A >= 1 + D && N = A && 1 + L = D && J = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl91(A,B,C,D,E,O,G,H,I,J,K,L,M,N) [D >= H && D >= 1 && A >= 1 + D && 1 + H >= D && J = A && 1 + L = D && N = A] (?,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,H,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,J,E,F,G,J,I,1 + J,K,L,M,N) [A >= 1 + J && D >= H && D >= 1 && A >= J && J >= 1 + D && 1 + H >= D && 1 + L = D && N = A] (?,1) 7. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> stop(A,B,C,D,E,F,G,H,I,J,K,L,M,N) [2 + H >= A && A >= 2 && A >= 1 + H && 1 + L = A && 2 + B = A && 1 + D = A && N = A && J = A] (?,1) 8. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> lbl53(A,B,C,1 + L,E,F,G,1 + L,I,2 + L,K,L,M,N) [A >= 3 + B && A >= 2 + B && H >= B && B >= 0 && 1 + B >= H && L = 1 + B && D = 1 + B && N = A && J = A] (?,1) 10. start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> start(A,C,C,E,E,G,G,I,I,K,K,M,M,A) True (1,1) 11. lbl53(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) 12. lbl13(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) 13. start(A,B,C,D,E,F,G,H,I,J,K,L,M,N) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N) True (?,1) Signature: {(exitus616,14);(lbl13,14);(lbl53,14);(lbl91,14);(start,14);(start0,14);(stop,14)} Flow Graph: [0->{},1->{4,5,6,11},2->{4,5,6,11},3->{7,8,9,12},4->{3},5->{11},6->{11},7->{},8->{4,5,6,11},9->{4,5,6,11} ,10->{0,1,2,13},11->{},12->{},13->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13] | `- p:[4,8,3,9] c: [9] | `- p:[3,4,8] c: [8]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,K,L,M,N,0.0,0.0.0] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= 0*K, M <= M, N <= N] start ~> lbl53 [A <= A, B <= B, C <= C, D <= K, E <= E, F <= F, G <= G, H <= 0*K, I <= I, J <= 2*K, K <= K, L <= 0*K, M <= M, N <= N] start ~> lbl53 [A <= A, B <= B, C <= C, D <= K, E <= E, F <= F, G <= G, H <= K, I <= I, J <= 2*K, K <= K, L <= 0*K, M <= M, N <= N] lbl91 ~> lbl13 [A <= A, B <= L, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= J, M <= M, N <= N] lbl53 ~> lbl91 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N] lbl53 ~> lbl53 [A <= A, B <= B, C <= C, D <= J, E <= E, F <= F, G <= G, H <= H, I <= I, J <= A, K <= K, L <= L, M <= M, N <= N] lbl53 ~> lbl53 [A <= A, B <= B, C <= C, D <= J, E <= E, F <= F, G <= G, H <= J, I <= I, J <= A, K <= K, L <= L, M <= M, N <= N] lbl13 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N] lbl13 ~> lbl53 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= L, I <= I, J <= A, K <= K, L <= L, M <= M, N <= N] lbl13 ~> lbl53 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= A, I <= I, J <= A, K <= K, L <= L, M <= M, N <= N] start0 ~> start [A <= A, B <= C, C <= C, D <= E, E <= E, F <= G, G <= G, H <= I, I <= I, J <= K, K <= K, L <= M, M <= M, N <= A] lbl53 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N] lbl13 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N] start ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N] + Loop: [0.0 <= K + A + B + H + L] lbl53 ~> lbl91 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N] lbl13 ~> lbl53 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= L, I <= I, J <= A, K <= K, L <= L, M <= M, N <= N] lbl91 ~> lbl13 [A <= A, B <= L, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= J, M <= M, N <= N] lbl13 ~> lbl53 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= A, I <= I, J <= A, K <= K, L <= L, M <= M, N <= N] + Loop: [0.0.0 <= K + L + N] lbl91 ~> lbl13 [A <= A, B <= L, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= J, M <= M, N <= N] lbl53 ~> lbl91 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N] lbl13 ~> lbl53 [A <= A, B <= B, C <= C, D <= A, E <= E, F <= F, G <= G, H <= L, I <= I, J <= A, K <= K, L <= L, M <= M, N <= N] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,K,L,M,N,0.0,0.0.0] start ~> stop [K ~=> L] start ~> lbl53 [K ~=> D,K ~=> H,K ~=> J,K ~=> L] start ~> lbl53 [K ~=> D,K ~=> H,K ~=> J,K ~=> L] lbl91 ~> lbl13 [J ~=> L,L ~=> B] lbl53 ~> lbl91 [huge ~=> F] lbl53 ~> lbl53 [A ~=> J,J ~=> D] lbl53 ~> lbl53 [A ~=> J,J ~=> D,J ~=> H] lbl13 ~> stop [] lbl13 ~> lbl53 [A ~=> D,A ~=> J,L ~=> H] lbl13 ~> lbl53 [A ~=> D,A ~=> H,A ~=> J] start0 ~> start [A ~=> N,C ~=> B,E ~=> D,G ~=> F,I ~=> H,K ~=> J,M ~=> L] lbl53 ~> exitus616 [] lbl13 ~> exitus616 [] start ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,H ~+> 0.0,L ~+> 0.0,K ~+> 0.0] lbl53 ~> lbl91 [huge ~=> F] lbl13 ~> lbl53 [A ~=> D,A ~=> J,L ~=> H] lbl91 ~> lbl13 [J ~=> L,L ~=> B] lbl13 ~> lbl53 [A ~=> D,A ~=> H,A ~=> J] + Loop: [L ~+> 0.0.0,N ~+> 0.0.0,K ~+> 0.0.0] lbl91 ~> lbl13 [J ~=> L,L ~=> B] lbl53 ~> lbl91 [huge ~=> F] lbl13 ~> lbl53 [A ~=> D,A ~=> J,L ~=> H] + Applied Processor: LareProcessor + Details: start0 ~> stop [A ~=> B ,A ~=> D ,A ~=> H ,A ~=> J ,A ~=> L ,A ~=> N ,C ~=> B ,E ~=> D ,G ~=> F ,I ~=> H ,K ~=> J ,K ~=> B ,K ~=> D ,K ~=> H ,K ~=> J ,K ~=> L ,huge ~=> F ,A ~+> 0.0 ,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 ,A ~*> 0.0.0 ,A ~*> tick ,C ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] start0 ~> exitus616 [A ~=> B ,A ~=> D ,A ~=> H ,A ~=> J ,A ~=> L ,A ~=> N ,C ~=> B ,E ~=> D ,G ~=> F ,I ~=> H ,K ~=> J ,M ~=> L ,K ~=> B ,K ~=> D ,K ~=> H ,K ~=> J ,K ~=> L ,huge ~=> F ,A ~+> 0.0 ,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 ,A ~*> 0.0.0 ,A ~*> tick ,C ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + lbl53> [A ~=> B ,A ~=> D ,A ~=> H ,A ~=> J ,A ~=> L ,J ~=> B ,J ~=> H ,J ~=> L ,L ~=> B ,huge ~=> F ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,H ~+> 0.0 ,H ~+> tick ,J ~+> 0.0.0 ,J ~+> tick ,L ~+> 0.0 ,L ~+> 0.0.0 ,L ~+> tick ,N ~+> 0.0.0 ,N ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,H ~*> tick ,L ~*> tick ,N ~*> tick ,K ~*> tick] lbl13> [A ~=> B ,A ~=> D ,A ~=> H ,A ~=> J ,A ~=> L ,J ~=> B ,J ~=> H ,J ~=> L ,L ~=> B ,huge ~=> F ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,H ~+> 0.0 ,H ~+> tick ,J ~+> 0.0.0 ,J ~+> tick ,L ~+> 0.0 ,L ~+> 0.0.0 ,L ~+> tick ,N ~+> 0.0.0 ,N ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> tick ,H ~*> tick ,J ~*> tick ,L ~*> tick ,N ~*> tick ,K ~*> tick] + lbl13> [A ~=> B ,A ~=> D ,A ~=> H ,A ~=> J ,A ~=> L ,J ~=> B ,J ~=> H ,J ~=> L ,L ~=> B ,huge ~=> F ,L ~+> 0.0.0 ,L ~+> tick ,N ~+> 0.0.0 ,N ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] lbl53> [A ~=> B ,A ~=> D ,A ~=> H ,A ~=> J ,A ~=> L ,J ~=> B ,J ~=> H ,J ~=> L ,L ~=> B ,huge ~=> F ,L ~+> 0.0.0 ,L ~+> tick ,N ~+> 0.0.0 ,N ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)