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