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