MAYBE


Termination: (Ranking Functions Found)
------------
l5: < < -1 - x_5_0 + y_6_0 > >
l2: < < - x_5_0 + y_6_0 > >
l4: < < -1 - x_5_0 + y_6_0 > >
l0: < < - x_5_0 + y_6_0 > >
n_l0___1: < < - x_5_0 + y_6_0 >, < - x_5_0 + y_6_0 > >
n_l0___2: < < - x_5_0 + y_6_0 > >
l3: < < - x_5_0 + y_6_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t6
+--nodes: n_n_n_l0___2___1___1