YES(?,PRIMREC) * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. eval1(A,B,C) -> eval2(A,B,C) [A >= 1 + B] (?,1) 1. eval2(A,B,C) -> eval1(A,1 + B,C) [A >= 1 + C] (?,1) 2. eval2(A,B,C) -> eval1(A,B,1 + C) [A >= 1 + C] (?,1) 3. eval2(A,B,C) -> eval1(-1 + A,B,C) [C >= A] (?,1) 4. start(A,B,C) -> eval1(A,B,C) True (1,1) Signature: {(eval1,3);(eval2,3);(start,3)} Flow Graph: [0->{1,2,3},1->{0},2->{0},3->{0},4->{0}] + Applied Processor: AddSinks + Details: () * Step 2: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. eval1(A,B,C) -> eval2(A,B,C) [A >= 1 + B] (?,1) 1. eval2(A,B,C) -> eval1(A,1 + B,C) [A >= 1 + C] (?,1) 2. eval2(A,B,C) -> eval1(A,B,1 + C) [A >= 1 + C] (?,1) 3. eval2(A,B,C) -> eval1(-1 + A,B,C) [C >= A] (?,1) 4. start(A,B,C) -> eval1(A,B,C) True (1,1) 5. eval1(A,B,C) -> exitus616(A,B,C) True (?,1) 6. eval2(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(eval1,3);(eval2,3);(exitus616,3);(start,3)} Flow Graph: [0->{1,2,3,6},1->{0,5},2->{0,5},3->{0,5},4->{0,5},5->{},6->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6] | `- p:[0,1,2,3] c: [2] | `- p:[0,1,3] c: [0] * Step 3: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. eval1(A,B,C) -> eval2(A,B,C) [A >= 1 + B] (?,1) 1. eval2(A,B,C) -> eval1(A,1 + B,C) [A >= 1 + C] (?,1) 2. eval2(A,B,C) -> eval1(A,B,1 + C) [A >= 1 + C] (?,1) 3. eval2(A,B,C) -> eval1(-1 + A,B,C) [C >= A] (?,1) 4. start(A,B,C) -> eval1(A,B,C) True (1,1) 5. eval1(A,B,C) -> exitus616(A,B,C) True (?,1) 6. eval2(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(eval1,3);(eval2,3);(exitus616,3);(start,3)} Flow Graph: [0->{1,2,3,6},1->{0,5},2->{0,5},3->{0,5},4->{0,5},5->{},6->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6] | `- p:[0,1,2,3] c: [2] | `- p:[0,1,3] c: [0]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 4: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,0.0,0.0.0] eval1 ~> eval2 [A <= A, B <= B, C <= C] eval2 ~> eval1 [A <= A, B <= K + B, C <= C] eval2 ~> eval1 [A <= A, B <= B, C <= A + C] eval2 ~> eval1 [A <= K + A, B <= B, C <= C] start ~> eval1 [A <= A, B <= B, C <= C] eval1 ~> exitus616 [A <= A, B <= B, C <= C] eval2 ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= K + A + C] eval1 ~> eval2 [A <= A, B <= B, C <= C] eval2 ~> eval1 [A <= A, B <= K + B, C <= C] eval2 ~> eval1 [A <= A, B <= B, C <= A + C] eval2 ~> eval1 [A <= K + A, B <= B, C <= C] + Loop: [0.0.0 <= 2*K + A + B] eval1 ~> eval2 [A <= A, B <= B, C <= C] eval2 ~> eval1 [A <= A, B <= K + B, C <= C] eval2 ~> eval1 [A <= K + A, B <= B, C <= C] + Applied Processor: FlowAbstraction + Details: () * Step 5: LareProcessor MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0,0.0.0] eval1 ~> eval2 [] eval2 ~> eval1 [B ~+> B,K ~+> B] eval2 ~> eval1 [A ~+> C,C ~+> C] eval2 ~> eval1 [A ~+> A,K ~+> A] start ~> eval1 [] eval1 ~> exitus616 [] eval2 ~> exitus616 [] + Loop: [A ~+> 0.0,C ~+> 0.0,K ~+> 0.0] eval1 ~> eval2 [] eval2 ~> eval1 [B ~+> B,K ~+> B] eval2 ~> eval1 [A ~+> C,C ~+> C] eval2 ~> eval1 [A ~+> A,K ~+> A] + Loop: [A ~+> 0.0.0,B ~+> 0.0.0,K ~*> 0.0.0] eval1 ~> eval2 [] eval2 ~> eval1 [B ~+> B,K ~+> B] eval2 ~> eval1 [A ~+> A,K ~+> A] + Applied Processor: LareProcessor + Details: start ~> exitus616 [A ~+> A ,A ~+> C ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> C ,A ~*> 0.0 ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> A ,B ~*> B ,B ~*> C ,B ~*> 0.0 ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> A ,C ~*> B ,C ~*> C ,C ~*> 0.0 ,C ~*> 0.0.0 ,C ~*> tick ,K ~*> A ,K ~*> B ,K ~*> C ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> A ,A ~^> B ,A ~^> C ,A ~^> 0.0 ,A ~^> 0.0.0 ,A ~^> tick ,B ~^> A ,B ~^> B ,B ~^> C ,B ~^> 0.0.0 ,B ~^> tick ,C ~^> A ,C ~^> B ,C ~^> C ,C ~^> 0.0 ,C ~^> 0.0.0 ,C ~^> tick ,K ~^> A ,K ~^> B ,K ~^> C ,K ~^> 0.0 ,K ~^> 0.0.0 ,K ~^> tick] + eval2> [A ~+> A ,A ~+> C ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> C ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> A ,B ~*> B ,B ~*> C ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> A ,C ~*> B ,C ~*> C ,C ~*> 0.0.0 ,C ~*> tick ,K ~*> A ,K ~*> B ,K ~*> C ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> A ,A ~^> B ,A ~^> C ,A ~^> 0.0.0 ,A ~^> tick ,C ~^> A ,C ~^> B ,C ~^> C ,C ~^> 0.0.0 ,C ~^> tick ,K ~^> A ,K ~^> B ,K ~^> C ,K ~^> 0.0.0 ,K ~^> tick] eval1> [A ~+> A ,A ~+> C ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> C ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> A ,B ~*> B ,B ~*> C ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> A ,C ~*> B ,C ~*> C ,C ~*> 0.0.0 ,C ~*> tick ,K ~*> A ,K ~*> B ,K ~*> C ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> A ,A ~^> B ,A ~^> C ,A ~^> 0.0.0 ,A ~^> tick ,C ~^> A ,C ~^> B ,C ~^> C ,C ~^> 0.0.0 ,C ~^> tick ,K ~^> A ,K ~^> B ,K ~^> C ,K ~^> 0.0.0 ,K ~^> tick] + eval2> [A ~+> A ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,A ~*> A ,A ~*> B ,B ~*> A ,B ~*> B ,K ~*> A ,K ~*> B ,K ~*> 0.0.0 ,K ~*> tick] eval1> [A ~+> A ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,A ~*> A ,A ~*> B ,B ~*> A ,B ~*> B ,K ~*> A ,K ~*> B ,K ~*> 0.0.0 ,K ~*> tick] YES(?,PRIMREC)