1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
(** Terminating SLR3 solver ([slr3t]).
Simpler version of {!SLRphased} without phases. *)
open Batteries
open Goblint_constraint.ConstrSys
open Messages
open SLR
(** the terminating SLR3 box solver *)
module SLR3term =
functor (S:EqConstrSys) ->
functor (HM:Hashtbl.S with type key = S.v) ->
struct
include Generic.SolverStats (S) (HM)
module VS = Set.Make (S.Var)
module P =
struct
type t = S.Var.t * S.Var.t [@@deriving eq, hash]
end
module HPM = Hashtbl.Make (P)
let narrow = narrow S.Dom.narrow
let solve st vs =
let key = HM.create 10 in
let module H = Heap.Make (struct
type t = S.Var.t
let compare x y = compare (HM.find key x) (HM.find key y)
end)
in
let q =
let x = H.find_min !q in
q := H.del_min !q; x
in
let min_key q =
let x = H.find_min !q in
HM.find key x
in
let rebuild = H.of_list % H.to_list in
let wpoint = HM.create 10 in
let infl = HM.create 10 in
let set = HM.create 10 in
let rho = HM.create 10 in
let rho' = HPM.create 10 in
let q = ref H.empty in
let count = ref 0 in
let count_side = ref (max_int - 1) in
let () = print_solver_stats := fun () ->
Logs.info "wpoint: %d, rho: %d, rho': %d, q: %d, count: %d, count_side: %d" (HM.length wpoint) (HM.length rho) (HPM.length rho') (H.size !q) (Int.neg !count) (max_int - !count_side);
let histo = Hashtbl.create 13 in
HM.iter (fun k _ -> Hashtbl.modify_def 1 (S.Var.var_id k) ((+)1) histo) rho;
let vid,n = Hashtbl.fold (fun k v (k',v') -> if v > v' then k,v else k',v') histo (Obj.magic (), 0) in
Logs.info "max #contexts: %d for var_id %s" n vid
in
let init ?(side=false) x =
if not (HM.mem rho x) then begin
new_var_event x;
HM.replace rho x (S.Dom.bot ());
HM.replace infl x (VS.add x VS.empty);
let c = if side then count_side else count in
if tracing then trace "sol" "INIT: Var: %a with prio %d" S.Var.pretty_trace x !c;
HM.replace key x !c; decr c
end
in
let sides x =
let w = try HM.find set x with Not_found -> VS.empty in
let v = VS.fold (fun z d -> try S.Dom.join d (HPM.find rho' (z,x)) with Not_found -> d) w (S.Dom.bot ()) in
if tracing then trace "sol" "SIDES: Var: %a\nVal: %a" S.Var.pretty_trace x S.Dom.pretty v; v
in
let rec iterate b_old prio =
if H.size !q = 0 || min_key q > prio then ()
else
let n = min_key q in
let x = extract_min q in
let b_new = do_var b_old x in
if b_old <> b_new && n < prio then (
iterate b_new n;
iterate b_old prio
) else
iterate b_new prio
and solve ?(side=false) x =
if not (HM.mem rho x) then begin
init ~side:side x;
let b_new = do_var false x in
iterate b_new (HM.find key x)
end
and do_var b_old x =
let wpx = HM.mem wpoint x in
let old = HM.find rho x in
let eval y =
get_var_event y;
solve y;
if HM.find key x <= HM.find key y then begin
HM.replace wpoint y ()
end;
HM.replace infl y (VS.add x (try HM.find infl y with Not_found -> VS.empty));
HM.find rho y
in
let effects = ref Set.empty in
let side y d =
assert (not (S.Dom.is_bot d));
if tracing then trace "sol" "SIDE: Var: %a\nVal: %a" S.Var.pretty_trace y S.Dom.pretty d;
let first = not (Set.mem y !effects) in
effects := Set.add y !effects;
if first then (
HPM.replace rho' (x,y) d;
HM.replace set y (VS.add x (try HM.find set y with Not_found -> VS.empty));
if not (HM.mem rho y) then (
init ~side:true y;
ignore @@ do_var false y
) else (
if HM.find key y < 0 then (
HM.replace key y (Ref.post_decr count_side);
q := rebuild !q
)
);
q := H.add y !q
) else (
let old = HPM.find rho' (x,y) in
let newd = S.Dom.join old d in
HPM.replace rho' (x,y) newd;
if not (S.Dom.equal old newd) then (
q := H.add y !q
)
);
HM.replace wpoint y ()
in
let tmp = eq x eval side in
let tmp = S.Dom.join tmp (sides x) in
let val_new, b_new =
if wpx then
if S.Dom.leq tmp old then (
let nar = narrow old tmp in
if tracing then trace "sol" "NARROW1: Var: %a\nOld: %a\nNew: %a\nNarrow: %a" S.Var.pretty_trace x S.Dom.pretty old S.Dom.pretty tmp S.Dom.pretty nar;
nar, true
) else
if b_old then (
let nar = narrow old tmp in
if tracing then trace "sol" "NARROW2: Var: %a\nOld: %a\nNew: %a\nNarrow: %a" S.Var.pretty_trace x S.Dom.pretty old S.Dom.pretty tmp S.Dom.pretty nar;
nar, true
)
else (
let wid = S.Dom.widen old (S.Dom.join old tmp) in
if tracing then trace "sol" "WIDEN: Var: %a\nOld: %a\nNew: %a\nWiden: %a" S.Var.pretty_trace x S.Dom.pretty old S.Dom.pretty tmp S.Dom.pretty wid;
wid, false
)
else
tmp, b_old
in
if tracing then trace "sol" "Var: %a" S.Var.pretty_trace x ;
if tracing then trace "sol" "Contrib:%a" S.Dom.pretty val_new;
if S.Dom.equal old val_new then ()
else begin
update_var_event x old val_new;
if tracing then trace "sol" "New Value:%a" S.Dom.pretty val_new;
HM.replace rho x val_new;
let w = try HM.find infl x with Not_found -> VS.empty in
q := VS.fold H.add w !q;
HM.replace infl x VS.empty
end;
b_new
and eq x get set =
eval_rhs_event x;
match S.system x with
| None -> S.Dom.bot ()
| Some f -> f get set
in
let set_start (x,d) =
init ~side:true x;
HM.replace rho x d;
HM.replace wpoint x ();
q := H.add x !q;
HM.replace set x (VS.add x VS.empty);
HPM.replace rho' (x,x) d
in
start_event ();
List.iter set_start st;
List.iter solve vs;
iterate false max_int;
stop_event ();
if GobConfig.get_bool "dbg.print_wpoints" then (
Logs.newline ();
Logs.debug "Widening points:";
HM.iter (fun k () -> Logs.debug "%a" S.Var.pretty_trace k) wpoint;
Logs.newline ();
);
HM.clear key ;
HM.clear wpoint;
HM.clear infl ;
HM.clear set ;
HPM.clear rho' ;
rho
end
let _ =
Selector.add_solver ("slr3t", (module PostSolver.DemandEqIncrSolverFromEqSolver (SLR3term)));