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