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