YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 11, 13, 14 using the following rank functions:
    - Rank function 1:
      RF for loc. 7: 1+2*arg1
      RF for loc. 12: 2*arg1
      Bound for (chained) transitions 13: 2
      Bound for (chained) transitions 14: 2
    - Rank function 2:
      RF for loc. 7: 0
      RF for loc. 12: -1
      Bound for (chained) transitions 11: 0
 * Removed transitions 1, 4, 5 using the following rank functions:
    - Rank function 1:
      RF for loc. 6: 1+2*arg1
      RF for loc. 8: 2*arg1
      Bound for (chained) transitions 4: 0
      Bound for (chained) transitions 5: 0
    - Rank function 2:
      RF for loc. 6: 0
      RF for loc. 8: -1
      Bound for (chained) transitions 1: 0
Errors: