YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (?,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) Signature: {(cut,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,3,4},1->{},2->{2,3,4},3->{5},4->{},5->{2,3,4},6->{0,1}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (1,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) Signature: {(cut,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,3,4},1->{},2->{2,3,4},3->{5},4->{},5->{2,3,4},6->{0,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,3),(5,3),(5,4)] * Step 3: Looptree YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl71(A,B,1,D,0,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 2 && B = A && C = D && E = F] 1. start(A,B,C,D,E,F) -> stop(A,B,0,D,1,F) [E + -1*F >= 0 (1,1) && -1*E + F >= 0 && C + -1*D >= 0 && -1*C + D >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 1 >= A && B = A && C = D && E = F] 2. lbl71(A,B,C,D,E,F) -> lbl71(A,B,1 + C,D,E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 + C && A >= 1 + C && A >= 2 + E && C >= 1 && B = A] 3. lbl71(A,B,C,D,E,F) -> cut(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (?,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 3 + E && A >= 2 + E && A >= 2 && 1 + C = A && B = A] 4. lbl71(A,B,C,D,E,F) -> stop(A,B,C,D,1 + E,F) [-2 + B + -1*E >= 0 (1,1) && -2 + A + -1*E >= 0 && E >= 0 && -1 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -3 + A + C >= 0 && A + -1*B >= 0 && -2 + B >= 0 && -4 + A + B >= 0 && -1*A + B >= 0 && -2 + A >= 0 && A >= 2 && 2 + E = A && 1 + C = A && B = A] 5. cut(A,B,C,D,E,F) -> lbl71(A,B,1,D,E,F) [-1 + C + -1*E >= 0 (?,1) && -2 + B + -1*E >= 0 && -2 + A + -1*E >= 0 && -1 + E >= 0 && -3 + C + E >= 0 && -4 + B + E >= 0 && -4 + A + E >= 0 && -1 + B + -1*C >= 0 && -1 + A + -1*C >= 0 && -2 + C >= 0 && -5 + B + C >= 0 && 1 + -1*B + C >= 0 && -5 + A + C >= 0 && 1 + -1*A + C >= 0 && A + -1*B >= 0 && -3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0 && A >= 2 && A >= 2 + E && E >= 1 && 1 + C = A && B = A] 6. start0(A,B,C,D,E,F) -> start(A,A,D,D,F,F) True (1,1) Signature: {(cut,6);(lbl71,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{2,4},1->{},2->{2,3,4},3->{5},4->{},5->{2},6->{0,1}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6] | `- p:[2,5,3] c: [5] | `- p:[2] c: [2] YES