YES(?,O(n^1)) * Step 1: ArgumentFilter WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. f2(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f5(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) True (1,1) 1. f5(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f17(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [B >= 1 + A] (?,1) 2. f5(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [A >= B] (?,1) 3. f17(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f27(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [-1 + -1*A + B >= 0 && B >= 1 + A] (?,1) 4. f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f5(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [A + -1*B >= 0 && C >= 1 + A] (?,1) 5. f8(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f8(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [A + -1*B >= 0 && A >= C] (?,1) 6. f27(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [-1 + -1*A + B >= 0 && E >= 51] (?,1) 7. f27(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f31(A,B,C,D,E,0,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [-1 + -1*A + B >= 0 && 50 >= E] (?,1) 8. f31(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) -> f1(A,B,C,D,E,0,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1) [-1*F >= 0 (?,1) && 50 + -1*E + -1*F >= 0 && F >= 0 && 50 + -1*E + F >= 0 && 50 + -1*E >= 0 && -1 + -1*A + B >= 0 && B >= A && F = 0] Signature: {(f1,27);(f17,27);(f2,27);(f27,27);(f31,27);(f5,27);(f8,27)} Flow Graph: [0->{1,2},1->{3},2->{4,5},3->{6,7},4->{1,2},5->{4,5},6->{},7->{8},8->{}] + Applied Processor: ArgumentFilter [3,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26] + Details: We remove following argument positions: [3,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26]. * Step 2: FromIts WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. f2(A,B,C,E,F) -> f5(A,B,C,E,F) True (1,1) 1. f5(A,B,C,E,F) -> f17(A,B,C,E,F) [B >= 1 + A] (?,1) 2. f5(A,B,C,E,F) -> f8(A,B,C,E,F) [A >= B] (?,1) 3. f17(A,B,C,E,F) -> f27(A,B,C,E,F) [-1 + -1*A + B >= 0 && B >= 1 + A] (?,1) 4. f8(A,B,C,E,F) -> f5(A,1 + B,C,E,F) [A + -1*B >= 0 && C >= 1 + A] (?,1) 5. f8(A,B,C,E,F) -> f8(A,B,1 + C,E,F) [A + -1*B >= 0 && A >= C] (?,1) 6. f27(A,B,C,E,F) -> f1(A,B,C,E,F) [-1 + -1*A + B >= 0 && E >= 51] (?,1) 7. f27(A,B,C,E,F) -> f31(A,B,C,E,0) [-1 + -1*A + B >= 0 && 50 >= E] (?,1) 8. f31(A,B,C,E,F) -> f1(A,B,C,E,0) [-1*F >= 0 (?,1) && 50 + -1*E + -1*F >= 0 && F >= 0 && 50 + -1*E + F >= 0 && 50 + -1*E >= 0 && -1 + -1*A + B >= 0 && B >= A && F = 0] Signature: {(f1,27);(f17,27);(f2,27);(f27,27);(f31,27);(f5,27);(f8,27)} Flow Graph: [0->{1,2},1->{3},2->{4,5},3->{6,7},4->{1,2},5->{4,5},6->{},7->{8},8->{}] + Applied Processor: FromIts + Details: () * Step 3: AddSinks WORST_CASE(?,O(n^1)) + Considered Problem: Rules: f2(A,B,C,E,F) -> f5(A,B,C,E,F) True f5(A,B,C,E,F) -> f17(A,B,C,E,F) [B >= 1 + A] f5(A,B,C,E,F) -> f8(A,B,C,E,F) [A >= B] f17(A,B,C,E,F) -> f27(A,B,C,E,F) [-1 + -1*A + B >= 0 && B >= 1 + A] f8(A,B,C,E,F) -> f5(A,1 + B,C,E,F) [A + -1*B >= 0 && C >= 1 + A] f8(A,B,C,E,F) -> f8(A,B,1 + C,E,F) [A + -1*B >= 0 && A >= C] f27(A,B,C,E,F) -> f1(A,B,C,E,F) [-1 + -1*A + B >= 0 && E >= 51] f27(A,B,C,E,F) -> f31(A,B,C,E,0) [-1 + -1*A + B >= 0 && 50 >= E] f31(A,B,C,E,F) -> f1(A,B,C,E,0) [-1*F >= 0 && 50 + -1*E + -1*F >= 0 && F >= 0 && 50 + -1*E + F >= 0 && 50 + -1*E >= 0 && -1 + -1*A + B >= 0 && B >= A && F = 0] Signature: {(f1,27);(f17,27);(f2,27);(f27,27);(f31,27);(f5,27);(f8,27)} Rule Graph: [0->{1,2},1->{3},2->{4,5},3->{6,7},4->{1,2},5->{4,5},6->{},7->{8},8->{}] + Applied Processor: AddSinks + Details: () * Step 4: Decompose WORST_CASE(?,O(n^1)) + Considered Problem: Rules: f2(A,B,C,E,F) -> f5(A,B,C,E,F) True f5(A,B,C,E,F) -> f17(A,B,C,E,F) [B >= 1 + A] f5(A,B,C,E,F) -> f8(A,B,C,E,F) [A >= B] f17(A,B,C,E,F) -> f27(A,B,C,E,F) [-1 + -1*A + B >= 0 && B >= 1 + A] f8(A,B,C,E,F) -> f5(A,1 + B,C,E,F) [A + -1*B >= 0 && C >= 1 + A] f8(A,B,C,E,F) -> f8(A,B,1 + C,E,F) [A + -1*B >= 0 && A >= C] f27(A,B,C,E,F) -> f1(A,B,C,E,F) [-1 + -1*A + B >= 0 && E >= 51] f27(A,B,C,E,F) -> f31(A,B,C,E,0) [-1 + -1*A + B >= 0 && 50 >= E] f31(A,B,C,E,F) -> f1(A,B,C,E,0) [-1*F >= 0 && 50 + -1*E + -1*F >= 0 && F >= 0 && 50 + -1*E + F >= 0 && 50 + -1*E >= 0 && -1 + -1*A + B >= 0 && B >= A && F = 0] f1(A,B,C,E,F) -> exitus616(A,B,C,E,F) True f1(A,B,C,E,F) -> exitus616(A,B,C,E,F) True Signature: {(exitus616,5);(f1,27);(f17,27);(f2,27);(f27,27);(f31,27);(f5,27);(f8,27)} Rule Graph: [0->{1,2},1->{3},2->{4,5},3->{6,7},4->{1,2},5->{4,5},6->{10},7->{8},8->{9}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[2,4,5] c: [2,4,5] * Step 5: AbstractSize WORST_CASE(?,O(n^1)) + Considered Problem: (Rules: f2(A,B,C,E,F) -> f5(A,B,C,E,F) True f5(A,B,C,E,F) -> f17(A,B,C,E,F) [B >= 1 + A] f5(A,B,C,E,F) -> f8(A,B,C,E,F) [A >= B] f17(A,B,C,E,F) -> f27(A,B,C,E,F) [-1 + -1*A + B >= 0 && B >= 1 + A] f8(A,B,C,E,F) -> f5(A,1 + B,C,E,F) [A + -1*B >= 0 && C >= 1 + A] f8(A,B,C,E,F) -> f8(A,B,1 + C,E,F) [A + -1*B >= 0 && A >= C] f27(A,B,C,E,F) -> f1(A,B,C,E,F) [-1 + -1*A + B >= 0 && E >= 51] f27(A,B,C,E,F) -> f31(A,B,C,E,0) [-1 + -1*A + B >= 0 && 50 >= E] f31(A,B,C,E,F) -> f1(A,B,C,E,0) [-1*F >= 0 && 50 + -1*E + -1*F >= 0 && F >= 0 && 50 + -1*E + F >= 0 && 50 + -1*E >= 0 && -1 + -1*A + B >= 0 && B >= A && F = 0] f1(A,B,C,E,F) -> exitus616(A,B,C,E,F) True f1(A,B,C,E,F) -> exitus616(A,B,C,E,F) True Signature: {(exitus616,5);(f1,27);(f17,27);(f2,27);(f27,27);(f31,27);(f5,27);(f8,27)} Rule Graph: [0->{1,2},1->{3},2->{4,5},3->{6,7},4->{1,2},5->{4,5},6->{10},7->{8},8->{9}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[2,4,5] c: [2,4,5]) + Applied Processor: AbstractSize Minimize + Details: () * Step 6: AbstractFlow WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [A,B,C,E,F,0.0] f2 ~> f5 [A <= A, B <= B, C <= C, E <= E, F <= F] f5 ~> f17 [A <= A, B <= B, C <= C, E <= E, F <= F] f5 ~> f8 [A <= A, B <= B, C <= C, E <= E, F <= F] f17 ~> f27 [A <= A, B <= B, C <= C, E <= E, F <= F] f8 ~> f5 [A <= A, B <= K + B, C <= C, E <= E, F <= F] f8 ~> f8 [A <= A, B <= B, C <= K + C, E <= E, F <= F] f27 ~> f1 [A <= A, B <= B, C <= C, E <= E, F <= F] f27 ~> f31 [A <= A, B <= B, C <= C, E <= E, F <= 0*K] f31 ~> f1 [A <= A, B <= B, C <= C, E <= E, F <= 0*K] f1 ~> exitus616 [A <= A, B <= B, C <= C, E <= E, F <= F] f1 ~> exitus616 [A <= A, B <= B, C <= C, E <= E, F <= F] + Loop: [0.0 <= A + B + C] f5 ~> f8 [A <= A, B <= B, C <= C, E <= E, F <= F] f8 ~> f5 [A <= A, B <= K + B, C <= C, E <= E, F <= F] f8 ~> f8 [A <= A, B <= B, C <= K + C, E <= E, F <= F] + Applied Processor: AbstractFlow + Details: () * Step 7: Lare WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,E,F,0.0] f2 ~> f5 [] f5 ~> f17 [] f5 ~> f8 [] f17 ~> f27 [] f8 ~> f5 [B ~+> B,K ~+> B] f8 ~> f8 [C ~+> C,K ~+> C] f27 ~> f1 [] f27 ~> f31 [K ~=> F] f31 ~> f1 [K ~=> F] f1 ~> exitus616 [] f1 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,C ~+> 0.0] f5 ~> f8 [] f8 ~> f5 [B ~+> B,K ~+> B] f8 ~> f8 [C ~+> C,K ~+> C] + Applied Processor: Lare + Details: f2 ~> exitus616 [K ~=> F ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,A ~*> B ,A ~*> C ,B ~*> B ,B ~*> C ,C ~*> B ,C ~*> C ,K ~*> B ,K ~*> C] + f5> [A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,A ~*> B ,A ~*> C ,B ~*> B ,B ~*> C ,C ~*> B ,C ~*> C ,K ~*> B ,K ~*> C] YES(?,O(n^1))