YES Termination proof succeeded Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 21, 62, 64, 65 using the following rank functions: - Rank function 1: RF for loc. 19: -1-2*i_0 RF for loc. 49: -2*i_0 Bound for (chained) transitions 21, 62: -99 - Rank function 2: RF for loc. 19: -1 RF for loc. 49: 0 Bound for (chained) transitions 64: 0 Bound for (chained) transitions 65: 0 * Removed transitions 31, 52, 54, 55 using the following rank functions: - Rank function 1: RF for loc. 23: -1-2*i13_0 RF for loc. 45: -2*i13_0 Bound for (chained) transitions 31, 52: -99 - Rank function 2: RF for loc. 23: -1 RF for loc. 45: 0 Bound for (chained) transitions 54: 0 Bound for (chained) transitions 55: 0 * Removed transitions 41, 42, 44, 45 using the following rank functions: - Rank function 1: RF for loc. 27: -1-2*i11_0 RF for loc. 41: -2*i11_0 Bound for (chained) transitions 41, 42: -99 - Rank function 2: RF for loc. 27: 0 RF for loc. 41: 1 Bound for (chained) transitions 44: 1 Bound for (chained) transitions 45: 1 * Removed transitions 32, 34, 35, 51 using the following rank functions: - Rank function 1: RF for loc. 26: -1-2*i_0 RF for loc. 37: -2*i_0 Bound for (chained) transitions 32, 51: -99 - Rank function 2: RF for loc. 26: 0 RF for loc. 37: 1 Bound for (chained) transitions 34: 1 Bound for (chained) transitions 35: 1 * Removed transitions 22, 24, 25, 61 using the following rank functions: - Rank function 1: RF for loc. 22: -1-2*i9_0 RF for loc. 33: -2*i9_0 Bound for (chained) transitions 22, 61: -99 - Rank function 2: RF for loc. 22: -1 RF for loc. 33: 0 Bound for (chained) transitions 24: 0 Bound for (chained) transitions 25: 0 * Removed transitions 13, 15, 16, 71 using the following rank functions: - Rank function 1: RF for loc. 18: -1-2*i7_0 RF for loc. 29: -2*i7_0 Bound for (chained) transitions 13, 71: -99 - Rank function 2: RF for loc. 18: -1 RF for loc. 29: 0 Bound for (chained) transitions 15: 0 Bound for (chained) transitions 16: 0 Errors: