NO

Initial ITS

Start location: l3
Program variables: x^0
   0: l0 -> l1 : x^0'=x^post1, (-300+x^post1-x^0 == 0 /\ 101-x^post1 <= 0), cost: 1
   1: l1 -> l0 : x^0'=x^post2, (-400+x^post2-x^0 == 0 /\ 101-x^post2 <= 0), cost: 1
   2: l2 -> l0 : x^0'=x^post3, (101-x^post3 <= 0 /\ -200+x^post3-x^0 == 0), cost: 1
   3: l2 -> l1 : x^0'=x^post4, (101-x^post4 <= 0 /\ -100+x^post4-x^0 == 0), cost: 1
   4: l3 -> l2 : x^0'=x^post5, -x^post5+x^0 == 0, cost: 1

Simplified Transitions

Start location: l3
Program variables: x^0
   5: l0 -> l1 : x^0'=300+x^0, -199-x^0 <= 0, cost: 1
   6: l1 -> l0 : x^0'=400+x^0, -299-x^0 <= 0, cost: 1
   7: l2 -> l0 : x^0'=200+x^0, -99-x^0 <= 0, cost: 1
   8: l2 -> l1 : x^0'=100+x^0, 1-x^0 <= 0, cost: 1
   9: l3 -> l2 : T, cost: 1

	Propagated Equalities

	Original rule:
	l0 -> l1 : x^0'=x^post1, (-300+x^post1-x^0 == 0 /\ 101-x^post1 <= 0), cost: 1
	New rule:
	l0 -> l1 : x^0'=300+x^0, (0 == 0 /\ -199-x^0 <= 0), cost: 1
	
		propagated equality x^post1 = 300+x^0
		
	Simplified Guard

	Original rule:
	l0 -> l1 : x^0'=300+x^0, (0 == 0 /\ -199-x^0 <= 0), cost: 1
	New rule:
	l0 -> l1 : x^0'=300+x^0, -199-x^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l1 -> l0 : x^0'=x^post2, (-400+x^post2-x^0 == 0 /\ 101-x^post2 <= 0), cost: 1
	New rule:
	l1 -> l0 : x^0'=400+x^0, (0 == 0 /\ -299-x^0 <= 0), cost: 1
	
		propagated equality x^post2 = 400+x^0
		
	Simplified Guard

	Original rule:
	l1 -> l0 : x^0'=400+x^0, (0 == 0 /\ -299-x^0 <= 0), cost: 1
	New rule:
	l1 -> l0 : x^0'=400+x^0, -299-x^0 <= 0, cost: 1
	
	Propagated Equalities

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

	Original rule:
	l2 -> l0 : x^0'=200+x^0, (0 == 0 /\ -99-x^0 <= 0), cost: 1
	New rule:
	l2 -> l0 : x^0'=200+x^0, -99-x^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l2 -> l1 : x^0'=x^post4, (101-x^post4 <= 0 /\ -100+x^post4-x^0 == 0), cost: 1
	New rule:
	l2 -> l1 : x^0'=100+x^0, (0 == 0 /\ 1-x^0 <= 0), cost: 1
	
		propagated equality x^post4 = 100+x^0
		
	Simplified Guard

	Original rule:
	l2 -> l1 : x^0'=100+x^0, (0 == 0 /\ 1-x^0 <= 0), cost: 1
	New rule:
	l2 -> l1 : x^0'=100+x^0, 1-x^0 <= 0, cost: 1
	
	Propagated Equalities

	Original rule:
	l3 -> l2 : x^0'=x^post5, -x^post5+x^0 == 0, cost: 1
	New rule:
	l3 -> l2 : x^0'=x^0, 0 == 0, cost: 1
	
		propagated equality x^post5 = x^0
		
	Simplified Guard

	Original rule:
	l3 -> l2 : x^0'=x^0, 0 == 0, cost: 1
	New rule:
	l3 -> l2 : x^0'=x^0, T, cost: 1
	
	Removed Trivial Updates

	Original rule:
	l3 -> l2 : x^0'=x^0, T, cost: 1
	New rule:
	l3 -> l2 : T, cost: 1

Step with 9

	Trace

	9[T]
	
	Blocked

	[{}, {}]

Step with 7

	Trace

	9[T], 7[(-99-x^0 <= 0)]
	
	Blocked

	[{}, {}, {}]

Step with 5

	Trace

	9[T], 7[(-99-x^0 <= 0)], 5[(-199-x^0 <= 0)]
	
	Blocked

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

Step with 6

	Trace

	9[T], 7[(-99-x^0 <= 0)], 5[(-199-x^0 <= 0)], 6[(-299-x^0 <= 0)]
	
	Blocked

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

Nonterm

Start location: l3
Program variables: x^0
   5: l0 -> l1 : x^0'=300+x^0, -199-x^0 <= 0, cost: 1
  10: l0 -> LoAT_sink : (-1+n >= 0 /\ 599+x^0 >= 0 /\ 199+x^0 >= 0), cost: NONTERM
  11: l0 -> l0 : x^0'=700*n+x^0, (-1+n >= 0 /\ 599+x^0 >= 0 /\ 199+x^0 >= 0), cost: 1
   6: l1 -> l0 : x^0'=400+x^0, -299-x^0 <= 0, cost: 1
   7: l2 -> l0 : x^0'=200+x^0, -99-x^0 <= 0, cost: 1
   8: l2 -> l1 : x^0'=100+x^0, 1-x^0 <= 0, cost: 1
   9: l3 -> l2 : T, cost: 1

	Certificate of Non-Termination

	Original rule:
	l0 -> l0 : x^0'=700+x^0, (-599-x^0 <= 0 /\ -199-x^0 <= 0), cost: 1
	New rule:
	l0 -> LoAT_sink : (-1+n >= 0 /\ 599+x^0 >= 0 /\ 199+x^0 >= 0), cost: NONTERM

		599+x^0 >= 0 [0]: monotonic increase yields 599+x^0 >= 0
		
		199+x^0 >= 0 [0]: monotonic increase yields 199+x^0 >= 0, dependencies: 599+x^0 >= 0
		
		Replacement map: {599+x^0 >= 0 -> 599+x^0 >= 0, 199+x^0 >= 0 -> 199+x^0 >= 0}

	Loop Acceleration

	Original rule:
	l0 -> l0 : x^0'=700+x^0, (-599-x^0 <= 0 /\ -199-x^0 <= 0), cost: 1
	New rule:
	l0 -> l0 : x^0'=700*n+x^0, (-1+n >= 0 /\ 599+x^0 >= 0 /\ 199+x^0 >= 0), cost: 1

		599+x^0 >= 0 [0]: monotonic increase yields 599+x^0 >= 0
		
		199+x^0 >= 0 [0]: monotonic increase yields 199+x^0 >= 0, dependencies: 599+x^0 >= 0
		
		Replacement map: {599+x^0 >= 0 -> 599+x^0 >= 0, 199+x^0 >= 0 -> 199+x^0 >= 0}

Step with 10

	Trace

	9[T], 7[(-99-x^0 <= 0)], 10[(-1+n >= 0 /\ 599+x^0 >= 0 /\ 199+x^0 >= 0)]
	
	Blocked

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

Refute

	Counterexample

	[ x^0=0 ] 9 [ x^0=200 ] 7 [ x^0=0 ] 10
	
NO

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b