MAYBE * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,C,C,L,M,N,G,H,I,J,K) [-1 + G >= 0 && -2 + A + G >= 0 && -1 + A >= 0 && A >= 1] (?,1) 1. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,N,P,Q,F,G,L,M,O,R) [0 >= G] (1,1) 2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,N,N,P,Q,R,G,L,M,O,K) [A >= 1 && G >= 1] (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,N,N,P,Q,R,G,L,M,O,S) [0 >= A && G >= 1] (1,1) Signature: {(f1,11);(f2,11);(f300,11)} Flow Graph: [0->{0},1->{},2->{0},3->{}] + Applied Processor: AddSinks + Details: () * Step 2: Failure MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,C,C,L,M,N,G,H,I,J,K) [-1 + G >= 0 && -2 + A + G >= 0 && -1 + A >= 0 && A >= 1] (?,1) 1. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,L,N,P,Q,F,G,L,M,O,R) [0 >= G] (1,1) 2. f300(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,N,N,P,Q,R,G,L,M,O,K) [A >= 1 && G >= 1] (1,1) 3. f300(A,B,C,D,E,F,G,H,I,J,K) -> f1(A,N,N,P,Q,R,G,L,M,O,S) [0 >= A && G >= 1] (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,5},3->{},4->{},5->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5] | `- p:[0] c: [] MAYBE