MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f12(A,B,C,D,E,F,G,H,I,J,K) -> f5(0,B,C,0,0,F,G,M,M,0,0) [A = 0] (?,1) 1. f20(A,B,C,D,E,F,G,H,I,J,K) -> f12(-1 + A,B,C,D,E,0,0,H,I,J,K) True (?,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K) -> f5(A,B,C,1,1,F,G,H,I,J,K) [15 >= M] (1,1) 3. f12(A,B,C,D,E,F,G,H,I,J,K) -> f20(A,M,M,D,E,F,G,H,I,J,K) [A >= 1] (?,1) 4. f12(A,B,C,D,E,F,G,H,I,J,K) -> f20(A,M,M,D,E,F,G,H,I,J,K) [0 >= 1 + A] (?,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K) -> f12(M,B,C,D,E,F,G,H,I,J,K) [15 >= L] (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K) -> f5(A,B,C,D,E,F,G,H,I,J,K) True (1,1) Signature: {(f0,11);(f12,11);(f20,11);(f5,11)} Flow Graph: [0->{},1->{0,3,4},2->{},3->{1},4->{1},5->{0,3,4},6->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks MAYBE + Considered Problem: Rules: 0. f12(A,B,C,D,E,F,G,H,I,J,K) -> f5(0,B,C,0,0,F,G,M,M,0,0) [A = 0] (1,1) 1. f20(A,B,C,D,E,F,G,H,I,J,K) -> f12(-1 + A,B,C,D,E,0,0,H,I,J,K) True (?,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K) -> f5(A,B,C,1,1,F,G,H,I,J,K) [15 >= M] (1,1) 3. f12(A,B,C,D,E,F,G,H,I,J,K) -> f20(A,M,M,D,E,F,G,H,I,J,K) [A >= 1] (?,1) 4. f12(A,B,C,D,E,F,G,H,I,J,K) -> f20(A,M,M,D,E,F,G,H,I,J,K) [0 >= 1 + A] (?,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K) -> f12(M,B,C,D,E,F,G,H,I,J,K) [15 >= L] (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K) -> f5(A,B,C,D,E,F,G,H,I,J,K) True (1,1) Signature: {(f0,11);(f12,11);(f20,11);(f5,11)} Flow Graph: [0->{},1->{0,3,4},2->{},3->{1},4->{1},5->{0,3,4},6->{}] + Applied Processor: AddSinks + Details: () * Step 3: Failure MAYBE + Considered Problem: Rules: 0. f12(A,B,C,D,E,F,G,H,I,J,K) -> f5(0,B,C,0,0,F,G,M,M,0,0) [A = 0] (?,1) 1. f20(A,B,C,D,E,F,G,H,I,J,K) -> f12(-1 + A,B,C,D,E,0,0,H,I,J,K) True (?,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K) -> f5(A,B,C,1,1,F,G,H,I,J,K) [15 >= M] (1,1) 3. f12(A,B,C,D,E,F,G,H,I,J,K) -> f20(A,M,M,D,E,F,G,H,I,J,K) [A >= 1] (?,1) 4. f12(A,B,C,D,E,F,G,H,I,J,K) -> f20(A,M,M,D,E,F,G,H,I,J,K) [0 >= 1 + A] (?,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K) -> f12(M,B,C,D,E,F,G,H,I,J,K) [15 >= L] (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K) -> f5(A,B,C,D,E,F,G,H,I,J,K) True (1,1) 7. f0(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) 8. f12(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);(f0,11);(f12,11);(f20,11);(f5,11)} Flow Graph: [0->{},1->{0,3,4,8},2->{},3->{1},4->{1},5->{0,3,4,8},6->{},7->{},8->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | `- p:[1,3,4] c: [3] | `- p:[1,4] c: [] MAYBE