MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1] (?,1) 1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E) [0 >= F && A >= 1 && A >= 1 + B] (?,1) 2. f20(A,B,C,D,E) -> f20(A,B,C,D,E) True (?,1) 3. f22(A,B,C,D,E) -> f25(A,B,C,D,E) True (?,1) 4. f10(A,B,C,D,E) -> f20(A,B,C,D,E) [0 >= A] (?,1) 5. f0(A,B,C,D,E) -> f10(8,F,0,D,8) [F >= 1] (1,1) Signature: {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)} Flow Graph: [0->{0,1,4},1->{0,1,4},2->{2},3->{},4->{2},5->{0,1,4}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1] (?,1) 1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E) [0 >= F && A >= 1 && A >= 1 + B] (?,1) 2. f20(A,B,C,D,E) -> f20(A,B,C,D,E) True (?,1) 3. f22(A,B,C,D,E) -> f25(A,B,C,D,E) True (1,1) 4. f10(A,B,C,D,E) -> f20(A,B,C,D,E) [0 >= A] (1,1) 5. f0(A,B,C,D,E) -> f10(8,F,0,D,8) [F >= 1] (1,1) Signature: {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)} Flow Graph: [0->{0,1,4},1->{0,1,4},2->{2},3->{},4->{2},5->{0,1,4}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(5,4)] * Step 3: UnreachableRules MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1] (?,1) 1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E) [0 >= F && A >= 1 && A >= 1 + B] (?,1) 2. f20(A,B,C,D,E) -> f20(A,B,C,D,E) True (?,1) 3. f22(A,B,C,D,E) -> f25(A,B,C,D,E) True (1,1) 4. f10(A,B,C,D,E) -> f20(A,B,C,D,E) [0 >= A] (1,1) 5. f0(A,B,C,D,E) -> f10(8,F,0,D,8) [F >= 1] (1,1) Signature: {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)} Flow Graph: [0->{0,1,4},1->{0,1,4},2->{2},3->{},4->{2},5->{0,1}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [3] * Step 4: AddSinks MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1] (?,1) 1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E) [0 >= F && A >= 1 && A >= 1 + B] (?,1) 2. f20(A,B,C,D,E) -> f20(A,B,C,D,E) True (?,1) 4. f10(A,B,C,D,E) -> f20(A,B,C,D,E) [0 >= A] (1,1) 5. f0(A,B,C,D,E) -> f10(8,F,0,D,8) [F >= 1] (1,1) Signature: {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)} Flow Graph: [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1}] + Applied Processor: AddSinks + Details: () * Step 5: UnsatPaths MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1] (?,1) 1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E) [0 >= F && A >= 1 && A >= 1 + B] (?,1) 2. f20(A,B,C,D,E) -> f20(A,B,C,D,E) True (?,1) 4. f10(A,B,C,D,E) -> f20(A,B,C,D,E) [0 >= A] (?,1) 5. f0(A,B,C,D,E) -> f10(8,F,0,D,8) [F >= 1] (1,1) 6. f20(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(exitus616,5);(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)} Flow Graph: [0->{0,1,4},1->{0,1,4},2->{2,6},4->{2,6},5->{0,1,4},6->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(5,4)] * Step 6: Failure MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1] (?,1) 1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E) [0 >= F && A >= 1 && A >= 1 + B] (?,1) 2. f20(A,B,C,D,E) -> f20(A,B,C,D,E) True (?,1) 4. f10(A,B,C,D,E) -> f20(A,B,C,D,E) [0 >= A] (?,1) 5. f0(A,B,C,D,E) -> f10(8,F,0,D,8) [F >= 1] (1,1) 6. f20(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(exitus616,5);(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)} Flow Graph: [0->{0,1,4},1->{0,1,4},2->{2,6},4->{2,6},5->{0,1},6->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,4,5,6] | +- p:[0,1] c: [1] | | | `- p:[0] c: [0] | `- p:[2] c: [] MAYBE