YES(?,O(1)) * Step 1: ArgumentFilter WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I) -> f7(30,30,1,0,2,F,G,H,I) True (1,1) 1. f7(A,B,C,D,E,F,G,H,I) -> f7(A,B,C + D,C,1 + E,C,G,H,I) [-2 + E >= 0 (?,1) && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && B >= E] 2. f7(A,B,C,D,E,F,G,H,I) -> f19(A,B,C,D,E,F,C,C,C) [-2 + E >= 0 (?,1) && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && E >= 1 + B] Signature: {(f0,9);(f19,9);(f7,9)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: ArgumentFilter [5,6,7,8] + Details: We remove following argument positions: [5,6,7,8]. * Step 2: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f7(30,30,1,0,2) True (1,1) 1. f7(A,B,C,D,E) -> f7(A,B,C + D,C,1 + E) [-2 + E >= 0 (?,1) && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && B >= E] 2. f7(A,B,C,D,E) -> f19(A,B,C,D,E) [-2 + E >= 0 (?,1) && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && E >= 1 + B] Signature: {(f0,9);(f19,9);(f7,9)} 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(A,B,C,D,E) -> f7(30,30,1,0,2) True (1,1) 1. f7(A,B,C,D,E) -> f7(A,B,C + D,C,1 + E) [-2 + E >= 0 (?,1) && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && B >= E] 2. f7(A,B,C,D,E) -> f19(A,B,C,D,E) [-2 + E >= 0 (?,1) && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && E >= 1 + B] Signature: {(f0,9);(f19,9);(f7,9)} Flow Graph: [0->{1},1->{1,2},2->{}] + Applied Processor: FromIts + Details: () * Step 4: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: f0(A,B,C,D,E) -> f7(30,30,1,0,2) True f7(A,B,C,D,E) -> f7(A,B,C + D,C,1 + E) [-2 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && B >= E] f7(A,B,C,D,E) -> f19(A,B,C,D,E) [-2 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && E >= 1 + B] Signature: {(f0,9);(f19,9);(f7,9)} Rule Graph: [0->{1},1->{1,2},2->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose WORST_CASE(?,O(1)) + Considered Problem: Rules: f0(A,B,C,D,E) -> f7(30,30,1,0,2) True f7(A,B,C,D,E) -> f7(A,B,C + D,C,1 + E) [-2 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && B >= E] f7(A,B,C,D,E) -> f19(A,B,C,D,E) [-2 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && E >= 1 + B] f19(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(exitus616,5);(f0,9);(f19,9);(f7,9)} 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(A,B,C,D,E) -> f7(30,30,1,0,2) True f7(A,B,C,D,E) -> f7(A,B,C + D,C,1 + E) [-2 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && B >= E] f7(A,B,C,D,E) -> f19(A,B,C,D,E) [-2 + E >= 0 && -2 + D + E >= 0 && -3 + C + E >= 0 && -32 + B + E >= 0 && 28 + -1*B + E >= 0 && -32 + A + E >= 0 && 28 + -1*A + E >= 0 && D >= 0 && -1 + C + D >= 0 && -30 + B + D >= 0 && 30 + -1*B + D >= 0 && -30 + A + D >= 0 && 30 + -1*A + D >= 0 && -1 + C >= 0 && -31 + B + C >= 0 && 29 + -1*B + C >= 0 && -31 + A + C >= 0 && 29 + -1*A + C >= 0 && 30 + -1*B >= 0 && A + -1*B >= 0 && 60 + -1*A + -1*B >= 0 && -30 + B >= 0 && -60 + A + B >= 0 && -1*A + B >= 0 && 30 + -1*A >= 0 && -30 + A >= 0 && E >= 1 + B] f19(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(exitus616,5);(f0,9);(f19,9);(f7,9)} 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: [A,B,C,D,E,0.0] f0 ~> f7 [A <= 30*K, B <= 30*K, C <= K, D <= 0*K, E <= 2*K] f7 ~> f7 [A <= A, B <= B, C <= C + D, D <= C, E <= 31*K] f7 ~> f19 [A <= A, B <= B, C <= C, D <= D, E <= E] f19 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= B + E] f7 ~> f7 [A <= A, B <= B, C <= C + D, D <= C, E <= 31*K] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0] f0 ~> f7 [K ~=> A,K ~=> B,K ~=> C,K ~=> D,K ~=> E] f7 ~> f7 [C ~=> D,K ~=> E,C ~+> C,D ~+> C] f7 ~> f19 [] f19 ~> exitus616 [] + Loop: [B ~+> 0.0,E ~+> 0.0] f7 ~> f7 [C ~=> D,K ~=> E,C ~+> C,D ~+> C] + Applied Processor: Lare + Details: f0 ~> exitus616 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> E ,tick ~+> tick ,K ~+> C ,K ~+> D ,K ~+> 0.0 ,K ~+> tick ,K ~*> C ,K ~*> D ,K ~*> 0.0 ,K ~*> tick ,K ~^> C] + f7> [C ~=> D ,K ~=> E ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> D ,D ~+> C ,D ~+> D ,E ~+> 0.0 ,E ~+> tick ,tick ~+> tick ,B ~*> C ,B ~*> D ,C ~*> C ,C ~*> D ,D ~*> C ,E ~*> C ,E ~*> D ,B ~^> C ,E ~^> C] YES(?,O(1))