MAYBE * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. f1(A) -> f4(3) True (1,1) 1. f4(A) -> f4(3) [3 + -1*A >= 0 && -3 + A >= 0] (?,1) Signature: {(f1,1);(f4,1)} Flow Graph: [0->{1},1->{1}] + Applied Processor: AddSinks + Details: () * Step 2: Failure MAYBE + Considered Problem: Rules: 0. f1(A) -> f4(3) True (1,1) 1. f4(A) -> f4(3) [3 + -1*A >= 0 && -3 + A >= 0] (?,1) 2. f4(A) -> exitus616(A) True (?,1) Signature: {(exitus616,1);(f1,1);(f4,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