mlw_wp.ml 27.6 KB
Newer Older
Andrei Paskevich's avatar
Andrei Paskevich committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
(**************************************************************************)
(*                                                                        *)
(*  Copyright (C) 2010-2012                                               *)
(*    François Bobot                                                      *)
(*    Jean-Christophe Filliâtre                                           *)
(*    Claude Marché                                                       *)
(*    Guillaume Melquiond                                                 *)
(*    Andrei Paskevich                                                    *)
(*                                                                        *)
(*  This software is free software; you can redistribute it and/or        *)
(*  modify it under the terms of the GNU Library General Public           *)
(*  License version 2.1, with the special exception on linking            *)
(*  described in file LICENSE.                                            *)
(*                                                                        *)
(*  This software is distributed in the hope that it will be useful,      *)
(*  but WITHOUT ANY WARRANTY; without even the implied warranty of        *)
(*  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.                  *)
(*                                                                        *)
(**************************************************************************)

open Why3
open Ident
open Ty
open Term
25
open Decl
Andrei Paskevich's avatar
Andrei Paskevich committed
26 27 28 29 30
open Theory
open Mlw_ty
open Mlw_ty.T
open Mlw_expr

31 32
let debug = Debug.register_flag "whyml_wp"

33
(** Marks *)
Andrei Paskevich's avatar
Andrei Paskevich committed
34 35 36 37

let ts_mark = create_tysymbol (id_fresh "'mark") [] None
let ty_mark = ty_app ts_mark []

38 39 40
let vtv_mark = vty_value (ity_pur ts_mark [])

let fresh_mark () = create_vsymbol (id_fresh "'mark") ty_mark
41

Andrei Paskevich's avatar
Andrei Paskevich committed
42 43 44 45 46 47 48 49
let fs_at =
  let ty = ty_var (create_tvsymbol (id_fresh "a")) in
  create_lsymbol (id_fresh "at") [ty; ty_mark] (Some ty)

let fs_old =
  let ty = ty_var (create_tvsymbol (id_fresh "a")) in
  create_lsymbol (id_fresh "old") [ty] (Some ty)

50 51
let th_mark_at =
  let uc = create_theory (id_fresh "WP builtins: at") in
Andrei Paskevich's avatar
Andrei Paskevich committed
52 53
  let uc = add_ty_decl uc ts_mark in
  let uc = add_param_decl uc fs_at in
54 55 56 57 58
  close_theory uc

let th_mark_old =
  let uc = create_theory (id_fresh "WP builtins: old") in
  let uc = use_export uc th_mark_at in
Andrei Paskevich's avatar
Andrei Paskevich committed
59 60 61
  let uc = add_param_decl uc fs_old in
  close_theory uc

Andrei Paskevich's avatar
Andrei Paskevich committed
62 63 64
let fs_now = create_lsymbol (id_fresh "'now") [] (Some ty_mark)
let t_now = fs_app fs_now [] ty_mark
let e_now = e_lapp fs_now [] (ity_pur ts_mark [])
Andrei Paskevich's avatar
Andrei Paskevich committed
65

66 67 68 69 70
(* [vs_old] appears in the postconditions given to the core API,
   which expects every vsymbol to be a pure part of a pvsymbol *)
let pv_old = create_pvsymbol (id_fresh "'old") vtv_mark
let vs_old = pv_old.pv_vs
let t_old  = t_var vs_old
71

72 73
let ls_absurd = create_lsymbol (id_fresh "absurd") [] None
let t_absurd  = ps_app ls_absurd []
74

75
let mk_t_if f = t_if f t_bool_true t_bool_false
76
let to_term t = if t.t_ty = None then mk_t_if t else t
77

78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94
(* any vs in post/xpost is either a pvsymbol or a fresh mark *)
let vtv_of_vs vs =
  try (restore_pv vs).pv_vtv with UnboundVar _ -> vtv_mark

(* replace every occurrence of [old(t)] with [at(t,'old)] *)
let rec remove_old f = match f.t_node with
  | Tapp (ls,[t]) when ls_equal ls fs_old ->
      t_app fs_at [remove_old t; t_old] f.t_ty
  | _ -> t_map remove_old f

(* FIXME? Do we need this? *)
(* replace every occurrence of [at(t,'now)] with [t] *)
let rec remove_at f = match f.t_node with
  | Tapp (ls, [t; { t_node = Tapp (fs,[]) }])
    when ls_equal ls fs_at && ls_equal fs fs_now -> remove_at t
  | _ -> t_map remove_at f

95 96 97 98
(* replace [at(t,'old)] with [at(t,lab)] everywhere in formula [f] *)
let old_mark lab t = t_subst_single vs_old (t_var lab) t

(* replace [at(t,lab)] with [at(t,'now)] everywhere in formula [f] *)
Andrei Paskevich's avatar
Andrei Paskevich committed
99 100 101 102 103 104 105
let erase_mark lab t = t_subst_single lab t_now t

(* TODO: explain this *)
let relativize fn q xq =
  let lab = fresh_mark () in
  let f = fn (old_mark lab q) (Mexn.map (old_mark lab) xq) in
  erase_mark lab f
106

107 108 109 110 111 112
(* replace [at(t,now)] with [t] modulo variable renaming *)
let rec drop_at now m t = match t.t_node with
  | Tvar vs when now ->
      begin try t_var (Mvs.find vs m) with Not_found -> t end
  | Tapp (ls, _) when ls_equal ls fs_old ->
      assert false
Andrei Paskevich's avatar
Andrei Paskevich committed
113 114 115 116 117 118 119
  | Tapp (ls, [e; mark]) when ls_equal ls fs_at ->
      begin match mark.t_node with
        | Tvar vs when vs_equal vs vs_old -> assert false
        | Tapp (ls,[]) when ls_equal ls fs_now -> drop_at true m e
        (* no longer assume that unmarked variables are at 'now *)
        | _ -> t_map (drop_at false m) t
      end
120 121 122 123 124 125 126 127
  | Tlet _ | Tcase _ | Teps _ | Tquant _ ->
      (* do not open unless necessary *)
      let m = Mvs.set_inter m t.t_vars in
      if Mvs.is_empty m then t else
      t_map (drop_at now m) t
  | _ ->
      t_map (drop_at now m) t

128 129 130
(** Specifications *)

let psymbol_spec_t : type_v Wps.t = Wps.create 17
131
let e_apply_spec_t : type_c Wexpr.t = Wexpr.create 17
132

133 134 135
let add_pv_varm pv m = Mid.add pv.pv_vs.vs_name pv.pv_vtv.vtv_vars m
let add_pv_vars pv s = vars_union pv.pv_vtv.vtv_vars s

136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151
let rec check_spec vty tyv = match vty, tyv with
  | VTvalue _, SpecV _ -> ()
  | VTarrow vta, SpecA (_::(_::_ as pvl), tyc) ->
      assert (eff_is_empty vta.vta_effect);
      check_spec vta.vta_result (SpecA (pvl, tyc))
  | VTarrow vta, SpecA ([_], tyc) ->
      let eff1 = vta.vta_effect in
      let eff2 = tyc.c_effect in
      assert (Sreg.equal eff1.eff_reads  eff2.eff_reads);
      assert (Sreg.equal eff1.eff_writes eff2.eff_writes);
      assert (Sexn.equal eff1.eff_raises eff2.eff_raises);
      assert (Sreg.equal eff1.eff_ghostr eff2.eff_ghostr);
      assert (Sreg.equal eff1.eff_ghostw eff2.eff_ghostw);
      assert (Sexn.equal eff1.eff_ghostx eff2.eff_ghostx);
      check_spec vta.vta_result tyc.c_result
  | _ -> assert false
152

153
let rec filter_v varm vars = function
154 155 156
  | SpecA (pvl, tyc) ->
      let varm = List.fold_right add_pv_varm pvl varm in
      let vars = List.fold_right add_pv_vars pvl vars in
157
      SpecA (pvl, filter_c varm vars tyc)
158 159
  | tyv -> tyv

160 161 162 163 164 165 166 167
and filter_c varm vars tyc =
  let add _ f s = Mvs.set_union f.t_vars s in
  let vss = add () tyc.c_pre tyc.c_post.t_vars in
  let vss = Mexn.fold add tyc.c_xpost vss in
  let check { vs_name = id } _ = if not (Mid.mem id varm) then
    Loc.errorm "Local variable %s escapes from its scope" id.id_string in
  Mvs.iter check vss;
  let result = filter_v varm vars tyc.c_result in
168 169 170
  let effect = eff_filter vars tyc.c_effect in
  { tyc with c_effect = effect; c_result = result }

171
let add_psymbol_spec varm ps tyv =
172
  let vars = Mid.fold (fun _ -> vars_union) varm vars_empty in
173 174 175 176
  let tyv = filter_v varm vars tyv in
  if Debug.test_flag debug then
    Format.eprintf "@[<hov 2>SPEC %a = %a@]@\n"
      Mlw_pretty.print_psty ps Mlw_pretty.print_type_v tyv;
177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217
  check_spec (VTarrow ps.ps_vta) tyv; (* TODO: prove and remove *)
  Wps.set psymbol_spec_t ps tyv

(* TODO? move spec_inst and subst to Mlw_expr? *)
let vtv_full_inst sbs vtv =
  vty_value ~ghost:vtv.vtv_ghost (ity_full_inst sbs vtv.vtv_ity)

let pv_full_inst sbs pv =
  create_pvsymbol (id_clone pv.pv_vs.vs_name) (vtv_full_inst sbs pv.pv_vtv)

let rec spec_inst_v sbs tvm vsm = function
  | SpecV vtv ->
      SpecV (vtv_full_inst sbs vtv)
  | SpecA (pvl,tyc) ->
      let add m pv =
        let nv = pv_full_inst sbs pv in
        Mvs.add pv.pv_vs (t_var nv.pv_vs) m, nv in
      let vsm, pvl = Util.map_fold_left add vsm pvl in
      SpecA (pvl, spec_inst_c sbs tvm vsm tyc)

and spec_inst_c sbs tvm vsm tyc =
  let subst = t_ty_subst tvm vsm in {
    c_pre    = subst tyc.c_pre;
    c_effect = eff_full_inst sbs tyc.c_effect;
    c_result = spec_inst_v sbs tvm vsm tyc.c_result;
    c_post   = subst tyc.c_post;
    c_xpost  = Mexn.map subst tyc.c_xpost; }

let rec subst_v pv t = function
  | SpecA (pvl,tyc) when not (List.exists (pv_equal pv) pvl) ->
      SpecA (pvl, subst_c pv t tyc)
  | tyv -> tyv

and subst_c pv t tyc =
  let subst = t_subst (Mvs.singleton pv.pv_vs t) in {
    c_pre    = subst tyc.c_pre;
    c_effect = tyc.c_effect;
    c_result = subst_v pv t tyc.c_result;
    c_post   = subst tyc.c_post;
    c_xpost  = Mexn.map subst tyc.c_xpost; }

218 219 220 221 222 223 224 225 226
let spec_lambda l tyv =
  let tyc = {
    c_pre    = l.l_pre;
    c_effect = l.l_expr.e_effect;
    c_result = tyv;
    c_post   = l.l_post;
    c_xpost  = l.l_xpost } in
  SpecA (l.l_args, tyc)

227
let spec_val vd = match vd.val_name with
228
  | LetA ps -> add_psymbol_spec vd.val_vars ps vd.val_spec
229 230
  | LetV _  -> ()

231 232 233
let rec spec_let { let_var = lv; let_expr = e } = match lv with
  | LetA ps -> add_psymbol_spec e.e_vars ps (spec_expr e)
  | LetV _  -> ignore (spec_expr e)
234

235
and spec_rec rdl =
236 237 238 239 240
  let add_vars m rd = Mid.set_union m rd.rec_vars in
  let vars = List.fold_left add_vars Mid.empty rdl in
  let add_early_spec rd = match rd.rec_lambda.l_expr.e_vty with
    | VTvalue vtv ->
        let tyv = spec_lambda rd.rec_lambda (SpecV vtv) in
241
        add_psymbol_spec rd.rec_vars rd.rec_ps tyv
242 243 244 245 246 247
    | VTarrow _ when Mid.mem rd.rec_ps.ps_name vars ->
        Loc.errorm ?loc:rd.rec_lambda.l_expr.e_loc
          "The body of a recursive function must be a first-order value"
    | VTarrow _ -> () in
  List.iter add_early_spec rdl;
  let add_late_spec rd =
248
    let tyv = spec_expr rd.rec_lambda.l_expr in
249 250 251
    match rd.rec_lambda.l_expr.e_vty with
    | VTarrow _ ->
        let tyv = spec_lambda rd.rec_lambda tyv in
252
        add_psymbol_spec rd.rec_vars rd.rec_ps tyv
253 254 255
    | VTvalue _ -> () in
  List.iter add_late_spec rdl

256
and spec_expr e = match e.e_node with
257 258 259 260
  | Elogic _
  | Eassert _
  | Eabsurd -> SpecV (vtv_of_expr e)
  | Evalue pv -> SpecV pv.pv_vtv
261 262 263 264
  | Earrow ps ->
    (* TODO: a ps may not be in the table, if it comes from a module
       for which we never computed WPs. Pass the known_map to spec_expr
       and compute it now. *)
265
      let sbs = vta_vars_match ps.ps_subst ps.ps_vta (vta_of_expr e) in
266 267 268 269
      let tvm = Mtv.map ty_of_ity sbs.ity_subst_tv in
      let tyv = Wps.find psymbol_spec_t ps in
      spec_inst_v sbs tvm Mvs.empty tyv
  | Eapp (e1,pv) ->
270 271
      let tyv = spec_expr e1 in
      let t = t_var pv.pv_vs in
272 273 274 275 276 277 278 279 280 281 282 283
      begin match tyv with
        | SpecA ([pv],tyc) ->
            let tyc = subst_c pv t tyc in
            (* we will use this for WP *)
            Wexpr.set e_apply_spec_t e tyc;
            tyc.c_result
        | SpecA (pv::pvl,tyc) ->
            (* pv cannot occur in pvl *)
            SpecA (pvl, subst_c pv t tyc)
        | _ -> assert false
      end
  | Elet (ld,e1) ->
284 285
      spec_let ld;
      spec_expr e1
286
  | Erec (rdl,e1) ->
287 288 289
      spec_rec rdl;
      spec_expr e1
  | Eghost e1 -> spec_expr e1
290 291 292 293 294 295
  | Eany tyc -> tyc.c_result
  | Eassign (e1,_,_)
  | Eloop (_,_,e1)
  | Efor (_,_,_,e1)
  | Eraise (_,e1)
  | Eabstr (e1,_,_) ->
296
      ignore (spec_expr e1);
297 298
      SpecV (vtv_of_expr e)
  | Eif (e1,e2,e3) ->
299 300 301
      ignore (spec_expr e1);
      ignore (spec_expr e2);
      spec_expr e3
302
  | Ecase (e1,bl) ->
303 304
      ignore (spec_expr e1);
      List.iter (fun (_,e) -> ignore (spec_expr e)) bl;
305 306
      SpecV (vtv_of_expr e)
  | Etry (e1,bl) ->
307 308
      ignore (spec_expr e1);
      List.iter (fun (_,_,e) -> ignore (spec_expr e)) bl;
309 310
      SpecV (vtv_of_expr e)

311
(** WP utilities *)
312 313 314 315 316 317 318 319 320 321 322

let ty_of_vty = function
  | VTvalue vtv -> ty_of_ity vtv.vtv_ity
  | VTarrow _   -> ty_unit

let default_exn_post xs _ =
  let vs = create_vsymbol (id_fresh "result") (ty_of_ity xs.xs_ity) in
  create_post vs t_true

let default_post vty ef =
  let vs = create_vsymbol (id_fresh "result") (ty_of_vty vty) in
323
  create_post vs t_true, Mexn.mapi default_exn_post ef.eff_raises
324

325 326 327 328 329
let wp_label e f =
  let loc = if f.t_loc = None then e.e_loc else f.t_loc in
  let lab = Ident.Slab.union e.e_label f.t_label in
  t_label ?loc lab f

Andrei Paskevich's avatar
Andrei Paskevich committed
330
let expl_pre    = Ident.create_label "expl:precondition"
331 332
let expl_post   = Ident.create_label "expl:normal postcondition"
let expl_xpost  = Ident.create_label "expl:exceptional postcondition"
Andrei Paskevich's avatar
Andrei Paskevich committed
333 334
let expl_assert = Ident.create_label "expl:assertion"
let expl_check  = Ident.create_label "expl:check"
335

336 337
let wp_expl l f =
  let lab = Slab.add Split_goal.stop_split f.t_label in
338
  t_label ?loc:f.t_loc (Slab.add l lab) f
339

340
let wp_and ~sym f1 f2 =
341 342
  if sym then t_and_simp f1 f2 else t_and_asym_simp f1 f2

343
let wp_ands ~sym fl =
344 345
  if sym then t_and_simp_l fl else t_and_asym_simp_l fl

346
let wp_implies f1 f2 = t_implies_simp f1 f2
347

348 349 350 351
let wp_forall vl f = t_forall_close_simp vl [] f

let wp_let v t f = t_let_close_simp v t f

352 353 354
let regs_of_reads  eff = Sreg.union eff.eff_reads eff.eff_ghostr
let regs_of_writes eff = Sreg.union eff.eff_writes eff.eff_ghostw
let regs_of_effect eff = Sreg.union (regs_of_reads eff) (regs_of_writes eff)
Andrei Paskevich's avatar
Andrei Paskevich committed
355
let exns_of_raises eff = Sexn.union eff.eff_raises eff.eff_ghostx
356

357 358
let fs_void = fs_tuple 0
let t_void = fs_app fs_void [] ty_unit
359 360 361 362 363 364 365 366 367 368 369 370

let open_unit_post q =
  let v, q = open_post q in
  t_subst_single v t_void q

let create_unit_post =
  let v = create_vsymbol (id_fresh "void") ty_unit in
  fun q -> create_post v q

let vs_result e =
  create_vsymbol (id_fresh ?loc:e.e_loc "result") (ty_of_vty e.e_vty)

371
(* TODO: put this into abstract/opaque wp, it's only relevant there *)
372 373
(*
match f.t_node with
374 375 376 377 378 379 380 381 382 383 384
  | Tbinop (Timplies, {t_node = Tapp (s,[{t_node = Tvar u};r])},h)
    when ls_equal s ps_equ && vs_equal u v && not (Mvs.mem v r.t_vars) ->
      t_let_close_simp v r h
  | Tbinop (Timplies, {t_node = Tbinop (Tand, g,
                      {t_node = Tapp (s,[{t_node = Tvar u};r])})},h)
    when ls_equal s ps_equ && vs_equal u v && not (Mvs.mem v r.t_vars) ->
      t_let_close_simp v r (t_implies_simp g h)
  | _ when Mvs.mem v f.t_vars ->
      t_forall_close_simp [v] [] f
  | _ ->
      f
385
*)
386

387 388 389 390 391 392 393
(** WP state *)

type wp_env = {
  prog_known : Mlw_decl.known_map;
  pure_known : Decl.known_map;
  global_env : Env.env;
}
394

395 396
(** Reconstruct pure values after writes *)

397
let find_constructors env sts ity = match ity.ity_node with
398 399 400
  | Itypur (ts,_) ->
      let base = ity_pur ts (List.map ity_var ts.ts_args) in
      let sbs = ity_match ity_subst_empty base ity in
401
      let csl = Decl.find_constructors env.pure_known ts in
402 403 404 405 406 407 408 409
      if csl = [] || Sts.mem ts sts then Loc.errorm
        "Cannot update values of type %a" Mlw_pretty.print_ity base;
      let subst ty = ity_full_inst sbs (ity_of_ty ty), None in
      let cnstr (cs,_) = cs, List.map subst cs.ls_args in
      Sts.add ts sts, List.map cnstr csl
  | Ityapp (its,_,_) ->
      let base = ity_app its (List.map ity_var its.its_args) its.its_regs in
      let sbs = ity_match ity_subst_empty base ity in
410
      let csl = Mlw_decl.find_constructors env.prog_known its in
411 412 413 414 415 416 417 418 419
      if csl = [] || Sts.mem its.its_pure sts then Loc.errorm
        "Cannot update values of type %a" Mlw_pretty.print_ity base;
      let subst vtv =
        ity_full_inst sbs vtv.vtv_ity,
        Util.option_map (reg_full_inst sbs) vtv.vtv_mut in
      let cnstr (cs,_) = cs.pl_ls, List.map subst cs.pl_args in
      Sts.add its.its_pure sts, List.map cnstr csl
  | Ityvar _ -> assert false

420
let update_var env mreg vs =
421 422 423 424 425 426 427 428 429
  let rec update sts vs ity mut =
    (* are we a mutable variable? *)
    let get_vs r = Mreg.find_def vs r mreg in
    let vs = Util.option_apply vs get_vs mut in
    (* should we update our value further? *)
    let check_reg r _ = reg_occurs r ity.ity_vars in
    if ity_pure ity || not (Mreg.exists check_reg mreg) then
      t_var vs
    else
430
      let sts, csl = find_constructors env sts ity in
431 432 433 434 435 436 437 438 439
      let branch (cs,ityl) =
        let mk_var (ity,_) = create_vsymbol (id_fresh "y") (ty_of_ity ity) in
        let vars = List.map mk_var ityl in
        let pat = pat_app cs (List.map pat_var vars) vs.vs_ty in
        let mk_arg vs (ity, mut) = update sts vs ity mut in
        let t = fs_app cs (List.map2 mk_arg vars ityl) vs.vs_ty in
        t_close_branch pat t in
      t_case (t_var vs) (List.map branch csl)
  in
440
  let vtv = vtv_of_vs vs in
441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
  update Sts.empty vs vtv.vtv_ity vtv.vtv_mut

(* quantify over all references in eff
   eff : effect
   f   : formula

   let eff = { rho1, ..., rhon }
   we collect in vars all variables involving these regions
   let vars = { v1, ..., vm }

     forall r1:ty(rho1). ... forall rn:ty(rhon).
     let v'1 = update v1 r1...rn in
     ...
     let v'm = update vm r1...rn in
     f[vi <- v'i]
*)

let model1_lab = Slab.singleton (create_label "model:1")
let model2_lab = Slab.singleton (create_label "model:quantify(2)")
460 461
let model3_lab = Slab.singleton (create_label "model:cond")

462 463
let mk_var id label ty = create_vsymbol (id_clone ~label id) ty

464 465
let quantify env regs f =
  (* mreg : updated region -> vs *)
466
  let get_var reg () =
467
    let test vs _ id = match vtv_of_vs vs with
468 469 470 471 472 473
      | { vtv_ity = { ity_node = Ityapp (_,_,[r]) }}
      | { vtv_mut = Some r } when reg_equal r reg -> vs.vs_name
      | _ -> id in
    let id = Mvs.fold test f.t_vars reg.reg_name in
    mk_var id model1_lab (ty_of_ity reg.reg_ity)
  in
474
  let mreg = Mreg.mapi get_var regs in
475
  (* update all program variables involving these regions *)
476
  let update_var vs _ = match update_var env mreg vs with
477 478 479 480 481 482 483
    | { t_node = Tvar nv } when vs_equal vs nv -> None
    | t -> Some t in
  let vars = Mvs.mapi_filter update_var f.t_vars in
  (* vv' : old vs -> new vs *)
  let new_var vs _ = mk_var vs.vs_name model2_lab vs.vs_ty in
  let vv' = Mvs.mapi new_var vars in
  (* quantify *)
484
  let update v t f = wp_let (Mvs.find v vv') t f in
485
  let f = Mvs.fold update vars (drop_at true vv' f) in
486
  wp_forall (Mreg.values mreg) f
487 488 489

(** Weakest preconditions *)

490
let rec wp_expr env e q xq =
Andrei Paskevich's avatar
Andrei Paskevich committed
491
  let f = relativize (wp_desc env e) q xq in
492
  if Debug.test_flag debug then begin
493
    Format.eprintf "@[--------@\n@[<hov 2>e = %a@]@\n" Mlw_pretty.print_expr e;
494 495 496
    Format.eprintf "@[<hov 2>q = %a@]@\n" Pretty.print_term q;
    Format.eprintf "@[<hov 2>f = %a@]@\n----@]@." Pretty.print_term f;
  end;
497
  f
498

499
and wp_desc env e q xq = match e.e_node with
500 501 502
  | Elogic t ->
      let v, q = open_post q in
      let t = wp_label e t in
503 504 505
      (* NOTE: if you replace this t_subst by t_let or anything else,
         you must handle separately the case "let mark = 'now in ...",
         which requires 'now to be substituted for mark in q *)
506
      t_subst_single v (to_term t) q
Andrei Paskevich's avatar
Andrei Paskevich committed
507 508 509
  | Evalue pv ->
      let v, q = open_post q in
      let t = wp_label e (t_var pv.pv_vs) in
510
      t_subst_single v t q
511 512 513
  | Earrow _ ->
      let q = open_unit_post q in
      (* wp_label e *) q (* FIXME? *)
514 515 516 517 518 519 520 521 522 523
  | Elet ({ let_var = lv; let_expr = e1 }, e2) ->
      (* FIXME? Pgm_wp applies filter_post everywhere, but doesn't
         it suffice to do it only on Etry? The same question about
         saturate_post: why do we supply default exceptional posts
         instead of requiring an explicit xpost for every "raises"? *)
      let w = wp_expr env e2 q xq in
      let q = match lv with
        | LetV v -> create_post v.pv_vs w
        | LetA _ -> create_unit_post w in
      wp_label e (wp_expr env e1 q xq)
Andrei Paskevich's avatar
Andrei Paskevich committed
524
  | Erec (rdl, e) ->
525 526 527
      let fr = wp_rec_defn env rdl in
      let fe = wp_expr env e q xq in
      wp_and ~sym:true (wp_ands ~sym:true fr) fe
528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549
  | Eif (e1, e2, e3) ->
      let res = vs_result e1 in
      let test = t_equ (t_var res) t_bool_true in
      let test = t_label ?loc:e1.e_loc model3_lab test in
      (* if both branches are pure, do not split *)
      let w =
        let get_term e = match e.e_node with
          | Elogic t -> to_term t
          | Evalue v -> t_var v.pv_vs
          | _ -> raise Exit in
        try
          let r2 = get_term e2 in
          let r3 = get_term e3 in
          let v, q = open_post q in
          t_subst_single v (t_if_simp test r2 r3) q
        with Exit ->
          let w2 = wp_expr env e2 q xq in
          let w3 = wp_expr env e3 q xq in
          t_if_simp test w2 w3
      in
      let q = create_post res w in
      wp_label e (wp_expr env e1 q xq)
550 551 552 553 554 555 556 557 558 559 560
  (* optimization for the particular case let _ = e1 in e2 *)
  | Ecase (e1, [{ ppat_pattern = { pat_node = Term.Pwild }}, e2]) ->
      let w = wp_expr env e2 q xq in
      let q = create_post (vs_result e1) w in
      wp_label e (wp_expr env e1 q xq)
  (* optimization for the particular case let () = e1 in e2 *)
  | Ecase (e1, [{ ppat_pattern = { pat_node = Term.Papp (cs,[]) }}, e2])
    when ls_equal cs fs_void ->
      let w = wp_expr env e2 q xq in
      let q = create_unit_post w in
      wp_label e (wp_expr env e1 q xq)
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580
  | Ecase (e1, bl) ->
      let res = vs_result e1 in
      let branch ({ ppat_pattern = pat }, e) =
        t_close_branch pat (wp_expr env e q xq) in
      let w = t_case (t_var res) (List.map branch bl) in
      let q = create_post res w in
      wp_label e (wp_expr env e1 q xq)
  | Eghost e1 ->
      wp_label e (wp_expr env e1 q xq)
  | Eraise (xs, e1) ->
      let q = try Mexn.find xs xq with
        Not_found -> assert false in
      wp_label e (wp_expr env e1 q xq)
  | Etry (e1, bl) ->
      let branch (xs,v,e) acc =
        let w = wp_expr env e q xq in
        let q = create_post v.pv_vs w in
        Mexn.add xs q acc in
      let xq = List.fold_right branch bl xq in
      wp_label e (wp_expr env e1 q xq)
581 582
  | Eassert (Aassert, f) ->
      let q = open_unit_post q in
583
      let f = wp_expl expl_assert f in
584 585 586
      wp_and ~sym:false (wp_label e f) q
  | Eassert (Acheck, f) ->
      let q = open_unit_post q in
587
      let f = wp_expl expl_check f in
588 589 590 591
      wp_and ~sym:true (wp_label e f) q
  | Eassert (Aassume, f) ->
      let q = open_unit_post q in
      wp_implies (wp_label e f) q
Andrei Paskevich's avatar
Andrei Paskevich committed
592
  | Eabsurd ->
593
      wp_label e t_absurd
Andrei Paskevich's avatar
Andrei Paskevich committed
594 595 596 597 598 599
  | Eany tyc ->
      let p = wp_label e (wp_expl expl_pre tyc.c_pre) in
      let p = t_label ?loc:e.e_loc p.t_label p in
      (* TODO: propagate call labels into tyc.c_post *)
      let w = wp_abstract env tyc.c_effect tyc.c_post tyc.c_xpost q xq in
      wp_and ~sym:false p w (* FIXME? do we need pre? *)
600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631
  | Eapp (e1,_) when Wexpr.mem e_apply_spec_t e ->
      let tyc = Wexpr.find e_apply_spec_t e in
      let p = wp_label e (wp_expl expl_pre tyc.c_pre) in
      let p = t_label ?loc:e.e_loc p.t_label p in
      (* TODO: propagate call labels into tyc.c_post *)
      let w = wp_abstract env tyc.c_effect tyc.c_post tyc.c_xpost q xq in
      let w = wp_and ~sym:false p w in (* FIXME? do we need pre? *)
      let q = create_unit_post w in
      wp_expr env e1 q xq (* FIXME? should (wp_label e) rather be here? *)
  | Eapp (e1,_) -> (* no effect, no pre, no post, no xpost *)
      let v, q = open_post q in
      let w = wp_forall [v] q in
      let q = create_unit_post w in
      wp_label e (wp_expr env e1 q xq)
  | Eabstr (e1, c_q, c_xq) ->
      let w1 = wp_expr env e1 c_q c_xq in
      let w2 = wp_abstract env e1.e_effect c_q c_xq q xq in
      wp_and ~sym:true (wp_label e w1) w2
  | Eassign (e1, reg, pv) ->
      let rec get_term d = match d.e_node with
        | Elogic t -> t
        | Evalue v -> t_var v.pv_vs
        | Eghost e | Elet (_,e) | Erec (_,e) -> get_term e
        | _ -> Loc.errorm ?loc:e.e_loc
            "Cannot compute the WP for this assignment"
      in
      let f = t_equ (get_term e1) (t_var pv.pv_vs) in
      let c_q = create_unit_post f in
      let eff = eff_write eff_empty reg in
      let w = wp_abstract env eff c_q Mexn.empty q xq in
      let q = create_post (vs_result e1) w in
      wp_label e (wp_expr env e1 q xq)
632

633 634 635
  (* TODO *)
  |Efor (_, _, _, _)-> t_true
  |Eloop (_, _, _)-> t_true
636

Andrei Paskevich's avatar
Andrei Paskevich committed
637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652
and wp_abstract env c_eff c_q c_xq q xq =
  let regs = regs_of_writes c_eff in
  let exns = exns_of_raises c_eff in
  let quantify_post c_q q =
    let v, f = open_post q in
    let c_v, c_f = open_post c_q in
    let c_f = t_subst_single c_v (t_var v) c_f in
    (* TODO: optimize the case c_f == (... /\ v = t /\ ...) *)
    let f = wp_forall [v] (wp_implies c_f f) in
    quantify env regs f
  in
  let quantify_xpost _ c_xq xq =
    Some (quantify_post c_xq xq) in
  let proceed c_q c_xq =
    let f = quantify_post c_q q in
    (* every xs in exns is guaranteed to be in c_xq and xq *)
653 654
    assert (Mexn.set_submap exns xq);
    assert (Mexn.set_submap exns c_xq);
Andrei Paskevich's avatar
Andrei Paskevich committed
655 656 657 658 659 660 661
    let xq = Mexn.set_inter xq exns in
    let c_xq = Mexn.set_inter c_xq exns in
    let mexn = Mexn.inter quantify_xpost c_xq xq in
    wp_ands ~sym:true (f :: Mexn.values mexn)
  in
  relativize proceed c_q c_xq

662
and wp_lambda env l =
663 664
  let q = wp_expl expl_post l.l_post in
  let xq = Mexn.map (wp_expl expl_xpost) l.l_xpost in
665
  let f = wp_expr env l.l_expr q xq in
666
  let f = wp_implies l.l_pre f in
667
  let f = quantify env (regs_of_effect l.l_expr.e_effect) f in
668
  wp_forall (List.map (fun pv -> pv.pv_vs) l.l_args) f
669

670 671
and wp_rec_defn env rdl =
  List.map (fun rd -> wp_lambda env rd.rec_lambda) rdl
672

673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718
(***
let bool_to_prop env f =
  let ts_bool  = find_ts ~pure:true env "bool" in
  let ls_andb  = find_ls ~pure:true env "andb" in
  let ls_orb   = find_ls ~pure:true env "orb" in
  let ls_notb  = find_ls ~pure:true env "notb" in
  let ls_True  = find_ls ~pure:true env "True" in
  let ls_False = find_ls ~pure:true env "False" in
  let t_True   = fs_app ls_True [] (ty_app ts_bool []) in
  let is_bool ls = ls_equal ls ls_True || ls_equal ls ls_False in
  let rec t_iff_bool f1 f2 = match f1.t_node, f2.t_node with
    | Tnot f1, _ -> t_not_simp (t_iff_bool f1 f2)
    | _, Tnot f2 -> t_not_simp (t_iff_bool f1 f2)
    | Tapp (ps1, [t1; { t_node = Tapp (ls1, []) }]),
      Tapp (ps2, [t2; { t_node = Tapp (ls2, []) }])
      when ls_equal ps1 ps_equ && ls_equal ps2 ps_equ &&
           is_bool ls1 && is_bool ls2 ->
        if ls_equal ls1 ls2 then t_equ t1 t2 else t_neq t1 t2
    | _ ->
        t_iff_simp f1 f2
  in
  let rec t_btop t = t_label ?loc:t.t_loc t.t_label (* t_label_copy? *)
    (match t.t_node with
    | Tif (f,t1,t2) ->
        t_if_simp (f_btop f) (t_btop t1) (t_btop t2)
    | Tapp (ls, [t1;t2]) when ls_equal ls ls_andb ->
        t_and_simp (t_btop t1) (t_btop t2)
    | Tapp (ls, [t1;t2]) when ls_equal ls ls_orb ->
        t_or_simp (t_btop t1) (t_btop t2)
    | Tapp (ls, [t1]) when ls_equal ls ls_notb ->
        t_not_simp (t_btop t1)
    | Tapp (ls, []) when ls_equal ls ls_True ->
        t_true
    | Tapp (ls, []) when ls_equal ls ls_False ->
        t_false
    | _ ->
        t_equ_simp (f_btop t) t_True)
  and f_btop f = match f.t_node with
    | Tapp (ls, [{t_ty = Some {ty_node = Tyapp (ts, [])}} as l; r])
      when ls_equal ls ps_equ && ts_equal ts ts_bool ->
        t_label ?loc:f.t_loc f.t_label (t_iff_bool (t_btop l) (t_btop r))
    | _ ->
        t_map_simp f_btop f
  in
  f_btop f
***)
719

720 721 722 723 724 725 726 727 728 729 730 731 732 733 734
(* replace t_absurd with t_false *)
let rec unabsurd f = match f.t_node with
  | Tapp (ls, []) when ls_equal ls ls_absurd ->
      t_label_copy f t_false
  | _ ->
      t_map unabsurd f

let add_wp_decl name f uc =
  (* prepare a proposition symbol *)
  let s = "WP_" ^ name.id_string in
  let lab = Ident.create_label ("expl:" ^ name.id_string) in
  let label = Slab.add lab name.id_label in
  let id = id_fresh ~label ?loc:name.id_loc s in
  let pr = create_prsymbol id in
  (* prepare the VC formula *)
735
  (* let f = remove_at f in (* FIXME: do we need this? *) *)
736 737 738 739 740 741 742 743 744 745
  (* let f = bool_to_prop uc f in *)
  let f = unabsurd f in
  (* get a known map with tuples added *)
  let km = Theory.get_known uc in
  (* simplify f *)
  let f = Eval_match.eval_match ~inline:Eval_match.inline_nonrec_linear km f in
  (* printf "wp: f=%a@." print_term f; *)
  let d = create_prop_decl Pgoal pr f in
  Theory.add_decl uc d

746 747 748 749 750 751
let mk_env env km th = {
  prog_known = km;
  pure_known = Theory.get_known th;
  global_env = env;
}

752
let wp_let env km th ({ let_var = lv; let_expr = e } as ld) =
753
  spec_let ld;
754 755
  let env = mk_env env km th in
  let q, xq = default_post e.e_vty e.e_effect in
756
  let f = wp_expr env e q xq in
757 758 759 760
  let f = wp_forall (Mvs.keys f.t_vars) f in
  let id = match lv with
    | LetV pv -> pv.pv_vs.vs_name
    | LetA ps -> ps.ps_name in
761 762
  add_wp_decl id f th

763
let wp_rec env km th rdl =
764
  spec_rec rdl;
765
  let env = mk_env env km th in
766 767
  let fl = wp_rec_defn env rdl in
  let add_one th d f =
768
    Debug.dprintf debug "wp %s = %a@\n----------------@."
769 770
      d.rec_ps.ps_name.id_string Pretty.print_term f;
    add_wp_decl d.rec_ps.ps_name f th
771 772
  in
  List.fold_left2 add_one th rdl fl
773

774
let wp_val _env _km th vd = spec_val vd; th