Initial Problem
Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars: F
Locations: f0, f1, f2
Transitions:
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(F,1,0,Arg_3,Arg_4)
1:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,Arg_2,Arg_3,Arg_4):|:1<=Arg_1 && 101<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,Arg_2,Arg_3,Arg_4):|:1<=Arg_1 && Arg_0<=100
3:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,1,Arg_0,Arg_1):|:101<=Arg_0 && Arg_2<=0 && 1<=Arg_1
4:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,1,Arg_0,Arg_1):|:Arg_0<=100 && Arg_2<=0 && 1<=Arg_1
5:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_0<=Arg_3 && 1<=Arg_2 && Arg_4<=Arg_1
Preprocessing
Found invariant Arg_4<=Arg_1 && Arg_0<=Arg_3 && Arg_2<=1 && Arg_2<=1+Arg_1 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 0<=Arg_1 for location f2
Found invariant Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 for location f1
Problem after Preprocessing
Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars: F
Locations: f0, f1, f2
Transitions:
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(F,1,0,Arg_3,Arg_4)
1:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,Arg_2,Arg_3,Arg_4):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 1<=Arg_1 && 101<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,Arg_2,Arg_3,Arg_4):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 1<=Arg_1 && Arg_0<=100
3:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 101<=Arg_0 && Arg_2<=0 && 1<=Arg_1
4:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && Arg_0<=100 && Arg_2<=0 && 1<=Arg_1
5:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && Arg_0<=Arg_3 && 1<=Arg_2 && Arg_4<=Arg_1
MPRF for transition 3:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 101<=Arg_0 && Arg_2<=0 && 1<=Arg_1 of depth 1:
new bound:
1 {O(1)}
MPRF:
f1 [1-Arg_2 ]
MPRF for transition 4:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && Arg_0<=100 && Arg_2<=0 && 1<=Arg_1 of depth 1:
new bound:
1 {O(1)}
MPRF:
f1 [1-Arg_2 ]
Analysing control-flow refined program
Cut unsatisfiable transition 5: f1->f2
Cut unsatisfiable transition 164: n_f1___10->f2
Cut unsatisfiable transition 165: n_f1___11->f2
Cut unsatisfiable transition 166: n_f1___12->f2
Cut unsatisfiable transition 170: n_f1___5->f2
Cut unsatisfiable transition 171: n_f1___6->f2
Cut unsatisfiable transition 172: n_f1___7->f2
Cut unsatisfiable transition 173: n_f1___8->f2
Cut unsatisfiable transition 174: n_f1___9->f2
Found invariant Arg_2<=1 && Arg_2<=Arg_1 && 90+Arg_2<=Arg_0 && Arg_0+Arg_2<=102 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 92<=Arg_0+Arg_2 && Arg_0<=100+Arg_2 && 1<=Arg_1 && 92<=Arg_0+Arg_1 && Arg_0<=100+Arg_1 && Arg_0<=101 && 91<=Arg_0 for location n_f1___2
Found invariant Arg_2<=1 && Arg_2<=1+Arg_1 && 90+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 92<=Arg_0+Arg_2 && 0<=Arg_1 && 91<=Arg_0+Arg_1 && 91<=Arg_0 for location n_f1___4
Found invariant Arg_2<=0 && 2+Arg_2<=Arg_1 && Arg_0+Arg_2<=111 && 0<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_0<=111+Arg_2 && 2<=Arg_1 && Arg_0<=109+Arg_1 && Arg_0<=111 for location n_f1___11
Found invariant Arg_2<=1 && 1+Arg_2<=Arg_1 && 101+Arg_2<=Arg_0 && Arg_0+Arg_2<=112 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && 103<=Arg_0+Arg_2 && Arg_0<=110+Arg_2 && 2<=Arg_1 && 104<=Arg_0+Arg_1 && Arg_0<=109+Arg_1 && Arg_0<=111 && 102<=Arg_0 for location n_f1___3
Found invariant 1+Arg_4<=Arg_1 && 1<=Arg_4 && Arg_3<=99+Arg_4 && 2<=Arg_2+Arg_4 && Arg_2<=Arg_4 && 3<=Arg_1+Arg_4 && Arg_1<=1+Arg_4 && Arg_0<=110+Arg_4 && Arg_3<=100 && Arg_3<=99+Arg_2 && Arg_2+Arg_3<=101 && Arg_3<=98+Arg_1 && 11+Arg_3<=Arg_0 && Arg_0+Arg_3<=211 && Arg_0<=11+Arg_3 && Arg_2<=1 && 1+Arg_2<=Arg_1 && Arg_0+Arg_2<=112 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && Arg_0<=110+Arg_2 && 2<=Arg_1 && Arg_0<=109+Arg_1 && Arg_0<=111 for location n_f1___9
Found invariant Arg_4<=Arg_1 && 91<=Arg_3 && 92<=Arg_2+Arg_3 && 90+Arg_2<=Arg_3 && 91<=Arg_1+Arg_3 && 182<=Arg_0+Arg_3 && Arg_0<=Arg_3 && Arg_2<=1 && Arg_2<=1+Arg_1 && 90+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 92<=Arg_0+Arg_2 && 0<=Arg_1 && 91<=Arg_0+Arg_1 && 91<=Arg_0 for location f2
Found invariant Arg_4<=1+Arg_1 && 1<=Arg_4 && 102<=Arg_3+Arg_4 && 2<=Arg_2+Arg_4 && Arg_2<=Arg_4 && 1<=Arg_1+Arg_4 && 1+Arg_1<=Arg_4 && 92<=Arg_0+Arg_4 && Arg_3<=10+Arg_0 && 101<=Arg_3 && 102<=Arg_2+Arg_3 && 100+Arg_2<=Arg_3 && 101<=Arg_1+Arg_3 && 192<=Arg_0+Arg_3 && 10+Arg_0<=Arg_3 && Arg_2<=1 && Arg_2<=1+Arg_1 && 90+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 92<=Arg_0+Arg_2 && 0<=Arg_1 && 91<=Arg_0+Arg_1 && 91<=Arg_0 for location n_f1___10
Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 91+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 91<=Arg_0+Arg_2 && 0<=Arg_1 && 91<=Arg_0+Arg_1 && 91<=Arg_0 for location n_f1___12
Found invariant Arg_4<=1+Arg_1 && 2<=Arg_4 && 103<=Arg_3+Arg_4 && Arg_3<=109+Arg_4 && 3<=Arg_2+Arg_4 && 1+Arg_2<=Arg_4 && 3<=Arg_1+Arg_4 && 1+Arg_1<=Arg_4 && 93<=Arg_0+Arg_4 && Arg_0<=99+Arg_4 && Arg_3<=111 && Arg_3<=110+Arg_2 && Arg_2+Arg_3<=112 && Arg_3<=110+Arg_1 && Arg_3<=10+Arg_0 && Arg_0+Arg_3<=212 && 101<=Arg_3 && 102<=Arg_2+Arg_3 && 100+Arg_2<=Arg_3 && 102<=Arg_1+Arg_3 && 192<=Arg_0+Arg_3 && 10+Arg_0<=Arg_3 && Arg_2<=1 && Arg_2<=Arg_1 && 90+Arg_2<=Arg_0 && Arg_0+Arg_2<=102 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 92<=Arg_0+Arg_2 && Arg_0<=100+Arg_2 && 1<=Arg_1 && 92<=Arg_0+Arg_1 && Arg_0<=100+Arg_1 && Arg_0<=101 && 91<=Arg_0 for location n_f1___5
Found invariant 1+Arg_4<=Arg_1 && 1<=Arg_4 && 92<=Arg_3+Arg_4 && Arg_3<=99+Arg_4 && 2<=Arg_2+Arg_4 && Arg_2<=Arg_4 && 3<=Arg_1+Arg_4 && Arg_1<=1+Arg_4 && 103<=Arg_0+Arg_4 && Arg_0<=110+Arg_4 && Arg_3<=100 && Arg_3<=99+Arg_2 && Arg_2+Arg_3<=101 && Arg_3<=98+Arg_1 && 11+Arg_3<=Arg_0 && Arg_0+Arg_3<=211 && 91<=Arg_3 && 92<=Arg_2+Arg_3 && 90+Arg_2<=Arg_3 && 93<=Arg_1+Arg_3 && 193<=Arg_0+Arg_3 && Arg_0<=11+Arg_3 && Arg_2<=1 && 1+Arg_2<=Arg_1 && 101+Arg_2<=Arg_0 && Arg_0+Arg_2<=112 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && 103<=Arg_0+Arg_2 && Arg_0<=110+Arg_2 && 2<=Arg_1 && 104<=Arg_0+Arg_1 && Arg_0<=109+Arg_1 && Arg_0<=111 && 102<=Arg_0 for location n_f1___7
Found invariant 2+Arg_4<=Arg_1 && 1<=Arg_4 && Arg_3<=88+Arg_4 && 2<=Arg_2+Arg_4 && Arg_2<=Arg_4 && 4<=Arg_1+Arg_4 && Arg_0<=110+Arg_4 && Arg_3<=89 && Arg_3<=88+Arg_2 && Arg_2+Arg_3<=90 && Arg_3<=86+Arg_1 && 22+Arg_3<=Arg_0 && Arg_0+Arg_3<=200 && Arg_2<=1 && 2+Arg_2<=Arg_1 && Arg_0+Arg_2<=112 && 1<=Arg_2 && 4<=Arg_1+Arg_2 && Arg_0<=110+Arg_2 && 3<=Arg_1 && Arg_0<=108+Arg_1 && Arg_0<=111 for location n_f1___1
Found invariant Arg_2<=0 && 1+Arg_2<=Arg_1 && 91+Arg_2<=Arg_0 && Arg_0+Arg_2<=101 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 91<=Arg_0+Arg_2 && Arg_0<=101+Arg_2 && 1<=Arg_1 && 92<=Arg_0+Arg_1 && Arg_0<=100+Arg_1 && Arg_0<=101 && 91<=Arg_0 for location n_f1___6
Found invariant Arg_2<=0 && 1+Arg_2<=Arg_1 && Arg_1+Arg_2<=1 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && Arg_1<=1 && 1<=Arg_1 for location f1
Found invariant Arg_2<=0 && 2+Arg_2<=Arg_1 && 102+Arg_2<=Arg_0 && Arg_0+Arg_2<=111 && 0<=Arg_2 && 2<=Arg_1+Arg_2 && 102<=Arg_0+Arg_2 && Arg_0<=111+Arg_2 && 2<=Arg_1 && 104<=Arg_0+Arg_1 && Arg_0<=109+Arg_1 && Arg_0<=111 && 102<=Arg_0 for location n_f1___8
Cut unsatisfiable transition 106: n_f1___1->n_f1___5
Cut unsatisfiable transition 107: n_f1___1->n_f1___9
Cut unsatisfiable transition 163: n_f1___1->f2
Cut unsatisfiable transition 115: n_f1___12->n_f1___12
Cut unsatisfiable transition 122: n_f1___2->n_f1___10
Cut unsatisfiable transition 125: n_f1___2->n_f1___7
Cut unsatisfiable transition 127: n_f1___3->n_f1___5
Cut unsatisfiable transition 128: n_f1___4->n_f1___10
Cut unsatisfiable transition 131: n_f1___4->n_f1___7
MPRF for transition 130:n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_f1___4(Arg_0-10,Arg_1-1,Arg_2,Arg_3,Arg_4):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 90+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 92<=Arg_0+Arg_2 && 0<=Arg_1 && 91<=Arg_0+Arg_1 && 91<=Arg_0 && Arg_2<=1 && 0<=Arg_2 && 0<=Arg_2 && Arg_2<=1 && 91<=Arg_0 && 0<=Arg_1 && 1<=Arg_1 && 101<=Arg_0 && 0<=Arg_2 && Arg_2<=1 of depth 1:
new bound:
55419 {O(1)}
MPRF:
n_f1___2 [9191 ]
n_f1___3 [9191 ]
n_f1___4 [102*Arg_0-91 ]
CFR did not improve the program. Rolling back
All Bounds
Timebounds
Overall timebound:inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f1: inf {Infinity}
3: f1->f1: 1 {O(1)}
4: f1->f1: 1 {O(1)}
5: f1->f2: 1 {O(1)}
Costbounds
Overall costbound: inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f1: inf {Infinity}
3: f1->f1: 1 {O(1)}
4: f1->f1: 1 {O(1)}
5: f1->f2: 1 {O(1)}
Sizebounds
0: f0->f1, Arg_1: 1 {O(1)}
0: f0->f1, Arg_2: 0 {O(1)}
0: f0->f1, Arg_3: Arg_3 {O(n)}
0: f0->f1, Arg_4: Arg_4 {O(n)}
1: f1->f1, Arg_2: 1 {O(1)}
2: f1->f1, Arg_2: 1 {O(1)}
3: f1->f1, Arg_2: 1 {O(1)}
4: f1->f1, Arg_2: 1 {O(1)}
5: f1->f2, Arg_2: 1 {O(1)}