Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, f1
Transitions:
0:f0(Arg_0,Arg_1) -> f1(Arg_0,Arg_1)
1:f1(Arg_0,Arg_1) -> f1(Arg_0-Arg_1,Arg_1+1):|:1<=Arg_0
Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, f1
Transitions:
0:f0(Arg_0,Arg_1) -> f1(Arg_0,Arg_1)
1:f1(Arg_0,Arg_1) -> f1(Arg_0-Arg_1,Arg_1+1):|:1<=Arg_0
new bound:
8*Arg_0+8*Arg_1+9 {O(n)}
MPRF:
f1 [1-Arg_1 ; Arg_0 ]
Overall timebound:8*Arg_0+8*Arg_1+10 {O(n)}
0: f0->f1: 1 {O(1)}
1: f1->f1: 8*Arg_0+8*Arg_1+9 {O(n)}
Overall costbound: 8*Arg_0+8*Arg_1+10 {O(n)}
0: f0->f1: 1 {O(1)}
1: f1->f1: 8*Arg_0+8*Arg_1+9 {O(n)}
0: f0->f1, Arg_0: Arg_0 {O(n)}
0: f0->f1, Arg_1: Arg_1 {O(n)}
1: f1->f1, Arg_0: 144*Arg_0*Arg_1+64*Arg_0*Arg_0+80*Arg_1*Arg_1+153*Arg_0+172*Arg_1+90 {O(n^2)}
1: f1->f1, Arg_1: 8*Arg_0+9*Arg_1+9 {O(n)}