YES(?,O(1)) * Step 1: ArgumentFilter WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f7(F,F,10,0,E) True (1,1) 1. f7(A,B,C,D,E) -> f7(A,B,C,1 + D,F) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && C >= 1 + D] (?,1) 2. f7(A,B,C,D,E) -> f19(A,B,C,D,E) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && D >= C] (?,1) Signature: {(f0,5);(f19,5);(f7,5)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: ArgumentFilter [0,1,4] + Details: We remove following argument positions: [0,1,4]. * Step 2: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(C,D) -> f7(10,0) True (1,1) 1. f7(C,D) -> f7(C,1 + D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && C >= 1 + D] (?,1) 2. f7(C,D) -> f19(C,D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && D >= C] (?,1) Signature: {(f0,5);(f19,5);(f7,5)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2)] * Step 3: FromIts WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(C,D) -> f7(10,0) True (1,1) 1. f7(C,D) -> f7(C,1 + D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && C >= 1 + D] (?,1) 2. f7(C,D) -> f19(C,D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && D >= C] (?,1) Signature: {(f0,5);(f19,5);(f7,5)} Flow Graph: [0->{1},1->{1,2},2->{}] + Applied Processor: FromIts + Details: () * Step 4: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: f0(C,D) -> f7(10,0) True f7(C,D) -> f7(C,1 + D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && C >= 1 + D] f7(C,D) -> f19(C,D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && D >= C] Signature: {(f0,5);(f19,5);(f7,5)} Rule Graph: [0->{1},1->{1,2},2->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose WORST_CASE(?,O(1)) + Considered Problem: Rules: f0(C,D) -> f7(10,0) True f7(C,D) -> f7(C,1 + D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && C >= 1 + D] f7(C,D) -> f19(C,D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && D >= C] f19(C,D) -> exitus616(C,D) True Signature: {(exitus616,2);(f0,5);(f19,5);(f7,5)} Rule Graph: [0->{1},1->{1,2},2->{3}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3] | `- p:[1] c: [1] * Step 6: AbstractSize WORST_CASE(?,O(1)) + Considered Problem: (Rules: f0(C,D) -> f7(10,0) True f7(C,D) -> f7(C,1 + D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && C >= 1 + D] f7(C,D) -> f19(C,D) [D >= 0 && -10 + C + D >= 0 && 10 + -1*C + D >= 0 && 10 + -1*C >= 0 && -10 + C >= 0 && D >= C] f19(C,D) -> exitus616(C,D) True Signature: {(exitus616,2);(f0,5);(f19,5);(f7,5)} Rule Graph: [0->{1},1->{1,2},2->{3}] ,We construct a looptree: P: [0,1,2,3] | `- p:[1] c: [1]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [C,D,0.0] f0 ~> f7 [C <= 10*K, D <= 0*K] f7 ~> f7 [C <= C, D <= 10*K] f7 ~> f19 [C <= C, D <= D] f19 ~> exitus616 [C <= C, D <= D] + Loop: [0.0 <= K + C + D] f7 ~> f7 [C <= C, D <= 10*K] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,C,D,0.0] f0 ~> f7 [K ~=> C,K ~=> D] f7 ~> f7 [K ~=> D] f7 ~> f19 [] f19 ~> exitus616 [] + Loop: [C ~+> 0.0,D ~+> 0.0,K ~+> 0.0] f7 ~> f7 [K ~=> D] + Applied Processor: Lare + Details: f0 ~> exitus616 [K ~=> C,K ~=> D,tick ~+> tick,K ~+> 0.0,K ~+> tick,K ~*> 0.0,K ~*> tick] + f7> [K ~=> D,C ~+> 0.0,C ~+> tick,D ~+> 0.0,D ~+> tick,tick ~+> tick,K ~+> 0.0,K ~+> tick] YES(?,O(1))