YES * Step 1: TrivialSCCs YES + 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: Looptree YES + 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: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[5,8,6,9] c: [9] | `- p:[5,8,6] c: [8] | `- p:[5] c: [5] YES