YES Termination proof succeeded Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 18, 65, 67, 68 using the following rank functions: - Rank function 1: RF for loc. 19: -2*i_0+2*nodecount_0 RF for loc. 49: -2*i_0+2*nodecount_0 Bound for (chained) transitions 18, 65: 2 - Rank function 2: RF for loc. 19: -1 RF for loc. 49: 0 Bound for (chained) transitions 67: 0 - Rank function 3: RF for loc. 19: -1 RF for loc. 49: 0 Bound for (chained) transitions 68: 0 * Removed transitions 19, 21, 57, 59, 60 using the following rank functions: - Rank function 1: RF for loc. 23: -1+2*edgecount_0-2*i_0 RF for loc. 45: 2*edgecount_0-2*i_0 Bound for (chained) transitions 19, 21, 57: 1 - Rank function 2: RF for loc. 23: -1 RF for loc. 45: 0 Bound for (chained) transitions 59: 0 - Rank function 3: RF for loc. 23: -1 RF for loc. 45: 0 Bound for (chained) transitions 60: 0 * Removed transitions 22, 23, 25, 41, 43, 44, 49, 51, 52 using the following rank functions: - Rank function 1: RF for loc. 24: -7*i_0+7*nodecount_0 RF for loc. 26: -7*i_0+7*nodecount_0 RF for loc. 27: 5-7*i_0+7*nodecount_0 RF for loc. 37: 6-7*i_0+7*nodecount_0 RF for loc. 41: -7*i_0+7*nodecount_0 Bound for (chained) transitions 25: 12 - 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 23: 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 22, 41: -1 Bound for (chained) transitions 43: -2 Bound for (chained) transitions 44: -2 Bound for (chained) transitions 49: 1 Bound for (chained) transitions 51: 0 Bound for (chained) transitions 52: 0 * Removed transitions 26, 27, 28, 29, 30, 32, 33, 35, 36 using the following rank functions: - Rank function 1: 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 32: 4 - Rank function 2: 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 26: 2 Bound for (chained) transitions 27, 33: 1 Bound for (chained) transitions 28: 3 Bound for (chained) transitions 29: 3 Bound for (chained) transitions 30: 3 Bound for (chained) transitions 35: 0 Bound for (chained) transitions 36: 0 Errors: