WORST_CASE(Omega(1),?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1==arg1P_1 && arg3==arg3P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg1==arg1P_2 && arg2==arg2P_2 ], cost: 1
      3: f3 -> f4 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg2<0 && arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 ], cost: 1
      4: f3 -> f5 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg2>=0 && arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 ], cost: 1
      2: f4 -> f7 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg2P_3==-arg2 && arg1==arg1P_3 && arg3==arg3P_3 ], cost: 1
      5: f7 -> f6 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      6: f5 -> f6 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 ], cost: 1
      8: f6 -> f8 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ arg3<0 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 ], cost: 1
      9: f6 -> f9 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [ arg3>=0 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 ], cost: 1
      7: f8 -> f11 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg3P_8==-arg3 && arg1==arg1P_8 && arg2==arg2P_8 ], cost: 1
     10: f11 -> f10 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 ], cost: 1
     11: f9 -> f10 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, [ arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     19: f10 -> f12 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, [ arg3>0 && arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 ], cost: 1
     21: f10 -> f19 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, [ arg3<=0 && arg1==arg1P_22 && arg2==arg2P_22 && arg3==arg3P_22 ], cost: 1
     12: f12 -> f13 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, [ arg2==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 ], cost: 1
     14: f13 -> f14 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1>=arg3 && arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 ], cost: 1
     16: f13 -> f16 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ arg1<arg3 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 ], cost: 1
     13: f14 -> f15 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1P_14==-arg3+arg1 && arg2==arg2P_14 && arg3==arg3P_14 ], cost: 1
     15: f15 -> f13 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 ], cost: 1
     17: f16 -> f17 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg1==arg1P_18 && arg3==arg2P_18 && arg3==arg3P_18 ], cost: 1
     18: f17 -> f18 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg1==arg3P_19 ], cost: 1
     20: f18 -> f10 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, [ arg1==arg1P_21 && arg2==arg2P_21 && arg3==arg3P_21 ], cost: 1
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1==arg1P_1 && arg3==arg3P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg1==arg1P_2 && arg2==arg2P_2 ], cost: 1
      3: f3 -> f4 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg2<0 && arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 ], cost: 1
      4: f3 -> f5 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg2>=0 && arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 ], cost: 1
      2: f4 -> f7 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg2P_3==-arg2 && arg1==arg1P_3 && arg3==arg3P_3 ], cost: 1
      5: f7 -> f6 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      6: f5 -> f6 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 ], cost: 1
      8: f6 -> f8 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ arg3<0 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 ], cost: 1
      9: f6 -> f9 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [ arg3>=0 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 ], cost: 1
      7: f8 -> f11 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg3P_8==-arg3 && arg1==arg1P_8 && arg2==arg2P_8 ], cost: 1
     10: f11 -> f10 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 ], cost: 1
     11: f9 -> f10 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, [ arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     19: f10 -> f12 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, [ arg3>0 && arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 ], cost: 1
     12: f12 -> f13 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, [ arg2==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 ], cost: 1
     14: f13 -> f14 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ arg1>=arg3 && arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 ], cost: 1
     16: f13 -> f16 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ arg1<arg3 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 ], cost: 1
     13: f14 -> f15 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg1P_14==-arg3+arg1 && arg2==arg2P_14 && arg3==arg3P_14 ], cost: 1
     15: f15 -> f13 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 ], cost: 1
     17: f16 -> f17 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg1==arg1P_18 && arg3==arg2P_18 && arg3==arg3P_18 ], cost: 1
     18: f17 -> f18 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg1==arg3P_19 ], cost: 1
     20: f18 -> f10 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, [ arg1==arg1P_21 && arg2==arg2P_21 && arg3==arg3P_21 ], cost: 1
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg2'=arg2P_1, [], cost: 1
      1: f2 -> f3 : arg3'=arg3P_2, [], cost: 1
      3: f3 -> f4 : [ arg2<0 ], cost: 1
      4: f3 -> f5 : [ arg2>=0 ], cost: 1
      2: f4 -> f7 : arg2'=-arg2, [], cost: 1
      5: f7 -> f6 : [], cost: 1
      6: f5 -> f6 : [], cost: 1
      8: f6 -> f8 : [ arg3<0 ], cost: 1
      9: f6 -> f9 : [ arg3>=0 ], cost: 1
      7: f8 -> f11 : arg3'=-arg3, [], cost: 1
     10: f11 -> f10 : [], cost: 1
     11: f9 -> f10 : [], cost: 1
     19: f10 -> f12 : [ arg3>0 ], cost: 1
     12: f12 -> f13 : arg1'=arg2, [], cost: 1
     14: f13 -> f14 : [ arg1>=arg3 ], cost: 1
     16: f13 -> f16 : [ arg1<arg3 ], cost: 1
     13: f14 -> f15 : arg1'=-arg3+arg1, [], cost: 1
     15: f15 -> f13 : [], cost: 1
     17: f16 -> f17 : arg2'=arg3, [], cost: 1
     18: f17 -> f18 : arg3'=arg1, [], cost: 1
     20: f18 -> f10 : [], cost: 1
     22: __init -> f1 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     26: f3 -> f6 : [ arg2>=0 ], cost: 2
     27: f3 -> f6 : arg2'=-arg2, [ arg2<0 ], cost: 3
     29: f6 -> f10 : [ arg3>=0 ], cost: 2
     30: f6 -> f10 : arg3'=-arg3, [ arg3<0 ], cost: 3
     31: f10 -> f13 : arg1'=arg2, [ arg3>0 ], cost: 2
     34: f13 -> f13 : arg1'=-arg3+arg1, [ arg1>=arg3 ], cost: 3
     36: f13 -> f10 : arg2'=arg3, arg3'=arg1, [ arg1<arg3 ], cost: 4
     24: __init -> f3 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [], cost: 3

Accelerating simple loops of location 12.
   Accelerating the following rules:
     34: f13 -> f13 : arg1'=-arg3+arg1, [ arg1>=arg3 ], cost: 3

[test] deduced invariant 1-arg3<=0
   Accelerated rule 34 with non-termination, yielding the new rule 37.
   Accelerated rule 34 with backward acceleration, yielding the new rule 38.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     26: f3 -> f6 : [ arg2>=0 ], cost: 2
     27: f3 -> f6 : arg2'=-arg2, [ arg2<0 ], cost: 3
     29: f6 -> f10 : [ arg3>=0 ], cost: 2
     30: f6 -> f10 : arg3'=-arg3, [ arg3<0 ], cost: 3
     31: f10 -> f13 : arg1'=arg2, [ arg3>0 ], cost: 2
     34: f13 -> f13 : arg1'=-arg3+arg1, [ arg1>=arg3 ], cost: 3
     36: f13 -> f10 : arg2'=arg3, arg3'=arg1, [ arg1<arg3 ], cost: 4
     37: f13 -> [20] : [ arg1>=arg3 && arg3==0 && arg1==0 ], cost: NONTERM
     38: f13 -> f13 : arg1'=arg1-k*arg3, [ 1-arg3<=0 && k>=0 && -(-1+k)*arg3+arg1>=arg3 ], cost: 3*k
     24: __init -> f3 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     26: f3 -> f6 : [ arg2>=0 ], cost: 2
     27: f3 -> f6 : arg2'=-arg2, [ arg2<0 ], cost: 3
     29: f6 -> f10 : [ arg3>=0 ], cost: 2
     30: f6 -> f10 : arg3'=-arg3, [ arg3<0 ], cost: 3
     31: f10 -> f13 : arg1'=arg2, [ arg3>0 ], cost: 2
     39: f10 -> f13 : arg1'=arg2-arg3, [ arg3>0 && arg2>=arg3 ], cost: 5
     40: f10 -> f13 : arg1'=arg2-k*arg3, [ arg3>0 && k>=0 && -(-1+k)*arg3+arg2>=arg3 ], cost: 2+3*k
     36: f13 -> f10 : arg2'=arg3, arg3'=arg1, [ arg1<arg3 ], cost: 4
     24: __init -> f3 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [], cost: 3

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     26: f3 -> f6 : [ arg2>=0 ], cost: 2
     27: f3 -> f6 : arg2'=-arg2, [ arg2<0 ], cost: 3
     29: f6 -> f10 : [ arg3>=0 ], cost: 2
     30: f6 -> f10 : arg3'=-arg3, [ arg3<0 ], cost: 3
     31: f10 -> f13 : arg1'=arg2, [ arg3>0 ], cost: 2
     39: f10 -> f13 : arg1'=arg2-arg3, [ arg3>0 && arg2>=arg3 ], cost: 5
     40: f10 -> f13 : arg1'=arg2-k*arg3, [ arg3>0 && k>=0 && -(-1+k)*arg3+arg2>=arg3 ], cost: 2+3*k
     36: f13 -> f10 : arg2'=arg3, arg3'=arg1, [ arg1<arg3 ], cost: 4
     24: __init -> f3 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     29: f6 -> f10 : [ arg3>=0 ], cost: 2
     30: f6 -> f10 : arg3'=-arg3, [ arg3<0 ], cost: 3
     43: f10 -> f10 : arg1'=arg2, arg2'=arg3, arg3'=arg2, [ arg3>0 && arg2<arg3 ], cost: 6
     44: f10 -> f10 : arg1'=arg2-arg3, arg2'=arg3, arg3'=arg2-arg3, [ arg3>0 && arg2>=arg3 && arg2-arg3<arg3 ], cost: 9
     45: f10 -> f10 : arg1'=arg2-k*arg3, arg2'=arg3, arg3'=arg2-k*arg3, [ arg3>0 && k>=0 && -(-1+k)*arg3+arg2>=arg3 && arg2-k*arg3<arg3 ], cost: 6+3*k
     41: __init -> f6 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [ arg2P_1>=0 ], cost: 5
     42: __init -> f6 : arg1'=arg1P_23, arg2'=-arg2P_1, arg3'=arg3P_2, [ arg2P_1<0 ], cost: 6

Accelerating simple loops of location 10.
   Accelerating the following rules:
     43: f10 -> f10 : arg1'=arg2, arg2'=arg3, arg3'=arg2, [ arg3>0 && arg2<arg3 ], cost: 6
     44: f10 -> f10 : arg1'=arg2-arg3, arg2'=arg3, arg3'=arg2-arg3, [ arg3>0 && arg2>=arg3 && arg2-arg3<arg3 ], cost: 9
     45: f10 -> f10 : arg1'=arg2-k*arg3, arg2'=arg3, arg3'=arg2-k*arg3, [ arg3>0 && k>=0 && -(-1+k)*arg3+arg2>=arg3 && arg2-k*arg3<arg3 ], cost: 6+3*k

   Failed to prove monotonicity of the guard of rule 43.
   Found no closed form for 44.
   Found no closed form for 45.
[accelerate] Nesting with 1 inner and 3 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     29: f6 -> f10 : [ arg3>=0 ], cost: 2
     30: f6 -> f10 : arg3'=-arg3, [ arg3<0 ], cost: 3
     43: f10 -> f10 : arg1'=arg2, arg2'=arg3, arg3'=arg2, [ arg3>0 && arg2<arg3 ], cost: 6
     44: f10 -> f10 : arg1'=arg2-arg3, arg2'=arg3, arg3'=arg2-arg3, [ arg3>0 && arg2>=arg3 && arg2-arg3<arg3 ], cost: 9
     45: f10 -> f10 : arg1'=arg2-k*arg3, arg2'=arg3, arg3'=arg2-k*arg3, [ arg3>0 && k>=0 && -(-1+k)*arg3+arg2>=arg3 && arg2-k*arg3<arg3 ], cost: 6+3*k
     41: __init -> f6 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [ arg2P_1>=0 ], cost: 5
     42: __init -> f6 : arg1'=arg1P_23, arg2'=-arg2P_1, arg3'=arg3P_2, [ arg2P_1<0 ], cost: 6

Chained accelerated rules (with incoming rules):
   Start location: __init
     29: f6 -> f10 : [ arg3>=0 ], cost: 2
     30: f6 -> f10 : arg3'=-arg3, [ arg3<0 ], cost: 3
     46: f6 -> f10 : arg1'=arg2, arg2'=arg3, arg3'=arg2, [ arg3>0 && arg2<arg3 ], cost: 8
     47: f6 -> f10 : arg1'=arg2, arg2'=-arg3, arg3'=arg2, [ arg3<0 && arg2<-arg3 ], cost: 9
     48: f6 -> f10 : arg1'=arg2-arg3, arg2'=arg3, arg3'=arg2-arg3, [ arg3>0 && arg2>=arg3 && arg2-arg3<arg3 ], cost: 11
     49: f6 -> f10 : arg1'=arg2+arg3, arg2'=-arg3, arg3'=arg2+arg3, [ arg3<0 && arg2>=-arg3 && arg2+arg3<-arg3 ], cost: 12
     50: f6 -> f10 : arg1'=arg2-k*arg3, arg2'=arg3, arg3'=arg2-k*arg3, [ arg3>0 && k>=0 && -(-1+k)*arg3+arg2>=arg3 && arg2-k*arg3<arg3 ], cost: 8+3*k
     51: f6 -> f10 : arg1'=arg2+k*arg3, arg2'=-arg3, arg3'=arg2+k*arg3, [ arg3<0 && k>=0 && (-1+k)*arg3+arg2>=-arg3 && arg2+k*arg3<-arg3 ], cost: 9+3*k
     41: __init -> f6 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [ arg2P_1>=0 ], cost: 5
     42: __init -> f6 : arg1'=arg1P_23, arg2'=-arg2P_1, arg3'=arg3P_2, [ arg2P_1<0 ], cost: 6

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     50: f6 -> f10 : arg1'=arg2-k*arg3, arg2'=arg3, arg3'=arg2-k*arg3, [ arg3>0 && k>=0 && -(-1+k)*arg3+arg2>=arg3 && arg2-k*arg3<arg3 ], cost: 8+3*k
     51: f6 -> f10 : arg1'=arg2+k*arg3, arg2'=-arg3, arg3'=arg2+k*arg3, [ arg3<0 && k>=0 && (-1+k)*arg3+arg2>=-arg3 && arg2+k*arg3<-arg3 ], cost: 9+3*k
     41: __init -> f6 : arg1'=arg1P_23, arg2'=arg2P_1, arg3'=arg3P_2, [ arg2P_1>=0 ], cost: 5
     42: __init -> f6 : arg1'=arg1P_23, arg2'=-arg2P_1, arg3'=arg3P_2, [ arg2P_1<0 ], cost: 6

Eliminated locations (on tree-shaped paths):
   Start location: __init
     52: __init -> f10 : arg1'=-k*arg3P_2+arg2P_1, arg2'=arg3P_2, arg3'=-k*arg3P_2+arg2P_1, [ arg2P_1>=0 && arg3P_2>0 && k>=0 && arg2P_1-(-1+k)*arg3P_2>=arg3P_2 && -k*arg3P_2+arg2P_1<arg3P_2 ], cost: 13+3*k
     53: __init -> f10 : arg1'=k*arg3P_2+arg2P_1, arg2'=-arg3P_2, arg3'=k*arg3P_2+arg2P_1, [ arg2P_1>=0 && arg3P_2<0 && k>=0 && arg2P_1+(-1+k)*arg3P_2>=-arg3P_2 && k*arg3P_2+arg2P_1<-arg3P_2 ], cost: 14+3*k
     54: __init -> f10 : arg1'=-k*arg3P_2-arg2P_1, arg2'=arg3P_2, arg3'=-k*arg3P_2-arg2P_1, [ arg2P_1<0 && arg3P_2>0 && k>=0 && -arg2P_1-(-1+k)*arg3P_2>=arg3P_2 && -k*arg3P_2-arg2P_1<arg3P_2 ], cost: 14+3*k
     55: __init -> f10 : arg1'=k*arg3P_2-arg2P_1, arg2'=-arg3P_2, arg3'=k*arg3P_2-arg2P_1, [ arg2P_1<0 && arg3P_2<0 && k>=0 && -arg2P_1+(-1+k)*arg3P_2>=-arg3P_2 && k*arg3P_2-arg2P_1<-arg3P_2 ], cost: 15+3*k

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     52: __init -> f10 : arg1'=-k*arg3P_2+arg2P_1, arg2'=arg3P_2, arg3'=-k*arg3P_2+arg2P_1, [ arg2P_1>=0 && arg3P_2>0 && k>=0 && arg2P_1-(-1+k)*arg3P_2>=arg3P_2 && -k*arg3P_2+arg2P_1<arg3P_2 ], cost: 13+3*k
     53: __init -> f10 : arg1'=k*arg3P_2+arg2P_1, arg2'=-arg3P_2, arg3'=k*arg3P_2+arg2P_1, [ arg2P_1>=0 && arg3P_2<0 && k>=0 && arg2P_1+(-1+k)*arg3P_2>=-arg3P_2 && k*arg3P_2+arg2P_1<-arg3P_2 ], cost: 14+3*k
     54: __init -> f10 : arg1'=-k*arg3P_2-arg2P_1, arg2'=arg3P_2, arg3'=-k*arg3P_2-arg2P_1, [ arg2P_1<0 && arg3P_2>0 && k>=0 && -arg2P_1-(-1+k)*arg3P_2>=arg3P_2 && -k*arg3P_2-arg2P_1<arg3P_2 ], cost: 14+3*k
     55: __init -> f10 : arg1'=k*arg3P_2-arg2P_1, arg2'=-arg3P_2, arg3'=k*arg3P_2-arg2P_1, [ arg2P_1<0 && arg3P_2<0 && k>=0 && -arg2P_1+(-1+k)*arg3P_2>=-arg3P_2 && k*arg3P_2-arg2P_1<-arg3P_2 ], cost: 15+3*k

Computing asymptotic complexity for rule 52
   Simplified the guard:
     52: __init -> f10 : arg1'=-k*arg3P_2+arg2P_1, arg2'=arg3P_2, arg3'=-k*arg3P_2+arg2P_1, [ k>=0 && arg2P_1-(-1+k)*arg3P_2>=arg3P_2 && -k*arg3P_2+arg2P_1<arg3P_2 ], cost: 13+3*k
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 53
   Simplified the guard:
     53: __init -> f10 : arg1'=k*arg3P_2+arg2P_1, arg2'=-arg3P_2, arg3'=k*arg3P_2+arg2P_1, [ k>=0 && arg2P_1+(-1+k)*arg3P_2>=-arg3P_2 && k*arg3P_2+arg2P_1<-arg3P_2 ], cost: 14+3*k
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 54
   Simplified the guard:
     54: __init -> f10 : arg1'=-k*arg3P_2-arg2P_1, arg2'=arg3P_2, arg3'=-k*arg3P_2-arg2P_1, [ arg2P_1<0 && k>=0 && -arg2P_1-(-1+k)*arg3P_2>=arg3P_2 && -k*arg3P_2-arg2P_1<arg3P_2 ], cost: 14+3*k
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 55
   Simplified the guard:
     55: __init -> f10 : arg1'=k*arg3P_2-arg2P_1, arg2'=-arg3P_2, arg3'=k*arg3P_2-arg2P_1, [ arg2P_1<0 && k>=0 && -arg2P_1+(-1+k)*arg3P_2>=-arg3P_2 && k*arg3P_2-arg2P_1<-arg3P_2 ], cost: 15+3*k
   Resulting cost 0 has complexity: Unknown

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)