NO

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

Initial linear ITS problem
   Start location: l6
      0: l0 -> l1 : c^0'=c^post_1, ox^0'=ox^post_1, oy^0'=oy^post_1, oz^0'=oz^post_1, sx^0'=sx^post_1, sy^0'=sy^post_1, sz^0'=sz^post_1, x^0'=x^post_1, y^0'=y^post_1, z^0'=z^post_1, [ c^0==c^post_1 && ox^0==ox^post_1 && oy^0==oy^post_1 && oz^0==oz^post_1 && sx^0==sx^post_1 && sy^0==sy^post_1 && sz^0==sz^post_1 && x^0==x^post_1 && y^0==y^post_1 && z^0==z^post_1 ], cost: 1
      1: l2 -> l0 : c^0'=c^post_2, ox^0'=ox^post_2, oy^0'=oy^post_2, oz^0'=oz^post_2, sx^0'=sx^post_2, sy^0'=sy^post_2, sz^0'=sz^post_2, x^0'=x^post_2, y^0'=y^post_2, z^0'=z^post_2, [ 1+sx^0<=1 && c^0==c^post_2 && ox^0==ox^post_2 && oy^0==oy^post_2 && oz^0==oz^post_2 && sx^0==sx^post_2 && sy^0==sy^post_2 && sz^0==sz^post_2 && x^0==x^post_2 && y^0==y^post_2 && z^0==z^post_2 ], cost: 1
      2: l2 -> l0 : c^0'=c^post_3, ox^0'=ox^post_3, oy^0'=oy^post_3, oz^0'=oz^post_3, sx^0'=sx^post_3, sy^0'=sy^post_3, sz^0'=sz^post_3, x^0'=x^post_3, y^0'=y^post_3, z^0'=z^post_3, [ ox^0<=x^0 && c^0==c^post_3 && ox^0==ox^post_3 && oy^0==oy^post_3 && oz^0==oz^post_3 && sx^0==sx^post_3 && sy^0==sy^post_3 && sz^0==sz^post_3 && x^0==x^post_3 && y^0==y^post_3 && z^0==z^post_3 ], cost: 1
      3: l3 -> l4 : c^0'=c^post_4, ox^0'=ox^post_4, oy^0'=oy^post_4, oz^0'=oz^post_4, sx^0'=sx^post_4, sy^0'=sy^post_4, sz^0'=sz^post_4, x^0'=x^post_4, y^0'=y^post_4, z^0'=z^post_4, [ y^post_4==-1+y^0 && x^post_4==z^0 && c^0==c^post_4 && ox^0==ox^post_4 && oy^0==oy^post_4 && oz^0==oz^post_4 && sx^0==sx^post_4 && sy^0==sy^post_4 && sz^0==sz^post_4 && z^0==z^post_4 ], cost: 1
      4: l3 -> l4 : c^0'=c^post_5, ox^0'=ox^post_5, oy^0'=oy^post_5, oz^0'=oz^post_5, sx^0'=sx^post_5, sy^0'=sy^post_5, sz^0'=sz^post_5, x^0'=x^post_5, y^0'=y^post_5, z^0'=z^post_5, [ x^post_5==-1+x^0 && c^0==c^post_5 && ox^0==ox^post_5 && oy^0==oy^post_5 && oz^0==oz^post_5 && sx^0==sx^post_5 && sy^0==sy^post_5 && sz^0==sz^post_5 && y^0==y^post_5 && z^0==z^post_5 ], cost: 1
      5: l4 -> l3 : c^0'=c^post_6, ox^0'=ox^post_6, oy^0'=oy^post_6, oz^0'=oz^post_6, sx^0'=sx^post_6, sy^0'=sy^post_6, sz^0'=sz^post_6, x^0'=x^post_6, y^0'=y^post_6, z^0'=z^post_6, [ c^post_6==1 && ox^post_6==x^0 && oy^post_6==y^0 && oz^post_6==z^0 && sx^post_6==x^0 && sy^post_6==y^0 && sz^post_6==z^0 && x^0==x^post_6 && y^0==y^post_6 && z^0==z^post_6 ], cost: 1
      6: l4 -> l2 : c^0'=c^post_7, ox^0'=ox^post_7, oy^0'=oy^post_7, oz^0'=oz^post_7, sx^0'=sx^post_7, sy^0'=sy^post_7, sz^0'=sz^post_7, x^0'=x^post_7, y^0'=y^post_7, z^0'=z^post_7, [ 1<=c^0 && c^0==c^post_7 && ox^0==ox^post_7 && oy^0==oy^post_7 && oz^0==oz^post_7 && sx^0==sx^post_7 && sy^0==sy^post_7 && sz^0==sz^post_7 && x^0==x^post_7 && y^0==y^post_7 && z^0==z^post_7 ], cost: 1
      7: l4 -> l3 : c^0'=c^post_8, ox^0'=ox^post_8, oy^0'=oy^post_8, oz^0'=oz^post_8, sx^0'=sx^post_8, sy^0'=sy^post_8, sz^0'=sz^post_8, x^0'=x^post_8, y^0'=y^post_8, z^0'=z^post_8, [ 1<=x^0 && c^0==c^post_8 && ox^0==ox^post_8 && oy^0==oy^post_8 && oz^0==oz^post_8 && sx^0==sx^post_8 && sy^0==sy^post_8 && sz^0==sz^post_8 && x^0==x^post_8 && y^0==y^post_8 && z^0==z^post_8 ], cost: 1
      8: l4 -> l3 : c^0'=c^post_9, ox^0'=ox^post_9, oy^0'=oy^post_9, oz^0'=oz^post_9, sx^0'=sx^post_9, sy^0'=sy^post_9, sz^0'=sz^post_9, x^0'=x^post_9, y^0'=y^post_9, z^0'=z^post_9, [ 1<=x^0 && sx^post_9==x^0 && sy^post_9==y^0 && sz^post_9==z^0 && c^0==c^post_9 && ox^0==ox^post_9 && oy^0==oy^post_9 && oz^0==oz^post_9 && x^0==x^post_9 && y^0==y^post_9 && z^0==z^post_9 ], cost: 1
      9: l5 -> l4 : c^0'=c^post_10, ox^0'=ox^post_10, oy^0'=oy^post_10, oz^0'=oz^post_10, sx^0'=sx^post_10, sy^0'=sy^post_10, sz^0'=sz^post_10, x^0'=x^post_10, y^0'=y^post_10, z^0'=z^post_10, [ c^post_10==0 && ox^0==ox^post_10 && oy^0==oy^post_10 && oz^0==oz^post_10 && sx^0==sx^post_10 && sy^0==sy^post_10 && sz^0==sz^post_10 && x^0==x^post_10 && y^0==y^post_10 && z^0==z^post_10 ], cost: 1
     10: l6 -> l5 : c^0'=c^post_11, ox^0'=ox^post_11, oy^0'=oy^post_11, oz^0'=oz^post_11, sx^0'=sx^post_11, sy^0'=sy^post_11, sz^0'=sz^post_11, x^0'=x^post_11, y^0'=y^post_11, z^0'=z^post_11, [ c^0==c^post_11 && ox^0==ox^post_11 && oy^0==oy^post_11 && oz^0==oz^post_11 && sx^0==sx^post_11 && sy^0==sy^post_11 && sz^0==sz^post_11 && x^0==x^post_11 && y^0==y^post_11 && z^0==z^post_11 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     10: l6 -> l5 : c^0'=c^post_11, ox^0'=ox^post_11, oy^0'=oy^post_11, oz^0'=oz^post_11, sx^0'=sx^post_11, sy^0'=sy^post_11, sz^0'=sz^post_11, x^0'=x^post_11, y^0'=y^post_11, z^0'=z^post_11, [ c^0==c^post_11 && ox^0==ox^post_11 && oy^0==oy^post_11 && oz^0==oz^post_11 && sx^0==sx^post_11 && sy^0==sy^post_11 && sz^0==sz^post_11 && x^0==x^post_11 && y^0==y^post_11 && z^0==z^post_11 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
      3: l3 -> l4 : c^0'=c^post_4, ox^0'=ox^post_4, oy^0'=oy^post_4, oz^0'=oz^post_4, sx^0'=sx^post_4, sy^0'=sy^post_4, sz^0'=sz^post_4, x^0'=x^post_4, y^0'=y^post_4, z^0'=z^post_4, [ y^post_4==-1+y^0 && x^post_4==z^0 && c^0==c^post_4 && ox^0==ox^post_4 && oy^0==oy^post_4 && oz^0==oz^post_4 && sx^0==sx^post_4 && sy^0==sy^post_4 && sz^0==sz^post_4 && z^0==z^post_4 ], cost: 1
      4: l3 -> l4 : c^0'=c^post_5, ox^0'=ox^post_5, oy^0'=oy^post_5, oz^0'=oz^post_5, sx^0'=sx^post_5, sy^0'=sy^post_5, sz^0'=sz^post_5, x^0'=x^post_5, y^0'=y^post_5, z^0'=z^post_5, [ x^post_5==-1+x^0 && c^0==c^post_5 && ox^0==ox^post_5 && oy^0==oy^post_5 && oz^0==oz^post_5 && sx^0==sx^post_5 && sy^0==sy^post_5 && sz^0==sz^post_5 && y^0==y^post_5 && z^0==z^post_5 ], cost: 1
      5: l4 -> l3 : c^0'=c^post_6, ox^0'=ox^post_6, oy^0'=oy^post_6, oz^0'=oz^post_6, sx^0'=sx^post_6, sy^0'=sy^post_6, sz^0'=sz^post_6, x^0'=x^post_6, y^0'=y^post_6, z^0'=z^post_6, [ c^post_6==1 && ox^post_6==x^0 && oy^post_6==y^0 && oz^post_6==z^0 && sx^post_6==x^0 && sy^post_6==y^0 && sz^post_6==z^0 && x^0==x^post_6 && y^0==y^post_6 && z^0==z^post_6 ], cost: 1
      7: l4 -> l3 : c^0'=c^post_8, ox^0'=ox^post_8, oy^0'=oy^post_8, oz^0'=oz^post_8, sx^0'=sx^post_8, sy^0'=sy^post_8, sz^0'=sz^post_8, x^0'=x^post_8, y^0'=y^post_8, z^0'=z^post_8, [ 1<=x^0 && c^0==c^post_8 && ox^0==ox^post_8 && oy^0==oy^post_8 && oz^0==oz^post_8 && sx^0==sx^post_8 && sy^0==sy^post_8 && sz^0==sz^post_8 && x^0==x^post_8 && y^0==y^post_8 && z^0==z^post_8 ], cost: 1
      8: l4 -> l3 : c^0'=c^post_9, ox^0'=ox^post_9, oy^0'=oy^post_9, oz^0'=oz^post_9, sx^0'=sx^post_9, sy^0'=sy^post_9, sz^0'=sz^post_9, x^0'=x^post_9, y^0'=y^post_9, z^0'=z^post_9, [ 1<=x^0 && sx^post_9==x^0 && sy^post_9==y^0 && sz^post_9==z^0 && c^0==c^post_9 && ox^0==ox^post_9 && oy^0==oy^post_9 && oz^0==oz^post_9 && x^0==x^post_9 && y^0==y^post_9 && z^0==z^post_9 ], cost: 1
      9: l5 -> l4 : c^0'=c^post_10, ox^0'=ox^post_10, oy^0'=oy^post_10, oz^0'=oz^post_10, sx^0'=sx^post_10, sy^0'=sy^post_10, sz^0'=sz^post_10, x^0'=x^post_10, y^0'=y^post_10, z^0'=z^post_10, [ c^post_10==0 && ox^0==ox^post_10 && oy^0==oy^post_10 && oz^0==oz^post_10 && sx^0==sx^post_10 && sy^0==sy^post_10 && sz^0==sz^post_10 && x^0==x^post_10 && y^0==y^post_10 && z^0==z^post_10 ], cost: 1
     10: l6 -> l5 : c^0'=c^post_11, ox^0'=ox^post_11, oy^0'=oy^post_11, oz^0'=oz^post_11, sx^0'=sx^post_11, sy^0'=sy^post_11, sz^0'=sz^post_11, x^0'=x^post_11, y^0'=y^post_11, z^0'=z^post_11, [ c^0==c^post_11 && ox^0==ox^post_11 && oy^0==oy^post_11 && oz^0==oz^post_11 && sx^0==sx^post_11 && sy^0==sy^post_11 && sz^0==sz^post_11 && x^0==x^post_11 && y^0==y^post_11 && z^0==z^post_11 ], cost: 1

Simplified all rules, resulting in:
   Start location: l6
      3: l3 -> l4 : x^0'=z^0, y^0'=-1+y^0, [], cost: 1
      4: l3 -> l4 : x^0'=-1+x^0, [], cost: 1
      5: l4 -> l3 : c^0'=1, ox^0'=x^0, oy^0'=y^0, oz^0'=z^0, sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, [], cost: 1
      7: l4 -> l3 : [ 1<=x^0 ], cost: 1
      8: l4 -> l3 : sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, [ 1<=x^0 ], cost: 1
      9: l5 -> l4 : c^0'=0, [], cost: 1
     10: l6 -> l5 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l6
      3: l3 -> l4 : x^0'=z^0, y^0'=-1+y^0, [], cost: 1
      4: l3 -> l4 : x^0'=-1+x^0, [], cost: 1
      5: l4 -> l3 : c^0'=1, ox^0'=x^0, oy^0'=y^0, oz^0'=z^0, sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, [], cost: 1
      7: l4 -> l3 : [ 1<=x^0 ], cost: 1
      8: l4 -> l3 : sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, [ 1<=x^0 ], cost: 1
     11: l6 -> l4 : c^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l6
     12: l4 -> l4 : c^0'=1, ox^0'=x^0, oy^0'=y^0, oz^0'=z^0, sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=z^0, y^0'=-1+y^0, [], cost: 2
     13: l4 -> l4 : c^0'=1, ox^0'=x^0, oy^0'=y^0, oz^0'=z^0, sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=-1+x^0, [], cost: 2
     14: l4 -> l4 : x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 2
     15: l4 -> l4 : x^0'=-1+x^0, [ 1<=x^0 ], cost: 2
     16: l4 -> l4 : sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 2
     17: l4 -> l4 : sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=-1+x^0, [ 1<=x^0 ], cost: 2
     11: l6 -> l4 : c^0'=0, [], cost: 2

Accelerating simple loops of location 4.
   Accelerating the following rules:
     12: l4 -> l4 : c^0'=1, ox^0'=x^0, oy^0'=y^0, oz^0'=z^0, sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=z^0, y^0'=-1+y^0, [], cost: 2
     13: l4 -> l4 : c^0'=1, ox^0'=x^0, oy^0'=y^0, oz^0'=z^0, sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=-1+x^0, [], cost: 2
     14: l4 -> l4 : x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 2
     15: l4 -> l4 : x^0'=-1+x^0, [ 1<=x^0 ], cost: 2
     16: l4 -> l4 : sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 2
     17: l4 -> l4 : sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=-1+x^0, [ 1<=x^0 ], cost: 2

   Accelerated rule 12 with non-termination, yielding the new rule 18.
   Accelerated rule 13 with non-termination, yielding the new rule 19.
[test] deduced pseudo-invariant x^0-z^0<=0, also trying -x^0+z^0<=-1
   Accelerated rule 14 with non-termination, yielding the new rule 20.
   Accelerated rule 14 with non-termination, yielding the new rule 21.
   Accelerated rule 14 with backward acceleration, yielding the new rule 22.
   Accelerated rule 15 with backward acceleration, yielding the new rule 23.
[test] deduced pseudo-invariant x^0-z^0<=0, also trying -x^0+z^0<=-1
   Accelerated rule 16 with non-termination, yielding the new rule 24.
   Accelerated rule 16 with non-termination, yielding the new rule 25.
   Accelerated rule 16 with backward acceleration, yielding the new rule 26.
   Accelerated rule 17 with backward acceleration, yielding the new rule 27.
[accelerate] Nesting with 2 inner and 4 outer candidates
   Removing the simple loops: 12 13 15 17.
   Also removing duplicate rules: 18 20 21 22 25.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
     14: l4 -> l4 : x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 2
     16: l4 -> l4 : sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 2
     19: l4 -> [7] : [], cost: NONTERM
     23: l4 -> l4 : x^0'=0, [ x^0>=0 ], cost: 2*x^0
     24: l4 -> [7] : [ 1<=x^0 && 1<=z^0 ], cost: NONTERM
     26: l4 -> [7] : [ 1<=x^0 && x^0-z^0<=0 ], cost: NONTERM
     27: l4 -> l4 : sx^0'=1, sy^0'=y^0, sz^0'=z^0, x^0'=0, [ x^0>=1 ], cost: 2*x^0
     11: l6 -> l4 : c^0'=0, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
     11: l6 -> l4 : c^0'=0, [], cost: 2
     28: l6 -> l4 : c^0'=0, x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 4
     29: l6 -> l4 : c^0'=0, sx^0'=x^0, sy^0'=y^0, sz^0'=z^0, x^0'=z^0, y^0'=-1+y^0, [ 1<=x^0 ], cost: 4
     30: l6 -> [7] : [], cost: NONTERM
     31: l6 -> l4 : c^0'=0, x^0'=0, [ x^0>=0 ], cost: 2+2*x^0
     32: l6 -> [7] : [ 1<=x^0 && 1<=z^0 ], cost: NONTERM
     33: l6 -> [7] : [ 1<=x^0 && x^0-z^0<=0 ], cost: NONTERM
     34: l6 -> l4 : c^0'=0, sx^0'=1, sy^0'=y^0, sz^0'=z^0, x^0'=0, [ x^0>=1 ], cost: 2+2*x^0

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l6
     30: l6 -> [7] : [], cost: NONTERM
     31: l6 -> l4 : c^0'=0, x^0'=0, [ x^0>=0 ], cost: 2+2*x^0
     32: l6 -> [7] : [ 1<=x^0 && 1<=z^0 ], cost: NONTERM
     33: l6 -> [7] : [ 1<=x^0 && x^0-z^0<=0 ], cost: NONTERM
     34: l6 -> l4 : c^0'=0, sx^0'=1, sy^0'=y^0, sz^0'=z^0, x^0'=0, [ x^0>=1 ], cost: 2+2*x^0

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l6
     30: l6 -> [7] : [], cost: NONTERM
     31: l6 -> l4 : c^0'=0, x^0'=0, [ x^0>=0 ], cost: 2+2*x^0
     32: l6 -> [7] : [ 1<=x^0 && 1<=z^0 ], cost: NONTERM
     33: l6 -> [7] : [ 1<=x^0 && x^0-z^0<=0 ], cost: NONTERM
     34: l6 -> l4 : c^0'=0, sx^0'=1, sy^0'=y^0, sz^0'=z^0, x^0'=0, [ x^0>=1 ], cost: 2+2*x^0

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