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