YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 103, 105, 106, 111 using the following rank functions:
    - Rank function 1:
      RF for loc. 60: -1-2*i48_0+2*n47_0
      RF for loc. 73: -2*i48_0+2*n47_0
      Bound for (chained) transitions 103, 111: 1
    - Rank function 2:
      RF for loc. 60: -1
      RF for loc. 73: 0
      Bound for (chained) transitions 105: 0
      Bound for (chained) transitions 106: 0
 * Removed transitions 94, 96, 97, 112 using the following rank functions:
    - Rank function 1:
      RF for loc. 58: -1-2*i34_0+2*n33_0
      RF for loc. 69: -2*i34_0+2*n33_0
      Bound for (chained) transitions 94, 112: 1
    - Rank function 2:
      RF for loc. 58: 0
      RF for loc. 69: 1
      Bound for (chained) transitions 96: 1
      Bound for (chained) transitions 97: 1
 * Removed transitions 77, 86, 88, 89 using the following rank functions:
    - Rank function 1:
      RF for loc. 53: -1-2*i20_0+2*n19_0
      RF for loc. 65: -2*i20_0+2*n19_0
      Bound for (chained) transitions 77, 86: 1
    - Rank function 2:
      RF for loc. 53: -1
      RF for loc. 65: 0
      Bound for (chained) transitions 88: 0
      Bound for (chained) transitions 89: 0
 * Removed transitions 78, 80, 81, 102 using the following rank functions:
    - Rank function 1:
      RF for loc. 56: -1-2*i6_0+2*n5_0
      RF for loc. 61: -2*i6_0+2*n5_0
      Bound for (chained) transitions 78, 102: 1
    - Rank function 2:
      RF for loc. 56: 0
      RF for loc. 61: 1
      Bound for (chained) transitions 80: 1
      Bound for (chained) transitions 81: 1
Errors: