YES * Step 1: UnsatRules YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [A = 0 && B = 0 && C = D && E = F] (?,1) 1. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [0 >= 1 + B && A = B && C = D && E = F] (?,1) 2. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [B >= 1 && A = B && C = D && E = F] (?,1) 3. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E = 40 && C = 100 && A = 0 && B = 0] (?,1) 4. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] (?,1) 5. lbl91(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 && 39 >= E && E >= 1 && 40 >= E && C = 100 && A = 0 && B = 0] (?,1) 6. lbl91(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 && 39 >= E && E >= 1 && 40 >= E && C = 100 && A = 0 && B = 0] (?,1) 7. lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 8. lbl111(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 2 && 41 >= E && A = 0 && C = 100 && B = 0] (?,1) 9. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 10. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 11. start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True (1,1) Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{3,4,5,6},1->{7,8,9,10},2->{7,8,9,10},3->{},4->{3,4,5,6},5->{7,8,9,10},6->{7,8,9,10},7->{},8->{3,4,5 ,6},9->{7,8,9,10},10->{7,8,9,10},11->{0,1,2}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [5,6] * Step 2: UnsatPaths YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [A = 0 && B = 0 && C = D && E = F] (?,1) 1. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [0 >= 1 + B && A = B && C = D && E = F] (?,1) 2. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [B >= 1 && A = B && C = D && E = F] (?,1) 3. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E = 40 && C = 100 && A = 0 && B = 0] (?,1) 4. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] (?,1) 7. lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 8. lbl111(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 2 && 41 >= E && A = 0 && C = 100 && B = 0] (?,1) 9. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 10. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 11. start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True (1,1) Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{3,4},1->{7,8,9,10},2->{7,8,9,10},3->{},4->{3,4},7->{},8->{3,4},9->{7,8,9,10},10->{7,8,9,10},11->{0,1 ,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,3) ,(1,7) ,(1,8) ,(1,10) ,(2,7) ,(2,8) ,(2,9) ,(9,8) ,(9,10) ,(10,8) ,(10,9)] * Step 3: UnreachableRules YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [A = 0 && B = 0 && C = D && E = F] (?,1) 1. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [0 >= 1 + B && A = B && C = D && E = F] (?,1) 2. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [B >= 1 && A = B && C = D && E = F] (?,1) 3. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E = 40 && C = 100 && A = 0 && B = 0] (?,1) 4. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] (?,1) 7. lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 8. lbl111(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 2 && 41 >= E && A = 0 && C = 100 && B = 0] (?,1) 9. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 10. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 11. start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True (1,1) Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{4},1->{9},2->{10},3->{},4->{3,4},7->{},8->{3,4},9->{7,9},10->{7,10},11->{0,1,2}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [8] * Step 4: FromIts YES + Considered Problem: Rules: 0. start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [A = 0 && B = 0 && C = D && E = F] (?,1) 1. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [0 >= 1 + B && A = B && C = D && E = F] (?,1) 2. start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [B >= 1 && A = B && C = D && E = F] (?,1) 3. lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E = 40 && C = 100 && A = 0 && B = 0] (?,1) 4. lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] (?,1) 7. lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 9. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 10. lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] (?,1) 11. start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True (1,1) Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Flow Graph: [0->{4},1->{9},2->{10},3->{},4->{3,4},7->{},9->{7,9},10->{7,10},11->{0,1,2}] + Applied Processor: FromIts + Details: () * Step 5: Decompose YES + Considered Problem: Rules: start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [A = 0 && B = 0 && C = D && E = F] start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [0 >= 1 + B && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [B >= 1 && A = B && C = D && E = F] lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E = 40 && C = 100 && A = 0 && B = 0] lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Rule Graph: [0->{4},1->{9},2->{10},3->{},4->{3,4},7->{},9->{7,9},10->{7,10},11->{0,1,2}] + Applied Processor: Decompose NoGreedy + Details: We construct a looptree: P: [0,1,2,3,4,7,9,10,11] | +- p:[10] c: [10] | +- p:[9] c: [9] | `- p:[4] c: [4] * Step 6: CloseWith YES + Considered Problem: (Rules: start(A,B,C,D,E,F) -> lbl91(A,B,100,D,1,F) [A = 0 && B = 0 && C = D && E = F] start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [0 >= 1 + B && A = B && C = D && E = F] start(A,B,C,D,E,F) -> lbl111(A,B,100,D,2,F) [B >= 1 && A = B && C = D && E = F] lbl91(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E = 40 && C = 100 && A = 0 && B = 0] lbl91(A,B,C,D,E,F) -> lbl91(A,B,C,D,1 + E,F) [39 >= E && E >= 1 && 40 >= E && A = 0 && C = 100 && B = 0] lbl111(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [E >= 40 && E >= 2 && 41 >= E && C = 100 && A = B] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [0 >= 1 + B && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] lbl111(A,B,C,D,E,F) -> lbl111(A,B,C,D,2 + E,F) [B >= 1 && 39 >= E && E >= 2 && 41 >= E && C = 100 && A = B] start0(A,B,C,D,E,F) -> start(B,B,D,D,F,F) True Signature: {(lbl111,6);(lbl91,6);(start,6);(start0,6);(stop,6)} Rule Graph: [0->{4},1->{9},2->{10},3->{},4->{3,4},7->{},9->{7,9},10->{7,10},11->{0,1,2}] ,We construct a looptree: P: [0,1,2,3,4,7,9,10,11] | +- p:[10] c: [10] | +- p:[9] c: [9] | `- p:[4] c: [4]) + Applied Processor: CloseWith True + Details: () YES