Start: f2
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D
Locations: f1, f2, f300
Transitions:
2:f2(Arg_0,Arg_1,Arg_2) -> f300(Arg_0,Arg_1,Arg_2)
1:f300(Arg_0,Arg_1,Arg_2) -> f1(Arg_0,Arg_1,D):|:Arg_1<=Arg_0
0:f300(Arg_0,Arg_1,Arg_2) -> f300(1+Arg_0,Arg_1,Arg_2):|:1+Arg_0<=Arg_1
Eliminate variables {D,Arg_2} that do not contribute to the problem
Found invariant Arg_1<=Arg_0 for location f1
Start: f2
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f1, f2, f300
Transitions:
7:f2(Arg_0,Arg_1) -> f300(Arg_0,Arg_1)
9:f300(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:Arg_1<=Arg_0
8:f300(Arg_0,Arg_1) -> f300(1+Arg_0,Arg_1):|:1+Arg_0<=Arg_1
new bound:
Arg_0+Arg_1 {O(n)}
MPRF:
f300 [Arg_1-Arg_0 ]
Overall timebound:Arg_0+Arg_1+2 {O(n)}
7: f2->f300: 1 {O(1)}
8: f300->f300: Arg_0+Arg_1 {O(n)}
9: f300->f1: 1 {O(1)}
Overall costbound: Arg_0+Arg_1+2 {O(n)}
7: f2->f300: 1 {O(1)}
8: f300->f300: Arg_0+Arg_1 {O(n)}
9: f300->f1: 1 {O(1)}
7: f2->f300, Arg_0: Arg_0 {O(n)}
7: f2->f300, Arg_1: Arg_1 {O(n)}
8: f300->f300, Arg_0: 2*Arg_0+Arg_1 {O(n)}
8: f300->f300, Arg_1: Arg_1 {O(n)}
9: f300->f1, Arg_0: 3*Arg_0+Arg_1 {O(n)}
9: f300->f1, Arg_1: 2*Arg_1 {O(n)}