Initial Problem

Start: n_f300
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f300, n_f3___1, n_f3___2, n_f3___3
Transitions:
0:n_f300(Arg_0) -> n_f3___3(Arg_0)
1:n_f3___1(Arg_0) -> n_f3___1(Arg_0-1):|:0<=Arg_0 && 1<=Arg_0
2:n_f3___1(Arg_0) -> n_f3___2(Arg_0-1):|:0<=Arg_0 && Arg_0<=0
3:n_f3___2(Arg_0) -> n_f3___2(Arg_0-1):|:Arg_0<=0 && Arg_0<=0 && 1+Arg_0<=0 && Arg_0<=0
4:n_f3___3(Arg_0) -> n_f3___1(Arg_0-1):|:1<=Arg_0
5:n_f3___3(Arg_0) -> n_f3___2(Arg_0-1):|:Arg_0<=0

Preprocessing

Found invariant 1+Arg_0<=0 for location n_f3___2

Found invariant 0<=Arg_0 for location n_f3___1

Problem after Preprocessing

Start: n_f300
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f300, n_f3___1, n_f3___2, n_f3___3
Transitions:
0:n_f300(Arg_0) -> n_f3___3(Arg_0)
1:n_f3___1(Arg_0) -> n_f3___1(Arg_0-1):|:0<=Arg_0 && 0<=Arg_0 && 1<=Arg_0
2:n_f3___1(Arg_0) -> n_f3___2(Arg_0-1):|:0<=Arg_0 && 0<=Arg_0 && Arg_0<=0
3:n_f3___2(Arg_0) -> n_f3___2(Arg_0-1):|:1+Arg_0<=0 && Arg_0<=0 && Arg_0<=0 && 1+Arg_0<=0 && Arg_0<=0
4:n_f3___3(Arg_0) -> n_f3___1(Arg_0-1):|:1<=Arg_0
5:n_f3___3(Arg_0) -> n_f3___2(Arg_0-1):|:Arg_0<=0

MPRF for transition 1:n_f3___1(Arg_0) -> n_f3___1(Arg_0-1):|:0<=Arg_0 && 0<=Arg_0 && 1<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_f3___1 [Arg_0+1 ]

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_f300->n_f3___3: 1 {O(1)}
1: n_f3___1->n_f3___1: Arg_0+1 {O(n)}
2: n_f3___1->n_f3___2: 1 {O(1)}
3: n_f3___2->n_f3___2: inf {Infinity}
4: n_f3___3->n_f3___1: 1 {O(1)}
5: n_f3___3->n_f3___2: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: n_f300->n_f3___3: 1 {O(1)}
1: n_f3___1->n_f3___1: Arg_0+1 {O(n)}
2: n_f3___1->n_f3___2: 1 {O(1)}
3: n_f3___2->n_f3___2: inf {Infinity}
4: n_f3___3->n_f3___1: 1 {O(1)}
5: n_f3___3->n_f3___2: 1 {O(1)}

Sizebounds

0: n_f300->n_f3___3, Arg_0: Arg_0 {O(n)}
1: n_f3___1->n_f3___1, Arg_0: Arg_0 {O(n)}
2: n_f3___1->n_f3___2, Arg_0: 1 {O(1)}
4: n_f3___3->n_f3___1, Arg_0: Arg_0 {O(n)}
5: n_f3___3->n_f3___2, Arg_0: Arg_0+1 {O(n)}