MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] (?,1) 5. f9(A,B,C) -> f17(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] (?,1) 6. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] (?,1) 8. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{5,6,7},1->{5,6,7},2->{3,4},3->{},4->{},5->{3,4},6->{0,1,2},7->{0,1,2},8->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,4),(5,3)] * Step 2: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] (?,1) 5. f9(A,B,C) -> f17(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] (?,1) 6. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] (?,1) 8. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{5,6,7},1->{5,6,7},2->{3},3->{},4->{},5->{4},6->{0,1,2},7->{0,1,2},8->{0,1,2}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 3: Failure MAYBE + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [-1*C >= 0 && C >= 0 && A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [-1*C >= 0 && C >= 0 && A = 0] (1,1) 3. f17(A,B,C) -> f24(A,B,C) [1 + -1*C >= 0 && C >= 0 && 0 >= C] (1,1) 4. f17(A,B,C) -> f24(A,B,0) [1 + -1*C >= 0 && C >= 0 && C = 1] (1,1) 5. f9(A,B,C) -> f17(A,0,1) [-1*C >= 0 && C >= 0 && B = 0] (1,1) 6. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && 0 >= 1 + B] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [-1*C >= 0 && C >= 0 && B >= 1] (?,1) 8. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{5,6,7},1->{5,6,7},2->{3},3->{},4->{},5->{4},6->{0,1,2},7->{0,1,2},8->{0,1,2}] + Applied Processor: Failing "Open problems left." + Details: Open problems left. MAYBE