MAYBE


Termination: (Ranking Functions Found)
------------
n_n_n_l2___3___1___1: < < 8 -j_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t1,t2,t3,t4,t5
+--nodes: n_n_n_n_n_n_n_n_n_l2___5___5___5___3___3___3___3___3___3,n_n_n_n_n_n_n_n_n_l3___4___3___3___1___1___1___1___1___1,n_n_n_n_n_n_n_n_n_l3___4___4___4___2___2___2___2___2___2

deterministic: False
method 4