YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 36, 38, 39, 42, 43, 44, 45, 46, 47, 48, 49 using the following rank functions:
    - Rank function 1:
      RF for loc. 33: -3+6*a_163_0
      RF for loc. 34: -4+6*a_163_0
      RF for loc. 35: 1+6*a_193_0
      RF for loc. 36: 6*a_193_0
      RF for loc. 37: -1+6*a_193_0
      RF for loc. 39: -2+6*a_163_0
      Bound for (chained) transitions 38: -2
      Bound for (chained) transitions 39: -2
    - Rank function 2:
      RF for loc. 33: 3
      RF for loc. 34: 2
      RF for loc. 35: 1
      RF for loc. 36: 0
      RF for loc. 37: -1
      RF for loc. 39: -2*result_dot_nondet_sdv_special_RETURN_VALUE_14_0
      Bound for (chained) transitions 36, 49: -1
      Bound for (chained) transitions 42: 3
      Bound for (chained) transitions 43: 3
      Bound for (chained) transitions 44: 2
      Bound for (chained) transitions 45: 1
      Bound for (chained) transitions 46: 1
      Bound for (chained) transitions 47: 0
      Bound for (chained) transitions 48: 0
 * Removed transitions 51, 53, 54 using the following rank functions:
    - Rank function 1:
      RF for loc. 38: 1-2*i_27_0+2*length_25_0
      RF for loc. 43: -2*i_27_0+2*length_25_0
      Bound for (chained) transitions 53: 2
      Bound for (chained) transitions 54: 2
    - Rank function 2:
      RF for loc. 38: 0
      RF for loc. 43: -1
      Bound for (chained) transitions 51: 0
Errors: