Start: start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: f, start
Transitions:
0:f(Arg_0,Arg_1,Arg_2) -> f(Arg_0,Arg_1+1,Arg_2):|:Arg_1+1<=Arg_0 && Arg_2+1<=Arg_0
1:f(Arg_0,Arg_1,Arg_2) -> f(Arg_0,Arg_1,Arg_2+1):|:Arg_1+1<=Arg_0 && Arg_2+1<=Arg_0
2:start(Arg_0,Arg_1,Arg_2) -> f(Arg_0,Arg_1,Arg_2)
Start: start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: f, start
Transitions:
0:f(Arg_0,Arg_1,Arg_2) -> f(Arg_0,Arg_1+1,Arg_2):|:Arg_1+1<=Arg_0 && Arg_2+1<=Arg_0
1:f(Arg_0,Arg_1,Arg_2) -> f(Arg_0,Arg_1,Arg_2+1):|:Arg_1+1<=Arg_0 && Arg_2+1<=Arg_0
2:start(Arg_0,Arg_1,Arg_2) -> f(Arg_0,Arg_1,Arg_2)
new bound:
Arg_0+Arg_1 {O(n)}
MPRF:
f [Arg_0-Arg_1 ]
new bound:
Arg_0+Arg_2 {O(n)}
MPRF:
f [Arg_0-Arg_2 ]
Overall timebound:2*Arg_0+Arg_1+Arg_2+1 {O(n)}
0: f->f: Arg_0+Arg_1 {O(n)}
1: f->f: Arg_0+Arg_2 {O(n)}
2: start->f: 1 {O(1)}
Overall costbound: 2*Arg_0+Arg_1+Arg_2+1 {O(n)}
0: f->f: Arg_0+Arg_1 {O(n)}
1: f->f: Arg_0+Arg_2 {O(n)}
2: start->f: 1 {O(1)}
0: f->f, Arg_0: 2*Arg_0 {O(n)}
0: f->f, Arg_1: 3*Arg_1+Arg_0 {O(n)}
0: f->f, Arg_2: 3*Arg_2+Arg_0 {O(n)}
1: f->f, Arg_0: 2*Arg_0 {O(n)}
1: f->f, Arg_1: 3*Arg_1+Arg_0 {O(n)}
1: f->f, Arg_2: 3*Arg_2+Arg_0 {O(n)}
2: start->f, Arg_0: Arg_0 {O(n)}
2: start->f, Arg_1: Arg_1 {O(n)}
2: start->f, Arg_2: Arg_2 {O(n)}