YES(?,PRIMREC) * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 0 >= 1 + A && B = C && D = E && F = A] 1. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && C >= 1 + E && B = C && D = E && F = A] 2. start(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 3. start(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 4. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && B >= 1 + D && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 5. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 6. lbl91(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 7. lbl101(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && B >= 1 + D && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 8. lbl101(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 9. lbl101(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 10. start0(A,B,C,D,E,F) -> start(A,C,C,E,E,A) True (1,1) Signature: {(lbl101,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{},1->{},2->{4,5,6},3->{7,8,9},4->{},5->{4,5,6},6->{7,8,9},7->{},8->{4,5,6},9->{7,8,9},10->{0,1,2,3}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks MAYBE + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (1,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 0 >= 1 + A && B = C && D = E && F = A] 1. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (1,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && C >= 1 + E && B = C && D = E && F = A] 2. start(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (1,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 3. start(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (1,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 4. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (1,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && B >= 1 + D && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 5. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 6. lbl91(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 7. lbl101(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (1,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && B >= 1 + D && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 8. lbl101(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 9. lbl101(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 10. start0(A,B,C,D,E,F) -> start(A,C,C,E,E,A) True (1,1) Signature: {(lbl101,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{},1->{},2->{4,5,6},3->{7,8,9},4->{},5->{4,5,6},6->{7,8,9},7->{},8->{4,5,6},9->{7,8,9},10->{0,1,2,3}] + Applied Processor: AddSinks + Details: () * Step 3: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 0 >= 1 + A && B = C && D = E && F = A] 1. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && C >= 1 + E && B = C && D = E && F = A] 2. start(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 3. start(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 4. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && B >= 1 + D && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 5. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 6. lbl91(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 7. lbl101(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && B >= 1 + D && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 8. lbl101(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 9. lbl101(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 10. start0(A,B,C,D,E,F) -> start(A,C,C,E,E,A) True (1,1) 11. lbl101(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) 12. lbl91(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) 13. start(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) Signature: {(exitus616,6);(lbl101,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{},1->{},2->{4,5,6,12},3->{7,8,9,11},4->{},5->{4,5,6,12},6->{7,8,9,11},7->{},8->{4,5,6,12},9->{7,8,9 ,11},10->{0,1,2,3,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:[5,8,6,9] c: [9] | `- p:[5,8,6] c: [8] | `- p:[5] c: [5] * Step 4: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 0 >= 1 + A && B = C && D = E && F = A] 1. start(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && C >= 1 + E && B = C && D = E && F = A] 2. start(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 3. start(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && A >= 0 && E >= C && B = C && D = E && F = A] 4. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && B >= 1 + D && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 5. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 6. lbl91(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1 + -1*D + E >= 0 && -1*C + E >= 0 && -1*B + E >= 0 && B + -1*C >= 0 && A >= 0 && D >= B && B >= C && 1 + A + D >= B && E >= 1 + A + D && F = A] 7. lbl101(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && B >= 1 + D && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 8. lbl101(A,B,C,D,E,F) -> lbl91(A,B,C,-1 + D + -1*F,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 9. lbl101(A,B,C,D,E,F) -> lbl101(A,1 + B + F,C,D,E,F) [A + -1*F >= 0 (?,1) && F >= 0 && A + F >= 0 && -1*A + F >= 0 && -1*D + E >= 0 && -1*C + E >= 0 && -1*C + D >= 0 && -1 + B + -1*C >= 0 && A >= 0 && D >= B && E >= D && B >= 1 + A + C && 1 + A + D >= B && F = A] 10. start0(A,B,C,D,E,F) -> start(A,C,C,E,E,A) True (1,1) 11. lbl101(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) 12. lbl91(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) 13. start(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) Signature: {(exitus616,6);(lbl101,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{},1->{},2->{4,5,6,12},3->{7,8,9,11},4->{},5->{4,5,6,12},6->{7,8,9,11},7->{},8->{4,5,6,12},9->{7,8,9 ,11},10->{0,1,2,3,13},11->{},12->{},13->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13] | `- p:[5,8,6,9] c: [9] | `- p:[5,8,6] c: [8] | `- p:[5] c: [5]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 5: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,F,0.0,0.0.0,0.0.0.0] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] start ~> lbl91 [A <= A, B <= B, C <= C, D <= K + E + F, E <= E, F <= F] start ~> lbl101 [A <= A, B <= K + C + F, C <= C, D <= D, E <= E, F <= F] lbl91 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl91 ~> lbl91 [A <= A, B <= B, C <= C, D <= C + D + E, E <= E, F <= F] lbl91 ~> lbl101 [A <= A, B <= C + E, C <= C, D <= D, E <= E, F <= F] lbl101 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl101 ~> lbl91 [A <= A, B <= B, C <= C, D <= C + E, E <= E, F <= F] lbl101 ~> lbl101 [A <= A, B <= C + D + E, C <= C, D <= D, E <= E, F <= F] start0 ~> start [A <= A, B <= C, C <= C, D <= E, E <= E, F <= A] lbl101 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl91 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] start ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0 <= K + B + E] lbl91 ~> lbl91 [A <= A, B <= B, C <= C, D <= C + D + E, E <= E, F <= F] lbl101 ~> lbl91 [A <= A, B <= B, C <= C, D <= C + E, E <= E, F <= F] lbl91 ~> lbl101 [A <= A, B <= C + E, C <= C, D <= D, E <= E, F <= F] lbl101 ~> lbl101 [A <= A, B <= C + D + E, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0.0 <= K + B + E] lbl91 ~> lbl91 [A <= A, B <= B, C <= C, D <= C + D + E, E <= E, F <= F] lbl101 ~> lbl91 [A <= A, B <= B, C <= C, D <= C + E, E <= E, F <= F] lbl91 ~> lbl101 [A <= A, B <= C + E, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0.0.0 <= K + B + D] lbl91 ~> lbl91 [A <= A, B <= B, C <= C, D <= C + D + E, E <= E, F <= F] + Applied Processor: FlowAbstraction + Details: () * Step 6: LareProcessor MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.0.0,0.0.0.0] start ~> stop [] start ~> stop [] start ~> lbl91 [E ~+> D,F ~+> D,K ~+> D] start ~> lbl101 [C ~+> B,F ~+> B,K ~+> B] lbl91 ~> stop [] lbl91 ~> lbl91 [C ~+> D,D ~+> D,E ~+> D] lbl91 ~> lbl101 [C ~+> B,E ~+> B] lbl101 ~> stop [] lbl101 ~> lbl91 [C ~+> D,E ~+> D] lbl101 ~> lbl101 [C ~+> B,D ~+> B,E ~+> B] start0 ~> start [A ~=> F,C ~=> B,E ~=> D] lbl101 ~> exitus616 [] lbl91 ~> exitus616 [] start ~> exitus616 [] + Loop: [B ~+> 0.0,E ~+> 0.0,K ~+> 0.0] lbl91 ~> lbl91 [C ~+> D,D ~+> D,E ~+> D] lbl101 ~> lbl91 [C ~+> D,E ~+> D] lbl91 ~> lbl101 [C ~+> B,E ~+> B] lbl101 ~> lbl101 [C ~+> B,D ~+> B,E ~+> B] + Loop: [B ~+> 0.0.0,E ~+> 0.0.0,K ~+> 0.0.0] lbl91 ~> lbl91 [C ~+> D,D ~+> D,E ~+> D] lbl101 ~> lbl91 [C ~+> D,E ~+> D] lbl91 ~> lbl101 [C ~+> B,E ~+> B] + Loop: [B ~+> 0.0.0.0,D ~+> 0.0.0.0,K ~+> 0.0.0.0] lbl91 ~> lbl91 [C ~+> D,D ~+> D,E ~+> D] + Applied Processor: LareProcessor + Details: start0 ~> exitus616 [A ~=> F ,C ~=> B ,E ~=> D ,A ~+> B ,A ~+> D ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0 ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> D ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,A ~*> B ,A ~*> D ,A ~*> 0.0 ,A ~*> 0.0.0 ,A ~*> 0.0.0.0 ,A ~*> tick ,C ~*> B ,C ~*> D ,C ~*> 0.0 ,C ~*> 0.0.0 ,C ~*> 0.0.0.0 ,C ~*> tick ,E ~*> B ,E ~*> D ,E ~*> 0.0 ,E ~*> 0.0.0 ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick ,A ~^> B ,A ~^> D ,A ~^> 0.0 ,A ~^> 0.0.0 ,A ~^> 0.0.0.0 ,A ~^> tick ,C ~^> B ,C ~^> D ,C ~^> 0.0 ,C ~^> 0.0.0 ,C ~^> 0.0.0.0 ,C ~^> tick ,E ~^> B ,E ~^> D ,E ~^> 0.0 ,E ~^> 0.0.0 ,E ~^> 0.0.0.0 ,E ~^> tick ,K ~^> B ,K ~^> D ,K ~^> 0.0 ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> tick] start0 ~> stop [A ~=> F ,C ~=> B ,E ~=> D ,A ~+> B ,A ~+> D ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0 ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> D ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,A ~*> B ,A ~*> D ,A ~*> 0.0 ,A ~*> 0.0.0 ,A ~*> 0.0.0.0 ,A ~*> tick ,C ~*> B ,C ~*> D ,C ~*> 0.0 ,C ~*> 0.0.0 ,C ~*> 0.0.0.0 ,C ~*> tick ,E ~*> B ,E ~*> D ,E ~*> 0.0 ,E ~*> 0.0.0 ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick ,A ~^> B ,A ~^> D ,A ~^> 0.0 ,A ~^> 0.0.0 ,A ~^> 0.0.0.0 ,A ~^> tick ,C ~^> B ,C ~^> D ,C ~^> 0.0 ,C ~^> 0.0.0 ,C ~^> 0.0.0.0 ,C ~^> tick ,E ~^> B ,E ~^> D ,E ~^> 0.0 ,E ~^> 0.0.0 ,E ~^> 0.0.0.0 ,E ~^> tick ,K ~^> B ,K ~^> D ,K ~^> 0.0 ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> tick] + lbl91> [B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> B ,D ~+> D ,D ~+> 0.0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> B ,B ~*> D ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> B ,C ~*> D ,C ~*> 0.0.0 ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> B ,D ~*> D ,D ~*> 0.0.0 ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> B ,E ~*> D ,E ~*> 0.0.0 ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> B ,B ~^> D ,B ~^> 0.0.0 ,B ~^> 0.0.0.0 ,B ~^> tick ,C ~^> B ,C ~^> D ,C ~^> 0.0.0 ,C ~^> 0.0.0.0 ,C ~^> tick ,D ~^> B ,D ~^> D ,D ~^> 0.0.0 ,D ~^> 0.0.0.0 ,D ~^> tick ,E ~^> B ,E ~^> D ,E ~^> 0.0.0 ,E ~^> 0.0.0.0 ,E ~^> tick ,K ~^> B ,K ~^> D ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> tick] lbl101> [B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> B ,D ~+> D ,D ~+> 0.0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> B ,B ~*> D ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> B ,C ~*> D ,C ~*> 0.0.0 ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> B ,D ~*> D ,D ~*> 0.0.0 ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> B ,E ~*> D ,E ~*> 0.0.0 ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> B ,B ~^> D ,B ~^> 0.0.0 ,B ~^> 0.0.0.0 ,B ~^> tick ,C ~^> B ,C ~^> D ,C ~^> 0.0.0 ,C ~^> 0.0.0.0 ,C ~^> tick ,D ~^> B ,D ~^> D ,D ~^> 0.0.0 ,D ~^> 0.0.0.0 ,D ~^> tick ,E ~^> B ,E ~^> D ,E ~^> 0.0.0 ,E ~^> 0.0.0.0 ,E ~^> tick ,K ~^> B ,K ~^> D ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> tick] lbl91> [B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> B ,D ~+> D ,D ~+> 0.0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> B ,B ~*> D ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> B ,C ~*> D ,C ~*> 0.0.0 ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> B ,D ~*> D ,D ~*> 0.0.0 ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> B ,E ~*> D ,E ~*> 0.0.0 ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> B ,B ~^> D ,B ~^> 0.0.0 ,B ~^> 0.0.0.0 ,B ~^> tick ,C ~^> B ,C ~^> D ,C ~^> 0.0.0 ,C ~^> 0.0.0.0 ,C ~^> tick ,D ~^> B ,D ~^> D ,D ~^> 0.0.0 ,D ~^> 0.0.0.0 ,D ~^> tick ,E ~^> B ,E ~^> D ,E ~^> 0.0.0 ,E ~^> 0.0.0.0 ,E ~^> tick ,K ~^> B ,K ~^> D ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> tick] lbl101> [B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0 ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> B ,D ~+> D ,D ~+> 0.0.0 ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> B ,B ~*> D ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> B ,C ~*> D ,C ~*> 0.0.0 ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> B ,D ~*> D ,D ~*> 0.0.0 ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> B ,E ~*> D ,E ~*> 0.0.0 ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> B ,B ~^> D ,B ~^> 0.0.0 ,B ~^> 0.0.0.0 ,B ~^> tick ,C ~^> B ,C ~^> D ,C ~^> 0.0.0 ,C ~^> 0.0.0.0 ,C ~^> tick ,D ~^> B ,D ~^> D ,D ~^> 0.0.0 ,D ~^> 0.0.0.0 ,D ~^> tick ,E ~^> B ,E ~^> D ,E ~^> 0.0.0 ,E ~^> 0.0.0.0 ,E ~^> tick ,K ~^> B ,K ~^> D ,K ~^> 0.0.0 ,K ~^> 0.0.0.0 ,K ~^> tick] + lbl91> [B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> D ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> D ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> D ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> D ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> D ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> D ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> D ,E ~^> D ,K ~^> D] lbl101> [B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0.0 ,C ~+> tick ,D ~+> D ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> D ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> D ,C ~*> 0.0.0.0 ,C ~*> tick ,D ~*> D ,D ~*> 0.0.0.0 ,D ~*> tick ,E ~*> D ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> D ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> D ,B ~^> 0.0.0.0 ,B ~^> tick ,E ~^> D ,E ~^> 0.0.0.0 ,E ~^> tick ,K ~^> D ,K ~^> 0.0.0.0 ,K ~^> tick] lbl91> [B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0.0 ,C ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> D ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> D ,C ~*> 0.0.0.0 ,C ~*> tick ,E ~*> D ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> D ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> D ,E ~^> D ,K ~^> D] lbl101> [B ~+> 0.0.0 ,B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> B ,C ~+> D ,C ~+> 0.0.0.0 ,C ~+> tick ,E ~+> B ,E ~+> D ,E ~+> 0.0.0 ,E ~+> 0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> D ,B ~*> 0.0.0.0 ,B ~*> tick ,C ~*> D ,C ~*> 0.0.0.0 ,C ~*> tick ,E ~*> D ,E ~*> 0.0.0.0 ,E ~*> tick ,K ~*> D ,K ~*> 0.0.0.0 ,K ~*> tick ,B ~^> D ,E ~^> D ,K ~^> D] + lbl91> [B ~+> 0.0.0.0 ,B ~+> tick ,C ~+> D ,D ~+> D ,D ~+> 0.0.0.0 ,D ~+> tick ,E ~+> D ,tick ~+> tick ,K ~+> 0.0.0.0 ,K ~+> tick ,B ~*> D ,C ~*> D ,D ~*> D ,E ~*> D ,K ~*> D] YES(?,PRIMREC)