YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,1,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && A >= 1 && B >= 1 + C && D = B && E = F && G = C && H = I && J = A] 1. start(A,B,C,D,E,F,G,H,I,J) -> lbl71(A,B,C,1 + D,1,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && A >= 1 && C >= B && D = B && E = F && G = C && H = I && J = A] 2. start(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,-1,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && B >= 1 + C && 0 >= A && D = B && E = F && G = C && H = I && J = A] 3. start(A,B,C,D,E,F,G,H,I,J) -> lbl81(A,B,C,1 + D,-1,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && C >= B && 0 >= A && D = B && E = F && G = C && H = I && J = A] 4. lbl71(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && 1 + -1*E >= 0 && -1*E + J >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + E + J >= 0 && -2 + A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && A + -1*J >= 0 && -1 + J >= 0 && -2 + A + J >= 0 && -1*A + J >= 0 && -1 + A >= 0 && C >= B && A >= 1 && D = 1 + C && E = 1 && J = A && H = I && G = C] 5. lbl71(A,B,C,D,E,F,G,H,I,J) -> lbl71(A,B,C,D + E,E,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && 1 + -1*E >= 0 && -1*E + J >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + E + J >= 0 && -2 + A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && A + -1*J >= 0 && -1 + J >= 0 && -2 + A + J >= 0 && -1*A + J >= 0 && -1 + A >= 0 && A >= 1 && C >= D && D >= 1 + B && 1 + C >= D && E = 1 && J = A && H = I && G = C] 6. lbl81(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && -1 + -1*E >= 0 && -1 + -1*E + -1*J >= 0 && -1 + -1*A + -1*E >= 0 && 1 + E >= 0 && 1 + E + -1*J >= 0 && 1 + -1*A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A + J >= 0 && -1*A >= 0 && 0 >= A && C >= B && D = 1 + C && 1 + E = 0 && J = A && H = I && G = C] 7. lbl81(A,B,C,D,E,F,G,H,I,J) -> lbl81(A,B,C,D + -1*E,E,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && -1 + -1*E >= 0 && -1 + -1*E + -1*J >= 0 && -1 + -1*A + -1*E >= 0 && 1 + E >= 0 && 1 + E + -1*J >= 0 && 1 + -1*A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A + J >= 0 && -1*A >= 0 && C >= D && 0 >= A && D >= 1 + B && 1 + C >= D && 1 + E = 0 && J = A && H = I && G = C] 8. start0(A,B,C,D,E,F,G,H,I,J) -> start(A,B,C,B,F,F,C,I,I,A) True (1,1) Signature: {(lbl71,10);(lbl81,10);(start,10);(start0,10);(stop,10)} Flow Graph: [0->{},1->{4,5},2->{},3->{6,7},4->{},5->{4,5},6->{},7->{6,7},8->{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,G,H,I,J) -> stop(A,B,C,D,1,F,G,H,I,J) [H + -1*I >= 0 (1,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && A >= 1 && B >= 1 + C && D = B && E = F && G = C && H = I && J = A] 1. start(A,B,C,D,E,F,G,H,I,J) -> lbl71(A,B,C,1 + D,1,F,G,H,I,J) [H + -1*I >= 0 (1,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && A >= 1 && C >= B && D = B && E = F && G = C && H = I && J = A] 2. start(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,-1,F,G,H,I,J) [H + -1*I >= 0 (1,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && B >= 1 + C && 0 >= A && D = B && E = F && G = C && H = I && J = A] 3. start(A,B,C,D,E,F,G,H,I,J) -> lbl81(A,B,C,1 + D,-1,F,G,H,I,J) [H + -1*I >= 0 (1,1) && -1*H + I >= 0 && C + -1*G >= 0 && -1*C + G >= 0 && E + -1*F >= 0 && -1*E + F >= 0 && B + -1*D >= 0 && -1*B + D >= 0 && A + -1*J >= 0 && -1*A + J >= 0 && C >= B && 0 >= A && D = B && E = F && G = C && H = I && J = A] 4. lbl71(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [H + -1*I >= 0 (1,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && 1 + -1*E >= 0 && -1*E + J >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + E + J >= 0 && -2 + A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && A + -1*J >= 0 && -1 + J >= 0 && -2 + A + J >= 0 && -1*A + J >= 0 && -1 + A >= 0 && C >= B && A >= 1 && D = 1 + C && E = 1 && J = A && H = I && G = C] 5. lbl71(A,B,C,D,E,F,G,H,I,J) -> lbl71(A,B,C,D + E,E,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && 1 + -1*E >= 0 && -1*E + J >= 0 && A + -1*E >= 0 && -1 + E >= 0 && -2 + E + J >= 0 && -2 + A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && A + -1*J >= 0 && -1 + J >= 0 && -2 + A + J >= 0 && -1*A + J >= 0 && -1 + A >= 0 && A >= 1 && C >= D && D >= 1 + B && 1 + C >= D && E = 1 && J = A && H = I && G = C] 6. lbl81(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [H + -1*I >= 0 (1,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && -1 + -1*E >= 0 && -1 + -1*E + -1*J >= 0 && -1 + -1*A + -1*E >= 0 && 1 + E >= 0 && 1 + E + -1*J >= 0 && 1 + -1*A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A + J >= 0 && -1*A >= 0 && 0 >= A && C >= B && D = 1 + C && 1 + E = 0 && J = A && H = I && G = C] 7. lbl81(A,B,C,D,E,F,G,H,I,J) -> lbl81(A,B,C,D + -1*E,E,F,G,H,I,J) [H + -1*I >= 0 (?,1) && -1*H + I >= 0 && C + -1*G >= 0 && 1 + -1*D + G >= 0 && -1*C + G >= 0 && -1*B + G >= 0 && -1 + -1*E >= 0 && -1 + -1*E + -1*J >= 0 && -1 + -1*A + -1*E >= 0 && 1 + E >= 0 && 1 + E + -1*J >= 0 && 1 + -1*A + E >= 0 && 1 + C + -1*D >= 0 && -1 + -1*B + D >= 0 && -1*B + C >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A + J >= 0 && -1*A >= 0 && C >= D && 0 >= A && D >= 1 + B && 1 + C >= D && 1 + E = 0 && J = A && H = I && G = C] 8. start0(A,B,C,D,E,F,G,H,I,J) -> start(A,B,C,B,F,F,C,I,I,A) True (1,1) Signature: {(lbl71,10);(lbl81,10);(start,10);(start0,10);(stop,10)} Flow Graph: [0->{},1->{4,5},2->{},3->{6,7},4->{},5->{4,5},6->{},7->{6,7},8->{0,1,2,3}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | +- p:[7] c: [7] | `- p:[5] c: [5] YES