type t
val compare : t -> t -> intval equal : t -> t -> bool
val pp : F.formatter -> t -> unitval pp_mark : markup:bool -> F.formatter -> t -> unitval mone : tval zero : tval nat : tval pos : t1, +oo
val of_int : int -> tval lb : t -> Bound.tval ub : t -> Bound.tval is_finite : t -> boolval is_invalid : t -> boolval is_lb_infty : t -> boolval is_nat : t -> boolval is_symbolic : t -> boolval is_top : t -> boolval is_zero : t -> boolval is_one : t -> boolval is_ge_zero : t -> boolval is_le_zero : t -> boolval is_le_mone : t -> boolval leq : lhs:t -> rhs:t -> boolval have_similar_bounds : t -> t -> boolval has_infty : t -> boolval has_void_ptr_symb : t -> boolval make_positive : t -> tval join : t -> t -> tval le_sem : t -> t -> BO.Boolean.tval lt_sem : t -> t -> BO.Boolean.tval widen : prev:t -> next:t -> num_iters:int -> tval xcompare : lhs:t -> rhs:t -> [ `Equal | `LeftSmallerThanRight | `RightSmallerThanLeft | `NotComparable | `LeftSubsumesRight | `RightSubsumesLeft ]val get_symbols : t -> SymbolSet.tval subst : t -> Bound.eval_sym -> t Absint.AbstractDomain.Types.bottom_liftedval neg : t -> tval plus : t -> t -> tval minus : t -> t -> tval succ : t -> tval mult : t -> t -> tval exists_str : f:(string -> bool) -> t -> boolval of_int_lit : IR.IntLit.t -> tval of_foreign_id : int -> tval get_bound : t -> BO.Symb.BoundEnd.t -> Bound.tval arith_binop : IR.Binop.t -> t -> t -> tval arith_unop : IR.Unop.t -> t -> t optionval to_boolean : t -> BO.Boolean.tval prune_binop : IR.Binop.t -> t -> t -> t Absint.AbstractDomain.Types.bottom_lifted