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