MAYBE * Step 1: FromIts MAYBE + Considered Problem: Rules: 0. f2(A,B) -> f2(-1 + A,B) [B >= 0 && A >= 1] (?,1) 1. f0(A,B) -> f2(C,-1 + B) [B >= 1] (1,1) 2. f2(A,B) -> f2(C,-1 + B) [B >= 0 && B >= 1 && 0 >= A] (?,1) Signature: {(f0,2);(f2,2)} Flow Graph: [0->{0,2},1->{0,2},2->{0,2}] + Applied Processor: FromIts + Details: () * Step 2: AddSinks MAYBE + Considered Problem: Rules: f2(A,B) -> f2(-1 + A,B) [B >= 0 && A >= 1] f0(A,B) -> f2(C,-1 + B) [B >= 1] f2(A,B) -> f2(C,-1 + B) [B >= 0 && B >= 1 && 0 >= A] Signature: {(f0,2);(f2,2)} Rule Graph: [0->{0,2},1->{0,2},2->{0,2}] + Applied Processor: AddSinks + Details: () * Step 3: Decompose MAYBE + Considered Problem: Rules: f2(A,B) -> f2(-1 + A,B) [B >= 0 && A >= 1] f0(A,B) -> f2(C,-1 + B) [B >= 1] f2(A,B) -> f2(C,-1 + B) [B >= 0 && B >= 1 && 0 >= A] f2(A,B) -> exitus616(A,B) True f2(A,B) -> exitus616(A,B) True Signature: {(exitus616,2);(f0,2);(f2,2)} Rule Graph: [0->{0,2,3},1->{0,2},2->{0,2,4}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4] | `- p:[0,2] c: [2] | `- p:[0] c: [0] * Step 4: AbstractSize MAYBE + Considered Problem: (Rules: f2(A,B) -> f2(-1 + A,B) [B >= 0 && A >= 1] f0(A,B) -> f2(C,-1 + B) [B >= 1] f2(A,B) -> f2(C,-1 + B) [B >= 0 && B >= 1 && 0 >= A] f2(A,B) -> exitus616(A,B) True f2(A,B) -> exitus616(A,B) True Signature: {(exitus616,2);(f0,2);(f2,2)} Rule Graph: [0->{0,2,3},1->{0,2},2->{0,2,4}] ,We construct a looptree: P: [0,1,2,3,4] | `- p:[0,2] c: [2] | `- p:[0] c: [0]) + Applied Processor: AbstractSize Minimize + Details: () * Step 5: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,0.0,0.0.0] f2 ~> f2 [A <= A, B <= B] f0 ~> f2 [A <= unknown, B <= B] f2 ~> f2 [A <= unknown, B <= B] f2 ~> exitus616 [A <= A, B <= B] f2 ~> exitus616 [A <= A, B <= B] + Loop: [0.0 <= B] f2 ~> f2 [A <= A, B <= B] f2 ~> f2 [A <= unknown, B <= B] + Loop: [0.0.0 <= K + A] f2 ~> f2 [A <= A, B <= B] + Applied Processor: AbstractFlow + Details: () * Step 6: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,0.0,0.0.0] f2 ~> f2 [] f0 ~> f2 [huge ~=> A] f2 ~> f2 [huge ~=> A] f2 ~> exitus616 [] f2 ~> exitus616 [] + Loop: [B ~=> 0.0] f2 ~> f2 [] f2 ~> f2 [huge ~=> A] + Loop: [A ~+> 0.0.0,K ~+> 0.0.0] f2 ~> f2 [] + Applied Processor: Lare + Details: Unknown bound. MAYBE