NO


Termination: (Ranking Functions Found)
------------
l0: < < -copied_0 >, < -copied_0 > >
l2: < < -copied_0 >, < -copied_0 > >
l3: < < -copied_0 >, < -copied_0 > >
l4: < < -copied_0 >, < -copied_0 > >
l5: < < -copied_0 >, < -copied_0 > >


NON-Termination:
----------------
SCC:
+--transitions: t2,t4,t5,t6,t7,t8
+--nodes: l0,l2,l3,l4,l5
Closed walk: 2 -> t5, t6
Reachability checked!
- Recurrent Set Found:
{
	oldn_0 -oldn_post == 0,
	olde_0 -olde_post == 0,
	__const_11_0 + n_0 -n_post == 0,
	1 + e_0 -e_post == 0,
	copied_0 -copied_post == 0,
	__const_11_0 -__const_11_post == 0,
	__const_10_0 -__const_10_post == 0,
	__const_100_0 -__const_100_post == 0,
	oldn_0 -X7 == 0,
	olde_0 -X6 == 0,
	__const_11_0 + n_0 -X5 == 0,
	1 + e_0 -X4 == 0,
	copied_0 -X3 == 0,
	__const_11_0 -X2 == 0,
	__const_10_0 -X1 == 0,
	__const_100_0 -X0 == 0,
	-__const_11_0 >= 0,
	-1 + e_0 >= 0,
	__const_100_0 -n_0 >= 0
}
method 1