NO

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

Initial linear ITS problem
   Start location: l13
      0: l0 -> l1 : WItemsNum^0'=WItemsNum^post_1, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==tmp1^post_1 && WItemsNum^0==WItemsNum^post_1 ], cost: 1
      1: l0 -> l2 : WItemsNum^0'=WItemsNum^post_2, tmp1^0'=tmp1^post_2, [ WItemsNum^0<=5 && WItemsNum^0==WItemsNum^post_2 && tmp1^0==tmp1^post_2 ], cost: 1
     11: l1 -> l5 : WItemsNum^0'=WItemsNum^post_12, tmp1^0'=tmp1^post_12, [ tmp1^0<=0 && 0<=tmp1^0 && WItemsNum^0==WItemsNum^post_12 && tmp1^0==tmp1^post_12 ], cost: 1
     12: l1 -> l2 : WItemsNum^0'=WItemsNum^post_13, tmp1^0'=tmp1^post_13, [ 1<=tmp1^0 && WItemsNum^0==WItemsNum^post_13 && tmp1^0==tmp1^post_13 ], cost: 1
     13: l1 -> l2 : WItemsNum^0'=WItemsNum^post_14, tmp1^0'=tmp1^post_14, [ 1+tmp1^0<=0 && WItemsNum^0==WItemsNum^post_14 && tmp1^0==tmp1^post_14 ], cost: 1
     14: l2 -> l4 : WItemsNum^0'=WItemsNum^post_15, tmp1^0'=tmp1^post_15, [ 6<=WItemsNum^0 && WItemsNum^post_15==1+WItemsNum^0 && tmp1^0==tmp1^post_15 ], cost: 1
     15: l2 -> l4 : WItemsNum^0'=WItemsNum^post_16, tmp1^0'=tmp1^post_16, [ WItemsNum^0<=5 && WItemsNum^post_16==1+WItemsNum^0 && tmp1^0==tmp1^post_16 ], cost: 1
      2: l3 -> l4 : WItemsNum^0'=WItemsNum^post_3, tmp1^0'=tmp1^post_3, [ WItemsNum^0==WItemsNum^post_3 && tmp1^0==tmp1^post_3 ], cost: 1
      3: l4 -> l0 : WItemsNum^0'=WItemsNum^post_4, tmp1^0'=tmp1^post_4, [ WItemsNum^0==WItemsNum^post_4 && tmp1^0==tmp1^post_4 ], cost: 1
      4: l5 -> l6 : WItemsNum^0'=WItemsNum^post_5, tmp1^0'=tmp1^post_5, [ WItemsNum^0==WItemsNum^post_5 && tmp1^0==tmp1^post_5 ], cost: 1
      9: l6 -> l3 : WItemsNum^0'=WItemsNum^post_10, tmp1^0'=tmp1^post_10, [ WItemsNum^0<=2 && WItemsNum^0==WItemsNum^post_10 && tmp1^0==tmp1^post_10 ], cost: 1
     10: l6 -> l5 : WItemsNum^0'=WItemsNum^post_11, tmp1^0'=tmp1^post_11, [ 3<=WItemsNum^0 && WItemsNum^post_11==-1+WItemsNum^0 && tmp1^0==tmp1^post_11 ], cost: 1
      5: l7 -> l8 : WItemsNum^0'=WItemsNum^post_6, tmp1^0'=tmp1^post_6, [ WItemsNum^0==WItemsNum^post_6 && tmp1^0==tmp1^post_6 ], cost: 1
      6: l9 -> l10 : WItemsNum^0'=WItemsNum^post_7, tmp1^0'=tmp1^post_7, [ WItemsNum^0==WItemsNum^post_7 && tmp1^0==tmp1^post_7 ], cost: 1
      7: l10 -> l11 : WItemsNum^0'=WItemsNum^post_8, tmp1^0'=tmp1^post_8, [ WItemsNum^0==WItemsNum^post_8 && tmp1^0==tmp1^post_8 ], cost: 1
      8: l11 -> l10 : WItemsNum^0'=WItemsNum^post_9, tmp1^0'=tmp1^post_9, [ WItemsNum^0==WItemsNum^post_9 && tmp1^0==tmp1^post_9 ], cost: 1
     16: l12 -> l3 : WItemsNum^0'=WItemsNum^post_17, tmp1^0'=tmp1^post_17, [ WItemsNum^1_1==WItemsNum^1_1 && WItemsNum^post_17==WItemsNum^post_17 && tmp1^0==tmp1^post_17 ], cost: 1
     17: l13 -> l12 : WItemsNum^0'=WItemsNum^post_18, tmp1^0'=tmp1^post_18, [ WItemsNum^0==WItemsNum^post_18 && tmp1^0==tmp1^post_18 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     17: l13 -> l12 : WItemsNum^0'=WItemsNum^post_18, tmp1^0'=tmp1^post_18, [ WItemsNum^0==WItemsNum^post_18 && tmp1^0==tmp1^post_18 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l13
      0: l0 -> l1 : WItemsNum^0'=WItemsNum^post_1, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==tmp1^post_1 && WItemsNum^0==WItemsNum^post_1 ], cost: 1
      1: l0 -> l2 : WItemsNum^0'=WItemsNum^post_2, tmp1^0'=tmp1^post_2, [ WItemsNum^0<=5 && WItemsNum^0==WItemsNum^post_2 && tmp1^0==tmp1^post_2 ], cost: 1
     11: l1 -> l5 : WItemsNum^0'=WItemsNum^post_12, tmp1^0'=tmp1^post_12, [ tmp1^0<=0 && 0<=tmp1^0 && WItemsNum^0==WItemsNum^post_12 && tmp1^0==tmp1^post_12 ], cost: 1
     12: l1 -> l2 : WItemsNum^0'=WItemsNum^post_13, tmp1^0'=tmp1^post_13, [ 1<=tmp1^0 && WItemsNum^0==WItemsNum^post_13 && tmp1^0==tmp1^post_13 ], cost: 1
     13: l1 -> l2 : WItemsNum^0'=WItemsNum^post_14, tmp1^0'=tmp1^post_14, [ 1+tmp1^0<=0 && WItemsNum^0==WItemsNum^post_14 && tmp1^0==tmp1^post_14 ], cost: 1
     14: l2 -> l4 : WItemsNum^0'=WItemsNum^post_15, tmp1^0'=tmp1^post_15, [ 6<=WItemsNum^0 && WItemsNum^post_15==1+WItemsNum^0 && tmp1^0==tmp1^post_15 ], cost: 1
     15: l2 -> l4 : WItemsNum^0'=WItemsNum^post_16, tmp1^0'=tmp1^post_16, [ WItemsNum^0<=5 && WItemsNum^post_16==1+WItemsNum^0 && tmp1^0==tmp1^post_16 ], cost: 1
      2: l3 -> l4 : WItemsNum^0'=WItemsNum^post_3, tmp1^0'=tmp1^post_3, [ WItemsNum^0==WItemsNum^post_3 && tmp1^0==tmp1^post_3 ], cost: 1
      3: l4 -> l0 : WItemsNum^0'=WItemsNum^post_4, tmp1^0'=tmp1^post_4, [ WItemsNum^0==WItemsNum^post_4 && tmp1^0==tmp1^post_4 ], cost: 1
      4: l5 -> l6 : WItemsNum^0'=WItemsNum^post_5, tmp1^0'=tmp1^post_5, [ WItemsNum^0==WItemsNum^post_5 && tmp1^0==tmp1^post_5 ], cost: 1
      9: l6 -> l3 : WItemsNum^0'=WItemsNum^post_10, tmp1^0'=tmp1^post_10, [ WItemsNum^0<=2 && WItemsNum^0==WItemsNum^post_10 && tmp1^0==tmp1^post_10 ], cost: 1
     10: l6 -> l5 : WItemsNum^0'=WItemsNum^post_11, tmp1^0'=tmp1^post_11, [ 3<=WItemsNum^0 && WItemsNum^post_11==-1+WItemsNum^0 && tmp1^0==tmp1^post_11 ], cost: 1
     16: l12 -> l3 : WItemsNum^0'=WItemsNum^post_17, tmp1^0'=tmp1^post_17, [ WItemsNum^1_1==WItemsNum^1_1 && WItemsNum^post_17==WItemsNum^post_17 && tmp1^0==tmp1^post_17 ], cost: 1
     17: l13 -> l12 : WItemsNum^0'=WItemsNum^post_18, tmp1^0'=tmp1^post_18, [ WItemsNum^0==WItemsNum^post_18 && tmp1^0==tmp1^post_18 ], cost: 1

Simplified all rules, resulting in:
   Start location: l13
      0: l0 -> l1 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 ], cost: 1
      1: l0 -> l2 : [ WItemsNum^0<=5 ], cost: 1
     11: l1 -> l5 : [ tmp1^0==0 ], cost: 1
     12: l1 -> l2 : [ 1<=tmp1^0 ], cost: 1
     13: l1 -> l2 : [ 1+tmp1^0<=0 ], cost: 1
     14: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ 6<=WItemsNum^0 ], cost: 1
     15: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ WItemsNum^0<=5 ], cost: 1
      2: l3 -> l4 : [], cost: 1
      3: l4 -> l0 : [], cost: 1
      4: l5 -> l6 : [], cost: 1
      9: l6 -> l3 : [ WItemsNum^0<=2 ], cost: 1
     10: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, [ 3<=WItemsNum^0 ], cost: 1
     16: l12 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 1
     17: l13 -> l12 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l13
      0: l0 -> l1 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 ], cost: 1
      1: l0 -> l2 : [ WItemsNum^0<=5 ], cost: 1
     11: l1 -> l5 : [ tmp1^0==0 ], cost: 1
     12: l1 -> l2 : [ 1<=tmp1^0 ], cost: 1
     13: l1 -> l2 : [ 1+tmp1^0<=0 ], cost: 1
     14: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ 6<=WItemsNum^0 ], cost: 1
     15: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ WItemsNum^0<=5 ], cost: 1
      2: l3 -> l4 : [], cost: 1
      3: l4 -> l0 : [], cost: 1
      4: l5 -> l6 : [], cost: 1
      9: l6 -> l3 : [ WItemsNum^0<=2 ], cost: 1
     10: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, [ 3<=WItemsNum^0 ], cost: 1
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l13
     11: l1 -> l5 : [ tmp1^0==0 ], cost: 1
     12: l1 -> l2 : [ 1<=tmp1^0 ], cost: 1
     13: l1 -> l2 : [ 1+tmp1^0<=0 ], cost: 1
     14: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ 6<=WItemsNum^0 ], cost: 1
     15: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ WItemsNum^0<=5 ], cost: 1
      2: l3 -> l4 : [], cost: 1
     19: l4 -> l1 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 ], cost: 2
     20: l4 -> l2 : [ WItemsNum^0<=5 ], cost: 2
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     22: l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, [ 3<=WItemsNum^0 ], cost: 2
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Accelerating simple loops of location 5.
   Accelerating the following rules:
     22: l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, [ 3<=WItemsNum^0 ], cost: 2

   Accelerated rule 22 with backward acceleration, yielding the new rule 23.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 22.

Accelerated all simple loops using metering functions (where possible):
   Start location: l13
     11: l1 -> l5 : [ tmp1^0==0 ], cost: 1
     12: l1 -> l2 : [ 1<=tmp1^0 ], cost: 1
     13: l1 -> l2 : [ 1+tmp1^0<=0 ], cost: 1
     14: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ 6<=WItemsNum^0 ], cost: 1
     15: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ WItemsNum^0<=5 ], cost: 1
      2: l3 -> l4 : [], cost: 1
     19: l4 -> l1 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 ], cost: 2
     20: l4 -> l2 : [ WItemsNum^0<=5 ], cost: 2
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     23: l5 -> l5 : WItemsNum^0'=2, [ -2+WItemsNum^0>=0 ], cost: -4+2*WItemsNum^0
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l13
     11: l1 -> l5 : [ tmp1^0==0 ], cost: 1
     12: l1 -> l2 : [ 1<=tmp1^0 ], cost: 1
     13: l1 -> l2 : [ 1+tmp1^0<=0 ], cost: 1
     24: l1 -> l5 : WItemsNum^0'=2, [ tmp1^0==0 && -2+WItemsNum^0>=0 ], cost: -3+2*WItemsNum^0
     14: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ 6<=WItemsNum^0 ], cost: 1
     15: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ WItemsNum^0<=5 ], cost: 1
      2: l3 -> l4 : [], cost: 1
     19: l4 -> l1 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 ], cost: 2
     20: l4 -> l2 : [ WItemsNum^0<=5 ], cost: 2
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l13
      2: l3 -> l4 : [], cost: 1
     25: l4 -> l5 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 3
     28: l4 -> l5 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: -1+2*WItemsNum^0
     29: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ WItemsNum^0<=5 ], cost: 3
     30: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && 1<=tmp1^post_1 ], cost: 4
     31: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && 1+tmp1^post_1<=0 ], cost: 4
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Accelerating simple loops of location 4.
   Accelerating the following rules:
     29: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, [ WItemsNum^0<=5 ], cost: 3
     30: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && 1<=tmp1^post_1 ], cost: 4
     31: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && 1+tmp1^post_1<=0 ], cost: 4

   Accelerated rule 29 with backward acceleration, yielding the new rule 32.
   Accelerated rule 30 with non-termination, yielding the new rule 33.
   Accelerated rule 31 with non-termination, yielding the new rule 34.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 29 30 31.

Accelerated all simple loops using metering functions (where possible):
   Start location: l13
      2: l3 -> l4 : [], cost: 1
     25: l4 -> l5 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 3
     28: l4 -> l5 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: -1+2*WItemsNum^0
     32: l4 -> l4 : WItemsNum^0'=6, [ 6-WItemsNum^0>=0 ], cost: 18-3*WItemsNum^0
     33: l4 -> [15] : [ 6<=WItemsNum^0 && 1<=tmp1^post_1 ], cost: NONTERM
     34: l4 -> [15] : [ 6<=WItemsNum^0 && 1+tmp1^post_1<=0 ], cost: NONTERM
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l13
      2: l3 -> l4 : [], cost: 1
     35: l3 -> l4 : WItemsNum^0'=6, [ 6-WItemsNum^0>=0 ], cost: 19-3*WItemsNum^0
     36: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     37: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     25: l4 -> l5 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 3
     28: l4 -> l5 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: -1+2*WItemsNum^0
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l13
     36: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     37: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     38: l3 -> l5 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 4
     39: l3 -> l5 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 2*WItemsNum^0
     40: l3 -> l5 : WItemsNum^0'=6, tmp1^0'=tmp1^post_1, [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 22-3*WItemsNum^0
     41: l3 -> l5 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 30-3*WItemsNum^0
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Merged rules:
   Start location: l13
     38: l3 -> l5 : tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 4
     39: l3 -> l5 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 2*WItemsNum^0
     40: l3 -> l5 : WItemsNum^0'=6, tmp1^0'=tmp1^post_1, [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 22-3*WItemsNum^0
     41: l3 -> l5 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 30-3*WItemsNum^0
     42: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     21: l5 -> l3 : [ WItemsNum^0<=2 ], cost: 2
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l13
     42: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     43: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6<=WItemsNum^0 && tmp1^post_1==0 ], cost: 2+2*WItemsNum^0
     44: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post_1, [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 32-3*WItemsNum^0
     45: l3 -> [16] : [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 22-3*WItemsNum^0
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Accelerating simple loops of location 3.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     43: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, [ 6<=WItemsNum^0 ], cost: 2+2*WItemsNum^0
     44: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, [ 6-WItemsNum^0>=0 ], cost: 32-3*WItemsNum^0

   Failed to prove monotonicity of the guard of rule 43.
   Accelerated rule 44 with non-termination, yielding the new rule 46.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 44.

Accelerated all simple loops using metering functions (where possible):
   Start location: l13
     42: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     43: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, [ 6<=WItemsNum^0 ], cost: 2+2*WItemsNum^0
     45: l3 -> [16] : [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 22-3*WItemsNum^0
     46: l3 -> [17] : [ 6-WItemsNum^0>=0 ], cost: NONTERM
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l13
     42: l3 -> [15] : [ 6<=WItemsNum^0 ], cost: NONTERM
     45: l3 -> [16] : [ 6-WItemsNum^0>=0 && tmp1^post_1==0 ], cost: 22-3*WItemsNum^0
     18: l13 -> l3 : WItemsNum^0'=WItemsNum^post_17, [], cost: 2
     47: l13 -> l3 : WItemsNum^0'=2, tmp1^0'=0, [ 6<=WItemsNum^post_17 ], cost: 4+2*WItemsNum^post_17
     48: l13 -> [17] : [], cost: NONTERM

Eliminated locations (on tree-shaped paths):
   Start location: l13
     48: l13 -> [17] : [], cost: NONTERM
     49: l13 -> [15] : [ 6<=WItemsNum^post_17 ], cost: NONTERM
     50: l13 -> [16] : WItemsNum^0'=WItemsNum^post_17, [ 6-WItemsNum^post_17>=0 && tmp1^post_1==0 ], cost: 24-3*WItemsNum^post_17
     51: l13 -> [16] : WItemsNum^0'=2, tmp1^0'=0, [ 6<=WItemsNum^post_17 && tmp1^post_1==0 ], cost: 20+2*WItemsNum^post_17
     52: l13 -> [18] : [ 6<=WItemsNum^post_17 ], cost: 4+2*WItemsNum^post_17

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l13
     48: l13 -> [17] : [], cost: NONTERM
     49: l13 -> [15] : [ 6<=WItemsNum^post_17 ], cost: NONTERM
     50: l13 -> [16] : WItemsNum^0'=WItemsNum^post_17, [ 6-WItemsNum^post_17>=0 && tmp1^post_1==0 ], cost: 24-3*WItemsNum^post_17
     51: l13 -> [16] : WItemsNum^0'=2, tmp1^0'=0, [ 6<=WItemsNum^post_17 && tmp1^post_1==0 ], cost: 20+2*WItemsNum^post_17
     52: l13 -> [18] : [ 6<=WItemsNum^post_17 ], cost: 4+2*WItemsNum^post_17

Computing asymptotic complexity for rule 48
   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