Initial Problem

Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_0,Arg_1,Arg_2,Arg_3)
1:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(2*Arg_0+Arg_1,Arg_2,Arg_2+1,Arg_3):|:0<=Arg_0+Arg_1 && Arg_0<=Arg_3

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_0,Arg_1,Arg_2,Arg_3)
1:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(2*Arg_0+Arg_1,Arg_2,Arg_2+1,Arg_3):|:0<=Arg_0+Arg_1 && Arg_0<=Arg_3

Analysing control-flow refined program

Found invariant Arg_2<=1+Arg_1 && 1+Arg_1<=Arg_2 for location n_l1___2

Found invariant 2<=Arg_2+Arg_3 && 1<=Arg_1+Arg_3 && Arg_2<=1+Arg_1 && 1+Arg_1<=Arg_2 for location n_l1___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}

Sizebounds

0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
0: l0->l1, Arg_2: Arg_2 {O(n)}
0: l0->l1, Arg_3: Arg_3 {O(n)}
1: l1->l1, Arg_3: Arg_3 {O(n)}