Initial Problem

Start: f1
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, f1
Transitions:
1:f0(Arg_0,Arg_1) -> f0(Arg_0+Arg_1,Arg_1):|:1<=Arg_0 && 1<=Arg_1
2:f0(Arg_0,Arg_1) -> f0(Arg_0+Arg_1,Arg_1):|:1<=Arg_0 && Arg_1+1<=0
0:f1(Arg_0,Arg_1) -> f0(Arg_0,Arg_1)

Preprocessing

Problem after Preprocessing

Start: f1
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, f1
Transitions:
1:f0(Arg_0,Arg_1) -> f0(Arg_0+Arg_1,Arg_1):|:1<=Arg_0 && 1<=Arg_1
2:f0(Arg_0,Arg_1) -> f0(Arg_0+Arg_1,Arg_1):|:1<=Arg_0 && Arg_1+1<=0
0:f1(Arg_0,Arg_1) -> f0(Arg_0,Arg_1)

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

new bound:

Arg_0 {O(n)}

MPRF:

f0 [Arg_0 ]

All Bounds

Timebounds

Overall timebound:inf {Infinity}
1: f0->f0: inf {Infinity}
2: f0->f0: Arg_0 {O(n)}
0: f1->f0: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
1: f0->f0: inf {Infinity}
2: f0->f0: Arg_0 {O(n)}
0: f1->f0: 1 {O(1)}

Sizebounds

1: f0->f0, Arg_1: Arg_1 {O(n)}
2: f0->f0, Arg_0: 2*Arg_1+Arg_0 {O(n)}
2: f0->f0, Arg_1: Arg_1 {O(n)}
0: f1->f0, Arg_0: Arg_0 {O(n)}
0: f1->f0, Arg_1: Arg_1 {O(n)}