WP (p.goblint.1.1.1.doc.goblint.lib.Td3.WP)

Parameters

module Arg : Analyses.IncrSolverArg

module S : Analyses.EqConstrSys

module HM : Prelude.Hashtbl.S with type key = S.v

Signature

module Post : sig ... end

include sig ... end

module GU = Goblintutil

val stack_d : int Prelude.ref

val full_trace : bool

val start_c : int

val max_c : int Prelude.ref

val max_var : S.Var.t option Prelude.ref

val histo : int HM.t

val increase : S.Var.t -> unit

val start_event : unit -> unit

val stop_event : unit -> unit

val new_var_event : S.Var.t -> unit

val get_var_event : S.Var.t -> unit

val eval_rhs_event : S.Var.t -> unit

val update_var_event : S.Var.t -> S.Dom.t -> S.Dom.t -> unit

val print_solver_stats : (unit -> unit) Prelude.ref

val ncontexts : int Prelude.ref

val print_context_stats : 'a HM.t -> unit

val stats_csv : unit BatIO.output option

val write_csv : string list -> unit BatIO.output -> unit

val print_stats : 'a -> unit

module VS : sig ... end

type solver_data = {

mutable st : (S.Var.t * S.Dom.t) list;
mutable infl : VS.t HM.t;
mutable sides : VS.t HM.t;
mutable rho : S.Dom.t HM.t;
mutable wpoint : unit HM.t;
mutable stable : unit HM.t;

}

type marshal = solver_data

val create_empty_data : unit -> solver_data

val clear_data : solver_data -> unit

val print_data : solver_data -> string -> unit

val exists_key : (HM.key -> bool) -> 'a HM.t -> bool

module P : sig ... end

module HPM : sig ... end

type phase =

| Widen
| Narrow

val solve : 
  (S.Var.t -> S.Dom.t -> S.Dom.t -> S.Dom.t) ->
  (S.Var.t * S.Dom.t) list ->
  PostSolver.ListArgFromStdArg(S)(HM)(Arg).S.v list ->
  S.Dom.t HM.t * solver_data