Initial Problem
Start: eval_foo_start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_start, eval_foo_stop
Transitions:
1:eval_foo_bb0_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_2,Arg_3,Arg_2,Arg_3)
2:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<Arg_1
3:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<Arg_0
4:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb3_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=Arg_1 && Arg_1<=Arg_0
5:eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_0-1,Arg_1+1,Arg_2,Arg_3)
6:eval_foo_bb3_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:eval_foo_start(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb0_in(Arg_0,Arg_1,Arg_2,Arg_3)
Preprocessing
Found invariant Arg_3<=Arg_2 && Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location eval_foo_stop
Found invariant Arg_3<=Arg_2 && Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location eval_foo_bb3_in
Found invariant Arg_3<=Arg_1 && Arg_0<=Arg_2 for location eval_foo_bb2_in
Found invariant Arg_3<=Arg_1 && Arg_0<=Arg_2 for location eval_foo_bb1_in
Problem after Preprocessing
Start: eval_foo_start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_start, eval_foo_stop
Transitions:
1:eval_foo_bb0_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_2,Arg_3,Arg_2,Arg_3)
2:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_1 && Arg_0<=Arg_2 && Arg_0<Arg_1
3:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_1 && Arg_0<=Arg_2 && Arg_1<Arg_0
4:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb3_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_1 && Arg_0<=Arg_2 && Arg_0<=Arg_1 && Arg_1<=Arg_0
5:eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_0-1,Arg_1+1,Arg_2,Arg_3):|:Arg_3<=Arg_1 && Arg_0<=Arg_2
6:eval_foo_bb3_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_stop(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_2 && Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1
0:eval_foo_start(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb0_in(Arg_0,Arg_1,Arg_2,Arg_3)
MPRF for transition 3:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_1 && Arg_0<=Arg_2 && Arg_1<Arg_0 of depth 1:
new bound:
Arg_2+Arg_3 {O(n)}
MPRF:
eval_foo_bb2_in [Arg_0-Arg_3-1 ]
eval_foo_bb1_in [Arg_0-Arg_3 ]
Analysing control-flow refined program
Cut unsatisfiable transition 68: n_eval_foo_bb1_in___5->eval_foo_bb3_in
Found invariant 1+Arg_3<=Arg_1 && 1+Arg_0<=Arg_2 && 3+Arg_0<=Arg_1 for location n_eval_foo_bb2_in___4
Found invariant Arg_3<=Arg_1 && 1+Arg_2<=Arg_3 && Arg_1<=Arg_3 && 1+Arg_0<=Arg_3 && 1+Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_0<=Arg_2 && 1+Arg_0<=Arg_1 for location n_eval_foo_bb2_in___7
Found invariant 1+Arg_3<=Arg_2 && 1+Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && 1+Arg_0<=Arg_2 && Arg_1<=1+Arg_0 && 1+Arg_0<=Arg_1 for location n_eval_foo_bb2_in___2
Found invariant Arg_3<=Arg_2 && Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location eval_foo_stop
Found invariant 1+Arg_3<=Arg_2 && 1+Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && 1+Arg_0<=Arg_2 && Arg_1<=1+Arg_0 for location n_eval_foo_bb1_in___3
Found invariant Arg_3<=Arg_2 && Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location eval_foo_bb3_in
Found invariant 1+Arg_3<=Arg_1 && 1+Arg_0<=Arg_2 && 3+Arg_0<=Arg_1 for location n_eval_foo_bb1_in___5
Found invariant 3+Arg_3<=Arg_2 && 1+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 2+Arg_1<=Arg_2 && 1+Arg_0<=Arg_2 && 1+Arg_1<=Arg_0 for location n_eval_foo_bb2_in___1
Found invariant Arg_3<=Arg_1 && Arg_1<=Arg_3 && Arg_2<=Arg_0 && Arg_0<=Arg_2 for location eval_foo_bb1_in
Found invariant 1+Arg_3<=Arg_2 && Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && Arg_1<=Arg_3 && Arg_2<=Arg_0 && 1+Arg_1<=Arg_2 && Arg_0<=Arg_2 && 1+Arg_1<=Arg_0 for location n_eval_foo_bb2_in___6
MPRF for transition 51:n_eval_foo_bb1_in___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_eval_foo_bb2_in___1(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_3<=Arg_2 && 1+Arg_3<=Arg_1 && Arg_3<=Arg_0 && Arg_1<=Arg_2 && 1+Arg_0<=Arg_2 && Arg_1<=1+Arg_0 && Arg_3<=Arg_1 && Arg_0<=Arg_2 && 1+Arg_3<=Arg_1 && 1+Arg_0<=Arg_2 && Arg_1<Arg_0 && Arg_3<=Arg_1 && Arg_0<=Arg_2 of depth 1:
new bound:
Arg_2+Arg_3+1 {O(n)}
MPRF:
n_eval_foo_bb2_in___1 [Arg_2-Arg_1-1 ]
n_eval_foo_bb1_in___3 [Arg_2-Arg_1 ]
MPRF for transition 56:n_eval_foo_bb2_in___1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_eval_foo_bb1_in___3(Arg_0-1,Arg_1+1,Arg_2,Arg_3):|:3+Arg_3<=Arg_2 && 1+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 2+Arg_1<=Arg_2 && 1+Arg_0<=Arg_2 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2 && Arg_1<Arg_0 && 1+Arg_3<=Arg_1 && Arg_3<=Arg_1 && Arg_0<=Arg_2 of depth 1:
new bound:
Arg_2+Arg_3+2 {O(n)}
MPRF:
n_eval_foo_bb2_in___1 [Arg_2-Arg_1-1 ]
n_eval_foo_bb1_in___3 [Arg_2-Arg_1-1 ]
CFR did not improve the program. Rolling back
All Bounds
Timebounds
Overall timebound:inf {Infinity}
1: eval_foo_bb0_in->eval_foo_bb1_in: 1 {O(1)}
2: eval_foo_bb1_in->eval_foo_bb2_in: inf {Infinity}
3: eval_foo_bb1_in->eval_foo_bb2_in: Arg_2+Arg_3 {O(n)}
4: eval_foo_bb1_in->eval_foo_bb3_in: 1 {O(1)}
5: eval_foo_bb2_in->eval_foo_bb1_in: inf {Infinity}
6: eval_foo_bb3_in->eval_foo_stop: 1 {O(1)}
0: eval_foo_start->eval_foo_bb0_in: 1 {O(1)}
Costbounds
Overall costbound: inf {Infinity}
1: eval_foo_bb0_in->eval_foo_bb1_in: 1 {O(1)}
2: eval_foo_bb1_in->eval_foo_bb2_in: inf {Infinity}
3: eval_foo_bb1_in->eval_foo_bb2_in: Arg_2+Arg_3 {O(n)}
4: eval_foo_bb1_in->eval_foo_bb3_in: 1 {O(1)}
5: eval_foo_bb2_in->eval_foo_bb1_in: inf {Infinity}
6: eval_foo_bb3_in->eval_foo_stop: 1 {O(1)}
0: eval_foo_start->eval_foo_bb0_in: 1 {O(1)}
Sizebounds
1: eval_foo_bb0_in->eval_foo_bb1_in, Arg_0: Arg_2 {O(n)}
1: eval_foo_bb0_in->eval_foo_bb1_in, Arg_1: Arg_3 {O(n)}
1: eval_foo_bb0_in->eval_foo_bb1_in, Arg_2: Arg_2 {O(n)}
1: eval_foo_bb0_in->eval_foo_bb1_in, Arg_3: Arg_3 {O(n)}
2: eval_foo_bb1_in->eval_foo_bb2_in, Arg_2: 2*Arg_2 {O(n)}
2: eval_foo_bb1_in->eval_foo_bb2_in, Arg_3: 2*Arg_3 {O(n)}
3: eval_foo_bb1_in->eval_foo_bb2_in, Arg_2: 2*Arg_2 {O(n)}
3: eval_foo_bb1_in->eval_foo_bb2_in, Arg_3: 2*Arg_3 {O(n)}
4: eval_foo_bb1_in->eval_foo_bb3_in, Arg_2: 3*Arg_2 {O(n)}
4: eval_foo_bb1_in->eval_foo_bb3_in, Arg_3: 3*Arg_3 {O(n)}
5: eval_foo_bb2_in->eval_foo_bb1_in, Arg_2: 2*Arg_2 {O(n)}
5: eval_foo_bb2_in->eval_foo_bb1_in, Arg_3: 2*Arg_3 {O(n)}
6: eval_foo_bb3_in->eval_foo_stop, Arg_2: 3*Arg_2 {O(n)}
6: eval_foo_bb3_in->eval_foo_stop, Arg_3: 3*Arg_3 {O(n)}
0: eval_foo_start->eval_foo_bb0_in, Arg_0: Arg_0 {O(n)}
0: eval_foo_start->eval_foo_bb0_in, Arg_1: Arg_1 {O(n)}
0: eval_foo_start->eval_foo_bb0_in, Arg_2: Arg_2 {O(n)}
0: eval_foo_start->eval_foo_bb0_in, Arg_3: Arg_3 {O(n)}