YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 25, 86, 88, 89 using the following rank functions:
    - Rank function 1:
      RF for loc. 23: -1+2*arraySize_0-2*i_0
      RF for loc. 65: 2*arraySize_0-2*i_0
      Bound for (chained) transitions 25, 86: 1
    - Rank function 2:
      RF for loc. 23: -1
      RF for loc. 65: 0
      Bound for (chained) transitions 88: 0
    - Rank function 3:
      RF for loc. 23: 0
      RF for loc. 65: 1
      Bound for (chained) transitions 89: 1
 * Removed transitions 35, 76, 78, 79 using the following rank functions:
    - Rank function 1:
      RF for loc. 27: -1+2*arraySize_0-2*i17_0
      RF for loc. 61: 2*arraySize_0-2*i17_0
      Bound for (chained) transitions 35, 76: 1
    - Rank function 2:
      RF for loc. 27: 0
      RF for loc. 61: 1
      Bound for (chained) transitions 78: 1
    - Rank function 3:
      RF for loc. 27: -1
      RF for loc. 61: 0
      Bound for (chained) transitions 79: 0
 * Removed transitions 45, 66, 68, 69 using the following rank functions:
    - Rank function 1:
      RF for loc. 31: -1+2*arraySize_0-2*i15_0
      RF for loc. 57: 2*arraySize_0-2*i15_0
      Bound for (chained) transitions 45, 66: 1
    - Rank function 2:
      RF for loc. 31: -1
      RF for loc. 57: 0
      Bound for (chained) transitions 68: 0
    - Rank function 3:
      RF for loc. 31: 0
      RF for loc. 57: 1
      Bound for (chained) transitions 69: 1
 * Removed transitions 55, 56, 58, 59 using the following rank functions:
    - Rank function 1:
      RF for loc. 35: -1+2*arraySize_0-2*i13_0
      RF for loc. 53: 2*arraySize_0-2*i13_0
      Bound for (chained) transitions 55, 56: 1
    - Rank function 2:
      RF for loc. 35: -1
      RF for loc. 53: 0
      Bound for (chained) transitions 58: 0
    - Rank function 3:
      RF for loc. 35: 0
      RF for loc. 53: 1
      Bound for (chained) transitions 59: 1
 * Removed transitions 46, 48, 49, 65 using the following rank functions:
    - Rank function 1:
      RF for loc. 34: -1+2*arraySize_0-2*i_0
      RF for loc. 49: 2*arraySize_0-2*i_0
      Bound for (chained) transitions 46, 65: 1
    - Rank function 2:
      RF for loc. 34: 0
      RF for loc. 49: 1
      Bound for (chained) transitions 48: 1
    - Rank function 3:
      RF for loc. 34: -1
      RF for loc. 49: 0
      Bound for (chained) transitions 49: 0
 * Removed transitions 36, 38, 39, 75 using the following rank functions:
    - Rank function 1:
      RF for loc. 30: -1+2*arraySize_0-2*i11_0
      RF for loc. 45: 2*arraySize_0-2*i11_0
      Bound for (chained) transitions 36, 75: 1
    - Rank function 2:
      RF for loc. 30: -1
      RF for loc. 45: 0
      Bound for (chained) transitions 38: 0
    - Rank function 3:
      RF for loc. 30: 0
      RF for loc. 45: 1
      Bound for (chained) transitions 39: 1
 * Removed transitions 26, 28, 29, 85 using the following rank functions:
    - Rank function 1:
      RF for loc. 26: -1+2*arraySize_0-2*i9_0
      RF for loc. 41: 2*arraySize_0-2*i9_0
      Bound for (chained) transitions 26, 85: 1
    - Rank function 2:
      RF for loc. 26: 0
      RF for loc. 41: 1
      Bound for (chained) transitions 28: 1
    - Rank function 3:
      RF for loc. 26: 0
      RF for loc. 41: 1
      Bound for (chained) transitions 29: 1
 * Removed transitions 17, 19, 20, 95 using the following rank functions:
    - Rank function 1:
      RF for loc. 22: -1+2*arraySize_0-2*i7_0
      RF for loc. 37: 2*arraySize_0-2*i7_0
      Bound for (chained) transitions 17, 95: 1
    - Rank function 2:
      RF for loc. 22: -1
      RF for loc. 37: 0
      Bound for (chained) transitions 19: 0
    - Rank function 3:
      RF for loc. 22: -1
      RF for loc. 37: 0
      Bound for (chained) transitions 20: 0
Errors: