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