MAYBE


Termination: (Ranking Functions Found)
------------
n_n_n_l0___1___3___1: < < 1 + z_0, x_0 -y_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t10,t11,t12,t13,t14,t5,t6,t7,t8,t9
+--nodes: n_n_n_n_n_n_n_n_n_l0___1___1___4___6___6___6___6___6___6,n_n_n_n_n_n_n_n_n_l0___1___1___6___8___8___8___8___8___8,n_n_n_n_n_n_n_n_n_l0___1___2___3___4___4___4___4___4___4,n_n_n_n_n_n_n_n_n_l0___1___2___3___5___5___5___5___5___5,n_n_n_n_n_n_n_n_n_l0___1___2___5___7___7___7___7___7___7

deterministic: True
method 4