MAYBE


Termination: (Ranking Functions Found)
------------
l9: < < -1 + Pdolen_0 - i_0, Pdolen_0 - i_0 > >
l8: < < Pdolen_0 - i_0, 1 > >
l7: < < -1 + Pdolen_0 - i_0, Pdolen_0 - i_0 > >
l10: < < -1 + Pdolen_0 - i_0, Pdolen_0 - i_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t11
+--nodes: n_n_n_l3___4___3___3