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, Arg_11, Arg_12, Arg_13, Arg_14
Temp_Vars: P, Q
Locations: f0, f20, f28, f40, f42, f45
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,Arg_11,Arg_12,Arg_13,Arg_14) -> f20(1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,P,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14):|:P<=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,Arg_11,Arg_12,Arg_13,Arg_14) -> f20(1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,0,1,P,P,P,P):|:1<=P && 1<=Q
9:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f40(1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,0,1,P,P,P,P):|:P<=0 && 1<=Q
0:f20(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14):|:Arg_0<=0
6:f20(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f28(0,P,Arg_2,Arg_3,Arg_4,Arg_5,0,P,P,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14):|:1<=Arg_0
3:f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f40(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14):|:1<=Arg_0
4:f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f40(Arg_0,Arg_1,0,P,P,P,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14):|:Arg_0<=0 && P<=999+Arg_1
5:f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f40(1,Arg_1,0,P,P,P,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14):|:Arg_0<=0 && Arg_1+1000<=P
1:f40(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f40(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14)
2:f42(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14) -> f45(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14)

Preprocessing

Cut unreachable locations [f42; f45] from the program graph

Cut unsatisfiable transition 0: f20->f28

Cut unsatisfiable transition 3: f28->f40

Eliminate variables {Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14} that do not contribute to the problem

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

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

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

Problem after Preprocessing

Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: P, Q
Locations: f0, f20, f28, f40
Transitions:
20:f0(Arg_0,Arg_1) -> f20(1,Arg_1):|:P<=0
21:f0(Arg_0,Arg_1) -> f20(1,Arg_1):|:1<=P && 1<=Q
22:f0(Arg_0,Arg_1) -> f40(1,Arg_1):|:P<=0 && 1<=Q
23:f20(Arg_0,Arg_1) -> f28(0,P):|:Arg_0<=1 && 1<=Arg_0 && 1<=Arg_0
24:f28(Arg_0,Arg_1) -> f40(Arg_0,Arg_1):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && P<=999+Arg_1
25:f28(Arg_0,Arg_1) -> f40(1,Arg_1):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && Arg_1+1000<=P
26:f40(Arg_0,Arg_1) -> f40(Arg_0,Arg_1):|:Arg_0<=1 && 0<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
20: f0->f20: 1 {O(1)}
21: f0->f20: 1 {O(1)}
22: f0->f40: 1 {O(1)}
23: f20->f28: 1 {O(1)}
24: f28->f40: 1 {O(1)}
25: f28->f40: 1 {O(1)}
26: f40->f40: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
20: f0->f20: 1 {O(1)}
21: f0->f20: 1 {O(1)}
22: f0->f40: 1 {O(1)}
23: f20->f28: 1 {O(1)}
24: f28->f40: 1 {O(1)}
25: f28->f40: 1 {O(1)}
26: f40->f40: inf {Infinity}

Sizebounds

20: f0->f20, Arg_0: 1 {O(1)}
20: f0->f20, Arg_1: Arg_1 {O(n)}
21: f0->f20, Arg_0: 1 {O(1)}
21: f0->f20, Arg_1: Arg_1 {O(n)}
22: f0->f40, Arg_0: 1 {O(1)}
22: f0->f40, Arg_1: Arg_1 {O(n)}
23: f20->f28, Arg_0: 0 {O(1)}
24: f28->f40, Arg_0: 0 {O(1)}
25: f28->f40, Arg_0: 1 {O(1)}
26: f40->f40, Arg_0: 1 {O(1)}