YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 21, 23, 24 using the following rank functions:
    - Rank function 1:
      RF for loc. 9: 1+2*arg1
      RF for loc. 16: 2*arg1
      Bound for (chained) transitions 23: 2
      Bound for (chained) transitions 24: 2
    - Rank function 2:
      RF for loc. 9: 1
      RF for loc. 16: 0
      Bound for (chained) transitions 21: 1
 * Removed transitions 7, 10, 11, 19, 20 using the following rank functions:
    - Rank function 1:
      RF for loc. 10: 2+3*arg4
      RF for loc. 11: 3*arg4
      RF for loc. 12: 1+3*arg4
      Bound for (chained) transitions 10: 4
      Bound for (chained) transitions 11: 4
      Bound for (chained) transitions 19: 3
      Bound for (chained) transitions 20: 3
    - Rank function 2:
      RF for loc. 10: 0
      RF for loc. 12: -1
      Bound for (chained) transitions 7: 0
Errors: