YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 45, 47, 48, 53 using the following rank functions:
    - Rank function 1:
      RF for loc. 17: arg1
      RF for loc. 26: arg1
      Bound for (chained) transitions 45, 53: 2
      Bound for (chained) transitions 47: 2
      Bound for (chained) transitions 48: 2
 * Removed transitions 37, 39, 40 using the following rank functions:
    - Rank function 1:
      RF for loc. 15: 1+2*arg2
      RF for loc. 22: 2*arg2
      Bound for (chained) transitions 39: 4
    - Rank function 2:
      RF for loc. 15: 2*arg2
      RF for loc. 22: -1+2*arg2
      Bound for (chained) transitions 40: -1
    - Rank function 3:
      RF for loc. 15: 1
      RF for loc. 22: 0
      Bound for (chained) transitions 37: 1
 * Removed transitions 11, 15, 16, 17, 28, 31, 32, 33, 34, 35 using the following rank functions:
    - Rank function 1:
      RF for loc. 11: 4-5*arg2+5*arg3
      RF for loc. 12: 2-5*arg2+5*arg4
      RF for loc. 13: 1-5*arg2+5*arg3
      RF for loc. 14: -5*arg2+5*arg4
      RF for loc. 18: 3-5*arg2+5*arg3
      Bound for (chained) transitions 15: 8
      Bound for (chained) transitions 17: 8
      Bound for (chained) transitions 31: 6
      Bound for (chained) transitions 32: 6
    - Rank function 2:
      RF for loc. 11: 4-5*arg2+5*arg3
      RF for loc. 12: 2-5*arg2+5*arg4
      RF for loc. 13: 1-5*arg2+5*arg3
      RF for loc. 14: -5*arg2+5*arg4
      RF for loc. 18: 3-5*arg2+5*arg3
      Bound for (chained) transitions 16: 8
      Bound for (chained) transitions 33: 6
    - Rank function 3:
      RF for loc. 11: 0
      RF for loc. 12: arg3
      RF for loc. 13: 0
      RF for loc. 14: arg1
      RF for loc. 18: -1
      Bound for (chained) transitions 11: 0
      Bound for (chained) transitions 28: 1
      Bound for (chained) transitions 34: 1
      Bound for (chained) transitions 35: 1
Errors: