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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
(**************************************************************************)
(* Sail *)
(* *)
(* Copyright (c) 2013-2017 *)
(* Kathyrn Gray *)
(* Shaked Flur *)
(* Stephen Kell *)
(* Gabriel Kerneis *)
(* Robert Norton-Wright *)
(* Christopher Pulte *)
(* Peter Sewell *)
(* Alasdair Armstrong *)
(* Brian Campbell *)
(* Thomas Bauereiss *)
(* Anthony Fox *)
(* Jon French *)
(* Dominic Mulligan *)
(* Stephen Kell *)
(* Mark Wassell *)
(* *)
(* All rights reserved. *)
(* *)
(* This software was developed by the University of Cambridge Computer *)
(* Laboratory as part of the Rigorous Engineering of Mainstream Systems *)
(* (REMS) project, funded by EPSRC grant EP/K008528/1. *)
(* *)
(* Redistribution and use in source and binary forms, with or without *)
(* modification, are permitted provided that the following conditions *)
(* are met: *)
(* 1. Redistributions of source code must retain the above copyright *)
(* notice, this list of conditions and the following disclaimer. *)
(* 2. Redistributions in binary form must reproduce the above copyright *)
(* notice, this list of conditions and the following disclaimer in *)
(* the documentation and/or other materials provided with the *)
(* distribution. *)
(* *)
(* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' *)
(* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *)
(* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *)
(* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR *)
(* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, *)
(* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT *)
(* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF *)
(* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND *)
(* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, *)
(* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT *)
(* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF *)
(* SUCH DAMAGE. *)
(**************************************************************************)
type smt_typ =
| Bitvec of int
| Bool
| Datatype of string * (string * (string * smt_typ) list) list
| Tuple of smt_typ list
| Array of smt_typ * smt_typ
let rec smt_typ_equal t1 t2 =
match t1, t2 with
| Bitvec n, Bitvec m -> n = m
| Bool, Bool -> true
| Datatype (name1, ctors1), Datatype (name2, ctors2) ->
let field_equal (field_name1, typ1) (field_name2, typ2) =
field_name1 = field_name2 && smt_typ_equal typ1 typ2
in
let ctor_equal (ctor_name1, fields1) (ctor_name2, fields2) =
ctor_name1 = ctor_name2
&& List.length fields1 = List.length fields2
&& List.for_all2 field_equal fields1 fields2
in
name1 = name2
&& List.length ctors1 = List.length ctors2
&& List.for_all2 ctor_equal ctors1 ctors2
| _, _ -> false
let mk_enum name elems =
Datatype (name, List.map (fun elem -> (elem, [])) elems)
let mk_record name fields =
Datatype (name, [(name, fields)])
let mk_variant name ctors =
Datatype (name, List.map (fun (ctor, ty) -> (ctor, [("un" ^ ctor, ty)])) ctors)
type smt_exp =
| Bool_lit of bool
| Hex of string
| Bin of string
| Var of string
| Fn of string * smt_exp list
| Ite of smt_exp * smt_exp * smt_exp
| SignExtend of int * smt_exp
| Extract of int * int * smt_exp
| Tester of string * smt_exp
let extract i j x = Extract (i, j, x)
let bvnot x = Fn ("bvnot", [x])
let bvand x y = Fn ("bvand", [x; y])
let bvor x y = Fn ("bvor", [x; y])
let bvneg x = Fn ("bvneg", [x])
let bvadd x y = Fn ("bvadd", [x; y])
let bvmul x y = Fn ("bvmul", [x; y])
let bvudiv x y = Fn ("bvudiv", [x; y])
let bvurem x y = Fn ("bvurem", [x; y])
let bvshl x y = Fn ("bvshl", [x; y])
let bvlshr x y = Fn ("bvlshr", [x; y])
let bvult x y = Fn ("bvult", [x; y])
let bvzero n =
if n mod 4 = 0 then
Hex (String.concat "" (Util.list_init (n / 4) (fun _ -> "0")))
else
Bin (String.concat "" (Util.list_init n (fun _ -> "0")))
let bvones n =
if n mod 4 = 0 then
Hex (String.concat "" (Util.list_init (n / 4) (fun _ -> "F")))
else
Bin (String.concat "" (Util.list_init n (fun _ -> "1")))
let rec simp_fn = function
| Fn ("not", [Fn ("not", [exp])]) -> exp
| exp -> exp
let rec simp_ite = function
| Ite (cond, Bool_lit true, Bool_lit false) -> cond
| Ite (_, Var v, Var v') when v = v' -> Var v
| exp -> exp
let rec simp_smt_exp vars = function
| Var v ->
begin match Hashtbl.find_opt vars v with
| Some exp -> simp_smt_exp vars exp
| None -> Var v
end
| (Hex _ | Bin _ | Bool_lit _ as exp) -> exp
| Fn (f, exps) ->
let exps = List.map (simp_smt_exp vars) exps in
simp_fn (Fn (f, exps))
| Ite (cond, t, e) ->
let cond = simp_smt_exp vars cond in
let t = simp_smt_exp vars t in
let e = simp_smt_exp vars e in
simp_ite (Ite (cond, t, e))
| Extract (i, j, exp) ->
let exp = simp_smt_exp vars exp in
Extract (i, j, exp)
| Tester (str, exp) ->
let exp = simp_smt_exp vars exp in
Tester (str, exp)
| SignExtend (i, exp) ->
let exp = simp_smt_exp vars exp in
SignExtend (i, exp)
type smt_def =
| Define_fun of string * (string * smt_typ) list * smt_typ * smt_exp
| Declare_const of string * smt_typ
| Define_const of string * smt_typ * smt_exp
| Declare_datatypes of string * (string * (string * smt_typ) list) list
| Declare_tuple of int
| Assert of smt_exp
let declare_datatypes = function
| Datatype (name, ctors) -> Declare_datatypes (name, ctors)
| _ -> assert false
let pp_sfun str docs =
let open PPrint in
parens (separate space (string str :: docs))
let rec pp_smt_exp =
let open PPrint in
function
| Bool_lit b -> string (string_of_bool b)
| Hex str -> string ("#x" ^ str)
| Bin str -> string ("#b" ^ str)
| Var str -> string str
| Fn (str, exps) -> parens (string str ^^ space ^^ separate_map space pp_smt_exp exps)
| Ite (cond, then_exp, else_exp) ->
parens (separate space [string "ite"; pp_smt_exp cond; pp_smt_exp then_exp; pp_smt_exp else_exp])
| Extract (i, j, exp) ->
parens (string (Printf.sprintf "(_ extract %d %d)" i j) ^^ space ^^ pp_smt_exp exp)
| Tester (kind, exp) ->
parens (string (Printf.sprintf "(_ is %s)" kind) ^^ space ^^ pp_smt_exp exp)
| SignExtend (i, exp) ->
parens (string (Printf.sprintf "(_ sign_extend %d)" i) ^^ space ^^ pp_smt_exp exp)
let rec pp_smt_typ =
let open PPrint in
function
| Bool -> string "Bool"
| Bitvec n -> string (Printf.sprintf "(_ BitVec %d)" n)
| Datatype (name, _) -> string name
| Tuple tys -> pp_sfun ("Tup" ^ string_of_int (List.length tys)) (List.map pp_smt_typ tys)
| Array (ty1, ty2) -> pp_sfun "Array" [pp_smt_typ ty1; pp_smt_typ ty2]
let pp_str_smt_typ (str, ty) = let open PPrint in string str ^^ space ^^ pp_smt_typ ty
let pp_smt_def =
let open PPrint in
let open Printf in
function
| Define_fun (str, args, ty, exp) ->
parens (string "define-fun"
^^ space ^^ parens (separate_map space pp_str_smt_typ args)
^^ space ^^ pp_smt_typ ty
^//^ pp_smt_exp exp)
| Declare_const (name, ty) ->
pp_sfun "declare-const" [string name; pp_smt_typ ty]
| Define_const (name, ty, exp) ->
pp_sfun "define-const" [string name; pp_smt_typ ty; pp_smt_exp exp]
| Declare_datatypes (name, ctors) ->
let pp_ctor (ctor_name, fields) =
match fields with
| [] -> parens (string ctor_name)
| _ -> pp_sfun ctor_name (List.map (fun field -> parens (pp_str_smt_typ field)) fields)
in
pp_sfun "declare-datatypes"
[Printf.ksprintf string "((%s 0))" name;
parens (parens (separate_map space pp_ctor ctors))]
| Declare_tuple n ->
let par = separate_map space string (Util.list_init n (fun i -> "T" ^ string_of_int i)) in
let fields = separate space (Util.list_init n (fun i -> Printf.ksprintf string "(tup_%d_%d T%d)" n i i)) in
pp_sfun "declare-datatypes"
[Printf.ksprintf string "((Tup%d %d))" n n;
parens (parens (separate space
[string "par";
parens par;
parens (parens (ksprintf string "tup%d" n ^^ space ^^ fields))]))]
| Assert exp ->
pp_sfun "assert" [pp_smt_exp exp]
let string_of_smt_def def = Pretty_print_sail.to_string (pp_smt_def def)
let output_smt_defs out_chan smt =
List.iter (fun def -> output_string out_chan (string_of_smt_def def ^ "\n")) smt
|
