MAYBE


Termination: (Ranking Functions Found)
------------
l2: < < -i_11_0 + length_10_0 > >
l4: < < -i_11_0 + length_10_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t10,t7,t8,t9
+--nodes: n_n_n_n_n_n_n_n_n_l9___2___1___1___4___4___4___4___4___4,n_n_n_n_n_n_n_n_n_l9___2___1___2___3___3___3___3___3___3

deterministic: False
method 4