NO * Step 1: TrivialSCCs NO + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f6(8,0,14,-1,E,F,G) True (1,1) 1. f6(A,B,C,D,E,F,G) -> f12(A,B,C,D,I,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B && A >= 1 + H] (?,1) 2. f6(A,B,C,D,E,F,G) -> f12(A,B,C,D,I,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B] (?,1) 3. f6(A,B,C,D,E,F,G) -> f6(A,B,-1 + B,I,H,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B] (?,1) 4. f12(A,B,C,D,E,F,G) -> f6(A,B,-1 + E,D,E,F,G) [-1*B + C >= 0 && 8 + -1*A >= 0 && -8 + A >= 0] (?,1) 5. f12(A,B,C,D,E,F,G) -> f6(A,1 + E,C,D,E,F,G) [-1*B + C >= 0 && 8 + -1*A >= 0 && -8 + A >= 0] (?,1) 6. f6(A,B,C,D,E,F,G) -> f20(A,B,C,D,E,D,D) [8 + -1*A >= 0 && -8 + A >= 0 && B >= 1 + C] (?,1) Signature: {(f0,7);(f12,7);(f20,7);(f6,7)} Flow Graph: [0->{1,2,3,6},1->{4,5},2->{4,5},3->{1,2,3,6},4->{1,2,3,6},5->{1,2,3,6},6->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths NO + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f6(8,0,14,-1,E,F,G) True (1,1) 1. f6(A,B,C,D,E,F,G) -> f12(A,B,C,D,I,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B && A >= 1 + H] (?,1) 2. f6(A,B,C,D,E,F,G) -> f12(A,B,C,D,I,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B] (?,1) 3. f6(A,B,C,D,E,F,G) -> f6(A,B,-1 + B,I,H,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B] (?,1) 4. f12(A,B,C,D,E,F,G) -> f6(A,B,-1 + E,D,E,F,G) [-1*B + C >= 0 && 8 + -1*A >= 0 && -8 + A >= 0] (?,1) 5. f12(A,B,C,D,E,F,G) -> f6(A,1 + E,C,D,E,F,G) [-1*B + C >= 0 && 8 + -1*A >= 0 && -8 + A >= 0] (?,1) 6. f6(A,B,C,D,E,F,G) -> f20(A,B,C,D,E,D,D) [8 + -1*A >= 0 && -8 + A >= 0 && B >= 1 + C] (1,1) Signature: {(f0,7);(f12,7);(f20,7);(f6,7)} Flow Graph: [0->{1,2,3,6},1->{4,5},2->{4,5},3->{1,2,3,6},4->{1,2,3,6},5->{1,2,3,6},6->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,6),(3,1),(3,2),(3,3)] * Step 3: Looptree NO + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f6(8,0,14,-1,E,F,G) True (1,1) 1. f6(A,B,C,D,E,F,G) -> f12(A,B,C,D,I,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B && A >= 1 + H] (?,1) 2. f6(A,B,C,D,E,F,G) -> f12(A,B,C,D,I,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B] (?,1) 3. f6(A,B,C,D,E,F,G) -> f6(A,B,-1 + B,I,H,F,G) [8 + -1*A >= 0 && -8 + A >= 0 && C >= B] (?,1) 4. f12(A,B,C,D,E,F,G) -> f6(A,B,-1 + E,D,E,F,G) [-1*B + C >= 0 && 8 + -1*A >= 0 && -8 + A >= 0] (?,1) 5. f12(A,B,C,D,E,F,G) -> f6(A,1 + E,C,D,E,F,G) [-1*B + C >= 0 && 8 + -1*A >= 0 && -8 + A >= 0] (?,1) 6. f6(A,B,C,D,E,F,G) -> f20(A,B,C,D,E,D,D) [8 + -1*A >= 0 && -8 + A >= 0 && B >= 1 + C] (1,1) Signature: {(f0,7);(f12,7);(f20,7);(f6,7)} Flow Graph: [0->{1,2,3},1->{4,5},2->{4,5},3->{6},4->{1,2,3,6},5->{1,2,3,6},6->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6] | `- p:[1,4,2,5] c: [] NO