MAYBE * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. start(A) -> f(A) True (1,1) 1. f(A) -> f(A) [0 >= 1 + A^2] (?,1) Signature: {(f,1);(start,1)} Flow Graph: [0->{1},1->{1}] + Applied Processor: AddSinks + Details: () * Step 2: Failure MAYBE + Considered Problem: Rules: 0. start(A) -> f(A) True (1,1) 1. f(A) -> f(A) [0 >= 1 + A^2] (?,1) 2. f(A) -> exitus616(A) True (?,1) Signature: {(exitus616,1);(f,1);(start,1)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2] | `- p:[1] c: [] MAYBE