MAYBE


Termination: (Ranking Functions Found)
------------
n_l3___5: < < Pdolen_0 - i_0 > >
l2: < < Pdolen_0 - i_0 > >
n_l2___3: < < Pdolen_0 - i_0 > >
n_n_n_l2___4___2___2: < < Pdolen_0 - i_0 > >
n_l2___1: < < Pdolen_0 - i_0 > >
l5: < < Pdolen_0 - i_0 > >
n_l3___2: < < Pdolen_0 - i_0 > >
n_n_l2___4___2: < < Pdolen_0 - i_0 > >
l3: < < Pdolen_0 - i_0 > >
n_n_l3___2___1: < < Pdolen_0 - i_0 > >
n_n_n_l3___2___1___1: < < Pdolen_0 - i_0 > >
l0: < < Pdolen_0 - i_0 > >
n_l2___4: < < Pdolen_0 - i_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t3,t4
+--nodes: n_n_n_l2___4___2___2,n_n_n_l3___2___1___1