MAYBE


Termination: (Ranking Functions Found)
------------
l2: < < -1 + k4_0 >, < k4_0 > >
l7: < < k4_0 >, < k4_0 > >
l4: < < -1 + k4_0 > >
l3: < < -1 + k4_0 >, < k4_0 > >
l5: < < -1 + k4_0 > >
l6: < < -1 + k4_0 > >
l8: < < -1 + k4_0 >, < k4_0 > >


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