NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
     22: f3 -> f4 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg2<0 && arg1==arg1P_23 && arg2==arg2P_23 && arg3==arg3P_23 && arg4==arg4P_23 ], cost: 1
     23: f3 -> f4 : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg2>0 && arg1==arg1P_24 && arg2==arg2P_24 && arg3==arg3P_24 && arg4==arg4P_24 ], cost: 1
     25: f3 -> f20 : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2==0 && arg1==arg1P_26 && arg2==arg2P_26 && arg3==arg3P_26 && arg4==arg4P_26 ], cost: 1
      2: f4 -> f5 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f5 -> f6 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg1==arg4P_4 ], cost: 1
     15: f6 -> f7 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg1<=0 && arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     16: f6 -> f7 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2<=0 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 ], cost: 1
     17: f6 -> f8 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1>0 && arg2>0 && arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
      4: f7 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1==arg1P_5 && 0==arg2P_5 && arg3==arg3P_5 && arg4==arg4P_5 ], cost: 1
     18: f10 -> f9 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
      5: f11 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1==arg1P_6 && 0==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
     13: f14 -> f13 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
      6: f15 -> f16 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg4P_7==-arg2+arg4 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 ], cost: 1
      8: f16 -> f12 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      7: f12 -> f15 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg4>arg2 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      9: f12 -> f17 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg4<=arg2 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     14: f17 -> f13 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     10: f8 -> f11 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg2 && arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f8 -> f12 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1<arg2 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
     12: f8 -> f12 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>arg2 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
     19: f13 -> f9 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 && arg4==arg4P_20 ], cost: 1
     20: f9 -> f18 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1==arg1P_21 && arg4==arg2P_21 && arg3==arg3P_21 && arg4==arg4P_21 ], cost: 1
     21: f18 -> f19 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg3==arg1P_22 && arg2==arg2P_22 && arg3==arg3P_22 && arg4==arg4P_22 ], cost: 1
     24: f19 -> f3 : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1==arg1P_25 && arg2==arg2P_25 && arg3==arg3P_25 && arg4==arg4P_25 ], cost: 1
     26: __init -> f1 : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     26: __init -> f1 : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg2==arg2P_1 && arg3==arg3P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
     22: f3 -> f4 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg2<0 && arg1==arg1P_23 && arg2==arg2P_23 && arg3==arg3P_23 && arg4==arg4P_23 ], cost: 1
     23: f3 -> f4 : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg2>0 && arg1==arg1P_24 && arg2==arg2P_24 && arg3==arg3P_24 && arg4==arg4P_24 ], cost: 1
      2: f4 -> f5 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1==arg1P_3 && arg2==arg2P_3 && arg2==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f5 -> f6 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg2==arg2P_4 && arg3==arg3P_4 && arg1==arg4P_4 ], cost: 1
     15: f6 -> f7 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg1<=0 && arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     16: f6 -> f7 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2<=0 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 ], cost: 1
     17: f6 -> f8 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1>0 && arg2>0 && arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
      4: f7 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1==arg1P_5 && 0==arg2P_5 && arg3==arg3P_5 && arg4==arg4P_5 ], cost: 1
     18: f10 -> f9 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
      5: f11 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1==arg1P_6 && 0==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
     13: f14 -> f13 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && arg4==arg4P_14 ], cost: 1
      6: f15 -> f16 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg4P_7==-arg2+arg4 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 ], cost: 1
      8: f16 -> f12 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      7: f12 -> f15 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg4>arg2 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      9: f12 -> f17 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg4<=arg2 && arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     14: f17 -> f13 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     10: f8 -> f11 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg2 && arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f8 -> f12 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1<arg2 && arg1==arg1P_12 && arg2==arg2P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
     12: f8 -> f12 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>arg2 && arg1==arg1P_13 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
     19: f13 -> f9 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 && arg4==arg4P_20 ], cost: 1
     20: f9 -> f18 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1==arg1P_21 && arg4==arg2P_21 && arg3==arg3P_21 && arg4==arg4P_21 ], cost: 1
     21: f18 -> f19 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg3==arg1P_22 && arg2==arg2P_22 && arg3==arg3P_22 && arg4==arg4P_22 ], cost: 1
     24: f19 -> f3 : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1==arg1P_25 && arg2==arg2P_25 && arg3==arg3P_25 && arg4==arg4P_25 ], cost: 1
     26: __init -> f1 : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      1: f2 -> f3 : arg2'=arg2P_2, [], cost: 1
     22: f3 -> f4 : [ arg2<0 ], cost: 1
     23: f3 -> f4 : [ arg2>0 ], cost: 1
      2: f4 -> f5 : arg3'=arg2, [], cost: 1
      3: f5 -> f6 : arg4'=arg1, [], cost: 1
     15: f6 -> f7 : [ arg1<=0 ], cost: 1
     16: f6 -> f7 : [ arg2<=0 ], cost: 1
     17: f6 -> f8 : [ arg1>0 && arg2>0 ], cost: 1
      4: f7 -> f10 : arg2'=0, [], cost: 1
     18: f10 -> f9 : [], cost: 1
      5: f11 -> f14 : arg2'=0, [], cost: 1
     13: f14 -> f13 : [], cost: 1
      6: f15 -> f16 : arg4'=-arg2+arg4, [], cost: 1
      8: f16 -> f12 : [], cost: 1
      7: f12 -> f15 : [ arg4>arg2 ], cost: 1
      9: f12 -> f17 : [ arg4<=arg2 ], cost: 1
     14: f17 -> f13 : [], cost: 1
     10: f8 -> f11 : [ arg1==arg2 ], cost: 1
     11: f8 -> f12 : [ arg1<arg2 ], cost: 1
     12: f8 -> f12 : [ arg1>arg2 ], cost: 1
     19: f13 -> f9 : [], cost: 1
     20: f9 -> f18 : arg2'=arg4, [], cost: 1
     21: f18 -> f19 : arg1'=arg3, [], cost: 1
     24: f19 -> f3 : [], cost: 1
     26: __init -> f1 : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     22: f3 -> f4 : [ arg2<0 ], cost: 1
     23: f3 -> f4 : [ arg2>0 ], cost: 1
     29: f4 -> f6 : arg3'=arg2, arg4'=arg1, [], cost: 2
     15: f6 -> f7 : [ arg1<=0 ], cost: 1
     16: f6 -> f7 : [ arg2<=0 ], cost: 1
     17: f6 -> f8 : [ arg1>0 && arg2>0 ], cost: 1
     30: f7 -> f9 : arg2'=0, [], cost: 2
     36: f12 -> f13 : [ arg4<=arg2 ], cost: 2
     37: f12 -> f12 : arg4'=-arg2+arg4, [ arg4>arg2 ], cost: 3
     11: f8 -> f12 : [ arg1<arg2 ], cost: 1
     12: f8 -> f12 : [ arg1>arg2 ], cost: 1
     34: f8 -> f13 : arg2'=0, [ arg1==arg2 ], cost: 3
     19: f13 -> f9 : [], cost: 1
     32: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Accelerating simple loops of location 12.
   Accelerating the following rules:
     37: f12 -> f12 : arg4'=-arg2+arg4, [ arg4>arg2 ], cost: 3

[test] deduced pseudo-invariant arg2<=0, also trying -arg2<=-1
   Accelerated rule 37 with non-termination, yielding the new rule 38.
   Accelerated rule 37 with non-termination, yielding the new rule 39.
   Accelerated rule 37 with backward acceleration, yielding the new rule 40.
   Accelerated rule 37 with backward acceleration, yielding the new rule 41.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Also removing duplicate rules: 39.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     22: f3 -> f4 : [ arg2<0 ], cost: 1
     23: f3 -> f4 : [ arg2>0 ], cost: 1
     29: f4 -> f6 : arg3'=arg2, arg4'=arg1, [], cost: 2
     15: f6 -> f7 : [ arg1<=0 ], cost: 1
     16: f6 -> f7 : [ arg2<=0 ], cost: 1
     17: f6 -> f8 : [ arg1>0 && arg2>0 ], cost: 1
     30: f7 -> f9 : arg2'=0, [], cost: 2
     36: f12 -> f13 : [ arg4<=arg2 ], cost: 2
     37: f12 -> f12 : arg4'=-arg2+arg4, [ arg4>arg2 ], cost: 3
     38: f12 -> [21] : [ arg4>arg2 && arg2==0 && arg4==1 ], cost: NONTERM
     40: f12 -> [21] : [ arg4>arg2 && arg2<=0 ], cost: NONTERM
     41: f12 -> f12 : arg4'=-k*arg2+arg4, [ -arg2<=-1 && k>=0 && -(-1+k)*arg2+arg4>arg2 ], cost: 3*k
     11: f8 -> f12 : [ arg1<arg2 ], cost: 1
     12: f8 -> f12 : [ arg1>arg2 ], cost: 1
     34: f8 -> f13 : arg2'=0, [ arg1==arg2 ], cost: 3
     19: f13 -> f9 : [], cost: 1
     32: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     22: f3 -> f4 : [ arg2<0 ], cost: 1
     23: f3 -> f4 : [ arg2>0 ], cost: 1
     29: f4 -> f6 : arg3'=arg2, arg4'=arg1, [], cost: 2
     15: f6 -> f7 : [ arg1<=0 ], cost: 1
     16: f6 -> f7 : [ arg2<=0 ], cost: 1
     17: f6 -> f8 : [ arg1>0 && arg2>0 ], cost: 1
     30: f7 -> f9 : arg2'=0, [], cost: 2
     36: f12 -> f13 : [ arg4<=arg2 ], cost: 2
     11: f8 -> f12 : [ arg1<arg2 ], cost: 1
     12: f8 -> f12 : [ arg1>arg2 ], cost: 1
     34: f8 -> f13 : arg2'=0, [ arg1==arg2 ], cost: 3
     42: f8 -> f12 : arg4'=-arg2+arg4, [ arg1<arg2 && arg4>arg2 ], cost: 4
     43: f8 -> f12 : arg4'=-arg2+arg4, [ arg1>arg2 && arg4>arg2 ], cost: 4
     44: f8 -> [21] : [ arg1<arg2 && arg4>arg2 && arg2==0 && arg4==1 ], cost: NONTERM
     45: f8 -> [21] : [ arg1>arg2 && arg4>arg2 && arg2==0 && arg4==1 ], cost: NONTERM
     46: f8 -> [21] : [ arg1<arg2 && arg4>arg2 && arg2<=0 ], cost: NONTERM
     47: f8 -> [21] : [ arg1>arg2 && arg4>arg2 && arg2<=0 ], cost: NONTERM
     48: f8 -> f12 : arg4'=-k*arg2+arg4, [ arg1<arg2 && -arg2<=-1 && k>=0 && -(-1+k)*arg2+arg4>arg2 ], cost: 1+3*k
     49: f8 -> f12 : arg4'=-k*arg2+arg4, [ arg1>arg2 && -arg2<=-1 && k>=0 && -(-1+k)*arg2+arg4>arg2 ], cost: 1+3*k
     19: f13 -> f9 : [], cost: 1
     32: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     50: f3 -> f6 : arg3'=arg2, arg4'=arg1, [ arg2<0 ], cost: 3
     51: f3 -> f6 : arg3'=arg2, arg4'=arg1, [ arg2>0 ], cost: 3
     52: f6 -> f9 : arg2'=0, [ arg1<=0 ], cost: 3
     53: f6 -> f9 : arg2'=0, [ arg2<=0 ], cost: 3
     54: f6 -> f12 : [ arg1>0 && arg2>0 && arg1<arg2 ], cost: 2
     55: f6 -> f12 : [ arg1>0 && arg2>0 && arg1>arg2 ], cost: 2
     56: f6 -> f13 : arg2'=0, [ arg1>0 && arg2>0 && arg1==arg2 ], cost: 4
     57: f6 -> f12 : arg4'=-arg2+arg4, [ arg1>0 && arg2>0 && arg1<arg2 && arg4>arg2 ], cost: 5
     58: f6 -> f12 : arg4'=-arg2+arg4, [ arg1>0 && arg2>0 && arg1>arg2 && arg4>arg2 ], cost: 5
     59: f6 -> f12 : arg4'=-k*arg2+arg4, [ arg1>0 && arg2>0 && arg1<arg2 && k>=0 && -(-1+k)*arg2+arg4>arg2 ], cost: 2+3*k
     60: f6 -> f12 : arg4'=-k*arg2+arg4, [ arg1>0 && arg2>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg4>arg2 ], cost: 2+3*k
     36: f12 -> f13 : [ arg4<=arg2 ], cost: 2
     19: f13 -> f9 : [], cost: 1
     32: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Applied pruning (of leafs and parallel rules):
   Start location: __init
     50: f3 -> f6 : arg3'=arg2, arg4'=arg1, [ arg2<0 ], cost: 3
     51: f3 -> f6 : arg3'=arg2, arg4'=arg1, [ arg2>0 ], cost: 3
     52: f6 -> f9 : arg2'=0, [ arg1<=0 ], cost: 3
     53: f6 -> f9 : arg2'=0, [ arg2<=0 ], cost: 3
     55: f6 -> f12 : [ arg1>0 && arg2>0 && arg1>arg2 ], cost: 2
     56: f6 -> f13 : arg2'=0, [ arg1>0 && arg2>0 && arg1==arg2 ], cost: 4
     57: f6 -> f12 : arg4'=-arg2+arg4, [ arg1>0 && arg2>0 && arg1<arg2 && arg4>arg2 ], cost: 5
     58: f6 -> f12 : arg4'=-arg2+arg4, [ arg1>0 && arg2>0 && arg1>arg2 && arg4>arg2 ], cost: 5
     59: f6 -> f12 : arg4'=-k*arg2+arg4, [ arg1>0 && arg2>0 && arg1<arg2 && k>=0 && -(-1+k)*arg2+arg4>arg2 ], cost: 2+3*k
     60: f6 -> f12 : arg4'=-k*arg2+arg4, [ arg1>0 && arg2>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg4>arg2 ], cost: 2+3*k
     36: f12 -> f13 : [ arg4<=arg2 ], cost: 2
     19: f13 -> f9 : [], cost: 1
     32: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     61: f3 -> f9 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2<0 && arg1<=0 ], cost: 6
     62: f3 -> f9 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2<0 ], cost: 6
     63: f3 -> f9 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1<=0 ], cost: 6
     64: f3 -> f12 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>0 && arg1>arg2 ], cost: 5
     65: f3 -> f13 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>0 && arg1==arg2 ], cost: 7
     66: f3 -> f12 : arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 ], cost: 8
     67: f3 -> f12 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1<arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 ], cost: 5+3*k
     68: f3 -> f12 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 ], cost: 5+3*k
     36: f12 -> f13 : [ arg4<=arg2 ], cost: 2
     19: f13 -> f9 : [], cost: 1
     32: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Merged rules:
   Start location: __init
     63: f3 -> f9 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1<=0 ], cost: 6
     64: f3 -> f12 : arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>0 && arg1>arg2 ], cost: 5
     65: f3 -> f13 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>0 && arg1==arg2 ], cost: 7
     66: f3 -> f12 : arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 ], cost: 8
     67: f3 -> f12 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1<arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 ], cost: 5+3*k
     68: f3 -> f12 : arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 ], cost: 5+3*k
     69: f3 -> f9 : arg2'=0, arg3'=arg2, arg4'=arg1, [ arg2<0 ], cost: 6
     36: f12 -> f13 : [ arg4<=arg2 ], cost: 2
     19: f13 -> f9 : [], cost: 1
     32: f9 -> f3 : arg1'=arg3, arg2'=arg4, [], cost: 3
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     77: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1<=0 ], cost: 9
     78: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2<0 ], cost: 9
     79: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>0 && arg1==arg2 ], cost: 11
     80: f3 -> f3 : arg1'=arg2, arg2'=-arg2+arg1, arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && -arg2+arg1<=arg2 ], cost: 14
     81: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1<arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 11+3*k
     82: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 11+3*k
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Applied pruning (of leafs and parallel rules):
   Start location: __init
     77: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1<=0 ], cost: 9
     78: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2<0 ], cost: 9
     79: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>0 && arg1==arg2 ], cost: 11
     80: f3 -> f3 : arg1'=arg2, arg2'=-arg2+arg1, arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && -arg2+arg1<=arg2 ], cost: 14
     82: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 11+3*k
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Accelerating simple loops of location 2.
   Accelerating the following rules:
     77: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1<=0 ], cost: 9
     78: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2<0 ], cost: 9
     79: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1>0 && arg1==arg2 ], cost: 11
     80: f3 -> f3 : arg1'=arg2, arg2'=-arg2+arg1, arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && -arg2+arg1<=arg2 ], cost: 14
     82: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 11+3*k

   Failed to prove monotonicity of the guard of rule 77.
   Accelerated rule 78 with non-termination, yielding the new rule 83.
   Accelerated rule 79 with non-termination, yielding the new rule 84.
   Found no closed form for 80.
   Found no closed form for 82.
[accelerate] Nesting with 1 inner and 3 outer candidates
   Removing the simple loops: 78 79.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     77: f3 -> f3 : arg1'=arg2, arg2'=arg1, arg3'=arg2, arg4'=arg1, [ arg2>0 && arg1<=0 ], cost: 9
     80: f3 -> f3 : arg1'=arg2, arg2'=-arg2+arg1, arg3'=arg2, arg4'=-arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && -arg2+arg1<=arg2 ], cost: 14
     82: f3 -> f3 : arg1'=arg2, arg2'=-k*arg2+arg1, arg3'=arg2, arg4'=-k*arg2+arg1, [ arg2>0 && arg1>0 && arg1>arg2 && k>=0 && -(-1+k)*arg2+arg1>arg2 && -k*arg2+arg1<=arg2 ], cost: 11+3*k
     83: f3 -> [22] : [ arg2<0 && arg1<0 ], cost: NONTERM
     84: f3 -> [22] : [ arg2>0 && arg1>0 && arg1==arg2 && arg2==arg1 ], cost: NONTERM
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     28: __init -> f3 : arg1'=arg1P_1, arg2'=arg2P_2, arg3'=arg3P_27, arg4'=arg4P_27, [], cost: 3
     85: __init -> f3 : arg1'=arg2P_2, arg2'=arg1P_1, arg3'=arg2P_2, arg4'=arg1P_1, [ arg2P_2>0 && arg1P_1<=0 ], cost: 12
     86: __init -> f3 : arg1'=arg2P_2, arg2'=-arg2P_2+arg1P_1, arg3'=arg2P_2, arg4'=-arg2P_2+arg1P_1, [ arg2P_2>0 && arg1P_1>0 && arg1P_1>arg2P_2 && -arg2P_2+arg1P_1<=arg2P_2 ], cost: 17
     87: __init -> f3 : arg1'=arg2P_2, arg2'=-k*arg2P_2+arg1P_1, arg3'=arg2P_2, arg4'=-k*arg2P_2+arg1P_1, [ arg2P_2>0 && arg1P_1>0 && arg1P_1>arg2P_2 && k>=0 && -(-1+k)*arg2P_2+arg1P_1>arg2P_2 && -k*arg2P_2+arg1P_1<=arg2P_2 ], cost: 14+3*k
     88: __init -> [22] : [], cost: NONTERM
     89: __init -> [22] : [ arg1P_1>0 ], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     87: __init -> f3 : arg1'=arg2P_2, arg2'=-k*arg2P_2+arg1P_1, arg3'=arg2P_2, arg4'=-k*arg2P_2+arg1P_1, [ arg2P_2>0 && arg1P_1>0 && arg1P_1>arg2P_2 && k>=0 && -(-1+k)*arg2P_2+arg1P_1>arg2P_2 && -k*arg2P_2+arg1P_1<=arg2P_2 ], cost: 14+3*k
     88: __init -> [22] : [], cost: NONTERM
     89: __init -> [22] : [ arg1P_1>0 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     87: __init -> f3 : arg1'=arg2P_2, arg2'=-k*arg2P_2+arg1P_1, arg3'=arg2P_2, arg4'=-k*arg2P_2+arg1P_1, [ arg2P_2>0 && arg1P_1>0 && arg1P_1>arg2P_2 && k>=0 && -(-1+k)*arg2P_2+arg1P_1>arg2P_2 && -k*arg2P_2+arg1P_1<=arg2P_2 ], cost: 14+3*k
     88: __init -> [22] : [], cost: NONTERM
     89: __init -> [22] : [ arg1P_1>0 ], cost: NONTERM

Computing asymptotic complexity for rule 88
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

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

NO