unknown

Initial ITS

Start location: l4
Program variables: rt_11^0 st_14^0 x_13^0 y_15^0
   0: l0 -> l1 : rt_11^0'=rt_11^post1, st_14^0'=st_14^post1, x_13^0'=x_13^post1, y_15^0'=y_15^post1, (-y_15^post1+y_15^0 == 0 /\ -rt_11^post1+rt_11^0 == 0 /\ -x_13^post1+x_13^0 == 0 /\ st_14^0-st_14^post1 == 0), cost: 1
   1: l1 -> l2 : rt_11^0'=rt_11^post2, st_14^0'=st_14^post2, x_13^0'=x_13^post2, y_15^0'=y_15^post2, (y_15^0-y_15^post2 == 0 /\ -x_13^post2+x_13^0 == 0 /\ -st_14^0+rt_11^post2 == 0 /\ -st_14^post2+st_14^0 == 0 /\ x_13^0 <= 0), cost: 1
   2: l1 -> l3 : rt_11^0'=rt_11^post3, st_14^0'=st_14^post3, x_13^0'=x_13^post3, y_15^0'=y_15^post3, (-rt_11^post3+rt_11^0 == 0 /\ 1-y_15^0+y_15^post3 == 0 /\ 1-x_13^0 <= 0 /\ -y_15^0+x_13^post3-x_13^0 == 0 /\ st_14^0-st_14^post3 == 0), cost: 1
   3: l3 -> l1 : rt_11^0'=rt_11^post4, st_14^0'=st_14^post4, x_13^0'=x_13^post4, y_15^0'=y_15^post4, (-rt_11^post4+rt_11^0 == 0 /\ st_14^0-st_14^post4 == 0 /\ -x_13^post4+x_13^0 == 0 /\ -y_15^post4+y_15^0 == 0), cost: 1
   4: l4 -> l0 : rt_11^0'=rt_11^post5, st_14^0'=st_14^post5, x_13^0'=x_13^post5, y_15^0'=y_15^post5, (-x_13^post5+x_13^0 == 0 /\ -rt_11^post5+rt_11^0 == 0 /\ -y_15^post5+y_15^0 == 0 /\ st_14^0-st_14^post5 == 0), cost: 1

Chained Linear Paths

Start location: l4
Program variables: rt_11^0 st_14^0 x_13^0 y_15^0
   1: l1 -> l2 : rt_11^0'=rt_11^post2, st_14^0'=st_14^post2, x_13^0'=x_13^post2, y_15^0'=y_15^post2, (y_15^0-y_15^post2 == 0 /\ -x_13^post2+x_13^0 == 0 /\ -st_14^0+rt_11^post2 == 0 /\ -st_14^post2+st_14^0 == 0 /\ x_13^0 <= 0), cost: 1
   6: l1 -> l1 : rt_11^0'=rt_11^post4, st_14^0'=st_14^post4, x_13^0'=x_13^post4, y_15^0'=y_15^post4, (-y_15^post4+y_15^post3 == 0 /\ st_14^post3-st_14^post4 == 0 /\ x_13^post3-x_13^post4 == 0 /\ -rt_11^post3+rt_11^0 == 0 /\ 1-y_15^0+y_15^post3 == 0 /\ rt_11^post3-rt_11^post4 == 0 /\ 1-x_13^0 <= 0 /\ -y_15^0+x_13^post3-x_13^0 == 0 /\ st_14^0-st_14^post3 == 0), cost: 1
   5: l4 -> l1 : rt_11^0'=rt_11^post1, st_14^0'=st_14^post1, x_13^0'=x_13^post1, y_15^0'=y_15^post1, (-x_13^post1+x_13^post5 == 0 /\ -x_13^post5+x_13^0 == 0 /\ -rt_11^post5+rt_11^0 == 0 /\ -y_15^post1+y_15^post5 == 0 /\ -st_14^post1+st_14^post5 == 0 /\ -y_15^post5+y_15^0 == 0 /\ st_14^0-st_14^post5 == 0 /\ -rt_11^post1+rt_11^post5 == 0), cost: 1

	Eliminating location l0 by chaining:

	Applied chaining

	First rule:
	l4 -> l0 : rt_11^0'=rt_11^post5, st_14^0'=st_14^post5, x_13^0'=x_13^post5, y_15^0'=y_15^post5, (-x_13^post5+x_13^0 == 0 /\ -rt_11^post5+rt_11^0 == 0 /\ -y_15^post5+y_15^0 == 0 /\ st_14^0-st_14^post5 == 0), cost: 1
	Second rule:
	l0 -> l1 : rt_11^0'=rt_11^post1, st_14^0'=st_14^post1, x_13^0'=x_13^post1, y_15^0'=y_15^post1, (-y_15^post1+y_15^0 == 0 /\ -rt_11^post1+rt_11^0 == 0 /\ -x_13^post1+x_13^0 == 0 /\ st_14^0-st_14^post1 == 0), cost: 1
	New rule:
	l4 -> l1 : rt_11^0'=rt_11^post1, st_14^0'=st_14^post1, x_13^0'=x_13^post1, y_15^0'=y_15^post1, (-x_13^post1+x_13^post5 == 0 /\ -x_13^post5+x_13^0 == 0 /\ -rt_11^post5+rt_11^0 == 0 /\ -y_15^post1+y_15^post5 == 0 /\ -st_14^post1+st_14^post5 == 0 /\ -y_15^post5+y_15^0 == 0 /\ st_14^0-st_14^post5 == 0 /\ -rt_11^post1+rt_11^post5 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 0 4
	
	Eliminating location l3 by chaining:

	Applied chaining

	First rule:
	l1 -> l3 : rt_11^0'=rt_11^post3, st_14^0'=st_14^post3, x_13^0'=x_13^post3, y_15^0'=y_15^post3, (-rt_11^post3+rt_11^0 == 0 /\ 1-y_15^0+y_15^post3 == 0 /\ 1-x_13^0 <= 0 /\ -y_15^0+x_13^post3-x_13^0 == 0 /\ st_14^0-st_14^post3 == 0), cost: 1
	Second rule:
	l3 -> l1 : rt_11^0'=rt_11^post4, st_14^0'=st_14^post4, x_13^0'=x_13^post4, y_15^0'=y_15^post4, (-rt_11^post4+rt_11^0 == 0 /\ st_14^0-st_14^post4 == 0 /\ -x_13^post4+x_13^0 == 0 /\ -y_15^post4+y_15^0 == 0), cost: 1
	New rule:
	l1 -> l1 : rt_11^0'=rt_11^post4, st_14^0'=st_14^post4, x_13^0'=x_13^post4, y_15^0'=y_15^post4, (-y_15^post4+y_15^post3 == 0 /\ st_14^post3-st_14^post4 == 0 /\ x_13^post3-x_13^post4 == 0 /\ -rt_11^post3+rt_11^0 == 0 /\ 1-y_15^0+y_15^post3 == 0 /\ rt_11^post3-rt_11^post4 == 0 /\ 1-x_13^0 <= 0 /\ -y_15^0+x_13^post3-x_13^0 == 0 /\ st_14^0-st_14^post3 == 0), cost: 1
	
	Applied deletion

	Removed the following rules: 2 3

Simplified Transitions

Start location: l4
Program variables: rt_11^0 st_14^0 x_13^0 y_15^0
   7: l1 -> l2 : rt_11^0'=st_14^0, x_13^0 <= 0, cost: 1
   9: l1 -> l1 : x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, 1-x_13^0 <= 0, cost: 1
   8: l4 -> l1 : T, cost: 1

	Propagated Equalities

	Original rule:
	l1 -> l2 : rt_11^0'=rt_11^post2, st_14^0'=st_14^post2, x_13^0'=x_13^post2, y_15^0'=y_15^post2, (y_15^0-y_15^post2 == 0 /\ -x_13^post2+x_13^0 == 0 /\ -st_14^0+rt_11^post2 == 0 /\ -st_14^post2+st_14^0 == 0 /\ x_13^0 <= 0), cost: 1
	New rule:
	l1 -> l2 : rt_11^0'=st_14^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, (0 == 0 /\ x_13^0 <= 0), cost: 1
	
		propagated equality y_15^post2 = y_15^0
		
		propagated equality x_13^post2 = x_13^0
		
		propagated equality rt_11^post2 = st_14^0
		
		propagated equality st_14^post2 = st_14^0
		
	Simplified Guard

	Original rule:
	l1 -> l2 : rt_11^0'=st_14^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, (0 == 0 /\ x_13^0 <= 0), cost: 1
	New rule:
	l1 -> l2 : rt_11^0'=st_14^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, x_13^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l1 -> l2 : rt_11^0'=st_14^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, x_13^0 <= 0, cost: 1
	New rule:
	l1 -> l2 : rt_11^0'=st_14^0, x_13^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l4 -> l1 : rt_11^0'=rt_11^post1, st_14^0'=st_14^post1, x_13^0'=x_13^post1, y_15^0'=y_15^post1, (-x_13^post1+x_13^post5 == 0 /\ -x_13^post5+x_13^0 == 0 /\ -rt_11^post5+rt_11^0 == 0 /\ -y_15^post1+y_15^post5 == 0 /\ -st_14^post1+st_14^post5 == 0 /\ -y_15^post5+y_15^0 == 0 /\ st_14^0-st_14^post5 == 0 /\ -rt_11^post1+rt_11^post5 == 0), cost: 1
	New rule:
	l4 -> l1 : rt_11^0'=rt_11^post5, st_14^0'=st_14^post5, x_13^0'=x_13^post5, y_15^0'=y_15^post5, (0 == 0 /\ -x_13^post5+x_13^0 == 0 /\ -rt_11^post5+rt_11^0 == 0 /\ -y_15^post5+y_15^0 == 0 /\ st_14^0-st_14^post5 == 0), cost: 1
	
		propagated equality x_13^post1 = x_13^post5
		
		propagated equality y_15^post1 = y_15^post5
		
		propagated equality st_14^post1 = st_14^post5
		
		propagated equality rt_11^post1 = rt_11^post5
		
	Propagated Equalities

	Original rule:
	l4 -> l1 : rt_11^0'=rt_11^post5, st_14^0'=st_14^post5, x_13^0'=x_13^post5, y_15^0'=y_15^post5, (0 == 0 /\ -x_13^post5+x_13^0 == 0 /\ -rt_11^post5+rt_11^0 == 0 /\ -y_15^post5+y_15^0 == 0 /\ st_14^0-st_14^post5 == 0), cost: 1
	New rule:
	l4 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, 0 == 0, cost: 1
	
		propagated equality x_13^post5 = x_13^0
		
		propagated equality rt_11^post5 = rt_11^0
		
		propagated equality y_15^post5 = y_15^0
		
		propagated equality st_14^post5 = st_14^0
		
	Simplified Guard

	Original rule:
	l4 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, 0 == 0, cost: 1
	New rule:
	l4 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l4 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=x_13^0, y_15^0'=y_15^0, T, cost: 1
	New rule:
	l4 -> l1 : T, cost: 1
	
	Propagated Equalities

	Original rule:
	l1 -> l1 : rt_11^0'=rt_11^post4, st_14^0'=st_14^post4, x_13^0'=x_13^post4, y_15^0'=y_15^post4, (-y_15^post4+y_15^post3 == 0 /\ st_14^post3-st_14^post4 == 0 /\ x_13^post3-x_13^post4 == 0 /\ -rt_11^post3+rt_11^0 == 0 /\ 1-y_15^0+y_15^post3 == 0 /\ rt_11^post3-rt_11^post4 == 0 /\ 1-x_13^0 <= 0 /\ -y_15^0+x_13^post3-x_13^0 == 0 /\ st_14^0-st_14^post3 == 0), cost: 1
	New rule:
	l1 -> l1 : rt_11^0'=rt_11^post3, st_14^0'=st_14^post3, x_13^0'=x_13^post3, y_15^0'=y_15^post3, (0 == 0 /\ -rt_11^post3+rt_11^0 == 0 /\ 1-y_15^0+y_15^post3 == 0 /\ 1-x_13^0 <= 0 /\ -y_15^0+x_13^post3-x_13^0 == 0 /\ st_14^0-st_14^post3 == 0), cost: 1
	
		propagated equality y_15^post4 = y_15^post3
		
		propagated equality st_14^post4 = st_14^post3
		
		propagated equality x_13^post4 = x_13^post3
		
		propagated equality rt_11^post4 = rt_11^post3
		
	Propagated Equalities

	Original rule:
	l1 -> l1 : rt_11^0'=rt_11^post3, st_14^0'=st_14^post3, x_13^0'=x_13^post3, y_15^0'=y_15^post3, (0 == 0 /\ -rt_11^post3+rt_11^0 == 0 /\ 1-y_15^0+y_15^post3 == 0 /\ 1-x_13^0 <= 0 /\ -y_15^0+x_13^post3-x_13^0 == 0 /\ st_14^0-st_14^post3 == 0), cost: 1
	New rule:
	l1 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, (0 == 0 /\ 1-x_13^0 <= 0), cost: 1
	
		propagated equality rt_11^post3 = rt_11^0
		
		propagated equality y_15^post3 = -1+y_15^0
		
		propagated equality x_13^post3 = y_15^0+x_13^0
		
		propagated equality st_14^post3 = st_14^0
		
	Simplified Guard

	Original rule:
	l1 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, (0 == 0 /\ 1-x_13^0 <= 0), cost: 1
	New rule:
	l1 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, 1-x_13^0 <= 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l1 -> l1 : rt_11^0'=rt_11^0, st_14^0'=st_14^0, x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, 1-x_13^0 <= 0, cost: 1
	New rule:
	l1 -> l1 : x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, 1-x_13^0 <= 0, cost: 1

Step with 8

	Trace

	8[T]
	
	Blocked

	[{}, {}]

Step with 7

	Trace

	8[T], 7[(x_13^0 <= 0)]
	
	Blocked

	[{}, {}, {}]

Backtrack

	Trace

	8[T]
	
	Blocked

	[{}, {7[T]}]

Step with 9

	Trace

	8[T], 9[(1-x_13^0 <= 0)]
	
	Blocked

	[{}, {7[T]}, {}]

Accelerate

Start location: l4
Program variables: rt_11^0 st_14^0 x_13^0 y_15^0
   7: l1 -> l2 : rt_11^0'=st_14^0, x_13^0 <= 0, cost: 1
   9: l1 -> l1 : x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, 1-x_13^0 <= 0, cost: 1
  10: l1 -> l1 : x_13^0'=1/2*n+n*y_15^0-1/2*n^2+x_13^0, y_15^0'=-n+y_15^0, (-1+n >= 0 /\ -3/2+1/2*n+(-1+n)*y_15^0-1/2*(-1+n)^2+x_13^0 >= 0 /\ -1+x_13^0 >= 0), cost: 1
   8: l4 -> l1 : T, cost: 1

	Loop Acceleration

	Original rule:
	l1 -> l1 : x_13^0'=y_15^0+x_13^0, y_15^0'=-1+y_15^0, (1-x_13^0 <= 0), cost: 1
	New rule:
	l1 -> l1 : x_13^0'=1/2*n+n*y_15^0-1/2*n^2+x_13^0, y_15^0'=-n+y_15^0, (-1+n >= 0 /\ -3/2+1/2*n+(-1+n)*y_15^0-1/2*(-1+n)^2+x_13^0 >= 0 /\ -1+x_13^0 >= 0), cost: 1

		-1+x_13^0 >= 0 [0]: eventual decrease yields (-3/2+1/2*n+(-1+n)*y_15^0-1/2*(-1+n)^2+x_13^0 >= 0 /\ -1+x_13^0 >= 0)
		
		Replacement map: {-1+x_13^0 >= 0 -> (-3/2+1/2*n+(-1+n)*y_15^0-1/2*(-1+n)^2+x_13^0 >= 0 /\ -1+x_13^0 >= 0)}

	Trace

	8[T], 10[(-1+n >= 0 /\ -3/2+1/2*n+(-1+n)*y_15^0-1/2*(-1+n)^2+x_13^0 >= 0 /\ -1+x_13^0 >= 0)]
	
	Blocked

	[{}, {7[T]}, {9[T], 10[T]}]

Step with 7

	Trace

	8[T], 10[(-1+n >= 0 /\ -3/2+1/2*n+(-1+n)*y_15^0-1/2*(-1+n)^2+x_13^0 >= 0 /\ -1+x_13^0 >= 0)], 7[(x_13^0 <= 0)]
	
	Blocked

	[{}, {7[T]}, {9[T], 10[T]}, {}]

Backtrack

	Trace

	8[T], 10[(-1+n >= 0 /\ -3/2+1/2*n+(-1+n)*y_15^0-1/2*(-1+n)^2+x_13^0 >= 0 /\ -1+x_13^0 >= 0)]
	
	Blocked

	[{}, {7[T]}, {7[T], 9[T], 10[T]}]

Backtrack

	Trace

	8[T]
	
	Blocked

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

Step with 9

	Trace

	8[T], 9[(1-x_13^0 <= 0)]
	
	Blocked

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

Covered

	Trace

	8[T]
	
	Blocked

	[{}, {7[T], 9[T], 10[T]}]

Backtrack

	Trace

	Blocked

	[{8[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b