NO


NON-Termination:
----------------
SCC:
+--transitions: t2
+--nodes: n_eval_main_bb1_in___1
Closed walk: 1 -> t2
deterministic: Forced for: v_3_P, v_c_P0_P, v_a_P0_P, v_9_P
Reachability checked!
- Recurrent Set Found:
{
	v_c_P0_P == 0,
	-10 + v_b_P0_P == 0,
	v_a_P0_P == 0,
	v_9_P == 0,
	-1 + v_8_P == 0,
	1 + v_7_P == 0,
	-10 + v_3_P == 0,
	v_2 -v_2_P == 0,
	v_1 -v_1_P == 0,
	v_0 -v_0_P == 0,
	v_c_P0 == 0,
	-10 + v_b_P0 == 0,
	v_a_P0 == 0,
	v_9 == 0,
	v_7 + v_8 == 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: 
+--nodes: n_eval_main_bb1_in___2


method 3