Initial Problem

Start: n_start
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, NoDet0
Locations: n_eval___1, n_eval___2, n_eval___3, n_eval___4, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1) -> n_eval___1(Arg_0,Arg_1-1):|:0<=1+Arg_0 && 0<=1+Arg_1 && 0<=Arg_1
1:n_eval___1(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+Arg_0 && 0<=1+Arg_1 && 0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
2:n_eval___2(Arg_0,Arg_1) -> n_eval___2(Arg_0,Arg_1-1):|:0<=1+Arg_1 && 0<=Arg_1
3:n_eval___2(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+Arg_1 && 0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
4:n_eval___3(Arg_0,Arg_1) -> n_eval___1(Arg_0,Arg_1-1):|:0<=1+Arg_0 && 0<=Arg_1
5:n_eval___3(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+Arg_0 && 0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
6:n_eval___4(Arg_0,Arg_1) -> n_eval___2(Arg_0,Arg_1-1):|:0<=Arg_1
7:n_eval___4(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
8:n_start(Arg_0,Arg_1) -> n_eval___4(Arg_0,Arg_1)

Preprocessing

Found invariant 0<=1+Arg_1 && 0<=2+Arg_0+Arg_1 && 0<=1+Arg_0 for location n_eval___1

Found invariant 0<=1+Arg_1 for location n_eval___2

Found invariant 0<=1+Arg_0 for location n_eval___3

Problem after Preprocessing

Start: n_start
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, NoDet0
Locations: n_eval___1, n_eval___2, n_eval___3, n_eval___4, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1) -> n_eval___1(Arg_0,Arg_1-1):|:0<=1+Arg_1 && 0<=2+Arg_0+Arg_1 && 0<=1+Arg_0 && 0<=1+Arg_0 && 0<=1+Arg_1 && 0<=Arg_1
1:n_eval___1(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+Arg_1 && 0<=2+Arg_0+Arg_1 && 0<=1+Arg_0 && 0<=1+Arg_0 && 0<=1+Arg_1 && 0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
2:n_eval___2(Arg_0,Arg_1) -> n_eval___2(Arg_0,Arg_1-1):|:0<=1+Arg_1 && 0<=1+Arg_1 && 0<=Arg_1
3:n_eval___2(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+Arg_1 && 0<=1+Arg_1 && 0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
4:n_eval___3(Arg_0,Arg_1) -> n_eval___1(Arg_0,Arg_1-1):|:0<=1+Arg_0 && 0<=1+Arg_0 && 0<=Arg_1
5:n_eval___3(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+Arg_0 && 0<=1+Arg_0 && 0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
6:n_eval___4(Arg_0,Arg_1) -> n_eval___2(Arg_0,Arg_1-1):|:0<=Arg_1
7:n_eval___4(Arg_0,Arg_1) -> n_eval___3(A_P,NoDet0):|:0<=1+A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
8:n_start(Arg_0,Arg_1) -> n_eval___4(Arg_0,Arg_1)

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

new bound:

Arg_1+2 {O(n)}

MPRF:

n_eval___2 [Arg_1+1 ]

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

new bound:

3*Arg_0+7 {O(n)}

MPRF:

n_eval___1 [Arg_0+2 ]
n_eval___3 [Arg_0+2 ]

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

new bound:

3*Arg_0+7 {O(n)}

MPRF:

n_eval___1 [Arg_0+1 ]
n_eval___3 [Arg_0+2 ]

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

new bound:

3*Arg_0+7 {O(n)}

MPRF:

n_eval___1 [Arg_0+1 ]
n_eval___3 [Arg_0+2 ]

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_eval___1->n_eval___1: inf {Infinity}
1: n_eval___1->n_eval___3: 3*Arg_0+7 {O(n)}
2: n_eval___2->n_eval___2: Arg_1+2 {O(n)}
3: n_eval___2->n_eval___3: 1 {O(1)}
4: n_eval___3->n_eval___1: 3*Arg_0+7 {O(n)}
5: n_eval___3->n_eval___3: 3*Arg_0+7 {O(n)}
6: n_eval___4->n_eval___2: 1 {O(1)}
7: n_eval___4->n_eval___3: 1 {O(1)}
8: n_start->n_eval___4: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: n_eval___1->n_eval___1: inf {Infinity}
1: n_eval___1->n_eval___3: 3*Arg_0+7 {O(n)}
2: n_eval___2->n_eval___2: Arg_1+2 {O(n)}
3: n_eval___2->n_eval___3: 1 {O(1)}
4: n_eval___3->n_eval___1: 3*Arg_0+7 {O(n)}
5: n_eval___3->n_eval___3: 3*Arg_0+7 {O(n)}
6: n_eval___4->n_eval___2: 1 {O(1)}
7: n_eval___4->n_eval___3: 1 {O(1)}
8: n_start->n_eval___4: 1 {O(1)}

Sizebounds

0: n_eval___1->n_eval___1, Arg_0: 6*Arg_0+7 {O(n)}
1: n_eval___1->n_eval___3, Arg_0: 6*Arg_0+7 {O(n)}
2: n_eval___2->n_eval___2, Arg_0: Arg_0 {O(n)}
2: n_eval___2->n_eval___2, Arg_1: Arg_1+2 {O(n)}
3: n_eval___2->n_eval___3, Arg_0: 2*Arg_0+2 {O(n)}
4: n_eval___3->n_eval___1, Arg_0: 6*Arg_0+7 {O(n)}
5: n_eval___3->n_eval___3, Arg_0: 6*Arg_0+7 {O(n)}
6: n_eval___4->n_eval___2, Arg_0: Arg_0 {O(n)}
6: n_eval___4->n_eval___2, Arg_1: Arg_1+1 {O(n)}
7: n_eval___4->n_eval___3, Arg_0: Arg_0+1 {O(n)}
8: n_start->n_eval___4, Arg_0: Arg_0 {O(n)}
8: n_start->n_eval___4, Arg_1: Arg_1 {O(n)}