Merge from LFSC (#26)

* Showing models as coq counter examples in tactic without constructing coq terms

* also read models when calling cvc4 with a file (deactivated because cvc4 crashes)

* Show counter examples with variables in the order they are quantified in the Coq goal

* Circumvent issue with ocamldep

* fix issue with dependencies

* fix issue with dependencies

* Translation and OCaml support for extract, zero_extend, sign_extend

* Show run times of components

* print time on stdout instead

* Tests now work with new version (master) of CVC4

* fix small printing issue

* look for date on mac os x

* proof of valid_check_bbShl: some cases to prove.

* full proof of "left shift checker".

*  full proof of "rigth shift checker".

* Support translation of terms bvlshr, bvshl but LFSC rules do not exists at the moment
Bug fix for bitvector extract (inverted arguments)

* Typo

* More modularity on the format of traces depending on the version of coq

* More straightforward definitions in Int63Native_standard

* Use the Int31 library with coq-8.5

* Use the most efficient operations of Int31

* Improved performance with coq-8.5

* Uniform treatment of sat and smt tactics

* Hopefully solved the problem with universes for the tactic

* Updated the installation instructions

* Holes for unsupported bit blasting rules

* Cherry-picking from smtcoq/smtcoq

* bug fix hole for bitblast

* Predefined arrays are not required anymore

* fix issue with coq bbT and bitof construction from ocaml

* bug fix in smtAtom for uninterpreted functions
fix verit test file

* fix issue with smtlib2 extract parsing

* It looks like we still need the PArray function instances for some examples (see vmcai_bytes.smt2)

* Solver specific reification:
Each solver has a list of supported theories which is passed to Atom.of_coq, this function creates uninterpreted functions / sorts for unsupported features.

* show counter-examples with const_farray instead of const for constant array definitions

* Vernacular commands to debug checkers.
Verit/Lfsc_Checker_Debug will always fail, reporting the first proof step of the certificate that failed be checked

* Update INSTALL.md

* show smtcoq proof when converting

* (Hopefully) repared the universes problems

* Corrected a bug with holes in proofs

* scripts for tests:
create a folder "work" under "lfsc/tests/", locate the benchmarks there.
create a folder "results" under "lfsc/tests/work/" in which you'll find the results of ./cvc4tocoq.

* make sure to give correct path for your benchs...

* Checker for array extensionality modulo symmetry of equality

* fix oversight with bitvectors larger than 63 bits

* some printing functions for smt2 ast

* handle smtlib2 files with more complicated equivalence with (= ... )

* revert: ./cvc4tocoq does not output lfsc proofs...

* bug fix one input was ignored

* Don't show verit translation of LFSC proof if environment variable DONTSHOWVERIT is set
(e.g. put export DONTSHOWVERIT="" in your .bashrc or .bashprofile)

* Also sort names of introduced variables when showing counter-example

* input files for which SMTCoq retuns false.

* input files for which SMTCoq retuns false.

* use debug checker for debug file

* More efficient debug checker

* better approximate number of failing step of certificate in debug checker

* fix mistake in ml4

* very first attempt to support goals in Prop

* bvs: comparison predicates in Prop and their <-> proofs with the ones in bool
farrays: equality predicate in Prop and its <-> proof with the one in bool.

* unit, Bool, Z, Pos: comparison and equality predicates in Prop.

* a typo fixed.

* an example of array equality in  Prop (converted into Bool by hand)...
TODO: enhance the search space of cvc4 tactic.

* first version of cvc4' tactic: "solves" the goals in Prop.
WARNING: supports only bv and array goals and might not be complete
TODO: add support for lia goals

* cvc4' support for lia
WARNING: might not be complete!

* small fix in cvc4' and some variations of examples

* small fix + support for goals in Bool and Bool = true + use of solve tactical
WARNING: does not support UF and INT63 goals in Prop

* cvc4': better arrangement

* cvc4': Prop2Bool by context search...

* cvc4': solve tactial added -> do not modify unsolved goals.

* developer documentation for the smtcoq repo

* cvc4': rudimentary support for uninterpreted function goals in Prop.

* cvc4': support for goals with Leibniz equality...
WARNING: necessary use of "Grab Existential Variables." to instantiate variable types for farrays!

* cvc4': Z.lt adapted + better support from verit...

* cvc4': support for Z.le, Z.ge, Z.gt.

* Try arrays with default value (with a constructor for constant arrays), but extensionality is not provable

* cvc4': support for equality over uninterpreted types

* lfsc demo: goals in Coq's Prop.

* lfsc demo: goals in Bool.

* Fix issue with existential variables generated by prop2bool.
- prop2bool tactic exported by SMTCoq
- remove useless stuff

* update usage and installation instructions

* Update INSTALL.md

* highlighting

* the tactic: bool2prop.

* clean up

* the tactic smt: very first version.

* smt: return unsolved goals in Prop.

* Show when a certificate cannot be checked when running the tactic instead of at Qed

* Tactic improvements
- Handle negation/True/False in prop/bool conversions tactic.
- Remove alias for farray (this caused problem for matching on this type in tactics).
- Tactic `smt` that combines cvc4 and veriT.
- return subgoals in prop

* test change header

* smt: support for negated goals + some reorganization.

* conflicts resolved + some reorganization.

* a way to solve the issue with ambiguous coercions.

* reorganization.

* small change.

* another small change.

* developer documentation of the tactics.

* developer guide: some improvements.

* developer guide: some more improvements.

* developer guide: some more improvements.

* developer guide: some more improvements.

* pass correct environment for conversion + better error messages

* cleaning

* ReflectFacts added.

* re-organizing developers' guide.

* re-organizing developers' guide.

* re-organizing developers' guide.

* removing unused maps.

* headers.

* artifact readme getting started...

* first attempt

* second...

* third...

* 4th...

* 5th...

* 6th...

* 7th...

* 8th...

* 9th...

* 10th...

* 11th...

* 12th...

* 13th...

* 14th...

* 15th...

* 16th...

* 17th...

* Update artifact.md

Use links to lfsc repository like in the paper

* 18th...

* 19th...

* 20th...

* 21st...

* 22nd...

* 23rd...

* 24th...

* 25th...

* 26th...

* 27th...

* 28th...

* Update artifact.md

Small reorganization

* minor edits

* More minor edits

* revised description of tactics

* Final pass

* typo

* name changed: artifact-readme.md

* file added...

* passwd chaged...

* links...

* removal

* performance statement...

* typos...

* the link to the artifact image updated...

* suggestions by Guy...

* aux files removed...

* clean-up...

* clean-up...

* some small changes...

* small fix...

* additional information on newly created files after running cvc4tocoq script...

* some small fix...

* another small fix...

* typo...

* small fix...

* another small fix...

* fix...

* link to the artifact image...

* We do not want to force vm_cast for the Theorem commands

* no_check variants of the tactics

* TODO: a veriT test does not work anymore

* Compiles with both versions of Coq

* Test of the tactics in real conditions

* Comment on this case study

* an example for the FroCoS paper.

* Fix smt tactic that doesn't return cvc4's subgoals

* readme modifications

* readme modifications 2

* small typo in readme.

* small changes in readme.

* small changes in readme.

* typo in readme.

* Sync with https://github.com/LFSC/smtcoq

* Port to Coq 8.6

* README

* README

* INSTALL

* Missing file

* Yves' proposition for installation instructions

* Updated link to CVC4

* Compiles again with native-coq

* Compiles with both versions of Coq

* Command to bypass typechecking when generating a zchaff theorem

* Solved bug on cuts from Hole

* Counter-models for uninterpreted sorts (improves issue #13)

* OCaml version note (#15)

* update .gitignore

* needs OCaml 4.04.0

* Solving merge issues (under progress)

* Make SmtBtype compile

* Compilation of SmtForm under progress

* Make SmtForm compile

* Make SmtCertif compile

* Make SmtTrace compile

* Make SatAtom compile

* Make smtAtom compile

* Make CnfParser compile

* Make Zchaff compile

* Make VeritSyntax compile

* Make VeritParser compile

* Make lfsc/tosmtcoq compile

* Make smtlib2_genconstr compile

* smtCommand under progress

* smtCommands and verit compile again

* lfsc compiles

* ml4 compiles

* Everything compiles

* All ZChaff unit tests and most verit unit tests (but taut5 and un_menteur) go through

* Most LFSC tests ok; some fail due to the problem of verit; a few fail due to an error "Not_found" to investigate

* Authors and headings

* Compiles with native-coq

* Typo

1 files changed, 169 insertions, 0 deletions

diff --git a/src/smtlib2/smtlib2_solver.ml b/src/smtlib2/smtlib2_solver.ml
new file mode 100644
index 0000000..3ee8229
--- /dev/null
+++ b/src/smtlib2/smtlib2_solver.ml
@@ -0,0 +1,169 @@
+(**************************************************************************)
+(*                                                                        *)
+(*     SMTCoq                                                             *)
+(*     Copyright (C) 2011 - 2019                                          *)
+(*                                                                        *)
+(*     See file "AUTHORS" for the list of authors                         *)
+(*                                                                        *)
+(*   This file is distributed under the terms of the CeCILL-C licence     *)
+(*                                                                        *)
+(**************************************************************************)
+
+
+open Format
+  
+type result = Sat | Unsat
+
+type t = {
+  cmd : string array;
+  pid : int;
+  stdin : Unix.file_descr;
+  stdout : Unix.file_descr;
+  stderr : Unix.file_descr;
+  lexbuf : Lexing.lexbuf;
+}
+
+
+let create cmd =
+  let executable = cmd.(0) in
+
+  (* Create pipes for input, output and error output *)
+  let stdin_in, stdin_out = Unix.pipe () in
+  let stdout_in, stdout_out = Unix.pipe () in 
+  let stderr_in, stderr_out = Unix.pipe () in 
+
+  (* Create solver process *)
+  let pid = 
+    Unix.create_process 
+      executable 
+      cmd 
+      stdin_in
+      stdout_out
+      stderr_out
+  in
+
+  (* Close our end of the pipe which has been duplicated by the
+     process *)
+  Unix.close stdin_in;
+  Unix.close stdout_out; 
+  Unix.close stderr_out; 
+
+  (* Get an output channel to read from solver's stdout *)
+  let stdout_ch = Unix.in_channel_of_descr stdout_in in
+
+  let lexbuf = Lexing.from_channel stdout_ch in
+
+  (* Create the solver instance *)
+  { cmd; pid;
+    stdin = stdin_out; stdout = stdout_in; stderr = stderr_in; lexbuf }
+
+
+let kill s =
+  try
+    Unix.close s.stdin;
+    Unix.close s.stdout;
+    Unix.close s.stderr;
+    Unix.kill s.pid Sys.sigkill;
+  with _ -> ()
+
+
+let read_response { lexbuf } = 
+  SExprParser.sexp SExprLexer.main lexbuf 
+
+
+let error s sexp =
+  kill s;
+  Structures.error (asprintf "Solver error: %a." SExpr.print sexp)
+
+
+let read_success s = 
+  match SExprParser.sexp SExprLexer.main s.lexbuf with
+  | SExpr.Atom "success" -> ()
+  | r -> error s r
+
+
+let no_response _ = ()
+
+
+let read_check_result s = 
+  match SExprParser.sexp SExprLexer.main s.lexbuf with
+  | SExpr.Atom "sat" -> Sat
+  | SExpr.Atom "unsat" -> Unsat
+  | SExpr.Atom "unknown" -> Structures.error ("Solver returned uknown.")
+  | r -> error s r
+
+
+let send_command s cmd read =
+  eprintf "%s@." cmd;
+  let err_p1 = Unix.((fstat s.stderr).st_size) in
+  try
+    let in_ch = Unix.out_channel_of_descr s.stdin in
+    let fmt = formatter_of_out_channel in_ch in
+    pp_print_string fmt cmd;
+    pp_print_newline fmt ();
+    read s
+  with e ->
+    let err_p2 = Unix.((fstat s.stderr).st_size) in
+    let len = err_p2 - err_p1 in
+    (* Was something written to stderr? *)
+    if len <> 0 then begin
+      let buf = Bytes.create err_p2 in
+      Unix.read s.stderr buf 0 err_p2 |> ignore;
+      let err_msg = Bytes.sub_string buf err_p1 len in
+      Structures.error ("Solver error: "^err_msg);
+    end
+    else (kill s; raise e)
+
+
+let set_option s name b =
+  send_command s
+    (asprintf "(set-option :%s %b)" name b)
+    read_success
+
+
+let set_logic s l =
+  send_command s
+    (sprintf "(set-logic %s)" l)
+    read_success
+
+
+let declare_sort s name arity =
+  send_command s
+    (asprintf "(declare-sort %s %d)" name arity)
+    read_success
+
+
+let declare_fun s name args ret =
+  send_command s
+    (asprintf "(declare-fun %s (%a) %s)"
+       name
+       (fun fmt -> List.iter (fprintf fmt "%s ")) args
+       ret)
+    read_success
+  
+
+let assume s f =
+  send_command s
+    (sprintf "(assert %s)" f)
+    read_success
+
+
+let check_sat s =
+  send_command s "(check-sat)" read_check_result
+
+
+let get_proof s process_proof =
+  send_command s "(get-proof)" (fun s -> process_proof s.lexbuf)
+
+
+let get_model s =
+  send_command s "(get-model)" read_response
+
+
+let quit s =
+  try
+    send_command s "(exit)" read_success;
+  with Unix.Unix_error _ -> ();
+  kill s
+
+