Module ApronDomain.DWithOps

Parameters

module Man : Manager
module D : SLattice with type t = Man.mt A.t

Signature

include module type of struct include D end
include SPrintable with type t = Man.mt A.t
include Printable.S with type t = Man.mt A.t
val top_env : GobApron.Environment.t -> {t}156
val bot_env : GobApron.Environment.t -> {t}156
val is_top_env : {t}156 -> bool
val is_bot_env : {t}156 -> bool
include Lattice.S with type t := {t}152
include Lattice.PO with type t := {t}152
include Printable.S with type t := {t}152
val equal : {t}152 -> {t}152 -> bool
val hash : {t}152 -> int
val compare : {t}152 -> {t}152 -> int
val show : {t}152 -> string
val pretty : unit -> {t}152 -> Printable.Pretty.doc
val printXml : 'a BatInnerIO.output -> {t}152 -> unit
val name : unit -> string
val to_yojson : {t}152 -> Yojson.Safe.t
val tag : {t}152 -> int

Unique ID, given by HConsed, for context identification in witness

val arbitrary : unit -> {t}152 QCheck.arbitrary
val relift : {t}152 -> {t}152
val leq : {t}152 -> {t}152 -> bool
val join : {t}152 -> {t}152 -> {t}152
val meet : {t}152 -> {t}152 -> {t}152
val widen : {t}152 -> {t}152 -> {t}152

widen x y assumes leq x y. Solvers guarantee this by calling widen old (join old new).

val narrow : {t}152 -> {t}152 -> {t}152
val pretty_diff : unit -> ({t}152 * {t}152) -> Lattice.Pretty.doc

If leq x y = false, then pretty_diff () (x, y) should explain why.

include Lattice.Bot with type t := {t}152
val bot : unit -> {t}152
val is_bot : {t}152 -> bool
include Lattice.Top with type t := {t}152
val top : unit -> {t}152
val is_top : {t}152 -> bool
include sig ... end
module AO0 : sig ... end
module Bounds = AO0.Bounds
module Arg = AO0.Arg
module Convert = AO0.Convert
type var = GobApron.Var.t
val env : 'a A.t -> Apron.Environment.t
val copy : Man.mt A.t -> Man.mt A.t
type marshal = Man.mt Goblint_lib__.GobApron.Abstract0.t * string array
val unmarshal : marshal -> Man.mt A.t
val vars : 'a A.t -> Apron.Var.t list
val marshal : Man.mt A.t -> marshal
val mem_var : 'a A.t -> Apron.Var.t -> bool
val envop : (Apron.Environment.t -> 'a -> Apron.Environment.t) -> Man.mt A.t -> 'b -> unit
val add_vars_with : Man.mt A.t -> Apron.Var.t list -> unit
val remove_vars_with : Man.mt A.t -> Apron.Var.t list -> unit
val remove_filter_with : Man.mt A.t -> (Apron.Var.t -> bool) -> unit
val keep_vars_with : Man.mt A.t -> Apron.Var.t list -> unit
val keep_filter_with : Man.mt A.t -> (Apron.Var.t -> bool) -> unit
val forget_vars_with : Man.mt A.t -> Apron.Var.t list -> unit
val assign_exp_with : Queries.ask -> Bounds.t -> Apron.Var.t -> GoblintCil.Cil.exp -> bool Stdlib.Lazy.t -> unit
val assign_exp_parallel_with : Queries.ask -> Man.mt A.t -> (Apron.Var.t * GoblintCil.Cil.exp) list -> bool -> unit
val assign_var_with : Man.mt A.t -> Apron.Var.t -> Apron.Var.t -> unit
val assign_var_parallel_with : Man.mt A.t -> (Apron.Var.t * Apron.Var.t) list -> unit
val assign_var_parallel' : Man.mt A.t -> Apron.Var.t list -> Apron.Var.t list -> Man.mt A.t
val substitute_exp_with : Queries.ask -> Bounds.t -> Apron.Var.t -> GoblintCil.Cil.exp -> bool Stdlib.Lazy.t -> unit
val substitute_exp_parallel_with : Queries.ask -> Man.mt A.t -> (Apron.Var.t * GoblintCil.Cil.exp) list -> bool Stdlib.Lazy.t -> unit
val substitute_var_with : Man.mt A.t -> Apron.Var.t -> Apron.Var.t -> unit
val meet_tcons : 'a -> Man.mt A.t -> GobApron.Tcons1.t -> 'b -> Man.mt A.t
val to_lincons_array : Man.mt A.t -> Apron.Lincons1.earray
val of_lincons_array : Apron.Lincons1.earray -> Man.mt A.t
val unify : Man.mt A.t -> Man.mt A.t -> Man.mt A.t
val cil_exp_of_lincons1 : GobApron.Lincons1.t -> GoblintCil.Cil.exp option
type t = AO0.t
val add_vars : t -> GobApron.Var.t list -> t
val remove_vars : t -> GobApron.Var.t list -> t
val remove_filter : t -> (GobApron.Var.t -> bool) -> t
val keep_vars : t -> GobApron.Var.t list -> t
val keep_filter : t -> (GobApron.Var.t -> bool) -> t
val forget_vars : t -> GobApron.Var.t list -> t
val assign_exp : Queries.ask -> t -> GobApron.Var.t -> GoblintCil.exp -> bool Stdlib.Lazy.t -> t
val assign_var : t -> GobApron.Var.t -> GobApron.Var.t -> t
val substitute_exp : Queries.ask -> t -> GobApron.Var.t -> GoblintCil.exp -> bool Stdlib.Lazy.t -> t
include module type of struct include SharedFunctions.Tracked end
val type_tracked : GoblintCil.typ -> bool
val varinfo_tracked : GoblintCil.varinfo -> bool
val eval_interval : 'a -> Man.mt A.t -> Apron.Texpr1.t -> Z.t option * Z.t option
val assert_constraint : Queries.ask -> AO0.Bounds.t -> GoblintCil.exp -> bool -> bool Stdlib.Lazy.t -> {t}15

Assert a constraint expression.

LAnd, LOr, LNot are directly supported by Apron domain in order to confirm logic-containing Apron invariants from witness while deep-query is disabled

val invariant : Man.mt A.t -> GobApron.Lincons1.t list