YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 12 using the following rank functions:
    - Rank function 1:
      RF for loc. 8: 3*x_0
      RF for loc. 9: -1+3*x_0
      RF for loc. 10: -2+3*x_0
      Bound for (chained) transitions 12: 3
Errors: