MAYBE


Termination: (Ranking Functions Found)
------------
n_n_n_l0___2___2___2: < < x_0 > >
n_n_l0___2___2: < < x_0 > >
l1: < < -1 + x_0 > >
l2: < < x_0 > >
l0: < < -1 + x_0 > >
n_l2___1: < < 1 + x_0 > >
n_l0___2: < < x_0 > >
n_n_n_l2___1___1___1: < < 1 + x_0 > >
n_n_l2___1___1: < < 1 + x_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t1,t2
+--nodes: n_n_n_l0___2___2___2,n_n_n_l2___1___1___1