Initial Problem

Start: n_start
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, B_P
Locations: n_eval___1, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1) -> n_eval___1(A_P,B_P):|:1+Arg_1<=Arg_0 && 1+Arg_1<=B_P && A_P<=Arg_0
1:n_start(Arg_0,Arg_1) -> n_eval___1(Arg_0,Arg_1)

Preprocessing

Problem after Preprocessing

Start: n_start
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, B_P
Locations: n_eval___1, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1) -> n_eval___1(A_P,B_P):|:1+Arg_1<=Arg_0 && 1+Arg_1<=B_P && A_P<=Arg_0
1:n_start(Arg_0,Arg_1) -> n_eval___1(Arg_0,Arg_1)

MPRF for transition 0:n_eval___1(Arg_0,Arg_1) -> n_eval___1(A_P,B_P):|:1+Arg_1<=Arg_0 && 1+Arg_1<=B_P && A_P<=Arg_0 of depth 1:

new bound:

Arg_0+Arg_1 {O(n)}

MPRF:

n_eval___1 [Arg_0-Arg_1 ]

All Bounds

Timebounds

Overall timebound:Arg_0+Arg_1+1 {O(n)}
0: n_eval___1->n_eval___1: Arg_0+Arg_1 {O(n)}
1: n_start->n_eval___1: 1 {O(1)}

Costbounds

Overall costbound: Arg_0+Arg_1+1 {O(n)}
0: n_eval___1->n_eval___1: Arg_0+Arg_1 {O(n)}
1: n_start->n_eval___1: 1 {O(1)}

Sizebounds

1: n_start->n_eval___1, Arg_0: Arg_0 {O(n)}
1: n_start->n_eval___1, Arg_1: Arg_1 {O(n)}