MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,F,F,G,H,I,J,K) [-1 + H >= 0 && A >= 2] (?,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,E,F,N,H,I,J,K) [-1 + H >= 0 && 1 >= A] (?,1) 2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,O,O,G,H,P,Q,R) [H >= 1] (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,N,P,O,H,Q,N,R) [0 >= H] (1,1) Signature: {(f1,11);(f2,11);(f300,11)} Flow Graph: [0->{0,1},1->{},2->{0,1},3->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,F,F,G,H,I,J,K) [-1 + H >= 0 && A >= 2] (?,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,E,F,N,H,I,J,K) [-1 + H >= 0 && 1 >= A] (1,1) 2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,O,O,G,H,P,Q,R) [H >= 1] (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,N,P,O,H,Q,N,R) [0 >= H] (1,1) Signature: {(f1,11);(f2,11);(f300,11)} Flow Graph: [0->{0,1},1->{},2->{0,1},3->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,1)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,F,F,G,H,I,J,K) [-1 + H >= 0 && A >= 2] (?,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,E,F,N,H,I,J,K) [-1 + H >= 0 && 1 >= A] (1,1) 2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,O,O,G,H,P,Q,R) [H >= 1] (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,N,P,O,H,Q,N,R) [0 >= H] (1,1) Signature: {(f1,11);(f2,11);(f300,11)} Flow Graph: [0->{0},1->{},2->{0,1},3->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,F,F,G,H,I,J,K) [-1 + H >= 0 && A >= 2] (?,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,E,F,N,H,I,J,K) [-1 + H >= 0 && 1 >= A] (?,1) 2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,O,O,G,H,P,Q,R) [H >= 1] (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,N,P,O,H,Q,N,R) [0 >= H] (1,1) 4. f300(A,B,C,D,E,F,G,H,I,J,K) -> exitus616(A,B,C,D,E,F,G,H,I,J,K) True (1,1) 5. f2(A,B,C,D,E,F,G,H,I,J,K) -> exitus616(A,B,C,D,E,F,G,H,I,J,K) True (?,1) Signature: {(exitus616,11);(f1,11);(f2,11);(f300,11)} Flow Graph: [0->{0,1,5},1->{},2->{0,1,5},3->{},4->{},5->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,1)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,F,F,G,H,I,J,K) [-1 + H >= 0 && A >= 2] (?,1) 1. f2(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,E,F,N,H,I,J,K) [-1 + H >= 0 && 1 >= A] (?,1) 2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,L,M,N,O,O,G,H,P,Q,R) [H >= 1] (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,M,D,N,P,O,H,Q,N,R) [0 >= H] (1,1) 4. f300(A,B,C,D,E,F,G,H,I,J,K) -> exitus616(A,B,C,D,E,F,G,H,I,J,K) True (1,1) 5. f2(A,B,C,D,E,F,G,H,I,J,K) -> exitus616(A,B,C,D,E,F,G,H,I,J,K) True (?,1) Signature: {(exitus616,11);(f1,11);(f2,11);(f300,11)} Flow Graph: [0->{0,5},1->{},2->{0,1,5},3->{},4->{},5->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5] | `- p:[0] c: [] MAYBE