MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F) -> f300(A,B,C,D,E,G) [C >= D] (?,1) 1. f2(A,B,C,D,E,F) -> f2(A,B,C,D,G,F) [D >= 1 + C] (?,1) 2. f1(A,B,C,D,E,F) -> f2(G,G,C,D,E,F) True (1,1) Signature: {(f1,6);(f2,6);(f300,6)} Flow Graph: [0->{},1->{0,1},2->{0,1}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F) -> f300(A,B,C,D,E,G) [C >= D] (1,1) 1. f2(A,B,C,D,E,F) -> f2(A,B,C,D,G,F) [D >= 1 + C] (?,1) 2. f1(A,B,C,D,E,F) -> f2(G,G,C,D,E,F) True (1,1) Signature: {(f1,6);(f2,6);(f300,6)} Flow Graph: [0->{},1->{0,1},2->{0,1}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,0)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F) -> f300(A,B,C,D,E,G) [C >= D] (1,1) 1. f2(A,B,C,D,E,F) -> f2(A,B,C,D,G,F) [D >= 1 + C] (?,1) 2. f1(A,B,C,D,E,F) -> f2(G,G,C,D,E,F) True (1,1) Signature: {(f1,6);(f2,6);(f300,6)} Flow Graph: [0->{},1->{1},2->{0,1}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F) -> f300(A,B,C,D,E,G) [C >= D] (?,1) 1. f2(A,B,C,D,E,F) -> f2(A,B,C,D,G,F) [D >= 1 + C] (?,1) 2. f1(A,B,C,D,E,F) -> f2(G,G,C,D,E,F) True (1,1) 3. f2(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) Signature: {(exitus616,6);(f1,6);(f2,6);(f300,6)} Flow Graph: [0->{},1->{0,1,3},2->{0,1,3},3->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,0)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. f2(A,B,C,D,E,F) -> f300(A,B,C,D,E,G) [C >= D] (?,1) 1. f2(A,B,C,D,E,F) -> f2(A,B,C,D,G,F) [D >= 1 + C] (?,1) 2. f1(A,B,C,D,E,F) -> f2(G,G,C,D,E,F) True (1,1) 3. f2(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True (?,1) Signature: {(exitus616,6);(f1,6);(f2,6);(f300,6)} Flow Graph: [0->{},1->{1,3},2->{0,1,3},3->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3] | `- p:[1] c: [] MAYBE