Initial Problem

Start: evaleasy2start
Program_Vars: Arg_0
Temp_Vars:
Locations: evaleasy2bb1in, evaleasy2bbin, evaleasy2entryin, evaleasy2returnin, evaleasy2start, evaleasy2stop
Transitions:
2:evaleasy2bb1in(Arg_0) -> evaleasy2bbin(Arg_0):|:1<=Arg_0
3:evaleasy2bb1in(Arg_0) -> evaleasy2returnin(Arg_0):|:Arg_0<=0
4:evaleasy2bbin(Arg_0) -> evaleasy2bb1in(Arg_0-1)
1:evaleasy2entryin(Arg_0) -> evaleasy2bb1in(Arg_0)
5:evaleasy2returnin(Arg_0) -> evaleasy2stop(Arg_0)
0:evaleasy2start(Arg_0) -> evaleasy2entryin(Arg_0)

Preprocessing

Found invariant 1<=Arg_0 for location evaleasy2bbin

Found invariant Arg_0<=0 for location evaleasy2returnin

Found invariant Arg_0<=0 for location evaleasy2stop

Problem after Preprocessing

Start: evaleasy2start
Program_Vars: Arg_0
Temp_Vars:
Locations: evaleasy2bb1in, evaleasy2bbin, evaleasy2entryin, evaleasy2returnin, evaleasy2start, evaleasy2stop
Transitions:
2:evaleasy2bb1in(Arg_0) -> evaleasy2bbin(Arg_0):|:1<=Arg_0
3:evaleasy2bb1in(Arg_0) -> evaleasy2returnin(Arg_0):|:Arg_0<=0
4:evaleasy2bbin(Arg_0) -> evaleasy2bb1in(Arg_0-1):|:1<=Arg_0
1:evaleasy2entryin(Arg_0) -> evaleasy2bb1in(Arg_0)
5:evaleasy2returnin(Arg_0) -> evaleasy2stop(Arg_0):|:Arg_0<=0
0:evaleasy2start(Arg_0) -> evaleasy2entryin(Arg_0)

MPRF for transition 2:evaleasy2bb1in(Arg_0) -> evaleasy2bbin(Arg_0):|:1<=Arg_0 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evaleasy2bbin [Arg_0-1 ]
evaleasy2bb1in [Arg_0 ]

MPRF for transition 4:evaleasy2bbin(Arg_0) -> evaleasy2bb1in(Arg_0-1):|:1<=Arg_0 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evaleasy2bbin [Arg_0 ]
evaleasy2bb1in [Arg_0 ]

All Bounds

Timebounds

Overall timebound:2*Arg_0+4 {O(n)}
2: evaleasy2bb1in->evaleasy2bbin: Arg_0 {O(n)}
3: evaleasy2bb1in->evaleasy2returnin: 1 {O(1)}
4: evaleasy2bbin->evaleasy2bb1in: Arg_0 {O(n)}
1: evaleasy2entryin->evaleasy2bb1in: 1 {O(1)}
5: evaleasy2returnin->evaleasy2stop: 1 {O(1)}
0: evaleasy2start->evaleasy2entryin: 1 {O(1)}

Costbounds

Overall costbound: 2*Arg_0+4 {O(n)}
2: evaleasy2bb1in->evaleasy2bbin: Arg_0 {O(n)}
3: evaleasy2bb1in->evaleasy2returnin: 1 {O(1)}
4: evaleasy2bbin->evaleasy2bb1in: Arg_0 {O(n)}
1: evaleasy2entryin->evaleasy2bb1in: 1 {O(1)}
5: evaleasy2returnin->evaleasy2stop: 1 {O(1)}
0: evaleasy2start->evaleasy2entryin: 1 {O(1)}

Sizebounds

2: evaleasy2bb1in->evaleasy2bbin, Arg_0: Arg_0 {O(n)}
3: evaleasy2bb1in->evaleasy2returnin, Arg_0: 2*Arg_0 {O(n)}
4: evaleasy2bbin->evaleasy2bb1in, Arg_0: Arg_0 {O(n)}
1: evaleasy2entryin->evaleasy2bb1in, Arg_0: Arg_0 {O(n)}
5: evaleasy2returnin->evaleasy2stop, Arg_0: 2*Arg_0 {O(n)}
0: evaleasy2start->evaleasy2entryin, Arg_0: Arg_0 {O(n)}