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