unknown

Initial ITS

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

Chained Linear Paths

Start location: l5
Program variables: result_4^0 x_5^0
   2: l0 -> l2 : result_4^0'=result_4^post3, x_5^0'=x_5^post3, (0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ x_5^0 <= 0), cost: 1
   8: l0 -> l0 : result_4^0'=result_4^post2, x_5^0'=x_5^post2, (result_4^post1-result_4^post2 == 0 /\ 1+x_5^post1-x_5^0 == 0 /\ 1-x_5^0 <= 0 /\ -result_4^post1+result_4^0 == 0 /\ -x_5^post2+x_5^post1 == 0), cost: 1
   3: l3 -> l0 : result_4^0'=result_4^post4, x_5^0'=x_5^post4, (1-x_5^0+x_5^post4 == 0 /\ 1-x_5^0 <= 0 /\ result_4^0-result_4^post4 == 0), cost: 1
   4: l3 -> l2 : result_4^0'=result_4^post5, x_5^0'=x_5^post5, (0 == 0 /\ x_5^0 <= 0 /\ -x_5^post5+x_5^0 == 0), cost: 1
   7: l5 -> l3 : result_4^0'=result_4^post6, x_5^0'=x_5^post6, (-x_5^post6+x_5^post7 == 0 /\ result_4^post7-result_4^post6 == 0 /\ -x_5^post7+x_5^0 == 0 /\ result_4^0-result_4^post7 == 0), cost: 1

	Eliminating location l4 by chaining:

	Applied chaining

	First rule:
	l5 -> l4 : result_4^0'=result_4^post7, x_5^0'=x_5^post7, (-x_5^post7+x_5^0 == 0 /\ result_4^0-result_4^post7 == 0), cost: 1
	Second rule:
	l4 -> l3 : result_4^0'=result_4^post6, x_5^0'=x_5^post6, (result_4^0-result_4^post6 == 0 /\ -x_5^post6+x_5^0 == 0), cost: 1
	New rule:
	l5 -> l3 : result_4^0'=result_4^post6, x_5^0'=x_5^post6, (-x_5^post6+x_5^post7 == 0 /\ result_4^post7-result_4^post6 == 0 /\ -x_5^post7+x_5^0 == 0 /\ result_4^0-result_4^post7 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 5 6
	
	Eliminating location l1 by chaining:

	Applied chaining

	First rule:
	l0 -> l1 : result_4^0'=result_4^post1, x_5^0'=x_5^post1, (1+x_5^post1-x_5^0 == 0 /\ 1-x_5^0 <= 0 /\ -result_4^post1+result_4^0 == 0), cost: 1
	Second rule:
	l1 -> l0 : result_4^0'=result_4^post2, x_5^0'=x_5^post2, (-x_5^post2+x_5^0 == 0 /\ result_4^0-result_4^post2 == 0), cost: 1
	New rule:
	l0 -> l0 : result_4^0'=result_4^post2, x_5^0'=x_5^post2, (result_4^post1-result_4^post2 == 0 /\ 1+x_5^post1-x_5^0 == 0 /\ 1-x_5^0 <= 0 /\ -result_4^post1+result_4^0 == 0 /\ -x_5^post2+x_5^post1 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 0 1

Simplified Transitions

Start location: l5
Program variables: result_4^0 x_5^0
   9: l0 -> l2 : result_4^0'=result_4^post3, x_5^0 <= 0, cost: 1
  13: l0 -> l0 : x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
  10: l3 -> l0 : x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
  11: l3 -> l2 : result_4^0'=result_4^post5, x_5^0 <= 0, cost: 1
  12: l5 -> l3 : T, cost: 1

	Propagated Equalities

	Original rule:
	l0 -> l2 : result_4^0'=result_4^post3, x_5^0'=x_5^post3, (0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ x_5^0 <= 0), cost: 1
	New rule:
	l0 -> l2 : result_4^0'=result_4^post3, x_5^0'=x_5^0, (0 == 0 /\ x_5^0 <= 0), cost: 1
	
		propagated equality x_5^post3 = x_5^0
		
	Simplified Guard

	Original rule:
	l0 -> l2 : result_4^0'=result_4^post3, x_5^0'=x_5^0, (0 == 0 /\ x_5^0 <= 0), cost: 1
	New rule:
	l0 -> l2 : result_4^0'=result_4^post3, x_5^0'=x_5^0, x_5^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l0 -> l2 : result_4^0'=result_4^post3, x_5^0'=x_5^0, x_5^0 <= 0, cost: 1
	New rule:
	l0 -> l2 : result_4^0'=result_4^post3, x_5^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l0 : result_4^0'=result_4^post4, x_5^0'=x_5^post4, (1-x_5^0+x_5^post4 == 0 /\ 1-x_5^0 <= 0 /\ result_4^0-result_4^post4 == 0), cost: 1
	New rule:
	l3 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, (0 == 0 /\ 1-x_5^0 <= 0), cost: 1
	
		propagated equality x_5^post4 = -1+x_5^0
		
		propagated equality result_4^post4 = result_4^0
		
	Simplified Guard

	Original rule:
	l3 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, (0 == 0 /\ 1-x_5^0 <= 0), cost: 1
	New rule:
	l3 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l3 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
	New rule:
	l3 -> l0 : x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l2 : result_4^0'=result_4^post5, x_5^0'=x_5^post5, (0 == 0 /\ x_5^0 <= 0 /\ -x_5^post5+x_5^0 == 0), cost: 1
	New rule:
	l3 -> l2 : result_4^0'=result_4^post5, x_5^0'=x_5^0, (0 == 0 /\ x_5^0 <= 0), cost: 1
	
		propagated equality x_5^post5 = x_5^0
		
	Simplified Guard

	Original rule:
	l3 -> l2 : result_4^0'=result_4^post5, x_5^0'=x_5^0, (0 == 0 /\ x_5^0 <= 0), cost: 1
	New rule:
	l3 -> l2 : result_4^0'=result_4^post5, x_5^0'=x_5^0, x_5^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l3 -> l2 : result_4^0'=result_4^post5, x_5^0'=x_5^0, x_5^0 <= 0, cost: 1
	New rule:
	l3 -> l2 : result_4^0'=result_4^post5, x_5^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l5 -> l3 : result_4^0'=result_4^post6, x_5^0'=x_5^post6, (-x_5^post6+x_5^post7 == 0 /\ result_4^post7-result_4^post6 == 0 /\ -x_5^post7+x_5^0 == 0 /\ result_4^0-result_4^post7 == 0), cost: 1
	New rule:
	l5 -> l3 : result_4^0'=result_4^post7, x_5^0'=x_5^post7, (0 == 0 /\ -x_5^post7+x_5^0 == 0 /\ result_4^0-result_4^post7 == 0), cost: 1
	
		propagated equality x_5^post6 = x_5^post7
		
		propagated equality result_4^post6 = result_4^post7
		
	Propagated Equalities

	Original rule:
	l5 -> l3 : result_4^0'=result_4^post7, x_5^0'=x_5^post7, (0 == 0 /\ -x_5^post7+x_5^0 == 0 /\ result_4^0-result_4^post7 == 0), cost: 1
	New rule:
	l5 -> l3 : result_4^0'=result_4^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	
		propagated equality x_5^post7 = x_5^0
		
		propagated equality result_4^post7 = result_4^0
		
	Simplified Guard

	Original rule:
	l5 -> l3 : result_4^0'=result_4^0, x_5^0'=x_5^0, 0 == 0, cost: 1
	New rule:
	l5 -> l3 : result_4^0'=result_4^0, x_5^0'=x_5^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l5 -> l3 : result_4^0'=result_4^0, x_5^0'=x_5^0, T, cost: 1
	New rule:
	l5 -> l3 : T, cost: 1
	
	Propagated Equalities

	Original rule:
	l0 -> l0 : result_4^0'=result_4^post2, x_5^0'=x_5^post2, (result_4^post1-result_4^post2 == 0 /\ 1+x_5^post1-x_5^0 == 0 /\ 1-x_5^0 <= 0 /\ -result_4^post1+result_4^0 == 0 /\ -x_5^post2+x_5^post1 == 0), cost: 1
	New rule:
	l0 -> l0 : result_4^0'=result_4^post1, x_5^0'=x_5^post1, (0 == 0 /\ 1+x_5^post1-x_5^0 == 0 /\ 1-x_5^0 <= 0 /\ -result_4^post1+result_4^0 == 0), cost: 1
	
		propagated equality result_4^post2 = result_4^post1
		
		propagated equality x_5^post2 = x_5^post1
		
	Propagated Equalities

	Original rule:
	l0 -> l0 : result_4^0'=result_4^post1, x_5^0'=x_5^post1, (0 == 0 /\ 1+x_5^post1-x_5^0 == 0 /\ 1-x_5^0 <= 0 /\ -result_4^post1+result_4^0 == 0), cost: 1
	New rule:
	l0 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, (0 == 0 /\ 1-x_5^0 <= 0), cost: 1
	
		propagated equality x_5^post1 = -1+x_5^0
		
		propagated equality result_4^post1 = result_4^0
		
	Simplified Guard

	Original rule:
	l0 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, (0 == 0 /\ 1-x_5^0 <= 0), cost: 1
	New rule:
	l0 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l0 -> l0 : result_4^0'=result_4^0, x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
	New rule:
	l0 -> l0 : x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1

Step with 12

	Trace

	12[T]
	
	Blocked

	[{}, {}]

Step with 10

	Trace

	12[T], 10[(1-x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {}]

Step with 9

	Trace

	12[T], 10[(1-x_5^0 <= 0)], 9[(x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {}, {}]

Backtrack

	Trace

	12[T], 10[(1-x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {9[T]}]

Step with 13

	Trace

	12[T], 10[(1-x_5^0 <= 0)], 13[(1-x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {9[T]}, {}]

Accelerate

Start location: l5
Program variables: result_4^0 x_5^0
   9: l0 -> l2 : result_4^0'=result_4^post3, x_5^0 <= 0, cost: 1
  13: l0 -> l0 : x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
  14: l0 -> l0 : x_5^0'=x_5^0-n, (-1+n >= 0 /\ x_5^0-n >= 0), cost: 1
  10: l3 -> l0 : x_5^0'=-1+x_5^0, 1-x_5^0 <= 0, cost: 1
  11: l3 -> l2 : result_4^0'=result_4^post5, x_5^0 <= 0, cost: 1
  12: l5 -> l3 : T, cost: 1

	Loop Acceleration

	Original rule:
	l0 -> l0 : x_5^0'=-1+x_5^0, (1-x_5^0 <= 0), cost: 1
	New rule:
	l0 -> l0 : x_5^0'=x_5^0-n, (-1+n >= 0 /\ x_5^0-n >= 0), cost: 1

		-1+x_5^0 >= 0 [0]: montonic decrease yields x_5^0-n >= 0
		
		-1+x_5^0 >= 0 [1]: eventual increase yields (1 <= 0 /\ -1+x_5^0 >= 0)
		
		Replacement map: {-1+x_5^0 >= 0 -> x_5^0-n >= 0}

	Trace

	12[T], 10[(1-x_5^0 <= 0)], 14[(-1+n >= 0 /\ x_5^0-n >= 0)]
	
	Blocked

	[{}, {}, {9[T]}, {13[T], 14[T]}]

Step with 9

	Trace

	12[T], 10[(1-x_5^0 <= 0)], 14[(-1+n >= 0 /\ x_5^0-n >= 0)], 9[(x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {9[T]}, {13[T], 14[T]}, {}]

Backtrack

	Trace

	12[T], 10[(1-x_5^0 <= 0)], 14[(-1+n >= 0 /\ x_5^0-n >= 0)]
	
	Blocked

	[{}, {}, {9[T]}, {9[T], 13[T], 14[T]}]

Backtrack

	Trace

	12[T], 10[(1-x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {9[T], 14[T]}]

Step with 13

	Trace

	12[T], 10[(1-x_5^0 <= 0)], 13[(1-x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {9[T], 14[T]}, {}]

Covered

	Trace

	12[T], 10[(1-x_5^0 <= 0)]
	
	Blocked

	[{}, {}, {9[T], 13[T], 14[T]}]

Backtrack

	Trace

	12[T]
	
	Blocked

	[{}, {10[T]}]

Step with 11

	Trace

	12[T], 11[(x_5^0 <= 0)]
	
	Blocked

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

Backtrack

	Trace

	12[T]
	
	Blocked

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

Backtrack

	Trace

	Blocked

	[{12[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b