Initial Problem

Start: f2
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D
Locations: f1, f2, f300
Transitions:
4:f2(Arg_0,Arg_1,Arg_2) -> f300(Arg_0,Arg_1,Arg_2)
1:f300(Arg_0,Arg_1,Arg_2) -> f1(Arg_0,Arg_1,D):|:1<=Arg_0 && Arg_1+Arg_0<=0 && 1<=Arg_1
2:f300(Arg_0,Arg_1,Arg_2) -> f1(Arg_0,Arg_1,D):|:1<=Arg_1 && Arg_0<=0
3:f300(Arg_0,Arg_1,Arg_2) -> f1(Arg_0,Arg_1,D):|:Arg_1<=0
0:f300(Arg_0,Arg_1,Arg_2) -> f300(Arg_0-1,Arg_0-2,Arg_2):|:1<=Arg_0 && 1<=Arg_1+Arg_0 && 1<=Arg_1

Preprocessing

Cut unsatisfiable transition 1: f300->f1

Eliminate variables {D,Arg_2} that do not contribute to the problem

Problem after Preprocessing

Start: f2
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f1, f2, f300
Transitions:
13:f2(Arg_0,Arg_1) -> f300(Arg_0,Arg_1)
15:f300(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:1<=Arg_1 && Arg_0<=0
16:f300(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:Arg_1<=0
14:f300(Arg_0,Arg_1) -> f300(Arg_0-1,Arg_0-2):|:1<=Arg_0 && 1<=Arg_1+Arg_0 && 1<=Arg_1

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

new bound:

Arg_0 {O(n)}

MPRF:

f300 [Arg_0 ]

All Bounds

Timebounds

Overall timebound:Arg_0+3 {O(n)}
13: f2->f300: 1 {O(1)}
14: f300->f300: Arg_0 {O(n)}
15: f300->f1: 1 {O(1)}
16: f300->f1: 1 {O(1)}

Costbounds

Overall costbound: Arg_0+3 {O(n)}
13: f2->f300: 1 {O(1)}
14: f300->f300: Arg_0 {O(n)}
15: f300->f1: 1 {O(1)}
16: f300->f1: 1 {O(1)}

Sizebounds

13: f2->f300, Arg_0: Arg_0 {O(n)}
13: f2->f300, Arg_1: Arg_1 {O(n)}
14: f300->f300, Arg_0: Arg_0 {O(n)}
14: f300->f300, Arg_1: 2*Arg_0 {O(n)}
15: f300->f1, Arg_0: Arg_0 {O(n)}
15: f300->f1, Arg_1: Arg_1 {O(n)}
16: f300->f1, Arg_0: 2*Arg_0 {O(n)}
16: f300->f1, Arg_1: 2*Arg_0+Arg_1 {O(n)}