Initial Problem

Start: f300
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10
Temp_Vars: L, M, N, O, P, Q, R, S
Locations: f1, f2, f300
Transitions:
0:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f2(Arg_0,Arg_2,Arg_2,L,M,N,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1<=Arg_0
1:f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f1(Arg_0,L,N,P,Q,Arg_5,Arg_6,L,M,O,R):|:Arg_6<=0
3:f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f1(Arg_0,N,N,P,Q,R,Arg_6,L,M,O,S):|:Arg_0<=0 && 1<=Arg_6
2:f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f2(Arg_0,N,N,P,Q,R,Arg_6,L,M,O,Arg_10):|:1<=Arg_0 && 1<=Arg_6

Preprocessing

Eliminate variables {L,M,N,O,P,Q,R,S,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_7,Arg_8,Arg_9,Arg_10} that do not contribute to the problem

Found invariant 1<=Arg_6 && 2<=Arg_0+Arg_6 && 1<=Arg_0 for location f2

Problem after Preprocessing

Start: f300
Program_Vars: Arg_0, Arg_6
Temp_Vars:
Locations: f1, f2, f300
Transitions:
6:f2(Arg_0,Arg_6) -> f2(Arg_0,Arg_6):|:1<=Arg_6 && 2<=Arg_0+Arg_6 && 1<=Arg_0 && 1<=Arg_0
7:f300(Arg_0,Arg_6) -> f1(Arg_0,Arg_6):|:Arg_6<=0
9:f300(Arg_0,Arg_6) -> f1(Arg_0,Arg_6):|:Arg_0<=0 && 1<=Arg_6
8:f300(Arg_0,Arg_6) -> f2(Arg_0,Arg_6):|:1<=Arg_0 && 1<=Arg_6

All Bounds

Timebounds

Overall timebound:inf {Infinity}
6: f2->f2: inf {Infinity}
7: f300->f1: 1 {O(1)}
8: f300->f2: 1 {O(1)}
9: f300->f1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
6: f2->f2: inf {Infinity}
7: f300->f1: 1 {O(1)}
8: f300->f2: 1 {O(1)}
9: f300->f1: 1 {O(1)}

Sizebounds

6: f2->f2, Arg_0: Arg_0 {O(n)}
6: f2->f2, Arg_6: Arg_6 {O(n)}
7: f300->f1, Arg_0: Arg_0 {O(n)}
7: f300->f1, Arg_6: Arg_6 {O(n)}
8: f300->f2, Arg_0: Arg_0 {O(n)}
8: f300->f2, Arg_6: Arg_6 {O(n)}
9: f300->f1, Arg_0: Arg_0 {O(n)}
9: f300->f1, Arg_6: Arg_6 {O(n)}