Initial Problem

Start: f2
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7
Temp_Vars: I, J, K
Locations: f1, f2, f300
Transitions:
0:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> f1(Arg_0,Arg_1,J,I,K,Arg_5,Arg_6,Arg_7):|:1<=I && 1+Arg_1<=Arg_0
1:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> f1(Arg_0,Arg_1,J,I,K,Arg_5,Arg_6,Arg_7):|:I+1<=0 && 1+Arg_1<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> f1(Arg_0,Arg_1,J,0,Arg_4,Arg_5,Arg_6,Arg_7):|:1+Arg_1<=Arg_0
3:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> f300(Arg_0,Arg_1,J,Arg_3,Arg_4,I,Arg_6,Arg_7):|:Arg_0<=Arg_1
4:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,J,J)

Preprocessing

Eliminate variables {J,K,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7} that do not contribute to the problem

Found invariant Arg_0<=Arg_1 for location f300

Problem after Preprocessing

Start: f2
Program_Vars: Arg_0, Arg_1
Temp_Vars: I
Locations: f1, f2, f300
Transitions:
10:f1(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:1<=I && 1+Arg_1<=Arg_0
11:f1(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:I+1<=0 && 1+Arg_1<=Arg_0
12:f1(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:1+Arg_1<=Arg_0
13:f1(Arg_0,Arg_1) -> f300(Arg_0,Arg_1):|:Arg_0<=Arg_1
14:f2(Arg_0,Arg_1) -> f1(Arg_0,Arg_1)

All Bounds

Timebounds

Overall timebound:inf {Infinity}
10: f1->f1: inf {Infinity}
11: f1->f1: inf {Infinity}
12: f1->f1: inf {Infinity}
13: f1->f300: 1 {O(1)}
14: f2->f1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
10: f1->f1: inf {Infinity}
11: f1->f1: inf {Infinity}
12: f1->f1: inf {Infinity}
13: f1->f300: 1 {O(1)}
14: f2->f1: 1 {O(1)}

Sizebounds

10: f1->f1, Arg_0: 3*Arg_0 {O(n)}
10: f1->f1, Arg_1: 3*Arg_1 {O(n)}
11: f1->f1, Arg_0: 3*Arg_0 {O(n)}
11: f1->f1, Arg_1: 3*Arg_1 {O(n)}
12: f1->f1, Arg_0: 3*Arg_0 {O(n)}
12: f1->f1, Arg_1: 3*Arg_1 {O(n)}
13: f1->f300, Arg_0: Arg_0 {O(n)}
13: f1->f300, Arg_1: Arg_1 {O(n)}
14: f2->f1, Arg_0: Arg_0 {O(n)}
14: f2->f1, Arg_1: Arg_1 {O(n)}