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