MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f3(A,B) -> f0(0,B) True (1,1) 1. f0(A,B) -> f0(A,-1 + B) [B >= 1] (?,1) 2. f4(A,B) -> f4(A,B) True (?,1) 3. f0(A,B) -> f4(-1,B) [0 >= B] (?,1) Signature: {(f0,2);(f3,2);(f4,2)} Flow Graph: [0->{1,3},1->{1,3},2->{2},3->{2}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks MAYBE + Considered Problem: Rules: 0. f3(A,B) -> f0(0,B) True (1,1) 1. f0(A,B) -> f0(A,-1 + B) [B >= 1] (?,1) 2. f4(A,B) -> f4(A,B) True (?,1) 3. f0(A,B) -> f4(-1,B) [0 >= B] (1,1) Signature: {(f0,2);(f3,2);(f4,2)} Flow Graph: [0->{1,3},1->{1,3},2->{2},3->{2}] + Applied Processor: AddSinks + Details: () * Step 3: Failure MAYBE + Considered Problem: Rules: 0. f3(A,B) -> f0(0,B) True (1,1) 1. f0(A,B) -> f0(A,-1 + B) [B >= 1] (?,1) 2. f4(A,B) -> f4(A,B) True (?,1) 3. f0(A,B) -> f4(-1,B) [0 >= B] (?,1) 4. f4(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f0,2);(f3,2);(f4,2)} Flow Graph: [0->{1,3},1->{1,3},2->{2,4},3->{2,4},4->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4] | +- p:[1] c: [1] | `- p:[2] c: [] MAYBE