NO

Initial ITS

Start location: l6
Program variables: __cil_tmp2_6^0 __cil_tmp6_12^0 maxretries_9^0 result_4^0 retrycount_10^0 selected_11^0 x_5^0
   0: l0 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post1, __cil_tmp6_12^0'=__cil_tmp6_12^post1, maxretries_9^0'=maxretries_9^post1, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^post1, selected_11^0'=selected_11^post1, x_5^0'=x_5^post1, (0 == 0 /\ result_4^1-__cil_tmp2_6^post1 == 0 /\ retrycount_10^0-retrycount_10^post1 == 0 /\ -__cil_tmp6_12^post1+__cil_tmp6_12^0 == 0 /\ __cil_tmp2_6^post1-x_5^0 == 0 /\ -x_5^post1+x_5^0 == 0 /\ selected_11^post1-result_4^1 == 0 /\ -maxretries_9^post1+maxretries_9^0 == 0), cost: 1
   4: l1 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post5, __cil_tmp6_12^0'=__cil_tmp6_12^post5, maxretries_9^0'=maxretries_9^post5, result_4^0'=result_4^post5, retrycount_10^0'=retrycount_10^post5, selected_11^0'=selected_11^post5, x_5^0'=x_5^post5, (-1-retrycount_10^0+retrycount_10^post5 == 0 /\ -x_5^post5+x_5^0 == 0 /\ -__cil_tmp2_6^post5+__cil_tmp2_6^0 == 0 /\ maxretries_9^0-maxretries_9^post5 == 0 /\ selected_11^0-selected_11^post5 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post5 == 0 /\ -result_4^post5+result_4^0 == 0), cost: 1
   1: l2 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post2, __cil_tmp6_12^0'=__cil_tmp6_12^post2, maxretries_9^0'=maxretries_9^post2, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^post2, selected_11^0'=selected_11^post2, x_5^0'=x_5^post2, (0 == 0 /\ __cil_tmp2_6^post2-x_5^0 == 0 /\ -retrycount_10^post2+retrycount_10^0 == 0 /\ -x_5^post2+x_5^0 == 0 /\ -__cil_tmp6_12^post2+__cil_tmp6_12^0 == 0 /\ -maxretries_9^post2+maxretries_9^0 == 0 /\ result_4^1-__cil_tmp2_6^post2 == 0 /\ -result_4^1+selected_11^post2 == 0), cost: 1
   2: l3 -> l4 : __cil_tmp2_6^0'=__cil_tmp2_6^post3, __cil_tmp6_12^0'=__cil_tmp6_12^post3, maxretries_9^0'=maxretries_9^post3, result_4^0'=result_4^post3, retrycount_10^0'=retrycount_10^post3, selected_11^0'=selected_11^post3, x_5^0'=x_5^post3, (-retrycount_10^post3+retrycount_10^0 == 0 /\ -__cil_tmp6_12^post3+result_4^post3 == 0 /\ -maxretries_9^post3+maxretries_9^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post3 == 0 /\ -selected_11^0+__cil_tmp6_12^post3 == 0 /\ selected_11^0-selected_11^post3 == 0 /\ -x_5^post3+x_5^0 == 0), cost: 1
   3: l3 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post4, __cil_tmp6_12^0'=__cil_tmp6_12^post4, maxretries_9^0'=maxretries_9^post4, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^post4, selected_11^0'=selected_11^post4, x_5^0'=x_5^post4, (0 == 0 /\ -x_5^post4+x_5^0 == 0 /\ -result_4^1+selected_11^post4 == 0 /\ -maxretries_9^post4+maxretries_9^0 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post4 == 0 /\ -retrycount_10^post4+retrycount_10^0 == 0 /\ -__cil_tmp2_6^post4+result_4^1 == 0 /\ __cil_tmp2_6^post4-x_5^0 == 0), cost: 1
   5: l5 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, maxretries_9^0'=maxretries_9^post6, result_4^0'=result_4^post6, retrycount_10^0'=retrycount_10^post6, selected_11^0'=selected_11^post6, x_5^0'=x_5^post6, (__cil_tmp6_12^0-__cil_tmp6_12^post6 == 0 /\ result_4^0-result_4^post6 == 0 /\ selected_11^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^0 == 0 /\ retrycount_10^post6 == 0 /\ -4+maxretries_9^post6 == 0), cost: 1
   6: l6 -> l5 : __cil_tmp2_6^0'=__cil_tmp2_6^post7, __cil_tmp6_12^0'=__cil_tmp6_12^post7, maxretries_9^0'=maxretries_9^post7, result_4^0'=result_4^post7, retrycount_10^0'=retrycount_10^post7, selected_11^0'=selected_11^post7, x_5^0'=x_5^post7, (result_4^0-result_4^post7 == 0 /\ selected_11^0-selected_11^post7 == 0 /\ -x_5^post7+x_5^0 == 0 /\ -__cil_tmp6_12^post7+__cil_tmp6_12^0 == 0 /\ -__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -maxretries_9^post7+maxretries_9^0 == 0 /\ -retrycount_10^post7+retrycount_10^0 == 0), cost: 1

Chained Linear Paths

Start location: l6
Program variables: __cil_tmp2_6^0 __cil_tmp6_12^0 maxretries_9^0 result_4^0 retrycount_10^0 selected_11^0 x_5^0
   0: l0 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post1, __cil_tmp6_12^0'=__cil_tmp6_12^post1, maxretries_9^0'=maxretries_9^post1, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^post1, selected_11^0'=selected_11^post1, x_5^0'=x_5^post1, (0 == 0 /\ result_4^1-__cil_tmp2_6^post1 == 0 /\ retrycount_10^0-retrycount_10^post1 == 0 /\ -__cil_tmp6_12^post1+__cil_tmp6_12^0 == 0 /\ __cil_tmp2_6^post1-x_5^0 == 0 /\ -x_5^post1+x_5^0 == 0 /\ selected_11^post1-result_4^1 == 0 /\ -maxretries_9^post1+maxretries_9^0 == 0), cost: 1
   4: l1 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post5, __cil_tmp6_12^0'=__cil_tmp6_12^post5, maxretries_9^0'=maxretries_9^post5, result_4^0'=result_4^post5, retrycount_10^0'=retrycount_10^post5, selected_11^0'=selected_11^post5, x_5^0'=x_5^post5, (-1-retrycount_10^0+retrycount_10^post5 == 0 /\ -x_5^post5+x_5^0 == 0 /\ -__cil_tmp2_6^post5+__cil_tmp2_6^0 == 0 /\ maxretries_9^0-maxretries_9^post5 == 0 /\ selected_11^0-selected_11^post5 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post5 == 0 /\ -result_4^post5+result_4^0 == 0), cost: 1
   1: l2 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post2, __cil_tmp6_12^0'=__cil_tmp6_12^post2, maxretries_9^0'=maxretries_9^post2, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^post2, selected_11^0'=selected_11^post2, x_5^0'=x_5^post2, (0 == 0 /\ __cil_tmp2_6^post2-x_5^0 == 0 /\ -retrycount_10^post2+retrycount_10^0 == 0 /\ -x_5^post2+x_5^0 == 0 /\ -__cil_tmp6_12^post2+__cil_tmp6_12^0 == 0 /\ -maxretries_9^post2+maxretries_9^0 == 0 /\ result_4^1-__cil_tmp2_6^post2 == 0 /\ -result_4^1+selected_11^post2 == 0), cost: 1
   2: l3 -> l4 : __cil_tmp2_6^0'=__cil_tmp2_6^post3, __cil_tmp6_12^0'=__cil_tmp6_12^post3, maxretries_9^0'=maxretries_9^post3, result_4^0'=result_4^post3, retrycount_10^0'=retrycount_10^post3, selected_11^0'=selected_11^post3, x_5^0'=x_5^post3, (-retrycount_10^post3+retrycount_10^0 == 0 /\ -__cil_tmp6_12^post3+result_4^post3 == 0 /\ -maxretries_9^post3+maxretries_9^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post3 == 0 /\ -selected_11^0+__cil_tmp6_12^post3 == 0 /\ selected_11^0-selected_11^post3 == 0 /\ -x_5^post3+x_5^0 == 0), cost: 1
   3: l3 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post4, __cil_tmp6_12^0'=__cil_tmp6_12^post4, maxretries_9^0'=maxretries_9^post4, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^post4, selected_11^0'=selected_11^post4, x_5^0'=x_5^post4, (0 == 0 /\ -x_5^post4+x_5^0 == 0 /\ -result_4^1+selected_11^post4 == 0 /\ -maxretries_9^post4+maxretries_9^0 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post4 == 0 /\ -retrycount_10^post4+retrycount_10^0 == 0 /\ -__cil_tmp2_6^post4+result_4^1 == 0 /\ __cil_tmp2_6^post4-x_5^0 == 0), cost: 1
   7: l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, maxretries_9^0'=maxretries_9^post6, result_4^0'=result_4^post6, retrycount_10^0'=retrycount_10^post6, selected_11^0'=selected_11^post6, x_5^0'=x_5^post6, (result_4^0-result_4^post7 == 0 /\ selected_11^post6 == 0 /\ selected_11^0-selected_11^post7 == 0 /\ -result_4^post6+result_4^post7 == 0 /\ -x_5^post7+x_5^0 == 0 /\ -__cil_tmp6_12^post7+__cil_tmp6_12^0 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^post7 == 0 /\ -__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -x_5^post6+x_5^post7 == 0 /\ -maxretries_9^post7+maxretries_9^0 == 0 /\ retrycount_10^post6 == 0 /\ -retrycount_10^post7+retrycount_10^0 == 0 /\ __cil_tmp6_12^post7-__cil_tmp6_12^post6 == 0 /\ -4+maxretries_9^post6 == 0), cost: 1

	Eliminating location l5 by chaining:

	Applied chaining

	First rule:
	l6 -> l5 : __cil_tmp2_6^0'=__cil_tmp2_6^post7, __cil_tmp6_12^0'=__cil_tmp6_12^post7, maxretries_9^0'=maxretries_9^post7, result_4^0'=result_4^post7, retrycount_10^0'=retrycount_10^post7, selected_11^0'=selected_11^post7, x_5^0'=x_5^post7, (result_4^0-result_4^post7 == 0 /\ selected_11^0-selected_11^post7 == 0 /\ -x_5^post7+x_5^0 == 0 /\ -__cil_tmp6_12^post7+__cil_tmp6_12^0 == 0 /\ -__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -maxretries_9^post7+maxretries_9^0 == 0 /\ -retrycount_10^post7+retrycount_10^0 == 0), cost: 1
	Second rule:
	l5 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, maxretries_9^0'=maxretries_9^post6, result_4^0'=result_4^post6, retrycount_10^0'=retrycount_10^post6, selected_11^0'=selected_11^post6, x_5^0'=x_5^post6, (__cil_tmp6_12^0-__cil_tmp6_12^post6 == 0 /\ result_4^0-result_4^post6 == 0 /\ selected_11^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^0 == 0 /\ retrycount_10^post6 == 0 /\ -4+maxretries_9^post6 == 0), cost: 1
	New rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, maxretries_9^0'=maxretries_9^post6, result_4^0'=result_4^post6, retrycount_10^0'=retrycount_10^post6, selected_11^0'=selected_11^post6, x_5^0'=x_5^post6, (result_4^0-result_4^post7 == 0 /\ selected_11^post6 == 0 /\ selected_11^0-selected_11^post7 == 0 /\ -result_4^post6+result_4^post7 == 0 /\ -x_5^post7+x_5^0 == 0 /\ -__cil_tmp6_12^post7+__cil_tmp6_12^0 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^post7 == 0 /\ -__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -x_5^post6+x_5^post7 == 0 /\ -maxretries_9^post7+maxretries_9^0 == 0 /\ retrycount_10^post6 == 0 /\ -retrycount_10^post7+retrycount_10^0 == 0 /\ __cil_tmp6_12^post7-__cil_tmp6_12^post6 == 0 /\ -4+maxretries_9^post6 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 5 6

Simplified Transitions

Start location: l6
Program variables: __cil_tmp2_6^0 __cil_tmp6_12^0 maxretries_9^0 result_4^0 retrycount_10^0 selected_11^0 x_5^0
   8: l0 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post1, selected_11^0'=x_5^0, T, cost: 1
  12: l1 -> l3 : retrycount_10^0'=1+retrycount_10^0, T, cost: 1
   9: l2 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post2, selected_11^0'=x_5^0, T, cost: 1
  10: l3 -> l4 : __cil_tmp6_12^0'=selected_11^0, result_4^0'=selected_11^0, T, cost: 1
  11: l3 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post4, selected_11^0'=x_5^0, T, cost: 1
  13: l6 -> l3 : maxretries_9^0'=4, retrycount_10^0'=0, selected_11^0'=0, T, cost: 1

	Propagated Equalities

	Original rule:
	l0 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post1, __cil_tmp6_12^0'=__cil_tmp6_12^post1, maxretries_9^0'=maxretries_9^post1, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^post1, selected_11^0'=selected_11^post1, x_5^0'=x_5^post1, (0 == 0 /\ result_4^1-__cil_tmp2_6^post1 == 0 /\ retrycount_10^0-retrycount_10^post1 == 0 /\ -__cil_tmp6_12^post1+__cil_tmp6_12^0 == 0 /\ __cil_tmp2_6^post1-x_5^0 == 0 /\ -x_5^post1+x_5^0 == 0 /\ selected_11^post1-result_4^1 == 0 /\ -maxretries_9^post1+maxretries_9^0 == 0), cost: 1
	New rule:
	l0 -> l1 : __cil_tmp2_6^0'=result_4^1, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^0, selected_11^0'=result_4^1, x_5^0'=x_5^0, (0 == 0 /\ result_4^1-x_5^0 == 0), cost: 1
	
		propagated equality __cil_tmp2_6^post1 = result_4^1
		
		propagated equality retrycount_10^post1 = retrycount_10^0
		
		propagated equality __cil_tmp6_12^post1 = __cil_tmp6_12^0
		
		propagated equality x_5^post1 = x_5^0
		
		propagated equality selected_11^post1 = result_4^1
		
		propagated equality maxretries_9^post1 = maxretries_9^0
		
	Propagated Equalities

	Original rule:
	l0 -> l1 : __cil_tmp2_6^0'=result_4^1, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^0, selected_11^0'=result_4^1, x_5^0'=x_5^0, (0 == 0 /\ result_4^1-x_5^0 == 0), cost: 1
	New rule:
	l0 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	
		propagated equality result_4^1 = x_5^0
		
	Simplified Guard

	Original rule:
	l0 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	New rule:
	l0 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l0 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post1, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, T, cost: 1
	New rule:
	l0 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post1, selected_11^0'=x_5^0, T, cost: 1
	
	Propagated Equalities

	Original rule:
	l2 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post2, __cil_tmp6_12^0'=__cil_tmp6_12^post2, maxretries_9^0'=maxretries_9^post2, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^post2, selected_11^0'=selected_11^post2, x_5^0'=x_5^post2, (0 == 0 /\ __cil_tmp2_6^post2-x_5^0 == 0 /\ -retrycount_10^post2+retrycount_10^0 == 0 /\ -x_5^post2+x_5^0 == 0 /\ -__cil_tmp6_12^post2+__cil_tmp6_12^0 == 0 /\ -maxretries_9^post2+maxretries_9^0 == 0 /\ result_4^1-__cil_tmp2_6^post2 == 0 /\ -result_4^1+selected_11^post2 == 0), cost: 1
	New rule:
	l2 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^0, selected_11^0'=result_4^1, x_5^0'=x_5^0, (0 == 0 /\ result_4^1-x_5^0 == 0), cost: 1
	
		propagated equality __cil_tmp2_6^post2 = x_5^0
		
		propagated equality retrycount_10^post2 = retrycount_10^0
		
		propagated equality x_5^post2 = x_5^0
		
		propagated equality __cil_tmp6_12^post2 = __cil_tmp6_12^0
		
		propagated equality maxretries_9^post2 = maxretries_9^0
		
		propagated equality selected_11^post2 = result_4^1
		
	Propagated Equalities

	Original rule:
	l2 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^0, selected_11^0'=result_4^1, x_5^0'=x_5^0, (0 == 0 /\ result_4^1-x_5^0 == 0), cost: 1
	New rule:
	l2 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	
		propagated equality result_4^1 = x_5^0
		
	Simplified Guard

	Original rule:
	l2 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	New rule:
	l2 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l2 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post2, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, T, cost: 1
	New rule:
	l2 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post2, selected_11^0'=x_5^0, T, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l4 : __cil_tmp2_6^0'=__cil_tmp2_6^post3, __cil_tmp6_12^0'=__cil_tmp6_12^post3, maxretries_9^0'=maxretries_9^post3, result_4^0'=result_4^post3, retrycount_10^0'=retrycount_10^post3, selected_11^0'=selected_11^post3, x_5^0'=x_5^post3, (-retrycount_10^post3+retrycount_10^0 == 0 /\ -__cil_tmp6_12^post3+result_4^post3 == 0 /\ -maxretries_9^post3+maxretries_9^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post3 == 0 /\ -selected_11^0+__cil_tmp6_12^post3 == 0 /\ selected_11^0-selected_11^post3 == 0 /\ -x_5^post3+x_5^0 == 0), cost: 1
	New rule:
	l3 -> l4 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=selected_11^0, maxretries_9^0'=maxretries_9^0, result_4^0'=selected_11^0, retrycount_10^0'=retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	
		propagated equality retrycount_10^post3 = retrycount_10^0
		
		propagated equality __cil_tmp6_12^post3 = result_4^post3
		
		propagated equality maxretries_9^post3 = maxretries_9^0
		
		propagated equality __cil_tmp2_6^post3 = __cil_tmp2_6^0
		
		propagated equality result_4^post3 = selected_11^0
		
		propagated equality selected_11^post3 = selected_11^0
		
		propagated equality x_5^post3 = x_5^0
		
	Simplified Guard

	Original rule:
	l3 -> l4 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=selected_11^0, maxretries_9^0'=maxretries_9^0, result_4^0'=selected_11^0, retrycount_10^0'=retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	New rule:
	l3 -> l4 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=selected_11^0, maxretries_9^0'=maxretries_9^0, result_4^0'=selected_11^0, retrycount_10^0'=retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l3 -> l4 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=selected_11^0, maxretries_9^0'=maxretries_9^0, result_4^0'=selected_11^0, retrycount_10^0'=retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, T, cost: 1
	New rule:
	l3 -> l4 : __cil_tmp6_12^0'=selected_11^0, result_4^0'=selected_11^0, T, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l1 : __cil_tmp2_6^0'=__cil_tmp2_6^post4, __cil_tmp6_12^0'=__cil_tmp6_12^post4, maxretries_9^0'=maxretries_9^post4, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^post4, selected_11^0'=selected_11^post4, x_5^0'=x_5^post4, (0 == 0 /\ -x_5^post4+x_5^0 == 0 /\ -result_4^1+selected_11^post4 == 0 /\ -maxretries_9^post4+maxretries_9^0 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post4 == 0 /\ -retrycount_10^post4+retrycount_10^0 == 0 /\ -__cil_tmp2_6^post4+result_4^1 == 0 /\ __cil_tmp2_6^post4-x_5^0 == 0), cost: 1
	New rule:
	l3 -> l1 : __cil_tmp2_6^0'=result_4^1, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^0, selected_11^0'=result_4^1, x_5^0'=x_5^0, (0 == 0 /\ result_4^1-x_5^0 == 0), cost: 1
	
		propagated equality x_5^post4 = x_5^0
		
		propagated equality selected_11^post4 = result_4^1
		
		propagated equality maxretries_9^post4 = maxretries_9^0
		
		propagated equality __cil_tmp6_12^post4 = __cil_tmp6_12^0
		
		propagated equality retrycount_10^post4 = retrycount_10^0
		
		propagated equality __cil_tmp2_6^post4 = result_4^1
		
	Propagated Equalities

	Original rule:
	l3 -> l1 : __cil_tmp2_6^0'=result_4^1, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^0, selected_11^0'=result_4^1, x_5^0'=x_5^0, (0 == 0 /\ result_4^1-x_5^0 == 0), cost: 1
	New rule:
	l3 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	
		propagated equality result_4^1 = x_5^0
		
	Simplified Guard

	Original rule:
	l3 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	New rule:
	l3 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l3 -> l1 : __cil_tmp2_6^0'=x_5^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^post4, retrycount_10^0'=retrycount_10^0, selected_11^0'=x_5^0, x_5^0'=x_5^0, T, cost: 1
	New rule:
	l3 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post4, selected_11^0'=x_5^0, T, cost: 1
	
	Propagated Equalities

	Original rule:
	l1 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post5, __cil_tmp6_12^0'=__cil_tmp6_12^post5, maxretries_9^0'=maxretries_9^post5, result_4^0'=result_4^post5, retrycount_10^0'=retrycount_10^post5, selected_11^0'=selected_11^post5, x_5^0'=x_5^post5, (-1-retrycount_10^0+retrycount_10^post5 == 0 /\ -x_5^post5+x_5^0 == 0 /\ -__cil_tmp2_6^post5+__cil_tmp2_6^0 == 0 /\ maxretries_9^0-maxretries_9^post5 == 0 /\ selected_11^0-selected_11^post5 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post5 == 0 /\ -result_4^post5+result_4^0 == 0), cost: 1
	New rule:
	l1 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^0, retrycount_10^0'=1+retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	
		propagated equality retrycount_10^post5 = 1+retrycount_10^0
		
		propagated equality x_5^post5 = x_5^0
		
		propagated equality __cil_tmp2_6^post5 = __cil_tmp2_6^0
		
		propagated equality maxretries_9^post5 = maxretries_9^0
		
		propagated equality selected_11^post5 = selected_11^0
		
		propagated equality __cil_tmp6_12^post5 = __cil_tmp6_12^0
		
		propagated equality result_4^post5 = result_4^0
		
	Simplified Guard

	Original rule:
	l1 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^0, retrycount_10^0'=1+retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	New rule:
	l1 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^0, retrycount_10^0'=1+retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l1 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=maxretries_9^0, result_4^0'=result_4^0, retrycount_10^0'=1+retrycount_10^0, selected_11^0'=selected_11^0, x_5^0'=x_5^0, T, cost: 1
	New rule:
	l1 -> l3 : retrycount_10^0'=1+retrycount_10^0, T, cost: 1
	
	Propagated Equalities

	Original rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, maxretries_9^0'=maxretries_9^post6, result_4^0'=result_4^post6, retrycount_10^0'=retrycount_10^post6, selected_11^0'=selected_11^post6, x_5^0'=x_5^post6, (result_4^0-result_4^post7 == 0 /\ selected_11^post6 == 0 /\ selected_11^0-selected_11^post7 == 0 /\ -result_4^post6+result_4^post7 == 0 /\ -x_5^post7+x_5^0 == 0 /\ -__cil_tmp6_12^post7+__cil_tmp6_12^0 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^post7 == 0 /\ -__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -x_5^post6+x_5^post7 == 0 /\ -maxretries_9^post7+maxretries_9^0 == 0 /\ retrycount_10^post6 == 0 /\ -retrycount_10^post7+retrycount_10^0 == 0 /\ __cil_tmp6_12^post7-__cil_tmp6_12^post6 == 0 /\ -4+maxretries_9^post6 == 0), cost: 1
	New rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post7, __cil_tmp6_12^0'=__cil_tmp6_12^post7, maxretries_9^0'=4, result_4^0'=result_4^post7, retrycount_10^0'=0, selected_11^0'=0, x_5^0'=x_5^post7, (0 == 0 /\ result_4^0-result_4^post7 == 0 /\ selected_11^0-selected_11^post7 == 0 /\ -x_5^post7+x_5^0 == 0 /\ -__cil_tmp6_12^post7+__cil_tmp6_12^0 == 0 /\ -__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -maxretries_9^post7+maxretries_9^0 == 0 /\ -retrycount_10^post7+retrycount_10^0 == 0), cost: 1
	
		propagated equality selected_11^post6 = 0
		
		propagated equality result_4^post6 = result_4^post7
		
		propagated equality __cil_tmp2_6^post6 = __cil_tmp2_6^post7
		
		propagated equality x_5^post6 = x_5^post7
		
		propagated equality retrycount_10^post6 = 0
		
		propagated equality __cil_tmp6_12^post6 = __cil_tmp6_12^post7
		
		propagated equality maxretries_9^post6 = 4
		
	Propagated Equalities

	Original rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^post7, __cil_tmp6_12^0'=__cil_tmp6_12^post7, maxretries_9^0'=4, result_4^0'=result_4^post7, retrycount_10^0'=0, selected_11^0'=0, x_5^0'=x_5^post7, (0 == 0 /\ result_4^0-result_4^post7 == 0 /\ selected_11^0-selected_11^post7 == 0 /\ -x_5^post7+x_5^0 == 0 /\ -__cil_tmp6_12^post7+__cil_tmp6_12^0 == 0 /\ -__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -maxretries_9^post7+maxretries_9^0 == 0 /\ -retrycount_10^post7+retrycount_10^0 == 0), cost: 1
	New rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=4, result_4^0'=result_4^0, retrycount_10^0'=0, selected_11^0'=0, x_5^0'=x_5^0, 0 == 0, cost: 1
	
		propagated equality result_4^post7 = result_4^0
		
		propagated equality selected_11^post7 = selected_11^0
		
		propagated equality x_5^post7 = x_5^0
		
		propagated equality __cil_tmp6_12^post7 = __cil_tmp6_12^0
		
		propagated equality __cil_tmp2_6^post7 = __cil_tmp2_6^0
		
		propagated equality maxretries_9^post7 = maxretries_9^0
		
		propagated equality retrycount_10^post7 = retrycount_10^0
		
	Simplified Guard

	Original rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=4, result_4^0'=result_4^0, retrycount_10^0'=0, selected_11^0'=0, x_5^0'=x_5^0, 0 == 0, cost: 1
	New rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=4, result_4^0'=result_4^0, retrycount_10^0'=0, selected_11^0'=0, x_5^0'=x_5^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l6 -> l3 : __cil_tmp2_6^0'=__cil_tmp2_6^0, __cil_tmp6_12^0'=__cil_tmp6_12^0, maxretries_9^0'=4, result_4^0'=result_4^0, retrycount_10^0'=0, selected_11^0'=0, x_5^0'=x_5^0, T, cost: 1
	New rule:
	l6 -> l3 : maxretries_9^0'=4, retrycount_10^0'=0, selected_11^0'=0, T, cost: 1

Step with 13

	Trace

	13[T]
	
	Blocked

	[{}, {}]

Step with 10

	Trace

	13[T], 10[T]
	
	Blocked

	[{}, {}, {}]

Backtrack

	Trace

	13[T]
	
	Blocked

	[{}, {10[T]}]

Step with 11

	Trace

	13[T], 11[T]
	
	Blocked

	[{}, {10[T]}, {}]

Step with 12

	Trace

	13[T], 11[T], 12[T]
	
	Blocked

	[{}, {10[T]}, {}, {}]

Nonterm

Start location: l6
Program variables: __cil_tmp2_6^0 __cil_tmp6_12^0 maxretries_9^0 result_4^0 retrycount_10^0 selected_11^0 x_5^0
   8: l0 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post1, selected_11^0'=x_5^0, T, cost: 1
  12: l1 -> l3 : retrycount_10^0'=1+retrycount_10^0, T, cost: 1
   9: l2 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post2, selected_11^0'=x_5^0, T, cost: 1
  10: l3 -> l4 : __cil_tmp6_12^0'=selected_11^0, result_4^0'=selected_11^0, T, cost: 1
  11: l3 -> l1 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post4, selected_11^0'=x_5^0, T, cost: 1
  14: l3 -> LoAT_sink : -1+n >= 0, cost: NONTERM
  15: l3 -> l3 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post41, retrycount_10^0'=retrycount_10^0+n, selected_11^0'=x_5^0, -1+n >= 0, cost: 1
  13: l6 -> l3 : maxretries_9^0'=4, retrycount_10^0'=0, selected_11^0'=0, T, cost: 1

	Certificate of Non-Termination

	Original rule:
	l3 -> l3 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post41, retrycount_10^0'=1+retrycount_10^0, selected_11^0'=x_5^0, T, cost: 1
	New rule:
	l3 -> LoAT_sink : -1+n >= 0, cost: NONTERM

		Replacement map: {}

	Loop Acceleration

	Original rule:
	l3 -> l3 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post41, retrycount_10^0'=1+retrycount_10^0, selected_11^0'=x_5^0, T, cost: 1
	New rule:
	l3 -> l3 : __cil_tmp2_6^0'=x_5^0, result_4^0'=result_4^post41, retrycount_10^0'=retrycount_10^0+n, selected_11^0'=x_5^0, -1+n >= 0, cost: 1

		Replacement map: {}

Step with 14

	Trace

	13[T], 14[-1+n >= 0]
	
	Blocked

	[{}, {10[T]}, {14[T]}]

Refute

	Counterexample

	[ __cil_tmp2_6^0=0 __cil_tmp6_12^0=0 maxretries_9^0=4 result_4^0=0 retrycount_10^0=0 selected_11^0=0 x_5^0=0 ] 13 [ __cil_tmp2_6^0=0 __cil_tmp6_12^0=0 maxretries_9^0=maxretries_9^0 result_4^0=0 retrycount_10^0=retrycount_10^0 selected_11^0=selected_11^0 x_5^0=0 ] 14
	
NO

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b