MAYBE


Termination: (Ranking Functions Found)
------------
l6: < < curr_serv_0, 0 > >
l1: < < curr_serv_0, curr_serv_0 > >
l0: < < 2 + curr_serv_0, 0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t4
+--nodes: n_n_n_l4___2___2___2