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