NO


NON-Termination:
----------------
SCC:
+--transitions: t4,t5,t6,t7
+--nodes: n_l0___3,n_l1___2,n_l1___5
Closed walk: 2 -> t4, t5
deterministic: Forced for: X1
Reachability checked!
- Recurrent Set Found:
{
	r_post == 0,
	q_0 -q_post == 0,
	p_post == 0,
	N_0 -N_post == 0,
	X3 == 0,
	q_0 -X2 == 0,
	X1 == 0,
	N_0 -X0 == 0,
	r_0 == 0,
	p_0 == 0,
	-2 + q_0 >= 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t10,t8
+--nodes: n_l0___1,n_l1___4


method 3