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) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (?,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (?,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (?,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (?,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 10. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + J,G,1,I,J,K,L) [A >= 1 + J (?,1) && E >= 1 && C >= 1 + J && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 13. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + J,G,1 + H,I,J,K,L) [A >= 1 + F (?,1) && E >= 1 + H && A + C >= 1 + F && A >= 0 && E >= H && F >= A && H >= 1 && J = F && L = A && D = E && B = C] 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) Signature: {(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8,9,10},5->{11,12,13},6->{14,15},7->{},8->{7,8,9,10},9->{11,12,13},10->{14 ,15},11->{7,8,9,10},12->{11,12,13},13->{14,15},14->{11,12,13},15->{14,15},16->{0,1,2,3,4,5,6}] + 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,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (1,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (1,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (1,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (1,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 10. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + J,G,1,I,J,K,L) [A >= 1 + J (?,1) && E >= 1 && C >= 1 + J && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 13. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + J,G,1 + H,I,J,K,L) [A >= 1 + F (?,1) && E >= 1 + H && A + C >= 1 + F && A >= 0 && E >= H && F >= A && H >= 1 && J = F && L = A && D = E && B = C] 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) Signature: {(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8,9,10},5->{11,12,13},6->{14,15},7->{},8->{7,8,9,10},9->{11,12,13},10->{14 ,15},11->{7,8,9,10},12->{11,12,13},13->{14,15},14->{11,12,13},15->{14,15},16->{0,1,2,3,4,5,6}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [13] * Step 3: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (1,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (1,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (1,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (1,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 10. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + J,G,1,I,J,K,L) [A >= 1 + J (?,1) && E >= 1 && C >= 1 + J && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) Signature: {(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8,9,10},5->{11,12},6->{14,15},7->{},8->{7,8,9,10},9->{11,12},10->{14,15} ,11->{7,8,9,10},12->{11,12},14->{11,12},15->{14,15},16->{0,1,2,3,4,5,6}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,9),(4,10),(8,9),(8,10),(11,8),(11,10)] * Step 4: UnreachableRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (1,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (1,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (1,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (1,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 10. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + J,G,1,I,J,K,L) [A >= 1 + J (?,1) && E >= 1 && C >= 1 + J && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) Signature: {(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8},5->{11,12},6->{14,15},7->{},8->{7,8},9->{11,12},10->{14,15},11->{7,9} ,12->{11,12},14->{11,12},15->{14,15},16->{0,1,2,3,4,5,6}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [10] * Step 5: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (1,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (1,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (1,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (1,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (1,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) Signature: {(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8},5->{11,12},6->{14,15},7->{},8->{7,8},9->{11,12},11->{7,9},12->{11,12} ,14->{11,12},15->{14,15},16->{0,1,2,3,4,5,6}] + Applied Processor: AddSinks + Details: () * Step 6: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (?,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (?,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (?,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (?,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) 17. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 18. start(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) Signature: {(exitus616,12);(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8,9,17},5->{11,12},6->{14,15},7->{},8->{7,8,9,17},9->{11,12},11->{7,8,9,17} ,12->{11,12},14->{11,12},15->{14,15},16->{0,1,2,3,4,5,6,18},17->{},18->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,9),(8,9),(11,8)] * Step 7: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (?,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (?,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (?,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (?,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) 17. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 18. start(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) Signature: {(exitus616,12);(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8,17},5->{11,12},6->{14,15},7->{},8->{7,8,17},9->{11,12},11->{7,9,17} ,12->{11,12},14->{11,12},15->{14,15},16->{0,1,2,3,4,5,6,18},17->{},18->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,11,12,14,15,16,17,18] | +- p:[15] c: [15] | +- p:[11,9,12] c: [11] | | | `- p:[12] c: [12] | `- p:[8] c: [8] * Step 8: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + A && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + E && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [0 >= 1 + C && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 3. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,0,K,L) [A >= 0 && E >= 0 && B = 0 && C = 0 && D = E && F = G && H = I && J = K && L = A] (?,1) 4. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1,K,L) [A >= 0 && C >= 1 && D = 0 && B = C && E = 0 && F = G && H = I && J = K && L = A] (?,1) 5. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,0,G,1,I,0,K,L) [E >= 1 && C >= 1 && L = 0 && B = C && D = E && F = G && H = I && J = K && A = 0] (?,1) 6. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1,G,1,I,0,K,L) [A >= 1 && E >= 1 && C >= 1 && B = C && D = E && F = G && H = I && J = K && L = A] (?,1) 7. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [J >= C && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] (?,1) 8. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,0,I,1 + J,K,L) [C >= 1 + J && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = 0 && D = 0 && L = A && E = 0 && B = C] (?,1) 9. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1,I,J,K,L) [E >= 1 (?,1) && C >= 1 + J && J >= A && E >= 0 && A >= 0 && C >= 1 && A + C >= J && J >= 1 && H = E && L = A && D = E && B = C] 11. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl131(A,B,C,D,E,F,G,H,I,1 + J,K,L) [A + C >= 1 + F && A >= 0 && F >= A && E >= 1 && H = E && J = F && L = A && D = E && B = C] (?,1) 12. lbl121(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,J,G,1 + H,I,J,K,L) [E >= 1 + H && F >= A && A + C >= 1 + F && A >= 0 && E >= H && H >= 1 && J = F && L = A && D = E && B = C] (?,1) 14. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl121(A,B,C,D,E,F,G,H,I,F,K,L) [A >= 1 + J && E >= 1 && J >= 0 && C >= 1 + J && F = A && H = 1 && L = A && D = E && B = C] (?,1) 15. lbl111(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl111(A,B,C,D,E,1 + F,G,H,I,J,K,L) [A >= 1 + F && F >= 1 + J && E >= 1 && J >= 0 && A >= F && C >= 1 + J && H = 1 && L = A && D = E && B = C] (?,1) 16. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,I,I,K,K,A) True (1,1) 17. lbl131(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 18. start(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) Signature: {(exitus616,12);(lbl111,12);(lbl121,12);(lbl131,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{},2->{},3->{},4->{7,8,17},5->{11,12},6->{14,15},7->{},8->{7,8,17},9->{11,12},11->{7,9,17} ,12->{11,12},14->{11,12},15->{14,15},16->{0,1,2,3,4,5,6,18},17->{},18->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,11,12,14,15,16,17,18] | +- p:[15] c: [15] | +- p:[11,9,12] c: [11] | | | `- p:[12] c: [12] | `- p:[8] c: [8]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 9: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,K,L,0.0,0.1,0.1.0,0.2] 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 <= L] 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 <= L] 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 <= L] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= 0*K, K <= K, L <= L] start ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= 0*K, I <= I, J <= K, K <= K, L <= L] start ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= 0*K, G <= G, H <= K, I <= I, J <= 0*K, K <= K, L <= L] start ~> lbl111 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K, G <= G, H <= K, I <= I, J <= 0*K, K <= K, L <= L] lbl131 ~> 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] lbl131 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= 0*K, I <= I, J <= C, K <= K, L <= L] lbl131 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= J, G <= G, H <= K, I <= I, J <= J, K <= K, L <= L] lbl121 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= C + L, K <= K, L <= L] lbl121 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= J, G <= G, H <= E, I <= I, J <= J, K <= K, L <= L] lbl111 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= F, K <= K, L <= L] lbl111 ~> lbl111 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= A, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] 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 <= A] lbl131 ~> 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] 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] + Loop: [0.0 <= K + A + F] lbl111 ~> lbl111 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= A, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] + Loop: [0.1 <= C + J + L] lbl121 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= C + L, K <= K, L <= L] lbl131 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= J, G <= G, H <= K, I <= I, J <= J, K <= K, L <= L] lbl121 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= J, G <= G, H <= E, I <= I, J <= J, K <= K, L <= L] + Loop: [0.1.0 <= K + E + H] lbl121 ~> lbl121 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= J, G <= G, H <= E, I <= I, J <= J, K <= K, L <= L] + Loop: [0.2 <= K + A + C + J] lbl131 ~> lbl131 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= 0*K, I <= I, J <= C, K <= K, L <= L] + Applied Processor: FlowAbstraction + Details: () * Step 10: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,K,L,0.0,0.1,0.1.0,0.2] start ~> stop [] start ~> stop [] start ~> stop [] start ~> stop [K ~=> J] start ~> lbl131 [K ~=> H,K ~=> J] start ~> lbl121 [K ~=> F,K ~=> H,K ~=> J] start ~> lbl111 [K ~=> F,K ~=> H,K ~=> J] lbl131 ~> stop [] lbl131 ~> lbl131 [C ~=> J,K ~=> H] lbl131 ~> lbl121 [J ~=> F,K ~=> H] lbl121 ~> lbl131 [C ~+> J,L ~+> J] lbl121 ~> lbl121 [E ~=> H,J ~=> F] lbl111 ~> lbl121 [F ~=> J] lbl111 ~> lbl111 [A ~=> F] start0 ~> start [A ~=> L,C ~=> B,E ~=> D,G ~=> F,I ~=> H,K ~=> J] lbl131 ~> exitus616 [] start ~> exitus616 [] + Loop: [A ~+> 0.0,F ~+> 0.0,K ~+> 0.0] lbl111 ~> lbl111 [A ~=> F] + Loop: [C ~+> 0.1,J ~+> 0.1,L ~+> 0.1] lbl121 ~> lbl131 [C ~+> J,L ~+> J] lbl131 ~> lbl121 [J ~=> F,K ~=> H] lbl121 ~> lbl121 [E ~=> H,J ~=> F] + Loop: [E ~+> 0.1.0,H ~+> 0.1.0,K ~+> 0.1.0] lbl121 ~> lbl121 [E ~=> H,J ~=> F] + Loop: [A ~+> 0.2,C ~+> 0.2,J ~+> 0.2,K ~+> 0.2] lbl131 ~> lbl131 [C ~=> J,K ~=> H] + Applied Processor: LareProcessor + Details: start0 ~> exitus616 [A ~=> F ,A ~=> J ,A ~=> L ,C ~=> B ,C ~=> J ,E ~=> D ,E ~=> H ,G ~=> F ,I ~=> H ,K ~=> J ,K ~=> F ,K ~=> H ,K ~=> J ,A ~+> F ,A ~+> J ,A ~+> 0.0 ,A ~+> 0.1 ,A ~+> 0.2 ,A ~+> tick ,C ~+> F ,C ~+> J ,C ~+> 0.1 ,C ~+> 0.2 ,C ~+> tick ,E ~+> 0.1.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.2 ,K ~+> tick ,A ~*> 0.1 ,A ~*> 0.2 ,A ~*> tick ,C ~*> 0.1 ,C ~*> 0.2 ,C ~*> tick ,E ~*> 0.1.0 ,E ~*> tick ,K ~*> 0.0 ,K ~*> 0.1.0 ,K ~*> 0.2 ,K ~*> tick] start0 ~> stop [A ~=> F ,A ~=> J ,A ~=> L ,C ~=> B ,C ~=> J ,E ~=> D ,E ~=> H ,G ~=> F ,I ~=> H ,K ~=> J ,K ~=> F ,K ~=> H ,K ~=> J ,A ~+> F ,A ~+> J ,A ~+> 0.0 ,A ~+> 0.1 ,A ~+> 0.2 ,A ~+> tick ,C ~+> F ,C ~+> J ,C ~+> 0.1 ,C ~+> 0.2 ,C ~+> tick ,E ~+> 0.1.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.2 ,K ~+> tick ,A ~*> 0.1 ,A ~*> 0.2 ,A ~*> tick ,C ~*> 0.1 ,C ~*> 0.2 ,C ~*> tick ,E ~*> 0.1.0 ,E ~*> tick ,K ~*> 0.0 ,K ~*> 0.1.0 ,K ~*> 0.2 ,K ~*> tick] + lbl111> [A ~=> F ,A ~+> 0.0 ,A ~+> tick ,F ~+> 0.0 ,F ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> tick] + lbl131> [E ~=> H ,J ~=> F ,K ~=> H ,C ~+> F ,C ~+> J ,C ~+> 0.1 ,C ~+> tick ,E ~+> 0.1.0 ,E ~+> tick ,J ~+> 0.1 ,J ~+> tick ,L ~+> F ,L ~+> J ,L ~+> 0.1 ,L ~+> tick ,tick ~+> tick ,K ~+> 0.1.0 ,K ~+> tick ,C ~*> tick ,E ~*> 0.1.0 ,E ~*> tick ,J ~*> tick ,L ~*> tick ,K ~*> 0.1.0 ,K ~*> tick] lbl131> [E ~=> H ,J ~=> F ,K ~=> H ,C ~+> F ,C ~+> J ,C ~+> 0.1 ,C ~+> tick ,E ~+> 0.1.0 ,E ~+> tick ,H ~+> 0.1.0 ,H ~+> tick ,J ~+> 0.1 ,J ~+> tick ,L ~+> F ,L ~+> J ,L ~+> 0.1 ,L ~+> tick ,tick ~+> tick ,K ~+> 0.1.0 ,K ~+> tick ,C ~*> tick ,E ~*> 0.1.0 ,E ~*> tick ,H ~*> tick ,J ~*> tick ,L ~*> tick ,K ~*> 0.1.0 ,K ~*> tick] + lbl121> [E ~=> H ,J ~=> F ,E ~+> 0.1.0 ,E ~+> tick ,H ~+> 0.1.0 ,H ~+> tick ,tick ~+> tick ,K ~+> 0.1.0 ,K ~+> tick] + lbl131> [C ~=> J ,K ~=> H ,A ~+> 0.2 ,A ~+> tick ,C ~+> 0.2 ,C ~+> tick ,J ~+> 0.2 ,J ~+> tick ,tick ~+> tick ,K ~+> 0.2 ,K ~+> tick] YES(?,POLY)