YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 64, 66, 67, 72 using the following rank functions:
    - Rank function 1:
      RF for loc. 23: -1-2*i_0+2*nodecount_0
      RF for loc. 49: -2*i_0+2*nodecount_0
      Bound for (chained) transitions 64, 72: 1
    - Rank function 2:
      RF for loc. 23: 0
      RF for loc. 49: 1
      Bound for (chained) transitions 66: 1
      Bound for (chained) transitions 67: 1
 * Removed transitions 18, 20, 56, 58, 59 using the following rank functions:
    - Rank function 1:
      RF for loc. 21: -1+2*edgecount_0-2*i_0
      RF for loc. 45: 2*edgecount_0-2*i_0
      Bound for (chained) transitions 18, 20, 56: 1
    - Rank function 2:
      RF for loc. 21: 0
      RF for loc. 45: 1
      Bound for (chained) transitions 58: 1
      Bound for (chained) transitions 59: 1
 * Removed transitions 21, 22, 24, 40, 42, 43, 48, 50, 51 using the following rank functions:
    - Rank function 1:
      RF for loc. 24: -3*i_0+3*nodecount_0
      RF for loc. 26: -3*i_0+3*nodecount_0
      RF for loc. 27: 1-3*i_0+3*nodecount_0
      RF for loc. 37: 2-3*i_0+3*nodecount_0
      RF for loc. 41: -3*i_0+3*nodecount_0
      Bound for (chained) transitions 24: 4
    - Rank function 2:
      RF for loc. 24: 3*edgecount_0-3*j_0
      RF for loc. 26: 2+3*edgecount_0-3*j_0
      RF for loc. 27: -2+3*edgecount_0-3*j_0
      RF for loc. 37: -1+3*edgecount_0-3*j_0
      RF for loc. 41: 1+3*edgecount_0-3*j_0
      Bound for (chained) transitions 22: 3
    - Rank function 3:
      RF for loc. 24: -1
      RF for loc. 26: 1
      RF for loc. 27: -3
      RF for loc. 37: -2
      RF for loc. 41: 0
      Bound for (chained) transitions 21, 40: -1
      Bound for (chained) transitions 42: -2
      Bound for (chained) transitions 43: -2
      Bound for (chained) transitions 48: 1
      Bound for (chained) transitions 50: 0
      Bound for (chained) transitions 51: 0
 * Removed transitions 25, 26, 27, 28, 29, 31, 32, 34, 35 using the following rank functions:
    - Rank function 1:
      RF for loc. 28: -3-5*i_0+5*source_0
      RF for loc. 29: -4-5*i_0+5*source_0
      RF for loc. 31: -2-5*i_0+5*source_0
      RF for loc. 32: -1-5*i_0+5*source_0
      RF for loc. 33: -5*i_0+5*source_0
      Bound for (chained) transitions 28: 3
    - Rank function 2:
      RF for loc. 28: -3-5*i_0+5*source_0
      RF for loc. 29: -4-5*i_0+5*source_0
      RF for loc. 31: -2-5*i_0+5*source_0
      RF for loc. 32: -1-5*i_0+5*source_0
      RF for loc. 33: -5*i_0+5*source_0
      Bound for (chained) transitions 29: -2
    - Rank function 3:
      RF for loc. 28: -3-5*i_0+5*nodecount_0
      RF for loc. 29: -4-5*i_0+5*nodecount_0
      RF for loc. 31: -2-5*i_0+5*nodecount_0
      RF for loc. 32: -1-5*i_0+5*nodecount_0
      RF for loc. 33: -5*i_0+5*nodecount_0
      Bound for (chained) transitions 31: 4
    - Rank function 4:
      RF for loc. 28: 2
      RF for loc. 29: 1
      RF for loc. 31: 3
      RF for loc. 32: -1
      RF for loc. 33: 0
      Bound for (chained) transitions 25: 2
      Bound for (chained) transitions 26, 32: 1
      Bound for (chained) transitions 27: 3
      Bound for (chained) transitions 34: 0
      Bound for (chained) transitions 35: 0
Errors: