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