MAYBE


Termination: (Ranking Functions Found)
------------
l8: < < x_5_0 > >
l1: < < x_5_0 > >
n_l1___2: < < x_5_0 > >
l7: < < x_5_0 > >
l6: < < 1 + x_5_0 > >
l3: < < x_5_0 > >
n_l1___1: < < x_5_0 >, < x_5_0 > >


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