package goblint

  1. Overview
  2. Docs

Module OctagonMapDomain.MapOctagonBot

include Lattice.S
include Lattice.PO
include Printable.S
type t
val equal : t -> t -> bool
val hash : t -> int
val compare : t -> t -> int
val show : t -> string
val pretty : unit -> t -> Pretty.doc
val printXml : 'a BatInnerIO.output -> t -> unit
val name : unit -> string
val to_yojson : t -> Printable.json
val invariant : Invariant.context -> t -> Invariant.t
val tag : t -> int

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

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

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

val narrow : t -> t -> t
val pretty_diff : unit -> (t * t) -> Pretty.doc

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

val bot : unit -> t
val is_bot : t -> bool
val top : unit -> t
val is_top : t -> bool
type key = BV.t
val set_constraint : (key * (bool * key) option * CT.side * OctagonDomain.BI.t) -> t -> t
val adjust : key -> OctagonDomain.BI.t -> t -> t
val erase : key -> t -> t
val projection : key -> (bool * key) option -> t -> OctagonDomain.INV.t
val strong_closure : t -> t
val map_to_matrix : t -> OctagonDomain.elt array array * (BV.t, int) Hashtbl.t
val matrix_to_map : OctagonDomain.elt array array -> (BV.t, int) Hashtbl.t -> t
val get_relation : Cil.varinfo -> Cil.varinfo -> t -> OctagonDomain.INV.t option * OctagonDomain.INV.t option * bool
val keep_only : Cil.varinfo list -> t -> t