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