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
(* SPDX-License-Identifier: MIT *)
(* Copyright (C) 2023-2024 formalsec *)
(* Written by the Smtml programmers *)
include Mappings_intf
module type S = sig
type t
type solver
(** Time spent inside SMT solver. *)
val solver_time : float ref
(** Number of queries to the SMT solver. *)
val solver_count : int ref
(** Print solver statistics. *)
val pp_statistics : t Fmt.t
(** [create ?params ?logic ()] creates a new solver.
[?params] is of type {!type:Params.t} and is used to modify/set parameters
inside the solver.
[?logic] is of type {!type:Ty.logic} and is used to set the theory of the
assertions used. When knowing what the underlying theory is going to be,
setting this parameter can help the SMT solver be more performant. The
default logic is {e unknown_theory}. *)
val create : ?params:Params.t -> ?logic:Ty.logic -> unit -> t
(** Interrupt solver. *)
val interrupt : t -> unit
(** Clone a given solver. *)
val clone : t -> t
(** Create a backtracking point. *)
val push : t -> unit
(** [pop solver n] backtracks [n] backtracking points. *)
val pop : t -> int -> unit
(** Resets the solver, i.e., remove all assertions from the solver. *)
val reset : t -> unit
(** Assert one or multiple constraints into the solver. *)
val add : t -> Expr.t list -> unit
(** Same as [add] but receives and Expr.Set.t *)
val add_set : t -> Expr.Set.t -> unit
(** The set of assertions in the solver. *)
val get_assertions : t -> Expr.t list
[@@deprecated "Please use 'get_statistics' instead"]
val get_statistics : t -> Statistics.t
(** [check solver es] checks the satisfiability of the assertions in the
solver using the assumptions in [es]. *)
val check : t -> Expr.t list -> satisfiability
(** Same as [check] but receives an Expr.Set.t *)
val check_set : t -> Expr.Set.t -> satisfiability
(** [get_value solver e] get an expression denoting the model value of a given
expression.
Requires that the last {!val:check} query returned [true]. *)
val get_value : t -> Expr.t -> Expr.t
(** The model of the last [check].
The result is [None] if [check] was not invoked before, or its result was
not [Satisfiable]. *)
val model : ?symbols:Symbol.t list -> t -> Model.t option
end
module type Intf = sig
type nonrec satisfiability = satisfiability
module type S = S
(** The Encoding module defines two types of solvers: {!module:Batch} and
{!module:Incremental}. The generic definition of these solvers is
presented here, and they are parametric on the mappings of the underlying
SMT solver. This design allows for the creation of portable solvers that
can be used with various SMT solvers implementing
{!module-type:Mappings_intf.S}.
{1 Batch Mode}
In this module, constraints are handled in a 'batch' mode, meaning that
the solver delays all interactions with the underlying SMT solver until it
becomes necessary. It essentially communicates with the underlying solver
only when a call to {!val:Solver_intf.S.check},
{!val:Solver_intf.S.get_value}, or {!val:Solver_intf.S.model} is made. *)
(** {!module:Batch} is parameterized by the mapping module [M] implementing
{!module-type:Mappings_intf.S}. In this mode, the solver delays all
interactions with the underlying SMT solver until it becomes necessary. *)
module Batch (_ : Mappings_intf.S) : S
(** {1 Incremental Model}
(Experimental) Like the Batch mode described above, but queries are cached *)
module Cached (_ : Mappings_intf.S) : sig
include S
module Cache : Cache_intf.S
end
(** {1 Incremental Model}
In the Incremental module, constraints are managed incrementally,
signifying that upon their addition to the solver, this module promptly
communicates with the underlying SMT solver. Unlike the batch solver,
nearly every interaction with this solver prompts a corresponding
interaction with the underlying SMT solver. *)
(** The {!module:Incremental} module, akin to {!module:Batch}, presents a
solver parameterized by the mapping module [M]. In this mode, the
Incremental solver engages with the underlying SMT solver in nearly every
interaction. *)
module Incremental (_ : Mappings_intf.S) : S
end