NO


Termination: (Ranking Functions Found)
------------
l0: < < -c_0 + curr_serv_0 > >
l1: < < -c_0 + curr_serv_0 > >
l6: < < -c_0 + curr_serv_0 > >


NON-Termination:
----------------
SCC:
+--transitions: t12
+--nodes: n_l4___7
Closed walk: 1 -> t12
Reachability checked!
- Recurrent Set Found:
{
	servers_0 -servers_post == 0,
	resp_0 -resp_post == 0,
	curr_serv_0 -curr_serv_post == 0,
	c_0 -c_post == 0,
	___rho_2__0 -___rho_2__post == 0,
	___rho_1__0 -___rho_1__post == 0,
	-curr_serv_0 >= 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: 
+--nodes: n_l1___12
SCC:
+--transitions: 
+--nodes: n_l0___14
SCC:
+--transitions: 
+--nodes: n_l1___1
SCC:
+--transitions: 
+--nodes: n_l0___13
SCC:
+--transitions: 
+--nodes: n_l6___15
SCC:
+--transitions: 
+--nodes: n_l1___16
SCC:
+--transitions: 
+--nodes: n_l0___17
SCC:
+--transitions: t11,t7,t9
+--nodes: n_l0___10,n_l1___8,n_l6___11
SCC:
+--transitions: t13,t15,t16,t17,t18,t20,t21,t22
+--nodes: n_l0___4,n_l0___9,n_l1___3,n_l1___6,n_l6___2,n_l6___5


method 3