Initial Problem

Start: f0
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
Locations: f0, f18, f24, f32, f34, f37
Transitions:
7:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f18(1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,L,M,Arg_8,Arg_9,Arg_10):|:M<=0
8:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f18(1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,L,0,1,M,M):|:1<=M && 1<=N
9:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f32(1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,L,0,1,M,M):|:M<=0 && 1<=N
0:f18(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:Arg_0<=0
6:f18(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f24(0,Arg_1,L,Arg_3,Arg_4,L,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1<=Arg_0
3:f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f32(Arg_0,L,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1<=Arg_0
4:f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f32(Arg_0,M,Arg_2,L,L,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:Arg_0<=0 && L<=999+Arg_2
5:f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f32(1,M,Arg_2,L,L,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:Arg_0<=0 && Arg_2+1000<=L
1:f32(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f32(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10)
2:f34(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f37(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10)

Preprocessing

Cut unreachable locations [f34; f37] from the program graph

Cut unsatisfiable transition 0: f18->f24

Cut unsatisfiable transition 3: f24->f32

Eliminate variables {Arg_1,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10} that do not contribute to the problem

Found invariant Arg_0<=1 && 1<=Arg_0 for location f18

Found invariant Arg_0<=0 && 0<=Arg_0 for location f24

Found invariant Arg_0<=1 && 0<=Arg_0 for location f32

Problem after Preprocessing

Start: f0
Program_Vars: Arg_0, Arg_2
Temp_Vars: L, M, N
Locations: f0, f18, f24, f32
Transitions:
20:f0(Arg_0,Arg_2) -> f18(1,Arg_2):|:M<=0
21:f0(Arg_0,Arg_2) -> f18(1,Arg_2):|:1<=M && 1<=N
22:f0(Arg_0,Arg_2) -> f32(1,Arg_2):|:M<=0 && 1<=N
23:f18(Arg_0,Arg_2) -> f24(0,L):|:Arg_0<=1 && 1<=Arg_0 && 1<=Arg_0
24:f24(Arg_0,Arg_2) -> f32(Arg_0,Arg_2):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && L<=999+Arg_2
25:f24(Arg_0,Arg_2) -> f32(1,Arg_2):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && Arg_2+1000<=L
26:f32(Arg_0,Arg_2) -> f32(Arg_0,Arg_2):|:Arg_0<=1 && 0<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
20: f0->f18: 1 {O(1)}
21: f0->f18: 1 {O(1)}
22: f0->f32: 1 {O(1)}
23: f18->f24: 1 {O(1)}
24: f24->f32: 1 {O(1)}
25: f24->f32: 1 {O(1)}
26: f32->f32: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
20: f0->f18: 1 {O(1)}
21: f0->f18: 1 {O(1)}
22: f0->f32: 1 {O(1)}
23: f18->f24: 1 {O(1)}
24: f24->f32: 1 {O(1)}
25: f24->f32: 1 {O(1)}
26: f32->f32: inf {Infinity}

Sizebounds

20: f0->f18, Arg_0: 1 {O(1)}
20: f0->f18, Arg_2: Arg_2 {O(n)}
21: f0->f18, Arg_0: 1 {O(1)}
21: f0->f18, Arg_2: Arg_2 {O(n)}
22: f0->f32, Arg_0: 1 {O(1)}
22: f0->f32, Arg_2: Arg_2 {O(n)}
23: f18->f24, Arg_0: 0 {O(1)}
24: f24->f32, Arg_0: 0 {O(1)}
25: f24->f32, Arg_0: 1 {O(1)}
26: f32->f32, Arg_0: 1 {O(1)}