YES(?,PRIMREC) * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f(A,B) -> g(A,B) True (1,1) 1. g(A,B) -> g(2*A,-1 + B) [-1 + B >= 0] (?,1) 2. g(A,B) -> h(A,B) [0 >= B] (?,1) 3. h(A,B) -> h(-1 + A,B) [-1*B >= 0 && -1 + A >= 0] (?,1) Signature: {(f,2);(g,2);(h,2)} Flow Graph: [0->{1,2},1->{1,2},2->{3},3->{3}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks MAYBE + Considered Problem: Rules: 0. f(A,B) -> g(A,B) True (1,1) 1. g(A,B) -> g(2*A,-1 + B) [-1 + B >= 0] (?,1) 2. g(A,B) -> h(A,B) [0 >= B] (1,1) 3. h(A,B) -> h(-1 + A,B) [-1*B >= 0 && -1 + A >= 0] (?,1) Signature: {(f,2);(g,2);(h,2)} Flow Graph: [0->{1,2},1->{1,2},2->{3},3->{3}] + Applied Processor: AddSinks + Details: () * Step 3: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. f(A,B) -> g(A,B) True (1,1) 1. g(A,B) -> g(2*A,-1 + B) [-1 + B >= 0] (?,1) 2. g(A,B) -> h(A,B) [0 >= B] (?,1) 3. h(A,B) -> h(-1 + A,B) [-1*B >= 0 && -1 + A >= 0] (?,1) 4. h(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f,2);(g,2);(h,2)} Flow Graph: [0->{1,2},1->{1,2},2->{3,4},3->{3,4},4->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4] | +- p:[1] c: [1] | `- p:[3] c: [3] * Step 4: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. f(A,B) -> g(A,B) True (1,1) 1. g(A,B) -> g(2*A,-1 + B) [-1 + B >= 0] (?,1) 2. g(A,B) -> h(A,B) [0 >= B] (?,1) 3. h(A,B) -> h(-1 + A,B) [-1*B >= 0 && -1 + A >= 0] (?,1) 4. h(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f,2);(g,2);(h,2)} Flow Graph: [0->{1,2},1->{1,2},2->{3,4},3->{3,4},4->{}] ,We construct a looptree: P: [0,1,2,3,4] | +- p:[1] c: [1] | `- p:[3] c: [3]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 5: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,0.0,0.1] f ~> g [A <= A, B <= B] g ~> g [A <= 2*A, B <= B] g ~> h [A <= A, B <= B] h ~> h [A <= A, B <= B] h ~> exitus616 [A <= A, B <= B] + Loop: [0.0 <= B] g ~> g [A <= 2*A, B <= B] + Loop: [0.1 <= A] h ~> h [A <= A, B <= B] + Applied Processor: FlowAbstraction + Details: () * Step 6: LareProcessor MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,0.0,0.1] f ~> g [] g ~> g [A ~*> A] g ~> h [] h ~> h [] h ~> exitus616 [] + Loop: [B ~=> 0.0] g ~> g [A ~*> A] + Loop: [A ~=> 0.1] h ~> h [] + Applied Processor: LareProcessor + Details: f ~> exitus616 [A ~=> 0.1 ,B ~=> 0.0 ,A ~+> tick ,B ~+> tick ,tick ~+> tick ,A ~*> A ,A ~*> 0.1 ,A ~*> tick ,B ~^> A ,B ~^> 0.1 ,B ~^> tick] + g> [B ~=> 0.0,B ~+> tick,tick ~+> tick,A ~*> A,B ~^> A] + h> [A ~=> 0.1,A ~+> tick,tick ~+> tick] YES(?,PRIMREC)