why3-0.87.3/0000755000175000017500000000000013035417011013230 5ustar guillaumeguillaumewhy3-0.87.3/Makefile.in0000644000175000017500000020073213035416743015314 0ustar guillaumeguillaume#################################################################### # # # The Why3 Verification Platform / The Why3 Development Team # # Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University # # # # This software is distributed under the terms of the GNU Lesser # # General Public License version 2.1, with the special exception # # on linking described in file LICENSE. # # # #################################################################### VERBOSEMAKE ?= @enable_verbose_make@ ifeq ($(VERBOSEMAKE),yes) SHOW = @true HIDE = else SHOW = @echo HIDE = @ endif # install the binaries DESTDIR = prefix = @prefix@ exec_prefix = @exec_prefix@ datarootdir = @datarootdir@ BINDIR = $(DESTDIR)@bindir@ LIBDIR = $(DESTDIR)@libdir@ DATADIR = $(DESTDIR)@datarootdir@ MANDIR = $(DESTDIR)@mandir@ TOOLDIR = $(LIBDIR)/why3/commands # OS specific stuff EXE = @EXE@ # other variables CC = @CC@ MKDIR_P = @MKDIR_P@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ OCAMLC = @OCAMLC@ OCAMLOPT = @OCAMLOPT@ OCAMLDEP = @OCAMLDEP@ OCAMLLEX = @OCAMLLEX@ OCAMLYACC = @OCAMLYACC@ OCAMLDOC = @OCAMLDOC@ OCAMLLIB = @OCAMLLIB@ OCAMLINSTALLLIB = $(DESTDIR)@OCAMLINSTALLLIB@ OCAMLBEST = @OCAMLBEST@ OCAMLVERSION = @OCAMLVERSION@ COQC = @COQC@ COQDEP = @COQDEP@ COQCAMLP = @COQCAMLP@ COQCAMLPLIB = @COQCAMLPLIB@ FRAMAC_LIBDIR = $(DESTDIR)@FRAMAC_LIBDIR@ ifeq (@enable_menhirLib@,yes) MENHIR = @MENHIR@ --table else MENHIR = @MENHIR@ endif DEPFLAGS = -slash -I lib/why3 ifeq (@OCAMLBEST@,opt) # the semantics of the -native flag changed in ocaml 4.03.0 #DEPFLAGS += -native endif RUBBER = @RUBBER@ HEVEA = @HEVEA@ HACHA = @HACHA@ EMACS = @EMACS@ #PSVIEWER = @PSVIEWER@ #PDFVIEWER = @PDFVIEWER@ INCLUDES = @ZIPINCLUDE@ @MENHIRINCLUDE@ # warnings are enabled and non fatal by default, except: # - disabled: # 4 Fragile pattern matching: matching that will remain complete even # if additional constructors are added to one of the variant types # matched. # 9 Missing fields in a record pattern. # 41 Ambiguous constructor or label name. # 44 Open statement shadows an already defined identifier. # 45 Open statement shadows an already defined label or constructor. # 50 Unexpected documentation comment. # 52 The argument of this constructor should not be matched against a # constant pattern; the actual value of the argument could change # in the future. # - fatal: # 5 Partially applied function: expression whose result has function # type and is ignored. # 48 Implicit elimination of optional arguments. WARNINGS = A-4-9-41-44-45-50-52@5@48 OFLAGS = -w $(WARNINGS) -dtypes -g -I lib/why3 $(INCLUDES) BFLAGS = -w $(WARNINGS) -dtypes -g -I lib/why3 $(INCLUDES) OLINKFLAGS = -linkall $(EXTCMXA) BLINKFLAGS = -linkall $(EXTCMA) ifeq (@enable_profiling@,yes) OFLAGS += -g -p endif ifeq (@enable_bin_annot@,yes) OFLAGS += -bin-annot BFLAGS += -bin-annot endif # see http://caml.inria.fr/mantis/view.php?id=4991 CMIHACK = -intf-suffix .cmi # external libraries common to all binaries EXTOBJS = @MENHIRLIB@ EXTLIBS = str unix nums dynlink @ZIPLIB@ EXTCMA = $(addsuffix .cma,$(EXTLIBS)) $(addsuffix .cmo,$(EXTOBJS)) EXTCMXA = $(addsuffix .cmxa,$(EXTLIBS)) $(addsuffix .cmx,$(EXTOBJS)) INSTALLED_LIB_EXTS = a cma cmx cmi cmxa cmxs COMPILED_LIB_EXTS = $(INSTALLED_LIB_EXTS) o cmo cmt cmti annot dep conflicts TOTARGET = > "$@" || (RV=$$?; rm -f "$@"; exit $${RV}) ############### # main target ############### all: @OCAMLBEST@ plugins: plugins.@OCAMLBEST@ opt: plugins.opt byte: plugins.byte ifeq (@enable_local@,yes) all: install_local endif .PHONY: byte opt clean depend all install install_local install_no_local .PHONY: plugins plugins.byte plugins.opt CLEANDIRS = CLEANLIBS = GENERATED = ############## # Why3 library ############## LIBGENERATED = src/util/config.ml \ src/util/rc.ml src/util/lexlib.ml src/parser/lexer.ml \ src/parser/parser.mli src/parser/parser.ml \ src/driver/driver_parser.mli src/driver/driver_parser.ml \ src/driver/driver_lexer.ml \ src/driver/parse_smtv2_model_parser.mli src/driver/parse_smtv2_model_parser.ml \ src/driver/parse_smtv2_model_lexer.ml \ src/session/compress.ml src/session/xml.ml \ src/session/strategy_parser.ml \ lib/ocaml/why3__BigInt_compat.ml LIB_UTIL = config bigInt util opt lists strings \ extmap extset exthtbl weakhtbl \ hashcons stdlib exn_printer pp json debug loc lexlib print_tree \ cmdline warning sysutil rc plugin bigInt number pqueue LIB_CORE = ident ty term pattern decl theory \ task pretty dterm env trans printer model_parser LIB_DRIVER = call_provers driver_ast driver_parser driver_lexer driver \ whyconf autodetection \ parse_smtv2_model_parser parse_smtv2_model_lexer parse_smtv2_model LIB_MLW = ity expr dexpr pdecl pmodule LIB_PARSER = ptree glob parser typing lexer LIB_TRANSFORM = simplify_formula inlining split_goal induction \ detect_polymorphism \ reduction_engine compute \ eliminate_definition eliminate_algebraic \ eliminate_inductive eliminate_let eliminate_if \ libencoding discriminate encoding encoding_select \ encoding_guards_full encoding_tags_full \ encoding_guards encoding_tags encoding_twin \ encoding_sort simplify_array filter_trigger \ introduction abstraction close_epsilon lift_epsilon \ eliminate_epsilon intro_projections_counterexmp \ intro_vc_vars_counterexmp prepare_for_counterexmp \ eval_match instantiate_predicate smoke_detector \ induction_pr prop_curry LIB_PRINTER = alt_ergo why3printer smtv1 smtv2 coq pvs isabelle \ simplify gappa cvc3 yices mathematica LIB_WHYML = mlw_ty mlw_expr mlw_decl mlw_pretty mlw_wp mlw_module \ mlw_dexpr mlw_typing mlw_driver mlw_exec mlw_ocaml \ mlw_main mlw_interp LIB_SESSION = compress xml termcode session session_tools strategy \ strategy_parser session_scheduler LIBMODULES = $(addprefix src/util/, $(LIB_UTIL)) \ $(addprefix src/core/, $(LIB_CORE)) \ $(addprefix src/driver/, $(LIB_DRIVER)) \ $(addprefix src/mlw/, $(LIB_MLW)) \ $(addprefix src/parser/, $(LIB_PARSER)) \ $(addprefix src/transform/, $(LIB_TRANSFORM)) \ $(addprefix src/printer/, $(LIB_PRINTER)) \ $(addprefix src/whyml/, $(LIB_WHYML)) \ $(addprefix src/session/, $(LIB_SESSION)) LIBDIRS = util core driver mlw parser transform printer whyml session LIBINCLUDES = $(addprefix -I src/, $(LIBDIRS)) LIBDEP = $(addsuffix .dep, $(LIBMODULES)) LIBCMO = $(addsuffix .cmo, $(LIBMODULES)) LIBCMX = $(addsuffix .cmx, $(LIBMODULES)) $(LIBDEP): DEPFLAGS += $(LIBINCLUDES) $(LIBCMO) $(LIBCMX): INCLUDES += $(LIBINCLUDES) $(LIBCMX): OFLAGS += -for-pack Why3 $(LIBDEP): $(LIBGENERATED) # Zarith ifeq (@enable_zarith@,yes) lib/ocaml/why3__BigInt_compat.ml: config.status lib/ocaml/why3__BigInt_zarith.ml cp lib/ocaml/why3__BigInt_zarith.ml $@ else lib/ocaml/why3__BigInt_compat.ml: config.status lib/ocaml/why3__BigInt_num.ml cp lib/ocaml/why3__BigInt_num.ml $@ endif # Ocamlzip ifeq (@enable_zip@,yes) src/session/compress.ml: config.status src/session/compress_z.ml cp src/session/compress_z.ml $@ else src/session/compress.ml: config.status src/session/compress_none.ml cp src/session/compress_none.ml $@ endif # hide deprecated warnings for strings src/util/strings.cmo:: WARNINGS:=$(WARNINGS)-3 src/util/strings.cmx:: WARNINGS:=$(WARNINGS)-3 # build targets byte: lib/why3/why3.cma opt: lib/why3/why3.cmxa lib/why3/why3.cma: lib/why3/why3.cmo lib/why3/why3.cmxa: lib/why3/why3.cmx lib/why3/why3.cmo: $(LIBCMO) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -pack -o $@ $^ lib/why3/why3.cmx: $(LIBCMX) lib/why3/why3.cmo $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) $(CMIHACK) -pack -o $@ $(filter %.cmx, $^) # clean and depend ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(LIBDEP) endif depend: $(LIBDEP) CLEANDIRS += src $(addprefix src/, $(LIBDIRS)) CLEANLIBS += lib/why3/why3session lib/why3/why3 GENERATED += $(LIBGENERATED) ############### # installation ############### clean_old_install:: rm -rf $(LIBDIR)/why3 rm -rf $(DATADIR)/why3 rm -rf $(OCAMLINSTALLLIB)/why3 install_no_local:: clean_old_install $(MKDIR_P) $(BINDIR) $(MKDIR_P) $(LIBDIR)/why3 $(MKDIR_P) $(TOOLDIR) $(MKDIR_P) $(DATADIR)/why3 $(MKDIR_P) $(DATADIR)/why3/images $(MKDIR_P) $(DATADIR)/why3/vim $(MKDIR_P) $(DATADIR)/why3/lang $(MKDIR_P) $(DATADIR)/why3/theories $(MKDIR_P) $(DATADIR)/why3/modules/mach $(MKDIR_P) $(DATADIR)/why3/drivers $(INSTALL_DATA) theories/*.why $(DATADIR)/why3/theories $(INSTALL_DATA) modules/*.mlw $(DATADIR)/why3/modules $(INSTALL_DATA) modules/mach/*.mlw $(DATADIR)/why3/modules/mach $(INSTALL_DATA) drivers/*.drv drivers/*.gen $(DATADIR)/why3/drivers $(INSTALL_DATA) LICENSE $(DATADIR)/why3/ $(INSTALL_DATA) share/provers-detection-data.conf $(DATADIR)/why3/ for i in share/images/*.rc; do \ d=`basename $$i .rc`; \ $(INSTALL_DATA) $$i $(DATADIR)/why3/images; \ $(MKDIR_P) $(DATADIR)/why3/images/$$d; \ $(INSTALL_DATA) share/images/$$d/* $(DATADIR)/why3/images/$$d; \ done $(INSTALL_DATA) share/images/*.png $(DATADIR)/why3/images $(INSTALL_DATA) share/why3session.dtd $(DATADIR)/why3 $(INSTALL_DATA) share/Makefile.config $(DATADIR)/why3 $(INSTALL_DATA) share/vim/why3.vim $(DATADIR)/why3/vim/why3.vim $(INSTALL_DATA) share/lang/why3.lang $(DATADIR)/why3/lang/why3.lang install_no_local_lib:: $(MKDIR_P) $(OCAMLINSTALLLIB)/why3 $(INSTALL_DATA) $(wildcard $(addprefix lib/why3/why3., $(INSTALLED_LIB_EXTS))) \ lib/why3/META $(OCAMLINSTALLLIB)/why3 ifeq (@enable_local@,yes) install install-lib: @echo "Why3 is configured in local installation mode." @echo "To install Why3, run ./configure --disable-local ; make ; make install" else install: clean_old_install install_no_local install-lib: install_no_local_lib endif install-all: install install-lib ################## # Uninstallation ################## uninstall: clean_old_install ################## # Why3 emacs mode ################## %.elc: %.el $(EMACS) --batch --no-init-file -f batch-byte-compile $< clean_old_install:: rm -f $(DATADIR)/emacs/site-lisp/why3.el rm -f $(DATADIR)/emacs/site-lisp/why3.elc install_no_local:: $(MKDIR_P) $(DATADIR)/emacs/site-lisp/ $(INSTALL_DATA) share/emacs/why3.el $(DATADIR)/emacs/site-lisp/why3.el ifeq (@enable_emacs_compilation@,yes) $(INSTALL_DATA) share/emacs/why3.elc $(DATADIR)/emacs/site-lisp/why3.elc endif ifeq (@enable_emacs_compilation@,yes) all: share/emacs/why3.elc endif ################## # Why3 plugins ################## PLUGGENERATED = plugins/tptp/tptp_lexer.ml \ plugins/tptp/tptp_parser.ml plugins/tptp/tptp_parser.mli \ plugins/parser/dimacs.ml \ PLUG_PARSER = genequlin dimacs PLUG_PRINTER = PLUG_TRANSFORM = PLUG_TPTP = tptp_ast tptp_parser tptp_typing tptp_lexer tptp_printer PLUGINS = genequlin dimacs tptp TPTPMODULES = $(addprefix plugins/tptp/, $(PLUG_TPTP)) TPTPCMO = $(addsuffix .cmo, $(TPTPMODULES)) TPTPCMX = $(addsuffix .cmx, $(TPTPMODULES)) ifeq (@enable_hypothesis_selection@,yes) PLUG_TRANSFORM += hypothesis_selection PLUGINS += hypothesis_selection lib/plugins/hypothesis_selection.cmxs: INCLUDES += -I @OCAMLGRAPHLIB@ lib/plugins/hypothesis_selection.cmo: INCLUDES += -I @OCAMLGRAPHLIB@ lib/plugins/hypothesis_selection.cmxs: OFLAGS += graph.cmxa lib/plugins/hypothesis_selection.cmo: BFLAGS += graph.cmo endif PLUGMODULES = $(addprefix plugins/parser/, $(PLUG_PARSER)) \ $(addprefix plugins/printer/, $(PLUG_PRINTER)) \ $(addprefix plugins/transform/, $(PLUG_TRANSFORM)) \ $(TPTPMODULES) PLUGDEP = $(addsuffix .dep, $(PLUGMODULES)) PLUGCMO = $(addsuffix .cmo, $(PLUGMODULES)) PLUGCMX = $(addsuffix .cmx, $(PLUGMODULES)) PLUGDIRS = parser printer transform tptp PLUGINCLUDES = $(addprefix -I plugins/, $(PLUGDIRS)) $(PLUGDEP): DEPFLAGS += $(PLUGINCLUDES) $(PLUGCMO) $(PLUGCMX): INCLUDES += $(PLUGINCLUDES) $(PLUGDEP): $(PLUGGENERATED) LIBPLUGCMO = $(addsuffix .cmo, $(addprefix lib/plugins/, $(PLUGINS))) LIBPLUGCMXS = $(addsuffix .cmxs, $(addprefix lib/plugins/, $(PLUGINS))) plugins.byte: $(LIBPLUGCMO) plugins.opt : $(LIBPLUGCMXS) lib/plugins/%.cmxs: plugins/parser/%.cmx $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) -shared -o $@ $< lib/plugins/%.cmo: plugins/parser/%.cmo $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -pack -o $@ $< lib/plugins/%.cmxs: plugins/printer/%.cmx $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) -shared -o $@ $< lib/plugins/%.cmo: plugins/printer/%.cmo $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -pack -o $@ $< lib/plugins/%.cmxs: plugins/transform/%.cmx $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) -shared -o $@ $< lib/plugins/%.cmo: plugins/transform/%.cmo $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -pack -o $@ $< lib/plugins/tptp.cmxs: $(TPTPCMX) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) -shared -o $@ $^ lib/plugins/tptp.cmo: $(TPTPCMO) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -pack -o $@ $^ # depend and clean targets ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(PLUGDEP) endif depend: $(PLUGDEP) CLEANDIRS += plugins $(addprefix plugins/, $(PLUGDIRS)) lib/plugins GENERATED += $(PLUGGENERATED) install_no_local:: $(MKDIR_P) $(LIBDIR)/why3/plugins $(INSTALL_DATA) $(wildcard $(LIBPLUGCMO) $(LIBPLUGCMXS)) $(LIBDIR)/why3/plugins ############### # Why3 commands ############### TOOLSGENERATED = src/tools/why3wc.ml TOOLS_BIN = why3config why3execute why3extract why3prove \ why3realize why3replay why3wc TOOLS_FILES = main $(TOOLS_BIN) TOOLSMODULES = $(addprefix src/tools/, $(TOOLS_FILES)) TOOLSDEP = $(addsuffix .dep, $(TOOLSMODULES)) TOOLSCMO = $(addsuffix .cmo, $(TOOLSMODULES)) TOOLSCMX = $(addsuffix .cmx, $(TOOLSMODULES)) $(TOOLSDEP): DEPFLAGS += -I src/tools $(TOOLSCMO) $(TOOLSCMX): INCLUDES += -I src/tools $(TOOLSDEP): $(TOOLSGENERATED) byte: bin/why3.byte $(TOOLS_BIN:%=bin/%.byte) opt: bin/why3.opt $(TOOLS_BIN:%=bin/%.opt) bin/why3.opt: lib/why3/why3.cmxa src/tools/main.cmx bin/why3.byte: lib/why3/why3.cma src/tools/main.cmo bin/why3config.opt: lib/why3/why3.cmxa src/tools/why3config.cmx bin/why3config.byte: lib/why3/why3.cma src/tools/why3config.cmo bin/why3execute.opt: lib/why3/why3.cmxa src/tools/why3execute.cmx bin/why3execute.byte: lib/why3/why3.cma src/tools/why3execute.cmo bin/why3extract.opt: lib/why3/why3.cmxa src/tools/why3extract.cmx bin/why3extract.byte: lib/why3/why3.cma src/tools/why3extract.cmo bin/why3prove.opt: lib/why3/why3.cmxa src/tools/why3prove.cmx bin/why3prove.byte: lib/why3/why3.cma src/tools/why3prove.cmo bin/why3realize.opt: lib/why3/why3.cmxa src/tools/why3realize.cmx bin/why3realize.byte: lib/why3/why3.cma src/tools/why3realize.cmo bin/why3replay.opt: lib/why3/why3.cmxa src/tools/why3replay.cmx bin/why3replay.byte: lib/why3/why3.cma src/tools/why3replay.cmo bin/why3wc.opt: src/tools/why3wc.cmx bin/why3wc.byte: src/tools/why3wc.cmo clean_old_install:: rm -f $(TOOLS_BIN:%=$(TOOLDIR)/%$(EXE)) $(BINDIR)/why3$(EXE) rm -f $(BINDIR)/why3bench$(EXE) $(BINDIR)/why3replayer$(EXE) install_no_local:: $(INSTALL) bin/why3.@OCAMLBEST@ $(BINDIR)/why3$(EXE) $(INSTALL) bin/why3config.@OCAMLBEST@ $(TOOLDIR)/why3config$(EXE) $(INSTALL) bin/why3execute.@OCAMLBEST@ $(TOOLDIR)/why3execute$(EXE) $(INSTALL) bin/why3extract.@OCAMLBEST@ $(TOOLDIR)/why3extract$(EXE) $(INSTALL) bin/why3prove.@OCAMLBEST@ $(TOOLDIR)/why3prove$(EXE) $(INSTALL) bin/why3realize.@OCAMLBEST@ $(TOOLDIR)/why3realize$(EXE) $(INSTALL) bin/why3replay.@OCAMLBEST@ $(TOOLDIR)/why3replay$(EXE) $(INSTALL) bin/why3wc.@OCAMLBEST@ $(TOOLDIR)/why3wc$(EXE) install_local:: bin/why3 $(addprefix bin/,$(TOOLS_BIN)) bin/%: bin/%.@OCAMLBEST@ ln -sf $(notdir $<) $@ install_local:: share/drivers share/modules share/theories share/drivers: ln -snf ../drivers share/drivers share/modules: ln -snf ../modules share/modules share/theories: ln -snf ../theories share/theories ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(TOOLSDEP) endif depend: $(TOOLSDEP) CLEANDIRS += src/tools GENERATED += $(TOOLSGENERATED) clean:: rm -f bin/why3* ############## # test targets ############## %.gui: %.why bin/why3ide.opt bin/why3ide.opt $*.why %: %.mlw bin/why3.opt bin/why3.opt $*.mlw %: %.why bin/why3.opt bin/why3.opt $*.why %.gui: %.mlw bin/why3ide.opt bin/why3ide.opt $*.mlw %.type: %.mlw bin/why3ide.opt bin/why3.opt --type-only $*.mlw ########## # gallery ########## # we export exactly the programs that have a why3session.xml file .PHONY: gallery gallery:: @if test "$(GALLERYDIR)" = ""; then echo "set GALLERYDIR first"; exit 1; fi @for x in examples/*/why3session.xml ; do \ d=`dirname $$x`; \ f=`basename $$d`; \ why3 session html $$x; \ echo "exporting $$f"; \ mkdir -p $(GALLERYDIR)/$$f; \ cp examples/$$f.mlw examples/$$f/why3session.html $(GALLERYDIR)/$$f/; \ rm -f $(GALLERYDIR)/$$f/$$f.zip; \ cd examples/; \ zip -r $(GALLERYDIR)/$$f/$$f.zip $$f.mlw $$f; \ cd ..; \ done .PHONY: gallery-subs GALLERYSUBS=avl gallery-subs:: @if test "$(GALLERYDIR)" = ""; then echo "set GALLERYDIR first"; exit 1; fi @for d in $(GALLERYSUBS) ; do \ echo "exporting examples/$$d"; \ rm -f $(GALLERYDIR)/$$d/$$d.zip; \ cd examples/$$d; \ why3 -L . doc --stdlib-url http://why3.lri.fr/stdlib/ *.mlw -o $(GALLERYDIR)/$$d; \ cd ..; \ zip -r $(GALLERYDIR)/$$d/$$d.zip $$d; \ cd ..; \ done %-gallery:: @if test "$(GALLERYDIR)" = ""; then echo "set GALLERYDIR first"; exit 1; fi x=$*/why3session.xml; \ d=`dirname $$x`; \ f=`basename $$d`; \ why3 session html $$d; \ rm $$d/*.bak; \ echo "exporting $$f"; \ mkdir -p $(GALLERYDIR)/$$f; \ if test -f examples/$$f.mlw; then cp examples/$$f.mlw $(GALLERYDIR)/$$f/; fi; \ if test -f examples/$$f.why; then cp examples/$$f.why $(GALLERYDIR)/$$f/; fi; \ cp examples/$$f/why3session.html $(GALLERYDIR)/$$f/; \ rm -f $(GALLERYDIR)/$$f/$$f.zip; \ cd examples/; \ zip -r $(GALLERYDIR)/$$f/$$f.zip $$f.mlw $$f ######## # XML DTD validation ######## .PHONY: xml-validate xml-validate: @for x in `find examples/ -name why3session.xml`; do \ xmllint --noout --valid $$x 2>&1 | head -1; \ done xml-validate-local: @for x in `find examples/ -name why3session.xml`; do \ xmllint --noout --dtdvalid share/why3session.dtd $$x 2>&1 | head -1; \ done ############### # IDE ############### ifeq (@enable_ide@,yes) IDE_FILES = gconfig gmain IDEMODULES = $(addprefix src/ide/, $(IDE_FILES)) IDEDEP = $(addsuffix .dep, $(IDEMODULES)) IDECMO = $(addsuffix .cmo, $(IDEMODULES)) IDECMX = $(addsuffix .cmx, $(IDEMODULES)) $(IDEDEP): DEPFLAGS += -I src/ide $(IDECMO) $(IDECMX): INCLUDES += -I src/ide # build targets byte: bin/why3ide.byte opt: bin/why3ide.opt bin/why3ide.opt bin/why3ide.byte: INCLUDES += -I @LABLGTK2LIB@ bin/why3ide.opt bin/why3ide.byte: EXTLIBS += lablgtk lablgtksourceview2 bin/why3ide.opt: lib/why3/why3.cmxa src/ide/resetgc.o $(IDECMX) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) -o $@ $(OLINKFLAGS) $^ bin/why3ide.byte: lib/why3/why3.cma src/ide/resetgc.o $(IDECMO) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -o $@ $(BLINKFLAGS) -custom $^ src/ide/resetgc.o: src/ide/resetgc.c $(SHOW) 'Ocamlc $<' $(HIDE)$(OCAMLC) -c -ccopt "-Wall -o $@" $< # depend and clean targets ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(IDEDEP) endif depend: $(IDEDEP) CLEANDIRS += src/ide clean_old_install:: rm -f $(BINDIR)/why3ide$(EXE) install_no_local:: $(INSTALL) bin/why3ide.@OCAMLBEST@ $(TOOLDIR)/why3ide$(EXE) install_local:: bin/why3ide endif ############### # Session ############### SESSION_FILES = why3session_lib why3session_copy why3session_info \ why3session_latex why3session_html why3session_rm \ why3session_output why3session_run why3session_csv \ why3session_main SESSIONMODULES = $(addprefix src/why3session/, $(SESSION_FILES)) SESSIONDEP = $(addsuffix .dep, $(SESSIONMODULES)) SESSIONCMO = $(addsuffix .cmo, $(SESSIONMODULES)) SESSIONCMX = $(addsuffix .cmx, $(SESSIONMODULES)) $(SESSIONDEP): DEPFLAGS += -I src/why3session $(SESSIONCMO) $(SESSIONCMX): INCLUDES += -I src/why3session # build targets byte: bin/why3session.byte opt: bin/why3session.opt bin/why3session.opt: lib/why3/why3.cmxa $(SESSIONCMX) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) -o $@ $(OLINKFLAGS) $^ bin/why3session.byte: lib/why3/why3.cma $(SESSIONCMO) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -o $@ $(BLINKFLAGS) $^ # depend and clean targets ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(SESSIONDEP) endif depend: $(SESSIONDEP) CLEANDIRS += src/why3session clean_old_install:: rm -f $(BINDIR)/why3session$(EXE) install_no_local:: $(INSTALL) bin/why3session.@OCAMLBEST@ $(TOOLDIR)/why3session$(EXE) install_local:: bin/why3session ############## # Coq plugin ############## ifeq (@enable_coq_tactic@,yes) COQPGENERATED = src/coq-tactic/why3tac.ml COQP_FILES = why3tac COQPMODULES = $(addprefix src/coq-tactic/, $(COQP_FILES)) COQPDEP = $(addsuffix .dep, $(COQPMODULES)) COQPCMO = $(addsuffix .cmo, $(COQPMODULES)) COQPCMX = $(addsuffix .cmx, $(COQPMODULES)) COQPTREES = engine interp intf kernel lib library ltac parsing pretyping printing proofs tactics toplevel COQPINCLUDES = -I src/coq-tactic -I $(COQCAMLPLIB) $(addprefix -I @COQLIB@/, $(COQPTREES)) @ZIPINCLUDE@ $(COQPDEP): DEPFLAGS += -I src/coq-tactic $(COQPCMO) $(COQPCMX): INCLUDES += $(COQPINCLUDES) $(COQPCMO) $(COQPCMX): BFLAGS += -rectypes $(COQPCMX): OFLAGS += -rectypes $(COQPDEP): $(COQPGENERATED) byte: src/coq-tactic/.why3-vo-byte opt: src/coq-tactic/.why3-vo-opt lib/coq-tactic/why3tac.cmxs: OFLAGS += $(addsuffix .cmxa, @ZIPLIB@) lib/coq-tactic/why3tac.cmxs: OFLAGS += $(addsuffix .cmx, @MENHIRLIB@) lib/coq-tactic/why3tac.cma: BFLAGS += $(addsuffix .cma, @ZIPLIB@) lib/coq-tactic/why3tac.cma: BFLAGS += $(addsuffix .cmo, @MENHIRLIB@) lib/coq-tactic/why3tac.cmxs: lib/why3/why3.cmxa $(COQPCMX) lib/coq-tactic/why3tac.cma: lib/why3/why3.cma $(COQPCMO) src/coq-tactic/why3tac.ml: src/coq-tactic/why3tac.ml4 $(SHOW) 'Camlp $<' $(HIDE)$(COQCAMLP) pr_dump.cmo @COQPPLIBS@ pa_macro.cmo -D@coq_compat_version@ -impl $^ -o $@ COQRTAC = -R lib/coq-tactic Why3 -R lib/coq Why3 ifeq (@coq_compat_version@,COQ86) COQRTAC += -I lib/coq-tactic endif src/coq-tactic/.why3-vo-byte: lib/coq-tactic/Why3.v lib/coq/BuiltIn.vo lib/coq-tactic/why3tac.cma $(SHOW) 'Coqc $<' $(HIDE)WHY3CONFIG="" $(COQC) -byte $(COQRTAC) $< && \ touch src/coq-tactic/.why3-vo-byte src/coq-tactic/.why3-vo-opt: lib/coq-tactic/Why3.v lib/coq/BuiltIn.vo lib/coq-tactic/why3tac.cmxs $(SHOW) 'Coqc $<' $(HIDE)WHY3CONFIG="" $(COQC) -opt $(COQRTAC) $< && \ touch src/coq-tactic/.why3-vo-opt # depend and clean targets ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(COQPDEP) endif depend: $(COQPDEP) CLEANDIRS += src/coq-tactic CLEANLIBS += lib/coq-tactic/why3tac GENERATED += $(COQPGENERATED) clean:: rm -f lib/coq-tactic/*.vo lib/coq-tactic/*.glob rm -f src/coq-tactic/.why3-vo-* install_no_local:: $(MKDIR_P) $(LIBDIR)/why3/coq-tactic $(INSTALL_DATA) lib/coq-tactic/* $(LIBDIR)/why3/coq-tactic endif #################### # Coq realizations #################### ifeq (@enable_coq_support@,yes) ifeq (@enable_coq_libs@,yes) COQVERSIONSPECIFIC=bv/BV_Gen.v COQVERSIONSPECIFICTARGETS=$(addprefix lib/coq/, $(COQVERSIONSPECIFIC)) COQVERSIONSPECIFICSOURCES=$(addsuffix .@coq_compat_version@, $(COQVERSIONSPECIFICTARGETS)) $(COQVERSIONSPECIFICTARGETS): $(COQVERSIONSPECIFICSOURCES) for i in $(COQVERSIONSPECIFIC); do \ cp lib/coq/$$i.@coq_compat_version@ lib/coq/$$i ; \ done clean:: rm -f $(COQVERSIONSPECIFICTARGETS) COQLIBS_INT_FILES = Abs ComputerDivision Div2 EuclideanDivision Int MinMax Power NumOf COQLIBS_INT_ALL_FILES = Exponentiation $(COQLIBS_INT_FILES) COQLIBS_INT = $(addprefix lib/coq/int/, $(COQLIBS_INT_ALL_FILES)) COQLIBS_BOOL_FILES = Bool COQLIBS_BOOL = $(addprefix lib/coq/bool/, $(COQLIBS_BOOL_FILES)) COQLIBS_REAL_FILES = Abs ExpLog FromInt MinMax PowerInt PowerReal Real RealInfix Square Trigonometry COQLIBS_REAL = $(addprefix lib/coq/real/, $(COQLIBS_REAL_FILES)) COQLIBS_NUMBER_FILES = Divisibility Gcd Parity Prime Coprime COQLIBS_NUMBER = $(addprefix lib/coq/number/, $(COQLIBS_NUMBER_FILES)) COQLIBS_SET_FILES = Set COQLIBS_SET = $(addprefix lib/coq/set/, $(COQLIBS_SET_FILES)) COQLIBS_MAP_FILES = Map Const Occ MapPermut MapInjection COQLIBS_MAP = $(addprefix lib/coq/map/, $(COQLIBS_MAP_FILES)) COQLIBS_LIST_FILES = List Length Mem Nth NthLength HdTl NthHdTl Append NthLengthAppend Reverse HdTlNoOpt NthNoOpt RevAppend Combine Distinct NumOcc Permut COQLIBS_LIST = $(addprefix lib/coq/list/, $(COQLIBS_LIST_FILES)) COQLIBS_OPTION_FILES = Option COQLIBS_OPTION = $(addprefix lib/coq/option/, $(COQLIBS_OPTION_FILES)) COQLIBS_SEQ_FILES = Seq COQLIBS_SEQ = $(addprefix lib/coq/seq/, $(COQLIBS_SEQ_FILES)) COQLIBS_BV_FILES = Pow2int BV_Gen COQLIBS_BV = $(addprefix lib/coq/bv/, $(COQLIBS_BV_FILES)) ifeq (@enable_coq_fp_libs@,yes) COQLIBS_FP_FILES = Rounding SingleFormat Single DoubleFormat Double COQLIBS_FP_ALL_FILES = GenFloat $(COQLIBS_FP_FILES) COQLIBS_FP = $(addprefix lib/coq/floating_point/, $(COQLIBS_FP_ALL_FILES)) endif COQLIBS_FILES = lib/coq/BuiltIn lib/coq/HighOrd $(COQLIBS_INT) $(COQLIBS_BOOL) $(COQLIBS_REAL) $(COQLIBS_NUMBER) $(COQLIBS_SET) $(COQLIBS_MAP) $(COQLIBS_LIST) $(COQLIBS_OPTION) $(COQLIBS_SEQ) $(COQLIBS_FP) $(COQLIBS_BV) drivers/coq-realizations.aux: Makefile $(SHOW) 'Generate $@' $(HIDE)(echo "(* generated automatically at compilation time *)"; \ echo 'theory BuiltIn meta "realized_theory" "BuiltIn", "" end'; \ echo 'theory HighOrd meta "realized_theory" "HighOrd", "" end'; \ for f in $(COQLIBS_INT_FILES); do \ echo 'theory int.'"$$f"' meta "realized_theory" "int.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_BOOL_FILES); do \ echo 'theory bool.'"$$f"' meta "realized_theory" "bool.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_REAL_FILES); do \ echo 'theory real.'"$$f"' meta "realized_theory" "real.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_NUMBER_FILES); do \ echo 'theory number.'"$$f"' meta "realized_theory" "number.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_SET_FILES); do \ echo 'theory set.'"$$f"' meta "realized_theory" "set.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_MAP_FILES); do \ echo 'theory map.'"$$f"' meta "realized_theory" "map.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_LIST_FILES); do \ echo 'theory list.'"$$f"' meta "realized_theory" "list.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_OPTION_FILES); do \ echo 'theory option.'"$$f"' meta "realized_theory" "option.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_SEQ_FILES); do \ echo 'theory seq.'"$$f"' meta "realized_theory" "seq.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_BV_FILES); do \ echo 'theory bv.'"$$f"' meta "realized_theory" "bv.'"$$f"'", "" end'; done; \ for f in $(COQLIBS_FP_FILES); do \ echo 'theory floating_point.'"$$f"' meta "realized_theory" "floating_point.'"$$f"'", "" end'; done; \ ) > $@ install_no_local:: $(MKDIR_P) $(LIBDIR)/why3/coq $(INSTALL_DATA) lib/coq/BuiltIn.vo lib/coq/HighOrd.vo $(LIBDIR)/why3/coq/ $(MKDIR_P) $(LIBDIR)/why3/coq/int $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_INT)) $(LIBDIR)/why3/coq/int/ $(MKDIR_P) $(LIBDIR)/why3/coq/bool $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_BOOL)) $(LIBDIR)/why3/coq/bool/ $(MKDIR_P) $(LIBDIR)/why3/coq/real $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_REAL)) $(LIBDIR)/why3/coq/real/ $(MKDIR_P) $(LIBDIR)/why3/coq/number $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_NUMBER)) $(LIBDIR)/why3/coq/number/ $(MKDIR_P) $(LIBDIR)/why3/coq/set $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_SET)) $(LIBDIR)/why3/coq/set/ $(MKDIR_P) $(LIBDIR)/why3/coq/map $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_MAP)) $(LIBDIR)/why3/coq/map/ $(MKDIR_P) $(LIBDIR)/why3/coq/list $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_LIST)) $(LIBDIR)/why3/coq/list/ $(MKDIR_P) $(LIBDIR)/why3/coq/option $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_OPTION)) $(LIBDIR)/why3/coq/option/ $(MKDIR_P) $(LIBDIR)/why3/coq/seq $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_SEQ)) $(LIBDIR)/why3/coq/seq/ $(MKDIR_P) $(LIBDIR)/why3/coq/bv $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_BV)) $(LIBDIR)/why3/coq/bv/ ifeq (@enable_coq_fp_libs@,yes) $(MKDIR_P) $(LIBDIR)/why3/coq/floating_point $(INSTALL_DATA) $(addsuffix .vo, $(COQLIBS_FP)) $(LIBDIR)/why3/coq/floating_point/ endif update-coq: remove-coq-headers update-coq-int update-coq-bool update-coq-real update-coq-number update-coq-set update-coq-map update-coq-list update-coq-option update-coq-fp update-coq-seq update-coq-bv headers-coq update-coq-int: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/int.why for f in $(COQLIBS_INT_ALL_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T int.$$f -o lib/coq/int/; done update-coq-bool: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/bool.why for f in $(COQLIBS_BOOL_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T bool.$$f -o lib/coq/bool/; done update-coq-real: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/real.why for f in $(COQLIBS_REAL_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T real.$$f -o lib/coq/real/; done update-coq-number: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/number.why for f in $(COQLIBS_NUMBER_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T number.$$f -o lib/coq/number/; done update-coq-set: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/set.why for f in $(COQLIBS_SET_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T set.$$f -o lib/coq/set/; done update-coq-map: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/map.why for f in $(COQLIBS_MAP_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T map.$$f -o lib/coq/map/; done update-coq-list: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/list.why for f in $(COQLIBS_LIST_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T list.$$f -o lib/coq/list/; done update-coq-option: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/option.why for f in $(COQLIBS_OPTION_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T option.$$f -o lib/coq/option/; done update-coq-seq: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/seq.why for f in $(COQLIBS_SEQ_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T seq.$$f -o lib/coq/seq/; done update-coq-bv: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/bv.why for f in $(COQLIBS_BV_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T bv.$$f -o lib/coq/bv/; done update-coq-fp: bin/why3realize.@OCAMLBEST@ drivers/coq-realizations.aux theories/floating_point.why for f in $(COQLIBS_FP_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/coq-realize.drv -T floating_point.$$f -o lib/coq/floating_point/; done else drivers/coq-realizations.aux: Makefile $(SHOW) 'Generate $@' $(HIDE)echo "(* generated automatically at compilation time *)" > $@ COQLIBS_FILES = lib/coq/BuiltIn lib/coq/HighOrd endif COQV = $(addsuffix .v, $(COQLIBS_FILES)) COQVO = $(addsuffix .vo, $(COQLIBS_FILES)) COQVD = $(addsuffix .vd, $(COQLIBS_FILES)) %.vo: %.v $(SHOW) 'Coqc $<' $(HIDE)$(COQC) -R lib/coq Why3 $< %.vd: %.v $(SHOW) 'Coqdep $<' $(HIDE)$(COQDEP) -R lib/coq Why3 $< $(TOTARGET) all: $(COQVO) ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" ifneq "$(MAKECMDGOALS:update-coq%=update-coq)" "update-coq" -include $(COQVD) endif endif depend: $(COQVD) clean-coq: rm -f $(COQVO) $(COQVD) $(addsuffix .glob, $(COQLIBS_FILES)) clean:: clean-coq else drivers/coq-realizations.aux: Makefile $(SHOW) 'Generate $@' $(HIDE)echo "(* generated automatically at compilation time *)" > $@ endif all: drivers/coq-realizations.aux install_no_local:: $(INSTALL_DATA) drivers/coq-realizations.aux $(DATADIR)/why3/drivers/ clean:: rm -f drivers/coq-realizations.aux #################### # PVS realizations #################### ifeq (@enable_pvs_libs@,yes) PVSLIBS_INT_FILES = Int Abs MinMax ComputerDivision EuclideanDivision PVSLIBS_INT = $(addprefix lib/pvs/int/, $(PVSLIBS_INT_FILES)) PVSLIBS_REAL_FILES = Abs FromInt MinMax Real Square ExpLog Trigonometry \ PowerInt # RealInfix PVSLIBS_REAL = $(addprefix lib/pvs/real/, $(PVSLIBS_REAL_FILES)) PVSLIBS_LIST_FILES = # Nth PVSLIBS_LIST = $(addprefix lib/pvs/int/, $(PVSLIBS_LIST_FILES)) PVSLIBS_NUMBER_FILES = # Divisibility Gcd Parity Prime PVSLIBS_NUMBER = $(addprefix lib/pvs/number/, $(PVSLIBS_NUMBER_FILES)) PVSLIBS_FP_FILES = Rounding SingleFormat Single DoubleFormat Double PVSLIBS_FP_ALL_FILES = $(PVSLIBS_FP_FILES) PVSLIBS_FP = $(addprefix lib/pvs/floating_point/, $(PVSLIBS_FP_ALL_FILES)) PVSLIBS_FILES = $(PVSLIBS_INT) $(PVSLIBS_REAL) $(PVSLIBS_LIST) \ $(PVSLIBS_NUMBER) $(PVSLIBS_FP) drivers/pvs-realizations.aux: Makefile $(SHOW) 'Generate $@' $(HIDE)(echo "(* generated automatically at compilation time *)"; \ for f in $(PVSLIBS_INT_FILES); do \ echo 'theory int.'"$$f"' meta "realized_theory" "int.'"$$f"'", "" end'; done; \ for f in $(PVSLIBS_REAL_FILES); do \ echo 'theory real.'"$$f"' meta "realized_theory" "real.'"$$f"'", "" end'; done; \ for f in $(PVSLIBS_LIST_FILES); do \ echo 'theory list.'"$$f"' meta "realized_theory" "list.'"$$f"'", "" end'; done; \ for f in $(PVSLIBS_NUMBER_FILES); do \ echo 'theory number.'"$$f"' meta "realized_theory" "number.'"$$f"'", "" end'; done; \ for f in $(PVSLIBS_FP_FILES); do \ echo 'theory floating_point.'"$$f"' meta "realized_theory" "floating_point.'"$$f"'", "" end'; done; \ ) > $@ install_no_local:: $(MKDIR_P) $(LIBDIR)/why3/pvs/int $(INSTALL_DATA) $(addsuffix .pvs, $(PVSLIBS_INT)) $(LIBDIR)/why3/pvs/int/ $(INSTALL_DATA) $(addsuffix .prf, $(PVSLIBS_INT)) $(LIBDIR)/why3/pvs/int/ $(MKDIR_P) $(LIBDIR)/why3/pvs/real $(INSTALL_DATA) $(addsuffix .pvs, $(PVSLIBS_REAL)) $(LIBDIR)/why3/pvs/real/ $(INSTALL_DATA) $(addsuffix .prf, $(PVSLIBS_REAL)) $(LIBDIR)/why3/pvs/real/ $(MKDIR_P) $(LIBDIR)/why3/pvs/floating_point/ $(INSTALL_DATA) $(addsuffix .pvs, $(PVSLIBS_FP)) $(LIBDIR)/why3/pvs/floating_point/ $(INSTALL_DATA) drivers/pvs-realizations.aux $(DATADIR)/why3/drivers/ update-pvs: bin/why3realize.@OCAMLBEST@ drivers/pvs-realizations.aux for f in $(PVSLIBS_INT_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/pvs-realize.drv -T int.$$f -o lib/pvs/int/; done for f in $(PVSLIBS_REAL_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/pvs-realize.drv -T real.$$f -o lib/pvs/real/; done for f in $(PVSLIBS_LIST_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/pvs-realize.drv -T list.$$f -o lib/pvs/list/; done for f in $(PVSLIBS_NUMBER_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/pvs-realize.drv -T number.$$f -o lib/pvs/number/; done for f in $(PVSLIBS_FP_FILES); do WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D drivers/pvs-realize.drv -T floating_point.$$f -o lib/pvs/floating_point/; done else drivers/pvs-realizations.aux: Makefile $(SHOW) 'Generate $@' $(HIDE)echo "(* generated automatically at compilation time *)" > $@ install_no_local:: $(INSTALL_DATA) drivers/pvs-realizations.aux $(DATADIR)/why3/drivers/ endif all: drivers/pvs-realizations.aux clean:: rm -f drivers/pvs-realizations.aux ####################### # Isabelle realizations ####################### ifeq (@enable_isabelle_libs@,yes) ISABELLEVERSIONSPECIFIC=why3.ML Why3_Bool.thy Why3_BV.thy Why3_Int.thy Why3_List.thy Why3_Number.thy Why3_Set.thy ISABELLEVERSIONSPECIFICTARGETS=$(addprefix lib/isabelle/, $(ISABELLEVERSIONSPECIFIC)) ISABELLEVERSIONSPECIFICSOURCES=$(addsuffix .@ISABELLEVERSION@, $(ISABELLEVERSIONSPECIFICTARGETS)) ISABELLEREALIZEDRV=drivers/isabelle@ISABELLEVERSION@-realize.drv $(ISABELLEVERSIONSPECIFICTARGETS): $(ISABELLEVERSIONSPECIFICSOURCES) for i in $(ISABELLEVERSIONSPECIFIC); do \ cp lib/isabelle/$$i.@ISABELLEVERSION@ lib/isabelle/$$i ; \ done clean:: rm -f $(ISABELLEVERSIONSPECIFICTARGETS) ISABELLELIBS_INT_FILES = Abs ComputerDivision Div2 EuclideanDivision Int MinMax Power ISABELLELIBS_INT = $(addsuffix .xml, $(addprefix lib/isabelle/int/, $(ISABELLELIBS_INT_FILES))) ISABELLELIBS_BOOL_FILES = Bool ISABELLELIBS_BOOL = $(addsuffix .xml, $(addprefix lib/isabelle/bool/, $(ISABELLELIBS_BOOL_FILES))) ISABELLELIBS_REAL_FILES = Real RealInfix Abs MinMax FromInt Truncate Square ExpLog Trigonometry PowerInt # not yet realized : PowerReal Hyperbolic Polar ISABELLELIBS_REAL = $(addsuffix .xml, $(addprefix lib/isabelle/real/, $(ISABELLELIBS_REAL_FILES))) ISABELLELIBS_NUMBER_FILES = Divisibility Gcd Parity Prime Coprime ISABELLELIBS_NUMBER = $(addsuffix .xml, $(addprefix lib/isabelle/number/, $(ISABELLELIBS_NUMBER_FILES))) ISABELLELIBS_SET_FILES = Set Fset ISABELLELIBS_SET = $(addsuffix .xml, $(addprefix lib/isabelle/set/, $(ISABELLELIBS_SET_FILES))) ISABELLELIBS_MAP_FILES = Map Const Occ MapPermut MapInjection ISABELLELIBS_MAP = $(addsuffix .xml, $(addprefix lib/isabelle/map/, $(ISABELLELIBS_MAP_FILES))) ISABELLELIBS_LIST_FILES = List Length Mem Nth NthNoOpt NthLength HdTl NthHdTl Append NthLengthAppend Reverse HdTlNoOpt RevAppend Combine Distinct NumOcc Permut ISABELLELIBS_LIST = $(addsuffix .xml, $(addprefix lib/isabelle/list/, $(ISABELLELIBS_LIST_FILES))) ISABELLELIBS_BV_FILES = Pow2int BV8 BV16 BV32 BV64 BVConverter_32_64 BVConverter_16_64 BVConverter_8_64 BVConverter_16_32 BVConverter_8_32 BVConverter_8_16 ISABELLELIBS_BV = $(addsuffix .xml, $(addprefix lib/isabelle/bv/, $(ISABELLELIBS_BV_FILES))) drivers/isabelle-realizations.aux: Makefile $(SHOW) 'Generate $@' $(HIDE)(echo "(* generated automatically at compilation time *)"; \ echo 'theory BuiltIn meta "realized_theory" "BuiltIn", "" end'; \ for f in $(ISABELLELIBS_INT_FILES); do \ echo 'theory int.'"$$f"' meta "realized_theory" "int.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_BOOL_FILES); do \ echo 'theory bool.'"$$f"' meta "realized_theory" "bool.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_REAL_FILES); do \ echo 'theory real.'"$$f"' meta "realized_theory" "real.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_NUMBER_FILES); do \ echo 'theory number.'"$$f"' meta "realized_theory" "number.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_SET_FILES); do \ echo 'theory set.'"$$f"' meta "realized_theory" "set.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_MAP_FILES); do \ echo 'theory map.'"$$f"' meta "realized_theory" "map.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_LIST_FILES); do \ echo 'theory list.'"$$f"' meta "realized_theory" "list.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_OPTION_FILES); do \ echo 'theory option.'"$$f"' meta "realized_theory" "option.'"$$f"'", "" end'; done; \ for f in $(ISABELLELIBS_BV_FILES); do \ echo 'theory bv.'"$$f"' meta "realized_theory" "bv.'"$$f"'", "" end'; done; \ ) > $@ ifeq (@enable_local@,yes) ISABELLE_TARGET_DIR=`pwd`/lib/isabelle else ISABELLE_TARGET_DIR=$(LIBDIR)/why3/isabelle endif lib/isabelle/last_build: $(ISABELLEVERSIONSPECIFICTARGETS) $(ISABELLELIBS_INT) $(ISABELLELIBS_BOOL) $(ISABELLELIBS_REAL) $(ISABELLELIBS_NUMBER) $(ISABELLELIBS_SET) $(ISABELLELIBS_MAP) $(ISABELLELIBS_LIST) $(ISABELLELIBS_OPTION) $(ISABELLELIBS_BV) ifneq (@enable_local@,yes) cp -r lib/isabelle "$(LIBDIR)/why3" endif @(if isabelle components -l | grep -q "$(ISABELLE_TARGET_DIR)$$"; then \ echo "Building the Why3 heap for Isabelle/HOL:"; \ isabelle build -bc Why3; \ touch $@; \ else \ echo "[Warning] Cannot pre-build the Isabelle heap because"; \ echo " the Isabelle component configuration does not contain"; \ echo " [$(ISABELLE_TARGET_DIR)]"; \ fi) install_no_local:: $(INSTALL_DATA) drivers/isabelle-realizations.aux $(DATADIR)/why3/drivers/ install_no_local:: lib/isabelle/last_build install_local:: lib/isabelle/last_build update-isabelle: $(ISABELLELIBS_INT) $(ISABELLELIBS_BOOL) $(ISABELLELIBS_REAL) $(ISABELLELIBS_NUMBER) $(ISABELLELIBS_SET) $(ISABELLELIBS_MAP) $(ISABELLELIBS_LIST) $(ISABELLELIBS_OPTION) $(ISABELLELIBS_BV) $(ISABELLELIBS_INT): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/int.why mkdir -p lib/isabelle/int WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T int.$(notdir $(basename $@)) -o lib/isabelle/int/ $(ISABELLELIBS_BOOL): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/bool.why mkdir -p lib/isabelle/bool WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T bool.$(notdir $(basename $@)) -o lib/isabelle/bool/ $(ISABELLELIBS_REAL): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/real.why mkdir -p lib/isabelle/real WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T real.$(notdir $(basename $@)) -o lib/isabelle/real/ $(ISABELLELIBS_NUMBER): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/number.why mkdir -p lib/isabelle/number WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T number.$(notdir $(basename $@)) -o lib/isabelle/number/ $(ISABELLELIBS_SET): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/set.why mkdir -p lib/isabelle/set WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T set.$(notdir $(basename $@)) -o lib/isabelle/set/ $(ISABELLELIBS_MAP): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/map.why mkdir -p lib/isabelle/map WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T map.$(notdir $(basename $@)) -o lib/isabelle/map/ $(ISABELLELIBS_LIST): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/list.why mkdir -p lib/isabelle/list WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T list.$(notdir $(basename $@)) -o lib/isabelle/list/ $(ISABELLELIBS_OPTION): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/option.why mkdir -p lib/isabelle/option WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T option.$(notdir $(basename $@)) -o lib/isabelle/option/ $(ISABELLELIBS_BV): bin/why3realize.@OCAMLBEST@ drivers/isabelle-realizations.aux \ $(ISABELLEREALIZEDRV) drivers/isabelle-common.gen theories/bv.why mkdir -p lib/isabelle/bv WHY3CONFIG="" bin/why3realize.@OCAMLBEST@ -L theories -D $(ISABELLEREALIZEDRV) -T bv.$(notdir $(basename $@)) -o lib/isabelle/bv/ # do not update isabelle realizations systematically # all: update-isabelle clean:: rm -f lib/isabelle/*/*.xml else drivers/isabelle-realizations.aux: Makefile $(SHOW) 'Generate $@' $(HIDE)echo "(* generated automatically at compilation time *)" > $@ install_no_local:: $(INSTALL_DATA) drivers/isabelle-realizations.aux $(DATADIR)/why3/drivers/ endif all: drivers/isabelle-realizations.aux clean:: rm -f drivers/isabelle-realizations.aux ####################### # Ocaml realizations ####################### OCAMLLIBS_FILES = why3__BigInt_compat why3__BigInt why3__IntAux why3__Array \ why3__Matrix OCAMLLIBS_MODULES := $(addprefix lib/ocaml/, $(OCAMLLIBS_FILES)) OCAMLLIBS_DEP = $(addsuffix .dep, $(OCAMLLIBS_MODULES)) OCAMLLIBS_CMO = $(addsuffix .cmo, $(OCAMLLIBS_MODULES)) OCAMLLIBS_CMX = $(addsuffix .cmx, $(OCAMLLIBS_MODULES)) $(OCAMLLIBS_DEP): DEPFLAGS += -I src/util -I lib/ocaml @BIGINTINCLUDE@ $(OCAMLLIBS_CMO) $(OCAMLLIBS_CMX): INCLUDES += -I src/util -I lib/ocaml @BIGINTINCLUDE@ $(OCAMLLIBS_CMX): OFLAGS += -for-pack Why3extract byte: $(OCAMLLIBS_CMO) opt: $(OCAMLLIBS_CMX) byte: lib/why3/why3extract.cma opt: lib/why3/why3extract.cmxa lib/why3/why3extract.cma: lib/why3/why3extract.cmo lib/why3/why3extract.cmxa: lib/why3/why3extract.cmx lib/why3/why3extract.cmo: $(OCAMLLIBS_CMO) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -pack -o $@ $^ lib/why3/why3extract.cmx: $(OCAMLLIBS_CMX) lib/why3/why3extract.cmo $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) $(CMIHACK) -pack -o $@ $(filter %.cmx, $^) install_no_local_lib:: $(MKDIR_P) $(OCAMLINSTALLLIB)/why3 $(INSTALL_DATA) $(wildcard $(addprefix lib/why3/why3extract., $(INSTALLED_LIB_EXTS))) \ $(OCAMLINSTALLLIB)/why3 ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(OCAMLLIBS_DEP) endif $(OCAMLLIBS_DEP): lib/ocaml/why3__BigInt_compat.ml depend: $(OCAMLLIBS_DEP) CLEANDIRS += lib/ocaml CLEANLIBS += lib/why3/why3extract ################ # Jessie3 plugin ################ ifeq (@enable_frama_c@,yes) nobyte: jessie.byte noopt: jessie.opt jessie.byte: src/jessie/Makefile lib/why3/why3.cma @$(MAKE) -C src/jessie Jessie3.cma jessie.opt: src/jessie/Makefile lib/why3/why3.cmxa @$(MAKE) -C src/jessie Jessie3.cmxs install_no_local:: $(MKDIR_P) $(FRAMAC_LIBDIR)/plugins/ $(INSTALL_DATA) $(wildcard $(addprefix src/jessie/Jessie3., $(INSTALLED_LIB_EXTS))) \ $(FRAMAC_LIBDIR)/plugins/ clean:: $(MAKE) -C src/jessie clean endif ####### # tools ####### TOOLS = lib/why3-cpulimit$(EXE) all: $(TOOLS) lib/why3-cpulimit$(EXE): src/tools/@CPULIMIT@.c $(SHOW) 'Cc $^' $(HIDE)$(CC) -Wall -o $@ $^ clean:: rm -f lib/why3-cpulimit$(EXE) install_no_local:: $(MKDIR_P) $(LIBDIR)/why3 $(INSTALL) lib/why3-cpulimit$(EXE) $(LIBDIR)/why3/why3-cpulimit$(EXE) $(INSTALL) lib/why3-call-pvs $(LIBDIR)/why3/why3-call-pvs ######### # why3doc ######### WHY3DOCGENERATED = src/why3doc/doc_lexer.ml WHY3DOC_FILES = doc_html doc_def doc_lexer doc_main WHY3DOCMODULES = $(addprefix src/why3doc/, $(WHY3DOC_FILES)) WHY3DOCDEP = $(addsuffix .dep, $(WHY3DOCMODULES)) WHY3DOCCMO = $(addsuffix .cmo, $(WHY3DOCMODULES)) WHY3DOCCMX = $(addsuffix .cmx, $(WHY3DOCMODULES)) $(WHY3DOCDEP): DEPFLAGS += -I src/why3doc $(WHY3DOCCMO) $(WHY3DOCCMX): INCLUDES += -I src/why3doc $(WHY3DOCDEP): $(WHY3DOCGENERATED) # build targets byte: bin/why3doc.byte opt: bin/why3doc.opt bin/why3doc.opt: lib/why3/why3.cmxa $(WHY3DOCCMX) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) $(OFLAGS) -o $@ $(OLINKFLAGS) $^ bin/why3doc.byte: lib/why3/why3.cma $(WHY3DOCCMO) $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) $(BFLAGS) -o $@ $(BLINKFLAGS) $^ # depend and clean targets ifneq "$(MAKECMDGOALS:clean%=clean)" "clean" -include $(WHY3DOCDEP) endif depend: $(WHY3DOCDEP) CLEANDIRS += src/why3doc GENERATED += $(WHY3DOCGENERATED) clean_old_install:: rm -f $(BINDIR)/why3doc$(EXE) install_no_local:: $(INSTALL) bin/why3doc.@OCAMLBEST@ $(TOOLDIR)/why3doc$(EXE) install_local:: bin/why3doc ######### # trywhy3 ######### ALTERGODIR=src/trywhy3/alt-ergo-1.00-private-2015-01-29 JSOCAMLC=ocamlfind ocamlc -package js_of_ocaml -package js_of_ocaml.syntax \ -syntax camlp4o -I src/trywhy3 \ -I $(ALTERGODIR)/src/util \ -I $(ALTERGODIR)/src/structures \ -I $(ALTERGODIR)/src/parsing \ -I $(ALTERGODIR)/src/preprocess \ -I $(ALTERGODIR)/src/theories \ -I $(ALTERGODIR)/src/instances \ -I $(ALTERGODIR)/src/sat \ -I $(ALTERGODIR)/src/main ALTERGOMODS=util/numsNumbers util/numbers \ util/version util/myUnix util/config util/options \ util/hashcons util/hstring util/lists util/loc \ util/profiling_default util/profiling \ util/util \ structures/parsed structures/symbols \ structures/ty structures/errors \ structures/term structures/literal structures/formula \ structures/explanation structures/exception \ parsing/why_parser parsing/why_lexer \ preprocess/existantial preprocess/triggers \ preprocess/why_typing preprocess/cnf \ theories/polynome theories/ac \ theories/intervals theories/inequalities \ theories/intervalCalculus \ theories/arith theories/records theories/bitv \ theories/arrays theories/sum theories/uf theories/use \ theories/combine theories/ccx theories/theory \ instances/matching \ sat/sat_solvers \ main/frontend TRYWHY3CMO=lib/why3/why3.cma $(addprefix $(ALTERGODIR)/src/, $(addsuffix .cmo,$(ALTERGOMODS))) trywhy3: src/trywhy3/trywhy3.js src/trywhy3/index.en.html src/trywhy3/index.fr.html %.fr.html: %.prehtml yamlpp -l fr $< -o $@ %.en.html: %.prehtml yamlpp -l en $< -o $@ src/trywhy3/trywhy3.js: src/trywhy3/trywhy3.byte js_of_ocaml --extern-fs -I . -I src/trywhy3 --file=trywhy3.conf:/ \ --file=try_alt_ergo.drv:/ \ --file=drinkers.why:/ \ --file=simplearith.why:/ \ --file=bin_mult.mlw:/ \ --file=fact.mlw:/ \ --file=isqrt.mlw:/ \ `find theories modules \( -name "*.mlw" -o -name "*.why" \) -printf " --file=%p:/"` \ +weak.js +nat.js $^ src/trywhy3/trywhy3.byte: $(TRYWHY3CMO) src/trywhy3/trywhy3.cmo $(JSOCAMLC) $(BFLAGS) -o $@ -linkpkg $(BLINKFLAGS) $^ src/trywhy3/%.cmo: src/trywhy3/%.ml $(JSOCAMLC) $(BFLAGS) -c $< src/trywhy3/%.cmi: src/trywhy3/%.mli $(JSOCAMLC) $(BFLAGS) -c $< clean:: rm -f src/trywhy3/trywhy3.js src/trywhy3/trywhy3.byte CLEANDIRS += src/trywhy3 ######## # bench ######## .PHONY: bench test bench:: bin/why3.@OCAMLBEST@ bin/why3config.@OCAMLBEST@ plugins $(TOOLS) \ share/Makefile.config bin/why3extract $(MAKE) test-api-logic.@OCAMLBEST@ $(MAKE) test-api-mlw-tree.@OCAMLBEST@ $(MAKE) test-api-mlw.@OCAMLBEST@ $(MAKE) test-session.@OCAMLBEST@ $(MAKE) test-ocaml-extraction # desactivé car requiert findlib # if test -d examples/runstrat ; then \ # $(MAKE) test-runstrat.@OCAMLBEST@ ; fi bash bench/bench ".@OCAMLBEST@" @if test "@enable_coq_tactic@" = "yes"; then \ echo "=== checking the Coq tactic ==="; \ $(MAKE) test-coq-tactic.@OCAMLBEST@; fi ############### # test targets ############### test-api-logic.byte: examples/use_api/logic.ml lib/why3/why3.cma $(SHOW) 'Ocaml $<' $(HIDE)ocaml -I lib/why3 $(INCLUDES) $(EXTCMA) lib/why3/why3.cma $< > /dev/null \ || (rm -f test-api-logic.byte; printf "Test of Why3 API calls failed. Please fix it"; exit 2) @rm -f test-api-logic.byte; test-api-logic.opt: examples/use_api/logic.ml lib/why3/why3.cmxa $(SHOW) 'Ocamlopt $<' $(HIDE)($(OCAMLOPT) -o $@ -I lib/why3 $(INCLUDES) $(EXTCMXA) lib/why3/why3.cmxa $< \ && ./test-api-logic.opt > /dev/null) \ || (rm -f test-api-logic.opt; printf "Test of Why3 API calls failed. Please fix it"; exit 2) @rm -f test-api-logic.opt test-api-mlw-tree.byte: examples/use_api/mlw_tree.ml lib/why3/why3.cma $(SHOW) 'Ocaml $<' $(HIDE)ocaml -I lib/why3 $(INCLUDES) $(EXTCMA) lib/why3/why3.cma $< > /dev/null\ || (rm -f test-api-mlw-tree.byte; printf "Test of Why3 API calls failed. Please fix it"; exit 2) @rm -f test-api-mlw-tree.byte; test-api-mlw-tree.opt: examples/use_api/mlw_tree.ml lib/why3/why3.cmxa $(SHOW) 'Ocamlopt $<' $(HIDE)($(OCAMLOPT) -o $@ -I lib/why3 $(INCLUDES) $(EXTCMXA) lib/why3/why3.cmxa $< \ && ./test-api-mlw-tree.opt > /dev/null) \ || (rm -f test-api-mlw-tree.opt; printf "Test of Why3 API calls failed. Please fix it"; exit 2) @rm -f test-api-mlw-tree.opt test-api-mlw.byte: examples/use_api/mlw.ml lib/why3/why3.cma $(SHOW) 'Ocaml $<' $(HIDE)ocaml -I lib/why3 $(INCLUDES) $(EXTCMA) lib/why3/why3.cma $< \ || (rm -f test-api-mlw.byte; printf "Test of Why3 API calls failed. Please fix it"; exit 2) @rm -f test-api-mlw.byte; test-api-mlw.opt: examples/use_api/mlw.ml lib/why3/why3.cmxa $(SHOW) 'Ocamlopt $<' $(HIDE)($(OCAMLOPT) -o $@ -I lib/why3 $(INCLUDES) $(EXTCMXA) lib/why3/why3.cmxa $< \ && ./test-api-mlw.opt > /dev/null) \ || (rm -f test-api-mlw.opt; printf "Test of Why3 API calls failed. Please fix it"; exit 2) @rm -f test-api-mlw.opt #test-shape: lib/why3/why3.cma # ocaml -I lib/why3 $(INCLUDES) $(EXTCMA) $? examples/test_shape.ml test-session.byte: examples/use_api/create_session.ml lib/why3/why3.cma $(SHOW) 'Ocaml $<' $(HIDE)ocaml -I lib/why3 $(INCLUDES) $(EXTCMA) lib/why3/why3.cma $< > /dev/null\ || (rm -f why3session.xml why3shapes why3shapes.gz; \ printf "Test of Why3 API calls for Session module failed. Please fix it"; exit 2) @rm -f why3session.xml why3shapes why3shapes.gz test-session.opt: examples/use_api/create_session.ml lib/why3/why3.cmxa $(SHOW) 'Ocamlopt $<' $(HIDE)($(OCAMLOPT) -o $@ -I lib/why3 $(INCLUDES) $(EXTCMXA) lib/why3/why3.cmxa $< \ && ./test-session.opt > /dev/null) \ || (rm -f test-session.opt why3session.xml why3shapes why3shapes.gz; \ printf "Test of Why3 API calls for Session module failed. Please fix it"; exit 2) @rm -f test-session.opt why3session.xml why3shapes why3shapes.gz test-coq-tactic.byte: src/coq-tactic/.why3-vo-byte $(COQC) -byte $(COQRTAC) bench/coq-tactic/test.v test-coq-tactic.opt: src/coq-tactic/.why3-vo-opt $(COQC) -opt $(COQRTAC) bench/coq-tactic/test.v #only test the compilation of runstrat test-runstrat.byte: lib/why3/why3.cma lib/why3/META OCAMLPATH=$(PWD)/lib $(MAKE) -C examples/use_api/runstrat clean OCAMLPATH=$(PWD)/lib $(MAKE) -C examples/use_api/runstrat byte test-runstrat.opt: lib/why3/why3.cmxa lib/why3/META OCAMLPATH=$(PWD)/lib $(MAKE) -C examples/use_api/runstrat clean OCAMLPATH=$(PWD)/lib $(MAKE) -C examples/use_api/runstrat opt test-runstrat: test-runstrat.$(OCAMLBEST) test-ocaml-extraction: bin/why3.opt bin/why3extract.opt lib/why3/why3extract.cmxa @echo "driver ocaml32" @mkdir -p tests/test-extraction @cd tests ; ../bin/why3extract.opt -D ocaml32 \ test_extraction.mlw -o test-extraction @cd tests/test-extraction/ ; \ $(OCAMLOPT) @BIGINTINCLUDE@ -I ../../lib/why3 \ @BIGINTLIB@.cmxa why3extract.cmxa \ ref__Refint.ml test_extraction__TestExtraction.ml main.ml @tests/test-extraction/a.out @echo "driver ocaml64" @cd tests ; ../bin/why3extract.opt -D ocaml64 \ test_extraction.mlw -o test-extraction @cd tests/test-extraction/ ; \ $(OCAMLOPT) @BIGINTINCLUDE@ -I ../../lib/why3 \ @BIGINTLIB@.cmxa why3extract.cmxa \ ref__Refint.ml test_extraction__TestExtraction.ml main.ml @tests/test-extraction/a.out ################ # documentation ################ .PHONY: doc ifeq (@enable_doc@,yes) doc: doc/manual.pdf doc/html/index.html BNF = qualid label constant operator term type formula theory theory2 \ why_file spec expr expr2 module whyml_file term_old_at BNFTEX = $(addprefix doc/, $(addsuffix _bnf.tex, $(BNF))) doc/%_bnf.tex: doc/%.bnf doc/bnf$(EXE) doc/bnf$(EXE) $< > $@ doc/bnf$(EXE): doc/bnf.mll $(OCAMLLEX) $< $(OCAMLC) -o $@ doc/bnf.ml DOC = api glossary ide intro exec macros manpages install \ manual starting syntax syntaxref technical version whyml \ itp pvs coq coq_tactic isabelle DOCTEX = $(addprefix doc/, $(addsuffix .tex, $(DOC))) doc/manual.pdf: $(BNFTEX) $(DOCTEX) doc/manual.bib share/provers-detection-data.conf cd doc; $(RUBBER) --warn all --pdf manual.tex CLEANDIRS += doc GENERATED += doc/bnf.ml ifeq (@enable_html_doc@,yes) # the dependency on the pdf ensures the bbl was built doc/html/manual.html: doc/manual.pdf doc/fix.hva cd doc; rm -rf html; mkdir -p html cp doc/*.png doc/manual.bbl doc/html/ cd doc; $(HEVEA) -o html/manual.html -fix -O fix.hva makeidx.hva manual.tex doc/html/index.html: doc/html/manual.html cd doc; $(HACHA) -tocbis -o html/index.html html/manual.html else doc/html/index.html: endif clean:: rm -rf doc/bnf$(EXE) $(BNFTEX) doc/html doc/manual.image.out; \ cd doc; $(RUBBER) --pdf --clean manual.tex else doc: endif ########## # API DOC ########## .PHONY: apidoc apidot MODULESTODOC = \ util/util util/opt util/lists util/strings \ util/extmap util/extset util/exthtbl \ util/weakhtbl util/stdlib util/rc util/debug \ core/ident core/ty core/term core/decl core/theory \ core/env core/task \ driver/whyconf driver/call_provers driver/driver \ session/session session/session_tools session/session_scheduler \ whyml/mlw_ty whyml/mlw_expr whyml/mlw_decl whyml/mlw_module \ whyml/mlw_wp FILESTODOC = $(addsuffix .mli, $(addprefix src/, $(MODULESTODOC))) doc/apidoc: mkdir -p doc/apidoc apidoc: doc/apidoc $(FILESTODOC) $(OCAMLDOC) -d doc/apidoc -html -t "Why3 API documentation" \ -keep-code $(INCLUDES) $(LIBINCLUDES) -I lib/why3 $(FILESTODOC) # could we include also the dependency graph ? -- someone # At least we can give a way to create it -- francois apidot: doc/apidoc/dg.svg doc/apidoc/dg.png #The sed remove configuration for dot that gives bad result doc/apidoc/dg.dot: doc/apidoc $(FILESTODOC) $(OCAMLDOC) -o doc/apidoc/dg.dot.tmp -dot $(INCLUDES) \ $(LIBINCLUDES) -I lib/why3 $(FILESTODOC) sed -e "s/ \(size\|ratio\|rotate\|fontsize\).*$$//" doc/apidoc/dg.dot.tmp > doc/apidoc/dg.dot rm -f doc/apidoc/dg.dot.tmp doc/apidoc/dg.svg: doc/apidoc/dg.dot dot -T svg $< > $@ doc/apidoc/dg.png: doc/apidoc/dg.dot dot -T png $< > $@ # what is this ? api doc is in why3.lri.fr/api instead... # install_apidoc: apidoc # rsync -av doc/apidoc/ marche@scm.gforge.inria.fr:/home/groups/why3/htdocs/apidoc/ doc/apidoc.tex: $(FILESTODOC) $(OCAMLDOC) -o doc/apidoc.tex -latex -noheader -notrailer $(INCLUDES) \ $(LIBINCLUDES) -I lib/why3 $(FILESTODOC) clean:: rm -f doc/apidoc/* ########## # Install rules that require root, and thus appear last in the file! ########## clean_old_install:: if test -d /etc/bash_completion.d -a -w /etc/bash_completion.d; then rm -f /etc/bash_completion.d/why3; fi install_no_local:: if test -d /etc/bash_completion.d -a -w /etc/bash_completion.d; then \ $(INSTALL_DATA) share/bash/why3 /etc/bash_completion.d; \ fi ########## # Stdlib formatted with why3doc ########## .PHONY: stdlibdoc STDLIBS = algebra \ bag \ bintree \ bool \ bv \ floating_point \ graph \ int \ list \ map \ number \ option \ pigeon \ real \ relations \ seq \ set \ sum # function ? tptp ? STDMODS = array \ hashtbl \ impset \ matrix \ pqueue \ queue \ random \ ref \ stack \ string STDMACS = array int STDLIBFILES = $(addsuffix .why, $(addprefix theories/, $(STDLIBS))) STDMODFILES = $(addsuffix .mlw, $(addprefix modules/, $(STDMODS))) STDMACFILES = $(addsuffix .mlw, $(addprefix modules/mach/, $(STDMACS))) stdlibdoc: $(STDLIBFILES) $(STDMODFILES) bin/why3doc.@OCAMLBEST@ mkdir -p doc/stdlibdoc rm -f doc/stdlibdoc/style.css WHY3CONFIG="" bin/why3doc.@OCAMLBEST@ -L theories -L modules \ -o doc/stdlibdoc --title "Why3 Standard Library" \ $(STDLIBFILES) $(STDMODFILES) $(STDMACFILES) cd doc/stdlibdoc; \ for f in theories.*.html; \ do mv "$$f" "$${f#theories.}"; done; \ for f in modules.*.html; \ do mv "$$f" "$${f#modules.}"; done sed -i -e "s#theories.##g" -e "s#modules.##g" doc/stdlibdoc/index.html clean:: rm -f doc/stdlibdoc/* ################ # generic rules ################ %.cmi: %.mli $(SHOW) 'Ocamlc $<' $(HIDE)$(OCAMLC) -c $(BFLAGS) $< # suppress "unused rec" warning for Menhir-produced files %.cmo: %.ml %.mly $(SHOW) 'Ocamlc $<' $(HIDE)$(OCAMLC) -c $(BFLAGS) -w -39 $< # suppress "unused rec" warning for Menhir-produced files %.cmx: %.ml %.mly $(SHOW) 'Ocamlopt $<' $(HIDE)$(OCAMLOPT) -c $(OFLAGS) -w -39 $(CMIHACK) $< %.cmo: %.ml $(SHOW) 'Ocamlc $<' $(HIDE)$(OCAMLC) -c $(BFLAGS) $< %.cmx: %.ml %.mli $(SHOW) 'Ocamlopt $<' $(HIDE)$(OCAMLOPT) -c $(OFLAGS) $< # the generic rule cannot be applied since ocaml would confuse # lib/why3/why3extract.cmi for the interface (!!!) # same for ocaml/lablgtk2/gMain.cmi on case-insensitive filesystems src/tools/why3extract.cmx src/ide/gmain.cmx: %.cmx: %.ml $(SHOW) 'Ocamlopt $<' $(HIDE)$(OCAMLOPT) -c $(OFLAGS) $< %.cmx: %.ml $(SHOW) 'Ocamlopt $<' $(HIDE)$(OCAMLOPT) -c $(OFLAGS) $(CMIHACK) $< %.cma: $(SHOW) 'Linking $@' $(HIDE)$(OCAMLC) -a $(BFLAGS) -o $@ $^ %.cmxa: $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) -a $(OFLAGS) -o $@ $^ %.cmxs: $(SHOW) 'Linking $@' $(HIDE)$(OCAMLOPT) -shared $(OFLAGS) -o $@ $^ %.ml: %.mll $(SHOW) 'Ocamllex $<' $(HIDE)$(OCAMLLEX) $< %.ml %.mli: %.mly $(SHOW) 'Menhir $<' $(HIDE)$(MENHIR) --explain --strict $< %.dep: %.ml %.mli $(SHOW) 'Ocamldep $<' $(HIDE)$(OCAMLDEP) $(DEPFLAGS) $< $ $@ # jc/jc_ai.ml: jc/jc_annot_inference.ml jc/jc_annot_fail.ml Makefile # if test "@enable_apron@" = "yes" ; then \ # echo "# 1 \"jc/jc_annot_inference.ml\"" > jc/jc_ai.ml; \ # cat jc/jc_annot_inference.ml >> jc/jc_ai.ml; \ # else \ # echo "# 1 \"jc/jc_annot_fail.ml\"" > jc/jc_ai.ml; \ # cat jc/jc_annot_fail.ml >> jc/jc_ai.ml; \ # fi # %_why.v: %.mlw $(BINARY) # $(BINARY) -coq $*.mlw # %_why.pvs: %.mlw $(BINARY) # $(BINARY) -pvs $*.mlw # Emacs tags ############ tags: find src -regex ".*\.ml[^#]*" | grep -v ".svn" | sort -r | xargs \ etags "--regex-ocaml=/let[ \t]+\([^ \t]+\)/\1/" \ "--regex-ocaml=/let[ \t]+rec[ \t]+\([^ \t]+\)/\1/" \ "--regex-ocaml=/and[ \t]+\([^ \t]+\)/\1/" \ "--regex-ocaml=/type[ \t]+\([^ \t]+\)/\1/" \ "--regex-ocaml=/exception[ \t]+\([^ \t]+\)/\1/" \ "--regex-ocaml=/val[ \t]+\([^ \t]+\)/\1/" \ "--regex-ocaml=/module[ \t]+\([^ \t]+\)/\1/" otags: find \( -name '*.ml' -or -name '*.mli' \) -print0 | xargs -0 otags # otags src/*.mli src/*.ml c/*.mli c/*.ml intf/*.mli intf/*.ml # the previous seems broken. This one is intented for vi(m) users, but could # be adapted for emacs (remove the -vi option ?) otags-vi: find \( -name '*.ml' -or -name '*.mli' \) -print0 | xargs -0 otags -vi wc: ocamlwc -p src/*.ml* src/*/*.ml* #dep: depend # cat .depend* | ocamldot | dot -Tpdf > dep.pdf # $(PDFVIEWER) dep.pdf # distrib ######### NAME = why3-@VERSION@ # see .gitattributes for the list of files that are not distributed MORE_DIST = configure install-sh doc/manual.pdf dist: $(MORE_DIST) rm -rf distrib/$(NAME)/ distrib/$(NAME).tar.gz mkdir -p distrib/ git archive --format tar --prefix $(NAME)/ HEAD | tar x -C distrib/ for f in $(MORE_DIST); do cp $$f distrib/$(NAME)/$$f; done cd distrib; tar cf $(NAME).tar $(NAME); gzip -f --best $(NAME).tar ############### # file headers ############### headers: headers-coq headache -c misc/headache_config.txt -h misc/header.txt \ Makefile.in configure.in \ src/*/*.ml src/*/*.ml[iyl4] \ plugins/*/*.ml plugins/*/*.ml[ily] \ lib/coq-tactic/*.v lib/coq/*.v \ src/tools/cpulimit.c \ examples/use_api/*.ml headers-coq: headache -c misc/headache_config.txt -h misc/header.txt \ lib/coq/*/*.v remove-coq-headers: headache -r -c misc/headache_config.txt lib/coq/*/*.v ######### # myself ######### Makefile: Makefile.in config.status ./config.status chmod --file $@ src/jessie/Makefile: src/jessie/Makefile.in config.status ./config.status chmod --file $@ src/config.sh: src/config.sh.in config.status ./config.status chmod --file $@ .merlin: .merlin.in config.status ./config.status chmod --file $@ src/util/config.ml share/Makefile.config: src/config.sh $(SHOW) 'Generate $@' $(HIDE)BINDIR=$(BINDIR) LIBDIR=$(LIBDIR) DATADIR=$(DATADIR) src/config.sh clean:: rm -f share/Makefile.config doc/version.tex: doc/version.tex.in config.status ./config.status chmod --file $@ config.status: configure ./config.status --recheck all: lib/why3/META .merlin lib/why3/META: lib/why3/META.in config.status ./config.status chmod --file $@ configure: configure.in Version autoconf -f ################### # clean and depend ################### .PHONY: distclean distclean: clean rm -f config.status config.cache config.log .merlin \ Makefile src/util/config.ml doc/version.tex \ src/jessie/Makefile src/config.sh lib/why3/META depend: rm -f $^ $(MAKE) $^ clean:: rm -f $(GENERATED) $(foreach d,$(CLEANDIRS),rm -f $(addprefix $(d)/*.,$(COMPILED_LIB_EXTS));) $(foreach p,$(CLEANLIBS),rm -f $(addprefix $(p).,$(COMPILED_LIB_EXTS));) ################################################################## # Building the Why3 platform with ocamlbuild (OCaml 3.10 needed) # ################################################################## # There used to be targets here but they are no longer useful. # To build using Ocamlbuild: # 1) Run "make Makefile" to ensure that the generated files (config.ml, ...) # are generated. # 2) Run Ocamlbuild with any target to generate the sanitization script. # 3) Run ./sanitize to delete the generated files that shouldn't be generated # (i.e. all lexers and parsers). # 4) Run Ocamlbuild with the target you need, for example: # ocamlbuild jc/jc_main.native # You can also use the Makefile ./build.makefile which has some handy targets. why3-0.87.3/bin/0000755000175000017500000000000013035416743014013 5ustar guillaumeguillaumewhy3-0.87.3/bin/.keepme0000644000175000017500000000000013035416743015250 0ustar guillaumeguillaumewhy3-0.87.3/configure0000755000175000017500000052542513035417011015154 0ustar guillaumeguillaume#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69 for Why3 0.87.3. # # # Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1 test -x / || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : export CONFIG_SHELL # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='Why3' PACKAGE_TARNAME='why3' PACKAGE_VERSION='0.87.3' PACKAGE_STRING='Why3 0.87.3' PACKAGE_BUGREPORT='' PACKAGE_URL='' ac_subst_vars='LTLIBOBJS LIBOBJS enable_relocation LOCALDIR enable_local FRAMAC_LIBDIR FRAMAC_SHARE FRAMAC_VERSION enable_frama_c enable_emacs_compilation enable_html_doc enable_doc enable_hypothesis_selection ISABELLEVERSION enable_isabelle_libs COMPILETIMEPVS PVSVERSION enable_pvs_libs COMPILETIMECOQ COQPPLIBS COQLIB coq_compat_version enable_coq_fp_libs enable_coq_support enable_coq_libs enable_coq_tactic MENHIRLIB MENHIRINCLUDE enable_menhirLib ZIPLIB ZIPINCLUDE enable_zip BIGINTPKG BIGINTLIB BIGINTINCLUDE enable_zarith META_OCAMLGRAPH LABLGTK2PKG LABLGTK2LIB enable_ide COQCAMLPLIB enable_bin_annot enable_profiling OCAMLGRAPHLIB OCAMLINSTALLLIB OCAMLLIB OCAMLVERSION OCAMLBEST CPULIMIT STRIP EXE enable_verbose_make VERSION FRAMAC ISABELLE PVS COQCAMLP COQDEP COQC EMACS HACHA HEVEA RUBBER USEOCAMLFIND MENHIR OCAMLDOCOPT OCAMLDOC OCAMLYACC OCAMLLEXDOTOPT OCAMLLEX OCAMLDEPDOTOPT OCAMLDEP OCAMLOPTDOTOPT OCAMLCDOTOPT OCAMLOPT OCAMLC INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM MKDIR_P OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_verbose_make enable_local enable_relocation enable_native_code enable_zarith enable_zip enable_menhirLib enable_ide enable_coq_tactic enable_coq_libs enable_pvs_libs enable_isabelle_libs enable_hypothesis_selection enable_doc enable_html_doc enable_frama_c enable_profiling enable_emacs_compilation ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures Why3 0.87.3 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/why3] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of Why3 0.87.3:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-verbose-make verbose makefile recipes --enable-local use Why3 in the build directory (no installation) --enable-relocation allow for later relocation of Why3 installation --disable-native-code use only the byte-code compiler --disable-zarith use Nums instead of Zarith for computations --enable-zip use LZ compression to store session files --enable-menhirLib use MenhirLib parsing library --disable-ide do not build Why3 IDE --disable-coq-tactic do not build Coq "why3" tactic --disable-coq-libs do not build Coq realizations --disable-pvs-libs do not build PVS realizations --disable-isabelle-libs do not build Isabelle realizations --disable-hypothesis-selection do not support hypothesis selection --disable-doc do not build documentation --disable-html-doc do not build HTML documentation --enable-frama-c enable Frama-C plugin --enable-profiling enable profiling --disable-emacs-compilation do not compile why3.elc Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to the package provider. _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF Why3 configure 0.87.3 generated by GNU Autoconf 2.69 Copyright (C) 2012 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by Why3 $as_me 0.87.3, which was generated by GNU Autoconf 2.69. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # verbosemake # Check whether --enable-verbose-make was given. if test "${enable_verbose_make+set}" = set; then : enableval=$enable_verbose_make; else enable_verbose_make=no fi # LOCAL_CONF # Check whether --enable-local was given. if test "${enable_local+set}" = set; then : enableval=$enable_local; else enable_local=no fi # RELOCATABLE INSTALLATION # Check whether --enable-relocation was given. if test "${enable_relocation+set}" = set; then : enableval=$enable_relocation; else enable_relocation=no fi # NATIVE # Check whether --enable-native-code was given. if test "${enable_native_code+set}" = set; then : enableval=$enable_native_code; else enable_native_code=yes fi # Zarith # Check whether --enable-zarith was given. if test "${enable_zarith+set}" = set; then : enableval=$enable_zarith; else enable_zarith=yes fi # camlzip # Check whether --enable-zip was given. if test "${enable_zip+set}" = set; then : enableval=$enable_zip; else enable_zip=yes fi # menhirLib # Check whether --enable-menhirLib was given. if test "${enable_menhirLib+set}" = set; then : enableval=$enable_menhirLib; else enable_menhirLib=yes fi # IDE # Check whether --enable-ide was given. if test "${enable_ide+set}" = set; then : enableval=$enable_ide; else enable_ide=yes fi # Coq tactic and libraries # Check whether --enable-coq-tactic was given. if test "${enable_coq_tactic+set}" = set; then : enableval=$enable_coq_tactic; else enable_coq_tactic=yes fi # Check whether --enable-coq-libs was given. if test "${enable_coq_libs+set}" = set; then : enableval=$enable_coq_libs; else enable_coq_libs=yes fi # PVS libraries # Check whether --enable-pvs-libs was given. if test "${enable_pvs_libs+set}" = set; then : enableval=$enable_pvs_libs; else enable_pvs_libs=yes fi # Isabelle libraries # Check whether --enable-isabelle-libs was given. if test "${enable_isabelle_libs+set}" = set; then : enableval=$enable_isabelle_libs; else enable_isabelle_libs=yes fi # hypothesis selection # Check whether --enable-hypothesis-selection was given. if test "${enable_hypothesis_selection+set}" = set; then : enableval=$enable_hypothesis_selection; else enable_hypothesis_selection=yes fi # documentation # Check whether --enable-doc was given. if test "${enable_doc+set}" = set; then : enableval=$enable_doc; else enable_doc=yes fi # Check whether --enable-html-doc was given. if test "${enable_html_doc+set}" = set; then : enableval=$enable_html_doc; else enable_html_doc=yes fi # Experimental Jessie3 Frama-C plugin, disabled by default # Check whether --enable-frama-c was given. if test "${enable_frama_c+set}" = set; then : enableval=$enable_frama_c; else enable_frama_c=no reason_frama_c=" (disabled by default)" fi # profiling # Check whether --enable-profiling was given. if test "${enable_profiling+set}" = set; then : enableval=$enable_profiling; else enable_profiling=no fi # Emacs compilation # Check whether --enable-emacs-compilation was given. if test "${enable_emacs_compilation+set}" = set; then : enableval=$enable_emacs_compilation; else enable_emacs_compilation=yes fi # either relocation or local, not both if test "$enable_relocation" = yes ; then if test "$enable_local" = yes ; then as_fn_error $? "cannot use --enable-relocation and --enable-local at the same time." "$LINENO" 5 fi fi # Check for arch/OS { $as_echo "$as_me:${as_lineno-$LINENO}: checking executable suffix" >&5 $as_echo_n "checking executable suffix... " >&6; } if uname -s | grep -q CYGWIN ; then EXE=.exe STRIP='echo "no strip "' CPULIMIT=cpulimit-win { $as_echo "$as_me:${as_lineno-$LINENO}: result: .exe " >&5 $as_echo ".exe " >&6; } else if uname -s | grep -q MINGW ; then EXE=.exe STRIP=strip CPULIMIT=cpulimit-win { $as_echo "$as_me:${as_lineno-$LINENO}: result: .exe " >&5 $as_echo ".exe " >&6; } else EXE= STRIP=strip CPULIMIT=cpulimit { $as_echo "$as_me:${as_lineno-$LINENO}: result: " >&5 $as_echo "" >&6; } fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5 $as_echo_n "checking whether the C compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "C compiler cannot create executables See \`config.log' for more details" "$LINENO" 5; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5 $as_echo_n "checking for C compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details" "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if ${ac_cv_objext+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of object files: cannot compile See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_aux_dir= for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do if test -f "$ac_dir/install-sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f "$ac_dir/install.sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f "$ac_dir/shtool"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if ${ac_cv_path_mkdir+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if ${ac_cv_path_install+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' # Check for Ocaml compilers # we first look for ocamlc in the path; if not present, we fail # Extract the first word of "ocamlc", so it can be a program name with args. set dummy ocamlc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLC"; then ac_cv_prog_OCAMLC="$OCAMLC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLC="ocamlc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLC" && ac_cv_prog_OCAMLC="no" fi fi OCAMLC=$ac_cv_prog_OCAMLC if test -n "$OCAMLC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLC" >&5 $as_echo "$OCAMLC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLC" = no ; then as_fn_error $? "Cannot find ocamlc." "$LINENO" 5 fi # we extract Ocaml version number OCAMLVERSION=`$OCAMLC -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` echo "ocaml version is $OCAMLVERSION" case "$OCAMLVERSION" in 0.*|1.*|2.*|3.*|4.00.*) as_fn_error $? "You need Objective Caml 4.01.0 or higher" "$LINENO" 5;; esac # Ocaml library path # old way: OCAMLLIB=`$OCAMLC -v | tail -1 | cut -f 4 -d ' ' | tr -d '\\r'` OCAMLLIB=`$OCAMLC -where | tr -d '\\r'` echo "ocaml library path is $OCAMLLIB" # then we look for ocamlopt; if not present, we issue a warning # if the version is not the same, we also discard it # we set OCAMLBEST to "opt" or "byte", whether ocamlopt is available or not # Extract the first word of "ocamlopt", so it can be a program name with args. set dummy ocamlopt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLOPT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLOPT"; then ac_cv_prog_OCAMLOPT="$OCAMLOPT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLOPT="ocamlopt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLOPT" && ac_cv_prog_OCAMLOPT="no" fi fi OCAMLOPT=$ac_cv_prog_OCAMLOPT if test -n "$OCAMLOPT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLOPT" >&5 $as_echo "$OCAMLOPT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi OCAMLBEST=byte if test "$OCAMLOPT" = no ; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find ocamlopt; bytecode compilation only." >&5 $as_echo "$as_me: WARNING: Cannot find ocamlopt; bytecode compilation only." >&2;} else { $as_echo "$as_me:${as_lineno-$LINENO}: checking ocamlopt version" >&5 $as_echo_n "checking ocamlopt version... " >&6; } TMPVERSION=`$OCAMLOPT -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` if test "$TMPVERSION" != "$OCAMLVERSION" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: differs from ocamlc; ocamlopt discarded." >&5 $as_echo "differs from ocamlc; ocamlopt discarded." >&6; } OCAMLOPT=no else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } OCAMLBEST=opt fi fi # checking for native-code if test "$enable_native_code" != yes || test "$OCAMLBEST" = byte ; then enable_native_code=no OCAMLBEST=byte OCAMLOPT=no fi # checking for ocamlc.opt # Extract the first word of "ocamlc.opt", so it can be a program name with args. set dummy ocamlc.opt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLCDOTOPT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLCDOTOPT"; then ac_cv_prog_OCAMLCDOTOPT="$OCAMLCDOTOPT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLCDOTOPT="ocamlc.opt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLCDOTOPT" && ac_cv_prog_OCAMLCDOTOPT="no" fi fi OCAMLCDOTOPT=$ac_cv_prog_OCAMLCDOTOPT if test -n "$OCAMLCDOTOPT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLCDOTOPT" >&5 $as_echo "$OCAMLCDOTOPT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLCDOTOPT" != no ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking ocamlc.opt version" >&5 $as_echo_n "checking ocamlc.opt version... " >&6; } TMPVERSION=`$OCAMLCDOTOPT -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` if test "$TMPVERSION" != "$OCAMLVERSION" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: differs from ocamlc; ocamlc.opt discarded." >&5 $as_echo "differs from ocamlc; ocamlc.opt discarded." >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } OCAMLC=$OCAMLCDOTOPT fi fi # checking for ocamlopt.opt if test "$OCAMLOPT" != no ; then # Extract the first word of "ocamlopt.opt", so it can be a program name with args. set dummy ocamlopt.opt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLOPTDOTOPT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLOPTDOTOPT"; then ac_cv_prog_OCAMLOPTDOTOPT="$OCAMLOPTDOTOPT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLOPTDOTOPT="ocamlopt.opt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLOPTDOTOPT" && ac_cv_prog_OCAMLOPTDOTOPT="no" fi fi OCAMLOPTDOTOPT=$ac_cv_prog_OCAMLOPTDOTOPT if test -n "$OCAMLOPTDOTOPT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLOPTDOTOPT" >&5 $as_echo "$OCAMLOPTDOTOPT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLOPTDOTOPT" != no ; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking ocamlc.opt version" >&5 $as_echo_n "checking ocamlc.opt version... " >&6; } TMPVER=`$OCAMLOPTDOTOPT -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` if test "$TMPVER" != "$OCAMLVERSION" ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: differs from ocamlc; ocamlopt.opt discarded." >&5 $as_echo "differs from ocamlc; ocamlopt.opt discarded." >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } OCAMLOPT=$OCAMLOPTDOTOPT fi fi fi # ocamldep, ocamllex and ocamlyacc should also be present in the path # Extract the first word of "ocamldep", so it can be a program name with args. set dummy ocamldep; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLDEP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLDEP"; then ac_cv_prog_OCAMLDEP="$OCAMLDEP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLDEP="ocamldep" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLDEP" && ac_cv_prog_OCAMLDEP="no" fi fi OCAMLDEP=$ac_cv_prog_OCAMLDEP if test -n "$OCAMLDEP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLDEP" >&5 $as_echo "$OCAMLDEP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLDEP" = no ; then as_fn_error $? "Cannot find ocamldep." "$LINENO" 5 else # Extract the first word of "ocamldep.opt", so it can be a program name with args. set dummy ocamldep.opt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLDEPDOTOPT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLDEPDOTOPT"; then ac_cv_prog_OCAMLDEPDOTOPT="$OCAMLDEPDOTOPT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLDEPDOTOPT="ocamldep.opt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLDEPDOTOPT" && ac_cv_prog_OCAMLDEPDOTOPT="no" fi fi OCAMLDEPDOTOPT=$ac_cv_prog_OCAMLDEPDOTOPT if test -n "$OCAMLDEPDOTOPT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLDEPDOTOPT" >&5 $as_echo "$OCAMLDEPDOTOPT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLDEPDOTOPT" != no ; then OCAMLDEP=$OCAMLDEPDOTOPT fi fi # Extract the first word of "ocamllex", so it can be a program name with args. set dummy ocamllex; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLLEX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLLEX"; then ac_cv_prog_OCAMLLEX="$OCAMLLEX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLLEX="ocamllex" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLLEX" && ac_cv_prog_OCAMLLEX="no" fi fi OCAMLLEX=$ac_cv_prog_OCAMLLEX if test -n "$OCAMLLEX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLLEX" >&5 $as_echo "$OCAMLLEX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLLEX" = no ; then as_fn_error $? "Cannot find ocamllex." "$LINENO" 5 else # Extract the first word of "ocamllex.opt", so it can be a program name with args. set dummy ocamllex.opt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLLEXDOTOPT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLLEXDOTOPT"; then ac_cv_prog_OCAMLLEXDOTOPT="$OCAMLLEXDOTOPT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLLEXDOTOPT="ocamllex.opt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLLEXDOTOPT" && ac_cv_prog_OCAMLLEXDOTOPT="no" fi fi OCAMLLEXDOTOPT=$ac_cv_prog_OCAMLLEXDOTOPT if test -n "$OCAMLLEXDOTOPT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLLEXDOTOPT" >&5 $as_echo "$OCAMLLEXDOTOPT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLLEXDOTOPT" != no ; then OCAMLLEX=$OCAMLLEXDOTOPT fi fi # Extract the first word of "ocamlyacc", so it can be a program name with args. set dummy ocamlyacc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLYACC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLYACC"; then ac_cv_prog_OCAMLYACC="$OCAMLYACC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLYACC="ocamlyacc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLYACC" && ac_cv_prog_OCAMLYACC="no" fi fi OCAMLYACC=$ac_cv_prog_OCAMLYACC if test -n "$OCAMLYACC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLYACC" >&5 $as_echo "$OCAMLYACC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLYACC" = no ; then as_fn_error $? "Cannot find ocamlyacc." "$LINENO" 5 fi # Extract the first word of "ocamldoc", so it can be a program name with args. set dummy ocamldoc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLDOC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLDOC"; then ac_cv_prog_OCAMLDOC="$OCAMLDOC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLDOC="ocamldoc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLDOC" && ac_cv_prog_OCAMLDOC="true" fi fi OCAMLDOC=$ac_cv_prog_OCAMLDOC if test -n "$OCAMLDOC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLDOC" >&5 $as_echo "$OCAMLDOC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLDOC" = true ; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find ocamldoc" >&5 $as_echo "$as_me: WARNING: Cannot find ocamldoc" >&2;} else # Extract the first word of "ocamldoc.opt", so it can be a program name with args. set dummy ocamldoc.opt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OCAMLDOCOPT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OCAMLDOCOPT"; then ac_cv_prog_OCAMLDOCOPT="$OCAMLDOCOPT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OCAMLDOCOPT="ocamldoc.opt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_OCAMLDOCOPT" && ac_cv_prog_OCAMLDOCOPT="no" fi fi OCAMLDOCOPT=$ac_cv_prog_OCAMLDOCOPT if test -n "$OCAMLDOCOPT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OCAMLDOCOPT" >&5 $as_echo "$OCAMLDOCOPT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$OCAMLDOCOPT" != no ; then OCAMLDOC=$OCAMLDOCOPT fi fi # Extract the first word of "menhir", so it can be a program name with args. set dummy menhir; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_MENHIR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$MENHIR"; then ac_cv_prog_MENHIR="$MENHIR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_MENHIR="menhir" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_MENHIR" && ac_cv_prog_MENHIR="no" fi fi MENHIR=$ac_cv_prog_MENHIR if test -n "$MENHIR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MENHIR" >&5 $as_echo "$MENHIR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$MENHIR" = no ; then as_fn_error $? "Cannot find menhir." "$LINENO" 5 fi ## Where are the library we need # we look for ocamlfind; if not present, we just don't use it to find # libraries # Extract the first word of "ocamlfind", so it can be a program name with args. set dummy ocamlfind; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_USEOCAMLFIND+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$USEOCAMLFIND"; then ac_cv_prog_USEOCAMLFIND="$USEOCAMLFIND" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_USEOCAMLFIND="yes" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_USEOCAMLFIND" && ac_cv_prog_USEOCAMLFIND="no" fi fi USEOCAMLFIND=$ac_cv_prog_USEOCAMLFIND if test -n "$USEOCAMLFIND"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $USEOCAMLFIND" >&5 $as_echo "$USEOCAMLFIND" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$USEOCAMLFIND" = yes; then OCAMLFINDLIB=$(ocamlfind printconf stdlib) OCAMLFIND=$(which ocamlfind) if test "$OCAMLFINDLIB" != "$OCAMLLIB"; then USEOCAMLFIND=no; echo "but your ocamlfind is not compatible with your ocamlc:" echo "ocamlfind : $OCAMLFINDLIB, ocamlc : $OCAMLLIB" fi fi if test "$enable_local" = no; then LOCALDIR='' else LOCALDIR="${PWD}" fi if test "$enable_local" = yes ; then OCAMLINSTALLLIB=$LOCALDIR/lib else #if ocamlfind is used it gives the install path for ocaml library if test "$USEOCAMLFIND" = yes; then OCAMLINSTALLLIB=$(ocamlfind printconf destdir) else OCAMLINSTALLLIB=$OCAMLLIB fi fi # bin-annot case "$OCAMLVERSION" in 0.*|1.*|2.*|3.*) enable_bin_annot=no;; *) enable_bin_annot=yes;; esac # checking for rubber if test "$enable_doc" = yes ; then # Extract the first word of "rubber", so it can be a program name with args. set dummy rubber; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_RUBBER+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$RUBBER"; then ac_cv_prog_RUBBER="$RUBBER" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_RUBBER="rubber" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_RUBBER" && ac_cv_prog_RUBBER="no" fi fi RUBBER=$ac_cv_prog_RUBBER if test -n "$RUBBER"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RUBBER" >&5 $as_echo "$RUBBER" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$RUBBER" = no ; then enable_doc=no enable_html_doc=no reason_doc=" (rubber not found)" { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find rubber, documentation disabled." >&5 $as_echo "$as_me: WARNING: Cannot find rubber, documentation disabled." >&2;} fi else enable_html_doc=no fi # checking for hevea (note that the pdf documentation DOES NOT use hevea.sty) if test "$enable_html_doc" = yes ; then # Extract the first word of "hevea", so it can be a program name with args. set dummy hevea; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_HEVEA+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$HEVEA"; then ac_cv_prog_HEVEA="$HEVEA" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_HEVEA="hevea" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_HEVEA" && ac_cv_prog_HEVEA="no" fi fi HEVEA=$ac_cv_prog_HEVEA if test -n "$HEVEA"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $HEVEA" >&5 $as_echo "$HEVEA" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$HEVEA" = no ; then enable_html_doc=no reason_html_doc=" (hevea not found)" { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find hevea, HTML documentation disabled." >&5 $as_echo "$as_me: WARNING: Cannot find hevea, HTML documentation disabled." >&2;} fi fi # checking for hacha if test "$enable_html_doc" = yes ; then # Extract the first word of "hacha", so it can be a program name with args. set dummy hacha; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_HACHA+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$HACHA"; then ac_cv_prog_HACHA="$HACHA" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_HACHA="hacha" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_HACHA" && ac_cv_prog_HACHA="no" fi fi HACHA=$ac_cv_prog_HACHA if test -n "$HACHA"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $HACHA" >&5 $as_echo "$HACHA" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$HACHA" = no ; then enable_html_doc=no reason_html_doc=" (hacha not found)" { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find hacha, HTML documentation disabled." >&5 $as_echo "$as_me: WARNING: Cannot find hacha, HTML documentation disabled." >&2;} fi fi # checking for emacs if test "$enable_emacs_compilation" = yes ; then # Extract the first word of "emacs", so it can be a program name with args. set dummy emacs; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_EMACS+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$EMACS"; then ac_cv_prog_EMACS="$EMACS" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_EMACS="emacs" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_EMACS" && ac_cv_prog_EMACS="no" fi fi EMACS=$ac_cv_prog_EMACS if test -n "$EMACS"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $EMACS" >&5 $as_echo "$EMACS" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$EMACS" = no ; then enable_emacs_compilation=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find emacs, compilation of why3.elc disabled." >&5 $as_echo "$as_me: WARNING: Cannot find emacs, compilation of why3.elc disabled." >&2;} fi fi # checking for Zarith if test "$enable_zarith" = yes; then if test "$USEOCAMLFIND" = yes; then BIGINTINCLUDE=$(ocamlfind query zarith) fi if test -n "$BIGINTINCLUDE"; then echo "ocamlfind found zarith in $BIGINTINCLUDE" BIGINTINCLUDE="-I $BIGINTINCLUDE" else as_ac_File=`$as_echo "ac_cv_file_$OCAMLLIB/zarith/zarith.cma" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $OCAMLLIB/zarith/zarith.cma" >&5 $as_echo_n "checking for $OCAMLLIB/zarith/zarith.cma... " >&6; } if eval \${$as_ac_File+:} false; then : $as_echo_n "(cached) " >&6 else test "$cross_compiling" = yes && as_fn_error $? "cannot check for file existence when cross compiling" "$LINENO" 5 if test -r "$OCAMLLIB/zarith/zarith.cma"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi eval ac_res=\$$as_ac_File { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_File"\" = x"yes"; then : else enable_zarith=no fi if test "$enable_zarith" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Lib Zarith not found, using Nums instead." >&5 $as_echo "$as_me: WARNING: Lib Zarith not found, using Nums instead." >&2;} reason_zarith=" (zarith not found)" else BIGINTINCLUDE="-I +zarith" fi fi fi if test "$enable_zarith" = yes; then BIGINTLIB=zarith BIGINTPKG=zarith else BIGINTLIB=nums BIGINTPKG=num fi # checking for camlzip if test "$enable_zip" = yes; then if test "$USEOCAMLFIND" = yes; then ZIPINCLUDE=$(ocamlfind query zip) fi if test -n "$ZIPINCLUDE"; then echo "ocamlfind found camlzip in $ZIPINCLUDE" ZIPINCLUDE="-I $ZIPINCLUDE" else as_ac_File=`$as_echo "ac_cv_file_$OCAMLLIB/zip/zip.cma" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $OCAMLLIB/zip/zip.cma" >&5 $as_echo_n "checking for $OCAMLLIB/zip/zip.cma... " >&6; } if eval \${$as_ac_File+:} false; then : $as_echo_n "(cached) " >&6 else test "$cross_compiling" = yes && as_fn_error $? "cannot check for file existence when cross compiling" "$LINENO" 5 if test -r "$OCAMLLIB/zip/zip.cma"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi eval ac_res=\$$as_ac_File { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_File"\" = x"yes"; then : else enable_zip=no fi if test "$enable_zip" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Lib camlzip not found, sessions files will not be compressed." >&5 $as_echo "$as_me: WARNING: Lib camlzip not found, sessions files will not be compressed." >&2;} reason_zip=" (camlzip not found)" else ZIPINCLUDE="-I +zip" fi fi fi if test "$enable_zip" = yes; then ZIPLIB=zip else ZIPLIB= fi if test "$enable_menhirLib" = yes; then if test "$USEOCAMLFIND" = yes; then MENHIRINCLUDE=$(ocamlfind query menhirLib) fi if test -n "$MENHIRINCLUDE"; then echo "ocamlfind found menhirLib in $MENHIRINCLUDE" MENHIRINCLUDE="-I $MENHIRINCLUDE" else as_ac_File=`$as_echo "ac_cv_file_$OCAMLLIB/menhirLib/menhirLib.cmx" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $OCAMLLIB/menhirLib/menhirLib.cmx" >&5 $as_echo_n "checking for $OCAMLLIB/menhirLib/menhirLib.cmx... " >&6; } if eval \${$as_ac_File+:} false; then : $as_echo_n "(cached) " >&6 else test "$cross_compiling" = yes && as_fn_error $? "cannot check for file existence when cross compiling" "$LINENO" 5 if test -r "$OCAMLLIB/menhirLib/menhirLib.cmx"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi eval ac_res=\$$as_ac_File { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_File"\" = x"yes"; then : else enable_menhirLib=no fi if test "$enable_menhirLib" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Lib menhirLib not found, parser source files will be bigger." >&5 $as_echo "$as_me: WARNING: Lib menhirLib not found, parser source files will be bigger." >&2;} reason_menhirLib=" (menhirLib not found)" else MENHIRINCLUDE="-I +menhirLib" fi fi fi if test "$enable_menhirLib" = yes; then MENHIRLIB=menhirLib else MENHIRLIB= fi # checking for lablgtk2 if test "$enable_ide" = yes ; then if test "$USEOCAMLFIND" = yes; then LABLGTK2LIB=$(ocamlfind query lablgtk2) fi if test -n "$LABLGTK2LIB";then echo "ocamlfind found lablgtk2 in $LABLGTK2LIB" else LABLGTK2LIB="+lablgtk2" as_ac_File=`$as_echo "ac_cv_file_$OCAMLLIB/lablgtk2/lablgtk.cma" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $OCAMLLIB/lablgtk2/lablgtk.cma" >&5 $as_echo_n "checking for $OCAMLLIB/lablgtk2/lablgtk.cma... " >&6; } if eval \${$as_ac_File+:} false; then : $as_echo_n "(cached) " >&6 else test "$cross_compiling" = yes && as_fn_error $? "cannot check for file existence when cross compiling" "$LINENO" 5 if test -r "$OCAMLLIB/lablgtk2/lablgtk.cma"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi eval ac_res=\$$as_ac_File { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_File"\" = x"yes"; then : else enable_ide=no fi if test "$enable_ide" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Lib lablgtk2 not found, IDE disabled." >&5 $as_echo "$as_me: WARNING: Lib lablgtk2 not found, IDE disabled." >&2;} reason_ide=" (lablgtk2 not found)" fi fi fi # checking for lablgtksourceview2 if test "$enable_ide" = yes ; then if test "$USEOCAMLFIND" = yes; then LABLGTKSV2LIB=$(ocamlfind query lablgtk2.sourceview2) if test -z "$LABLGTKSV2LIB"; then LABLGTKSV2LIB=$(ocamlfind query lablgtksourceview2) fi fi if test -n "$LABLGTKSV2LIB";then echo "ocamlfind found lablgtksourceview2 in $LABLGTKSV2LIB" else as_ac_File=`$as_echo "ac_cv_file_$OCAMLLIB/lablgtk2/lablgtksourceview2.cma" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $OCAMLLIB/lablgtk2/lablgtksourceview2.cma" >&5 $as_echo_n "checking for $OCAMLLIB/lablgtk2/lablgtksourceview2.cma... " >&6; } if eval \${$as_ac_File+:} false; then : $as_echo_n "(cached) " >&6 else test "$cross_compiling" = yes && as_fn_error $? "cannot check for file existence when cross compiling" "$LINENO" 5 if test -r "$OCAMLLIB/lablgtk2/lablgtksourceview2.cma"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi eval ac_res=\$$as_ac_File { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_File"\" = x"yes"; then : else enable_ide=no fi if test "$enable_ide" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Lib lablgtksourceview2 not found, IDE disabled." >&5 $as_echo "$as_me: WARNING: Lib lablgtksourceview2 not found, IDE disabled." >&2;} reason_ide=" (lablgtksourceview2 not found)" fi fi fi if test "$enable_ide" = yes ; then LABLGTK2PKG="lablgtk2 lablgtk2.init lablgtk2.sourceview2" else LABLGTK2PKG= fi # Coq enable_coq_support=yes enable_coq_fp_libs=yes coq_compat_version= if test "$enable_coq_tactic" = no -a "$enable_coq_libs" = no; then enable_coq_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: coq support disabled" >&5 $as_echo "$as_me: WARNING: coq support disabled" >&2;} reason_coq_support=" (disabled by user)" fi if test "$enable_coq_support" = yes; then # Extract the first word of "coqc", so it can be a program name with args. set dummy coqc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_COQC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$COQC"; then ac_cv_prog_COQC="$COQC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_COQC="coqc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_COQC" && ac_cv_prog_COQC="no" fi fi COQC=$ac_cv_prog_COQC if test -n "$COQC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $COQC" >&5 $as_echo "$COQC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$COQC" = no ; then enable_coq_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find coqc." >&5 $as_echo "$as_me: WARNING: Cannot find coqc." >&2;} reason_coq_support=" (coqc not found)" fi fi if test "$enable_coq_support" = yes; then COQLIB=`$COQC -where | sed -e 's|\\\|/|g' -e 's| |\\ |g'` { $as_echo "$as_me:${as_lineno-$LINENO}: checking Coq version" >&5 $as_echo_n "checking Coq version... " >&6; } COQVERSION=`$COQC -v | sed -n -e 's|.*version* *\([^ ]*\) .*$|\1|p' ` #Even if the name of the variable is CAMLP4 the value can be camlp5 CAMLP4BIN=`coqtop -config | sed -n -e 's/CAMLP4BIN=\(.*\)$/\1/p'` CAMLP4=`coqtop -config | sed -n -e 's/CAMLP4=\(.*\)$/\1/p'` COQCAMLPLIB=`coqtop -config | sed -n -e 's/CAMLP4LIB=\(.*\)$/\1/p'` case $COQVERSION in 8.4*) coq_compat_version="COQ84" COQPPLIBS="$COQLIB/parsing/grammar.cma" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $COQVERSION" >&5 $as_echo "$COQVERSION" >&6; } ;; 8.5*) coq_compat_version="COQ85" COQPPLIBS="$OCAMLLIB/unix.cma $OCAMLLIB/threads/threads.cma $COQLIB/grammar/grammar.cma" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $COQVERSION" >&5 $as_echo "$COQVERSION" >&6; } ;; 8.6*|trunk) coq_compat_version="COQ86" COQPPLIBS="$OCAMLLIB/unix.cma $OCAMLLIB/threads/threads.cma $COQLIB/grammar/grammar.cma" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $COQVERSION" >&5 $as_echo "$COQVERSION" >&6; } ;; *) enable_coq_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You need Coq 8.4 or later; Coq discarded" >&5 $as_echo "$as_me: WARNING: You need Coq 8.4 or later; Coq discarded" >&2;} reason_coq_support=" (version is $COQVERSION but need version 8.4 or later)" ;; esac fi if test "$enable_coq_support" = yes; then # Extract the first word of "coqdep", so it can be a program name with args. set dummy coqdep; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_COQDEP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$COQDEP"; then ac_cv_prog_COQDEP="$COQDEP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_COQDEP="coqdep" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_COQDEP" && ac_cv_prog_COQDEP="no" fi fi COQDEP=$ac_cv_prog_COQDEP if test -n "$COQDEP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $COQDEP" >&5 $as_echo "$COQDEP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$COQDEP" = no; then enable_coq_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find coqdep." >&5 $as_echo "$as_me: WARNING: Cannot find coqdep." >&2;} reason_coq_support=" (coqdep not found)" fi fi if test "$enable_coq_support" = no; then enable_coq_tactic=no enable_coq_libs=no COMPILETIMECOQ= else COMPILETIMECOQ="\\\"Coq\\\", \\\"$COQVERSION\\\"; " fi if test "$enable_coq_tactic" = yes; then as_ac_File=`$as_echo "ac_cv_file_$COQLIB/kernel/term.cmi" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $COQLIB/kernel/term.cmi" >&5 $as_echo_n "checking for $COQLIB/kernel/term.cmi... " >&6; } if eval \${$as_ac_File+:} false; then : $as_echo_n "(cached) " >&6 else test "$cross_compiling" = yes && as_fn_error $? "cannot check for file existence when cross compiling" "$LINENO" 5 if test -r "$COQLIB/kernel/term.cmi"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi eval ac_res=\$$as_ac_File { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_File"\" = x"yes"; then : else enable_coq_tactic=no fi if test "$enable_coq_tactic" = no; then reason_coq_tactic=" ($COQLIB/kernel/term.cmi not found)" fi fi if test "$enable_coq_tactic" = yes; then # Extract the first word of "${CAMLP4}o", so it can be a program name with args. set dummy ${CAMLP4}o; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_path_COQCAMLP+:} false; then : $as_echo_n "(cached) " >&6 else case $COQCAMLP in [\\/]* | ?:[\\/]*) ac_cv_path_COQCAMLP="$COQCAMLP" # Let the user override the test with a path. ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $CAMLP4BIN do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_path_COQCAMLP="$as_dir/$ac_word$ac_exec_ext" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_path_COQCAMLP" && ac_cv_path_COQCAMLP="no" ;; esac fi COQCAMLP=$ac_cv_path_COQCAMLP if test -n "$COQCAMLP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $COQCAMLP" >&5 $as_echo "$COQCAMLP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$COQCAMLP" = no; then enable_coq_tactic=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find camlpXo." >&5 $as_echo "$as_me: WARNING: Cannot find camlpXo." >&2;} reason_coq_tactic=" (camlpXo not found)" fi fi if test "$enable_coq_libs" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for Flocq" >&5 $as_echo_n "checking for Flocq... " >&6; } if echo "Require Import Flocq.Flocq_version BinNat." \ "Goal (20500 <= Flocq_version)%N. easy. Qed." > conftest.v "$COQC" conftest.v > conftest.err ; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } enable_coq_fp_libs=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find Flocq." >&5 $as_echo "$as_me: WARNING: Cannot find Flocq." >&2;} reason_coq_fp_libs=" (Flocq >= 2.5 not found)" fi rm -f conftest.v conftest.vo conftest.err fi # PVS if test "$enable_pvs_libs" = no; then enable_pvs_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: PVS support disabled" >&5 $as_echo "$as_me: WARNING: PVS support disabled" >&2;} reason_pvs_support=" (disabled by user)" else # Extract the first word of "pvs", so it can be a program name with args. set dummy pvs; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_PVS+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$PVS"; then ac_cv_prog_PVS="$PVS" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_PVS="pvs" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_PVS" && ac_cv_prog_PVS="no" fi fi PVS=$ac_cv_prog_PVS if test -n "$PVS"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PVS" >&5 $as_echo "$PVS" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$PVS" = no ; then enable_pvs_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find pvs." >&5 $as_echo "$as_me: WARNING: Cannot find pvs." >&2;} reason_pvs_support=" (pvs not found)" else PVSLIB=`$PVS -where` { $as_echo "$as_me:${as_lineno-$LINENO}: checking PVS version" >&5 $as_echo_n "checking PVS version... " >&6; } PVSVERSION=`$PVS -version | sed -n -e 's|.*Version* *\([^ ]*\)$|\1|p' ` case $PVSVERSION in 6.*) enable_pvs_support=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PVSVERSION" >&5 $as_echo "$PVSVERSION" >&6; } ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PVSVERSION" >&5 $as_echo "$PVSVERSION" >&6; } enable_pvs_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You need PVS 6.0 or higher; PVS discarded" >&5 $as_echo "$as_me: WARNING: You need PVS 6.0 or higher; PVS discarded" >&2;} reason_pvs_support=" (need version 6.0 or higher)" ;; esac fi fi if test "$enable_pvs_support" = no; then enable_pvs_libs=no COMPILETIMEPVS= else COMPILETIMEPVS="\\\"PVS\\\", \\\"$PVSVERSION\\\"; " fi # Isabelle if test "$enable_isabelle_libs" = no; then enable_isabelle_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Isabelle support disabled" >&5 $as_echo "$as_me: WARNING: Isabelle support disabled" >&2;} reason_isabelle_support=" (disabled by user)" else # Extract the first word of "isabelle", so it can be a program name with args. set dummy isabelle; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ISABELLE+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ISABELLE"; then ac_cv_prog_ISABELLE="$ISABELLE" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ISABELLE="isabelle" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_ISABELLE" && ac_cv_prog_ISABELLE="no" fi fi ISABELLE=$ac_cv_prog_ISABELLE if test -n "$ISABELLE"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ISABELLE" >&5 $as_echo "$ISABELLE" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$ISABELLE" = no ; then enable_isabelle_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find isabelle." >&5 $as_echo "$as_me: WARNING: Cannot find isabelle." >&2;} reason_isabelle_support=" (isabelle not found)" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking Isabelle version" >&5 $as_echo_n "checking Isabelle version... " >&6; } ISABELLEDETECTEDVERSION=`$ISABELLE version | sed -n -e 's|Isabelle\([^:]*\).*$|\1|p' ` case $ISABELLEDETECTEDVERSION in 2016-1*) enable_isabelle_support=yes ISABELLEVERSION=2016-1 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ISABELLEDETECTEDVERSION" >&5 $as_echo "$ISABELLEDETECTEDVERSION" >&6; } ;; 2016*) enable_isabelle_support=yes ISABELLEVERSION=2016 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ISABELLEDETECTEDVERSION" >&5 $as_echo "$ISABELLEDETECTEDVERSION" >&6; } ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ISABELLEDETECTEDVERSION" >&5 $as_echo "$ISABELLEDETECTEDVERSION" >&6; } enable_isabelle_support=no { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: You need Isabelle 2016 or later; Isabelle discarded" >&5 $as_echo "$as_me: WARNING: You need Isabelle 2016 or later; Isabelle discarded" >&2;} reason_isabelle_support=" (need version >= 2016)" ;; esac fi fi if test "$enable_isabelle_support" = no; then enable_isabelle_libs=no fi if test "$enable_pvs_libs" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for NASA PVS library" >&5 $as_echo_n "checking for NASA PVS library... " >&6; } enable_pvs_libs=no reason_pvs_libs=" (no NASA PVS library in PVS_LIBRARY_PATH)" for dir in `echo $PVS_LIBRARY_PATH | tr ':' ' '`; do if test -f $dir/nasalib-version; then enable_pvs_libs=yes reason_pvs_libs="" fi done { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_pvs_libs" >&5 $as_echo "$enable_pvs_libs" >&6; } fi # hypothesis_selection if test "$enable_hypothesis_selection" = yes; then if test "$USEOCAMLFIND" = yes; then OCAMLGRAPHLIB=$(ocamlfind query ocamlgraph) fi if test -n "$OCAMLGRAPHLIB"; then echo "ocamlfind found ocamlgraph in $OCAMLGRAPHLIB" else OCAMLGRAPHLIB="+ocamlgraph" as_ac_File=`$as_echo "ac_cv_file_$OCAMLLIB/ocamlgraph/" | $as_tr_sh` { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $OCAMLLIB/ocamlgraph/" >&5 $as_echo_n "checking for $OCAMLLIB/ocamlgraph/... " >&6; } if eval \${$as_ac_File+:} false; then : $as_echo_n "(cached) " >&6 else test "$cross_compiling" = yes && as_fn_error $? "cannot check for file existence when cross compiling" "$LINENO" 5 if test -r "$OCAMLLIB/ocamlgraph/"; then eval "$as_ac_File=yes" else eval "$as_ac_File=no" fi fi eval ac_res=\$$as_ac_File { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } if eval test \"x\$"$as_ac_File"\" = x"yes"; then : else enable_hypothesis_selection=no fi if test "$enable_hypothesis_selection" = no; then reason_hypothesis_selection=" (ocamlgraph not found)" { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Lib ocamlgraph not found, hypothesis selection disabled." >&5 $as_echo "$as_me: WARNING: Lib ocamlgraph not found, hypothesis selection disabled." >&2;} fi fi fi #check frama-c if test "$enable_frama_c" = yes ; then # Extract the first word of "frama-c", so it can be a program name with args. set dummy frama-c; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_FRAMAC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$FRAMAC"; then ac_cv_prog_FRAMAC="$FRAMAC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_FRAMAC="frama-c" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS test -z "$ac_cv_prog_FRAMAC" && ac_cv_prog_FRAMAC="no" fi fi FRAMAC=$ac_cv_prog_FRAMAC if test -n "$FRAMAC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $FRAMAC" >&5 $as_echo "$FRAMAC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "$FRAMAC" = no ; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Cannot find Frama-C." >&5 $as_echo "$as_me: WARNING: Cannot find Frama-C." >&2;} enable_frama_c="no" reason_frama_c=" (frama-c not found)" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking Frama-C version" >&5 $as_echo_n "checking Frama-C version... " >&6; } FRAMAC_VERSION=`$FRAMAC -version | sed -n -e 's|Version: *\(.*\)$|\1|p'` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $FRAMAC_VERSION" >&5 $as_echo "$FRAMAC_VERSION" >&6; } case $FRAMAC_VERSION in Sodium-*) ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Version Sodium required." >&5 $as_echo "$as_me: WARNING: Version Sodium required." >&2;} enable_frama_c=no reason_frama_c=" (version Sodium required)" ;; esac FRAMAC_SHARE=`$FRAMAC -print-path` FRAMAC_LIBDIR=`$FRAMAC -print-libpath` fi fi #For the META if test "$enable_hypothesis_selection" = yes; then META_OCAMLGRAPH="ocamlgraph" else META_OCAMLGRAPH="" fi #Viewer for ps and pdf VERSION=$PACKAGE_VERSION # substitutions to perform # Finally create the Makefile from Makefile.in ac_config_files="$ac_config_files Makefile src/config.sh doc/version.tex" ac_config_files="$ac_config_files lib/why3/META" ac_config_files="$ac_config_files .merlin" ac_config_files="$ac_config_files src/jessie/Makefile" ac_config_commands="$ac_config_commands chmod" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # Transform confdefs.h into DEFS. # Protect against shell expansion while executing Makefile rules. # Protect against Makefile macro expansion. # # If the first sed substitution is executed (which looks for macros that # take arguments), then branch to the quote section. Otherwise, # look for a macro that doesn't take arguments. ac_script=' :mline /\\$/{ N s,\\\n,, b mline } t clear :clear s/^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*([^)]*)\)[ ]*\(.*\)/-D\1=\2/g t quote s/^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\)/-D\1=\2/g t quote b any :quote s/[ `~#$^&*(){}\\|;'\''"<>?]/\\&/g s/\[/\\&/g s/\]/\\&/g s/\$/$$/g H :any ${ g s/^\n// s/\n/ /g p } ' DEFS=`sed -n "$ac_script" confdefs.h` ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by Why3 $as_me 0.87.3, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE Configuration files: $config_files Configuration commands: $config_commands Report bugs to the package provider." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ Why3 config.status 0.87.3 configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --he | --h | --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "src/config.sh") CONFIG_FILES="$CONFIG_FILES src/config.sh" ;; "doc/version.tex") CONFIG_FILES="$CONFIG_FILES doc/version.tex" ;; "lib/why3/META") CONFIG_FILES="$CONFIG_FILES lib/why3/META" ;; ".merlin") CONFIG_FILES="$CONFIG_FILES .merlin" ;; "src/jessie/Makefile") CONFIG_FILES="$CONFIG_FILES src/jessie/Makefile" ;; "chmod") CONFIG_COMMANDS="$CONFIG_COMMANDS chmod" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" eval set X " :F $CONFIG_FILES :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "chmod":C) chmod a-w Makefile src/config.sh doc/version.tex; chmod a-w lib/why3/META; chmod a-w .merlin; chmod a-w src/jessie/Makefile; chmod u+x src/config.sh ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi # Summary echo echo " Summary" echo "-----------------------------------------" echo "Verbose make : $enable_verbose_make" echo "OCaml compiler : yes" echo " Version : $OCAMLVERSION" echo " Library path : $OCAMLLIB" echo " Native compilation : $enable_native_code" echo " Profiling : $enable_profiling" echo "Components" echo " IDE command : $enable_ide$reason_ide" echo " GMP arithmetic : $enable_zarith$reason_zarith" echo " Compressed sessions : $enable_zip$reason_zip" echo " MenhirLib support : $enable_menhirLib$reason_menhirLib" echo " Hypothesis selection : $enable_hypothesis_selection$reason_hypothesis_selection" echo " Frama-C support : $enable_frama_c$reason_frama_c" if test "$enable_frama_c" = yes ; then echo " Version : $FRAMAC_VERSION" echo " Share path : $FRAMAC_SHARE" echo " Library path : $FRAMAC_LIBDIR" fi echo "Documentation : $enable_doc$reason_doc" if test "$enable_doc" = yes ; then echo " PDF : yes" echo " HTML : $enable_html_doc$reason_html_doc" fi echo "Support for interactive proof assistants" echo " Coq : $enable_coq_support$reason_coq_support" if test "$enable_coq_support" = yes ; then echo " Version : $COQVERSION" echo " Library path : $COQLIB" echo " \"why3\" tactic : $enable_coq_tactic$reason_coq_tactic" echo " Realization support : $enable_coq_libs$reason_coq_libs" if test "$enable_coq_libs" = yes ; then echo " FP arithmetic : $enable_coq_fp_libs$reason_coq_fp_libs" fi fi echo " PVS : $enable_pvs_support$reason_pvs_support" if test "$enable_pvs_support" = yes ; then echo " Version : $PVSVERSION" echo " Library path : $PVSLIB" echo " Realization support : $enable_pvs_libs$reason_pvs_libs" fi echo " Isabelle : $enable_isabelle_support$reason_isabelle_support" if test "$enable_isabelle_support" = yes ; then echo " Version : $ISABELLEVERSION ($ISABELLEDETECTEDVERSION)" echo " Realization support : $enable_isabelle_libs$reason_isabelle_libs" fi if test "$enable_local" = yes ; then echo "Installable : no" else echo "Installable : yes" echo " Binary path : $bindir" echo " Lib path : $libdir/why3" echo " Data path : $datarootdir/why3" echo " Ocaml Library : $OCAMLINSTALLLIB/why3" echo " Relocatable : $enable_relocation" fi why3-0.87.3/AUTHORS0000644000175000017500000000071613035416743014317 0ustar guillaumeguillaumeThe Why3 Verification Platform is developed by François Bobot Jean-Christophe Filliâtre Claude Marché Guillaume Melquiond Andrei Paskevich with contributions of Stefan Berghofer Sylvie Boldo Martin Clochard Simon Cruanes Leon Gondelman Daisuke Ishii Johannes Kanig David Mentré Benjamin Monate Thi-Minh-Tuyen Nguyen Simão Melo de Sousa Asma Tafat Piotr Trojanek Makarius Wenzel why3-0.87.3/install-sh0000755000175000017500000003413713035417011015244 0ustar guillaumeguillaume#!/bin/sh # install - install a program, script, or datafile scriptversion=2011-11-20.07; # UTC # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # 'make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call 'install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then do_exit='(exit $ret); exit $ret' trap "ret=129; $do_exit" 1 trap "ret=130; $do_exit" 2 trap "ret=141; $do_exit" 13 trap "ret=143; $do_exit" 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names problematic for 'test' and other utilities. case $src in -* | [=\(\)!]) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) # $RANDOM is not portable (e.g. dash); use it when possible to # lower collision chance tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/a/b" "$tmpdir/a" "$tmpdir" 2>/dev/null; exit $ret' 0 # As "mkdir -p" follows symlinks and we work in /tmp possibly; so # create the $tmpdir first (and fail if unsuccessful) to make sure # that nobody tries to guess the $tmpdir name. if (umask $mkdir_umask && $mkdirprog $mkdir_mode "$tmpdir" && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/a/b") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. test_tmpdir="$tmpdir/a" ls_ld_tmpdir=`ls -ld "$test_tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$test_tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$test_tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/a/b" "$tmpdir/a" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- "$tmpdir" 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; [-=\(\)!]*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test X"$d" = X && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: why3-0.87.3/plugins/0000755000175000017500000000000013035416743014724 5ustar guillaumeguillaumewhy3-0.87.3/plugins/transform/0000755000175000017500000000000013035416743016737 5ustar guillaumeguillaumewhy3-0.87.3/plugins/transform/hypothesis_selection.ml0000644000175000017500000005637413035416743023554 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) (*s Transformation which removes most hypothesis, only keeping the one a graph-based heuristic finds close enough to the goal *) open Why3 open Ident open Term open Decl open Task (* lots of modules and functors applications to be used later *) module Int_Dft = struct type t = int let compare = Pervasives.compare let default = max_int end module GP = Graph.Persistent.Digraph.ConcreteLabeled( struct type t = lsymbol let compare = ls_compare let hash = ls_hash let equal = ls_equal end)(Int_Dft) (** a way to compare/hash expressions *) module ExprNode = struct type t = Term.term let compare = t_compare let hash = t_hash let equal = t_equal end module GC = Graph.Persistent.Graph.Concrete(ExprNode) module Sls = Set.Make(GP.V) module Sexpr = Set.Make(ExprNode) (** prints the given expression, transforming spaces into _ *) let string_of_expr_node node = let print_in_buf printer x = Format.fprintf Format.str_formatter "@[%a@]" printer x; Format.flush_str_formatter() in let white_space = Str.regexp "[ ()]" in let translate x = Str.global_replace white_space "_" x in let repr = print_in_buf Pretty.print_term node in translate repr (* for debugging (graph printing) purposes *) module Dot_ = Graph.Graphviz.Dot(struct include GC let graph_attributes _ = [] let default_vertex_attributes _ = [] let vertex_attributes _ = [] let vertex_name x = string_of_expr_node (GC.V.label x) let get_subgraph _ = None let default_edge_attributes _ = [] let edge_attributes _ = [] end) (** some useful things *) module Util = struct let print_clause fmt = Format.fprintf fmt "@[[%a]@]" (Pp.print_list Pp.comma Pretty.print_term) let print_clauses fmt = Format.fprintf fmt "[%a]@." (Pp.print_list Pp.comma print_clause) (** [combinator] applied to all combinaisons of elements of [left] and [right] *) let map_complete combinator left right = let explorer left_elt = List.map (fun right_elt -> combinator left_elt right_elt) right in List.flatten (List.map explorer left) (** all combinaisons of elements of [left] and [right], folded with [combinator] starting with [acc] *) let fold_complete combinator acc left right = let explorer acc left_elt = List.fold_left (fun acc right_elt -> combinator acc left_elt right_elt) acc right in List.fold_left explorer acc left (** given two lists of sets of expr, returns the list made from their union. It is like zipping the lists with Sexpr.union. *) let rec merge_list l1 l2 = match l1,l2 with | x::xs,y::ys -> (Sexpr.union x y) :: merge_list xs ys | _,[] -> l1 | [],_ -> l2 end (** module used to reduce formulae to Normal Form *) module NF = struct (* add memoization, one day ? *) (* TODO ! *) (** all quantifiers in prenex form, currently just identity *) let prenex_fmla fmla = Format.eprintf "prenex_fmla : @[%a@]@." Pretty.print_term fmla; fmla (** creates a fresh non-quantified formula, representing a quantified formula *) let create_fmla (vars:Term.vsymbol list) : Term.term = let pred = create_psymbol (id_fresh "temoin") (List.map (fun var -> var.vs_ty) vars) in ps_app pred (List.map t_var vars) (** transforms a formulae into its Normal Form as a list of clauses. The first argument is a hastable from formulae to formulae. A clause is a list of formulae, so this function returns a list of list of formulae. *) let rec transform fmlaTable fmla = Format.eprintf "transform : @[%a@]@." Pretty.print_term fmla; match fmla.t_node with | Tquant (_,f_bound) -> let var,_,f = t_open_quant f_bound in traverse fmlaTable fmla var f | Tbinop (_,_,_) -> let clauses = split fmla in Format.eprintf "split : @[%a@]@." Util.print_clause clauses; begin match clauses with | [f] -> begin match f.t_node with | Tbinop (Tor,f1,f2) -> let left = transform fmlaTable f1 in let right = transform fmlaTable f2 in Util.map_complete List.append left right | _ -> [[f]] end | _ -> List.concat (List.map (transform fmlaTable) clauses) end | Tnot f -> handle_not fmlaTable fmla f | Tapp (_,_) -> [[fmla]] | Ttrue | Tfalse -> [[fmla]] | Tif (_,_,_) -> failwith "if formulae not handled" | Tlet (_,_) -> failwith "let formulae not handled" | Tcase (_,_) -> failwith "case formulae not handled" | Tvar _ | Tconst _ | Teps _ -> raise (FmlaExpected fmla) (** travers prefix quantifiers until it reaches a non-quantified formula, collecting bounded vars encountered *) and traverse fmlaTable old_fmla vars fmla = match fmla.t_node with | Tquant (_,f_bound) -> let var,_,f = t_open_quant f_bound in traverse fmlaTable old_fmla (var@vars) f | _ -> if Hterm.mem fmlaTable fmla then [[Hterm.find fmlaTable fmla]] else let new_fmla = create_fmla vars in Hterm.add fmlaTable old_fmla new_fmla; Hterm.add fmlaTable new_fmla new_fmla; [[new_fmla]] (** skips prenex quantifiers *) and skipPrenex fmlaTable fmla = match fmla.t_node with | Tquant (_,f_bound) -> let _,_,f = t_open_quant f_bound in skipPrenex fmlaTable f | _ -> transform fmlaTable fmla (** logical binary operators splitting *) and split f = match f.t_node with | Tbinop (Timplies,{t_node = Tbinop (Tor, h1, h2)},f2) -> (split (t_binary Timplies h1 f2)) @ (split (t_binary Timplies h2 f2)) | Tbinop (Timplies,f1,f2) -> let clauses = split f2 in if List.length clauses >= 2 then List.concat (List.map (fun f -> split (t_binary Timplies f1 f)) clauses) else split (t_or (t_not f1) f2) | Tbinop (Tand,f1,f2) -> [f1; f2] | _ -> [f] (** negation operator handling (with de morgan rules) *) and handle_not fmlaTable old_f f = match f.t_node with | Tquant (Tforall,f_bound) -> let vars,triggers,f1 = t_open_quant f_bound in transform fmlaTable (t_exists_close vars triggers (t_not f1)) | Tnot f1 -> transform fmlaTable f1 | Tbinop (Tand,f1,f2) -> transform fmlaTable (t_or (t_not f1) (t_not f2)) | Tbinop (Tor,f1,f2) -> transform fmlaTable (t_and (t_not f1) (t_not f2)) | Tbinop (Timplies,f1,f2) -> transform fmlaTable (t_and f1 (t_not f2)) | Tbinop (Tiff,f1,f2) -> transform fmlaTable (t_or (t_and f1 (t_not f2)) (t_and (t_not f1) f2)) | _ -> [[old_f]] (* default case *) (** the function to use to effectively transform into a normal form *) let make_clauses fmlaTable prop = let prenex_fmla = prenex_fmla prop in let clauses = skipPrenex fmlaTable prenex_fmla in Format.eprintf "==>@ @[%a@]@.@." Util.print_clauses clauses; clauses end (** module used to compute the graph of relations between constants *) module GraphConstant = struct (** memoizing for formulae and terms, and then expressions *) let rec findF fTbl fmla = try Hterm.find fTbl fmla with Not_found -> let new_v = GC.V.create fmla in Hterm.add fTbl fmla new_v; (* Format.eprintf "generating new vertex : %a@." Pretty.print_term fmla; *) new_v and findT tTbl term = try Hterm.find tTbl term with Not_found -> let new_v = GC.V.create term in Hterm.add tTbl term new_v; (* Format.eprintf "generating new vertex : %a@." Pretty.print_term fmla; *) new_v and find fTbl tTbl expr = TermTF.t_select (findT tTbl) (findF fTbl) expr (** adds a symbol to the graph *) let add_symbol fTbl tTbl gc expr = GC.add_vertex gc (find fTbl tTbl expr) (** analyse dynamic dependencies in one atomic formula, from the bottom *) let rec analyse_fmla_base fTbl tTbl gc fmla = let gc,_ = analyse_fmla fTbl tTbl (gc,[]) fmla in gc (** recursive function used by the previous function *) and analyse_fmla fTbl tTbl (gc,vertices) fmla = match fmla.t_node with | Tapp (_,terms) -> let gc,sub_vertices = List.fold_left (analyse_term fTbl tTbl) (gc,[]) terms in (* make a clique with [sub_vertices] elements *) let gc = Util.fold_complete GC.add_edge gc sub_vertices sub_vertices in let pred_vertex = findF fTbl fmla in (* add edges between [pred_vertex] and [sub_vertices] *) let gc = List.fold_left (fun gc term_vertex -> GC.add_edge gc pred_vertex term_vertex) gc sub_vertices in (gc, pred_vertex :: vertices) | _ -> TermTF.t_fold (analyse_term fTbl tTbl) (analyse_fmla fTbl tTbl) (gc,vertices) fmla (** explore terms. mutually recursive with the previous function *) and analyse_term fTbl tTbl (gc,vertices) term = match term.t_node with | Tvar _ | Tconst _ -> let vertex = findT tTbl term in (gc,vertex::vertices) | Tapp (_,terms) -> let gc,sub_vertices = List.fold_left (analyse_term fTbl tTbl) (gc,[]) terms in (* make a clique with [sub_vertices] elements *) let gc = Util.fold_complete GC.add_edge gc sub_vertices sub_vertices in let func_vertex = findT tTbl term in (* add edges between [func_vertex] and [sub_vertices] *) let gc = List.fold_left (fun gc term_vertex -> GC.add_edge gc func_vertex term_vertex) gc sub_vertices in (gc, func_vertex :: vertices) | _ -> TermTF.t_fold (analyse_term fTbl tTbl) (analyse_fmla fTbl tTbl) (gc,vertices) term (** analyse a single clause by folding analyse_fmla_base over it *) let analyse_clause fTbl tTbl gc clause = List.fold_left (analyse_fmla_base fTbl tTbl) gc clause (** analyses a list of clauses : - fold over clauses with analyse_clause *) let analyse_clauses fTbl tTbl gc clauses = List.fold_left (analyse_clause fTbl tTbl) gc clauses end (** module used to compute the directed graph of predicates *) module GraphPredicate = struct exception Exit of lsymbol (** test for negative formulae *) let is_negative = function | { t_node = Tnot _ } -> true | _ -> false (** assuming the formula looks like p(t1,t2...), returns the symbol p *) let extract_symbol fmla = let rec search = function | { t_node = Tapp(p,_) } -> raise (Exit p) | f -> TermTF.t_map (fun t->t) search f in try ignore (search fmla); Format.eprintf "invalid formula : "; Pretty.print_term Format.err_formatter fmla; assert false with Exit p -> p let find symbTbl x = try Hls.find symbTbl x with Not_found -> let new_v = GP.V.create x in Hls.add symbTbl x new_v; (* Format.eprintf "generating new vertex : %a@." Pretty.print_ls x; *) new_v (** analyse a single clause, and creates an edge between every positive litteral and every negative litteral of [clause] in [gp] graph. *) let analyse_clause symbTbl gp clause = let get_symbol x = find symbTbl (extract_symbol x) in let negative,positive = List.partition is_negative clause in let negative = List.map get_symbol negative in let positive = List.map get_symbol positive in let n = List.length clause in let add left gp right = try let old = GP.find_edge gp left right in if GP.E.label old <= n then gp (* old edge is fine *) else let new_gp = GP.remove_edge_e gp old in assert (not (GP.mem_edge new_gp left right)); GP.add_edge_e gp (GP.E.create left n right) with Not_found -> let e = GP.E.create left n right in GP.add_edge_e gp e in List.fold_left (* add an edge from every negative to any positive *) (fun gp left -> List.fold_left (add left) gp positive) gp negative let analyse_clauses symbTbl gp clauses = List.fold_left (analyse_clause symbTbl) gp clauses (** add a symbol to the graph as a new vertex *) let add_symbol symbTbl gp lsymbol = GP.add_vertex gp (find symbTbl lsymbol) end (** module that makes the final selection *) module Select = struct (** gets all predicates symbols of the formula *) let get_predicates fmla = let id acc _ = acc in let rec explore acc fmla = match fmla.t_node with | Tapp (pred,_) -> pred::acc | _ -> TermTF.t_fold id explore acc fmla in explore [] fmla (** gets all predicate symbols from a clause *) let get_clause_predicates acc clause = let rec fmla_get_pred ?(pos=true) acc fmla = match fmla.t_node with | Tnot f -> fmla_get_pred ~pos:false acc f | Tapp (pred,_) -> (pred, (if pos then `Positive else `Negative))::acc | _ -> failwith "bad formula in get_predicates !" in List.fold_left (fmla_get_pred ?pos:None) acc clause (** get all sub-formulae *) let get_sub_fmlas fTbl tTbl fmla = let rec gather_sub_fmla fTbl tTbl acc fmla = match fmla.t_node with | Tapp (_,terms) -> let acc = List.fold_left (gather_sub_term fTbl tTbl) acc terms in GraphConstant.findF fTbl fmla :: acc | _ -> TermTF.t_fold (gather_sub_term fTbl tTbl) (gather_sub_fmla fTbl tTbl) acc fmla and gather_sub_term fTbl tTbl acc term = match term.t_node with | Tapp (_,terms) -> let acc = List.fold_left (gather_sub_term fTbl tTbl) acc terms in GraphConstant.findT tTbl term :: acc | Tconst _ | Tvar _ -> GraphConstant.findT tTbl term :: acc | _ -> TermTF.t_fold (gather_sub_term fTbl tTbl) (gather_sub_fmla fTbl tTbl) acc term in gather_sub_fmla fTbl tTbl [] fmla (** get the predecessors of [positive] in the graph [gp], at distance <= [i]*) let rec get_predecessors i gp acc positive = if i < 0 then acc else let acc = Sls.add positive acc in List.fold_left (follow_edge gp i) acc (GP.pred_e gp positive) and follow_edge ?(forward=false) gp i acc edge = let f = if forward then get_successors else get_predecessors in f (i - GP.E.label edge) gp acc ((if forward then GP.E.dst else GP.E.src) edge) and get_successors j gp acc negative = if j < 0 then acc else let acc = Sls.add negative acc in List.fold_left (follow_edge ~forward:true gp j) acc (GP.succ_e gp negative) exception FixPoint exception Exit of Sexpr.t list (** builds the list of reachable nodes in a non-directed graph (of constants)*) let build_relevant_variables gc goal_clause = let rec add_literal acc f = match f.t_node with | Tnot f -> add_literal acc f | Tapp _ -> Sexpr.add f acc | _ -> failwith "bad literal in the goal clause" in let l0 = List.fold_left add_literal Sexpr.empty goal_clause in (** explore one more step *) let rec one_step cur = let step = Sexpr.fold explore cur [cur;cur] in Format.eprintf "one step made !@."; step (** explores the neighbours of [vertex] *) and explore vertex l = match l with [_next_cur;cur] -> (** [changed] indicates whether a vertex has been added; [v] is a vertex *) let find_odd v ((acc,_changed) as old) = if Sexpr.mem v acc then old else let count = GC.fold_pred (fun v2 count -> if Sexpr.mem v2 acc then count+1 else count) gc v 0 in (* how many predecessors in acc ? *) if count >= 2 then (Sexpr.add v acc,true) else old in let find_even prev_step v ((acc,_changed) as old) = if Sexpr.mem v prev_step || Sexpr.mem v acc then old else if GC.fold_pred (fun v2 bool -> bool || (Sexpr.mem v2 acc)) gc v false (* connected to a vertex in acc ? *) then (Sexpr.add v acc, true) else old in let next_cur_odd,has_changed = (* compute 2^n+1 elts *) GC.fold_succ find_odd gc vertex (cur,false) in let next_cur_even,has_changed = (* compute 2^n+2 elts *) GC.fold_succ (find_even next_cur_odd) gc vertex (cur,has_changed) in if has_changed then [next_cur_even;next_cur_odd] else raise FixPoint | _ -> assert false (*only not to have warnings on non-exhaustive match*) (** iterates [one_step] until an exception is raised *) and control cur acc = let next_acc = try let next_step = one_step cur in next_step @ acc (* next step contains *2* steps *) with FixPoint -> Format.eprintf "[control] : fixpoint reached !"; raise (Exit acc) in control (List.hd next_acc) next_acc in try ignore (control l0 [l0]); [l0] (* never returns. this is an odd step (step 1) *) with Exit answer -> List.rev answer (* TODO : be more clear... *) (** determines if a proposition is pertinent w.r.t the given goal formula, from data stored in the graph [gp] given. [i] is the parameter of predicate graph ([gp]) based filtering. [j] is the parameter for dynamic constants ([gc]) dependency filtering *) let is_pertinent_predicate symTbl goal_clauses ?(i=4) gp fmla = let is_negative = function | (_,`Negative) -> true | (_,`Positive) -> false in let find_secure symbTbl x = try Hls.find symbTbl x with Not_found -> Format.eprintf "failure finding %a !@." Pretty.print_ls x; raise Not_found in let goal_predicates = List.fold_left get_clause_predicates [] goal_clauses in let predicates = get_predicates fmla in let negative,positive = List.partition is_negative goal_predicates in let negative,positive = List.map fst negative, List.map fst positive in let negative = List.map (find_secure symTbl) negative in (* to be optimized ? *) let positive = List.map (find_secure symTbl) positive in let predicates = List.map (find_secure symTbl) predicates in (* list of negative predecessors of any positive predicate of the goal, at distance <= i *) let predecessors = List.fold_left (get_predecessors i gp) Sls.empty positive in let successors = List.fold_left (get_successors i gp) Sls.empty negative in (* a predicates is accepted iff all its predicates are close enough in successors or predecessors lists *) List.for_all (fun x -> if Sls.mem x predecessors || Sls.mem x successors then true else begin Format.eprintf "%a not close enough (dist %d)@." Pretty.print_ls (GP.V.label x) i; false end) predicates (** tests whether a formula is pertinent according to the dynamic dependency criterion (using the undirected graph gc). *) let is_pertinent_dynamic fTbl tTbl goal_clauses ?(j=4) gc = let relevant_variables = (* ideally, there should be only one goal clause *) List.fold_left Util.merge_list [] (List.map (build_relevant_variables gc) goal_clauses) in function fmla -> let rec is_close_enough x l count = match (l,count) with | _,n when n < 0 -> false | y::_,_ when Sexpr.mem x y -> true | _::ys,count -> is_close_enough x ys (count-1) | _,_ -> false (* case where the fmla is not reachable from goal vars *) in let is_acceptable fmla = is_close_enough fmla relevant_variables j in let sub_fmlas = get_sub_fmlas fTbl tTbl fmla in let sub_fmlas = List.map GC.V.label sub_fmlas in List.for_all is_acceptable sub_fmlas (** preprocesses the goal formula and the graph, and returns a function that will accept or not axioms according to their relevance. This is the function directly used to filter axioms. *) let filter fTbl tTbl symTbl goal_clauses (gc,gp) decl = match decl.d_node with | Dtype _ | Ddata _ | Dparam _ | Dlogic _ | Dind _ -> [decl] | Dprop (Paxiom,_,fmla) -> (* filter only axioms *) Format.eprintf "filter : @[%a@]@." Pretty.print_term fmla; let goal_exprs = goal_clauses in let return_value = if is_pertinent_predicate symTbl goal_clauses gp fmla && is_pertinent_dynamic fTbl tTbl goal_exprs gc fmla then [decl] else [] in if return_value = [] then Format.eprintf "NO@.@." else Format.eprintf "YES@.@."; return_value | Dprop(_,_,_) -> [decl] end (** persistent incremental tables *) let fmlaTable = Hterm.create 17 let fTbl = Hterm.create 17 let tTbl = Hterm.create 17 let symbTbl = Hls.create 17 (** collects data on predicates and constants in task *) let collect_info = let analyse_prop is_goal gc gp prop = let clauses = NF.make_clauses fmlaTable prop in (if is_goal then Some clauses else None), GraphConstant.analyse_clauses fTbl tTbl gc clauses, GraphPredicate.analyse_clauses symbTbl gp clauses in let update task_head (last_clauses,gc,gp) = assert (last_clauses = None); match task_head.task_decl.Theory.td_node with | Theory.Decl {d_node = Dprop (Pgoal,_,prop_decl)} -> analyse_prop true gc gp prop_decl | Theory.Decl {d_node = Dprop (_,_,prop_decl)} -> analyse_prop false gc gp prop_decl | Theory.Decl {d_node = Dparam ls} -> None, gc, GraphPredicate.add_symbol symbTbl gp ls | Theory.Decl {d_node = Dlogic dl} -> let add_symbol gp (ls,_) = GraphPredicate.add_symbol symbTbl gp ls in let gp = List.fold_left add_symbol gp dl in let add_ld (_,gc,gp) (_,ld) = analyse_prop false gc gp (Decl.ls_defn_axiom ld) in List.fold_left add_ld (None,gc,gp) dl | Theory.Decl {d_node = Dind (_,il)} -> let add_symbol gp (ls,_) = GraphPredicate.add_symbol symbTbl gp ls in let gp = List.fold_left add_symbol gp il in let add_id (_,gc,gp) (_,prop) = analyse_prop false gc gp prop in let add_id (_,gc,gp) (_,il) = List.fold_left add_id (None,gc,gp) il in List.fold_left add_id (None,gc,gp) il | _ -> None,gc,gp in Trans.fold update (None, GC.empty, GP.empty) (** the transformation, made from applying collect_info and then mapping Select.filter *) let transformation task = (* first, collect data in 2 graphes *) let (last_clauses,gc,gp) = Trans.apply collect_info task in Format.eprintf "graph: @\n@\n%a@\n@." Dot_.fprint_graph gc; (* get the goal *) let goal_clauses = match last_clauses with | None -> failwith "no goal !" | Some clauses -> clauses in (* filter one declaration at once *) Trans.apply (Trans.decl (Select.filter fTbl tTbl symbTbl goal_clauses (gc,gp)) None) task (** the transformation to be registered *) let hypothesis_selection = Trans.store transformation let () = Trans.register_transform "hypothesis_selection" hypothesis_selection ~desc:"Hypothesis@ selection." (* Local Variables: compile-command: "unset LANG; make" End: vim:foldmethod=indent:foldnestmax=1 *) why3-0.87.3/plugins/printer/0000755000175000017500000000000013035416743016407 5ustar guillaumeguillaumewhy3-0.87.3/plugins/printer/.keepme0000644000175000017500000000000013035416743017644 0ustar guillaumeguillaumewhy3-0.87.3/plugins/parser/0000755000175000017500000000000013035416743016220 5ustar guillaumeguillaumewhy3-0.87.3/plugins/parser/genequlin.ml0000644000175000017500000001112513035416743020541 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) (* *) open Why3 (**************) (* This plugin generate randomly linear arithmetic problems from a source file.Here an exemple : ======== 2 5 5 5 15 5 5 5 15 5 5 5 15 ======== The first line give the seed to use. Each other lines corresond to one goal : - the first number give the number of variables - the second the number of equation - the third the absolute maximun of the constants used For compiling it : make example_plugins.opt cp examples/plugins/genequlin.cmxs plugins bin/why3config --detect-plugins For testing it : bin/why3ide examples/plugins/test.equlin *) open Theory open Term open Stdlib open Ident (** read one line *) let scanf s = let invar = String.index_from s 0 ' ' in let im = String.index_from s (invar+1) ' ' in int_of_string (String.sub s 0 invar), int_of_string (String.sub s (invar+1) (im-(invar+1))), int_of_string (String.sub s (im+1) ((String.length s) - (im+1))) (** the main function *) let read_channel env path filename cin = (* Find the int theory and the needed operation *) let th_int = Env.read_theory env ["int"] "Int" in let leq = ns_find_ls th_int.th_export ["infix <"] in let plus_symbol = Theory.ns_find_ls th_int.Theory.th_export ["infix +"] in let neg_symbol = Theory.ns_find_ls th_int.Theory.th_export ["prefix -"] in let mult_symbol = Theory.ns_find_ls th_int.Theory.th_export ["infix *"] in let zero = t_nat_const 0 in let t_int_const n = if n >= 0 then t_nat_const n else t_app_infer neg_symbol [t_nat_const (-n)] in (* create a contraint : polynome <= constant *) let create_lit lvar k lits _ = let left = List.fold_left (fun acc e -> let const = (Random.int k) - (k/2) in let monome = t_app mult_symbol [e;t_int_const const] (Some Ty.ty_int) in t_app plus_symbol [acc;monome] (Some Ty.ty_int)) zero lvar in let rconst = (Random.int k) - (k/2) in t_and_simp lits (t_app leq [left;t_int_const rconst] None) in (* create a set of constraints *) let create_fmla nvar m k = let lvar = Util.mapi (fun _ -> create_vsymbol (id_fresh "x") Ty.ty_int) 1 nvar in let lt = List.map t_var lvar in let lits = Util.foldi (create_lit lt k) t_true 1 m in t_forall_close lvar [] (t_implies_simp lits t_false) in (* read the first line *) let line = ref 0 in begin try let seed = input_line cin in Random.init (int_of_string seed) with _ -> Printf.eprintf "error file %s line 1\n" filename; exit 1 end; (* Create the theory *) let th_uc_loc = Loc.user_position filename 1 0 0 in let th_uc = create_theory ~path (id_user "EqLin" th_uc_loc) in let th_uc = Theory.use_export th_uc th_int in (* Read one line and add it to the theory *) let fold th_uc s = let nvar,m,k = try incr line; (* Dont use scanf because I don't know how to link it in plugin (without segfault) *) (* Scanf.sscanf s "%i %i %i" (fun nvar m k -> nvar,m,k) *) scanf s with _ -> Printf.eprintf "Error file %s line %i" filename !line;exit 1 in let loc = Loc.user_position filename (!line+1) 0 (String.length s) in let goal_id = Decl.create_prsymbol (Ident.id_user (Printf.sprintf "goal%i" !line) loc) in let fmla = create_fmla nvar m k in let th_uc = Theory.add_prop_decl th_uc Decl.Pgoal goal_id fmla in th_uc in (* Read all the file *) let th_uc = Sysutil.fold_channel fold th_uc cin in (* Return the map with the theory *) Mstr.singleton "EquLin" (close_theory th_uc) let () = Env.register_format Env.base_language "equlin" ["equlin"] read_channel ~desc:"@[Generate@ random@ linear@ arithmetic@ problems.@ \ The@ first@ line@ gives@ the@ seed.@ Each@ other@ line@ \ describes@ a@ goal@ and@ contains@ three@ numbers:@]@\n \ @[- @[the@ number@ of@ variables@]@\n\ - @[the@ number@ of@ equations@]@\n\ - @[the@ maximum@ absolute@ value@ of@ coefficients.@]@]" why3-0.87.3/plugins/parser/dimacs.mll0000644000175000017500000001264513035416743020176 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) (**************************************************************************) (* *) (* This file is part of Frama-C. *) (* *) (* Copyright (C) 2013 *) (* CEA (Commissariat à l'énergie atomique et aux énergies *) (* alternatives) *) (* *) (* you can redistribute it and/or modify it under the terms of the GNU *) (* Lesser General Public License as published by the Free Software *) (* Foundation, version 2.1. *) (* *) (* It 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. See the *) (* GNU Lesser General Public License for more details. *) (* *) (* See the GNU Lesser General Public License version 2.1 *) (* for more details (enclosed in the file licenses/LGPLv2.1). *) (* *) (**************************************************************************) { open Why3 open Stdlib type vars = Term.term array let get_indice i = if i > 0 then (i-1)*2 else if i < 0 then (-i-1)*2+1 else assert false let init_vars th_uc nb_var = let a = Array.make (nb_var*2) Term.t_true in let th = ref th_uc in for i = nb_var downto -nb_var do if i <> 0 then if i > 0 then let id = Ident.id_fresh (Printf.sprintf "x%i" i) in let ls = Term.create_psymbol id [] in th := Theory.add_param_decl !th ls; a.(get_indice i) <- (Term.ps_app ls []) else if i < 0 then a.(get_indice i) <- Term.t_not a.(get_indice (-i)) done; !th,a let get_lit vars i = let i = int_of_string i in vars.(get_indice i) exception SyntaxError of string let syntax_error s = raise (SyntaxError s) let () = Exn_printer.register (fun fmt e -> match e with | SyntaxError s -> Format.pp_print_string fmt s | _ -> raise e) } let newline = '\n' let space = [' ' '\t' '\r']+ let digit = ['0'-'9'] let sign = '-' | '+' let integer = sign? digit+ rule find_header = parse | newline { Lexing.new_line lexbuf; find_header lexbuf } | space { find_header lexbuf } | 'p' space+ "cnf" space+ (digit+ as nb_var) space+ (digit+ as nb_cls) { int_of_string nb_var, int_of_string nb_cls } | 'c' [^'\n']* '\n' { Lexing.new_line lexbuf; find_header lexbuf } | _ { syntax_error "Can't find header" } and clause vars acc = parse | newline { Lexing.new_line lexbuf; clause vars acc lexbuf } | space { clause vars acc lexbuf } | '0' { List.rev acc } | integer as i { clause vars ((get_lit vars i)::acc) lexbuf } | _ { syntax_error "Bad clause" } and file th_uc vars n = parse | newline { Lexing.new_line lexbuf; file th_uc vars n lexbuf } | space { file th_uc vars n lexbuf } | '0' { file th_uc vars n lexbuf } | integer as i { let l = clause vars [get_lit vars i] lexbuf in let t = List.fold_left (fun acc t -> Term.t_or acc t ) Term.t_false l in let pr = Decl.create_prsymbol (Ident.id_fresh ("Cl"^(string_of_int n))) in let th_uc = Theory.add_prop_decl th_uc Decl.Paxiom pr t in file th_uc vars (n+1) lexbuf } | 'c' [^'\n']* ('\n' | eof) { Lexing.new_line lexbuf; file th_uc vars n lexbuf } | eof { th_uc } | _ { syntax_error "Bad clauses" } { let parse th_uc filename cin = let lb = Lexing.from_channel cin in Loc.set_file filename lb; Loc.with_location (fun lexbuf -> let nb_vars, _ = find_header lexbuf in let th_uc, vars = init_vars th_uc nb_vars in file th_uc vars 0 lexbuf) lb let parse _env _path filename cin = let th_uc = Theory.create_theory (Ident.id_fresh "Cnf") in let th_uc = parse th_uc filename cin in let pr = Decl.create_prsymbol (Ident.id_fresh "false") in let th_uc = Theory.add_prop_decl th_uc Decl.Pgoal pr Term.t_false in Mstr.singleton "Cnf" (Theory.close_theory th_uc) let () = Env.register_format Env.base_language "dimacs" ["cnf"] parse ~desc:"@[Parser for dimacs format.@]" } (* Local Variables: compile-command: "unset LANG; make -C ../.." End: *) why3-0.87.3/plugins/tptp/0000755000175000017500000000000013035416743015713 5ustar guillaumeguillaumewhy3-0.87.3/plugins/tptp/tptp_printer.mli0000644000175000017500000000130713035416743021151 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) why3-0.87.3/plugins/tptp/tptp_parser.mly0000644000175000017500000001727513035416743021015 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) %{ open Tptp_ast let mk_expr n s e = { e_node = n; e_loc = Why3.Loc.extract (s,e) } let remove_quotes s = String.sub s 1 (String.length s - 2) exception UnsupportedRole of string let () = Why3.Exn_printer.register (fun fmt exn -> match exn with | UnsupportedRole s -> Format.fprintf fmt "unsupported role %s" s | Error -> Format.fprintf fmt "syntax error" | _ -> raise exn) %} (* tokens *) %token LWORD UWORD %token DWORD %token SINGLE_QUOTED DISTINCT_OBJECT %token INTPOSNUM %token INTNEGNUM %token RATPOSNUM %token RATNEGNUM %token REALPOSNUM %token REALNEGNUM (* keywords *) %token ASSUMPTION AXIOM CNFK CONJECTURE COROLLARY DEFINITION FOFK %token HYPOTHESIS INCLUDE LEMMA NEGATED_CONJECTURE TFFK %token THEOREM TYPE (* symbols *) %token DOT COMMA COLON LEFTPAR RIGHTPAR LEFTSQ RIGHTSQ %token LONGARROW LARROW RARROW LRARROW NLRARROW NAMP NBAR %token TILDE EQUAL NEQUAL STAR GT PI BANG QUES BAR AMP %token LET_TT LET_FT LET_TF LET_FF ITE_T ITE_F %token EOF (* entry points *) %start tptp_file %% tptp_file: | input* EOF { $1 } input: | kind LEFTPAR name COMMA role COMMA top_formula annotation RIGHTPAR DOT { Formula ($1, $3, $5, $7, Why3.Loc.extract ($startpos, $endpos)) } | INCLUDE LEFTPAR SINGLE_QUOTED formula_selection RIGHTPAR DOT { Include (remove_quotes $3, $4, Why3.Loc.extract ($startpos, $endpos)) } kind: | TFFK { TFF } | FOFK { FOF } | CNFK { CNF } role: | AXIOM { Axiom } | HYPOTHESIS { Hypothesis } | DEFINITION { Definition } | ASSUMPTION { Assumption } | LEMMA { Lemma } | THEOREM { Theorem } | CONJECTURE { Conjecture } | COROLLARY { Corollary } | NEGATED_CONJECTURE { Negated_conjecture } | TYPE { Type } | LWORD { raise (UnsupportedRole $1) } top_formula: | formula { LogicFormula $1 } | typed_atom { $1 } | sequent { $1 } (* formula and term *) expr(X): | X { mk_expr $1 $startpos $endpos } formula: | expr(nonassoc_formula) { $1 } | expr(or_formula) { $1 } | expr(and_formula) { $1 } | unitary_formula { $1 } nonassoc_formula: | unitary_formula nassoc unitary_formula { Ebin ($2,$1,$3) } or_formula: | unitary_formula BAR unitary_formula { Ebin (BOor,$1,$3) } | expr(or_formula) BAR unitary_formula { Ebin (BOor,$1,$3) } and_formula: | unitary_formula AMP unitary_formula { Ebin (BOand,$1,$3) } | expr(and_formula) AMP unitary_formula { Ebin (BOand,$1,$3) } unitary_formula: | expr(unitary_formula_) { $1 } | LEFTPAR formula RIGHTPAR { $2 } unitary_formula_: | ITE_F LEFTPAR formula COMMA formula COMMA formula RIGHTPAR { Eite ($3,$5,$7) } | LET_FF LEFTPAR expr(formula_def) COMMA formula RIGHTPAR { Elet ($3,$5) } | LET_TF LEFTPAR expr(term_def) COMMA formula RIGHTPAR { Elet ($3,$5) } | quant LEFTSQ varlist RIGHTSQ COLON unitary_formula { Eqnt ($1,$3,$6) } | TILDE unitary_formula { Enot $2 } | term NEQUAL term { Enot (mk_expr (Eequ ($1,$3)) $startpos $endpos) } | term EQUAL term { Eequ ($1,$3) } | plain_term { $1 } term: | expr(term_) { $1 } term_: | ITE_T LEFTPAR formula COMMA term COMMA term RIGHTPAR { Eite ($3,$5,$7) } | LET_FT LEFTPAR expr(formula_def) COMMA term RIGHTPAR { Elet ($3,$5) } | LET_TT LEFTPAR expr(term_def) COMMA term RIGHTPAR { Elet ($3,$5) } | DISTINCT_OBJECT { Edob $1 } | pos_number { Enum $1 } | neg_number { Edef (DF DFumin, [mk_expr (Enum $1) $startpos $endpos]) } | plain_term { $1 } plain_term: | DWORD paren_list(term) { Edef ($1,$2) } | atomic_word paren_list(term) { Eapp ($1,$2) } | var_term { $1 } var_term: | UWORD { Evar $1 } formula_def: | BANG LEFTSQ varlist RIGHTSQ COLON expr(formula_def) { Eqnt (Qforall,$3,$6) } | formula_def_inner { $1 } term_def: | BANG LEFTSQ varlist RIGHTSQ COLON expr(term_def) { Eqnt (Qforall,$3,$6) } | term_def_inner { $1 } formula_def_inner: | expr(def_lhs) LRARROW formula { Ebin (BOequ,$1,$3) } | LEFTPAR formula_def_inner RIGHTPAR { $2 } term_def_inner: | expr(def_lhs) EQUAL term { Eequ ($1,$3) } | LEFTPAR term_def_inner RIGHTPAR { $2 } def_lhs: | atomic_word paren_list(expr(var_term)) { Eapp ($1,$2) } varlist: | comma_list(typed_var) { $1 } typed_var: | UWORD { $1, mk_expr (Edef (DT DTuniv, [])) $startpos $endpos } | UWORD COLON atomic_type { $1, $3 } (* typed_atom *) typed_atom: | untyped_atom COLON top_type { TypedAtom ($1,$3) } | LEFTPAR typed_atom RIGHTPAR { $2 } untyped_atom: | atomic_word { $1 } top_type: | atomic_type { [],([],$1) } | mapping_type { [],$1 } | quantified_type { $1 } | LEFTPAR top_type RIGHTPAR { $2 } quantified_type: | PI LEFTSQ varlist RIGHTSQ COLON monotype { $3,$6 } monotype: | atomic_type { [],$1 } | LEFTPAR mapping_type RIGHTPAR { $2 } mapping_type: | unitary_type GT atomic_type { $1,$3 } unitary_type: | atomic_type { [$1] } | LEFTPAR xprod_type RIGHTPAR { $2 } xprod_type: | atomic_type STAR atomic_type { [$1;$3] } | xprod_type STAR atomic_type { $1 @ [$3] } (* atomic type *) atomic_type: | expr(atomic_type_) { $1 } atomic_type_: | DWORD { Edef ($1,[]) } | atomic_word paren_list(atomic_type) { Eapp ($1,$2) } | var_term { $1 } (* sequent *) sequent: | tuple LONGARROW tuple { Sequent ($1,$3) } | LEFTPAR sequent RIGHTPAR { $2 } tuple: | LEFTSQ fl = separated_list(COMMA,formula) RIGHTSQ { fl } (* misc *) quant: | BANG { Qforall } | QUES { Qexists } nassoc: | LARROW { BOpmi } | RARROW { BOimp } | LRARROW { BOequ } | NLRARROW { BOnequ } | NAMP { BOnand } | NBAR { BOnor } pos_number: | INTPOSNUM { Nint $1 } | RATPOSNUM { Nrat $1 } | REALPOSNUM { Nreal $1 } neg_number: | INTNEGNUM { Nint $1 } | RATNEGNUM { Nrat $1 } | REALNEGNUM { Nreal $1 } atomic_word: | LWORD { $1 } | SINGLE_QUOTED { $1 } | reserved_word { $1 } reserved_word: | ASSUMPTION { "assumption" } | AXIOM { "axiom" } | CNFK { "cnf" } | CONJECTURE { "conjecture" } | DEFINITION { "definition" } | FOFK { "fof" } | HYPOTHESIS { "hypothesis" } | INCLUDE { "include" } | LEMMA { "lemma" } | NEGATED_CONJECTURE { "negated_conjecture" } | TFFK { "tff" } | THEOREM { "theorem" } | TYPE { "type" } (* TODO: add support for annotations *) annotation: | (* epsilon *) { () } formula_selection: | (* epsilon *) { [] } | COMMA LEFTSQ comma_list(name) RIGHTSQ { $3 } name: | atomic_word { $1 } | INTPOSNUM { $1 } | INTNEGNUM { "-" ^ $1 } paren_list(X): | (* epsilon *) { [] } | LEFTPAR comma_list(X) RIGHTPAR { $2 } comma_list(X): | separated_nonempty_list(COMMA,X) { $1 } why3-0.87.3/plugins/tptp/tptp_typing.ml0000644000175000017500000006153313035416743020636 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) open Format open Tptp_ast open Why3 open Stdlib open Ident open Ty open Term open Decl open Theory let error = Loc.error let errorm = Loc.errorm exception DuplicateVar of string exception TypeExpected exception TermExpected exception FmlaExpected exception InvalidDummy exception MalformedLet exception DependentTy exception NonNumeric exception BadArity let () = Exn_printer.register (fun fmt e -> match e with | DuplicateVar s -> fprintf fmt "variable %s is used twice" s | TypeExpected -> fprintf fmt "type expression expected" | TermExpected -> fprintf fmt "term expression expected" | FmlaExpected -> fprintf fmt "formula expression expected" | InvalidDummy -> fprintf fmt "unexpected type placeholder" | MalformedLet -> fprintf fmt "malformed let-expression" | DependentTy -> fprintf fmt "dependent type" | NonNumeric -> fprintf fmt "non-numeric argument" | BadArity -> fprintf fmt "bad arity" | _ -> raise e) type symbol = | STSko of ty | STVar of tvsymbol | SVar of vsymbol | SType of tysymbol | SFunc of tvsymbol list * tvsymbol list * Stv.t * lsymbol | SPred of tvsymbol list * tvsymbol list * Stv.t * lsymbol | SletF of tvsymbol list * Stv.t * vsymbol list * term | SletP of tvsymbol list * Stv.t * vsymbol list * term | Sdobj of lsymbol | Suse of theory (* dead code type env = symbol Mstr.t type implicit = symbol Hstr.t *) (** Defined symbols : arithmetic etc... *) type denv = { de_env : Env.env; th_univ : theory; ts_univ : tysymbol; ty_univ : ty; th_ghost : theory; ts_ghost : tysymbol; fs_ghost : lsymbol; th_int : theory; th_real : theory; th_rat : theory; ts_rat : tysymbol; } let make_denv env = let get_theory s = Env.read_theory env ["tptp"] s in let th_univ = get_theory "Univ" in let th_ghost = get_theory "Ghost" in let th_rat = get_theory "Rat" in let ts_univ = ns_find_ts th_univ.th_export ["iType"] in { de_env = env; th_univ = th_univ; ts_univ = ts_univ; ty_univ = ty_app ts_univ []; th_ghost = th_ghost; ts_ghost = ns_find_ts th_ghost.th_export ["gh"]; fs_ghost = ns_find_ls th_ghost.th_export ["gh"]; th_int = get_theory "Int"; th_real = get_theory "Real"; th_rat = th_rat; ts_rat = ns_find_ts th_rat.th_export ["rat"]; } let add_theory env impl th = let s = "$th$" ^ th.th_name.id_string in if not (Mstr.mem s env) then Hstr.replace impl s (Suse th) let defined_ty ~loc denv env impl dw tyl = let ts = match dw with | DT DTuniv -> denv.ts_univ | DT DTint -> ts_int | DT DTreal -> ts_real | DT DTrat -> add_theory env impl denv.th_rat; denv.ts_rat | DT DTdummy -> error ~loc InvalidDummy | DT (DTtype|DTprop) | DF _ | DP _ -> error ~loc TypeExpected in Loc.try2 ~loc ty_app ts tyl let defined_arith ~loc denv env impl dw tl = let ts = match tl with | { t_ty = Some {ty_node = Tyapp (ts,[]) }}::_ -> ts | _::_ -> error ~loc NonNumeric | [] -> error ~loc BadArity in let get_theory s = Env.read_theory denv.de_env ["tptp"] s in let get_int_theory = function | DF DFquot -> errorm ~loc "$quotient/2 is not defined on $int" | DF (DFquot_e|DFrem_e) -> get_theory "IntDivE" | DF (DFquot_t|DFrem_t) -> get_theory "IntDivT" | DF (DFquot_f|DFrem_f) -> get_theory "IntDivF" | DF (DFfloor|DFceil|DFtrunc|DFround|DFtoint) | DP (DPisint|DPisrat) -> get_theory "IntTrunc" | DF DFtorat -> get_theory "IntToRat" | DF DFtoreal -> get_theory "IntToReal" | _ -> denv.th_int in let get_rat_theory = function | DF (DFquot_e|DFrem_e) -> get_theory "RatDivE" | DF (DFquot_t|DFrem_t) -> get_theory "RatDivT" | DF (DFquot_f|DFrem_f) -> get_theory "RatDivF" | DF (DFfloor|DFceil|DFtrunc|DFround|DFtoint) -> get_theory "RatTrunc" | DF DFtoreal -> get_theory "RatToReal" | _ -> denv.th_rat in let get_real_theory = function | DF (DFquot_e|DFrem_e) -> get_theory "RealDivE" | DF (DFquot_t|DFrem_t) -> get_theory "RealDivT" | DF (DFquot_f|DFrem_f) -> get_theory "RealDivF" | DF (DFfloor|DFceil|DFtrunc|DFround|DFtoint) | DP (DPisint|DPisrat) -> get_theory "RealTrunc" | DF DFtorat -> get_theory "RealToRat" | _ -> denv.th_real in let th = if ts_equal ts ts_int then get_int_theory dw else if ts_equal ts denv.ts_rat then get_rat_theory dw else if ts_equal ts ts_real then get_real_theory dw else error ~loc NonNumeric in add_theory env impl th; let ls = match dw with | DF DFumin -> ns_find_ls th.th_export ["prefix -"] | DF DFsum -> ns_find_ls th.th_export ["infix +"] | DF DFdiff -> ns_find_ls th.th_export ["infix -"] | DF DFprod -> ns_find_ls th.th_export ["infix *"] | DF DFquot -> ns_find_ls th.th_export ["infix /"] | DF DFquot_e -> ns_find_ls th.th_export ["div"] | DF DFquot_t -> ns_find_ls th.th_export ["div_t"] | DF DFquot_f -> ns_find_ls th.th_export ["div_f"] | DF DFrem_e -> ns_find_ls th.th_export ["mod"] | DF DFrem_t -> ns_find_ls th.th_export ["mod_t"] | DF DFrem_f -> ns_find_ls th.th_export ["mod_f"] | DF DFfloor -> ns_find_ls th.th_export ["floor"] | DF DFceil -> ns_find_ls th.th_export ["ceiling"] | DF DFtrunc -> ns_find_ls th.th_export ["truncate"] | DF DFround -> ns_find_ls th.th_export ["round"] | DF DFtoint -> ns_find_ls th.th_export ["to_int"] | DF DFtorat -> ns_find_ls th.th_export ["to_rat"] | DF DFtoreal -> ns_find_ls th.th_export ["to_real"] | DP DPless -> ns_find_ls th.th_export ["infix <"] | DP DPlesseq -> ns_find_ls th.th_export ["infix <="] | DP DPgreater -> ns_find_ls th.th_export ["infix >"] | DP DPgreatereq -> ns_find_ls th.th_export ["infix >="] | DP DPisint -> ns_find_ls th.th_export ["is_int"] | DP DPisrat -> ns_find_ls th.th_export ["is_rat"] | DP (DPtrue|DPfalse|DPdistinct) | DT _ -> assert false in Loc.try2 ~loc t_app_infer ls tl let defined_expr ~loc is_fmla denv env impl dw tl = match dw, tl with | (DT DTdummy), _ -> error ~loc InvalidDummy | (DF _|DT _), _ when is_fmla -> error ~loc FmlaExpected | (DP _|DT _), _ when not is_fmla -> error ~loc TermExpected | (DP DPtrue|DP DPfalse), _::_ -> error ~loc BadArity | DP DPtrue, [] -> t_true | DP DPfalse, [] -> t_false | DP DPdistinct, _ -> let rec dist acc = function | t::tl -> let add acc s = t_and_simp acc (t_neq t s) in dist (List.fold_left add acc tl) tl | _ -> acc in Loc.try2 ~loc dist t_true tl | _ -> defined_arith ~loc denv env impl dw tl (** TPTP environment *) let find_tv ~loc env impl s = let tv = try Mstr.find s env with Not_found -> try Hstr.find impl s with Not_found -> let tv = STVar (create_tvsymbol (id_user s loc)) in Hstr.add impl s tv; tv in match tv with | STVar tv -> ty_var tv | STSko ty -> ty | _ -> error ~loc TypeExpected let find_vs ~loc denv env impl s = let vs = try Mstr.find s env with Not_found -> try Hstr.find impl s with Not_found -> let vs = SVar (create_vsymbol (id_user s loc) denv.ty_univ) in Hstr.add impl s vs; vs in match vs with | SVar vs -> t_var vs | _ -> error ~loc TermExpected let find_ts ~loc env impl s args = let ts = try Mstr.find s env with Not_found -> try Hstr.find impl s with Not_found -> let args = List.map (fun _ -> create_tvsymbol (id_fresh "a")) args in let ss = if s = "int" || s = "real" then "_" ^ s else s in let ts = SType (create_tysymbol (id_user ss loc) args None) in Hstr.add impl s ts; ts in match ts with | SType ts -> ts | _ -> error ~loc TypeExpected let find_fs ~loc denv env impl s args = try Mstr.find s env with Not_found -> try Hstr.find impl s with Not_found -> let args = List.map (fun _ -> denv.ty_univ) args in let fs = create_fsymbol (id_user s loc) args denv.ty_univ in let fs = SFunc ([],[],Stv.empty,fs) in Hstr.add impl s fs; fs let find_ps ~loc denv env impl s args = try Mstr.find s env with Not_found -> try Hstr.find impl s with Not_found -> let args = List.map (fun _ -> denv.ty_univ) args in let ps = create_psymbol (id_user s loc) args in let ps = SPred ([],[],Stv.empty,ps) in Hstr.add impl s ps; ps let find_dobj ~loc denv env impl s = let ds = "$do$" ^ s in let fs = try Mstr.find ds env with Not_found -> try Hstr.find impl ds with Not_found -> let id = id_user ("do_" ^ s) loc in let fs = Sdobj (create_fsymbol id [] denv.ty_univ) in Hstr.add impl ds fs; fs in match fs with | Sdobj fs -> fs_app fs [] denv.ty_univ | _ -> assert false (* impossible *) let ty_check loc s ty1 t = Loc.try3 ~loc ty_match s ty1 (Opt.get t.t_ty) let rec ty denv env impl { e_loc = loc; e_node = n } = match n with | Eapp (aw,al) -> let ts = find_ts ~loc env impl aw al in let tyl = List.map (ty denv env impl) al in Loc.try2 ~loc ty_app ts tyl | Edef (dw,al) -> let tyl = List.map (ty denv env impl) al in defined_ty ~loc denv env impl dw tyl | Evar v -> find_tv ~loc env impl v | Elet _ | Eite _ | Eqnt _ | Ebin _ | Enot _ | Eequ _ | Edob _ | Enum _ -> error ~loc TypeExpected let t_int_const s = t_const (Number.ConstInt (Number.int_const_dec s)) (* unused let t_real_const r = t_const (Number.ConstReal r) *) let rec term denv env impl { e_loc = loc; e_node = n } = match n with | Eapp (aw,al) -> begin match find_fs ~loc denv env impl aw al with | SFunc (tvl,gl,mvs,fs) -> ls_args denv env impl loc fs tvl gl mvs al | SletF (tvl,mvs,vl,e) -> let_args denv env impl loc e tvl mvs vl al | SVar v -> t_var v | _ -> error ~loc TermExpected end | Edef (dw,al) -> let tl = List.map (term denv env impl) al in defined_expr ~loc false denv env impl dw tl | Evar v -> find_vs ~loc denv env impl v | Edob s -> find_dobj ~loc denv env impl s | Enum (Nint s) -> t_int_const s | Enum (Nreal (i,f,e)) -> t_const (Number.ConstReal (Number.real_const_dec i (Opt.get_def "0" f) e)) | Enum (Nrat (n,d)) -> let n = t_int_const n and d = t_int_const d in let frac = ns_find_ls denv.th_rat.th_export ["frac"] in add_theory env impl denv.th_rat; t_app_infer frac [n;d] | Elet (def,e) -> let env,s = let_defn denv env impl def in begin match Mstr.find s env with | SletF ([],_,[],t) -> let id = id_user s def.e_loc in let vs = create_vsymbol id (Opt.get t.t_ty) in let env = Mstr.add s (SVar vs) env in let t1 = term denv env impl e in t_let_close vs t t1 | _ -> term denv env impl e end | Eite (e1,e2,e3) -> (* we can't fix the polarity of the condition here, hence type quantifiers are forbidden in terms *) let cn,_ = fmla denv env impl None [] e1 in let th = term denv env impl e2 in let el = term denv env impl e3 in t_if cn th el | Eqnt _ | Ebin _ | Enot _ | Eequ _ -> error ~loc TermExpected and fmla denv env impl pol tvl { e_loc = loc; e_node = n } = match n with | Eapp (aw,al) -> begin match find_ps ~loc denv env impl aw al with | SPred (tvl,gl,mvs,ps) -> ls_args denv env impl loc ps tvl gl mvs al | SletP (tvl,mvs,vl,e) -> let_args denv env impl loc e tvl mvs vl al | _ -> error ~loc FmlaExpected end, false | Edef (dw,al) -> let tl = List.map (term denv env impl) al in defined_expr ~loc true denv env impl dw tl, false | Elet (def,e) -> let env,s = let_defn denv env impl def in begin match Mstr.find s env with | SletF ([],_,[],t) -> let id = id_user s def.e_loc in let vs = create_vsymbol id (Opt.get t.t_ty) in let env = Mstr.add s (SVar vs) env in let f,b = fmla denv env impl pol tvl e in t_let_close vs t f, b | _ -> fmla denv env impl pol tvl e end | Eqnt (quant,vl,e1) -> let vlist (env,pol,tvl,vl,b) (s,e) = let loc = e.e_loc in if e.e_node = Edef (DT DTtype, []) then match pol,quant with | None, _ -> errorm ~loc "Invalid type quantifier" | Some true, Qexists (* goals *) | Some false, Qforall (* premises *) -> let tv = create_tvsymbol (id_user s loc) in Mstr.add s (STVar tv) env, pol, tv::tvl, vl, true | Some true, Qforall (* goals *) | Some false, Qexists (* premises *) -> let _,ln,cn,_ = Loc.get loc in let sk = Format.sprintf "_%s_%d_%d" s ln cn in let ts = create_tysymbol (id_user sk loc) tvl None in let tv = ty_app ts (List.map ty_var tvl) in Hstr.add impl sk (SType ts); Mstr.add s (STSko tv) env, pol, tvl, vl, true else let ty = ty denv env impl e in let vs = create_vsymbol (id_user s loc) ty in Mstr.add s (SVar vs) env, None, [], vs::vl, b in let env,pol,tvl,vl,b = List.fold_left vlist (env,pol,tvl,[],false) vl in let f1,b1 = fmla denv env impl pol tvl e1 in let quant = match quant with | Qforall -> Tforall | Qexists -> Texists in t_quant_close quant (List.rev vl) [] f1, b || b1 | Eite (e1,e2,e3) -> (* here we can treat type quantifiers in 'if' conditions, since [if C then T else E == (C => T) /\ (C \/ E)], but as for now we won't do it to stay consistent with terms *) let cn,_ = fmla denv env impl None [] e1 in let th,b1 = fmla denv env impl pol tvl e2 in let el,b2 = fmla denv env impl pol tvl e3 in t_if cn th el, b1 || b2 | Ebin (BOequ,e1,e2) -> let f1,b1 = fmla denv env impl pol tvl e1 in let f2,b2 = fmla denv env impl pol tvl e2 in if b1 || b2 then let g1,_ = fmla denv env impl (Opt.map not pol) tvl e1 in let g2,_ = fmla denv env impl (Opt.map not pol) tvl e2 in t_and (t_implies g1 f2) (t_implies g2 f1), true else t_iff f1 f2, false | Ebin (BOnequ,e1,e2) -> let f1,b1 = fmla denv env impl pol tvl e1 in let f2,b2 = fmla denv env impl pol tvl e2 in if b1 || b2 then let g1,_ = fmla denv env impl (Opt.map not pol) tvl e1 in let g2,_ = fmla denv env impl (Opt.map not pol) tvl e2 in t_not (t_and (t_implies f1 g2) (t_implies f2 g1)), true else t_not (t_iff f1 f2), false | Ebin (BOimp,e1,e2) -> let f1,b1 = fmla denv env impl (Opt.map not pol) tvl e1 in let f2,b2 = fmla denv env impl pol tvl e2 in t_implies f1 f2, b1 || b2 | Ebin (BOpmi,e1,e2) -> let f1,b1 = fmla denv env impl pol tvl e1 in let f2,b2 = fmla denv env impl (Opt.map not pol) tvl e2 in t_implies f2 f1, b1 || b2 | Ebin (BOand,e1,e2) -> let f1,b1 = fmla denv env impl pol tvl e1 in let f2,b2 = fmla denv env impl pol tvl e2 in t_and f1 f2, b1 || b2 | Ebin (BOor,e1,e2) -> let f1,b1 = fmla denv env impl pol tvl e1 in let f2,b2 = fmla denv env impl pol tvl e2 in t_or f1 f2, b1 || b2 | Ebin (BOnand,e1,e2) -> let f1,b1 = fmla denv env impl (Opt.map not pol) tvl e1 in let f2,b2 = fmla denv env impl (Opt.map not pol) tvl e2 in t_not (t_and f1 f2), b1 || b2 | Ebin (BOnor,e1,e2) -> let f1,b1 = fmla denv env impl (Opt.map not pol) tvl e1 in let f2,b2 = fmla denv env impl (Opt.map not pol) tvl e2 in t_not (t_or f1 f2), b1 || b2 | Enot e1 -> let f1,b1 = fmla denv env impl (Opt.map not pol) tvl e1 in t_not f1, b1 | Eequ (e1,e2) -> let t1 = term denv env impl e1 in let t2 = term denv env impl e2 in t_equ t1 t2, false | Evar _ | Edob _ | Enum _ -> error ~loc FmlaExpected and let_defn denv env impl { e_node = n ; e_loc = loc } = let rec newenv env tvl vl = function | [] -> env, List.rev tvl, List.rev vl | (s,{ e_node = Edef (DT DTtype, []); e_loc = loc })::al -> if vl <> [] then errorm ~loc "Invalid type quantifier"; let tv = create_tvsymbol (id_user s loc) in let env = Mstr.add s (STVar tv) env in newenv env (tv::tvl) vl al | (s,e)::al -> let ty = ty denv env impl e in let vs = create_vsymbol (id_user s e.e_loc) ty in let env = Mstr.add s (SVar vs) env in newenv env tvl (vs::vl) al in let rec check ss vl al = match vl,al with | [],[] -> () | (v,_)::vl, { e_node = Evar u }::al when u = v -> let ss = Sstr.change (fun b -> not (b && error ~loc (DuplicateVar v))) v ss in check ss vl al | _,_ -> error ~loc MalformedLet in let dig vl d isf e = match d.e_node with | Eapp (s,al) -> check Sstr.empty vl al; let enw,tvl,vl = newenv env [] [] vl in let fvs s v = ty_freevars s v.vs_ty in let tvs = List.fold_left fvs Stv.empty vl in let add s v = if Stv.mem v tvs then s else Stv.add v s in let mvs = List.fold_left add Stv.empty tvl in if isf then let f,_ = fmla denv enw impl None [] e in Mstr.add s (SletP (tvl,mvs,vl,f)) env, s else let t = term denv enw impl e in Mstr.add s (SletF (tvl,mvs,vl,t)) env, s | _ -> assert false (* impossible *) in let rec down vl = function | Eqnt (Qforall,ul,d) -> down (vl @ ul) d.e_node | Ebin (BOequ,e1,e2) -> dig vl e1 true e2 | Eequ (e1,e2) -> dig vl e1 false e2 | _ -> assert false (* impossible *) in down [] n and ls_args denv env impl loc fs tvl gl mvs al = let rec args tvm tvl al = match tvl,al with | (tv::tvl),({e_node = Edef (DT DTdummy,[]); e_loc = loc}::al) -> if Stv.mem tv mvs then error ~loc InvalidDummy; args tvm tvl al | (tv::tvl),(a::al) -> let ty = ty denv env impl a in let tvm = Mtv.add tv ty tvm in args tvm tvl al | [],al -> let ghost v = fs_app denv.fs_ghost [] (ty_app denv.ts_ghost [Mtv.find v tvm]) in let tl = List.map ghost gl @ List.map (term denv env impl) al in let tvm = List.fold_left2 (ty_check loc) tvm fs.ls_args tl in let ty = Opt.map (ty_inst tvm) fs.ls_value in t_app fs tl ty | _ -> error ~loc BadArity in args Mtv.empty tvl al and let_args denv env impl loc e tvl mvs vl al = let rec args tvm vm tvl vl al = match tvl,vl,al with | (tv::tvl),_,({e_node = Edef (DT DTdummy,[]); e_loc = loc}::al) -> if Stv.mem tv mvs then error ~loc InvalidDummy; args tvm vm tvl vl al | (tv::tvl),_,(a::al) -> let ty = ty denv env impl a in let tvm = Mtv.add tv ty tvm in args tvm vm tvl vl al | _,(v::vl),(a::al) -> let t = term denv env impl a in let tvm = ty_check loc tvm v.vs_ty t in let vm = Mvs.add v t vm in args tvm vm tvl vl al | [],[],[] -> t_ty_subst tvm vm e | _ -> error ~loc BadArity in args Mtv.empty Mvs.empty tvl vl al let typedecl denv env impl loc s (tvl,(el,e)) = if e.e_node = Edef (DT DTtype, []) then (* type constructor *) if tvl <> [] then error ~loc DependentTy else let ntv { e_node = n ; e_loc = loc } = match n with | Edef (DT DTtype, []) -> create_tvsymbol (id_fresh "a") | _ -> error ~loc DependentTy in let ss = if s = "int" || s = "real" then "_" ^ s else s in let ts = create_tysymbol (id_user ss loc) (List.map ntv el) None in Hstr.add impl s (SType ts) else (* function/predicate symbol *) let ntv (s, { e_node = n ; e_loc = loc }) = match n with | Edef (DT DTtype, []) -> create_tvsymbol (id_fresh s) | _ -> error ~loc DependentTy in let tvl = List.map ntv tvl in let add e v = let s = v.tv_name.id_string in Mstr.add_new (DuplicateVar s) s (STVar v) e in let env = List.fold_left add env tvl in let tyl = List.map (ty denv env impl) el in let tvs = List.fold_left ty_freevars Stv.empty tyl in let add s v = if Stv.mem v tvs then s else Stv.add v s in let mvs = List.fold_left add Stv.empty tvl in let ghost v = ty_app denv.ts_ghost [ty_var v] in if e.e_node = Edef (DT DTprop, []) then let gvl = List.filter (fun v -> not (Stv.mem v tvs)) tvl in let tyl = List.map ghost gvl @ tyl in let ls = create_psymbol (id_user s loc) tyl in if gvl <> [] then add_theory env impl denv.th_ghost; Hstr.add impl s (SPred (tvl,gvl,mvs,ls)) else let tyv = ty denv env impl e in let tvs = ty_freevars tvs tyv in let gvl = List.filter (fun v -> not (Stv.mem v tvs)) tvl in let tyl = List.map ghost gvl @ tyl in let ls = create_fsymbol (id_user s loc) tyl tyv in if gvl <> [] then add_theory env impl denv.th_ghost; Hstr.add impl s (SFunc (tvl,gvl,mvs,ls)) let flush_impl ~strict env uc impl = let update_th _ e uc = match e with | Suse th -> let uc = open_namespace uc th.th_name.id_string in let uc = use_export uc th in close_namespace uc false | _ -> uc in let update s e (env,uc) = match e with | SType ts -> Mstr.add s e env, add_ty_decl uc ts | SFunc (_,_,_,ls) | SPred (_,_,_,ls) -> Mstr.add s e env, add_param_decl uc ls | STVar tv when strict -> errorm ?loc:tv.tv_name.id_loc "Unbound type variable %s" s | SVar vs when strict -> errorm ?loc:vs.vs_name.id_loc "Unbound variable %s" s | STVar _ | SVar _ -> env,uc | Sdobj ls -> let uc = add_param_decl uc ls in let t = t_app ls [] ls.ls_value in let add _ s f = match s with | Sdobj fs -> t_and_simp f (t_neq (t_app fs [] fs.ls_value) t) | _ -> f in let f = Mstr.fold add env t_true in let uc = if t_equal f t_true then uc else let id = ls.ls_name.id_string ^ "_def" in let pr = create_prsymbol (id_fresh id) in add_prop_decl uc Paxiom pr f in Mstr.add s e env, uc | Suse _ -> Mstr.add s e env, uc (* none of these is possible in implicit *) | SletF _ | SletP _ | STSko _ -> assert false in let uc = Hstr.fold update_th impl uc in let res = Hstr.fold update impl (env,uc) in Hstr.clear impl; res let typecheck lib path ast = (* initial environment *) let env = Mstr.empty in let denv = make_denv lib in let impl = Hstr.create 17 in add_theory env impl denv.th_univ; (* parsing function *) let conj = ref [] in let input (env,uc) = function (* type declarations *) | Formula (_,_,Type,TypedAtom (s,e),loc) -> typedecl denv env impl loc s e; flush_impl ~strict:true env uc impl | Formula (_,_,Type,_,loc) | Formula (_,_,_,TypedAtom _,loc) -> errorm ~loc "Invalid type declaration" (* logical formulas *) | Formula (_,_,_,Sequent _,loc) -> (* TODO *) errorm ~loc "Sequents are not supported" | Formula (k,s,r,LogicFormula e,loc) -> let strict = k <> CNF in let goal = r = Conjecture in let f,_ = fmla denv env impl (Some goal) [] e in let f = if strict then f else let q = if goal then Texists else Tforall in let vl = Mvs.keys (t_vars f) in t_quant_close q vl [] f in let env,uc = flush_impl ~strict env uc impl in let pr = create_prsymbol (id_user s loc) in if goal then conj := (pr, f) :: !conj; env, if goal then uc else add_prop_decl uc Paxiom pr f (* includes *) | Include (_,_,loc) -> errorm ~loc "Inclusion is not supported" in (* FIXME: localize the identifier *) let uc = create_theory ~path (id_fresh "T") in let _,uc = List.fold_left input (env,uc) ast in (* In presence of conjectures, TPTP requires us to prove their conjunction, but no conjectures means |- false. This is awkward, and most provers treat conjectures disjunctively, as in a sequent. We follow TPTP here. *) let pr_false = create_prsymbol (id_fresh "contradiction") in let uc = match !conj with | g :: gl -> let combine (_, f) (pr, g) = pr, t_and g f in let pr, goal = List.fold_left combine g gl in if Stv.is_empty (t_ty_freevars Stv.empty goal) then add_prop_decl uc Pgoal pr goal else (* Why3 does not support polymorphic goals *) let uc = add_prop_decl uc Paxiom pr (t_not goal) in add_prop_decl uc Pgoal pr_false t_false | [] -> add_prop_decl uc Pgoal pr_false t_false in Mstr.singleton "T" (close_theory uc) why3-0.87.3/plugins/tptp/tptp_ast.ml0000644000175000017500000000512413035416743020105 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) type loc = Why3.Loc.position type atomic_word = string type variable = string type distinct = string type defined_type = | DTtype | DTprop | DTuniv | DTint | DTrat | DTreal | DTdummy (* placeholder *) type defined_func = | DFumin | DFsum | DFdiff | DFprod | DFquot | DFquot_e | DFquot_t | DFquot_f | DFrem_e | DFrem_t | DFrem_f | DFfloor | DFceil | DFtrunc | DFround | DFtoint | DFtorat | DFtoreal type defined_pred = | DPtrue | DPfalse | DPdistinct | DPless | DPlesseq | DPgreater | DPgreatereq | DPisint | DPisrat type defined_word = | DT of defined_type | DF of defined_func | DP of defined_pred (** Formula *) type binop = | BOequ | BOnequ | BOimp | BOpmi | BOand | BOor | BOnand | BOnor type quant = Qforall | Qexists type num_integer = string type num_rational = string * string type num_real = string * string option * string option type number = | Nint of num_integer | Nrat of num_rational | Nreal of num_real type expr = { e_node : expr_node ; e_loc : loc } and expr_node = | Elet of expr * expr | Eite of expr * expr * expr | Eqnt of quant * tyvar list * expr | Ebin of binop * expr * expr | Enot of expr | Eequ of expr * expr | Eapp of atomic_word * expr list | Edef of defined_word * expr list | Evar of variable | Edob of distinct | Enum of number and tyvar = variable * expr type top_type = tyvar list * (expr list * expr) type top_formula = | LogicFormula of expr | TypedAtom of atomic_word * top_type | Sequent of expr list * expr list (** Top level *) type kind = TFF | FOF | CNF type name = string type file = string type role = | Axiom | Hypothesis | Definition | Assumption | Corollary | Lemma | Theorem | Conjecture | Negated_conjecture | Type type input = | Formula of kind * name * role * top_formula * loc | Include of file * name list * loc type tptp_file = input list why3-0.87.3/plugins/tptp/tptp_lexer.mli0000644000175000017500000000255613035416743020614 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) exception FileNotFound of string val load: string -> Tptp_ast.tptp_file (** [load filename] loads and parses the file named [filename]. It also expands other included files in that file. As specified by the TPTP standard (http://www.cs.miami.edu/~tptp/TPTP/TR/TPTPTR.shtml), files included with relative path names are searched first under the directory of the main file, and if not found there then searched under the directory specified in the $TPTP environment variable. If the file, or one of its included file, is not found in the file system, then exception [FileNotFound s] is raised, where [s] is the name of the file not found. *) why3-0.87.3/plugins/tptp/tptp_typing.mli0000644000175000017500000000147313035416743021004 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) val typecheck : Why3.Env.env -> Why3.Env.pathname -> Tptp_ast.tptp_file -> Why3.Theory.theory Why3.Stdlib.Mstr.t why3-0.87.3/plugins/tptp/tptp_printer.ml0000644000175000017500000004332213035416743021003 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) open Format open Why3 open Pp open Ident open Ty open Term open Decl open Printer let bls = ["true";"false"] let ident_printer = let san = sanitizer char_to_alpha char_to_alnumus in create_ident_printer bls ~sanitizer:san let pr_printer = let san = sanitizer char_to_lalpha char_to_alnumus in create_ident_printer bls ~sanitizer:san let print_symbol fmt id = let san = Strings.uncapitalize in fprintf fmt "%s" (id_unique ~sanitizer:san ident_printer id) let print_tvar fmt {tv_name = id} = let san = Strings.capitalize in fprintf fmt "%s" (id_unique ~sanitizer:san ident_printer id) let print_var fmt {vs_name = id} = let san = Strings.capitalize in fprintf fmt "%s" (id_unique ~sanitizer:san ident_printer id) let print_pr fmt pr = fprintf fmt "%s" (id_unique pr_printer pr.pr_name) let forget_var v = forget_id ident_printer v.vs_name let forget_tvar v = forget_id ident_printer v.tv_name type tptp_format = FOF | TFF0 | TFF1 type tptp_number = TPTP | MetiTarski type info = { info_syn : syntax_map; info_fmt : tptp_format; info_num : tptp_number; info_srt : ty Mty.t ref; info_urg : string list ref; info_rules : Decl.Spr.t; } let complex_type = Wty.memoize 3 (fun ty -> let s = Pp.string_of_wnl Pretty.print_ty ty in create_tysymbol (id_fresh s) [] None) let rec print_type info fmt ty = match ty.ty_node with | Tyvar _ when info.info_fmt = TFF0 -> unsupported "TFF0 does not support polymorphic types" | Tyvar tv -> print_tvar fmt tv | Tyapp (ts, tl) -> begin match query_syntax info.info_syn ts.ts_name, tl with | Some s, _ -> syntax_arguments s (print_type info) fmt tl | None, [] -> print_symbol fmt ts.ts_name | None, _ when info.info_fmt = TFF0 -> begin match Mty.find_opt ty !(info.info_srt) with | Some ty -> print_type info fmt ty | None -> let ts = complex_type ty in let cty = ty_app ts [] in let us = Pp.sprintf "@[tff(%s, type,@ %a:@ $tType).@]@\n@\n" (id_unique pr_printer ts.ts_name) print_symbol ts.ts_name in info.info_srt := Mty.add ty cty !(info.info_srt); info.info_urg := us :: !(info.info_urg); print_type info fmt cty end | None, tl -> fprintf fmt "@[%a(%a)@]" print_symbol ts.ts_name (print_list comma (print_type info)) tl end let print_type info fmt ty = try print_type info fmt ty with Unsupported s -> raise (UnsupportedType (ty,s)) let number_format = { Number.long_int_support = true; Number.extra_leading_zeros_support = false; Number.dec_int_support = Number.Number_default; Number.hex_int_support = Number.Number_unsupported; Number.oct_int_support = Number.Number_unsupported; Number.bin_int_support = Number.Number_unsupported; Number.def_int_support = Number.Number_unsupported; Number.dec_real_support = Number.Number_default; Number.hex_real_support = Number.Number_unsupported; Number.frac_real_support = Number.Number_custom (Number.PrintFracReal ("$to_real(%s)", "$product($to_real(%s),$to_real(%s))", "$quotient($to_real(%s),$to_real(%s))")); Number.def_real_support = Number.Number_unsupported; } let number_format_metitarski = { number_format with Number.frac_real_support = Number.Number_custom (Number.PrintFracReal ("%s", "(%s * %s)", "(%s / %s)")); } let print_number info fmt c = Number.print (match info.info_num with | TPTP -> number_format | MetiTarski -> number_format_metitarski) fmt c let rec print_app info fmt ls tl oty = match query_syntax info.info_syn ls.ls_name with | Some s -> syntax_arguments s (print_term info) fmt tl | None -> let sbs = ls_app_inst ls tl oty in if Mtv.is_empty sbs && tl = [] then print_symbol fmt ls.ls_name else begin let cm = if Mtv.is_empty sbs || tl = [] then "" else ", " in fprintf fmt "%a(%a%s%a)" print_symbol ls.ls_name (print_iter2 Mtv.iter comma nothing nothing (print_type info)) sbs cm (print_list comma (print_term info)) tl end and print_term info fmt t = match t.t_node with | Tvar v -> print_var fmt v | Tapp (ls, tl) -> print_app info fmt ls tl t.t_ty | Tconst c -> print_number info fmt c | Tlet (t1,tb) -> let v,t2 = t_open_bound tb in fprintf fmt "$let_tt(%a@ =@ %a,@ %a)" print_symbol v.vs_name (print_term info) t1 (print_term info) t2; forget_var v | Tif (f1,t1,t2) -> fprintf fmt "$ite_t(%a,@ %a,@ %a)" (print_fmla info) f1 (print_term info) t1 (print_term info) t2 | Tcase _ -> unsupportedTerm t "TPTP does not support pattern matching, use eliminate_algebraic" | Teps _ -> unsupportedTerm t "TPTP does not support epsilon-terms" | Tquant _ | Tbinop _ | Tnot _ | Ttrue | Tfalse -> raise (TermExpected t) and print_fmla info fmt f = match f.t_node with | Tapp (ls, tl) -> print_app info fmt ls tl f.t_ty | Tbinop (op, f1, f2) -> let s = match op with | Tand -> "&" | Tor -> "|" | Timplies -> "=>" | Tiff -> "<=>" in fprintf fmt "(%a@ %s %a)" (print_fmla info) f1 s (print_fmla info) f2 | Tnot f -> fprintf fmt "~@ %a" (print_fmla info) f | Ttrue -> fprintf fmt "$true" | Tfalse -> fprintf fmt "$false" | Tquant (q, fq) -> let q = match q with Tforall -> "!" | Texists -> "?" in let vl, _tl, f = t_open_quant fq in let print_vsty fmt vs = if info.info_fmt = FOF then fprintf fmt "%a" print_var vs else fprintf fmt "%a:@,%a" print_var vs (print_type info) vs.vs_ty in fprintf fmt "%s[%a]:@ %a" q (print_list comma print_vsty) vl (print_fmla info) f; List.iter forget_var vl | Tlet (t1,tb) -> let v,t2 = t_open_bound tb in fprintf fmt "$let_tf(%a@ =@ %a,@ %a)" print_symbol v.vs_name (print_term info) t1 (print_fmla info) t2; forget_var v | Tif (f1,t1,t2) -> fprintf fmt "$ite_f(%a,@ %a,@ %a)" (print_fmla info) f1 (print_fmla info) t1 (print_fmla info) t2 | Tcase _ -> unsupportedTerm f "TPTP does not support pattern matching, use eliminate_algebraic" | Tvar _ | Tconst _ | Teps _ -> raise (FmlaExpected f) let print_tvarg fmt tv = fprintf fmt "%a : $tType" print_tvar tv let print_tvargs fmt tvs = print_iter1 Stv.iter comma print_tvarg fmt tvs let star fmt _ = fprintf fmt " *@ " let print_fmla info fmt f = let tvs = t_ty_freevars Stv.empty f in if Stv.is_empty tvs then print_fmla info fmt f else fprintf fmt "![%a]:@ %a" print_tvargs tvs (print_fmla info) f; Stv.iter forget_tvar tvs let print_decl info fmt d = match d.d_node with | Dtype _ when info.info_fmt = FOF -> () | Dtype { ts_def = Some _ } -> () | Dtype { ts_args = _::_ } when info.info_fmt = TFF0 -> () | Dtype ts when query_syntax info.info_syn ts.ts_name <> None -> () | Dtype ts -> let print_arg fmt _ = fprintf fmt "$tType" in let print_sig fmt ts = match ts.ts_args with | [] -> fprintf fmt "$tType" | [_] -> fprintf fmt "$tType >@ $tType" | tl -> fprintf fmt "(%a) >@ $tType" (print_list star print_arg) tl in fprintf fmt "@[tff(%s, type,@ %a:@ %a).@]@\n@\n" (id_unique pr_printer ts.ts_name) print_symbol ts.ts_name print_sig ts | Dparam _ when info.info_fmt = FOF -> () | Dparam ls when query_syntax info.info_syn ls.ls_name <> None -> () | Dparam ls -> let print_type = print_type info in let print_val fmt = function | Some ty -> print_type fmt ty | None -> fprintf fmt "$o" in let print_sig fmt ls = match ls.ls_args with | [] -> print_val fmt ls.ls_value | [ty] -> fprintf fmt "%a >@ %a" print_type ty print_val ls.ls_value | tl -> fprintf fmt "(%a) >@ %a" (print_list star print_type) tl print_val ls.ls_value in let print_sig fmt ls = let tvs = List.fold_left ty_freevars Stv.empty ls.ls_args in let tvs = oty_freevars tvs ls.ls_value in if Stv.is_empty tvs then print_sig fmt ls else if ls.ls_args = [] then fprintf fmt "!>[%a]:@ %a" print_tvargs tvs print_sig ls else fprintf fmt "!>[%a]:@ (%a)" print_tvargs tvs print_sig ls; Stv.iter forget_tvar tvs in fprintf fmt "@[tff(%s, type,@ %a:@ %a).@]@\n@\n" (id_unique pr_printer ls.ls_name) print_symbol ls.ls_name print_sig ls | Ddata _ -> unsupportedDecl d "TPTP does not support algebraic datatypes, use eliminate_algebraic" | Dlogic _ -> unsupportedDecl d "Definitions are not supported, use eliminate_definition" | Dind _ -> unsupportedDecl d "TPTP does not support inductive predicates, use eliminate_inductive" | Dprop (Paxiom, pr, _) when Mid.mem pr.pr_name info.info_syn -> () | Dprop (Paxiom, pr, f) -> (* Format.eprintf "Dprop for %s: rewrite rules:" pr.pr_name.id_string; Spr.iter (fun pr -> Format.eprintf " %s" pr.pr_name.id_string) info.info_rules; Format.eprintf "@."; *) let annotation = if Spr.mem pr info.info_rules then ",rewrite" else "" in let head = if info.info_fmt = FOF then "fof" else "tff" in fprintf fmt "@[%s(%a, axiom,@ %a%s).@]@\n@\n" head print_pr pr (print_fmla info) f annotation | Dprop (Pgoal, pr, f) -> let head = if info.info_fmt = FOF then "fof" else "tff" in fprintf fmt "@[%s(%a, conjecture,@ %a).@]@\n" head print_pr pr (print_fmla info) f | Dprop ((Plemma|Pskip), _, _) -> assert false let print_decls fm nm rew_rules = (* Format.eprintf "rewrite rules:"; Spr.iter (fun pr -> Format.eprintf " %s" pr.pr_name.id_string) rew_rules; Format.eprintf "@."; *) let print_decl (sm,fm,ct) fmt d = let info = { info_syn = sm; info_fmt = fm; info_num = nm; info_srt = ref ct; info_urg = ref []; info_rules = rew_rules } in try print_decl info fmt d; (sm,fm,!(info.info_srt)), !(info.info_urg) with Unsupported s -> raise (UnsupportedDecl (d,s)) in let print_decl = Printer.sprint_decl print_decl in let print_decl task acc = print_decl task.Task.task_decl acc in Discriminate.on_syntax_map (fun sm -> Trans.fold print_decl ((sm,fm,Mty.empty),[])) let print_task fm nm = fun args ?old:_ fmt task -> (* In trans-based p-printing [forget_all] is a no-no *) (* forget_all ident_printer; *) print_prelude fmt args.prelude; print_th_prelude task fmt args.th_prelude; let rec print = function | x :: r -> print r; Pp.string fmt x | [] -> () in let print_decls_with_meta = Trans.on_tagged_pr Compute.meta_rewrite (print_decls fm nm) in print (snd (Trans.apply print_decls_with_meta task)); pp_print_flush fmt () let () = register_printer "tptp-tff0" (print_task TFF0 TPTP) ~desc:"TPTP TFF0 format"; register_printer "tptp-tff1" (print_task TFF1 TPTP) ~desc:"TPTP TFF1 format"; register_printer "tptp-fof" (print_task FOF TPTP) ~desc:"TPTP FOF format" let () = register_printer "metitarski" (print_task FOF MetiTarski) ~desc:"MetiTarski TPTP format" (** DFG input format for SPASS >= 3.8 (with the help of Daniel Wand) TODO: - type arguments for polymorphic functions and predicates - data types *) let is_type info d = match d.d_node with | Dtype ts -> query_syntax info.info_syn ts.ts_name = None | Ddata _ -> unsupportedDecl d "no data types" | _ -> false let is_function info d = match d.d_node with | Dparam ls -> ls.ls_value <> None && query_syntax info.info_syn ls.ls_name = None | _ -> false let is_predicate info d = match d.d_node with | Dparam ls -> ls.ls_value = None && query_syntax info.info_syn ls.ls_name = None | _ -> false let ls_arity fmt d = match d.d_node with | Dparam ls -> let ntv = Stv.cardinal (ls_ty_freevars ls) in let na = List.length ls.ls_args in if ntv = 0 then fprintf fmt "(%a, %d)" print_symbol ls.ls_name na else fprintf fmt "(%a, %d+%d)" print_symbol ls.ls_name ntv na | _ -> assert false let type_arity fmt d = match d.d_node with | Dtype ts -> let ntv = List.length ts.ts_args in if ntv = 0 then print_symbol fmt ts.ts_name else fprintf fmt "(%a, %d)" print_symbol ts.ts_name ntv | _ -> assert false let ls_type kind info fmt d = match d.d_node with | Dparam ls -> fprintf fmt "%s(@[%a" kind print_symbol ls.ls_name; let tvs = ls_ty_freevars ls in if not (Stv.is_empty tvs) then fprintf fmt ", [%a]" (print_list comma print_tvar) (Stv.elements tvs); begin match ls.ls_value, ls.ls_args with | None, [] -> () | None, _ -> fprintf fmt ", %a" (print_list comma (print_type info)) ls.ls_args | Some ty, [] -> fprintf fmt ", %a" (print_type info) ty | Some ty, _ -> fprintf fmt ", (%a) %a" (print_list comma (print_type info)) ls.ls_args (print_type info) ty end; fprintf fmt "@]).@\n"; Stv.iter forget_tvar tvs | _ -> assert false let rec print_app info fmt ls tl oty = match query_syntax info.info_syn ls.ls_name with | Some s -> syntax_arguments s (print_term info) fmt tl | None -> print_symbol fmt ls.ls_name; let sbs = ls_app_inst ls tl oty in if not (Mtv.is_empty sbs) then fprintf fmt "<%a>" (print_iter2 Mtv.iter comma nothing nothing (print_type info)) sbs; if tl <> [] then fprintf fmt "(%a)" (print_list comma (print_term info)) tl and print_term info fmt t = match t.t_node with | Tvar v -> print_var fmt v | Tapp (ls, tl) -> print_app info fmt ls tl t.t_ty | Tconst c -> Number.print number_format fmt c | Tlet _ -> unsupportedTerm t "DFG does not support let, use eliminate_let" | Tif _ -> unsupportedTerm t "DFG does not support if, use eliminate_if" | Tcase _ -> unsupportedTerm t "TPTP does not support pattern matching, use eliminate_algebraic" | Teps _ -> unsupportedTerm t "TPTP does not support epsilon-terms" | Tquant _ | Tbinop _ | Tnot _ | Ttrue | Tfalse -> raise (TermExpected t) let rec print_fmla info fmt f = match f.t_node with | Tapp (ls, tl) -> print_app info fmt ls tl f.t_ty | Tbinop (op, f1, f2) -> let s = match op with | Tand -> "and" | Tor -> "or" | Timplies -> "implies" | Tiff -> "equiv" in fprintf fmt "%s(%a,@ %a)" s (print_fmla info) f1 (print_fmla info) f2 | Tnot f -> fprintf fmt "not(%a)" (print_fmla info) f | Ttrue -> fprintf fmt "true" | Tfalse -> fprintf fmt "false" | Tquant (q, fq) -> let q = match q with Tforall -> "forall" | Texists -> "exists" in let vl, _tl, f = t_open_quant fq in let print_vsty fmt vs = fprintf fmt "%a:@,%a" print_var vs (print_type info) vs.vs_ty in fprintf fmt "%s([%a],@ %a)" q (print_list comma print_vsty) vl (print_fmla info) f; List.iter forget_var vl | Tlet _ -> unsupportedTerm f "DFG does not support let, use eliminate_let" | Tif _ -> unsupportedTerm f "DFG does not support if, use eliminate_if" | Tcase _ -> unsupportedTerm f "DFG does not support pattern matching, use eliminate_algebraic" | Tvar _ | Tconst _ | Teps _ -> raise (FmlaExpected f) let print_axiom info fmt d = match d.d_node with | Dprop (Paxiom, pr, _) when Mid.mem pr.pr_name info.info_syn -> () | Dprop (Paxiom, pr, f) -> fprintf fmt "@[formula(%a, %a).@]@\n" (print_fmla info) f print_pr pr | _ -> () let print_dfg args ?old:_ fmt task = forget_all ident_printer; forget_all pr_printer; fprintf fmt "@[begin_problem(why3).@\n@\n"; print_prelude fmt args.prelude; print_th_prelude task fmt args.th_prelude; fprintf fmt "list_of_descriptions.@\n"; fprintf fmt "name({**}). author({**}). status(unknown). description({**}).@\n"; fprintf fmt "end_of_list.@\n@\n"; let info = { info_syn = get_syntax_map task; info_fmt = FOF; info_num = TPTP; info_urg = ref []; info_srt = ref Mty.empty ; info_rules = Spr.empty; } in let dl = Task.task_decls task in let tl = List.filter (is_type info) dl in let fl = List.filter (is_function info) dl in let pl = List.filter (is_predicate info) dl in (* arities *) fprintf fmt "list_of_symbols.@\n"; fprintf fmt "functions [@[%a@]].@\n" (print_list comma ls_arity) fl; fprintf fmt "predicates [@[%a@]].@\n" (print_list comma ls_arity) pl; fprintf fmt "sorts [@[%a@]].@\n" (print_list comma type_arity) tl; fprintf fmt "end_of_list.@\n@\n"; (* types *) fprintf fmt "list_of_declarations.@\n"; List.iter (ls_type "function" info fmt) fl; List.iter (ls_type "predicate" info fmt) pl; fprintf fmt "end_of_list.@\n@\n"; fprintf fmt "list_of_formulae(axioms).@\n"; List.iter (print_axiom info fmt) dl; fprintf fmt "end_of_list.@\n@\n"; fprintf fmt "list_of_formulae(conjectures).@\n"; let f = Task.task_goal_fmla task in fprintf fmt "@[formula(%a, %a)@].@\n" (print_fmla info) f print_pr (Task.task_goal task); fprintf fmt "end_of_list.@\n@\n"; fprintf fmt "end_problem.@\n" let () = register_printer "dfg" print_dfg ~desc:"First-order monomorphic DFG format" why3-0.87.3/plugins/tptp/tptp_lexer.mll0000644000175000017500000001721113035416743020611 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) { open Format open Lexing open Tptp_ast open Tptp_parser open Why3 (* lexical errors *) exception IllegalCharacter of char exception IllegalLexeme of string exception UnterminatedComment exception UnknownDDW of string exception UnknownDW of string let () = Exn_printer.register (fun fmt e -> match e with | IllegalCharacter c -> fprintf fmt "illegal character %c" c | IllegalLexeme s -> fprintf fmt "illegal lexeme %s" s | UnterminatedComment -> fprintf fmt "unterminated comment" | UnknownDDW s -> fprintf fmt "unknown system_word %s" s | UnknownDW s -> fprintf fmt "unknown defined_word %s" s | _ -> raise e) let defwords = Hashtbl.create 97 let () = List.iter (fun (x,y) -> Hashtbl.add defwords x y) [ "ceiling", DWORD (DF DFceil); "difference", DWORD (DF DFdiff); "distinct", DWORD (DP DPdistinct); "false", DWORD (DP DPfalse); "floor", DWORD (DF DFfloor); "greater", DWORD (DP DPgreater); "greatereq", DWORD (DP DPgreatereq); "i", DWORD (DT DTuniv); "int", DWORD (DT DTint); "is_int", DWORD (DP DPisint); "is_rat", DWORD (DP DPisrat); "ite_f", ITE_F; "ite_t", ITE_T; "iType", DWORD (DT DTuniv); "let_tt", LET_TT; "let_ft", LET_FT; "let_tf", LET_TF; "let_ff", LET_FF; "less", DWORD (DP DPless); "lesseq", DWORD (DP DPlesseq); "o", DWORD (DT DTprop); "oType", DWORD (DT DTprop); "product", DWORD (DF DFprod); "quotient", DWORD (DF DFquot); "quotient_e", DWORD (DF DFquot_e); "quotient_t", DWORD (DF DFquot_t); "quotient_f", DWORD (DF DFquot_f); "rat", DWORD (DT DTrat); "real", DWORD (DT DTreal); "remainder_e", DWORD (DF DFrem_e); "remainder_t", DWORD (DF DFrem_t); "remainder_f", DWORD (DF DFrem_f); "round", DWORD (DF DFround); "sum", DWORD (DF DFsum); "to_int", DWORD (DF DFtoint); "to_rat", DWORD (DF DFtorat); "to_real", DWORD (DF DFtoreal); "true", DWORD (DP DPtrue); "truncate", DWORD (DF DFtrunc); "tType", DWORD (DT DTtype); "uminus", DWORD (DF DFumin); ] let keywords = Hashtbl.create 97 let () = List.iter (fun (x,y) -> Hashtbl.add keywords x y) [ "assumption", ASSUMPTION; "axiom", AXIOM; "cnf", CNFK; "conjecture", CONJECTURE; "corollary", COROLLARY; "definition", DEFINITION; "fof", FOFK; "hypothesis", HYPOTHESIS; "include", INCLUDE; "lemma", LEMMA; "negated_conjecture", NEGATED_CONJECTURE; "tff", TFFK; "theorem", THEOREM; "type", TYPE; ] let newline lexbuf = let pos = lexbuf.lex_curr_p in lexbuf.lex_curr_p <- { pos with pos_lnum = pos.pos_lnum + 1; pos_bol = pos.pos_cnum } let comment_start_loc = ref Loc.dummy_position let loc lb = Loc.extract (lexeme_start_p lb, lexeme_end_p lb) } let newline = '\n' let space = [' ' '\t' '\r'] let lalpha = ['a'-'z'] let ualpha = ['A'-'Z'] let digit = ['0'-'9'] let nzero = ['1'-'9'] let alnum = lalpha | ualpha | digit | '_' let lword = lalpha alnum* let uword = ualpha alnum* let positive = nzero digit* let natural = '0' | positive let sq_char = [' '-'&' '('-'[' ']'-'~'] | '\\' ['\\' '\''] let do_char = [' '-'!' '#'-'[' ']'-'~'] | '\\' ['\\' '"'] rule token = parse | newline { newline lexbuf; token lexbuf } | space+ { token lexbuf } | lword as id { try Hashtbl.find keywords id with Not_found -> LWORD id } | uword as id { UWORD id } | '\'' (lword as id) '\'' { LWORD id } | '\'' sq_char+ '\'' as sq { SINGLE_QUOTED sq } | '"' (do_char* as dob) '"' { DISTINCT_OBJECT dob } | "$_" { DWORD (DT DTdummy) } | '$' (lword as id) { try Hashtbl.find defwords id with Not_found -> raise (UnknownDW id) } | "$$" (lword as id) { raise (UnknownDDW id) } | '+'? (natural as s) { INTPOSNUM s } | '-' (natural as s) { INTNEGNUM s } | '+'? (natural as n) '/' (positive as d) { RATPOSNUM (n,d) } | '-' (natural as n) '/' (positive as d) { RATNEGNUM (n,d) } | '+'? (natural as i) ('.' (digit+ as f))? (['e' 'E'] ('+'? (natural as e)))? | '+'? (natural as i) ('.' (digit+ as f))? (['e' 'E'] ('-' natural as e))? { REALPOSNUM (i,f,e) } | '-' (natural as i) ('.' (digit+ as f))? (['e' 'E'] ('+'? (natural as e)))? | '-' (natural as i) ('.' (digit+ as f))? (['e' 'E'] ('-' natural as e))? { REALNEGNUM (i,f,e) } | "/*/" { raise (IllegalLexeme "/*/") } | "/*" { comment_start_loc := loc lexbuf; comment_block lexbuf; token lexbuf } | "%" { comment_start_loc := loc lexbuf; comment_line lexbuf; token lexbuf } | "." { DOT } | "," { COMMA } | ":" { COLON } | "(" { LEFTPAR } | ")" { RIGHTPAR } | "[" { LEFTSQ } | "]" { RIGHTSQ } | "-->" { LONGARROW } | "<=" { LARROW } | "=>" { RARROW } | "<=>" { LRARROW } | "<~>" { NLRARROW } | "~&" { NAMP } | "~|" { NBAR } | "~" { TILDE } | "&" { AMP } | "|" { BAR } | "=" { EQUAL } | "!=" { NEQUAL } | "*" { STAR } | ">" { GT } | "!>" { PI } | "!" { BANG } | "?" { QUES } | eof { EOF } | _ as c { raise (IllegalCharacter c) } and comment_block = parse | "*/" { () } | newline { newline lexbuf; comment_block lexbuf } | eof { raise (Loc.Located (!comment_start_loc, UnterminatedComment)) } | _ { comment_block lexbuf } and comment_line = parse | newline { newline lexbuf; () } | eof { () } | _ { comment_line lexbuf } { let parse file c = let lb = Lexing.from_channel c in Loc.set_file file lb; Loc.with_location (tptp_file token) lb exception FileNotFound of string let load file = let dir = Filename.dirname file in let tptplib = try Some (Sys.getenv "TPTP") with Not_found -> None in let rec aux file = let ch,file = try (open_in file, file) with Sys_error _ -> if not (Filename.is_relative file) then raise (FileNotFound file) else try let f = Filename.concat dir file in (open_in f,f) with Sys_error _ -> match tptplib with | None -> raise (FileNotFound (file ^ " (warning: $TPTP was not set)")) | Some d -> try let f = Filename.concat d file in (open_in f,f) with Sys_error _ -> raise (FileNotFound file) in let ast = parse file ch in close_in ch; let ast = List.fold_left (fun acc d -> match d with | Formula _ -> d::acc | Include(file,_,_) -> let ast = aux file in List.rev_append ast acc) [] ast in List.rev ast in aux file let read_channel env path file c = let ast = parse file c in Tptp_typing.typecheck env path ast let () = Env.register_format Env.base_language "tptp" ["p";"ax"] read_channel ~desc:"TPTP format (CNF FOF FOFX TFF)" } (* Local Variables: compile-command: "unset LANG; make -C ../.. test" End: *) why3-0.87.3/modules/0000755000175000017500000000000013035416743014713 5ustar guillaumeguillaumewhy3-0.87.3/modules/matrix.mlw0000644000175000017500000000432113035416743016740 0ustar guillaumeguillaume(** {1 Matrices} *) module Matrix use import int.Int use import map.Map as M type matrix 'a model { rows: int; columns: int; mutable elts: map int (map int 'a) } invariant { 0 <= self.rows /\ 0 <= self.columns } function get (a: matrix 'a) (r c: int) : 'a = M.get (M.get a.elts r) c function set (a: matrix 'a) (r c: int) (v: 'a) : matrix 'a = { a with elts = M.set a.elts r (M.set (M.get a.elts r) c v) } predicate valid_index (a: matrix 'a) (r c: int) = 0 <= r < a.rows /\ 0 <= c < a.columns val get (a: matrix 'a) (r c: int) : 'a requires { "expl:index in array bounds" valid_index a r c } ensures { result = get a r c } val set (a: matrix 'a) (r c: int) (v: 'a) : unit requires { "expl:index in array bounds" valid_index a r c } writes { a } ensures { a.elts = M.set (old a.elts) r (M.set (M.get (old a.elts) r) c v)} val rows (a: matrix 'a) : int ensures { result = a.rows } val columns (a: matrix 'a) : int ensures { result = a.columns } (** unsafe get/set operations with no precondition *) exception OutOfBounds let defensive_get (a: matrix 'a) (r c: int) : 'a ensures { "expl:index in array bounds" valid_index a r c } ensures { result = get a r c } raises { OutOfBounds -> not (valid_index a r c) } = if r < 0 || r >= a.rows || c < 0 || c >= a.columns then raise OutOfBounds; get a r c let defensive_set (a: matrix 'a) (r c: int) (v: 'a) : unit ensures { "expl:index in array bounds" valid_index a r c } ensures { a.elts = M.set (old a.elts) r (M.set (M.get (old a.elts) r) c v)} raises { OutOfBounds -> not (valid_index a r c) /\ a = old a } = if r < 0 || r >= a.rows || c < 0 || c >= a.columns then raise OutOfBounds; set a r c v val make (r c: int) (v: 'a) : matrix 'a requires { r >= 0 /\ c >= 0 } ensures { result.rows = r } ensures { result.columns = c } ensures { forall i j. 0 <= i < r /\ 0 <= j < c -> get result i j = v } val copy (a: matrix 'a) : matrix 'a ensures { result.rows = a.rows /\ result.columns = a.columns } ensures { forall r:int. 0 <= r < result.rows -> forall c:int. 0 <= c < result.columns -> get result r c = get a r c } end why3-0.87.3/modules/random.mlw0000644000175000017500000000445513035416743016724 0ustar guillaumeguillaume (** {1 Pseudo-random generators} This easiest way to get random numbers (of random values of any type) is to take advantage of the non-determinism of Hoare triples. Simply declaring a function [val random_int: unit -> {} int {}] is typically enough. Two calls to [random_int] return values that can not be proved equal, which is exactly what we need. The following modules provide slightly more: pseudo-random generators which are deterministic according to a state. The state is either explicit (module [State]) or global (module [Random]). Functions [init] allow to reset the generators according to a given seed. *) (** {2 Purely applicative generators} *) theory Generator use import bool.Bool use import int.Int type generator function create int : generator function next generator : generator function get_bool generator : bool function get_int generator int : int axiom get_int_def: forall g: generator, n : int. 0 < n -> 0 <= get_int g n < n end (** {2 Mutable states of pseudo-random generators} Basically a reference containing a pure generator. *) module State use import int.Int use export Generator type state model { mutable state: generator } val create (seed: int) : state ensures { result.state = create seed } val init (s: state) (seed: int) : unit writes {s} ensures { s.state = create seed } val self_init (s: state) : unit writes {s} val random_bool (s: state) : bool writes {s} ensures { s.state = next (old s.state) } ensures { result = get_bool s.state } val random_int (s: state) (n: int) : int writes {s} requires { 0 < n } ensures { s.state = next (old s.state) } ensures { result = get_int s.state n } ensures { 0 <= result < n } end (** {2 A global pseudo-random generator} *) module Random use import int.Int use import State val s: state let init (seed: int) ensures { s.state = create seed } = init s seed let self_init () = self_init s let random_bool () ensures { s.state = next (old s.state) } ensures { result = get_bool s.state } = random_bool s let random_int (n: int) requires { 0 < n } ensures { s.state = next (old s.state) } ensures { result = get_int s.state n } ensures { 0 <= result < n } = random_int s n end why3-0.87.3/modules/null.mlw0000644000175000017500000000136413035416743016412 0ustar guillaumeguillaume (** {1 A possibly null, yet safe, value} The OCaml driver does optimize this into the identity. To permit the implementation of eq_null, null is implemented as a heap-allocated value in OCaml, e.g., Obj.magic [|0|] *) module Null type null = int type t_model 'a = Null null | Value 'a type t 'a model { v: t_model 'a } predicate is_null (t: t 'a) = match t.v with Null _ -> true | Value _ -> false end val create_null () : t 'a ensures { is_null result } val eq_null (n x: t 'a) : bool requires { is_null n } ensures { result <-> x.v = n.v } val create (x: 'a) : t 'a ensures { result.v = Value x } val get (t: t 'a) : 'a requires { not (is_null t) } ensures { t.v = Value result } endwhy3-0.87.3/modules/hashtbl.mlw0000644000175000017500000000357013035416743017066 0ustar guillaumeguillaume (** {1 Hash tables} This module provides Hash tables à la OCaml. Each key is mapped to a {h stack} of values, with [add h k v] pushing a new value [v] for key [k], and [remove h k] popping a value for key [k]. *) module Hashtbl use import list.List use import map.Map type key type t 'a model { mutable contents: map key (list 'a) } function ([]) (h: t 'a) (k: key) : list 'a = Map.([]) h.contents k val create (n:int) : t 'a ensures { forall k: key. result[k] = Nil } val clear (h: t 'a) : unit writes {h} ensures { forall k: key. h[k] = Nil } val add (h: t 'a) (k: key) (v: 'a) : unit writes {h} ensures { h[k] = Cons v (old h)[k] } ensures { forall k': key. k' <> k -> h[k'] = (old h)[k'] } val mem (h: t 'a) (k: key) : bool ensures { result=True <-> h[k] <> Nil } val find (h: t 'a) (k: key) : 'a requires { h[k] <> Nil } ensures { match h[k] with Nil -> false | Cons v _ -> result = v end } val find_all (h: t 'a) (k: key) : list 'a ensures { result = h[k] } exception NotFound val defensive_find (h: t 'a) (k: key) : 'a ensures { match h[k] with Nil -> false | Cons v _ -> result = v end } raises { NotFound -> h[k] = Nil } val copy (h: t 'a) : t 'a ensures { forall k: key. result[k] = h[k] } val remove (h: t 'a) (k: key) : unit writes {h} ensures { h[k] = match (old h)[k] with Nil -> Nil | Cons _ l -> l end } ensures { forall k': key. k' <> k -> h[k'] = (old h)[k'] } val replace (h: t 'a) (k: key) (v: 'a) : unit writes {h} ensures { h[k] = Cons v (match (old h)[k] with Nil -> Nil | Cons _ l -> l end) } ensures { forall k': key. k' <> k -> h[k'] = (old h)[k'] } (*** TODO - val length: t 'a -> int (the number of distinct key) - val iter : ('a -> 'b -> unit) -> ('a, 'b) t -> unit - val fold : ('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c *) end why3-0.87.3/modules/impset.mlw0000644000175000017500000000123413035416743016735 0ustar guillaumeguillaume (** {1 Imperative sets} An imperative set is simply a reference containing a finite set. *) module Impset use export set.Fset use export ref.Ref type t 'a = ref (set 'a) let empty () ensures { is_empty !result } = ref (empty : set 'a) let create (s: set 'a) ensures { !result = s } = ref s let is_empty (b: t 'a) ensures { result = True <-> is_empty !b } = is_empty !b let push (x: 'a) (b: t 'a) ensures { !b = add x (old !b) } = b := add x !b let pop (b: t 'a) requires { not (is_empty !b) } ensures { mem result (old !b) } ensures { !b = remove result (old !b) } = let x = choose !b in b := remove x !b; x end why3-0.87.3/modules/array.mlw0000644000175000017500000002113013035416743016547 0ustar guillaumeguillaume(** {1 Arrays} *) (** {2 Generic Arrays} The length is a non-mutable field, so that we get for free that modification of an array does not modify its length. *) module Array use import int.Int use import map.Map as M type array 'a model { length : int; mutable elts : map int 'a } invariant { 0 <= self.length } function get (a: array ~'a) (i: int) : 'a = M.get a.elts i function set (a: array ~'a) (i: int) (v: 'a) : array 'a = { a with elts = M.set a.elts i v } (** syntactic sugar *) function ([]) (a: array 'a) (i: int) : 'a = get a i function ([<-]) (a: array 'a) (i: int) (v: 'a) : array 'a = set a i v val ([]) (a: array ~'a) (i: int) : 'a requires { "expl:index in array bounds" 0 <= i < length a } ensures { result = a[i] } val ([]<-) (a: array ~'a) (i: int) (v: 'a) : unit writes {a} requires { "expl:index in array bounds" 0 <= i < length a } ensures { a.elts = M.set (old a.elts) i v } val length (a: array ~'a) : int ensures { result = a.length } (** unsafe get/set operations with no precondition *) exception OutOfBounds let defensive_get (a: array 'a) (i: int) ensures { 0 <= i < length a /\ result = a[i] } raises { OutOfBounds -> i < 0 \/ i >= length a } = if i < 0 || i >= length a then raise OutOfBounds; a[i] let defensive_set (a: array 'a) (i: int) (v: 'a) ensures { 0 <= i < length a /\ a = (old a)[i <- v] } raises { OutOfBounds -> i < 0 \/ i >= length a /\ a = old a } = if i < 0 || i >= length a then raise OutOfBounds; a[i] <- v val make (n: int) (v: ~'a) : array 'a requires { "expl:array creation size" n >= 0 } ensures { length result = n } ensures { forall i:int. 0 <= i < n -> result[i] = v } val append (a1: array ~'a) (a2: array 'a) : array 'a ensures { length result = length a1 + length a2 } ensures { forall i:int. 0 <= i < length a1 -> result[i] = a1[i] } ensures { forall i:int. 0 <= i < length a2 -> result[length a1 + i] = a2[i] } val sub (a: array ~'a) (ofs: int) (len: int) : array 'a requires { 0 <= ofs /\ 0 <= len /\ ofs + len <= length a } ensures { length result = len } ensures { forall i:int. 0 <= i < len -> result[i] = a[ofs + i] } val copy (a: array ~'a) : array 'a ensures { length result = length a } ensures { forall i:int. 0 <= i < length result -> result[i] = a[i] } let fill (a: array ~'a) (ofs: int) (len: int) (v: 'a) requires { 0 <= ofs /\ 0 <= len /\ ofs + len <= length a } ensures { forall i:int. (0 <= i < ofs \/ ofs + len <= i < length a) -> a[i] = (old a)[i] } ensures { forall i:int. ofs <= i < ofs + len -> a[i] = v } = 'Init: for k = 0 to len - 1 do invariant { forall i:int. (0 <= i < ofs \/ ofs + len <= i < length a) -> a[i] = (at a 'Init)[i] } invariant { forall i:int. ofs <= i < ofs + k -> a[i] = v } a[ofs + k] <- v done val blit (a1: array ~'a) (ofs1: int) (a2: array 'a) (ofs2: int) (len: int) : unit writes {a2} requires { 0 <= ofs1 /\ 0 <= len /\ ofs1 + len <= length a1 } requires { 0 <= ofs2 /\ ofs2 + len <= length a2 } ensures { forall i:int. (0 <= i < ofs2 \/ ofs2 + len <= i < length a2) -> a2[i] = (old a2)[i] } ensures { forall i:int. ofs2 <= i < ofs2 + len -> a2[i] = a1[ofs1 + i - ofs2] } val self_blit (a: array ~'a) (ofs1: int) (ofs2: int) (len: int) : unit writes {a} requires { 0 <= ofs1 /\ 0 <= len /\ ofs1 + len <= length a } requires { 0 <= ofs2 /\ ofs2 + len <= length a } ensures { forall i:int. (0 <= i < ofs2 \/ ofs2 + len <= i < length a) -> a[i] = (old a)[i] } ensures { forall i:int. ofs2 <= i < ofs2 + len -> a[i] = (old a)[ofs1 + i - ofs2] } (*** TODO? - concat : 'a array list -> 'a array - to_list - of_list *) end (** {2 Sorted Arrays} *) module IntArraySorted use import int.Int use import Array clone import map.MapSorted as M with type elt = int, predicate le = (<=) predicate sorted_sub (a : array int) (l u : int) = M.sorted_sub a.elts l u (** [sorted_sub a l u] is true whenever the array segment [a(l..u-1)] is sorted w.r.t order relation [le] *) predicate sorted (a : array int) = M.sorted_sub a.elts 0 a.length (** [sorted a] is true whenever the array [a] is sorted w.r.t [le] *) end module Sorted use import int.Int use import Array type elt predicate le elt elt predicate sorted_sub (a: array elt) (l u: int) = forall i1 i2 : int. l <= i1 <= i2 < u -> le a[i1] a[i2] (** [sorted_sub a l u] is true whenever the array segment [a(l..u-1)] is sorted w.r.t order relation [le] *) predicate sorted (a: array elt) = forall i1 i2 : int. 0 <= i1 <= i2 < length a -> le a[i1] a[i2] (** [sorted a] is true whenever the array [a] is sorted w.r.t [le] *) end (** {2 Arrays Equality} *) module ArrayEq use import int.Int use import Array use import map.MapEq predicate array_eq_sub (a1 a2: array 'a) (l u: int) = a1.length = a2.length /\ 0 <= l <= a1.length /\ 0 <= u <= a1.length /\ map_eq_sub a1.elts a2.elts l u predicate array_eq (a1 a2: array 'a) = a1.length = a2.length /\ map_eq_sub a1.elts a2.elts 0 (length a1) end module ArrayExchange use import int.Int use import Array use import map.MapExchange as M predicate exchange (a1 a2: array 'a) (i j: int) = a1.length = a2.length /\ M.exchange a1.elts a2.elts 0 a1.length i j (** [exchange a1 a2 i j] means that arrays [a1] and [a2] only differ by the swapping of elements at indices [i] and [j] *) end (** {2 Permutation} *) module ArrayPermut use import int.Int use import Array use import map.MapPermut as M use import map.MapEq use import ArrayEq use export ArrayExchange predicate permut (a1 a2: array 'a) (l u: int) = a1.length = a2.length /\ 0 <= l <= a1.length /\ 0 <= u <= a1.length /\ M.permut a1.elts a2.elts l u (** [permut a1 a2 l u] is true when the segment [a1(l..u-1)] is a permutation of the segment [a2(l..u-1)]. Values outside of the interval (l..u-1) are ignored. *) predicate permut_sub (a1 a2: array 'a) (l u: int) = map_eq_sub a1.elts a2.elts 0 l /\ permut a1 a2 l u /\ map_eq_sub a1.elts a2.elts u (length a1) (** [permut_sub a1 a2 l u] is true when the segment [a1(l..u-1)] is a permutation of the segment [a2(l..u-1)] and values outside of the interval (l..u-1) are equal. *) predicate permut_all (a1 a2: array 'a) = a1.length = a2.length /\ M.permut a1.elts a2.elts 0 a1.length (** [permut_all a1 a2 l u] is true when array [a1] is a permutation of array [a2]. *) lemma exchange_permut_sub: forall a1 a2: array 'a, i j l u: int. exchange a1 a2 i j -> l <= i < u -> l <= j < u -> 0 <= l -> u <= length a1 -> permut_sub a1 a2 l u (** we can always enlarge the interval *) lemma permut_sub_weakening: forall a1 a2: array 'a, l1 u1 l2 u2: int. permut_sub a1 a2 l1 u1 -> 0 <= l2 <= l1 -> u1 <= u2 <= length a1 -> permut_sub a1 a2 l2 u2 (** {3 lemmas about [permut_all]} *) lemma exchange_permut_all: forall a1 a2: array 'a, i j: int. exchange a1 a2 i j -> permut_all a1 a2 end module ArraySwap use import int.Int use import Array use export ArrayExchange let swap (a:array 'a) (i:int) (j:int) : unit requires { 0 <= i < length a /\ 0 <= j < length a } writes { a } ensures { exchange (old a) a i j } = let v = a[i] in a[i] <- a[j]; a[j] <- v end (** {2 Sum of elements} *) module ArraySum use import Array use import map.MapSum as M (** [sum a l h] is the sum of [a[i]] for [l <= i < h] *) function sum (a: array int) (l h: int) : int = M.sum a.elts l h end (** {2 Number of array elements satisfying a given predicate} *) module NumOf use import Array use HighOrd use import Bool use int.NumOf as N (** the number of a[i] such that [l <= i < u] and [pr i a[i]] *) function numof (pr: int -> 'a -> bool) (a: array 'a) (l u: int) : int = N.numof (\ i. pr i a[i]) l u end (** the number of a[i] such that [l <= i < u] and [a[i] = v] *) module NumOfEq use import Array use int.NumOf as N function numof (a: array 'a) (v: 'a) (l u: int) : int = N.numof (\ i. a[i] = v) l u end module ToList use import int.Int use import Array use import list.List function to_list (a: array 'a) (l u: int) : list 'a axiom to_list_empty: forall a: array 'a, l u: int. u <= l -> to_list a l u = Nil axiom to_list_cons: forall a: array 'a, l u: int. l < u -> to_list a l u = Cons a[l] (to_list a (l+1) u) val to_list (a: array 'a) (l u: int) : list 'a ensures { result = to_list a l u } end why3-0.87.3/modules/queue.mlw0000644000175000017500000000270013035416743016557 0ustar guillaumeguillaume (** {1 Polymorphic mutable queues} *) module Queue use import list.List use import list.Append use import list.Length as L type t 'a model { mutable elts: list 'a } val create () : t 'a ensures { result.elts = Nil } val push (x: 'a) (q: t 'a) : unit writes {q} ensures { q.elts = old q.elts ++ Cons x Nil } exception Empty val pop (q: t 'a) : 'a writes {q} ensures { match old q.elts with Nil -> false | Cons x t -> result = x /\ q.elts = t end } raises { Empty -> q.elts = old q.elts = Nil } val peek (q: t 'a) : 'a ensures { match q.elts with Nil -> false | Cons x _ -> result = x end } raises { Empty -> q.elts = Nil } val safe_pop (q: t 'a) : 'a writes {q} requires { q.elts <> Nil } ensures { match old q.elts with Nil -> false | Cons x t -> result = x /\ q.elts = t end } val safe_peek (q: t 'a) : 'a requires { q.elts <> Nil } ensures { match q.elts with Nil -> false | Cons x _ -> result = x end } val clear (q: t 'a) : unit writes {q} ensures { q.elts = Nil } val copy (q: t 'a) : t 'a ensures { result = q } val is_empty (q: t 'a) : bool ensures { result = True <-> q.elts = Nil } function length (q: t 'a) : int = L.length q.elts val length (q: t 'a) : int ensures { result = L.length q.elts } val transfer (q1 q2: t 'a) : unit writes { q1, q2 } ensures { q1.elts = Nil } ensures { q2.elts = old q2.elts ++ old q1.elts } end why3-0.87.3/modules/mach/0000755000175000017500000000000013035416743015623 5ustar guillaumeguillaumewhy3-0.87.3/modules/mach/matrix.mlw0000644000175000017500000000477613035416743017666 0ustar guillaumeguillaume(** {1 Matrices} *) module Matrix63 use import mach.int.Int63 use import map.Map as M type matrix 'a model { rows: int63; columns: int63; mutable elts: map int (map int 'a) } invariant { 0 <= to_int self.rows /\ 0 <= to_int self.columns } function get (a: matrix 'a) (r c: int) : 'a = M.get (M.get a.elts r) c function set (a: matrix 'a) (r c: int) (v: 'a) : matrix 'a = { a with elts = M.set a.elts r (M.set (M.get a.elts r) c v) } predicate valid_index (a: matrix 'a) (r c: int63) = 0 <= to_int r < to_int a.rows /\ 0 <= to_int c < to_int a.columns val get (a: matrix 'a) (r c: int63) : 'a requires { "expl:index in array bounds" valid_index a r c } ensures { result = get a (to_int r) (to_int c) } val set (a: matrix 'a) (r c: int63) (v: 'a) : unit requires { "expl:index in array bounds" valid_index a r c } writes { a } ensures { a.elts = M.set (old a.elts) (to_int r) (M.set (M.get (old a.elts) (to_int r)) (to_int c) v) } val rows (a: matrix 'a) : int63 ensures { result = a.rows } val columns (a: matrix 'a) : int63 ensures { result = a.columns } (** unsafe get/set operations with no precondition *) exception OutOfBounds let defensive_get (a: matrix 'a) (r c: int63) : 'a ensures { "expl:index in array bounds" valid_index a r c } ensures { result = get a (to_int r) (to_int c) } raises { OutOfBounds -> not (valid_index a r c) } = if r < of_int 0 || r >= a.rows || c < of_int 0 || c >= a.columns then raise OutOfBounds; get a r c let defensive_set (a: matrix 'a) (r c: int63) (v: 'a) : unit ensures { "expl:index in array bounds" valid_index a r c } ensures { a.elts = M.set (old a.elts) (to_int r) (M.set (M.get (old a.elts) (to_int r)) (to_int c) v) } raises { OutOfBounds -> not (valid_index a r c) /\ a = old a } = if r < of_int 0 || r >= a.rows || c < of_int 0 || c >= a.columns then raise OutOfBounds; set a r c v val make (r c: int63) (v: 'a) : matrix 'a requires { to_int r >= 0 /\ to_int c >= 0 } ensures { result.rows = r } ensures { result.columns = c } ensures { forall i j. 0 <= i < to_int r /\ 0 <= j < to_int c -> get result i j = v } val copy (a: matrix 'a) : matrix 'a ensures { result.rows = a.rows /\ result.columns = a.columns } ensures { forall r:int. 0 <= r < to_int result.rows -> forall c:int. 0 <= c < to_int result.columns -> get result r c = get a r c } end why3-0.87.3/modules/mach/peano.mlw0000644000175000017500000000370113035416743017447 0ustar guillaumeguillaume (** {2 Peano arithmetic} *) module Peano use import int.Int type t model { v: int } val to_int (x: t) : int ensures { result = x.v } val zero (): t ensures { result.v = 0 } (* FIXME: should be a constant val function zero : t ensures { result.v = 0 } *) val succ (x: t) : t ensures { result.v = x.v + 1 } val pred (x: t) : t ensures { result.v = x.v - 1 } val lt (x y: t) : bool ensures { result <-> x.v < y.v } val le (x y: t) : bool ensures { result <-> x.v <= y.v } val gt (x y: t) : bool ensures { result <-> x.v > y.v } val ge (x y: t) : bool ensures { result <-> x.v >= y.v } val eq (x y: t) : bool ensures { result <-> x.v = y.v } val ne (x y: t) : bool ensures { result <-> x.v <> y.v } val neg (x: t) : t ensures { result.v = - x.v } val abs (x: t) : t ensures { result.v = if x.v >= 0 then x.v else - x.v } val add (x y: t) (low high: t) : t requires { low.v <= x.v + y.v <= high.v } ensures { result.v = x.v + y.v } val sub (x y: t) (low high: t) : t requires { low.v <= x.v - y.v <= high.v } ensures { result.v = x.v - y.v } val mul (x y: t) (low high: t) : t requires { low.v <= x.v * y.v <= high.v } ensures { result.v = x.v * y.v } val of_int (x: int) (low high: t) : t requires { low.v <= x <= high.v } ensures { result.v = x } (* FIXME could replace low.v by - max (abs low) (abs high) high.v by max (abs low) (abs high) avoid the computation of the bounds e.g. addition of two values of different signs *) use import int.ComputerDivision val div (x y: t) : t requires { y.v <> 0 } ensures { result.v = div x.v y.v } val mod (x y: t) : t requires { y.v <> 0 } ensures { result.v = mod x.v y.v } use import int.MinMax val max (x y: t) : t ensures { result.v = max x.v y.v } val min (x y: t) : t ensures { result.v = min x.v y.v } end why3-0.87.3/modules/mach/array.mlw0000644000175000017500000003332513035416743017470 0ustar guillaumeguillaume(** {1 Arrays with bounded-size integers} Note: We currently duplicate code to get the various modules below but we should eventually be able to implement a single module and then to clone it. *) (** {2 Arrays with 32-bit indices} *) module Array32 use import mach.int.Int32 use import map.Map as M type array 'a model { length: int32; mutable elts: map int 'a } invariant { 0 <= to_int self.length } function get (a: array ~'a) (i: int) : 'a = M.get a.elts i function set (a: array ~'a) (i: int) (v: 'a) : array 'a = { a with elts = M.set a.elts i v } (** syntactic sugar *) function ([]) (a: array 'a) (i: int) : 'a = get a i function ([<-]) (a: array 'a) (i: int) (v: 'a) : array 'a = set a i v val ([]) (a: array ~'a) (i: int32) : 'a requires { "expl:index in array bounds" 0 <= to_int i < to_int a.length } ensures { result = a[to_int i] } val ([]<-) (a: array ~'a) (i: int32) (v: 'a) : unit writes {a} requires { "expl:index in array bounds" 0 <= to_int i < to_int a.length } ensures { a.elts = M.set (old a.elts) (to_int i) v } val length (a: array ~'a) : int32 ensures { result = a.length } (** unsafe get/set operations with no precondition *) exception OutOfBounds let defensive_get (a: array 'a) (i: int32) ensures { 0 <= to_int i < to_int a.length } ensures { result = a[to_int i] } raises { OutOfBounds -> to_int i < 0 \/ to_int i >= to_int a.length } = if i < of_int 0 || i >= length a then raise OutOfBounds; a[i] let defensive_set (a: array 'a) (i: int32) (v: 'a) ensures { 0 <= to_int i < to_int a.length } ensures { a = (old a)[to_int i <- v] } raises { OutOfBounds -> to_int i < 0 \/ to_int i >= to_int a.length } = if i < of_int 0 || i >= length a then raise OutOfBounds; a[i] <- v val make (n: int32) (v: ~'a) : array 'a requires { "expl:array creation size" to_int n >= 0 } ensures { length result = n } ensures { forall i:int. 0 <= i < to_int n -> get result i = v } val append (a1: array ~'a) (a2: array 'a) : array 'a ensures { to_int result.length = to_int a1.length + to_int a2.length } ensures { forall i:int. 0 <= i < to_int a1.length -> result[i] = a1[i] } ensures { forall i:int. 0 <= i < to_int a2.length -> result[to_int a1.length + i] = a2[i] } val sub (a: array ~'a) (ofs: int32) (len: int32) : array 'a requires { 0 <= to_int ofs /\ 0 <= to_int len } requires { to_int ofs + to_int len <= to_int a.length } ensures { result.length = len } ensures { forall i:int. 0 <= i < to_int len -> result[i] = a[to_int ofs + i] } val copy (a: array ~'a) : array 'a ensures { result.length = a.length } ensures { forall i:int. 0 <= i < to_int result.length -> result[i] = a[i] } let fill (a: array ~'a) (ofs: int32) (len: int32) (v: 'a) requires { 0 <= to_int ofs /\ 0 <= to_int len } requires { to_int ofs + to_int len <= to_int a.length } ensures { forall i:int. (0 <= i < to_int ofs \/ to_int ofs + to_int len <= i < to_int a.length) -> a[i] = (old a)[i] } ensures { forall i:int. to_int ofs <= i < to_int ofs + to_int len -> a[i] = v } = 'Init: for k = 0 to Int.(-) (to_int len) 1 do (* FIXME: for loop on int32 *) invariant { forall i:int. (0 <= i < to_int ofs \/ to_int ofs + to_int len <= i < to_int a.length) -> a[i] = (at a 'Init)[i] } invariant { forall i:int. to_int ofs <= i < to_int ofs + k -> a[i] = v } let k = of_int k in a[ofs + k] <- v done val blit (a1: array ~'a) (ofs1: int32) (a2: array 'a) (ofs2: int32) (len: int32) : unit writes {a2} requires { 0 <= to_int ofs1 /\ 0 <= to_int len } requires { to_int ofs1 + to_int len <= to_int a1.length } requires { 0 <= to_int ofs2 /\ to_int ofs2 + to_int len <= to_int a2.length } ensures { forall i:int. (0 <= i < to_int ofs2 \/ to_int ofs2 + to_int len <= i < to_int a2.length) -> a2[i] = (old a2)[i] } ensures { forall i:int. to_int ofs2 <= i < to_int ofs2 + to_int len -> a2[i] = a1[to_int ofs1 + i - to_int ofs2] } val self_blit (a: array ~'a) (ofs1: int32) (ofs2: int32) (len: int32) : unit writes {a} requires { 0 <= to_int ofs1 /\ 0 <= to_int len /\ to_int ofs1 + to_int len <= to_int a.length } requires { 0 <= to_int ofs2 /\ to_int ofs2 + to_int len <= to_int a.length } ensures { forall i:int. (0 <= i < to_int ofs2 \/ to_int ofs2 + to_int len <= i < to_int a.length) -> a[i] = (old a)[i] } ensures { forall i:int. to_int ofs2 <= i < to_int ofs2 + to_int len -> a[i] = (old a)[to_int ofs1 + i - to_int ofs2] } end (** {2 Arrays with 31-bit indices} *) module Array31 use import mach.int.Int31 use import map.Map as M type array 'a model { length: int31; mutable elts: map int 'a } invariant { 0 <= to_int self.length } function get (a: array ~'a) (i: int) : 'a = M.get a.elts i function set (a: array ~'a) (i: int) (v: 'a) : array 'a = { a with elts = M.set a.elts i v } (** syntactic sugar *) function ([]) (a: array 'a) (i: int) : 'a = get a i function ([<-]) (a: array 'a) (i: int) (v: 'a) : array 'a = set a i v val ([]) (a: array ~'a) (i: int31) : 'a requires { "expl:index in array bounds" 0 <= to_int i < to_int a.length } ensures { result = a[to_int i] } val ([]<-) (a: array ~'a) (i: int31) (v: 'a) : unit writes {a} requires { "expl:index in array bounds" 0 <= to_int i < to_int a.length } ensures { a.elts = M.set (old a.elts) (to_int i) v } val length (a: array ~'a) : int31 ensures { result = a.length } (** unsafe get/set operations with no precondition *) exception OutOfBounds let defensive_get (a: array 'a) (i: int31) ensures { 0 <= to_int i < to_int a.length } ensures { result = a[to_int i] } raises { OutOfBounds -> to_int i < 0 \/ to_int i >= to_int a.length } = if i < of_int 0 || i >= length a then raise OutOfBounds; a[i] let defensive_set (a: array 'a) (i: int31) (v: 'a) ensures { 0 <= to_int i < to_int a.length } ensures { a = (old a)[to_int i <- v] } raises { OutOfBounds -> to_int i < 0 \/ to_int i >= to_int a.length } = if i < of_int 0 || i >= length a then raise OutOfBounds; a[i] <- v val make (n: int31) (v: ~'a) : array 'a requires { "expl:array creation size" to_int n >= 0 } ensures { length result = n } ensures { forall i:int. 0 <= i < to_int n -> get result i = v } val append (a1: array ~'a) (a2: array 'a) : array 'a ensures { to_int result.length = to_int a1.length + to_int a2.length } ensures { forall i:int. 0 <= i < to_int a1.length -> result[i] = a1[i] } ensures { forall i:int. 0 <= i < to_int a2.length -> result[to_int a1.length + i] = a2[i] } val sub (a: array ~'a) (ofs: int31) (len: int31) : array 'a requires { 0 <= to_int ofs /\ 0 <= to_int len } requires { to_int ofs + to_int len <= to_int a.length } ensures { result.length = len } ensures { forall i:int. 0 <= i < to_int len -> result[i] = a[to_int ofs + i] } val copy (a: array ~'a) : array 'a ensures { result.length = a.length } ensures { forall i:int. 0 <= i < to_int result.length -> result[i] = a[i] } let fill (a: array ~'a) (ofs: int31) (len: int31) (v: 'a) requires { 0 <= to_int ofs /\ 0 <= to_int len } requires { to_int ofs + to_int len <= to_int a.length } ensures { forall i:int. (0 <= i < to_int ofs \/ to_int ofs + to_int len <= i < to_int a.length) -> a[i] = (old a)[i] } ensures { forall i:int. to_int ofs <= i < to_int ofs + to_int len -> a[i] = v } = 'Init: for k = 0 to Int.(-) (to_int len) 1 do (* FIXME: for loop on int31 *) invariant { forall i:int. (0 <= i < to_int ofs \/ to_int ofs + to_int len <= i < to_int a.length) -> a[i] = (at a 'Init)[i] } invariant { forall i:int. to_int ofs <= i < to_int ofs + k -> a[i] = v } let k = of_int k in a[ofs + k] <- v done val blit (a1: array ~'a) (ofs1: int31) (a2: array 'a) (ofs2: int31) (len: int31) : unit writes {a2} requires { 0 <= to_int ofs1 /\ 0 <= to_int len } requires { to_int ofs1 + to_int len <= to_int a1.length } requires { 0 <= to_int ofs2 /\ to_int ofs2 + to_int len <= to_int a2.length } ensures { forall i:int. (0 <= i < to_int ofs2 \/ to_int ofs2 + to_int len <= i < to_int a2.length) -> a2[i] = (old a2)[i] } ensures { forall i:int. to_int ofs2 <= i < to_int ofs2 + to_int len -> a2[i] = a1[to_int ofs1 + i - to_int ofs2] } val self_blit (a: array ~'a) (ofs1: int31) (ofs2: int31) (len: int31) : unit writes {a} requires { 0 <= to_int ofs1 /\ 0 <= to_int len /\ to_int ofs1 + to_int len <= to_int a.length } requires { 0 <= to_int ofs2 /\ to_int ofs2 + to_int len <= to_int a.length } ensures { forall i:int. (0 <= i < to_int ofs2 \/ to_int ofs2 + to_int len <= i < to_int a.length) -> a[i] = (old a)[i] } ensures { forall i:int. to_int ofs2 <= i < to_int ofs2 + to_int len -> a[i] = (old a)[to_int ofs1 + i - to_int ofs2] } end (** {2 Arrays with 63-bit indices} *) module Array63 use import mach.int.Int63 use import map.Map as M type array63 'a model { length: int63; mutable elts: map int 'a } invariant { 0 <= to_int self.length } function get (a: array63 ~'a) (i: int) : 'a = M.get a.elts i function set (a: array63 ~'a) (i: int) (v: 'a) : array63 'a = { a with elts = M.set a.elts i v } (** syntactic sugar *) function ([]) (a: array63 'a) (i: int) : 'a = get a i function ([<-]) (a: array63 'a) (i: int) (v: 'a) : array63 'a = set a i v val ([]) (a: array63 ~'a) (i: int63) : 'a requires { "expl:index in array63 bounds" 0 <= to_int i < to_int a.length } ensures { result = a[to_int i] } val ([]<-) (a: array63 ~'a) (i: int63) (v: 'a) : unit writes {a} requires { "expl:index in array63 bounds" 0 <= to_int i < to_int a.length } ensures { a.elts = M.set (old a.elts) (to_int i) v } val length (a: array63 ~'a) : int63 ensures { result = a.length } (** unsafe get/set operations with no precondition *) exception OutOfBounds let defensive_get (a: array63 'a) (i: int63) ensures { 0 <= to_int i < to_int a.length } ensures { result = a[to_int i] } raises { OutOfBounds -> to_int i < 0 \/ to_int i >= to_int a.length } = if i < of_int 0 || i >= length a then raise OutOfBounds; a[i] let defensive_set (a: array63 'a) (i: int63) (v: 'a) ensures { 0 <= to_int i < to_int a.length } ensures { a = (old a)[to_int i <- v] } raises { OutOfBounds -> to_int i < 0 \/ to_int i >= to_int a.length } = if i < of_int 0 || i >= length a then raise OutOfBounds; a[i] <- v val make (n: int63) (v: ~'a) : array63 'a requires { "expl:array63 creation size" to_int n >= 0 } ensures { length result = n } ensures { forall i:int. 0 <= i < to_int n -> get result i = v } val append (a1: array63 ~'a) (a2: array63 'a) : array63 'a ensures { to_int result.length = to_int a1.length + to_int a2.length } ensures { forall i:int. 0 <= i < to_int a1.length -> result[i] = a1[i] } ensures { forall i:int. 0 <= i < to_int a2.length -> result[to_int a1.length + i] = a2[i] } val sub (a: array63 ~'a) (ofs: int63) (len: int63) : array63 'a requires { 0 <= to_int ofs /\ 0 <= to_int len } requires { to_int ofs + to_int len <= to_int a.length } ensures { result.length = len } ensures { forall i:int. 0 <= i < to_int len -> result[i] = a[to_int ofs + i] } val copy (a: array63 ~'a) : array63 'a ensures { result.length = a.length } ensures { forall i:int. 0 <= i < to_int result.length -> result[i] = a[i] } let fill (a: array63 ~'a) (ofs: int63) (len: int63) (v: 'a) requires { 0 <= to_int ofs /\ 0 <= to_int len } requires { to_int ofs + to_int len <= to_int a.length } ensures { forall i:int. (0 <= i < to_int ofs \/ to_int ofs + to_int len <= i < to_int a.length) -> a[i] = (old a)[i] } ensures { forall i:int. to_int ofs <= i < to_int ofs + to_int len -> a[i] = v } = 'Init: for k = 0 to Int.(-) (to_int len) 1 do (* FIXME: for loop on int63 *) invariant { forall i:int. (0 <= i < to_int ofs \/ to_int ofs + to_int len <= i < to_int a.length) -> a[i] = (at a 'Init)[i] } invariant { forall i:int. to_int ofs <= i < to_int ofs + k -> a[i] = v } let k = of_int k in a[ofs + k] <- v done val blit (a1: array63 ~'a) (ofs1: int63) (a2: array63 'a) (ofs2: int63) (len: int63) : unit writes {a2} requires { 0 <= to_int ofs1 /\ 0 <= to_int len } requires { to_int ofs1 + to_int len <= to_int a1.length } requires { 0 <= to_int ofs2 /\ to_int ofs2 + to_int len <= to_int a2.length } ensures { forall i:int. (0 <= i < to_int ofs2 \/ to_int ofs2 + to_int len <= i < to_int a2.length) -> a2[i] = (old a2)[i] } ensures { forall i:int. to_int ofs2 <= i < to_int ofs2 + to_int len -> a2[i] = a1[to_int ofs1 + i - to_int ofs2] } val self_blit (a: array63 ~'a) (ofs1: int63) (ofs2: int63) (len: int63) : unit writes {a} requires { 0 <= to_int ofs1 /\ 0 <= to_int len /\ to_int ofs1 + to_int len <= to_int a.length } requires { 0 <= to_int ofs2 /\ to_int ofs2 + to_int len <= to_int a.length } ensures { forall i:int. (0 <= i < to_int ofs2 \/ to_int ofs2 + to_int len <= i < to_int a.length) -> a[i] = (old a)[i] } ensures { forall i:int. to_int ofs2 <= i < to_int ofs2 + to_int len -> a[i] = (old a)[to_int ofs1 + i - to_int ofs2] } end (* TODO - Array64 ? *) why3-0.87.3/modules/mach/onetime.mlw0000644000175000017500000000414713035416743020012 0ustar guillaumeguillaume (** {2 One-time integers} *) module OneTime use import int.Int type t model { v: int; mutable ghost valid: bool } val to_int (x: t) : int ensures { result = x.v } val zero (): t ensures { result.valid } ensures { result.v = 0 } val succ (x: t) : t requires { x.valid } writes { x.valid } ensures { result.valid /\ not x.valid } ensures { result.v = x.v + 1 } val pred (x: t) : t requires { x.valid } writes { x.valid } ensures { result.valid /\ not x.valid } ensures { result.v = x.v - 1 } val lt (x y: t) : bool ensures { result <-> x.v < y.v } val le (x y: t) : bool ensures { result <-> x.v <= y.v } val gt (x y: t) : bool ensures { result <-> x.v > y.v } val ge (x y: t) : bool ensures { result <-> x.v >= y.v } val eq (x y: t) : bool ensures { result <-> x.v = y.v } val ne (x y: t) : bool ensures { result <-> x.v <> y.v } use mach.peano.Peano as P val to_peano (x: t) : P.t ensures { result.P.v = x.v } val transfer (x: t) : t requires { x.valid } writes { x.valid } ensures { result.valid /\ not x.valid } ensures { result.v = x.v } val neg (x: t) : t requires { x.valid } writes { x.valid } ensures { result.valid /\ not x.valid } ensures { result.v = - x.v } val abs (x: t) : t requires { x.valid } writes { x.valid } ensures { result.valid /\ not x.valid } ensures { result.v = if x.v >= 0 then x.v else - x.v } val add (x y: t) : t requires { x.valid /\ y.valid } writes { x.valid, y.valid } ensures { result.valid /\ not x.valid /\ not y.valid } ensures { result.v = x.v + y.v } val sub (x y: t) : t requires { x.valid /\ y.valid } writes { x.valid, y.valid } ensures { result.valid /\ not x.valid /\ not y.valid } ensures { result.v = x.v - y.v } val split (x: t) (p: P.t) : (t, t) requires { x.valid } requires { 0 <= p.P.v <= x.v \/ x.v <= p.P.v <= 0 } writes { x.valid } ensures { not x.valid } returns { a, b -> a.valid /\ b.valid /\ a.v = x.v - b.v /\ b.v = p.P.v } end why3-0.87.3/modules/mach/bv.mlw0000644000175000017500000001466313035416743016765 0ustar guillaumeguillaume(* Reasoning on bitvectors with precondition enforcing absence of overflow *) module BVCheck_Gen use import int.Int type t constant size : int constant two_power_size : int constant zeros : t function to_uint t : int function of_int int : t function add t t : t function sub t t : t function mul t t : t function udiv t t : t function urem t t : t function lsl t int : t function lsl_bv t t : t function lsr t int : t function lsr_bv t t : t function asr t int : t function asr_bv t t : t predicate eq t t predicate ule t t predicate ult t t predicate uge t t predicate ugt t t val int_check (a:int) : t requires { 0 <= a < two_power_size } ensures { to_uint result = a } ensures { result = of_int a } val add_check (a b:t) : t requires { 0 <= to_uint a + to_uint b < two_power_size } ensures { to_uint result = to_uint a + to_uint b } ensures { result = add a b } val sub_check (a b:t) : t requires { 0 <= to_uint a - to_uint b < two_power_size } ensures { result = sub a b } ensures { to_uint result = to_uint a - to_uint b } val mul_check (a b:t) : t requires { 0 <= to_uint a * to_uint b < two_power_size } ensures { result = mul a b } ensures { to_uint result = to_uint a * to_uint b } val lsl_check (a b:t) : t requires { 0 <= to_uint b < size } ensures { result = lsl_bv a b } ensures { result = lsl a (to_uint b) } val lsr_check (a b:t) : t requires { 0 <= to_uint b < size } ensures { result = lsr_bv a b } ensures { result = lsr a (to_uint b) } val asr_check (a b:t) : t requires { 0 <= to_uint b < size } ensures { result = asr_bv a b } ensures { result = asr a (to_uint b) } use import int.EuclideanDivision val udiv_check (a b:t) : t requires {b <> zeros} ensures { to_uint result = div (to_uint a) (to_uint b) } ensures { result = udiv a b } val urem_check (a b:t) : t requires {b <> zeros} ensures { to_uint result = mod (to_uint a) (to_uint b) } ensures { result = urem a b } val eq_check (a b:t) : bool ensures { match result with | True -> to_uint a = to_uint b | False -> to_uint a <> to_uint b end } ensures { match result with | True -> eq a b | False -> not (eq a b) end } val ne_check (a b:t) : bool ensures { match result with | True -> to_uint a <> to_uint b | False -> to_uint a = to_uint b end } ensures { match result with | True -> not (eq a b) | False -> eq a b end } val le_check (a b:t) : bool ensures { match result with | True -> to_uint a <= to_uint b | False -> to_uint a > to_uint b end } ensures { match result with | True -> ule a b | False -> not (ule a b) end } val lt_check (a b:t) : bool ensures { match result with | True -> to_uint a < to_uint b | False -> to_uint a >= to_uint b end } ensures { match result with | True -> ult a b | False -> not (ult a b) end } val ge_check (a b:t) : bool ensures { match result with | True -> to_uint a >= to_uint b | False -> to_uint a < to_uint b end } ensures { match result with | True -> uge a b | False -> not (uge a b) end } val gt_check (a b:t) : bool ensures { match result with | True -> to_uint a > to_uint b | False -> to_uint a <= to_uint b end } ensures { match result with | True -> ugt a b | False -> not (ugt a b) end } end module BVCheck8 use export bv.BV8 clone export BVCheck_Gen with type t = t, constant size = size, function two_power_size = two_power_size, function zeros = zeros, function to_uint = to_uint, function of_int = of_int, function add = add, function sub = sub, function mul = mul, function udiv = udiv, function urem = urem, function lsl = lsl, function lsl_bv = lsl_bv, function lsr = lsr, function lsr_bv = lsr_bv, function asr = asr, function asr_bv = asr_bv, predicate eq = eq, predicate ule = ule, predicate ult = ult, predicate uge = uge, predicate ugt = ugt end module BVCheck16 use export bv.BV16 clone export BVCheck_Gen with type t = t, constant size = size, function two_power_size = two_power_size, function zeros = zeros, function to_uint = to_uint, function of_int = of_int, function add = add, function sub = sub, function mul = mul, function udiv = udiv, function urem = urem, function lsl = lsl, function lsl_bv = lsl_bv, function lsr = lsr, function lsr_bv = lsr_bv, function asr = asr, function asr_bv = asr_bv, predicate eq = eq, predicate ule = ule, predicate ult = ult, predicate uge = uge, predicate ugt = ugt end module BVCheck32 use export bv.BV32 clone export BVCheck_Gen with type t = t, constant size = size, function two_power_size = two_power_size, function zeros = zeros, function to_uint = to_uint, function of_int = of_int, function add = add, function sub = sub, function mul = mul, function udiv = udiv, function urem = urem, function lsl = lsl, function lsl_bv = lsl_bv, function lsr = lsr, function lsr_bv = lsr_bv, function asr = asr, function asr_bv = asr_bv, predicate eq = eq, predicate ule = ule, predicate ult = ult, predicate uge = uge, predicate ugt = ugt end module BVCheck64 use export bv.BV64 clone export BVCheck_Gen with type t = t, constant size = size, function two_power_size = two_power_size, function zeros = zeros, function to_uint = to_uint, function of_int = of_int, function add = add, function sub = sub, function mul = mul, function udiv = udiv, function urem = urem, function lsl = lsl, function lsl_bv = lsl_bv, function lsr = lsr, function lsr_bv = lsr_bv, function asr = asr, function asr_bv = asr_bv, predicate eq = eq, predicate ule = ule, predicate ult = ult, predicate uge = uge, predicate ugt = ugt end why3-0.87.3/modules/mach/int.mlw0000644000175000017500000001617313035416743017146 0ustar guillaumeguillaume (** {1 Arithmetic for programs} *) (** {2 Integer Division} It is checked that divisor is not null. *) module Int use export int.Int use export int.ComputerDivision let (/) (x: int) (y: int) requires { "expl:check division by zero" y <> 0 } ensures { result = div x y } = div x y let (%) (x: int) (y: int) requires { "expl:check modulo by zero" y <> 0 } ensures { result = mod x y } = mod x y end (** {2 Machine integers} Bounded integers, typically n-bit signed and unsigned integers, go here. We first introduce a generic theory [Bounded_int] of bounded integers, with minimal and maximal values (resp. [min] and [max]). Then we instantiate it to get 32-bit and 64-bit signed and unsigned integers ([Int32], [UInt32], [Int64], and [UInt64]) as well as 31-bit and 63-bit signed integers ([Int31] and [Int63]) to be used in OCaml programs. *) module Bounded_int use export int.Int type t constant min : int constant max : int function to_int (n:t) : int predicate in_bounds (n:int) = min <= n <= max axiom to_int_in_bounds: forall n:t. in_bounds (to_int n) val of_int (n:int) : t requires { "expl:integer overflow" in_bounds n } ensures { to_int result = n } val (+) (a:t) (b:t) : t requires { "expl:integer overflow" in_bounds (to_int a + to_int b) } ensures { to_int result = to_int a + to_int b } val (-) (a:t) (b:t) : t requires { "expl:integer overflow" in_bounds (to_int a - to_int b) } ensures { to_int result = to_int a - to_int b } val ( *) (a:t) (b:t) : t requires { "expl:integer overflow" in_bounds (to_int a * to_int b) } ensures { to_int result = to_int a * to_int b } val (-_) (a:t) : t requires { "expl:integer overflow" in_bounds (- to_int a) } ensures { to_int result = - to_int a } val eq (a:t) (b:t) : bool ensures { to_int a = to_int b -> result } ensures { result -> a = b } val ne (a:t) (b:t) : bool ensures { a <> b -> result } ensures { result -> to_int a <> to_int b } axiom extensionality: forall x y: t. to_int x = to_int y -> x = y val (<=) (a:t) (b:t) : bool ensures { result <-> to_int a <= to_int b } val (<) (a:t) (b:t) : bool ensures { result <-> to_int a < to_int b } val (>=) (a:t) (b:t) : bool ensures { result <-> to_int a >= to_int b } val (>) (a:t) (b:t) : bool ensures { result <-> to_int a > to_int b } use import int.ComputerDivision val (/) (a:t) (b:t) : t requires { "expl:division by zero" to_int b <> 0 } requires { "expl:integer overflow" in_bounds (div (to_int a) (to_int b)) } ensures { to_int result = div (to_int a) (to_int b) } val (%) (a:t) (b:t) : t requires { "expl:division by zero" to_int b <> 0 } requires { "expl:integer overflow" in_bounds (mod (to_int a) (to_int b)) } ensures { to_int result = mod (to_int a) (to_int b) } end module Unsigned use import int.Int constant min_unsigned : int = 0 clone export Bounded_int with constant min = min_unsigned constant zero_unsigned : t axiom zero_unsigned_is_zero : to_int zero_unsigned = 0 val add_with_carry (x y:t) (c:t) : (t,t) requires { 0 <= to_int c <= 1 } returns { (r,d) -> to_int r + (max+1) * to_int d = to_int x + to_int y + to_int c } val add3 (x y z:t) : (t,t) returns { (r,d) -> to_int r + (max+1) * to_int d = to_int x + to_int y + to_int z } val mul_double (x y:t) : (t,t) returns { (r,d) -> to_int r + (max+1) * to_int d = to_int x * to_int y } end module Int31 use import int.Int type int31 constant min_int31 : int = - 0x40000000 constant max_int31 : int = 0x3fffffff clone export Bounded_int with type t = int31, constant min = min_int31, constant max = max_int31 (* use bv.BV31 val to_bv (x: int31) : BV31.t ensures { BV31.to_int result = to_int x } val of_bv (x: BV31.t) : int31 ensures { to_int result = BV31.to_int x } *) end module Int32 use import int.Int type int32 constant min_int32 : int = - 0x80000000 constant max_int32 : int = 0x7fffffff clone export Bounded_int with type t = int32, constant min = min_int32, constant max = max_int32 use bv.BV32 val to_bv (x: int32) : BV32.t ensures { BV32.to_int result = to_int x } val of_bv (x: BV32.t) : int32 ensures { to_int result = BV32.to_int x } end module UInt32 type uint32 constant max_uint32 : int = 0xffffffff clone export Unsigned with type t = uint32, constant max = max_uint32 (* use bv.BV32 val to_bv (x: uint32) : BV32.t ensures { BV32.to_uint result = to_int x } val of_bv (x: BV32.t) : uint32 ensures { to_int result = BV32.to_uint x } *) end module Int63 use import int.Int type int63 constant min_int63 : int = - 0x4000000000000000 constant max_int63 : int = 0x3fffffffffffffff clone export Bounded_int with type t = int63, constant min = min_int63, constant max = max_int63 (* use bv.BV63 val to_bv (x: int63) : BV63.t ensures { BV63.to_int result = to_int x } val of_bv (x: BV63.t) : int63 ensures { to_int result = BV63.to_int x } *) end module Refint63 use import Int63 use export ref.Ref let incr (r: ref int63) : unit requires { "expl:integer overflow" to_int !r < max_int63 } ensures { to_int !r = to_int (old !r) + 1 } = r := !r + of_int 1 let decr (r: ref int63) : unit requires { "expl:integer overflow" min_int63 < to_int !r } ensures { to_int !r = to_int (old !r) - 1 } = r := !r - of_int 1 let (+=) (r: ref int63) (v: int63) : unit requires { "expl:integer overflow" in_bounds (to_int !r + to_int v) } ensures { to_int !r = to_int (old !r) + to_int v } = r := !r + v let (-=) (r: ref int63) (v: int63) : unit requires { "expl:integer overflow" in_bounds (to_int !r - to_int v) } ensures { to_int !r = to_int (old !r) - to_int v } = r := !r - v let ( *= ) (r: ref int63) (v: int63) : unit requires { "expl:integer overflow" in_bounds (to_int !r * to_int v) } ensures { to_int !r = to_int (old !r) * to_int v } = r := !r * v end module MinMax63 use import Int63 let min (x y: int63) : int63 ensures { result = if to_int x <= to_int y then x else y } = if x <= y then x else y let max (x y: int63) : int63 ensures { result = if to_int x >= to_int y then x else y } = if x >= y then x else y end module Int64 use import int.Int type int64 constant min_int64 : int = - 0x8000000000000000 constant max_int64 : int = 0x7fffffffffffffff clone export Bounded_int with type t = int64, constant min = min_int64, constant max = max_int64 (* use bv.BV64 val to_bv (x: int64) : BV64.t ensures { BV64.to_int result = to_int x } val of_bv (x: BV64.t) : int64 ensures { to_int result = BV64.to_int x } *) end module UInt64 use import int.Int type uint64 constant max_uint64 : int = 0xffffffffffffffff clone export Unsigned with type t = uint64, constant max = max_uint64 (* use bv.BV64 val to_bv (x: uint64) : BV64.t ensures { BV64.to_uint result = to_int x } val of_bv (x: BV64.t) : uint64 ensures { to_int result = BV64.to_uint x } *) end why3-0.87.3/modules/string.mlw0000644000175000017500000000720013035416743016741 0ustar guillaumeguillaume (** {1 Characters and Strings} *) (** {2 Characters} *) module Char use import int.Int type char model { code : int } function uppercase char : char function lowercase char : char axiom uppercase_alpha: forall c:int. 97 <= c <= 122 -> uppercase { code = c } = { code = c - 32 } axiom uppercase_other: forall c:int. 0 <= c < 97 \/ 122 < c <= 127 -> uppercase { code = c } = { code = c } axiom lowercase_alpha: forall c:int. 65 <= c <= 90 -> lowercase { code = c } = { code = c + 32 } axiom lowercase_other: forall c:int. 0 <= c < 65 \/ 90 < c <= 127 -> lowercase { code = c } = { code = c } val chr (x:int) : char requires { 0 <= x <= 255 } ensures { result = { code = x } } val code (c:char) : int ensures { result = c.code /\ 0 <= c.code <= 255 } (*** TODO - compare ? *) end (** {2 Strings} *) module String use import int.Int use import Char use import map.Map as M type string model { length: int; mutable chars: map int char } invariant { self.length >= 0 } val create (len:int) : string requires { len >= 0 } ensures { length result = len } function ([]) (s: string) (i :int) : char = M.([]) s.chars i function get (s: string) (i :int) : char = M.([]) s.chars i val make (len:int) (c:char) : string requires { len >= 0 } ensures { length result = len } ensures { forall i:int. 0 <= i < len -> result[i] = c } val get (s:string) (i:int) : char requires { 0 <= i < length s } ensures { result = s[i] } val unsafe_get (s:string) (i:int) : char ensures { result = s[i] } val set (s:string) (i:int) (v:char) : unit writes {s} requires { 0 <= i < length s } ensures { s.chars = (old s.chars)[i <- v] } val unsafe_set (s:string) (i:int) (v:char) : unit writes {s} ensures { s.chars = (old s.chars)[i <- v] } val length (s:string) : int ensures { result = length s } val copy (s:string) : string ensures { length result = length s } ensures { forall i:int. 0 <= i < length result -> result[i] = s[i] } val uppercase (s:string) : string ensures { length result = length s } ensures { forall i:int. 0 <= i < length result -> result[i] = Char.uppercase s[i] } val lowercase (s:string) : string ensures { length result = length s } ensures { forall i:int. 0 <= i < length result -> result[i] = Char.lowercase s[i] } (*** TODO - copy - sub - fill - blit - concat - index / rindex / index_from / rindex_from - contains / contains_from / rcontains_from - capitalize / uncapitalize *) end (** {2 Buffers} *) module Buffer use import int.Int use import Char use import String as S use import map.Map as M type t model { mutable length: int; mutable contents: map int char } invariant { self.length >= 0 } val create (size:int) : t requires { size >= 0 } ensures { result.length = 0 } (** [size] is only given as a hint for the initial size *) val contents (b:t) : string ensures { S.length result = length b } val add_char (b:t) (c:char) : unit writes {b} ensures { length b = old (length b) + 1 } ensures { forall i: int. 0 <= i < length b -> b.contents[i] = (old b.contents)[i] } ensures { b.contents[length b - 1] = c } val add_string (b:t) (s:string) : unit writes {b} ensures { length b = old (length b) + S.length s } ensures { forall i: int. 0 <= i < old (length b) -> b.contents[i] = (old b.contents)[i] } ensures { forall i: int. 0 <= i < S.length s -> b.contents[old (length b) + i] = S.get s i } (*** TODO - add_substring - add_buffer *) end why3-0.87.3/modules/stack.mlw0000644000175000017500000000244313035416743016544 0ustar guillaumeguillaume (** {1 Stacks} *) (** {2 Polymorphic mutable stacks} *) module Stack use import list.List use import list.Length as L type t 'a model { mutable elts: list 'a } val create () : t 'a ensures { result.elts = Nil } val push (x: 'a) (s: t 'a) : unit writes {s} ensures { s.elts = Cons x (old s.elts) } exception Empty val pop (s: t 'a) : 'a writes {s} ensures { match old s.elts with Nil -> false | Cons x t -> result = x /\ s.elts = t end } raises { Empty -> s.elts = old s.elts = Nil } val top (s: t 'a) : 'a ensures { match s.elts with Nil -> false | Cons x _ -> result = x end } raises { Empty -> s.elts = Nil } val safe_pop (s: t 'a) : 'a writes {s} requires { s.elts <> Nil } ensures { match old s.elts with Nil -> false | Cons x t -> result = x /\ s.elts = t end } val safe_top (s: t 'a) : 'a requires { s.elts <> Nil } ensures { match s.elts with Nil -> false | Cons x _ -> result = x end } val clear (s: t 'a) : unit writes {s} ensures { s.elts = Nil } val copy (s: t 'a) : t 'a ensures { result = s } val is_empty (s: t 'a) : bool ensures { result = True <-> s.elts = Nil } function length (s: t 'a) : int = L.length s.elts val length (s: t 'a) : int ensures { result = L.length s.elts } end why3-0.87.3/modules/io.mlw0000644000175000017500000000262613035416743016051 0ustar guillaumeguillaume module StdIO use import string.Char (*i use import string.String *) (** ghost references to represent the standard output *) use import int.Int use import list.List use list.Reverse use import ref.Ref type prdata = PrChar char | PrInt int val ghost flushed : ref (list (list prdata)) val ghost current_line : ref (list prdata) val ghost cur_pos : ref int val ghost cur_linenum: ref int (** prints a character on standard output. *) val print_char (c:char) : unit writes { cur_pos, current_line } ensures { !cur_pos = (old !cur_pos) + 1 } ensures { !current_line = Cons (PrChar c) (old !current_line) } (*i val print_string (s:string) : unit *) (*i prints a string on standard output. *) val print_int (n: int) : unit (** prints an integer, in decimal, on standard output. *) (*i val print_real (r:real) : unit *) (*i prints a real number on standard output. *) (*i val print_endline (s:string) : unit *) (*i prints a string, followed by a newline character, on standard output and flushes standard output. *) (** prints a newline character on standard output, and flushes standard output. *) val print_newline (u:unit) : unit writes { cur_pos, current_line, cur_linenum, flushed } ensures { !cur_pos = 0 } ensures { !current_line = Nil } ensures { !cur_linenum = (old !cur_linenum) + 1 } ensures { !flushed = Cons (Reverse.reverse (old !current_line)) (old !flushed) } end why3-0.87.3/modules/ref.mlw0000644000175000017500000000212413035416743016207 0ustar guillaumeguillaume (** {1 References} A mutable variable, or ``reference'' in ML terminology, is simply a record with a single mutable field [contents]. *) (** {2 Generic references} Creation, access, and assignment are provided as [ref], prefix [!], and infix [:=], respectively. *) module Ref type ref 'a = { mutable contents "model_trace:" : 'a } function (!) (x: ref 'a) : 'a = x.contents let ref (v: 'a) ensures { result = { contents = v } } = { contents = v } let (!) (r:ref 'a) ensures { result = !r } = r.contents let (:=) (r:ref 'a) (v:'a) ensures { !r = v } = r.contents <- v end (** {2 Integer References} a few operations specific to integer references *) module Refint use import int.Int use export Ref let incr (r: ref int) ensures { !r = old !r + 1 } = r := !r + 1 let decr (r: ref int) ensures { !r = old !r - 1 } = r := !r - 1 let (+=) (r: ref int) (v: int) ensures { !r = old !r + v } = r := !r + v let (-=) (r: ref int) (v: int) ensures { !r = old !r - v } = r := !r - v let ( *= ) (r: ref int) (v: int) ensures { !r = old !r * v } = r := !r * v end why3-0.87.3/modules/pqueue.mlw0000644000175000017500000000667213035416743016753 0ustar guillaumeguillaume (** {1 Priority queues} *) (** {2 Polymorphic mutable priority queues} *) module Pqueue (** {3 Types} *) type elt (** the abstract type of elements *) clone export relations.TotalOrder with type t = elt (** [elt] is equipped with a total order [rel] *) use import list.List use import list.Mem use import list.Permut use import list.Length type t model { mutable elts: list elt } (** the priority queue is modeled as a list of elements *) (** {3 Operations} *) val create () : t ensures { result.elts = Nil } (** create a fresh, empty queue *) val push (x: elt) (q: t) : unit writes {q} ensures { q.elts = Cons x (old q.elts) } (** push an element in a queue *) exception Empty (** exception raised by [pop] and [peek] to signal an empty queue *) predicate minimal_elt (x: elt) (s: list elt) = mem x s /\ forall e: elt. mem e s -> rel x e (** property of the element returned by [pop] and [peek] *) val pop (q: t) : elt writes {q} ensures { permut (Cons result q.elts) (old q.elts) } ensures { minimal_elt result (old q.elts) } raises { Empty -> q.elts = (old q.elts) = Nil } (** remove and return the minimal element *) val peek (q: t) : elt ensures { minimal_elt result q.elts } raises { Empty -> q.elts = Nil } (** return the minimal element, without modifying the queue *) val clear (q: t) : unit writes {q} ensures { q.elts = Nil } (** empty the queue *) val copy (q: t) : t ensures { result = q } (** return a fresh copy of the queue *) val is_empty (q: t) : bool ensures { result = True <-> q.elts = Nil } (** check whether the queue is empty *) val length (q: t) : int ensures { result = length q.elts } (** return the number of elements in the queue *) end (** {2 Simpler interface} when duplicate elements are not allowed *) module PqueueNoDup (** {3 Types} *) type elt (** the abstract type of elements *) clone export relations.TotalOrder with type t = elt (** [elt] is equipped with a total order [rel] *) use import set.Fset type t model { mutable elts: set elt } (** the priority queue is modeled as a finite set of elements *) (** {3 Operations} *) val create () : t ensures { result.elts = empty } (** create a fresh, empty queue *) val push (x: elt) (q: t) : unit writes {q} ensures { q.elts = add x (old q.elts) } (** push an element in a queue *) exception Empty (** exception raised by [pop] and [peek] to signal an empty queue *) predicate minimal_elt (x: elt) (s: set elt) = mem x s /\ forall e: elt. mem e s -> rel x e (** property of the element returned by [pop] and [peek] *) val pop (q: t) : elt writes {q} ensures { q.elts = remove result (old q.elts) } ensures { minimal_elt result (old q.elts) } raises { Empty -> q.elts = (old q.elts) = empty } (** remove and returns the minimal element *) val peek (q: t) : elt ensures { minimal_elt result q.elts } raises { Empty -> q.elts = empty } (** return the minimal element, without modifying the queue *) val clear (q: t) : unit writes {q} ensures {q.elts = empty } (** empty the queue *) val copy (q: t) : t ensures { result = q } (** return a fresh copy of the queue *) val is_empty (q: t) : bool ensures { result=True <-> q.elts = empty } (** check whether the queue is empty *) val length (q: t) : int ensures { result = cardinal q.elts } (** return the number of elements in the queue *) end why3-0.87.3/theories/0000755000175000017500000000000013035416743015065 5ustar guillaumeguillaumewhy3-0.87.3/theories/pigeon.why0000644000175000017500000000223713035416743017103 0ustar guillaumeguillaume (** {1 Pigeon hole principle} Contributed by Yuto Takei (University of Tokyo) *) theory Pigeonhole use import int.Int use import list.List use import list.Length use import list.Append use list.Mem use import set.Fset type t predicate pigeon_set (s: set t) = forall l: list t. (forall e: t. Mem.mem e l -> mem e s) -> (length l > cardinal s) -> exists e: t, l1 l2 l3: list t. l = l1 ++ (Cons e (l2 ++ (Cons e l3))) clone set.FsetInduction with type t = t, predicate p = pigeon_set lemma corner: forall s: set t, l: list t. (length l = cardinal s) -> (forall e: t. Mem.mem e l -> mem e s) -> (exists e: t, l1 l2 l3: list t. l = l1 ++ (Cons e (l2 ++ (Cons e l3)))) \/ (forall e: t. mem e s -> Mem.mem e l) lemma pigeon_0: pigeon_set empty lemma pigeon_1: forall s: set t. pigeon_set s -> forall t: t. pigeon_set (add t s) lemma pigeon_2: forall s: set t. pigeon_set s lemma pigeonhole: forall s: set t, l: list t. (forall e: t. Mem.mem e l -> mem e s) -> (length l > cardinal s) -> exists e: t, l1 l2 l3: list t. l = l1 ++ (Cons e (l2 ++ (Cons e l3))) end why3-0.87.3/theories/regexp.why0000644000175000017500000000206113035416743017107 0ustar guillaumeguillaume (** {1 Theory of regular expressions} *) theory Regexp type char (** Syntax *) type regexp = | Empty | Epsilon | Char char | Alt regexp regexp | Concat regexp regexp | Star regexp (** Semantics *) (** Words are list of characters. *) use export list.List use export list.Append type word = list char (** Inductive predicate [mem w r] means ``word [w] belongs to the language of [r]''. *) inductive mem (w: word) (r: regexp) = | mem_eps: mem Nil Epsilon | mem_char: forall c: char. mem (Cons c Nil) (Char c) | mem_altl: forall w: word, r1 r2: regexp. mem w r1 -> mem w (Alt r1 r2) | mem_altr: forall w: word, r1 r2: regexp. mem w r2 -> mem w (Alt r1 r2) | mem_concat: forall w1 w2: word, r1 r2: regexp. mem w1 r1 -> mem w2 r2 -> mem (w1 ++ w2) (Concat r1 r2) | mems1: forall r: regexp. mem Nil (Star r) | mems2: forall w1 w2: word, r: regexp. mem w1 r -> mem w2 (Star r) -> mem (w1 ++ w2) (Star r) end why3-0.87.3/theories/set.why0000644000175000017500000002111113035416743016405 0ustar guillaumeguillaume (** {1 Set theories} *) (** {2 General Sets} *) theory SetGen type set 'a (** if ['a] is an infinite type, then [set 'a] is infinite *) meta "material_type_arg" type set, 0 (** membership *) predicate mem 'a (set 'a) (** equality *) predicate (==) (s1 s2: set 'a) = forall x : 'a. mem x s1 <-> mem x s2 axiom extensionality: forall s1 s2: set 'a. s1 == s2 -> s1 = s2 (** inclusion *) predicate subset (s1 s2: set 'a) = forall x : 'a. mem x s1 -> mem x s2 lemma subset_refl: forall s: set 'a. subset s s lemma subset_trans: forall s1 s2 s3: set 'a. subset s1 s2 -> subset s2 s3 -> subset s1 s3 (** empty set *) constant empty : set 'a predicate is_empty (s: set 'a) = forall x: 'a. not (mem x s) axiom empty_def1: is_empty (empty : set 'a) lemma mem_empty: forall x:'a. mem x empty <-> false (** addition *) function add 'a (set 'a) : set 'a axiom add_def1: forall x y: 'a. forall s: set 'a. mem x (add y s) <-> x = y \/ mem x s function singleton (x: 'a) : set 'a = add x empty (** removal *) function remove 'a (set 'a) : set 'a axiom remove_def1: forall x y : 'a, s : set 'a. mem x (remove y s) <-> x <> y /\ mem x s lemma add_remove: forall x: 'a, s : set 'a. mem x s -> add x (remove x s) = s lemma remove_add: forall x: 'a, s : set 'a. remove x (add x s) = remove x s lemma subset_remove: forall x: 'a, s: set 'a. subset (remove x s) s (** union *) function union (set 'a) (set 'a) : set 'a axiom union_def1: forall s1 s2: set 'a, x: 'a. mem x (union s1 s2) <-> mem x s1 \/ mem x s2 (** intersection *) function inter (set 'a) (set 'a) : set 'a axiom inter_def1: forall s1 s2: set 'a, x: 'a. mem x (inter s1 s2) <-> mem x s1 /\ mem x s2 (** difference *) function diff (set 'a) (set 'a) : set 'a axiom diff_def1: forall s1 s2: set 'a, x: 'a. mem x (diff s1 s2) <-> mem x s1 /\ not (mem x s2) lemma subset_diff: forall s1 s2: set 'a. subset (diff s1 s2) s1 (** arbitrary element *) function choose (s:set 'a) : 'a axiom choose_def: forall s: set 'a. not (is_empty s) -> mem (choose s) s end (** {2 Potentially infinite sets} *) theory Set clone export SetGen (** the set of all x of type 'a *) constant all: set 'a axiom all_def: forall x: 'a. mem x all end (** {2 Set Comprehension} *) theory SetComprehension use export Set use HighOrd as HO (** { x | p x } *) function comprehension (p: HO.pred 'a) : set 'a axiom comprehension_def: forall p: HO.pred 'a. forall x: 'a. mem x (comprehension p) <-> p x (** { x | x in U and p(x) } *) function filter (p: HO.pred 'a) (u: set 'a) : set 'a = comprehension (\ x: 'a. p x /\ mem x u) (** { f x | x in U } *) function map (f: HO.func 'a 'b) (u: set 'a) : set 'b = comprehension (\ y: 'b. exists x: 'a. mem x u /\ y = f x) lemma map_def: forall f: HO.func 'a 'b, u: set 'a. forall x: 'a. mem x u -> mem (f x) (map f u) end (** {2 Finite sets} *) theory Fset use import int.Int clone export SetGen function cardinal (set 'a) : int axiom cardinal_nonneg: forall s: set 'a. cardinal s >= 0 axiom cardinal_empty: forall s: set 'a. cardinal s = 0 <-> is_empty s axiom cardinal_add: forall x : 'a. forall s : set 'a. not (mem x s) -> cardinal (add x s) = 1 + cardinal s axiom cardinal_remove: forall x : 'a. forall s : set 'a. mem x s -> cardinal s = 1 + cardinal (remove x s) axiom cardinal_subset: forall s1 s2 : set 'a. subset s1 s2 -> cardinal s1 <= cardinal s2 lemma subset_eq: forall s1 s2 : set 'a. subset s1 s2 -> cardinal s1 = cardinal s2 -> s1 == s2 lemma cardinal1: forall s: set 'a. cardinal s = 1 -> forall x: 'a. mem x s -> x = choose s end (** {2 Finite Set Comprehension} *) theory FsetComprehension use export Fset use import int.Int use HighOrd as HO (** { x | x in U and p(x) } *) function filter (p: HO.pred 'a) (u: set 'a) : set 'a axiom filter_def: forall p: HO.pred 'a, u: set 'a. forall x: 'a. mem x (filter p u) <-> (p x /\ mem x u) lemma filter_cardinal: forall p: HO.pred 'a, u: set 'a. cardinal (filter p u) <= cardinal u (** { f x | x in U } *) function map (f: HO.func 'a 'b) (u: set 'a) : set 'b axiom map_def: forall f: HO.func 'a 'b, u: set 'a. forall y: 'b. mem y (map f u) <-> (exists x: 'a. mem x u /\ y = f x) lemma map_def1: forall f: HO.func 'a 'b, u: set 'a. forall x: 'a. mem x u -> mem (f x) (map f u) lemma map_cardinal: forall f: HO.func 'a 'b, u: set 'a. cardinal (map f u) <= cardinal u end (** {2 N-th element of a finite set} *) theory FsetNth use import int.Int use import Fset function nth (i: int) (s: set 'a) : 'a axiom nth_injective: forall s: set 'a, i j: int. 0 <= i < cardinal s -> 0 <= j < cardinal s -> nth i s = nth j s -> i = j axiom nth_surjective: forall s: set 'a, x: 'a. mem x s -> exists i: int. 0 <= i < cardinal s /\ x = nth i s end (** {2 Induction principle on finite sets} *) theory FsetInduction use import Fset type t predicate p (set t) lemma Induction : (forall s: set t. is_empty s -> p s) -> (forall s: set t. p s -> forall t: t. not (mem t s) -> p (add t s)) -> forall s: set t. p s end (** {2 Finite sets of integers} *) theory Fsetint use export int.Int use export Fset function min_elt (set int) : int axiom min_elt_def1: forall s: set int. not (is_empty s) -> mem (min_elt s) s axiom min_elt_def2: forall s: set int. forall x: int. mem x s -> min_elt s <= x function max_elt (set int) : int axiom max_elt_def1: forall s: set int. not (is_empty s) -> mem (max_elt s) s axiom max_elt_def2: forall s: set int. forall x: int. mem x s -> x <= max_elt s function interval int int : set int axiom interval_def: forall x l r: int. mem x (interval l r) <-> l <= x < r lemma cardinal_interval: forall l r: int. cardinal (interval l r) = if l <= r then r - l else 0 end (** {2 Finite set iterators} *) theory Min use import Fset use import int.Int type param type elt function cost param elt : int function min param (set elt) : int axiom min_is_a_lower_bound: forall p:param, s:set elt, x:elt. mem x s -> cost p x >= min p s axiom min_appears_in_set: forall p:param, s:set elt. not (is_empty s) -> exists x:elt. mem x s /\ cost p x = min p s end (** sum on finite set *) theory FsetSum "Sum of a function over a finite set" use import HighOrd use import int.Int use import Fset as S function sum (set 'a) ('a -> int) : int (** [sum s f] is the sum Sum_{S.mem x s} f x *) axiom Sum_def_empty : forall f. sum (S.empty: set 'a) f = 0 axiom Sum_add: forall s: set 'a. forall f x. not (mem x s) -> sum (S.add x s) f = sum s f + f x lemma Sum_remove: forall s: set 'a. forall f x. mem x s -> sum (S.remove x s) f = sum s f - f x lemma Sum_def_choose: forall s: set 'a. forall f. not (S.is_empty s) -> let x = S.choose s in sum s f = f x + sum (S.remove x s) f lemma Sum_transitivity: forall s1 s2: set 'a. forall f. sum (S.union s1 s2) f = sum s1 f + sum s2 f - sum (S.inter s1 s2) f lemma Sum_eq: forall s: set 'a. forall f g. (forall x. S.mem x s -> f x = g x) -> sum s f = sum s g end (** {2 Sets realized as maps} *) theory SetMap use import map.Map use import map.Const use import bool.Bool type set 'a = map 'a bool predicate mem (x:'a) (s:set 'a) = s[x] = True constant empty : set 'a = const False predicate is_empty (s : set 'a) = forall x : 'a. not (mem x s) goal Empty_def1 : is_empty(empty : set 'a) function add (x:'a) (s:set 'a) : set 'a = s[x <- True] function remove (x:'a) (s:set 'a) : set 'a = s[x <- False] function union (set 'a) (set 'a) : set 'a axiom Union_def : forall s1 s2 : set 'a. forall x : 'a. (union s1 s2)[x] = orb s1[x] s2[x] function inter (set 'a) (set 'a) : set 'a axiom Inter_def : forall s1 s2 : set 'a. forall x : 'a. (inter s1 s2)[x] = andb s1[x] s2[x] function diff (set 'a) (set 'a) : set 'a axiom Diff_def1 : forall s1 s2 : set 'a. forall x : 'a. (diff s1 s2)[x] = andb s1[x] (notb s2[x]) predicate equal(s1 s2 : set 'a) = forall x : 'a. s1[x] = s2[x] (* dubious axiom: extensionality should be postulated on maps instead axiom Equal_is_eq : forall s1 s2 : set 'a. equal s1 s2 -> s1 = s2 *) predicate subset(s1 s2 : set 'a) = forall x : 'a. mem x s1 -> mem x s2 function complement (set 'a) : set 'a axiom Complement_def : forall s : set 'a. forall x : 'a. (complement s)[x] = notb s[x] end why3-0.87.3/theories/real.why0000644000175000017500000002215513035416743016546 0ustar guillaumeguillaume (** {1 Theory of reals} This file provides the basic theory of real numbers, and several additional theories for classical real functions. *) (** {2 Real numbers and the basic unary and binary operators} *) theory Real constant zero : real = 0.0 constant one : real = 1.0 predicate (< ) real real predicate (> ) (x y : real) = y < x predicate (<=) (x y : real) = x < y \/ x = y clone export algebra.OrderedField with type t = real, constant zero = zero, constant one = one, predicate (<=) = (<=) (*** lemma sub_zero: forall x y:real. x - y = 0.0 -> x = y *) end (** {2 Alternative Infix Operators} This theory should be used instead of Real when one wants to use both integer and real binary operators. *) theory RealInfix use import Real function (+.) (x:real) (y:real) : real = x + y function (-.) (x:real) (y:real) : real = x - y function ( *.) (x:real) (y:real) : real = x * y function (/.) (x:real) (y:real) : real = x / y function (-._) (x:real) : real = - x function inv (x:real) : real = Real.inv x predicate (<=.) (x:real) (y:real) = x <= y predicate (>=.) (x:real) (y:real) = x >= y predicate ( <.) (x:real) (y:real) = x < y predicate ( >.) (x:real) (y:real) = x > y end (** {2 Absolute Value} *) theory Abs use import Real function abs(x : real) : real = if x >= 0.0 then x else -x lemma Abs_le: forall x y:real. abs x <= y <-> -y <= x <= y lemma Abs_pos: forall x:real. abs x >= 0.0 (*** lemma Abs_zero: forall x:real. abs x = 0.0 -> x = 0.0 *) lemma Abs_sum: forall x y:real. abs(x+y) <= abs x + abs y lemma Abs_prod: forall x y:real. abs(x*y) = abs x * abs y lemma triangular_inequality: forall x y z:real. abs(x-z) <= abs(x-y) + abs(y-z) end (** {2 Minimum and Maximum} *) theory MinMax use import Real clone export relations.MinMax with type t = real, predicate le = (<=), goal TotalOrder.Refl, goal TotalOrder.Trans, goal TotalOrder.Antisymm, goal TotalOrder.Total end (** {2 Injection of integers into reals} *) theory FromInt use int.Int use import Real function from_int int : real axiom Zero: from_int 0 = 0.0 axiom One: from_int 1 = 1.0 axiom Add: forall x y:int. from_int (Int.(+) x y) = from_int x + from_int y axiom Sub: forall x y:int. from_int (Int.(-) x y) = from_int x - from_int y axiom Mul: forall x y:int. from_int (Int.(*) x y) = from_int x * from_int y axiom Neg: forall x:int. from_int (Int.(-_) (x)) = - from_int x end (** {2 Various truncation functions} *) theory Truncate use import Real use import FromInt (** truncate: rounds towards zero *) function truncate real : int axiom Truncate_int : forall i:int. truncate (from_int i) = i axiom Truncate_down_pos: forall x:real. x >= 0.0 -> from_int (truncate x) <= x < from_int (Int.(+) (truncate x) 1) axiom Truncate_up_neg: forall x:real. x <= 0.0 -> from_int (Int.(-) (truncate x) 1) < x <= from_int (truncate x) axiom Real_of_truncate: forall x:real. x - 1.0 <= from_int (truncate x) <= x + 1.0 axiom Truncate_monotonic: forall x y:real. x <= y -> Int.(<=) (truncate x) (truncate y) axiom Truncate_monotonic_int1: forall x:real, i:int. x <= from_int i -> Int.(<=) (truncate x) i axiom Truncate_monotonic_int2: forall x:real, i:int. from_int i <= x -> Int.(<=) i (truncate x) (** roundings up and down *) function floor real : int function ceil real : int axiom Floor_int : forall i:int. floor (from_int i) = i axiom Ceil_int : forall i:int. ceil (from_int i) = i axiom Floor_down: forall x:real. from_int (floor x) <= x < from_int (Int.(+) (floor x) 1) axiom Ceil_up: forall x:real. from_int (Int.(-) (ceil x) 1) < x <= from_int (ceil x) axiom Floor_monotonic: forall x y:real. x <= y -> Int.(<=) (floor x) (floor y) axiom Ceil_monotonic: forall x y:real. x <= y -> Int.(<=) (ceil x) (ceil y) end (** {2 Square and Square Root} *) theory Square use import Real function sqr (x : real) : real = x * x function sqrt real : real axiom Sqrt_positive: forall x:real. x >= 0.0 -> sqrt x >= 0.0 axiom Sqrt_square: forall x:real. x >= 0.0 -> sqr (sqrt x) = x axiom Square_sqrt: forall x:real. x >= 0.0 -> sqrt (x*x) = x axiom Sqrt_mul: forall x y:real. x >= 0.0 /\ y >= 0.0 -> sqrt (x*y) = sqrt x * sqrt y axiom Sqrt_le : forall x y:real. 0.0 <= x <= y -> sqrt x <= sqrt y end (** {2 Exponential and Logarithm} *) theory ExpLog use import Real function exp real : real axiom Exp_zero : exp(0.0) = 1.0 axiom Exp_sum : forall x y:real. exp (x+y) = exp x * exp y constant e : real = exp 1.0 function log real : real axiom Log_one : log 1.0 = 0.0 axiom Log_mul : forall x y:real. x > 0.0 /\ y > 0.0 -> log (x*y) = log x + log y axiom Log_exp: forall x:real. log (exp x) = x axiom Exp_log: forall x:real. x > 0.0 -> exp (log x) = x function log2 (x : real) : real = log x / log 2.0 function log10 (x : real) : real = log x / log 10.0 end (** {2 Power of a real to an integer} *) theory PowerInt use import int.Int use import RealInfix clone export int.Exponentiation with type t = real, constant one = Real.one, function (*) = Real.(*), goal CommutativeMonoid.Assoc, goal CommutativeMonoid.Unit_def_l, goal CommutativeMonoid.Unit_def_r, goal CommutativeMonoid.Comm.Comm lemma Pow_ge_one: forall x:real, n:int. 0 <= n /\ 1.0 <=. x -> 1.0 <=. power x n end (** {2 Power of a real to a real exponent} *) theory PowerReal use import Real use import ExpLog function pow real real : real axiom Pow_def: forall x y:real. x > 0.0 -> pow x y = exp (y * log x) lemma Pow_pos: forall x y. x > 0.0 -> pow x y > 0.0 lemma Pow_plus : forall x y z. z > 0.0 -> pow z (x + y) = pow z x * pow z y lemma Pow_mult : forall x y z. x > 0.0 -> pow (pow x y) z = pow x (y * z) lemma Pow_x_zero: forall x:real. x > 0.0 -> pow x 0.0 = 1.0 lemma Pow_x_one: forall x:real. x > 0.0 -> pow x 1.0 = x lemma Pow_one_y: forall y:real. pow 1.0 y = 1.0 use import Square lemma Pow_x_two: forall x:real. x > 0.0 -> pow x 2.0 = sqr x lemma Pow_half: forall x:real. x > 0.0 -> pow x 0.5 = sqrt x end (** {2 Trigonometric Functions} See the {h wikipedia page}. *) theory Trigonometry use import Real use import Square use import Abs function cos real : real function sin real : real axiom Pythagorean_identity: forall x:real. sqr (cos x) + sqr (sin x) = 1.0 lemma Cos_le_one: forall x:real. abs (cos x) <= 1.0 lemma Sin_le_one: forall x:real. abs (sin x) <= 1.0 axiom Cos_0: cos 0.0 = 1.0 axiom Sin_0: sin 0.0 = 0.0 constant pi : real axiom Pi_double_precision_bounds: 0x1.921fb54442d18p+1 < pi < 0x1.921fb54442d19p+1 (* axiom Pi_interval: 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196 < pi < 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038197 *) axiom Cos_pi: cos pi = -1.0 axiom Sin_pi: sin pi = 0.0 axiom Cos_pi2: cos (0.5 * pi) = 0.0 axiom Sin_pi2: sin (0.5 * pi) = 1.0 axiom Cos_plus_pi: forall x:real. cos (x + pi) = - cos x axiom Sin_plus_pi: forall x:real. sin (x + pi) = - sin x axiom Cos_plus_pi2: forall x:real. cos (x + 0.5*pi) = - sin x axiom Sin_plus_pi2: forall x:real. sin (x + 0.5*pi) = cos x axiom Cos_neg: forall x:real. cos (-x) = cos x axiom Sin_neg: forall x:real. sin (-x) = - sin x axiom Cos_sum: forall x y:real. cos (x+y) = cos x * cos y - sin x * sin y axiom Sin_sum: forall x y:real. sin (x+y) = sin x * cos y + cos x * sin y function tan (x : real) : real = sin x / cos x function atan real : real axiom Tan_atan: forall x:real. tan (atan x) = x end (** {2 Hyperbolic Functions} See the {h wikipedia page}. *) theory Hyperbolic use import Real use import Square use import ExpLog function sinh (x : real) : real = 0.5 * (exp x - exp (-x)) function cosh (x : real) : real = 0.5 * (exp x + exp (-x)) function tanh (x : real) : real = sinh x / cosh x function asinh (x : real) : real = log (x + sqrt (sqr x + 1.0)) function acosh (x : real) : real axiom Acosh_def: forall x:real. x >= 1.0 -> acosh x = log (x + sqrt (sqr x - 1.0)) function atanh (x : real) : real axiom Atanh_def: forall x:real. -1.0 < x < 1.0 -> atanh x = 0.5 * log ((1.0+x)/(1.0-x)) end (** {2 Polar Coordinates} See the {h wikipedia page}. *) theory Polar use import Real use import Square use import Trigonometry function hypot (x y : real) : real = sqrt (sqr x + sqr y) function atan2 real real : real axiom X_from_polar: forall x y:real. x = hypot x y * cos (atan2 y x) axiom Y_from_polar: forall x y:real. y = hypot x y * sin (atan2 y x) end why3-0.87.3/theories/int.why0000644000175000017500000002716313035416743016421 0ustar guillaumeguillaume (** {1 Theory of integers} This file provides the basic theory of integers, and several additional theories for classical functions. *) (** {2 Integers and the basic operators} *) theory Int constant zero : int = 0 constant one : int = 1 predicate (< ) int int predicate (> ) (x y : int) = y < x predicate (<=) (x y : int) = x < y \/ x = y clone export algebra.OrderedUnitaryCommutativeRing with type t = int, constant zero = zero, constant one = one, predicate (<=) = (<=) end (** {2 Absolute Value} *) theory Abs use import Int function abs (x:int) : int = if x >= 0 then x else -x lemma Abs_le: forall x y:int. abs x <= y <-> -y <= x <= y lemma Abs_pos: forall x:int. abs x >= 0 (*** lemma Abs_zero: forall x:int. abs x = 0 -> x = 0 *) end (** {2 Minimum and Maximum} *) theory MinMax use import Int clone export relations.MinMax with type t = int, predicate le = (<=), goal TotalOrder.Refl, goal TotalOrder.Trans, goal TotalOrder.Antisymm, goal TotalOrder.Total end (** {2 The Basic Well-Founded Order on Integers} *) theory Lex2 use import Int predicate lt_nat (x y: int) = 0 <= y /\ x < y clone export relations.Lex with type t1 = int, type t2 = int, predicate rel1 = lt_nat, predicate rel2 = lt_nat end (** {2 Euclidean Division} Division and modulo operators with the convention that modulo is always non-negative. It implies that division rounds down when divisor is positive, and rounds up when divisor is negative. *) theory EuclideanDivision use import Int use import Abs function div int int : int function mod int int : int axiom Div_mod: forall x y:int. y <> 0 -> x = y * div x y + mod x y axiom Mod_bound: forall x y:int. y <> 0 -> 0 <= mod x y < abs y lemma Div_unique: forall x y q:int. y > 0 -> q * y <= x < q * y + y -> div x y = q lemma Div_bound: forall x y:int. x >= 0 /\ y > 0 -> 0 <= div x y <= x lemma Mod_1: forall x:int. mod x 1 = 0 lemma Div_1: forall x:int. div x 1 = x lemma Div_inf: forall x y:int. 0 <= x < y -> div x y = 0 lemma Div_inf_neg: forall x y:int. 0 < x <= y -> div (-x) y = -1 lemma Mod_0: forall y:int. y <> 0 -> mod 0 y = 0 lemma Div_1_left: forall y:int. y > 1 -> div 1 y = 0 lemma Div_minus1_left: forall y:int. y > 1 -> div (-1) y = -1 lemma Mod_1_left: forall y:int. y > 1 -> mod 1 y = 1 lemma Mod_minus1_left: forall y:int. y > 1 -> mod (-1) y = y - 1 lemma Div_mult: forall x y z:int [div (x * y + z) x]. x > 0 -> div (x * y + z) x = y + div z x lemma Mod_mult: forall x y z:int [mod (x * y + z) x]. x > 0 -> mod (x * y + z) x = mod z x end (** {2 Division by 2} The particular case of Euclidean division by 2 *) theory Div2 use import Int lemma div2: forall x: int. exists y: int. x = 2*y \/ x = 2*y+1 end (** {2 Computer Division} Division and modulo operators with the same conventions as mainstream programming language such as C, Java, OCaml, that is, division rounds towards zero, and thus [mod x y] has the same sign as x *) theory ComputerDivision use import Int use import Abs function div int int : int function mod int int : int axiom Div_mod: forall x y:int. y <> 0 -> x = y * div x y + mod x y axiom Div_bound: forall x y:int. x >= 0 /\ y > 0 -> 0 <= div x y <= x axiom Mod_bound: forall x y:int. y <> 0 -> - abs y < mod x y < abs y axiom Div_sign_pos: forall x y:int. x >= 0 /\ y > 0 -> div x y >= 0 axiom Div_sign_neg: forall x y:int. x <= 0 /\ y > 0 -> div x y <= 0 axiom Mod_sign_pos: forall x y:int. x >= 0 /\ y <> 0 -> mod x y >= 0 axiom Mod_sign_neg: forall x y:int. x <= 0 /\ y <> 0 -> mod x y <= 0 lemma Rounds_toward_zero: forall x y:int. y <> 0 -> abs (div x y * y) <= abs x lemma Div_1: forall x:int. div x 1 = x lemma Mod_1: forall x:int. mod x 1 = 0 lemma Div_inf: forall x y:int. 0 <= x < y -> div x y = 0 lemma Mod_inf: forall x y:int. 0 <= x < y -> mod x y = x lemma Div_mult: forall x y z:int [div (x * y + z) x]. x > 0 /\ y >= 0 /\ z >= 0 -> div (x * y + z) x = y + div z x lemma Mod_mult: forall x y z:int [mod (x * y + z) x]. x > 0 /\ y >= 0 /\ z >= 0 -> mod (x * y + z) x = mod z x end (** {2 Generic Exponentiation of something to an integer exponent} *) theory Exponentiation use import Int type t constant one : t function (*) t t : t clone algebra.CommutativeMonoid with type t = t, constant unit = one, function op = (*) function power t int : t axiom Power_0 : forall x: t. power x 0 = one axiom Power_s : forall x: t, n: int. n >= 0 -> power x (n+1) = x * power x n lemma Power_s_alt: forall x: t, n: int. n > 0 -> power x n = x * power x (n-1) lemma Power_1 : forall x : t. power x 1 = x lemma Power_sum : forall x: t, n m: int. 0 <= n -> 0 <= m -> power x (n+m) = power x n * power x m lemma Power_mult : forall x:t, n m : int. 0 <= n -> 0 <= m -> power x (Int.( * ) n m) = power (power x n) m lemma Power_mult2 : forall x y: t, n: int. 0 <= n -> power (x * y) n = power x n * power y n (* TODO use import ComputerDivision lemma Power_even : forall x:t, n:int. n >= 0 -> mod n 2 = 0 -> power x n = power (x*x) (div n 2) lemma power_odd : forall x:t, n:int. n >= 0 -> mod n 2 <> 0 -> power x n = x * power (x*x) (div n 2) *) end (** {2 Power of an integer to an integer } *) theory Power use import Int clone export Exponentiation with type t = int, constant one = one, function (*) = (*), goal CommutativeMonoid.Assoc, goal CommutativeMonoid.Unit_def_l, goal CommutativeMonoid.Unit_def_r, goal CommutativeMonoid.Comm.Comm lemma Power_non_neg: forall x y. x >= 0 /\ y >= 0 -> power x y >= 0 lemma Power_monotonic: forall x n m:int. 0 < x /\ 0 <= n <= m -> power x n <= power x m end (** {2 Number of integers satisfying a given predicate} *) theory NumOf use import Int use HighOrd use import Bool function numof (p: int -> bool) (a b: int) : int (** number of [n] such that [a <= n < b] and [p n] *) axiom Numof_empty : forall p: int -> bool, a b: int. b <= a -> numof p a b = 0 axiom Numof_right_no_add : forall p : int -> bool, a b : int. a < b -> not (p (b-1)) -> numof p a b = numof p a (b-1) axiom Numof_right_add : forall p : int -> bool, a b : int. a < b -> p (b-1) -> numof p a b = 1 + numof p a (b-1) lemma Numof_bounds : forall p : int -> bool, a b : int. a < b -> 0 <= numof p a b <= b - a (* direct when a>=b, by induction on b when a <= b *) lemma Numof_append : forall p : int -> bool, a b c : int. a <= b <= c -> numof p a c = numof p a b + numof p b c (* by induction on c *) lemma Numof_left_no_add : forall p : int -> bool, a b : int. a < b -> not p a -> numof p a b = numof p (a+1) b (* by Numof_append *) lemma Numof_left_add : forall p : int -> bool, a b : int. a < b -> p a -> numof p a b = 1 + numof p (a+1) b (* by Numof_append *) lemma Empty : forall p : int -> bool, a b : int. (forall n : int. a <= n < b -> not p n) -> numof p a b = 0 (* by induction on b *) lemma Full : forall p : int -> bool, a b : int. a <= b -> (forall n : int. a <= n < b -> p n) -> numof p a b = b - a (* by induction on b *) lemma numof_increasing: forall p : int -> bool, i j k : int. i <= j <= k -> numof p i j <= numof p i k (* by Numof_append and Numof_non_negative *) lemma numof_strictly_increasing: forall p: int -> bool, i j k l: int. i <= j <= k < l -> p k -> numof p i j < numof p i l (* by Numof_append and numof_increasing *) lemma numof_change_any: forall p1 p2: int -> bool, a b: int. (forall j: int. a <= j < b -> p1 j -> p2 j) -> numof p2 a b >= numof p1 a b lemma numof_change_some: forall p1 p2: int -> bool, a b i: int. a <= i < b -> (forall j: int. a <= j < b -> p1 j -> p2 j) -> not (p1 i) -> p2 i -> numof p2 a b > numof p1 a b lemma numof_change_equiv: forall p1 p2: int -> bool, a b: int. (forall j: int. a <= j < b -> p1 j <-> p2 j) -> numof p2 a b = numof p1 a b end (** {2 Sum} *) theory Sum use import Int use HighOrd function sum (a b: int) (f: int -> int) : int (** sum of [f n] for [a <= n < b] *) axiom sum_def1: forall f: int -> int, a b: int. b <= a -> sum a b f = 0 axiom sum_def2: forall f: int -> int, a b: int. a < b -> sum a b f = sum a (b - 1) f + f (b - 1) lemma sum_left: forall f: int -> int, a b: int. a < b -> sum a b f = f a + sum (a + 1) b f lemma sum_ext: forall f g: int -> int, a b: int. (forall i. a <= i < b -> f i = g i) -> sum a b f = sum a b g lemma sum_le: forall f g: int -> int, a b: int. (forall i. a <= i < b -> f i <= g i) -> sum a b f <= sum a b g lemma sum_nonneg: forall f: int -> int, a b: int. (forall i. a <= i < b -> 0 <= f i) -> 0 <= sum a b f lemma sum_decomp: forall f: int -> int, a b c: int. a <= b <= c -> sum a c f = sum a b f + sum b c f lemma sum_zero: forall f: int -> int, a b: int. (forall i. a <= i < b -> f i = 0) -> sum a b f = 0 end (** {2 Factorial function} *) theory Fact use import Int function fact int : int axiom fact0: fact 0 = 1 axiom factn: forall n:int. n >= 1 -> fact n = n * fact (n-1) (* in the new system it will be: let rec function fact (n:int) : int = requires { n >= 0 } variant { n } = if n = 0 then 1 else n * fact (n-1) with the semantics function fact int : int axiom fact_def : \forall n:int [fact n]. n >= 0 -> fact n = if n = 0 then 1 else n * fact (n-1) *) end (** {2 Generic iteration of a function} *) theory Iter use import Int type t function f t : t function iter int t : t (** [iter k x] is [f^k(x)] *) axiom iter_0: forall x: t. iter 0 x = x axiom iter_s: forall k: int, x: t. 0 < k -> iter k x = iter (k-1) (f x) lemma iter_1: forall x: t. iter 1 x = f x lemma iter_s2: forall k: int, x: t. 0 < k -> iter k x = f (iter (k-1) x) end (** {2 Integers extended with an infinite value} *) theory IntInf use import Int type t = Finite int | Infinite function add (x: t) (y: t) : t = match x with | Infinite -> Infinite | Finite x -> match y with | Infinite -> Infinite | Finite y -> Finite (x + y) end end predicate lt (x y: t) = match x with | Infinite -> false | Finite x -> match y with | Infinite -> true | Finite y -> x < y end end predicate le (x y: t) = lt x y \/ x = y clone export relations.TotalOrder with type t = t, predicate rel = le, lemma Refl, lemma Antisymm, lemma Trans, lemma Total end (** {2 Induction principle on integers} This theory can be cloned with the wanted predicate, to perform an induction, either on nonnegative integers, or more generally on integers greater or equal a given bound. *) theory SimpleInduction use import Int predicate p int axiom base: p 0 axiom induction_step: forall n:int. 0 <= n -> p n -> p (n+1) lemma SimpleInduction : forall n:int. 0 <= n -> p n end theory Induction use import Int predicate p int lemma Induction : (forall n:int. 0 <= n -> (forall k:int. 0 <= k < n -> p k) -> p n) -> forall n:int. 0 <= n -> p n constant bound : int lemma Induction_bound : (forall n:int. bound <= n -> (forall k:int. bound <= k < n -> p k) -> p n) -> forall n:int. bound <= n -> p n end theory Fibonacci "Fibonacci numbers" use import Int function fib int : int axiom fib0: fib 0 = 0 axiom fib1: fib 1 = 1 axiom fibn: forall n:int. n >= 2 -> fib n = fib (n-1) + fib (n-2) end why3-0.87.3/theories/seq.why0000644000175000017500000002350413035416743016412 0ustar guillaumeguillaume (** {1 Sequences} This file provides a basic theory of sequences. *) (** {2 Sequences and basic operations} *) theory Seq use import int.Int (** the polymorphic type of sequences *) type seq 'a (** [seq 'a] is an infinite type *) meta "infinite_type" type seq (** length *) function length (seq 'a) : int axiom length_nonnegative: forall s: seq 'a. 0 <= length s (** empty sequence *) constant empty : seq 'a axiom empty_length: length (empty: seq 'a) = 0 (** n-th element *) function get (seq 'a) int : 'a (** [get s i] is the ([i]+1)-th element of sequence [s] (the first element has index 0) *) function ([]) (s: seq 'a) (i: int) : 'a = get s i (** update *) function set (seq 'a) int 'a : seq 'a (** [set s i v] is a new sequence [u] such that [u[i] = v] and [u[j] = s[j]] otherwise *) axiom set_def1: forall s: seq 'a, i: int, v: 'a. 0 <= i < length s -> length (set s i v) = length s axiom set_def2: forall s: seq 'a, i: int, v: 'a. 0 <= i < length s -> get (set s i v) i = v axiom set_def3: forall s: seq 'a, i: int, v: 'a. 0 <= i < length s -> forall j: int. 0 <= j < length s -> j <> i -> get (set s i v) j = get s j function ([<-]) (s: seq 'a) (i: int) (v: 'a) : seq 'a = set s i v (** equality *) predicate (==) (s1 s2: seq 'a) = length s1 = length s2 && forall i: int. 0 <= i < length s1 -> s1[i] = s2[i] axiom extensionality: forall s1 s2: seq 'a. s1 == s2 -> s1 = s2 (** insertion of elements on both sides *) function cons 'a (seq 'a) : seq 'a axiom cons_length: forall x: 'a, s: seq 'a. length (cons x s) = 1 + length s axiom cons_get: forall x: 'a, s: seq 'a, i: int. 0 <= i <= length s -> (cons x s)[i] = if i = 0 then x else s[i-1] function snoc (seq 'a) 'a : seq 'a axiom snoc_length: forall s: seq 'a, x: 'a. length (snoc s x) = 1 + length s axiom snoc_get: forall s: seq 'a, x: 'a, i: int. 0 <= i <= length s -> (snoc s x)[i] = if i < length s then s[i] else x lemma snoc_last: forall s: seq 'a, x: 'a. (snoc s x)[length s] = x (** sub-sequence *) function ([_.._]) (seq 'a) int int : seq 'a (** [s[i..j]] is the sub-sequence of [s] from element [i] included to element [j] excluded *) axiom sub_length: forall s: seq 'a, i j: int. 0 <= i <= j <= length s -> length s[i..j] = j - i axiom sub_get: forall s: seq 'a, i j: int. 0 <= i <= j <= length s -> forall k: int. 0 <= k < j - i -> s[i..j][k] = s[i + k] function ([_..]) (s: seq 'a) (i: int) : seq 'a = s[i .. length s] function ([.._]) (s: seq 'a) (j: int) : seq 'a = s[0 .. j] (** concatenation *) function (++) (seq 'a) (seq 'a) : seq 'a axiom concat_length: forall s1 s2: seq 'a. length (s1 ++ s2) = length s1 + length s2 axiom concat_get1: forall s1 s2: seq 'a, i: int. 0 <= i < length s1 -> (s1 ++ s2)[i] = s1[i] axiom concat_get2: forall s1 s2: seq 'a, i: int. length s1 <= i < length s1 + length s2 -> (s1 ++ s2)[i] = s2[i - length s1] (** sequence comprehension *) use HighOrd function create (len: int) (f: int -> 'a) : seq 'a axiom create_length: forall len: int, f: int -> 'a. 0 <= len -> length (create len f) = len axiom create_get: forall len: int, f: int -> 'a, i: int. 0 <= i < len -> (create len f)[i] = f i end theory ToList use import int.Int use import Seq use import list.List function to_list (a: seq 'a) : list 'a axiom to_list_empty: to_list (empty: seq 'a) = (Nil: list 'a) axiom to_list_cons: forall s: seq 'a. 0 < length s -> to_list s = Cons s[0] (to_list s[1 ..]) use list.Length as ListLength lemma to_list_length: forall s: seq 'a. ListLength.length (to_list s) = length s use list.Nth as ListNth use import option.Option lemma to_list_nth: forall s: seq 'a, i: int. 0 <= i < length s -> ListNth.nth i (to_list s) = Some s[i] end theory Mem use import int.Int use import Seq predicate mem (x: 'a) (s: seq 'a) = exists i: int. 0 <= i < length s /\ s[i] = x end theory Distinct use import int.Int use import Seq predicate distinct (s : seq 'a) = forall i j. 0 <= i < length s -> 0 <= j < length s -> i <> j -> s[i] <> s[j] end theory Reverse use import int.Int use import Seq function reverse (s: seq 'a) : seq 'a = create (length s) (\ i. s[length s - 1 - i]) end theory ToFset use import int.Int use import Seq as S use import Mem as SM use import set.Fset function to_set (s: seq 'a) : set 'a axiom to_set_empty: to_set (S.empty: seq 'a) = (empty: set 'a) axiom to_set_add: forall s: seq 'a. length s > 0 -> to_set s = add s[0] (to_set s[1 ..]) lemma to_set_cardinal: forall s: seq 'a. cardinal (to_set s) <= length s lemma to_set_mem: forall s: seq 'a, e: 'a. SM.mem e s <-> mem e (to_set s) lemma to_set_snoc: forall s: seq 'a, x: 'a. to_set (snoc s x) = add x (to_set s) use import Distinct lemma to_set_cardinal_distinct: forall s: seq 'a. distinct s -> cardinal (to_set s) = length s end (** {2 Sorted Sequences} *) theory Sorted use import Seq use import int.Int type t predicate le t t clone relations.TotalOrder with type t = t, predicate rel = le predicate sorted_sub (s: seq t) (l u: int) = forall i1 i2. l <= i1 <= i2 < u -> le s[i1] s[i2] (** sorted_sub s l u is true whenever the sub-sequence s[l .. u-1] is sorted w.r.t. order relation le *) predicate sorted (s: seq t) = sorted_sub s 0 (length s) (** sorted s is true whenever the sequence s is sorted w.r.t le *) lemma sorted_cons: forall x: t, s: seq t. (forall i: int. 0 <= i < length s -> le x s[i]) /\ sorted s <-> sorted (cons x s) lemma sorted_append: forall s1 s2: seq t. (sorted s1 /\ sorted s2 /\ (forall i j: int. 0 <= i < length s1 /\ 0 <= j < length s2 -> le s1[i] s2[i])) <-> sorted (s1 ++ s2) lemma sorted_snoc: forall x: t, s: seq t. (forall i: int. 0 <= i < length s -> le s[i] x) /\ sorted s <-> sorted (snoc s x) end theory SortedInt (** sorted sequences of integers *) use import int.Int clone export Sorted with type t = int, predicate le = (<=) end (** {2 Number of occurences in a sequence} *) theory Occ use import int.Int use int.NumOf as N use import HighOrd use import Seq function occ (x: 'a) (s: seq 'a) (l u: int) : int = N.numof (\ i. s[i] = x) l u (* TODO: lemmas for cons, snoc, etc. *) lemma append_num_occ: forall x: 'a, s1 s2: seq 'a. let s = s1 ++ s2 in occ x s 0 (length s) = occ x s1 0 (length s1) + occ x s2 0 (length s2) end (** {2 Sequences Equality} *) theory SeqEq use import int.Int use import Seq predicate seq_eq_sub (s1 s2: seq 'a) (l u: int) = forall i. l <= i < u -> s1[i] = s2[i] end theory Exchange use import int.Int use import Seq predicate exchange (s1 s2: seq 'a) (i j: int) = length s1 = length s2 /\ 0 <= i < length s1 /\ 0 <= j < length s1 /\ s1[i] = s2[j] /\ s1[j] = s2[i] /\ (forall k:int. 0 <= k < length s1 -> k <> i -> k <> j -> s1[k] = s2[k]) lemma exchange_set : forall s: seq 'a, i j: int. 0 <= i < length s -> 0 <= j < length s -> exchange s s[i <- s[j]][j <- s[i]] i j end (** {2 Permutation of sequences} *) theory Permut use import int.Int use import Seq use import Occ use import SeqEq use export Exchange predicate permut (s1 s2: seq 'a) (l u: int) = length s1 = length s2 /\ 0 <= l <= length s1 /\ 0 <= u <= length s1 /\ forall v: 'a. occ v s1 l u = occ v s2 l u (** permut s1 s2 l u is true when the segment s1[l..u-1] is a permutation of the segment s2[l..u-1]. Values outside this range are ignored. *) predicate permut_sub (s1 s2: seq 'a) (l u: int) = seq_eq_sub s1 s2 0 l /\ permut s1 s2 l u /\ seq_eq_sub s1 s2 u (length s1) (** permut_sub s1 s2 l u is true when the segment s1[l..u-1] is a permutation of the segment s2[l..u-1] and values outside this range are equal. *) predicate permut_all (s1 s2: seq 'a) = length s1 = length s2 /\ permut s1 s2 0 (length s1) (** permut_all s1 s2 is true when sequence s1 is a permutation of sequence s2 *) lemma exchange_permut_sub: forall s1 s2: seq 'a, i j l u: int. exchange s1 s2 i j -> l <= i < u -> l <= j < u -> 0 <= l -> u <= length s1 -> permut_sub s1 s2 l u (** enlarge the interval *) lemma Permut_sub_weakening: forall s1 s2: seq 'a, l1 u1 l2 u2: int. permut_sub s1 s2 l1 u1 -> 0 <= l2 <= l1 -> u1 <= u2 <= length s1 -> permut_sub s1 s2 l2 u2 (** {2 Lemmas about permut} *) lemma permut_refl: forall s: seq 'a, l u: int. 0 <= l <= length s -> 0 <= u <= length s -> permut s s l u lemma permut_sym: forall s1 s2: seq 'a, l u: int. permut s1 s2 l u -> permut s2 s1 l u lemma permut_trans: forall s1 s2 s3: seq 'a, l u: int. permut s1 s2 l u -> permut s2 s3 l u -> permut s1 s3 l u lemma permut_exists: forall s1 s2: seq 'a, l u i: int. permut s1 s2 l u -> l <= i < u -> exists j: int. l <= j < u /\ s1[j] = s2[i] (** {2 Lemmas about permut_all} *) use import Mem lemma permut_all_mem: forall s1 s2: seq 'a. permut_all s1 s2 -> forall x. mem x s1 <-> mem x s2 lemma exchange_permut_all: forall s1 s2: seq 'a, i j: int. exchange s1 s2 i j -> permut_all s1 s2 end (* TODO / TO DISCUSS - reverse - what about s[i..j] when i..j is not a valid range? left undefined? empty sequence? - what about negative index e.g. s[-3..] for the last three elements? - a syntax for cons and snoc? - create: better name? move to a separate theory? - UNPLEASANT: we cannot write s[1..] because 1. is recognized as a float so we have to write s[1 ..] - UNPLEASANT: when using both arrays and sequences, the lack of overloading is a pain; see for instance vstte12_ring_buffer.mlw *) why3-0.87.3/theories/map.why0000644000175000017500000001357213035416743016403 0ustar guillaumeguillaume (** {1 Theory of maps} *) (** {2 Generic Maps} *) theory Map type map 'a 'b (** if ['b] is an infinite type, then [map 'a 'b] is infinite *) meta "material_type_arg" type map, 1 function get (map 'a ~'b) 'a : 'b function set (map 'a ~'b) 'a 'b : map 'a 'b (** syntactic sugar *) function ([]) (a : map 'a 'b) (i : 'a) : 'b = get a i function ([<-]) (a : map 'a 'b) (i : 'a) (v : 'b) : map 'a 'b = set a i v axiom Select_eq : forall m : map 'a 'b. forall a1 a2 : 'a. forall b : 'b [m[a1 <- b][a2]]. a1 = a2 -> m[a1 <- b][a2] = b axiom Select_neq : forall m : map 'a 'b. forall a1 a2 : 'a. forall b : 'b [m[a1 <- b][a2]]. a1 <> a2 -> m[a1 <- b][a2] = m[a2] end theory Const use import Map function const ~'b : map 'a 'b axiom Const : forall b:'b, a:'a. (const b)[a] = b end (** {2 Sorted Maps (indexed by integers)} *) theory MapSorted use import int.Int use import Map type elt predicate le elt elt predicate sorted_sub (a : map int elt) (l u : int) = forall i1 i2 : int. l <= i1 <= i2 < u -> le a[i1] a[i2] (** [sorted_sub a l u] is true whenever the array segment [a(l..u-1)] is sorted w.r.t order relation [le] *) end (** {2 Maps Equality (indexed by integers)} *) theory MapEq use import int.Int use import Map predicate map_eq_sub (a1 a2 : map int 'a) (l u : int) = forall i:int. l <= i < u -> a1[i] = a2[i] end theory MapExchange use import int.Int use import Map predicate exchange (a1 a2: map int 'a) (l u i j: int) = l <= i < u /\ l <= j < u /\ a1[i] = a2[j] /\ a1[j] = a2[i] /\ (forall k:int. l <= k < u -> k <> i -> k <> j -> a1[k] = a2[k]) lemma exchange_set : forall a: map int 'a, l u i j: int. l <= i < u -> l <= j < u -> exchange a a[i <- a[j]][j <- a[i]] l u i j end (** {2 Sum of elements of a map (indexed by integers)} *) theory MapSum use import int.Int use export Map (** [sum m l h] is the sum of [m[i]] for [l <= i < h] *) type container = map int int clone export sum.Sum with type container = container, function f = get end (** {2 Number of occurrences} *) (* TODO: we could define Occ using theory int.NumOf *) theory Occ use import int.Int use import Map function occ (v: 'a) (m: map int 'a) (l u: int) : int (** number of occurrences of v in m between l included and u excluded *) axiom occ_empty: forall v: 'a, m: map int 'a, l u: int. u <= l -> occ v m l u = 0 axiom occ_right_no_add: forall v: 'a, m: map int 'a, l u: int. l < u -> m[u-1] <> v -> occ v m l u = occ v m l (u-1) axiom occ_right_add: forall v: 'a, m: map int 'a, l u: int. l < u -> m[u-1] = v -> occ v m l u = 1 + occ v m l (u-1) lemma occ_bounds: forall v: 'a, m: map int 'a, l u: int. l <= u -> 0 <= occ v m l u <= u - l (* direct when l>=u, by induction on u when l <= u *) lemma occ_append: forall v: 'a, m: map int 'a, l mid u: int. l <= mid <= u -> occ v m l u = occ v m l mid + occ v m mid u (* by induction on u *) lemma occ_neq: forall v: 'a, m: map int 'a, l u: int. (forall i: int. l <= i < u -> m[i] <> v) -> occ v m l u = 0 (* by induction on u *) lemma occ_exists: forall v: 'a, m: map int 'a, l u: int. occ v m l u > 0 -> exists i: int. l <= i < u /\ m[i] = v lemma occ_pos: forall m: map int 'a, l u i: int. l <= i < u -> occ m[i] m l u > 0 lemma occ_eq: forall v: 'a, m1 m2: map int 'a, l u: int. (forall i: int. l <= i < u -> m1[i] = m2[i]) -> occ v m1 l u = occ v m2 l u (* by induction on u *) end theory MapPermut use import int.Int use import Map use import Occ predicate permut (m1 m2: map int 'a) (l u: int) = forall v: 'a. occ v m1 l u = occ v m2 l u lemma permut_trans: (* provable, yet useful *) forall a1 a2 a3 : map int 'a. forall l u : int. permut a1 a2 l u -> permut a2 a3 l u -> permut a1 a3 l u lemma permut_exists : forall a1 a2: map int 'a, l u i: int. permut a1 a2 l u -> l <= i < u -> exists j: int. l <= j < u /\ a1[j] = a2[i] end (** {2 Injectivity and surjectivity for maps (indexed by integers)} *) theory MapInjection use import int.Int use export Map predicate injective (a: map int int) (n: int) = forall i j: int. 0 <= i < n -> 0 <= j < n -> i <> j -> a[i] <> a[j] (** [injective a n] is true when [a] is an injection on the domain [(0..n-1)] *) predicate surjective (a: map int int) (n: int) = forall i: int. 0 <= i < n -> exists j: int. (0 <= j < n /\ a[j] = i) (** [surjective a n] is true when [a] is a surjection from [(0..n-1)] to [(0..n-1)] *) predicate range (a: map int int) (n: int) = forall i: int. 0 <= i < n -> 0 <= a[i] < n (** [range a n] is true when [a] maps the domain [(0..n-1)] into [(0..n-1)] *) lemma injective_surjective: forall a: map int int, n: int. injective a n -> range a n -> surjective a n (** main lemma: an injection on [(0..n-1)] that ranges into [(0..n-1)] is also a surjection *) use import Occ lemma injection_occ: forall m: map int int, n: int. injective m n <-> forall v:int. (occ v m 0 n <= 1) end (** {2 Parametric Maps} *) (* theory MapParam type idx type elt type map (** if ['b] is an infinite type, then [map 'a 'b] is infinite *) meta "material_type_arg" type map, 1 function get (map 'a ~'b) 'a : 'b function set (map 'a ~'b) 'a 'b : map 'a 'b (** syntactic sugar *) function ([]) (a : map 'a 'b) (i : 'a) : 'b = get a i function ([<-]) (a : map 'a 'b) (i : 'a) (v : 'b) : map 'a 'b = set a i v axiom Select_eq : forall m : map 'a 'b. forall a1 a2 : 'a. forall b : 'b [m[a1 <- b][a2]]. a1 = a2 -> m[a1 <- b][a2] = b axiom Select_neq : forall m : map 'a 'b. forall a1 a2 : 'a. forall b : 'b [m[a1 <- b][a2]]. a1 <> a2 -> m[a1 <- b][a2] = m[a2] function const ~'b : map 'a 'b axiom Const : forall b:'b, a:'a. (const b)[a] = b end *) why3-0.87.3/theories/number.why0000644000175000017500000001253413035416743017113 0ustar guillaumeguillaume (** {1 Number theory} *) (** {2 Parity properties} *) theory Parity use import int.Int predicate even (n: int) = exists k: int. n = 2 * k predicate odd (n: int) = exists k: int. n = 2 * k + 1 lemma even_or_odd: forall n: int. even n \/ odd n lemma even_not_odd: forall n: int. even n -> not (odd n) lemma odd_not_even: forall n: int. odd n -> not (even n) lemma even_odd: forall n: int. even n -> odd (n + 1) lemma odd_even: forall n: int. odd n -> even (n + 1) lemma even_even: forall n: int. even n -> even (n + 2) lemma odd_odd: forall n: int. odd n -> odd (n + 2) lemma even_2k: forall k: int. even (2 * k) lemma odd_2k1: forall k: int. odd (2 * k + 1) end (** {2 Divisibility} *) theory Divisibility use export int.Int predicate divides (d:int) (n:int) = exists q:int. n = q * d lemma divides_refl: forall n:int. divides n n lemma divides_1_n : forall n:int. divides 1 n lemma divides_0 : forall n:int. divides n 0 lemma divides_left : forall a b c: int. divides a b -> divides (c*a) (c*b) lemma divides_right: forall a b c: int. divides a b -> divides (a*c) (b*c) lemma divides_oppr: forall a b: int. divides a b -> divides a (-b) lemma divides_oppl: forall a b: int. divides a b -> divides (-a) b lemma divides_oppr_rev: forall a b: int. divides (-a) b -> divides a b lemma divides_oppl_rev: forall a b: int. divides a (-b) -> divides a b lemma divides_plusr: forall a b c: int. divides a b -> divides a c -> divides a (b + c) lemma divides_minusr: forall a b c: int. divides a b -> divides a c -> divides a (b - c) lemma divides_multl: forall a b c: int. divides a b -> divides a (c * b) lemma divides_multr: forall a b c: int. divides a b -> divides a (b * c) lemma divides_factorl: forall a b: int. divides a (b * a) lemma divides_factorr: forall a b: int. divides a (a * b) lemma divides_n_1: forall n: int. divides n 1 -> n = 1 \/ n = -1 lemma divides_antisym: forall a b: int. divides a b -> divides b a -> a = b \/ a = -b lemma divides_trans: forall a b c: int. divides a b -> divides b c -> divides a c use import int.Abs lemma divides_bounds: forall a b: int. divides a b -> b <> 0 -> abs a <= abs b use int.EuclideanDivision lemma mod_divides_euclidean: forall a b: int. b <> 0 -> EuclideanDivision.mod a b = 0 -> divides b a lemma divides_mod_euclidean: forall a b: int. b <> 0 -> divides b a -> EuclideanDivision.mod a b = 0 use int.ComputerDivision lemma mod_divides_computer: forall a b: int. b <> 0 -> ComputerDivision.mod a b = 0 -> divides b a lemma divides_mod_computer: forall a b: int. b <> 0 -> divides b a -> ComputerDivision.mod a b = 0 use import Parity lemma even_divides: forall a: int. even a <-> divides 2 a lemma odd_divides: forall a: int. odd a <-> not (divides 2 a) end (** {2 Greateast Common Divisor} *) theory Gcd use export int.Int use import Divisibility function gcd int int : int axiom gcd_nonneg: forall a b: int. 0 <= gcd a b axiom gcd_def1 : forall a b: int. divides (gcd a b) a axiom gcd_def2 : forall a b: int. divides (gcd a b) b axiom gcd_def3 : forall a b x: int. divides x a -> divides x b -> divides x (gcd a b) axiom gcd_unique: forall a b d: int. 0 <= d -> divides d a -> divides d b -> (forall x: int. divides x a -> divides x b -> divides x d) -> d = gcd a b (* gcd is associative commutative *) clone algebra.AC with type t = int, function op = gcd, lemma Comm.Comm, lemma Assoc lemma gcd_0_pos: forall a: int. 0 <= a -> gcd a 0 = a lemma gcd_0_neg: forall a: int. a < 0 -> gcd a 0 = -a lemma gcd_opp: forall a b: int. gcd a b = gcd (-a) b lemma gcd_euclid: forall a b q: int. gcd a b = gcd a (b - q * a) use int.ComputerDivision lemma Gcd_computer_mod: forall a b: int [gcd b (ComputerDivision.mod a b)]. b <> 0 -> gcd b (ComputerDivision.mod a b) = gcd a b use int.EuclideanDivision lemma Gcd_euclidean_mod: forall a b: int [gcd b (EuclideanDivision.mod a b)]. b <> 0 -> gcd b (EuclideanDivision.mod a b) = gcd a b lemma gcd_mult: forall a b c: int. 0 <= c -> gcd (c * a) (c * b) = c * gcd a b end (** {2 Prime numbers} *) theory Prime use export int.Int use import Divisibility predicate prime (p: int) = 2 <= p /\ forall n: int. 1 < n < p -> not (divides n p) lemma not_prime_1: not (prime 1) lemma prime_2 : prime 2 lemma prime_3 : prime 3 lemma prime_divisors: forall p: int. prime p -> forall d: int. divides d p -> d = 1 \/ d = -1 \/ d = p \/ d = -p lemma small_divisors: forall p: int. 2 <= p -> (forall d: int. 2 <= d -> prime d -> 1 < d*d <= p -> not (divides d p)) -> prime p use import Parity lemma even_prime: forall p: int. prime p -> even p -> p = 2 lemma odd_prime: forall p: int. prime p -> p >= 3 -> odd p end (** {2 Coprime numbers} *) theory Coprime use export int.Int use import Divisibility use import Gcd predicate coprime (a b: int) = gcd a b = 1 use import Prime lemma prime_coprime: forall p: int. prime p <-> 2 <= p && forall n:int. 1 <= n < p -> coprime n p lemma Gauss: forall a b c:int. divides a (b*c) /\ coprime a b -> divides a c lemma Euclid: forall p a b:int. prime p /\ divides p (a*b) -> divides p a \/ divides p b lemma gcd_coprime: forall a b c. coprime a b -> gcd a (b*c) = gcd a c end why3-0.87.3/theories/list.why0000644000175000017500000002644213035416743016601 0ustar guillaumeguillaume (** {1 Polymorphic Lists} *) (** {2 Basic theory of polymorphic lists} *) theory List type list 'a = Nil | Cons 'a (list 'a) end (** {2 Length of a list} *) theory Length use import int.Int use import List function length (l: list 'a) : int = match l with | Nil -> 0 | Cons _ r -> 1 + length r end lemma Length_nonnegative: forall l: list 'a. length l >= 0 lemma Length_nil: forall l: list 'a. length l = 0 <-> l = Nil end (** {2 Membership in a list} *) theory Mem use import List predicate mem (x: 'a) (l: list 'a) = match l with | Nil -> false | Cons y r -> x = y \/ mem x r end end theory Elements use import List use Mem use set.Fset as FSet function elements (list 'a) : FSet.set 'a axiom elements_mem: forall l:list 'a, x:'a. Mem.mem x l <-> FSet.mem x (elements l) lemma elements_Nil: elements (Nil : list 'a) = FSet.empty end (** {2 Nth element of a list} *) theory Nth use import List use import option.Option use import int.Int function nth (n: int) (l: list 'a) : option 'a = match l with | Nil -> None | Cons x r -> if n = 0 then Some x else nth (n - 1) r end end theory NthNoOpt use import List use import int.Int function nth (n: int) (l: list 'a) : 'a axiom nth_cons_0: forall x:'a, r:list 'a. nth 0 (Cons x r) = x axiom nth_cons_n: forall x:'a, r:list 'a, n:int. n > 0 -> nth n (Cons x r) = nth (n-1) r end theory NthLength use import int.Int use import option.Option use import List use export Nth use export Length lemma nth_none_1: forall l: list 'a, i: int. i < 0 -> nth i l = None lemma nth_none_2: forall l: list 'a, i: int. i >= length l -> nth i l = None lemma nth_none_3: forall l: list 'a, i: int. nth i l = None -> i < 0 \/ i >= length l end (** {2 Head and tail} *) theory HdTl use import List use import option.Option function hd (l: list 'a) : option 'a = match l with | Nil -> None | Cons h _ -> Some h end function tl (l: list 'a) : option (list 'a) = match l with | Nil -> None | Cons _ t -> Some t end end theory HdTlNoOpt use import List function hd (l: list 'a) : 'a axiom hd_cons: forall x:'a, r:list 'a. hd (Cons x r) = x function tl (l: list 'a) : list 'a axiom tl_cons: forall x:'a, r:list 'a. tl (Cons x r) = r end (** {2 Relation between head, tail, and nth} *) theory NthHdTl use import int.Int use import option.Option use import List use import Nth use import HdTl lemma Nth_tl: forall l1 l2: list 'a. tl l1 = Some l2 -> forall i: int. i <> -1 -> nth i l2 = nth (i+1) l1 lemma Nth0_head: forall l: list 'a. nth 0 l = hd l end (** {2 Appending two lists} *) theory Append use import List function (++) (l1 l2: list 'a) : list 'a = match l1 with | Nil -> l2 | Cons x1 r1 -> Cons x1 (r1 ++ l2) end lemma Append_assoc: forall l1 "induction" l2 l3: list 'a. l1 ++ (l2 ++ l3) = (l1 ++ l2) ++ l3 lemma Append_l_nil: forall l: list 'a. l ++ Nil = l use import Length use import int.Int lemma Append_length: forall l1 "induction" l2: list 'a. length (l1 ++ l2) = length l1 + length l2 use import Mem lemma mem_append: forall x: 'a, l1 "induction" l2: list 'a. mem x (l1 ++ l2) <-> mem x l1 \/ mem x l2 lemma mem_decomp: forall x: 'a, l: list 'a. mem x l -> exists l1 l2: list 'a. l = l1 ++ Cons x l2 end theory NthLengthAppend use import int.Int use import List use export NthLength use export Append lemma nth_append_1: forall l1 l2: list 'a, i: int. i < length l1 -> nth i (l1 ++ l2) = nth i l1 lemma nth_append_2: forall l1 "induction" l2: list 'a, i: int. length l1 <= i -> nth i (l1 ++ l2) = nth (i - length l1) l2 end (** {2 Reversing a list} *) theory Reverse use import List use import Append function reverse (l: list 'a) : list 'a = match l with | Nil -> Nil | Cons x r -> reverse r ++ Cons x Nil end lemma reverse_append: forall l1 l2: list 'a, x: 'a. (reverse (Cons x l1)) ++ l2 = (reverse l1) ++ (Cons x l2) lemma reverse_cons: forall l: list 'a, x: 'a. reverse (Cons x l) = reverse l ++ Cons x Nil lemma cons_reverse: forall l: list 'a, x: 'a. Cons x (reverse l) = reverse (l ++ Cons x Nil) lemma reverse_reverse: forall l: list 'a. reverse (reverse l) = l use import Mem lemma reverse_mem: forall l: list 'a, x: 'a. mem x l <-> mem x (reverse l) use import Length lemma Reverse_length: forall l: list 'a. length (reverse l) = length l end (** {2 Reverse append} *) theory RevAppend use import List function rev_append (s t: list 'a) : list 'a = match s with | Cons x r -> rev_append r (Cons x t) | Nil -> t end use import Append lemma rev_append_append_l: forall r "induction" s t: list 'a. rev_append (r ++ s) t = rev_append s (rev_append r t) use import int.Int use import Length lemma rev_append_length: forall s "induction" t: list 'a. length (rev_append s t) = length s + length t use import Reverse lemma rev_append_def: forall r "induction" s: list 'a. rev_append r s = reverse r ++ s lemma rev_append_append_r: forall r s t: list 'a. rev_append r (s ++ t) = rev_append (rev_append s r) t end (** {2 Zip} *) theory Combine use import List function combine (x: list 'a) (y: list 'b) : list ('a, 'b) = match x, y with | Cons x0 x, Cons y0 y -> Cons (x0, y0) (combine x y) | _ -> Nil end end (** {2 Sorted lists for some order as parameter} *) theory Sorted use import List type t predicate le t t clone relations.Transitive with type t = t, predicate rel = le inductive sorted (l: list t) = | Sorted_Nil: sorted Nil | Sorted_One: forall x: t. sorted (Cons x Nil) | Sorted_Two: forall x y: t, l: list t. le x y -> sorted (Cons y l) -> sorted (Cons x (Cons y l)) use import Mem lemma sorted_mem: forall x: t, l: list t. (forall y: t. mem y l -> le x y) /\ sorted l <-> sorted (Cons x l) use import Append lemma sorted_append: forall l1 "induction" l2: list t. (sorted l1 /\ sorted l2 /\ (forall x y: t. mem x l1 -> mem y l2 -> le x y)) <-> sorted (l1 ++ l2) end (** {2 Sorted lists of integers} *) theory SortedInt use import int.Int clone export Sorted with type t = int, predicate le = (<=), goal Transitive.Trans end theory RevSorted type t predicate le t t clone import relations.Transitive with type t = t, predicate rel = le predicate ge (x y: t) = le y x use import List clone Sorted as Incr with type t = t, predicate le = le, goal Transitive.Trans clone Sorted as Decr with type t = t, predicate le = ge, goal Transitive.Trans predicate compat (s t: list t) = match s, t with | Cons x _, Cons y _ -> le x y | _, _ -> true end use import RevAppend lemma rev_append_sorted_incr: forall s "induction" t: list t. Incr.sorted (rev_append s t) <-> Decr.sorted s /\ Incr.sorted t /\ compat s t lemma rev_append_sorted_decr: forall s "induction" t: list t. Decr.sorted (rev_append s t) <-> Incr.sorted s /\ Decr.sorted t /\ compat t s end (** {2 Number of occurrences in a list} *) theory NumOcc use import int.Int use import List function num_occ (x: 'a) (l: list 'a) : int = match l with | Nil -> 0 | Cons y r -> (if x = y then 1 else 0) + num_occ x r end (** number of occurrences of [x] in [l] *) lemma Num_Occ_NonNeg: forall x:'a, l: list 'a. num_occ x l >= 0 use import Mem lemma Mem_Num_Occ : forall x: 'a, l: list 'a. mem x l <-> num_occ x l > 0 use import Append lemma Append_Num_Occ : forall x: 'a, l1 "induction" l2: list 'a. num_occ x (l1 ++ l2) = num_occ x l1 + num_occ x l2 use import Reverse lemma reverse_num_occ : forall x: 'a, l: list 'a. num_occ x l = num_occ x (reverse l) end (** {2 Permutation of lists} *) theory Permut use import NumOcc use import List predicate permut (l1: list 'a) (l2: list 'a) = forall x: 'a. num_occ x l1 = num_occ x l2 lemma Permut_refl: forall l: list 'a. permut l l lemma Permut_sym: forall l1 l2: list 'a. permut l1 l2 -> permut l2 l1 lemma Permut_trans: forall l1 l2 l3: list 'a. permut l1 l2 -> permut l2 l3 -> permut l1 l3 lemma Permut_cons: forall x: 'a, l1 l2: list 'a. permut l1 l2 -> permut (Cons x l1) (Cons x l2) lemma Permut_swap: forall x y: 'a, l: list 'a. permut (Cons x (Cons y l)) (Cons y (Cons x l)) use import Append lemma Permut_cons_append: forall x : 'a, l1 l2 : list 'a. permut (Cons x l1 ++ l2) (l1 ++ Cons x l2) lemma Permut_assoc: forall l1 l2 l3: list 'a. permut ((l1 ++ l2) ++ l3) (l1 ++ (l2 ++ l3)) lemma Permut_append: forall l1 l2 k1 k2 : list 'a. permut l1 k1 -> permut l2 k2 -> permut (l1 ++ l2) (k1 ++ k2) lemma Permut_append_swap: forall l1 l2 : list 'a. permut (l1 ++ l2) (l2 ++ l1) use import Mem lemma Permut_mem: forall x: 'a, l1 l2: list 'a. permut l1 l2 -> mem x l1 -> mem x l2 use import Length lemma Permut_length: forall l1 l2: list 'a. permut l1 l2 -> length l1 = length l2 end (** {2 List with pairwise distinct elements} *) theory Distinct use import List use import Mem inductive distinct (l: list 'a) = | distinct_zero: distinct (Nil: list 'a) | distinct_one : forall x:'a. distinct (Cons x Nil) | distinct_many: forall x:'a, l: list 'a. not (mem x l) -> distinct l -> distinct (Cons x l) use import Append lemma distinct_append: forall l1 "induction" l2: list 'a. distinct l1 -> distinct l2 -> (forall x:'a. mem x l1 -> not (mem x l2)) -> distinct (l1 ++ l2) end theory Prefix use import List use import int.Int function prefix (n: int) (l: list 'a) : list 'a = if n <= 0 then Nil else match l with | Nil -> Nil | Cons x r -> Cons x (prefix (n-1) r) end end theory Sum use import List use import int.Int function sum (l: list int) : int = match l with | Nil -> 0 | Cons x r -> x + sum r end end (** {2 Induction on lists} *) theory Induction use import List type elt predicate p (list elt) axiom Induction: p (Nil: list elt) -> (forall x:elt. forall l:list elt. p l -> p (Cons x l)) -> forall l:list elt. p l end (** {2 Maps as lists of pairs} *) theory Map use import List type a type b function f a : b function map (l: list a) : list b = match l with | Nil -> Nil | Cons x r -> Cons (f x) (map r) end end (** {2 Generic recursors on lists} *) theory FoldLeft use import List type a type b function f b a : b function fold_left (acc: b) (l: list a) : b = match l with | Nil -> acc | Cons x r -> fold_left (f acc x) r end end theory FoldRight use import List type a type b function f a b : b function fold_right (l: list a) (acc: b) : b = match l with | Nil -> acc | Cons x r -> f x (fold_right r acc) end end (** {2 Importation of all list theories in one} *) theory ListRich use export List use export Length use export Mem use export Nth use export HdTl use export NthHdTl use export Append use export Reverse use export RevAppend use export NumOcc use export Permut end why3-0.87.3/theories/function.why0000644000175000017500000000077713035416743017456 0ustar guillaumeguillaumetheory Injective type a type v function to_ a : v function from v : a axiom Inj : forall x : a. from(to_ x) = x goal G1 : forall x y : a. to_(x)=to_(y) -> x = y goal G2 : forall y : a. exists x : v. from(x)=y end theory Surjective type a type v function to_ a : v function from v : a clone export Injective with type v = a, type a = v, function to_ = from, function from = to_ end theory Bijective clone export Injective clone Surjective as S with namespace . = . end why3-0.87.3/theories/bintree.why0000644000175000017500000000535313035416743017254 0ustar guillaumeguillaume (** {1 Polymorphic binary trees with elements at nodes} *) theory Tree type tree 'a = Empty | Node (tree 'a) 'a (tree 'a) end theory Size "number of nodes" use import Tree use import int.Int function size (t: tree 'a) : int = match t with | Empty -> 0 | Node l _ r -> 1 + size l + size r end lemma size_nonneg: forall t: tree 'a. 0 <= size t lemma size_empty: forall t: tree 'a. 0 = size t <-> t = Empty end theory Occ "occurrences in a binary tree" use import Tree use import int.Int function occ (x: 'a) (t: tree 'a) : int = match t with | Empty -> 0 | Node l y r -> (if y = x then 1 else 0) + occ x l + occ x r end lemma occ_nonneg: forall x: 'a, t: tree 'a. 0 <= occ x t predicate mem (x: 'a) (t: tree 'a) = 0 < occ x t end theory Height "height of a tree" use import Tree use import int.Int use import int.MinMax function height (t: tree 'a) : int = match t with | Empty -> 0 | Node l _ r -> 1 + max (height l) (height r) end lemma height_nonneg: forall t: tree 'a. 0 <= height t end theory Inorder "inorder traversal" use import Tree use import list.List use import list.Append function inorder (t: tree 'a) : list 'a = match t with | Empty -> Nil | Node l x r -> inorder l ++ Cons x (inorder r) end end theory Preorder "preorder traversal" use import Tree use import list.List use import list.Append function preorder (t: tree 'a) : list 'a = match t with | Empty -> Nil | Node l x r -> Cons x (preorder l ++ preorder r) end end theory InorderLength use import Tree use import Size use import Inorder use import list.List use import list.Length lemma inorder_length: forall t: tree 'a. length (inorder t) = size t end theory Zipper "Huet's zipper" use import Tree type zipper 'a = | Top | Left (zipper 'a) 'a (tree 'a) | Right (tree 'a) 'a (zipper 'a) function zip (t: tree 'a) (z: zipper 'a) : tree 'a = match z with | Top -> t | Left z x r -> zip (Node t x r) z | Right l x z -> zip (Node l x t) z end (* navigating in a tree using a zipper *) type pointed 'a = (tree 'a, zipper 'a) function start (t: tree 'a) : pointed 'a = (t, Top) function up (p: pointed 'a) : pointed 'a = match p with | _, Top -> p (* do nothing *) | l, Left z x r | r, Right l x z -> (Node l x r, z) end function top (p: pointed 'a) : tree 'a = let t, z = p in zip t z function down_left (p: pointed 'a) : pointed 'a = match p with | Empty, _ -> p (* do nothing *) | Node l x r, z -> (l, Left z x r) end function down_right (p: pointed 'a) : pointed 'a = match p with | Empty, _ -> p (* do nothing *) | Node l x r, z -> (r, Right l x z) end end why3-0.87.3/theories/bool.why0000644000175000017500000000153213035416743016552 0ustar guillaumeguillaume (** {1 Booleans} *) (** {2 Basic theory of Booleans} *) theory Bool use export Bool (* built-in theory of Booleans *) function andb (x y : bool) : bool = match x with | True -> y | False -> False end function orb (x y : bool) : bool = match x with | False -> y | True -> True end function notb (x : bool) : bool = match x with | False -> True | True -> False end function xorb (x y : bool) : bool = match x with | False -> y | True -> notb y end function implb (x y : bool) : bool = match x with | False -> True | True -> y end end (** {2 Operator if-then-else} *) theory Ite use import Bool (* this is the previously declared local theory *) function ite (b:bool) (x y : 'a) : 'a = match b with | True -> x | False -> y end end why3-0.87.3/theories/tptp.why0000644000175000017500000000752213035416743016613 0ustar guillaumeguillaumetheory Univ type iType end theory Ghost type gh 'a constant gh : gh 'a end theory Int use export int.Int end theory IntTrunc function floor (x : int) : int = x function ceiling (x : int) : int = x function truncate (x : int) : int = x function round (x : int) : int = x function to_int (x : int) : int = x predicate is_int int = true predicate is_rat int = true end theory IntDivE use export int.EuclideanDivision end theory IntDivT (* TODO: divide and truncate *) function div_t (x y : int) : int function mod_t (x y : int) : int end theory IntDivF (* TODO: divide and floor *) function div_f (x y : int) : int function mod_f (x y : int) : int end theory Rat use int.Int type rat predicate (< ) (x y : rat) predicate (> ) (x y : rat) = y < x predicate (<=) (x y : rat) = x < y \/ x = y clone export algebra.OrderedField with type t = rat, predicate (<=) = (<=) function frac (n d : int) : rat function numerator rat : int function denominator rat : int axiom inversion : forall r : rat. r = frac (numerator r) (denominator r) axiom dpositive : forall r : rat. Int.(>) (denominator r) 0 axiom frac_zero : forall d : int. d <> 0 -> frac 0 d = zero axiom frac_unit : forall d : int. d <> 0 -> frac d d = one axiom nume_zero : numerator zero = 0 axiom deno_zero : denominator zero = 1 axiom nume_unit : numerator one = 1 axiom deno_unit : denominator one = 1 axiom proportion : forall n1 n2 d1 d2 : int. d1 <> 0 -> d2 <> 0 -> (frac n1 d1 = frac n2 d2 <-> Int.(*) n1 d2 = Int.(*) n2 d1) function to_rat (x : rat) : rat = x predicate is_int (r : rat) = denominator r = 1 predicate is_rat rat = true end theory RatTrunc use import Rat (* TODO: axiomatize *) function floor (x : rat) : rat function ceiling (x : rat) : rat function truncate (x : rat) : rat function round (x : rat) : rat function to_int (x : rat) : int = numerator (floor x) end theory RatDivE use import Rat (* TODO: euclidean division *) function div (x y : rat) : rat function mod (x y : rat) : rat end theory RatDivT use import Rat (* TODO: divide and truncate *) function div_t (x y : rat) : rat function mod_t (x y : rat) : rat end theory RatDivF use import Rat (* TODO: divide and floor *) function div_f (x y : rat) : rat function mod_f (x y : rat) : rat end theory Real use export real.Real function to_real (x : real) : real = x end theory RealTrunc use import Real use real.FromInt use real.Truncate function floor (x : real) : real = FromInt.from_int (Truncate.floor x) function ceiling (x : real) : real = FromInt.from_int (Truncate.ceil x) function truncate (x : real) : real = FromInt.from_int (Truncate.truncate x) (* TODO : axiomatize *) function round (x : real) : real function to_int (x : real) : int = Truncate.floor x predicate is_int (r : real) = r = FromInt.from_int (Truncate.truncate r) predicate is_rat (r : real) = exists n d : int. d <> 0 /\ r * FromInt.from_int d = FromInt.from_int n end theory RealDivE (* TODO: euclidean division *) function div (x y : real) : real function mod (x y : real) : real end theory RealDivT (* TODO: divide and truncate *) function div_t (x y : real) : real function mod_t (x y : real) : real end theory RealDivF (* TODO: divide and floor *) function div_f (x y : real) : real function mod_f (x y : real) : real end theory IntToRat use import Rat function to_rat (x : int) : rat = frac x 1 end theory IntToReal use real.FromInt function to_real (x : int) : real = FromInt.from_int x end theory RealToRat use import Rat (* TODO: axiomatize *) function to_rat (x : real) : rat end theory RatToReal use import Rat use import real.Real use real.FromInt function to_real (x : rat) : real = FromInt.from_int (numerator x) / FromInt.from_int (denominator x) end why3-0.87.3/theories/relations.why0000644000175000017500000000677313035416743017633 0ustar guillaumeguillaume (** {1 Relations} *) (** {2 Relations and orders} *) theory EndoRelation type t predicate rel t t end theory Reflexive clone export EndoRelation axiom Refl : forall x:t. rel x x end theory Irreflexive clone export EndoRelation axiom Strict : forall x:t. not rel x x end theory Transitive clone export EndoRelation axiom Trans : forall x y z:t. rel x y -> rel y z -> rel x z end theory Symmetric clone export EndoRelation axiom Symm : forall x y:t. rel x y -> rel y x end theory Asymmetric clone export EndoRelation axiom Asymm : forall x y:t. rel x y -> not rel y x end theory Antisymmetric clone export EndoRelation axiom Antisymm : forall x y:t. rel x y -> rel y x -> x = y end theory Total clone export EndoRelation axiom Total : forall x y:t. rel x y \/ rel y x end theory PreOrder clone export Reflexive clone export Transitive with type t = t, predicate rel = rel end theory Equivalence clone export PreOrder clone export Symmetric with type t = t, predicate rel = rel end theory TotalPreOrder clone export PreOrder clone export Total with type t = t, predicate rel = rel end theory PartialOrder clone export PreOrder clone export Antisymmetric with type t = t, predicate rel = rel end theory TotalOrder clone export PartialOrder clone export Total with type t = t, predicate rel = rel end theory PartialStrictOrder clone export Transitive clone export Asymmetric with type t = t, predicate rel = rel end theory TotalStrictOrder clone export PartialStrictOrder axiom Trichotomy : forall x y:t. rel x y \/ rel y x \/ x = y end theory Inverse clone export EndoRelation predicate inv_rel (x y : t) = rel y x end (** {2 Closures} *) theory ReflClosure clone export EndoRelation inductive relR t t = | BaseRefl : forall x:t. relR x x | StepRefl : forall x y:t. rel x y -> relR x y end theory TransClosure clone export EndoRelation inductive relT t t = | BaseTrans : forall x y:t. rel x y -> relT x y | StepTrans : forall x y z:t. relT x y -> rel y z -> relT x z lemma relT_transitive: forall x y z: t. relT x y -> relT y z -> relT x z end theory ReflTransClosure clone export EndoRelation inductive relTR t t = | BaseTransRefl : forall x:t. relTR x x | StepTransRefl : forall x y z:t. relTR x y -> rel y z -> relTR x z lemma relTR_transitive: forall x y z: t. relTR x y -> relTR y z -> relTR x z end (** {2 Lexicographic ordering} *) theory Lex type t1 type t2 predicate rel1 t1 t1 predicate rel2 t2 t2 inductive lex (t1, t2) (t1, t2) = | Lex_1: forall x1 x2 : t1, y1 y2 : t2. rel1 x1 x2 -> lex (x1,y1) (x2,y2) | Lex_2: forall x : t1, y1 y2 : t2. rel2 y1 y2 -> lex (x,y1) (x,y2) end (** {2 Minimum and maximum for total orders} *) theory MinMax type t predicate le t t clone TotalOrder with type t = t, predicate rel = le function min (x y : t) : t = if le x y then x else y function max (x y : t) : t = if le x y then y else x lemma Min_r : forall x y:t. le y x -> min x y = y lemma Max_l : forall x y:t. le y x -> max x y = x lemma Min_comm : forall x y:t. min x y = min y x lemma Max_comm : forall x y:t. max x y = max y x lemma Min_assoc : forall x y z:t. min (min x y) z = min x (min y z) lemma Max_assoc : forall x y z:t. max (max x y) z = max x (max y z) end (** {2 Well-founded relation} *) theory WellFounded type t predicate r t t inductive acc (x: t) = | acc_x: forall x: t. (forall y: t. r y x -> acc y) -> acc x axiom well_founded: forall x: t. acc x end why3-0.87.3/theories/graph.why0000644000175000017500000000502013035416743016714 0ustar guillaumeguillaume (** {1 Graph theory} *) theory Path use import list.List use import list.Append type vertex predicate edge vertex vertex inductive path vertex (list vertex) vertex = | Path_empty: forall x: vertex. path x Nil x | Path_cons: forall x y z: vertex, l: list vertex. edge x y -> path y l z -> path x (Cons x l) z (** [path v0 [v0; v1; ...; vn-1] vn] means a path from [v0] to [vn] composed of [n] edges [(vi,vi+1)]. *) lemma path_right_extension: forall x y z: vertex, l: list vertex. path x l y -> edge y z -> path x (l ++ Cons y Nil) z lemma path_right_inversion: forall x z: vertex, l: list vertex. path x l z -> (x = z /\ l = Nil) \/ (exists y: vertex, l': list vertex. path x l' y /\ edge y z /\ l = l' ++ Cons y Nil) lemma path_trans: forall x y z: vertex, l1 l2: list vertex. path x l1 y -> path y l2 z -> path x (l1 ++ l2) z lemma empty_path: forall x y: vertex. path x Nil y -> x = y lemma path_decomposition: forall x y z: vertex, l1 l2: list vertex. path x (l1 ++ Cons y l2) z -> path x l1 y /\ path y (Cons y l2) z end theory IntPathWeight clone export Path use import int.Int use import list.List use import list.Append function weight vertex vertex : int function path_weight (l: list vertex) (dst: vertex) : int = match l with | Nil -> 0 | Cons x Nil -> weight x dst | Cons x ((Cons y _) as r) -> weight x y + path_weight r dst end (** the total weight of a path [path _ l dst] *) lemma path_weight_right_extension: forall x y: vertex, l: list vertex. path_weight (l ++ Cons x Nil) y = path_weight l x + weight x y lemma path_weight_decomposition: forall y z: vertex, l1 l2: list vertex. path_weight (l1 ++ Cons y l2) z = path_weight l1 y + path_weight (Cons y l2) z end (*** theory SimplePath use import list.List use import list.Mem type graph type vertex predicate edge graph vertex vertex (** [simple_path g src [x1;...;xn] dst] is a path src --> x1 --> x2 --> ... --> xn --> dst without repetition. *) inductive simple_path graph vertex (list vertex) vertex = | Path_empty : forall g:graph, v:vertex. simple_path g v (Nil : list vertex) v | Path_cons : forall g:graph, src v dst : vertex, l : list vertex. edge g src v -> src <> v -> simple_path g v l dst -> not mem src l -> simple_path g src (Cons v l) dst predicate simple_cycle (g : graph) (v : vertex) = exists l : list vertex. l <> Nil /\ simple_path g v l v end *) why3-0.87.3/theories/algebra.why0000644000175000017500000001025413035416743017215 0ustar guillaumeguillaume (** {1 Basic Algebra Theories} *) (** {2 Associativity} *) theory Assoc type t function op t t : t axiom Assoc : forall x y z : t. op (op x y) z = op x (op y z) end (** {2 Commutativity} *) theory Comm type t function op t t : t axiom Comm : forall x y : t. op x y = op y x end (** {2 Associativity and Commutativity} *) theory AC clone export Assoc clone Comm with type t = t, function op = op meta AC function op (*, prop Assoc.Assoc, prop Comm.Comm*) end (** {2 Monoids} *) theory Monoid clone export Assoc constant unit : t axiom Unit_def_l : forall x:t. op unit x = x axiom Unit_def_r : forall x:t. op x unit = x end (** {2 Commutative Monoids} *) theory CommutativeMonoid clone export Monoid clone Comm with type t = t, function op = op meta AC function op (*, prop Assoc.Assoc, prop Comm.Comm*) end (** {2 Groups} *) theory Group clone export Monoid function inv t : t axiom Inv_def_l : forall x:t. op (inv x) x = unit axiom Inv_def_r : forall x:t. op x (inv x) = unit (*** lemma Inv_unit : forall x y:t. op x (inv y) = unit -> x = y *) end (** {2 Commutative Groups} *) theory CommutativeGroup clone export Group clone Comm with type t = t, function op = op meta AC function op (*, prop Assoc.Assoc, prop Comm.Comm*) end (** {2 Rings} *) theory Ring type t constant zero : t function (+) t t : t function (-_) t : t function (*) t t : t clone CommutativeGroup with type t = t, constant unit = zero, function op = (+), function inv = (-_) clone Assoc with type t = t, function op = (*) axiom Mul_distr_l : forall x y z : t. x * (y + z) = x * y + x * z axiom Mul_distr_r : forall x y z : t. (y + z) * x = y * x + z * x function (-) (x y : t) : t = x + -y end (** {2 Commutative Rings} *) theory CommutativeRing clone export Ring clone Comm with type t = t, function op = (*) meta AC function (*) (*, prop Assoc.Assoc, prop Comm.Comm*) end (** {2 Commutative Rings with Unit} *) theory UnitaryCommutativeRing clone export CommutativeRing constant one : t axiom Unitary : forall x:t. one * x = x axiom NonTrivialRing : zero <> one end (** {2 Ordered Commutative Rings} *) theory OrderedUnitaryCommutativeRing clone export UnitaryCommutativeRing predicate (<=) t t predicate (>=) (x y : t) = y <= x clone export relations.TotalOrder with type t = t, predicate rel = (<=) axiom ZeroLessOne : zero <= one axiom CompatOrderAdd : forall x y z : t. x <= y -> x + z <= y + z axiom CompatOrderMult : forall x y z : t. x <= y -> zero <= z -> x * z <= y * z end (** {2 Field theory} *) theory Field clone export UnitaryCommutativeRing function inv t : t axiom Inverse : forall x:t. x <> zero -> x * inv x = one function (/) (x y : t) : t = x * inv y lemma add_div : forall x y z : t. z <> zero -> (x+y)/z = x/z + y/z lemma sub_div : forall x y z : t. z <> zero -> (x-y)/z = x/z - y/z lemma neg_div : forall x y : t. y <> zero -> (-x)/y = -(x/y) lemma assoc_mul_div: forall x y z:t. (* todo: discard the hypothesis ? *) z <> zero -> (x*y)/z = x*(y/z) lemma assoc_div_mul: forall x y z:t. (* todo: discard the hypothesis ? *) y <> zero /\ z <> zero -> (x/y)/z = x/(y*z) lemma assoc_div_div: forall x y z:t. (* todo: discard the hypothesis ? *) y <> zero /\ z <> zero -> x/(y/z) = (x*z)/y end (** {2 Ordered Fields} *) theory OrderedField clone export Field predicate (<=) t t predicate (>=) (x y : t) = y <= x clone export relations.TotalOrder with type t = t, predicate rel = (<=) axiom ZeroLessOne : zero <= one axiom CompatOrderAdd : forall x y z : t. x <= y -> x + z <= y + z axiom CompatOrderMult : forall x y z : t. x <= y -> zero <= z -> x * z <= y * z end (*** to be discussed: should we add the following lemmas, and where lemma InvMult : forall x y : t. (-x) * y = - (x * y) = x * (-y) lemma InvSquare : forall x : t. x * x = (-x) * (-x) lemma ZeroMult : forall x : t. x * zero = zero = zero * x lemma SquareNonNeg1 : forall x : t. x <= zero -> zero <= x * x lemma SquareNonNeg : forall x : t. zero <= x * x *) why3-0.87.3/theories/bag.why0000644000175000017500000000630013035416743016346 0ustar guillaumeguillaume (** {1 Multisets (aka bags)} *) theory Bag use import int.Int type bag 'a (** whatever ['a], the type [bag 'a] is always infinite *) meta "infinite_type" type bag (** the most basic operation is the number of occurrences *) function nb_occ (x: 'a) (b: bag 'a): int axiom occ_non_negative: forall b: bag 'a, x: 'a. nb_occ x b >= 0 predicate mem (x: 'a) (b: bag 'a) = nb_occ x b > 0 (** equality of bags *) predicate eq_bag (a b: bag 'a) = forall x:'a. nb_occ x a = nb_occ x b axiom bag_extensionality: forall a b: bag 'a. eq_bag a b -> a = b (** basic constructors of bags *) function empty_bag: bag 'a axiom occ_empty: forall x: 'a. nb_occ x empty_bag = 0 lemma is_empty: forall b: bag 'a. (forall x: 'a. nb_occ x b = 0) -> b = empty_bag function singleton (x: 'a) : bag 'a axiom occ_singleton: forall x y: 'a. (x = y /\ (nb_occ y (singleton x)) = 1) \/ (x <> y /\ (nb_occ y (singleton x)) = 0) (* FIXME? nb_occ y (singleton x) = if x = y then 1 else 0 *) lemma occ_singleton_eq: forall x y: 'a. x = y -> nb_occ y (singleton x) = 1 lemma occ_singleton_neq: forall x y: 'a. x <> y -> nb_occ y (singleton x) = 0 function union (bag 'a) (bag 'a) : bag 'a axiom occ_union: forall x: 'a, a b: bag 'a. nb_occ x (union a b) = nb_occ x a + nb_occ x b (** union commutative, associative with identity empty_bag *) lemma Union_comm: forall a b: bag 'a. union a b = union b a lemma Union_identity: forall a: bag 'a. union a empty_bag = a lemma Union_assoc: forall a b c: bag 'a. union a (union b c) = union (union a b) c lemma bag_simpl_right: forall a b c: bag 'a. union a b = union c b -> a = c lemma bag_simpl_left: forall a b c: bag 'a. union a b = union a c -> b = c (** add operation *) function add (x: 'a) (b: bag 'a) : bag 'a = union (singleton x) b lemma occ_add_eq: forall b: bag 'a, x y: 'a. x = y -> nb_occ y (add x b) = nb_occ y b + 1 lemma occ_add_neq: forall b: bag 'a, x y: 'a. x <> y -> nb_occ y (add x b) = nb_occ y b (** cardinality of bags *) function card (bag 'a): int axiom Card_nonneg: forall x: bag 'a. card x >= 0 axiom Card_empty: card (empty_bag: bag 'a) = 0 axiom Card_zero_empty: forall x: bag 'a. card x = 0 -> x = empty_bag axiom Card_singleton: forall x:'a. card (singleton x) = 1 axiom Card_union: forall x y: bag 'a. card (union x y) = card x + card y lemma Card_add: forall x: 'a, b: bag 'a. card (add x b) = 1 + card b (** bag difference *) use import int.MinMax function diff (bag 'a) (bag 'a) : bag 'a axiom Diff_occ: forall b1 b2: bag 'a, x:'a. nb_occ x (diff b1 b2) = max 0 (nb_occ x b1 - nb_occ x b2) lemma Diff_empty_right: forall b: bag 'a. diff b empty_bag = b lemma Diff_empty_left: forall b: bag 'a. diff empty_bag b = empty_bag lemma Diff_add: forall b: bag 'a, x:'a. diff (add x b) (singleton x) = b lemma Diff_comm: forall b b1 b2: bag 'a. diff (diff b b1) b2 = diff (diff b b2) b1 lemma Add_diff: forall b: bag 'a, x:'a. mem x b -> add x (diff b (singleton x)) = b (** arbitrary element *) function choose (b: bag 'a) : 'a axiom choose_mem: forall b: bag 'a. empty_bag <> b -> mem (choose b) b end why3-0.87.3/theories/floating_point.why0000644000175000017500000004541613035416743020644 0ustar guillaumeguillaume (** {1 Formalization of Floating-Point Arithmetic} This formalization follows the {h IEEE-754 standard}. *) (** {2 Definition of IEEE-754 rounding modes} *) theory Rounding type mode = NearestTiesToEven | ToZero | Up | Down | NearestTiesToAway (** nearest ties to even, to zero, upward, downward, nearest ties to away *) end (** {2 Handling of IEEE-754 special values} Special values are +infinity, -infinity, NaN, +0, -0. These are handled as described in {h [Ayad, Marché, IJCAR, 2010]}. *) theory SpecialValues type class = Finite | Infinite | NaN type sign = Neg | Pos use import real.Real inductive same_sign_real sign real = | Neg_case: forall x:real. x < 0.0 -> same_sign_real Neg x | Pos_case: forall x:real. x > 0.0 -> same_sign_real Pos x (* useful ??? lemma sign_not_pos_neg : forall x:t. sign(x) <> Pos -> sign(x) = Neg lemma sign_not_neg_pos : forall x:t. sign(x) <> Neg -> sign(x) = Pos lemma sign_not_pos_neg : forall x:double. sign(x) <> Pos -> sign(x) = Neg lemma sign_not_neg_pos : forall x:double. sign(x) <> Neg -> sign(x) = Pos *) lemma same_sign_real_zero1 : forall b:sign. not same_sign_real b 0.0 lemma same_sign_real_zero2 : forall x:real. same_sign_real Neg x /\ same_sign_real Pos x -> false lemma same_sign_real_zero3 : forall b:sign, x:real. same_sign_real b x -> x <> 0.0 lemma same_sign_real_correct2 : forall b:sign, x:real. same_sign_real b x -> (x < 0.0 <-> b = Neg) lemma same_sign_real_correct3 : forall b:sign, x:real. same_sign_real b x -> (x > 0.0 <-> b = Pos) end (** {2 Generic theory of floats} The theory is parametrized by the real constant [max] which denotes the maximal representable number, the real constant [min] which denotes the minimal number whose rounding is not null, and the integer constant [max_representable_integer] which is the maximal integer [n] such that every integer between [0] and [n] are representable. *) theory GenFloat use import Rounding use import real.Real use import real.Abs use import real.FromInt use int.Int type t function round mode real : real function value t : real function exact t : real function model t : real function round_error (x : t) : real = abs (value x - exact x) function total_error (x : t) : real = abs (value x - model x) constant max : real predicate no_overflow (m:mode) (x:real) = abs (round m x) <= max axiom Bounded_real_no_overflow : forall m:mode, x:real. abs x <= max -> no_overflow m x axiom Round_monotonic : forall m:mode, x y:real. x <= y -> round m x <= round m y axiom Round_idempotent : forall m1 m2:mode, x:real. round m1 (round m2 x) = round m2 x axiom Round_value : forall m:mode, x:t. round m (value x) = value x axiom Bounded_value : forall x:t. abs (value x) <= max constant max_representable_integer : int axiom Exact_rounding_for_integers: forall m:mode,i:int. Int.(<=) (Int.(-_) max_representable_integer) i /\ Int.(<=) i max_representable_integer -> round m (from_int i) = from_int i (** rounding up and down *) axiom Round_down_le: forall x:real. round Down x <= x axiom Round_up_ge: forall x:real. round Up x >= x axiom Round_down_neg: forall x:real. round Down (-x) = - round Up x axiom Round_up_neg: forall x:real. round Up (-x) = - round Down x (** rounding into a float instead of a real *) function round_logic mode real : t axiom Round_logic_def: forall m:mode, x:real. no_overflow m x -> value (round_logic m x) = round m x end (** {2 Format of Single precision floats} A.k.a. binary32 numbers. *) theory SingleFormat type single constant max_single : real = 0x1.FFFFFEp127 constant max_int : int = 16777216 (* 2^24 *) (* clone export GenFloatSpecStrict with type t = single, constant max = max_single, constant max_representable_integer = max_int *) end (** {2 Format of Double precision floats} A.k.a. binary64 numbers. *) theory DoubleFormat type double constant max_double : real = 0x1.FFFFFFFFFFFFFp1023 constant max_int : int = 9007199254740992 (* 2^53 *) (* clone export GenFloatSpecStrict with type t = double, constant max = max_double, constant max_representable_integer = max_int *) end theory GenFloatSpecStrict use import Rounding use import real.Real clone export GenFloat predicate of_real_post (m:mode) (x:real) (res:t) = value res = round m x /\ exact res = x /\ model res = x (** {3 binary operations} *) predicate add_post (m:mode) (x y res:t) = value res = round m (value x + value y) /\ exact res = exact x + exact y /\ model res = model x + model y predicate sub_post (m:mode) (x y res:t) = value res = round m (value x - value y) /\ exact res = exact x - exact y /\ model res = model x - model y predicate mul_post (m:mode) (x y res:t) = value res = round m (value x * value y) /\ exact res = exact x * exact y /\ model res = model x * model y predicate div_post (m:mode) (x y res:t) = value res = round m (value x / value y) /\ exact res = exact x / exact y /\ model res = model x / model y predicate neg_post (x res:t) = value res = - value x /\ exact res = - exact x /\ model res = - model x (** {3 Comparisons} *) predicate lt (x:t) (y:t) = value x < value y predicate gt (x:t) (y:t) = value x > value y end theory Single use export SingleFormat clone export GenFloatSpecStrict with type t = single, constant max = max_single, constant max_representable_integer = max_int end theory Double use export DoubleFormat clone export GenFloatSpecStrict with type t = double, constant max = max_double, constant max_representable_integer = max_int end (** {2 Generic Full theory of floats} This theory extends the generic theory above by adding the special values. *) theory GenFloatFull use import SpecialValues use import Rounding use import real.Real clone export GenFloat (** {3 special values} *) function class t : class predicate is_finite (x:t) = class x = Finite predicate is_infinite (x:t) = class x = Infinite predicate is_NaN (x:t) = class x = NaN predicate is_not_NaN (x:t) = is_finite x \/ is_infinite x lemma is_not_NaN: forall x:t. is_not_NaN x <-> not (is_NaN x) function sign t : sign predicate same_sign_real (x:t) (y:real) = SpecialValues.same_sign_real (sign x) y predicate same_sign (x:t) (y:t) = sign x = sign y predicate diff_sign (x:t) (y:t) = sign x <> sign y predicate sign_zero_result (m:mode) (x:t) = value x = 0.0 -> match m with | Down -> sign x = Neg | _ -> sign x = Pos end predicate is_minus_infinity (x:t) = is_infinite x /\ sign x = Neg predicate is_plus_infinity (x:t) = is_infinite x /\ sign x = Pos predicate is_gen_zero (x:t) = is_finite x /\ value x = 0.0 predicate is_gen_zero_plus (x:t) = is_gen_zero x /\ sign x = Pos predicate is_gen_zero_minus (x:t) = is_gen_zero x /\ sign x = Neg (** {3 Useful lemmas on sign} *) (* non-zero finite gen_float has the same sign as its float_value *) lemma finite_sign : forall x:t. class x = Finite /\ value x <> 0.0 -> same_sign_real x (value x) lemma finite_sign_pos1: forall x:t. class x = Finite /\ value x > 0.0 -> sign x = Pos lemma finite_sign_pos2: forall x:t. class x = Finite /\ value x <> 0.0 /\ sign x = Pos -> value x > 0.0 lemma finite_sign_neg1: forall x:t. class x = Finite /\ value x < 0.0 -> sign x = Neg lemma finite_sign_neg2: forall x:t. class x = Finite /\ value x <> 0.0 /\ sign x = Neg -> value x < 0.0 lemma diff_sign_trans: forall x y z:t. diff_sign x y /\ diff_sign y z -> same_sign x z lemma diff_sign_product: forall x y:t. class x = Finite /\ class y = Finite /\ value x * value y < 0.0 -> diff_sign x y lemma same_sign_product: forall x y:t. class x = Finite /\ class y = Finite /\ same_sign x y -> value x * value y >= 0.0 (** {3 overflow} *) (** This predicate tells what is the result of a rounding in case of overflow *) predicate overflow_value (m:mode) (x:t) = match m, sign x with | Down, Neg -> is_infinite x | Down, Pos -> is_finite x /\ value x = max | Up, Neg -> is_finite x /\ value x = - max | Up, Pos -> is_infinite x | ToZero, Neg -> is_finite x /\ value x = - max | ToZero, Pos -> is_finite x /\ value x = max | (NearestTiesToAway | NearestTiesToEven), _ -> is_infinite x end (** rounding in logic *) lemma round1 : forall m:mode, x:real. no_overflow m x -> is_finite (round_logic m x) /\ value(round_logic m x) = round m x lemma round2 : forall m:mode, x:real. not no_overflow m x -> same_sign_real (round_logic m x) x /\ overflow_value m (round_logic m x) lemma round3 : forall m:mode, x:real. exact (round_logic m x) = x lemma round4 : forall m:mode, x:real. model (round_logic m x) = x (** rounding of zero *) lemma round_of_zero : forall m:mode. is_gen_zero (round_logic m 0.0) use import real.Abs lemma round_logic_le : forall m:mode, x:real. is_finite (round_logic m x) -> abs (value (round_logic m x)) <= max lemma round_no_overflow : forall m:mode, x:real. abs x <= max -> is_finite (round_logic m x) /\ value (round_logic m x) = round m x constant min : real lemma positive_constant : forall m:mode, x:real. min <= x <= max -> is_finite (round_logic m x) /\ value (round_logic m x) > 0.0 /\ sign (round_logic m x) = Pos lemma negative_constant : forall m:mode, x:real. - max <= x <= - min -> is_finite (round_logic m x) /\ value (round_logic m x) < 0.0 /\ sign (round_logic m x) = Neg (** lemmas on gen_zero *) lemma is_gen_zero_comp1 : forall x y:t. is_gen_zero x /\ value x = value y /\ is_finite y -> is_gen_zero y lemma is_gen_zero_comp2 : forall x y:t. is_finite x /\ not (is_gen_zero x) /\ value x = value y -> not (is_gen_zero y) end theory GenFloatSpecFull use import real.Real use import Rounding use import SpecialValues clone export GenFloatFull (** {3 binary operations} *) predicate add_post (m:mode) (x:t) (y:t) (r:t) = (is_NaN x \/ is_NaN y -> is_NaN r) /\ (is_finite x /\ is_infinite y -> is_infinite r /\ same_sign r y) /\ (is_infinite x /\ is_finite y -> is_infinite r /\ same_sign r x) /\ (is_infinite x /\ is_infinite y -> if same_sign x y then is_infinite r /\ same_sign r x else is_NaN r) /\ (is_finite x /\ is_finite y /\ no_overflow m (value x + value y) -> is_finite r /\ value r = round m (value x + value y) /\ (if same_sign x y then same_sign r x else sign_zero_result m r)) /\ (is_finite x /\ is_finite y /\ not no_overflow m (value x + value y) -> SpecialValues.same_sign_real (sign r) (value x + value y) /\ overflow_value m r) /\ exact r = exact x + exact y /\ model r = model x + model y predicate sub_post (m:mode) (x:t) (y:t) (r:t) = (is_NaN x \/ is_NaN y -> is_NaN r) /\ (is_finite x /\ is_infinite y -> is_infinite r /\ diff_sign r y) /\ (is_infinite x /\ is_finite y -> is_infinite r /\ same_sign r x) /\ (is_infinite x /\ is_infinite y -> if diff_sign x y then is_infinite r /\ same_sign r x else is_NaN r) /\ (is_finite x /\ is_finite y /\ no_overflow m (value x - value y) -> is_finite r /\ value r = round m (value x - value y) /\ (if diff_sign x y then same_sign r x else sign_zero_result m r)) /\ (is_finite x /\ is_finite y /\ not no_overflow m (value x - value y) -> SpecialValues.same_sign_real (sign r) (value x - value y) /\ overflow_value m r) /\ exact r = exact x - exact y /\ model r = model x - model y predicate product_sign (z x y: t) = (same_sign x y -> sign z = Pos) /\ (diff_sign x y -> sign z = Neg) predicate mul_post (m:mode) (x:t) (y:t) (r:t) = (is_NaN x \/ is_NaN y -> is_NaN r) /\ (is_gen_zero x /\ is_infinite y -> is_NaN r) /\ (is_finite x /\ is_infinite y /\ value x <> 0.0 -> is_infinite r) /\ (is_infinite x /\ is_gen_zero y -> is_NaN r) /\ (is_infinite x /\ is_finite y /\ value y <> 0.0 -> is_infinite r) /\ (is_infinite x /\ is_infinite y -> is_infinite r) /\ (is_finite x /\ is_finite y /\ no_overflow m (value x * value y) -> is_finite r /\ value r = round m (value x * value y)) /\ (is_finite x /\ is_finite y /\ not no_overflow m (value x * value y) -> overflow_value m r) /\ (not is_NaN r -> product_sign r x y) /\ exact r = exact x * exact y /\ model r = model x * model y predicate neg_post (x:t) (r:t) = (is_NaN x -> is_NaN r) /\ (is_infinite x -> is_infinite r) /\ (is_finite x -> is_finite r /\ value r = - value x) /\ (not is_NaN r -> diff_sign r x) /\ exact r = - exact x /\ model r = - model x predicate div_post (m:mode) (x:t) (y:t) (r:t) = (is_NaN x \/ is_NaN y -> is_NaN r) /\ (is_finite x /\ is_infinite y -> is_gen_zero r) /\ (is_infinite x /\ is_finite y -> is_infinite r) /\ (is_infinite x /\ is_infinite y -> is_NaN r) /\ (is_finite x /\ is_finite y /\ value y <> 0.0 /\ no_overflow m (value x / value y) -> is_finite r /\ value r = round m (value x / value y)) /\ (is_finite x /\ is_finite y /\ value y <> 0.0 /\ not no_overflow m (value x / value y) -> overflow_value m r) /\ (is_finite x /\ is_gen_zero y /\ value x <> 0.0 -> is_infinite r) /\(is_gen_zero x /\ is_gen_zero y -> is_NaN r) /\ (not is_NaN r -> product_sign r x y) /\ exact r = exact x / exact y /\ model r = model x / model y predicate of_real_exact_post (x:real) (r:t) = is_finite r /\ value r = x /\ exact r = x /\ model r = x (** {3 Comparisons} *) predicate le (x:t) (y:t) = (is_finite x /\ is_finite y /\ value x <= value y) \/ (is_minus_infinity x /\ is_not_NaN y) \/ (is_not_NaN x /\ is_plus_infinity y) predicate lt (x:t) (y:t) = (is_finite x /\ is_finite y /\ value x < value y) \/ (is_minus_infinity x /\ is_not_NaN y /\ not (is_minus_infinity y)) \/ (is_not_NaN x /\ not (is_plus_infinity x) /\ is_plus_infinity y) predicate ge (x:t) (y:t) = le y x predicate gt (x:t) (y:t) = lt y x predicate eq (x:t) (y:t) = is_not_NaN x /\ is_not_NaN y /\ ((is_finite x /\ is_finite y /\ value x = value y) \/ (is_infinite x /\ is_infinite y /\ same_sign x y)) predicate ne (x:t) (y:t) = not (eq x y) lemma le_lt_trans: forall x y z:t. le x y /\ lt y z -> lt x z lemma lt_le_trans: forall x y z:t. lt x y /\ le y z -> lt x z lemma le_ge_asym: forall x y:t. le x y /\ ge x y -> eq x y lemma not_lt_ge: forall x y:t. not (lt x y) /\ is_not_NaN x /\ is_not_NaN y -> ge x y lemma not_gt_le: forall x y:t. not (gt x y) /\ is_not_NaN x /\ is_not_NaN y -> le x y end (** {2 Full theory of single precision floats} *) theory SingleFull use export SingleFormat constant min_single : real = 0x1p-149 clone export GenFloatSpecFull with type t = single, constant max = max_single, constant max_representable_integer = max_int end (** {2 Full theory of double precision floats} *) theory DoubleFull use export DoubleFormat constant min_double : real = 0x1p-1074 clone export GenFloatSpecFull with type t = double, constant max = max_double, constant max_representable_integer = max_int end theory GenFloatSpecMultiRounding use import Rounding use import real.Real use import real.Abs clone export GenFloat (** {3 binary operations} *) constant min_normalized : real constant eps_normalized : real constant eta_normalized : real predicate add_post (m:mode) (x y res:t) = ((* CASE 1 : normalized numbers *) (abs(value x + value y) >= min_normalized -> abs(value res - (value x + value y)) <= eps_normalized * abs(value x + value y)) /\ (*CASE 2: denormalized numbers *) (abs(value x + value y) <= min_normalized -> abs(value res - (value x + value y)) <= eta_normalized)) /\ exact res = exact x + exact y /\ model res = model x + model y predicate sub_post (m:mode) (x y res:t) = ((* CASE 1 : normalized numbers *) (abs(value x - value y) >= min_normalized -> abs(value res - (value x - value y)) <= eps_normalized * abs(value x - value y)) /\ (*CASE 2: denormalized numbers *) (abs(value x - value y) <= min_normalized -> abs(value res - (value x - value y)) <= eta_normalized)) /\ exact res = exact x - exact y /\ model res = model x - model y predicate mul_post (m:mode) (x y res:t) = ((* CASE 1 : normalized numbers *) (abs(value x * value y) >= min_normalized -> abs(value res - (value x * value y)) <= eps_normalized * abs(value x * value y)) /\ (*CASE 2: denormalized numbers *) (abs(value x * value y) <= min_normalized -> abs(value res - (value x * value y)) <= eta_normalized)) /\ exact res = exact x * exact y /\ model res = model x * model y predicate neg_post (m:mode) (x res:t) = ((abs(value x) >= min_normalized -> abs(value res - (- value x)) <= eps_normalized * abs(- value x)) /\ (abs(value x) <= min_normalized -> abs(value res - (- value x)) <= eta_normalized)) /\ exact res = - exact x /\ model res = - model x predicate of_real_post (m:mode) (x:real) (res:t) = value res = round m x /\ exact res = x /\ model res = x predicate of_real_exact_post (x:real) (r:t) = value r = x /\ exact r = x /\ model r = x (** {3 Comparisons} *) predicate lt (x:t) (y:t) = value x < value y predicate gt (x:t) (y:t) = value x > value y end (* TODO: find constants for type single *) (* theory SingleMultiRounding constant min_normalized_single : real = constant eps_normalized_single : real = constant eta_normalized_single : real = clone export GenFloatSpecMultiRounding with type t = single, constant max = max_single, constant max_representable_integer = max_int, constant min_normalized = min_normalized_single, constant eps_normalized = eps_normalized_single, constant eta_normalized = eta_normalized_single end *) theory DoubleMultiRounding use export DoubleFormat constant min_normalized_double : real = 0x1p-1022 constant eps_normalized_double : real = 0x1.004p-53 constant eta_normalized_double : real = 0x1.002p-1075 clone export GenFloatSpecMultiRounding with type t = double, constant max = max_double, constant max_representable_integer = max_int, constant min_normalized = min_normalized_double, constant eps_normalized = eps_normalized_double, constant eta_normalized = eta_normalized_double end why3-0.87.3/theories/sum.why0000644000175000017500000000162613035416743016427 0ustar guillaumeguillaume (** {1 Sum of the elements of an indexed container} *) theory Sum "Sum of the elements of an indexed container" use import int.Int type container function f container int : int (** [f c i] is the [i]-th element in the container [c] *) function sum container int int : int (** [sum c i j] is the sum Sum_{i <= k < j} f c k *) axiom Sum_def_empty : forall c : container, i j : int. j <= i -> sum c i j = 0 axiom Sum_def_non_empty : forall c: container, i j : int. i < j -> sum c i j = f c i + sum c (i+1) j lemma Sum_right_extension: forall c : container, i j : int. i < j -> sum c i j = sum c i (j-1) + f c (j-1) lemma Sum_transitivity : forall c : container, i k j : int. i <= k <= j -> sum c i j = sum c i k + sum c k j lemma Sum_eq : forall c1 c2 : container, i j : int. (forall k : int. i <= k < j -> f c1 k = f c2 k) -> sum c1 i j = sum c2 i j end why3-0.87.3/theories/option.why0000644000175000017500000000011613035416743017124 0ustar guillaumeguillaume(** {1 Option type} *) theory Option type option 'a = None | Some 'a end why3-0.87.3/theories/bv.why0000644000175000017500000003604313035416743016233 0ustar guillaumeguillaume(** {1 Bit Vectors} *) (** {2 Powers of two } *) theory Pow2int use import int.Int function pow2 (i:int) : int axiom Power_0 : pow2 0 = 1 axiom Power_s : forall n: int. n >= 0 -> pow2 (n+1) = 2 * pow2 n lemma Power_1 : pow2 1 = 2 lemma Power_sum : forall n m: int. n >= 0 /\ m >= 0 -> pow2 (n+m) = pow2 n * pow2 m lemma pow2pos: forall i:int. i >= 0 -> pow2 i > 0 lemma pow2_0: pow2 0 = 0x1 lemma pow2_1: pow2 1 = 0x2 lemma pow2_2: pow2 2 = 0x4 lemma pow2_3: pow2 3 = 0x8 lemma pow2_4: pow2 4 = 0x10 lemma pow2_5: pow2 5 = 0x20 lemma pow2_6: pow2 6 = 0x40 lemma pow2_7: pow2 7 = 0x80 lemma pow2_8: pow2 8 = 0x100 lemma pow2_9: pow2 9 = 0x200 lemma pow2_10: pow2 10 = 0x400 lemma pow2_11: pow2 11 = 0x800 lemma pow2_12: pow2 12 = 0x1000 lemma pow2_13: pow2 13 = 0x2000 lemma pow2_14: pow2 14 = 0x4000 lemma pow2_15: pow2 15 = 0x8000 lemma pow2_16: pow2 16 = 0x10000 lemma pow2_17: pow2 17 = 0x20000 lemma pow2_18: pow2 18 = 0x40000 lemma pow2_19: pow2 19 = 0x80000 lemma pow2_20: pow2 20 = 0x100000 lemma pow2_21: pow2 21 = 0x200000 lemma pow2_22: pow2 22 = 0x400000 lemma pow2_23: pow2 23 = 0x800000 lemma pow2_24: pow2 24 = 0x1000000 lemma pow2_25: pow2 25 = 0x2000000 lemma pow2_26: pow2 26 = 0x4000000 lemma pow2_27: pow2 27 = 0x8000000 lemma pow2_28: pow2 28 = 0x10000000 lemma pow2_29: pow2 29 = 0x20000000 lemma pow2_30: pow2 30 = 0x40000000 lemma pow2_31: pow2 31 = 0x80000000 lemma pow2_32: pow2 32 = 0x100000000 lemma pow2_33: pow2 33 = 0x200000000 lemma pow2_34: pow2 34 = 0x400000000 lemma pow2_35: pow2 35 = 0x800000000 lemma pow2_36: pow2 36 = 0x1000000000 lemma pow2_37: pow2 37 = 0x2000000000 lemma pow2_38: pow2 38 = 0x4000000000 lemma pow2_39: pow2 39 = 0x8000000000 lemma pow2_40: pow2 40 = 0x10000000000 lemma pow2_41: pow2 41 = 0x20000000000 lemma pow2_42: pow2 42 = 0x40000000000 lemma pow2_43: pow2 43 = 0x80000000000 lemma pow2_44: pow2 44 = 0x100000000000 lemma pow2_45: pow2 45 = 0x200000000000 lemma pow2_46: pow2 46 = 0x400000000000 lemma pow2_47: pow2 47 = 0x800000000000 lemma pow2_48: pow2 48 = 0x1000000000000 lemma pow2_49: pow2 49 = 0x2000000000000 lemma pow2_50: pow2 50 = 0x4000000000000 lemma pow2_51: pow2 51 = 0x8000000000000 lemma pow2_52: pow2 52 = 0x10000000000000 lemma pow2_53: pow2 53 = 0x20000000000000 lemma pow2_54: pow2 54 = 0x40000000000000 lemma pow2_55: pow2 55 = 0x80000000000000 lemma pow2_56: pow2 56 = 0x100000000000000 lemma pow2_57: pow2 57 = 0x200000000000000 lemma pow2_58: pow2 58 = 0x400000000000000 lemma pow2_59: pow2 59 = 0x800000000000000 lemma pow2_60: pow2 60 = 0x1000000000000000 lemma pow2_61: pow2 61 = 0x2000000000000000 lemma pow2_62: pow2 62 = 0x4000000000000000 lemma pow2_63: pow2 63 = 0x8000000000000000 lemma pow2_64: pow2 64 = 0x10000000000000000 (*** use import int.EuclideanDivision lemma Div_pow: forall x i:int. i > 0 -> pow2 (i-1) <= x < pow2 i -> div x (pow2 (i-1)) = 1 lemma Div_div_pow: forall x i j:int. i > 0 /\ j > 0 -> div (div x (pow2 i)) (pow2 j) = div x (pow2 (i+j)) lemma Mod_pow2_gen: forall x i k :int. 0 <= k < i -> mod (div (x + pow2 i) (pow2 k)) 2 = mod (div x (pow2 k)) 2 *) end (** {2 Generic theory of Bit Vectors (arbitrary length)} *) theory BV_Gen use export bool.Bool use import int.Int constant size : int axiom size_pos : size > 0 type t (** [nth b n] is the n-th bit of b. Bit 0 is the least significant bit *) function nth t int : bool axiom nth_out_of_bound: forall x n. n < 0 \/ n >= size -> nth x n = False constant zeros : t axiom Nth_zeros: forall n:int. nth zeros n = False constant ones : t axiom Nth_ones: forall n. 0 <= n < size -> nth ones n = True (** Bitwise operators *) (* /!\ NOTE : both bw_and and bw_or don't need guard on n because of nth out of bound axiom *) function bw_and (v1 v2 : t) : t axiom Nth_bw_and: forall v1 v2:t, n:int. 0 <= n < size -> nth (bw_and v1 v2) n = andb (nth v1 n) (nth v2 n) function bw_or (v1 v2 : t) : t axiom Nth_bw_or: forall v1 v2:t, n:int. 0 <= n < size -> nth (bw_or v1 v2) n = orb (nth v1 n) (nth v2 n) function bw_xor (v1 v2 : t) : t axiom Nth_bw_xor: forall v1 v2:t, n:int. 0 <= n < size -> nth (bw_xor v1 v2) n = xorb (nth v1 n) (nth v2 n) function bw_not (v : t) : t axiom Nth_bw_not: forall v:t, n:int. 0 <= n < size -> nth (bw_not v) n = notb (nth v n) (** Shift operators *) (** Warning: shift operators of an amount greater than or equal to the size are specified here, in concordance with SMTLIB. This is not necessarily the case in hardware, where the amount of the shift might be taken modulo the size, eg. [lsr x 64] might be equal to [x], whereas in this theory it is 0. *) function lsr t int : t axiom Lsr_nth_low: forall b:t,n s:int. 0 <= s -> 0 <= n -> n+s < size -> nth (lsr b s) n = nth b (n+s) axiom Lsr_nth_high: forall b:t,n s:int. 0 <= s -> 0 <= n -> n+s >= size -> nth (lsr b s) n = False lemma lsr_zeros: forall x. lsr x 0 = x function asr t int : t axiom Asr_nth_low: forall b:t,n s:int. 0 <= s -> 0 <= n < size -> n+s < size -> nth (asr b s) n = nth b (n+s) axiom Asr_nth_high: forall b:t,n s:int. 0 <= s -> 0 <= n < size -> n+s >= size -> nth (asr b s) n = nth b (size-1) lemma asr_zeros: forall x. asr x 0 = x function lsl t int : t axiom Lsl_nth_high: forall b:t,n s:int. 0 <= s <= n < size -> nth (lsl b s) n = nth b (n-s) axiom Lsl_nth_low: forall b:t,n s:int. 0 <= n < s -> nth (lsl b s) n = False lemma lsl_zeros: forall x. lsl x 0 = x use import int.EuclideanDivision function rotate_right t int : t axiom Nth_rotate_right : forall v n i. 0 <= i < size -> 0 <= n -> nth (rotate_right v n) i = nth v (mod (i + n) size) function rotate_left t int : t axiom Nth_rotate_left : forall v n i. 0 <= i < size -> 0 <= n -> nth (rotate_left v n) i = nth v (mod (i - n) size) (* Conversions from/to integers *) use import Pow2int constant two_power_size : int constant max_int : int axiom two_power_size_val : two_power_size = pow2 size axiom max_int_val : max_int = two_power_size - 1 function to_int t : int function to_uint t : int function of_int int : t axiom to_uint_extensionality : forall v,v':t. to_uint v = to_uint v' -> v = v' axiom to_int_extensionality: forall v,v':t. to_int v = to_int v' -> v = v' (**) predicate uint_in_range (i : int) = (Int.(<=) 0 i) /\ (Int.(<=) i max_int) (**) axiom to_uint_bounds : (* forall v:t. uint_in_range (to_uint v) *) forall v:t. 0 <= to_uint v < two_power_size axiom to_uint_of_int : forall i. 0 <= i < two_power_size -> to_uint (of_int i) = i constant size_bv : t = of_int size axiom Of_int_zeros: zeros = of_int 0 axiom Of_int_ones: ones = of_int max_int (* comparison operators *) predicate ult (x y : t) = Int.(<) (to_uint x) (to_uint y) predicate ule (x y : t) = Int.(<=) (to_uint x) (to_uint y) predicate ugt (x y : t) = Int.(>) (to_uint x) (to_uint y) predicate uge (x y : t) = Int.(>=) (to_uint x) (to_uint y) predicate slt (v1 v2 : t) = Int.(<) (to_int v1) (to_int v2) predicate sle (v1 v2 : t) = Int.(<=) (to_int v1) (to_int v2) predicate sgt (v1 v2 : t) = Int.(>) (to_int v1) (to_int v2) predicate sge (v1 v2 : t) = Int.(>=) (to_int v1) (to_int v2) (** Arithmetic operators *) function add (v1 v2 : t) : t axiom to_uint_add: forall v1 v2. to_uint (add v1 v2) = mod (Int.(+) (to_uint v1) (to_uint v2)) two_power_size lemma to_uint_add_bounded: forall v1 v2. to_uint v1 + to_uint v2 < two_power_size -> to_uint (add v1 v2) = to_uint v1 + to_uint v2 function sub (v1 v2 : t) : t axiom to_uint_sub: forall v1 v2. to_uint (sub v1 v2) = mod (Int.(-) (to_uint v1) (to_uint v2)) two_power_size lemma to_uint_sub_bounded: forall v1 v2. 0 <= to_uint v1 - to_uint v2 < two_power_size -> to_uint (sub v1 v2) = to_uint v1 - to_uint v2 function neg (v1 : t) : t axiom to_uint_neg: forall v. to_uint (neg v) = mod (Int.(-_) (to_uint v)) two_power_size function mul (v1 v2 : t) : t axiom to_uint_mul: forall v1 v2. to_uint (mul v1 v2) = mod (Int.( * ) (to_uint v1) (to_uint v2)) two_power_size lemma to_uint_mul_bounded: forall v1 v2. to_uint v1 * to_uint v2 < two_power_size -> to_uint (mul v1 v2) = to_uint v1 * to_uint v2 function udiv (v1 v2 : t) : t axiom to_uint_udiv: forall v1 v2. to_uint (udiv v1 v2) = div (to_uint v1) (to_uint v2) function urem (v1 v2 : t) : t axiom to_uint_urem: forall v1 v2. to_uint (urem v1 v2) = mod (to_uint v1) (to_uint v2) (** Bitvector alternatives for shifts, rotations and nth *) (** logical shift right *) function lsr_bv t t : t axiom lsr_bv_is_lsr: forall x n. lsr_bv x n = lsr x (to_uint n) axiom to_uint_lsr: forall v n : t. to_uint (lsr_bv v n) = div (to_uint v) (pow2 ( to_uint n )) (** arithmetic shift right *) function asr_bv t t : t axiom asr_bv_is_asr: forall x n. asr_bv x n = asr x (to_uint n) (** logical shift left *) function lsl_bv t t : t axiom lsl_bv_is_lsl: forall x n. lsl_bv x n = lsl x (to_uint n) axiom to_uint_lsl: forall v n : t. to_uint (lsl_bv v n) = mod (Int.( * ) (to_uint v) (pow2 (to_uint n))) two_power_size (** rotations *) function rotate_right_bv (v n : t) : t function rotate_left_bv (v n : t) : t axiom rotate_left_bv_is_rotate_left : forall v n. rotate_left_bv v n = rotate_left v (to_uint n) axiom rotate_right_bv_is_rotate_right : forall v n. rotate_right_bv v n = rotate_right v (to_uint n) (** nth_bv *) function nth_bv t t: bool axiom nth_bv_def: forall x i. nth_bv x i = not (bw_and (lsr_bv x i) (of_int 1) = zeros) axiom Nth_bv_is_nth: forall x i. nth x (to_uint i) = nth_bv x i axiom Nth_bv_is_nth2: forall x i. 0 <= i < two_power_size -> nth_bv x (of_int i) = nth x i (* equality axioms *) predicate eq_sub_bv t t t t axiom eq_sub_bv_def: forall a b i n. let mask = lsl_bv (sub (lsl_bv (of_int 1) n) (of_int 1)) i in eq_sub_bv a b i n = (bw_and b mask = bw_and a mask) predicate eq_sub (a b:t) (i n:int) = forall j. i <= j < i + n -> nth a j = nth b j axiom eq_sub_equiv: forall a b i n:t. eq_sub a b (to_uint i) (to_uint n) <-> eq_sub_bv a b i n predicate eq (v1 v2 : t) = eq_sub v1 v2 0 size axiom Extensionality: forall x y : t [eq x y]. eq x y -> x = y end (** {2 Bit Vectors of common size_bvs, 8/16/32/64} *) theory BV64 constant size : int = 64 constant two_power_size : int = 0x1_0000_0000_0000_0000 constant max_int : int = 0xFFFF_FFFF_FFFF_FFFF clone export BV_Gen with constant size = size, constant two_power_size = two_power_size, constant max_int = max_int, goal size_pos, goal two_power_size_val, goal max_int_val end theory BV32 constant size : int = 32 constant two_power_size : int = 0x1_0000_0000 constant max_int : int = 0xFFFF_FFFF clone export BV_Gen with constant size = size, constant two_power_size = two_power_size, constant max_int = max_int, goal size_pos, goal two_power_size_val, goal max_int_val end theory BV16 constant size : int = 16 constant two_power_size : int = 0x1_0000 constant max_int : int = 0xFFFF clone export BV_Gen with constant size = size, constant two_power_size = two_power_size, constant max_int = max_int, goal size_pos, goal two_power_size_val, goal max_int_val end theory BV8 constant size : int = 8 constant two_power_size : int = 0x1_00 constant max_int : int = 0xFF clone export BV_Gen with constant size = size, constant two_power_size = two_power_size, constant max_int = max_int, goal size_pos, goal two_power_size_val, goal max_int_val end (** {2 Generic Converter} *) theory BVConverter_Gen type bigBV type smallBV predicate in_small_range bigBV function to_uint_small smallBV : int function to_uint_big bigBV : int function toBig smallBV : bigBV function toSmall bigBV : smallBV axiom toSmall_to_uint : forall x:bigBV. in_small_range x -> to_uint_big x = to_uint_small (toSmall x) axiom toBig_to_uint : forall x:smallBV. to_uint_small x = to_uint_big (toBig x) end (** {2 Converters of common size_bvs} *) theory BVConverter_32_64 use BV32 use BV64 predicate in_range (b : BV64.t) = BV64.ule b (BV64.of_int BV32.max_int) clone export BVConverter_Gen with type bigBV = BV64.t, type smallBV = BV32.t, predicate in_small_range = in_range, function to_uint_small = BV32.to_uint, function to_uint_big = BV64.to_uint end theory BVConverter_16_64 use BV16 use BV64 predicate in_range (b : BV64.t) = BV64.ule b (BV64.of_int BV16.max_int) clone export BVConverter_Gen with type bigBV = BV64.t, type smallBV = BV16.t, predicate in_small_range = in_range, function to_uint_small = BV16.to_uint, function to_uint_big = BV64.to_uint end theory BVConverter_8_64 use BV8 use BV64 predicate in_range (b : BV64.t) = BV64.ule b (BV64.of_int BV8.max_int) clone export BVConverter_Gen with type bigBV = BV64.t, type smallBV = BV8.t, predicate in_small_range = in_range, function to_uint_small = BV8.to_uint, function to_uint_big = BV64.to_uint end theory BVConverter_16_32 use BV16 use BV32 predicate in_range (b : BV32.t) = BV32.ule b (BV32.of_int BV16.max_int) clone export BVConverter_Gen with type bigBV = BV32.t, type smallBV = BV16.t, predicate in_small_range = in_range, function to_uint_small = BV16.to_uint, function to_uint_big = BV32.to_uint end theory BVConverter_8_32 use BV8 use BV32 predicate in_range (b : BV32.t) = BV32.ule b (BV32.of_int BV8.max_int) clone export BVConverter_Gen with type bigBV = BV32.t, type smallBV = BV8.t, predicate in_small_range = in_range, function to_uint_small = BV8.to_uint, function to_uint_big = BV32.to_uint end theory BVConverter_8_16 use BV8 use BV16 predicate in_range (b : BV16.t) = BV16.ule b (BV16.of_int BV8.max_int) clone export BVConverter_Gen with type bigBV = BV16.t, type smallBV = BV8.t, predicate in_small_range = in_range, function to_uint_small = BV8.to_uint, function to_uint_big = BV16.to_uint end why3-0.87.3/CHANGES0000644000175000017500000004642713035416743014253 0ustar guillaumeguillaume * marks an incompatible change Version 0.87.3, January 12, 2017 ================================ bug fixes o fixed OCaml extraction with respect to ghost parameters o assorted bug fixes Provers o support for Alt-Ergo 1.30 (released Nov 21, 2016) o support for Coq 8.6 (released Dec 8, 2016) o support for Gappa 1.3 (released Jul 20, 2016) * discarded support for Isabelle 2015 o support for Isabelle 2016-1 (released Dec 2016) o support for Z3 4.5.0 (released Nov 8, 2016) Version 0.87.2, September 1, 2016 ================================= bug fixes o improved well-formedness of extracted OCaml code o assorted bug fixes Version 0.87.1, May 27, 2016 ============================ bug fixes o assorted bug fixes Version 0.87.0, March 15, 2016 ============================== Language * Add new logical connectives "by" and "so" as keywords Tools o add a command-line option --extra-expl-prefix to specify additional possible prefixes for VC explanations. (Available for why3 commands "prove" and "ide".) * removed "jstree" style from the "session" command Transformations * All split transformations respect the "stop_split" label now. split_*_wp is a synonym for split_*_right * split_*_right split the left-hand side subformulas when they carry the "case_split" label * split_intro is now the composition of split_goal_right and introduce_premises Library * improved bitvector theories API * Renamed functions in Split_goal * split_intro moved to Introduction Encodings * When a task has no polymorphic object (except for the special cases of equality and maps) then the translation to SMT-LIB format is direct Provers * discarded support for Alt-Ergo versions older than 0.95.2 o support for Alt-Ergo 1.01 (released Feb 16, 2016) and non-free versions 1.10 and 1.20 o support for Coq 8.4pl6 (released Apr 9, 2015) o support for Coq 8.5 (released Jan 21, 2016) o support for Gappa 1.2.0 (released May 19, 2015) * discarded support for Isabelle 2014 o support for Isabelle 2015 (released May 25, 2015) and Isabelle 2016 (released Feb 17, 2016) o support for Z3 4.4.0 (released Apr 29, 2015) and 4.4.1 (released Oct 5, 2015) o support for Zenon 0.8.0 (released Oct 21, 2014) o support for Zenon_modulo 0.4.1 (released Jul 2, 2015) Distribution * non-free files have been removed: "boomy" icon set, javascript helpers for "why3 session html --style jstree" Version 0.86.3, February 8, 2016 ================================ bug fixes o assorted bug fixes provers o fix compilation issues with Coq 8.5 (the tactic for 8.5 now behaves like idtac on successfully proved goals) Version 0.86.2, October 13, 2015 ================================ bug fixes o assorted bug fixes Version 0.86.1, May 22, 2015 ============================ IDE o improved task highlighting for negated premises (contributed by Mikhail Mandrykin, AstraVer project) provers o support for Gappa 1.2 (released May 19, 2015) bug fixes o why3doc: garbled output Version 0.86, May 11, 2015 ========================== core o steps limit for reliable replay of proofs, available for Alt-Ergo and CVC4 o new transformations induction_pr and inversion_pr to reason with inductive predicates library * renamed theory int.NumOfParam into int.NumOf; the predicate numof now takes some higher-order predicate as argument (no more need for cloning). Similar change in modules array.NumOf... * improved theory real.PowerReal o new theory: sequences o new theories for bitvectors, mapped to BV theories of SMT solvers Z3 and CVC4 provers o support for Coq 8.4pl5 (released Nov 7, 2014) o support for Z3 4.3.2 (released Oct 25, 2014) o support for MetiTarski 2.4 (released Oct 21, 2014) o support for Alt-Ergo 0.99.1 (released Dec 30, 2014) o support for Alt-Ergo 1.00.prv (released Jan 29, 2015) o support for veriT 201410 (released Nov 2014) o support for Psyche (experimental, http://www.lix.polytechnique.fr/~lengrand/Psyche/) o preliminary support for upcoming CVC4 1.5 (steps feature) IDE o config file not automatically saved anymore at exit. Configuration is saved on disk for future sessions if, and only if, preferences window is exited by hitting the "Save&Close" button o right part of main window organized in tabs. o better explanations and task highlighting (contributed by Mikhail Mandrykin, AstraVer project) bug fixes o bug in interpreter in presence of nested mutable fields o IDE: proofs in progress should never be "cleaned" o IDE: display warnings after reload Version 0.85, September 17, 2014 ================================ langage * fix a soundness bug in the detection of aliases when calling a WhyML function: some alias could have been forgotten when a type variable was substituted with a mutable type sessions o use the full path of identifiers when the user introduces namespaces (BTS #17181) transformations * fix a soundness bug in "compute_in_goal" regarding the handling of logical implication. o several improvements to "compute_in_goal": . left-hand side of rewrite rules can be any symbols, not only non-interpreted ones. . perform beta-reduction when possible . the maximal number of reduction steps can be increased using meta "compute_max_steps" . the transformation is documented in details in the manual o new transformation "compute_specified": less aggressive variant of "compute_in_goal". Unfolding of definitions is controlled using meta "rewrite_def". o fixed a bug in "eliminate_if" when applied on inductive definitions provers o fixed wrong warning when detecting Isabelle2014 Version 0.84, September 1, 2014 =============================== tools * file generated by "why3session html f.mlw" is now "f/why3session.html" and not "f/f.html" * the default behavior of why3 has been moved to the "prove" subcommand * options --exec, --extract, and --realize, have been moved to subcommands: execute, extract, and realize * why3replayer has been moved to the "replay" subcommand * other tools have been moved to why3 subcommands too: config, doc, ide, session, wc; for local usage, the old commands are still available proof sessions o session files are split in two parts: "why3session.xml" and "why3shapes". The latter file contains the checksums and the shapes for the goals. That second file is not strictly needed for replaying a proof session, it is only useful when input programs are modified, to track obsolete goals. If Why3 is compiled with compression support (provided by ocamlzip library) then files for shapes are compressed into why3shapes.gz. library * renamed array.ArraySorted -> array.IntArraySorted array.ArraySorted is now generic, with type and order relation parameters * reduced amount of "use export" in the standard library: theories now only export the symbols they define. Users may need to insert more "use import" in their theories (typically int.Int, option.Option, list.List, etc.). provers * fixed Coq printer (former Coq proofs may have to be updated, by removing non-emptiness constraints from polymorphic type applications) o support for Coq8.4pl4 o support for Isabelle2014 o support for CVC4 1.4 o updated support for TPTP TFA syntax (used by provers Beagle and Princess) transformations o new transformation "compute_in_goal" that simplifies the goal, by computation, as much as possible Version 0.83, March 14, 2014 ============================ syntax o extra semicolons are now allowed at end of blocks o new clause "diverges". Loops and recursive calls not annotated with variants will generate a warning, unless the "diverges" clause is given o clauses "reads" and "writes" now accept an empty set * modified syntax for "abstract": abstract end o types in quantifiers are now optional o formulas and Boolean terms can be used interchangeably library * removed inconsistency in libraries map.MapPermut and array.ArrayPermut (names, definitions, and meaning of symbols "permut..." have been modified) provers o new version of prover: Coq 8.4pl3 o new version of prover: Gappa 1.1.0 o new version of prover: E prover 1.8 * Coq 8.3 is no longer supported o improved support for Isabelle2013-2 * fixed Coq printer (former Coq proofs may have to be updated, with extra qualification of imported symbols) tools o new option --exec to interpret WhyML programs; see doc chapter 8 o new option --extract to compile WhyML programs to OCaml; see doc chapter 8 and modules/mach/{int,array}.mlw * [why3replayer] renamed option -obsolete-only to --obsolete-only, -smoke-detector to --smoke-detector, -force to --force * [why3replayer] replay now fails if new goals are added API o new type-inferring API for logical terms and program expressions miscellaneous o fixed compilation bug with lablgtk 2.18 Version 0.82, December 12, 2013 =============================== o lemma functions o polymorphic recursion permitted o opaque types o new prover: Metitarski (2.2, contribution by Piotr Trojanek) o new prover: Metis (2.3) o new prover: Beagle (0.4.1) o new prover: Princess (2013-05-13) o new prover: Yices2 (2.0.4) o new prover: Isabelle (2013-2, contribution by Stefan Berghofer) o new version of prover: Alt-Ergo 0.95.2 o new version of prover: CVC4 1.1 & 1.2 & 1.3 o new version of prover: Coq 8.4pl2 o new version of prover: Gappa 1.0.0 o new version of prover: SPASS 3.8ds o new version of prover: veriT (201310) o API: more examples of use in examples/use_api/ o why3session csv can create graph with option --gnuplot [png|svg|pdf|qt] o shape algorithm modified (see VSTTE'13 paper) but is backward compatible thanks to shape_version numbers in why3session.xml files * options name and default of why3session csv changed * [emacs] why.el renamed to why3.el * [GTK sourceview] why.lang renamed to why3.lang * Loc.try[1-7] functions now take location as an optional parameter o [fix] remove extra leading zeros in decimal literals when a prover don't like them o [fix] PVS output: types are always non-empty o [fix] PVS: fixed configuration and installation process o [fix] Coq tactic: now loads dynamic plug-ins o [fix] bug #15493: correct Coq output for polymorphic algebraic data types * [fix] wish #15053: Remove proof time from "Goals proved by only one prover" section of why3session info --stats o [fix] bug #13736: why3ml was slow when there are many inclusions o [fix] bug #16488: decimals in TPTP syntax o [fix] bug #16454: do not send arithmetic triggers anymore to alt-Ergo o [fix] syntax highlighting bugs: should be fixed by removing the old language file alt-ergo.lang from alt-ergo distribution Version 0.81, March 25, 2013 ============================ o [prover] experimental support for SPASS >= 3.8 (with types) o [prover] support for Z3 4.3.* o [prover] fixed Coq 8.4 support for theory real.Trigonometry o [prover] support for CVC4 o [prover] support for mathematica o [prover] support for MathSAT5 o [logic] accept type expressions in clone substitutions o [whyml] support for relation chains (e.g., "e1 = e2 < e3") * [whyml] every exception raised in a function must be listed in as "raises { ... }" clause. A postcondition may be omitted and equals to "true" by default. * [whyml] if a function definition contains a "writes { ... }" clause, then every write effect must be listed. If a function definition contains a "reads { ... }" clause, then every read _and_ write effect must be listed. * [drivers] syntax rules, metas, and preludes are inherited through cloning. Keyword "cloned" becomes unnecessary and is not accepted anymore. Version 0.80, October 31, 2012 ============================== * [whyml] modified syntax for mlw programs; a summary of changes is given in Appendix A of the manual o [whyml] support for type invariants and ghost code o [api] Ocaml interfaces for constructing program modules o [transformation] experimental support for induction on integers and on algebraic types o [interface] new system of warnings, that includes: - form "exists x, P -> Q", likely an error - unused bound logic variables in "forall", "exists" and "let" o [replayer] new option -q, for running quietly * [session] improved output of "why3session latex"; LaTeX macros have more arguments o [prover] support for Coq 8.4 * [prover] dropped support for Coq 8.2 o [prover] support for forthcoming PVS 6.0, including realizations o [prover] support for iProver and Zenon o [prover] new output scheme for Coq using type classes, to ensures types are inhabited * [driver] theory realizations now use meta "realized_theory" instead of "realized" * [config] modifiers in --extra-config are now called [prover_modifier] instead of just [prover] Version 0.73, July 19, 2012 =========================== o [IDE] "Clean" was cleaning too much * no more executable why3ml (why3 now handles WhyML files) o [Provers] support for Z3 4.0 o [Sessions] a small change in the format. Why3 is still able to read session files in the old format. o completed support for the "Out Of Memory" prover result o [Why3ml] new construct "abstract e { q }" o [Coq output] quotes in identifiers remain quotes in Coq o [Coq output] default tactic is now "intros ..." with a pattern that matches the structure of the goal o [why3replayer] option -obsolete-only o workaround for a bug about modulo operator in Alt-Ergo 0.94 o fixed a consistency issue with set.Fset theory o co-inductive predicates o new option -e for "why3session latex" allows to specify when to split tables in parts Version 0.72, May 11, 2012 ========================== o [Coq] new tactic "why3" to call external provers as oracles o [Coq output] new feature: theory realizations (see manual, chapter 9) o new tool why3session (see manual, section 6.7) o new tool why3doc (see manual, section 6.8) o support for multiple versions of the same prover (see manual, section 5.5) o [why3ide] new features, including prover upgrade, alternate editors o complete support for limiting provers' memory usage o improved support on Microsoft Windows o fix BTS 14221 o fix BTS 14190 o fix BTS 12457 o fix BTS 13854 o fix BTS 13849 o [syntax] new syntax "constant x:ty" and "constant x:ty = e" to introduce constants, as an alternative to "function" o [TPTP] new parser for TPTP files with support for the newest TFA1 format (TPTP with polymorphic types and arithmetic) o [API] Dtype declaration kind is split into two: Dtype for declarations of a single abstract type or type alias, and Ddata for a list of (mutually recursive) algebraic types. Similarly, Dlogic declaration kind is split into Dparam for a single abstract function/predicate symbol and Dlogic for a list of (mutually recursive) defined symbols. Version 0.71, October 13, 2011 ============================== o [examples] a lot of new program examples in directory examples/programs o [Why3replayer] new option -latex to output a proof session in LaTeX format o [WhyML] significant improvement of the efficiency of the WP calculus o [WhyIDE] better coloring and source positioning including from front-ends such as Krakatoa and Jessie plugin of Frama-C o [WhyML] fixed labels and source locations in WPs o [Session] during reload, new method for pairing old and new subgoals based on goal shapes, stored in database. o [Session] prover versions are stored in database. A proof is marked obsolete if it was made by a prover with another version than the current. Version 0.70, July 6, 2011 ========================== New features o [WhyML] language and VC generator o [syntax] record types - introduced with syntax "type t = {| a:int; b:bool |}" actually syntactic sugar for "type t = `mk t' (a:int) (b:bool)" i.e. an algebraic with one constructor and projection functions - a record expression is written {| a = 1; b = True |} - access to field a with syntax x.a - update with syntax {| x with b = False |} - record patterns o new tool why3replayer: batch replay of a Why3 session created in IDE o [Alt-Ergo/Z3/CVC3/Yices output] support for built-in theory of arrays Fixes and other changes * [syntax] new syntax for conjunction (/\) and disjunction (\/) ("and" and "or" do not exist anymore) * [syntax] "logic" is not a keyword anymore, use "function" and "predicate" o [IDE] interactive detection of provers disabled because incompatible with session. Detection must be done with why3config --detect-provers o [IDE] bug 12244 resolved by using Task.task_equal o [IDE] tool "Replay" works o [IDE] tool "Reload" reloads the file from disk. No need to exit IDE anymore o [IDE] does not use Threads anymore, thanks to Call_provers.query_call o [IDE] displays explanations using labels of the form "expl:..." o [IDE] dropped dependence on Sqlite3 o [Alt-Ergo output] bugfix: no triggers for "exists" quantifier o [Coq output] bugfix: polymorphic inductive predicates o [Coq output] fixed bug 12934: type def with several type params * [API] functions to create an environment are now exported from Env * [API] calls to prover can now be asynchronous Driver.prove_task now returns some intermediate value (of type prover_call), which can be queried in two ways: - blocking way with Call_provers.wait_on_call - non-blocking way with Call_provers.query_call So old code performing "prove_task t () ()" should be translated to "wait_on_call (prove_task t ()) ()". Version 0.64, February 16, 2011 =============================== o configure: if possible, use ocamlfind to find lablgtk2 and sqlite3 o algebraic types: must be well-founded, non-positive constructors are forbidden, recursive functions and predicates must structurally terminate * syntax: /\ renamed into && and \/ into || o accept lowercase names for axioms, lemmas, goals, and cases in inductive predicates o labels in terms and formulas are not printed by default. o transformation split-goal does not split under disjunction anymore o fixed --enable-local o why.conf is no more looked for in the current directory; use -C or WHY3CONFIG instead o why.conf: when changed, a backup up copy is made in why.conf.bak o why.conf now contains a magic number; configuration must be rebuilt with why3config if the magic number has changed o why3config: --autodetect-provers renamed to --detect-provers --autodetect-plugins renamed to --detect-plugins new option --detect to perform both detections o why3config: --conf_file is replaced by -C and --config o TPTP: encoding by explicit polymorphism is not anymore the default encoding for TPTP provers. It is now forbidden to use this encoding in presence of finite types. o IDE: source file names are stored in database with paths relative to the database, so that databases are now easier to move from a machine to another (e.g when they are stored in source control repositories) o better Gappa output: support for sqrt, for negative constants Version 0.63, December 21, 2010 =============================== o first public release. See release notes in manual why3-0.87.3/configure.in0000644000175000017500000006260113035416743015561 0ustar guillaumeguillaume#################################################################### # # # The Why3 Verification Platform / The Why3 Development Team # # Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University # # # # This software is distributed under the terms of the GNU Lesser # # General Public License version 2.1, with the special exception # # on linking described in file LICENSE. # # # #################################################################### # # autoconf input for Objective Caml programs # Copyright (C) 2001 Jean-Christophe Filliâtre # from a first script by Georges Mariano # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Library General Public # License version 2, as published by the Free Software Foundation. # # This library 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. # # See the GNU Library General Public License version 2 for more details # (enclosed in the file LGPL). AC_INIT([Why3], m4_esyscmd([. ./Version; echo -n "$VERSION"])) # verbosemake AC_ARG_ENABLE(verbose-make, AS_HELP_STRING([--enable-verbose-make], [verbose makefile recipes]),, enable_verbose_make=no) # LOCAL_CONF AC_ARG_ENABLE(local, AS_HELP_STRING([--enable-local], [use Why3 in the build directory (no installation)]),, enable_local=no) # RELOCATABLE INSTALLATION AC_ARG_ENABLE(relocation, AS_HELP_STRING([--enable-relocation], [allow for later relocation of Why3 installation]),, enable_relocation=no) # NATIVE AC_ARG_ENABLE(native-code, AS_HELP_STRING([--disable-native-code], [use only the byte-code compiler]),, enable_native_code=yes) # Zarith AC_ARG_ENABLE(zarith, AS_HELP_STRING([--disable-zarith], [use Nums instead of Zarith for computations]),, enable_zarith=yes) # camlzip AC_ARG_ENABLE(zip, AS_HELP_STRING([--enable-zip], [use LZ compression to store session files]),, enable_zip=yes) # menhirLib AC_ARG_ENABLE(menhirLib, AS_HELP_STRING([--enable-menhirLib], [use MenhirLib parsing library]),, enable_menhirLib=yes) # IDE AC_ARG_ENABLE(ide, AS_HELP_STRING([--disable-ide], [do not build Why3 IDE]),, enable_ide=yes) # Coq tactic and libraries AC_ARG_ENABLE(coq-tactic, AS_HELP_STRING([--disable-coq-tactic], [do not build Coq "why3" tactic]),, enable_coq_tactic=yes) AC_ARG_ENABLE(coq-libs, AS_HELP_STRING([--disable-coq-libs], [do not build Coq realizations]),, enable_coq_libs=yes) # PVS libraries AC_ARG_ENABLE(pvs-libs, AS_HELP_STRING([--disable-pvs-libs], [do not build PVS realizations]),, enable_pvs_libs=yes) # Isabelle libraries AC_ARG_ENABLE(isabelle-libs, AS_HELP_STRING([--disable-isabelle-libs], [do not build Isabelle realizations]),, enable_isabelle_libs=yes) # hypothesis selection AC_ARG_ENABLE(hypothesis-selection, AS_HELP_STRING([--disable-hypothesis-selection], [do not support hypothesis selection]),, enable_hypothesis_selection=yes) # documentation AC_ARG_ENABLE(doc, AS_HELP_STRING([--disable-doc], [do not build documentation]),, enable_doc=yes) AC_ARG_ENABLE(html-doc, AS_HELP_STRING([--disable-html-doc], [do not build HTML documentation]),, enable_html_doc=yes) # Experimental Jessie3 Frama-C plugin, disabled by default AC_ARG_ENABLE(frama-c, AS_HELP_STRING([--enable-frama-c], [enable Frama-C plugin]),, [enable_frama_c=no reason_frama_c=" (disabled by default)"]) # profiling AC_ARG_ENABLE(profiling, AS_HELP_STRING([--enable-profiling], [enable profiling]),, enable_profiling=no) # Emacs compilation AC_ARG_ENABLE(emacs-compilation, AS_HELP_STRING([--disable-emacs-compilation], [do not compile why3.elc]),, enable_emacs_compilation=yes) # either relocation or local, not both if test "$enable_relocation" = yes ; then if test "$enable_local" = yes ; then AC_MSG_ERROR(cannot use --enable-relocation and --enable-local at the same time.) fi fi # Check for arch/OS AC_MSG_CHECKING(executable suffix) if uname -s | grep -q CYGWIN ; then EXE=.exe STRIP='echo "no strip "' CPULIMIT=cpulimit-win AC_MSG_RESULT(.exe ) else if uname -s | grep -q MINGW ; then EXE=.exe STRIP=strip CPULIMIT=cpulimit-win AC_MSG_RESULT(.exe ) else EXE= STRIP=strip CPULIMIT=cpulimit AC_MSG_RESULT() fi fi AC_PROG_CC AC_PROG_MKDIR_P AC_PROG_INSTALL # Check for Ocaml compilers # we first look for ocamlc in the path; if not present, we fail AC_CHECK_PROG(OCAMLC,ocamlc,ocamlc,no) if test "$OCAMLC" = no ; then AC_MSG_ERROR(Cannot find ocamlc.) fi # we extract Ocaml version number OCAMLVERSION=`$OCAMLC -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` echo "ocaml version is $OCAMLVERSION" case "$OCAMLVERSION" in 0.*|1.*|2.*|3.*|4.00.*) AC_MSG_ERROR(You need Objective Caml 4.01.0 or higher);; esac # Ocaml library path # old way: OCAMLLIB=`$OCAMLC -v | tail -1 | cut -f 4 -d ' ' | tr -d '\\r'` OCAMLLIB=`$OCAMLC -where | tr -d '\\r'` echo "ocaml library path is $OCAMLLIB" # then we look for ocamlopt; if not present, we issue a warning # if the version is not the same, we also discard it # we set OCAMLBEST to "opt" or "byte", whether ocamlopt is available or not AC_CHECK_PROG(OCAMLOPT,ocamlopt,ocamlopt,no) OCAMLBEST=byte if test "$OCAMLOPT" = no ; then AC_MSG_WARN(Cannot find ocamlopt; bytecode compilation only.) else AC_MSG_CHECKING(ocamlopt version) TMPVERSION=`$OCAMLOPT -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` if test "$TMPVERSION" != "$OCAMLVERSION" ; then AC_MSG_RESULT(differs from ocamlc; ocamlopt discarded.) OCAMLOPT=no else AC_MSG_RESULT(ok) OCAMLBEST=opt fi fi # checking for native-code if test "$enable_native_code" != yes || test "$OCAMLBEST" = byte ; then enable_native_code=no OCAMLBEST=byte OCAMLOPT=no fi # checking for ocamlc.opt AC_CHECK_PROG(OCAMLCDOTOPT,ocamlc.opt,ocamlc.opt,no) if test "$OCAMLCDOTOPT" != no ; then AC_MSG_CHECKING(ocamlc.opt version) TMPVERSION=`$OCAMLCDOTOPT -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` if test "$TMPVERSION" != "$OCAMLVERSION" ; then AC_MSG_RESULT(differs from ocamlc; ocamlc.opt discarded.) else AC_MSG_RESULT(ok) OCAMLC=$OCAMLCDOTOPT fi fi # checking for ocamlopt.opt if test "$OCAMLOPT" != no ; then AC_CHECK_PROG(OCAMLOPTDOTOPT,ocamlopt.opt,ocamlopt.opt,no) if test "$OCAMLOPTDOTOPT" != no ; then AC_MSG_CHECKING(ocamlc.opt version) TMPVER=`$OCAMLOPTDOTOPT -v | sed -n -e 's|.*version* *\(.*\)$|\1|p' ` if test "$TMPVER" != "$OCAMLVERSION" ; then AC_MSG_RESULT(differs from ocamlc; ocamlopt.opt discarded.) else AC_MSG_RESULT(ok) OCAMLOPT=$OCAMLOPTDOTOPT fi fi fi # ocamldep, ocamllex and ocamlyacc should also be present in the path AC_CHECK_PROG(OCAMLDEP,ocamldep,ocamldep,no) if test "$OCAMLDEP" = no ; then AC_MSG_ERROR(Cannot find ocamldep.) else AC_CHECK_PROG(OCAMLDEPDOTOPT,ocamldep.opt,ocamldep.opt,no) if test "$OCAMLDEPDOTOPT" != no ; then OCAMLDEP=$OCAMLDEPDOTOPT fi fi AC_CHECK_PROG(OCAMLLEX,ocamllex,ocamllex,no) if test "$OCAMLLEX" = no ; then AC_MSG_ERROR(Cannot find ocamllex.) else AC_CHECK_PROG(OCAMLLEXDOTOPT,ocamllex.opt,ocamllex.opt,no) if test "$OCAMLLEXDOTOPT" != no ; then OCAMLLEX=$OCAMLLEXDOTOPT fi fi AC_CHECK_PROG(OCAMLYACC,ocamlyacc,ocamlyacc,no) if test "$OCAMLYACC" = no ; then AC_MSG_ERROR(Cannot find ocamlyacc.) fi AC_CHECK_PROG(OCAMLDOC,ocamldoc,ocamldoc,true) if test "$OCAMLDOC" = true ; then AC_MSG_WARN(Cannot find ocamldoc) else AC_CHECK_PROG(OCAMLDOCOPT,ocamldoc.opt,ocamldoc.opt,no) if test "$OCAMLDOCOPT" != no ; then OCAMLDOC=$OCAMLDOCOPT fi fi AC_CHECK_PROG(MENHIR,menhir,menhir,no) if test "$MENHIR" = no ; then AC_MSG_ERROR(Cannot find menhir.) fi ## Where are the library we need # we look for ocamlfind; if not present, we just don't use it to find # libraries AC_CHECK_PROG(USEOCAMLFIND,ocamlfind,yes,no) if test "$USEOCAMLFIND" = yes; then OCAMLFINDLIB=$(ocamlfind printconf stdlib) OCAMLFIND=$(which ocamlfind) if test "$OCAMLFINDLIB" != "$OCAMLLIB"; then USEOCAMLFIND=no; echo "but your ocamlfind is not compatible with your ocamlc:" echo "ocamlfind : $OCAMLFINDLIB, ocamlc : $OCAMLLIB" fi fi if test "$enable_local" = no; then LOCALDIR='' else LOCALDIR="${PWD}" fi if test "$enable_local" = yes ; then OCAMLINSTALLLIB=$LOCALDIR/lib else #if ocamlfind is used it gives the install path for ocaml library if test "$USEOCAMLFIND" = yes; then OCAMLINSTALLLIB=$(ocamlfind printconf destdir) else OCAMLINSTALLLIB=$OCAMLLIB fi fi # bin-annot case "$OCAMLVERSION" in 0.*|1.*|2.*|3.*) enable_bin_annot=no;; *) enable_bin_annot=yes;; esac # checking for rubber if test "$enable_doc" = yes ; then AC_CHECK_PROG(RUBBER,rubber,rubber,no) if test "$RUBBER" = no ; then enable_doc=no enable_html_doc=no reason_doc=" (rubber not found)" AC_MSG_WARN([Cannot find rubber, documentation disabled.]) fi else enable_html_doc=no fi # checking for hevea (note that the pdf documentation DOES NOT use hevea.sty) if test "$enable_html_doc" = yes ; then AC_CHECK_PROG(HEVEA,hevea,hevea,no) if test "$HEVEA" = no ; then enable_html_doc=no reason_html_doc=" (hevea not found)" AC_MSG_WARN([Cannot find hevea, HTML documentation disabled.]) fi fi # checking for hacha if test "$enable_html_doc" = yes ; then AC_CHECK_PROG(HACHA,hacha,hacha,no) if test "$HACHA" = no ; then enable_html_doc=no reason_html_doc=" (hacha not found)" AC_MSG_WARN([Cannot find hacha, HTML documentation disabled.]) fi fi # checking for emacs if test "$enable_emacs_compilation" = yes ; then AC_CHECK_PROG(EMACS,emacs,emacs,no) if test "$EMACS" = no ; then enable_emacs_compilation=no AC_MSG_WARN([Cannot find emacs, compilation of why3.elc disabled.]) fi fi # checking for Zarith if test "$enable_zarith" = yes; then if test "$USEOCAMLFIND" = yes; then BIGINTINCLUDE=$(ocamlfind query zarith) fi if test -n "$BIGINTINCLUDE"; then echo "ocamlfind found zarith in $BIGINTINCLUDE" BIGINTINCLUDE="-I $BIGINTINCLUDE" else AC_CHECK_FILE($OCAMLLIB/zarith/zarith.cma,,enable_zarith=no) if test "$enable_zarith" = no; then AC_MSG_WARN([Lib Zarith not found, using Nums instead.]) reason_zarith=" (zarith not found)" else BIGINTINCLUDE="-I +zarith" fi fi fi if test "$enable_zarith" = yes; then BIGINTLIB=zarith BIGINTPKG=zarith else BIGINTLIB=nums BIGINTPKG=num fi # checking for camlzip if test "$enable_zip" = yes; then if test "$USEOCAMLFIND" = yes; then ZIPINCLUDE=$(ocamlfind query zip) fi if test -n "$ZIPINCLUDE"; then echo "ocamlfind found camlzip in $ZIPINCLUDE" ZIPINCLUDE="-I $ZIPINCLUDE" else AC_CHECK_FILE($OCAMLLIB/zip/zip.cma,,enable_zip=no) if test "$enable_zip" = no; then AC_MSG_WARN([Lib camlzip not found, sessions files will not be compressed.]) reason_zip=" (camlzip not found)" else ZIPINCLUDE="-I +zip" fi fi fi if test "$enable_zip" = yes; then ZIPLIB=zip else ZIPLIB= fi if test "$enable_menhirLib" = yes; then if test "$USEOCAMLFIND" = yes; then MENHIRINCLUDE=$(ocamlfind query menhirLib) fi if test -n "$MENHIRINCLUDE"; then echo "ocamlfind found menhirLib in $MENHIRINCLUDE" MENHIRINCLUDE="-I $MENHIRINCLUDE" else AC_CHECK_FILE($OCAMLLIB/menhirLib/menhirLib.cmx,,enable_menhirLib=no) if test "$enable_menhirLib" = no; then AC_MSG_WARN([Lib menhirLib not found, parser source files will be bigger.]) reason_menhirLib=" (menhirLib not found)" else MENHIRINCLUDE="-I +menhirLib" fi fi fi if test "$enable_menhirLib" = yes; then MENHIRLIB=menhirLib else MENHIRLIB= fi # checking for lablgtk2 if test "$enable_ide" = yes ; then if test "$USEOCAMLFIND" = yes; then LABLGTK2LIB=$(ocamlfind query lablgtk2) fi if test -n "$LABLGTK2LIB";then echo "ocamlfind found lablgtk2 in $LABLGTK2LIB" else LABLGTK2LIB="+lablgtk2" AC_CHECK_FILE($OCAMLLIB/lablgtk2/lablgtk.cma,,enable_ide=no) if test "$enable_ide" = no; then AC_MSG_WARN([Lib lablgtk2 not found, IDE disabled.]) reason_ide=" (lablgtk2 not found)" fi fi fi # checking for lablgtksourceview2 if test "$enable_ide" = yes ; then if test "$USEOCAMLFIND" = yes; then LABLGTKSV2LIB=$(ocamlfind query lablgtk2.sourceview2) if test -z "$LABLGTKSV2LIB"; then LABLGTKSV2LIB=$(ocamlfind query lablgtksourceview2) fi fi if test -n "$LABLGTKSV2LIB";then echo "ocamlfind found lablgtksourceview2 in $LABLGTKSV2LIB" else AC_CHECK_FILE($OCAMLLIB/lablgtk2/lablgtksourceview2.cma,,enable_ide=no) if test "$enable_ide" = no; then AC_MSG_WARN([Lib lablgtksourceview2 not found, IDE disabled.]) reason_ide=" (lablgtksourceview2 not found)" fi fi fi if test "$enable_ide" = yes ; then LABLGTK2PKG="lablgtk2 lablgtk2.init lablgtk2.sourceview2" else LABLGTK2PKG= fi dnl AC_CHECK_PROG(enable_ide,lablgtk2,yes,no) not always available (Win32) dnl AC_CHECK_PROG(OCAMLWEB,ocamlweb,ocamlweb,true) # Coq enable_coq_support=yes enable_coq_fp_libs=yes coq_compat_version= if test "$enable_coq_tactic" = no -a "$enable_coq_libs" = no; then enable_coq_support=no AC_MSG_WARN(coq support disabled) reason_coq_support=" (disabled by user)" fi if test "$enable_coq_support" = yes; then AC_CHECK_PROG(COQC,coqc,coqc,no) if test "$COQC" = no ; then enable_coq_support=no AC_MSG_WARN(Cannot find coqc.) reason_coq_support=" (coqc not found)" fi fi if test "$enable_coq_support" = yes; then COQLIB=`$COQC -where | sed -e 's|\\\|/|g' -e 's| |\\ |g'` AC_MSG_CHECKING(Coq version) COQVERSION=`$COQC -v | sed -n -e 's|.*version* *\([[^ ]]*\) .*$|\1|p' ` #Even if the name of the variable is CAMLP4 the value can be camlp5 CAMLP4BIN=`coqtop -config | sed -n -e 's/CAMLP4BIN=\(.*\)$/\1/p'` CAMLP4=`coqtop -config | sed -n -e 's/CAMLP4=\(.*\)$/\1/p'` COQCAMLPLIB=`coqtop -config | sed -n -e 's/CAMLP4LIB=\(.*\)$/\1/p'` case $COQVERSION in 8.4*) coq_compat_version="COQ84" COQPPLIBS="$COQLIB/parsing/grammar.cma" AC_MSG_RESULT($COQVERSION) ;; 8.5*) coq_compat_version="COQ85" COQPPLIBS="$OCAMLLIB/unix.cma $OCAMLLIB/threads/threads.cma $COQLIB/grammar/grammar.cma" AC_MSG_RESULT($COQVERSION) ;; 8.6*|trunk) coq_compat_version="COQ86" COQPPLIBS="$OCAMLLIB/unix.cma $OCAMLLIB/threads/threads.cma $COQLIB/grammar/grammar.cma" AC_MSG_RESULT($COQVERSION) ;; *) enable_coq_support=no AC_MSG_WARN(You need Coq 8.4 or later; Coq discarded) reason_coq_support=" (version is $COQVERSION but need version 8.4 or later)" ;; esac fi if test "$enable_coq_support" = yes; then AC_CHECK_PROG(COQDEP,coqdep,coqdep,no) if test "$COQDEP" = no; then enable_coq_support=no AC_MSG_WARN(Cannot find coqdep.) reason_coq_support=" (coqdep not found)" fi fi if test "$enable_coq_support" = no; then enable_coq_tactic=no enable_coq_libs=no COMPILETIMECOQ= else COMPILETIMECOQ="\\\"Coq\\\", \\\"$COQVERSION\\\"; " fi if test "$enable_coq_tactic" = yes; then AC_CHECK_FILE($COQLIB/kernel/term.cmi,,enable_coq_tactic=no) if test "$enable_coq_tactic" = no; then reason_coq_tactic=" ($COQLIB/kernel/term.cmi not found)" fi fi if test "$enable_coq_tactic" = yes; then AC_PATH_PROG(COQCAMLP,${CAMLP4}o,no,$CAMLP4BIN) if test "$COQCAMLP" = no; then enable_coq_tactic=no AC_MSG_WARN(Cannot find camlpXo.) reason_coq_tactic=" (camlpXo not found)" fi fi if test "$enable_coq_libs" = yes; then AC_MSG_CHECKING([for Flocq]) AS_IF( [ echo "Require Import Flocq.Flocq_version BinNat." \ "Goal (20500 <= Flocq_version)%N. easy. Qed." > conftest.v "$COQC" conftest.v > conftest.err ], [ AC_MSG_RESULT(yes) ], [ AC_MSG_RESULT(no) enable_coq_fp_libs=no AC_MSG_WARN(Cannot find Flocq.) reason_coq_fp_libs=" (Flocq >= 2.5 not found)" ]) rm -f conftest.v conftest.vo conftest.err fi # PVS if test "$enable_pvs_libs" = no; then enable_pvs_support=no AC_MSG_WARN(PVS support disabled) reason_pvs_support=" (disabled by user)" else AC_CHECK_PROG(PVS,pvs,pvs,no) if test "$PVS" = no ; then enable_pvs_support=no AC_MSG_WARN(Cannot find pvs.) reason_pvs_support=" (pvs not found)" else PVSLIB=`$PVS -where` AC_MSG_CHECKING(PVS version) PVSVERSION=`$PVS -version | sed -n -e 's|.*Version* *\([[^ ]]*\)$|\1|p' ` case $PVSVERSION in 6.*) enable_pvs_support=yes AC_MSG_RESULT($PVSVERSION) ;; *) AC_MSG_RESULT($PVSVERSION) enable_pvs_support=no AC_MSG_WARN(You need PVS 6.0 or higher; PVS discarded) reason_pvs_support=" (need version 6.0 or higher)" ;; esac fi fi if test "$enable_pvs_support" = no; then enable_pvs_libs=no COMPILETIMEPVS= else COMPILETIMEPVS="\\\"PVS\\\", \\\"$PVSVERSION\\\"; " fi # Isabelle if test "$enable_isabelle_libs" = no; then enable_isabelle_support=no AC_MSG_WARN(Isabelle support disabled) reason_isabelle_support=" (disabled by user)" else AC_CHECK_PROG(ISABELLE,isabelle,isabelle,no) if test "$ISABELLE" = no ; then enable_isabelle_support=no AC_MSG_WARN(Cannot find isabelle.) reason_isabelle_support=" (isabelle not found)" else AC_MSG_CHECKING(Isabelle version) ISABELLEDETECTEDVERSION=`$ISABELLE version | sed -n -e 's|Isabelle\([[^:]]*\).*$|\1|p' ` case $ISABELLEDETECTEDVERSION in 2016-1*) enable_isabelle_support=yes ISABELLEVERSION=2016-1 AC_MSG_RESULT($ISABELLEDETECTEDVERSION) ;; 2016*) enable_isabelle_support=yes ISABELLEVERSION=2016 AC_MSG_RESULT($ISABELLEDETECTEDVERSION) ;; *) AC_MSG_RESULT($ISABELLEDETECTEDVERSION) enable_isabelle_support=no AC_MSG_WARN(You need Isabelle 2016 or later; Isabelle discarded) reason_isabelle_support=" (need version >= 2016)" ;; esac fi fi if test "$enable_isabelle_support" = no; then enable_isabelle_libs=no fi if test "$enable_pvs_libs" = yes; then AC_MSG_CHECKING([for NASA PVS library]) enable_pvs_libs=no reason_pvs_libs=" (no NASA PVS library in PVS_LIBRARY_PATH)" for dir in `echo $PVS_LIBRARY_PATH | tr ':' ' '`; do if test -f $dir/nasalib-version; then enable_pvs_libs=yes reason_pvs_libs="" fi done AC_MSG_RESULT($enable_pvs_libs) fi # hypothesis_selection if test "$enable_hypothesis_selection" = yes; then if test "$USEOCAMLFIND" = yes; then OCAMLGRAPHLIB=$(ocamlfind query ocamlgraph) fi if test -n "$OCAMLGRAPHLIB"; then echo "ocamlfind found ocamlgraph in $OCAMLGRAPHLIB" else OCAMLGRAPHLIB="+ocamlgraph" AC_CHECK_FILE($OCAMLLIB/ocamlgraph/,,enable_hypothesis_selection=no) if test "$enable_hypothesis_selection" = no; then reason_hypothesis_selection=" (ocamlgraph not found)" AC_MSG_WARN([Lib ocamlgraph not found, hypothesis selection disabled.]) fi fi fi #check frama-c if test "$enable_frama_c" = yes ; then AC_CHECK_PROG(FRAMAC,frama-c,frama-c,no) if test "$FRAMAC" = no ; then AC_MSG_WARN(Cannot find Frama-C.) enable_frama_c="no" reason_frama_c=" (frama-c not found)" else AC_MSG_CHECKING(Frama-C version) FRAMAC_VERSION=`$FRAMAC -version | sed -n -e 's|Version: *\(.*\)$|\1|p'` AC_MSG_RESULT($FRAMAC_VERSION) case $FRAMAC_VERSION in Sodium-*) ;; *) AC_MSG_WARN(Version Sodium required.) enable_frama_c=no reason_frama_c=" (version Sodium required)" ;; esac FRAMAC_SHARE=`$FRAMAC -print-path` FRAMAC_LIBDIR=`$FRAMAC -print-libpath` fi fi #For the META if test "$enable_hypothesis_selection" = yes; then META_OCAMLGRAPH="ocamlgraph" else META_OCAMLGRAPH="" fi #Viewer for ps and pdf dnl AC_CHECK_PROGS(PSVIEWER,gv evince) dnl AC_CHECK_PROGS(PDFVIEWER,xpdf acroread evince) VERSION=$PACKAGE_VERSION # substitutions to perform AC_SUBST(VERSION) AC_SUBST(enable_verbose_make) AC_SUBST(EXE) AC_SUBST(STRIP) AC_SUBST(CPULIMIT) AC_SUBST(OCAMLC) AC_SUBST(OCAMLOPT) AC_SUBST(OCAMLDEP) AC_SUBST(OCAMLLEX) AC_SUBST(OCAMLYACC) AC_SUBST(OCAMLDOC) AC_SUBST(OCAMLBEST) AC_SUBST(OCAMLVERSION) AC_SUBST(OCAMLLIB) AC_SUBST(OCAMLINSTALLLIB) dnl AC_SUBST(OCAMLV) dnl AC_SUBST(FORPACK) AC_SUBST(OCAMLGRAPHLIB) dnl AC_SUBST(OCAMLWEB) AC_SUBST(MENHIR) AC_SUBST(enable_profiling) AC_SUBST(enable_bin_annot) AC_SUBST(COQCAMLP) AC_SUBST(COQCAMLPLIB) AC_SUBST(enable_ide) AC_SUBST(LABLGTK2LIB) AC_SUBST(LABLGTK2PKG) AC_SUBST(META_OCAMLGRAPH) AC_SUBST(enable_zarith) AC_SUBST(BIGINTINCLUDE) AC_SUBST(BIGINTLIB) AC_SUBST(BIGINTPKG) AC_SUBST(enable_zip) AC_SUBST(ZIPINCLUDE) AC_SUBST(ZIPLIB) AC_SUBST(enable_menhirLib) AC_SUBST(MENHIRINCLUDE) AC_SUBST(MENHIRLIB) AC_SUBST(enable_coq_tactic) AC_SUBST(enable_coq_libs) AC_SUBST(enable_coq_support) AC_SUBST(enable_coq_fp_libs) AC_SUBST(coq_compat_version) AC_SUBST(COQC) AC_SUBST(COQDEP) AC_SUBST(COQLIB) AC_SUBST(COQPPLIBS) AC_SUBST(COMPILETIMECOQ) AC_SUBST(enable_pvs_libs) AC_SUBST(PVS) AC_SUBST(PVSVERSION) AC_SUBST(COMPILETIMEPVS) AC_SUBST(enable_isabelle_libs) AC_SUBST(ISABELLE) AC_SUBST(ISABELLEVERSION) AC_SUBST(enable_hypothesis_selection) AC_SUBST(enable_doc) AC_SUBST(enable_html_doc) AC_SUBST(RUBBER) AC_SUBST(HEVEA) AC_SUBST(HACHA) AC_SUBST(enable_emacs_compilation) AC_SUBST(EMACS) AC_SUBST(enable_frama_c) AC_SUBST(FRAMAC) AC_SUBST(FRAMAC_VERSION) AC_SUBST(FRAMAC_SHARE) AC_SUBST(FRAMAC_LIBDIR) AC_SUBST(enable_local) AC_SUBST(LOCALDIR) AC_SUBST(enable_relocation) dnl AC_SUBST(PSVIEWER) dnl AC_SUBST(PDFVIEWER) # Finally create the Makefile from Makefile.in AC_CONFIG_FILES(Makefile src/config.sh doc/version.tex) AC_CONFIG_FILES(lib/why3/META) AC_CONFIG_FILES(.merlin) AC_CONFIG_FILES(src/jessie/Makefile) AC_CONFIG_COMMANDS([chmod], chmod a-w Makefile src/config.sh doc/version.tex; chmod a-w lib/why3/META; chmod a-w .merlin; chmod a-w src/jessie/Makefile; chmod u+x src/config.sh) AC_OUTPUT # Summary echo echo " Summary" echo "-----------------------------------------" echo "Verbose make : $enable_verbose_make" echo "OCaml compiler : yes" echo " Version : $OCAMLVERSION" echo " Library path : $OCAMLLIB" echo " Native compilation : $enable_native_code" echo " Profiling : $enable_profiling" echo "Components" echo " IDE command : $enable_ide$reason_ide" echo " GMP arithmetic : $enable_zarith$reason_zarith" echo " Compressed sessions : $enable_zip$reason_zip" echo " MenhirLib support : $enable_menhirLib$reason_menhirLib" echo " Hypothesis selection : $enable_hypothesis_selection$reason_hypothesis_selection" echo " Frama-C support : $enable_frama_c$reason_frama_c" if test "$enable_frama_c" = yes ; then echo " Version : $FRAMAC_VERSION" echo " Share path : $FRAMAC_SHARE" echo " Library path : $FRAMAC_LIBDIR" fi echo "Documentation : $enable_doc$reason_doc" if test "$enable_doc" = yes ; then echo " PDF : yes" echo " HTML : $enable_html_doc$reason_html_doc" fi echo "Support for interactive proof assistants" echo " Coq : $enable_coq_support$reason_coq_support" if test "$enable_coq_support" = yes ; then echo " Version : $COQVERSION" echo " Library path : $COQLIB" echo " \"why3\" tactic : $enable_coq_tactic$reason_coq_tactic" echo " Realization support : $enable_coq_libs$reason_coq_libs" if test "$enable_coq_libs" = yes ; then echo " FP arithmetic : $enable_coq_fp_libs$reason_coq_fp_libs" fi fi echo " PVS : $enable_pvs_support$reason_pvs_support" if test "$enable_pvs_support" = yes ; then echo " Version : $PVSVERSION" echo " Library path : $PVSLIB" echo " Realization support : $enable_pvs_libs$reason_pvs_libs" fi echo " Isabelle : $enable_isabelle_support$reason_isabelle_support" if test "$enable_isabelle_support" = yes ; then echo " Version : $ISABELLEVERSION ($ISABELLEDETECTEDVERSION)" echo " Realization support : $enable_isabelle_libs$reason_isabelle_libs" fi if test "$enable_local" = yes ; then echo "Installable : no" else echo "Installable : yes" echo " Binary path : $bindir" echo " Lib path : $libdir/why3" echo " Data path : $datarootdir/why3" echo " Ocaml Library : $OCAMLINSTALLLIB/why3" echo " Relocatable : $enable_relocation" fi why3-0.87.3/share/0000755000175000017500000000000013035416743014345 5ustar guillaumeguillaumewhy3-0.87.3/share/vim/0000755000175000017500000000000013035416743015140 5ustar guillaumeguillaumewhy3-0.87.3/share/vim/why3.vim0000644000175000017500000002145613035416743016557 0ustar guillaumeguillaume" Vim syntax file " Language: Why3 " Filenames: *.why *.mlw " " Adapted from syntax file for Ocaml " For version 5.x: Clear all syntax items " For version 6.x: Quit when a syntax file was already loaded if version < 600 syntax clear elseif exists("b:current_syntax") && b:current_syntax == "why3" finish endif " Why3 is case sensitive. syn case match " " Script headers highlighted like comments " syn match whyComment "^#!.*" " lowercase identifier - the standard way to match syn match whyLCIdentifier /\<\(\l\|_\)\(\w\|'\)*\>/ syn match whyKeyChar "|" " Errors syn match whyBraceErr "}" syn match whyBrackErr "\]" syn match whyParenErr ")" syn match whyCommentErr "\(^\|[^(]\)\*)" syn match whyCountErr "\" syn match whyCountErr "\" syn match whyDoErr "\" syn match whyDoneErr "\" syn match whyThenErr "\" syn match whyTheoryErr "\" syn match whyModuleErr "\" syn match whyEndErr "\" " Some convenient clusters syn cluster whyAllErrs contains=whyBraceErr,whyBrackErr,whyParenErr,whyCommentErr,whyCountErr,whyDoErr,whyDoneErr,whyEndErr,whyThenErr,whyTheoryErr,whyModuleErr syn cluster whyContained contains=whyTodo,whyImport,whyExport,whyTheoryContents,whyModuleContents,whyNamespaceContents,whyModuleKeyword " ,whyPreDef,whyModParam,whyModParam1,whyPreMPRestr,whyMPRestr,whyMPRestr1,whyMPRestr2,whyMPRestr3,whyModRHS,whyFuncWith,whyFuncStruct,whyModTypeRestr,whyModTRWith,whyWith,whyWithRest,whyModType,whyFullMod,whyVal " Enclosing delimiters syn region whyEncl transparent matchgroup=whyKeyword start="(" matchgroup=whyKeyword end=")" contains=ALLBUT,@whyContained,whyParenErr syn region whyEncl transparent matchgroup=whyKeyword start="{" matchgroup=whyKeyword end="}" contains=ALLBUT,@whyContained,whyBraceErr syn region whyEncl transparent matchgroup=whyKeyword start="\[" matchgroup=whyKeyword end="\]" contains=ALLBUT,@whyContained,whyBrackErr " Comments syn region whyComment start="(\*\([^)]\|$\)" end="\(^\|[^(]\)\*)" contains=whyComment,whyTodo syn keyword whyTodo contained TODO FIXME XXX NOTE " Blocks " FIXME? match and try should detect the absence of "with" ? syn region whyEnd matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\" contains=ALLBUT,@whyContained,whyEndErr syn region whyEnd matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\" contains=ALLBUT,@whyContained,whyEndErr syn region whyEnd matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\" contains=ALLBUT,@whyContained,whyEndErr syn region whyEnd matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\" contains=ALLBUT,@whyContained,whyEndErr syn region whyEnd matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\" contains=ALLBUT,@whyContained,whyEndErr syn region whyNone matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\<\(to\|downto\)\>" contains=ALLBUT,@whyContained,whyCountErr syn region whyDo matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\" contains=ALLBUT,@whyContained,whyDoneErr syn region whyNone matchgroup=whyKeyword start="\" matchgroup=whyKeyword end="\" contains=ALLBUT,@whyContained,whyThenErr " Theories and modules syn region whyTheory matchgroup=whyKeyword start="\" matchgroup=whyModSpec end="\<\u\(\w\|'\)*\>" contains=@whyAllErrs,whyComment skipwhite skipempty nextgroup=whyTheoryContents syn region whyModule matchgroup=whyKeyword start="\" matchgroup=whyModSpec end="\<\u\(\w\|'\)*\>" contains=@whyAllErrs,whyComment skipwhite skipempty nextgroup=whyModuleContents syn region whyNamespace matchgroup=whyKeyword start="\" matchgroup=whyModSpec end="\<\u\(\w\|'\)*\>" contains=@whyAllErrs,whyComment,whyImport skipwhite skipempty nextgroup=whyNamespaceContents syn region whyTheoryContents start="^" start="."me=e-1 matchgroup=whyModSpec end="\" contained contains=ALLBUT,@whyContained,whyEndErr,whyTheory,whyModule syn region whyModuleContents start="^" start="."me=e-1 matchgroup=whyModSpec end="\" contained contains=ALLBUT,@whyContained,whyEndErr,whyTheory,whyModule syn region whyNamespaceContents start="^" start="."me=e-1 matchgroup=whyModSpec end="\" contained contains=ALLBUT,@whyContained,whyEndErr,whyTheory,whyModule syn region whyNone matchgroup=whyKeyword start="\<\(use\|clone\)\>" matchgroup=whyModSpec end="\<\(\w\+\.\)*\u\(\w\|'\)*\>" contains=@whyAllErrs,whyComment,whyString,whyImport,whyExport,whyModuleKeyword syn keyword whyExport contained export syn keyword whyImport contained import syn keyword whyModuleKeyword contained module syn region whyNone matchgroup=whyKeyword start="\<\(axiom\|lemma\|goal\|prop\)\>" matchgroup=whyNone end="\<\w\(\w\|'\)*\>" contains=@whyAllErrs,whyComment syn keyword whyKeyword as by constant syn keyword whyKeyword else epsilon exists syn keyword whyKeyword forall function syn keyword whyKeyword if in inductive coinductive syn keyword whyKeyword let meta syn keyword whyKeyword not predicate so syn keyword whyKeyword then type with syn keyword whyKeyword any syn keyword whyKeyword exception fun ghost syn keyword whyKeyword model mutable private syn keyword whyKeyword raise rec val while syn keyword whyBoolean true false syn keyword whyType bool int list map option real syn keyword whyType array ref unit syn keyword whySpec absurd assert assume check diverges ensures invariant syn keyword whySpec raises reads requires returns variant writes syn match whyConstructor "(\s*)" syn match whyConstructor "\u\(\w\|'\)*\>" syn match whyModPath "\u\(\w\|'\)*\."he=e-1 syn region whyString start=+"+ skip=+\\\\\|\\"+ end=+"+ syn match whyOperator "->" syn match whyOperator "<->\?" syn match whyOperator "/\\" syn match whyOperator "\\[/!?]\?" syn match whyOperator "&&" syn match whyOperator "<>" syn match whyKeyChar "|" syn match whyKeyChar ";" " FIXME? is this too inefficient? syn match whyOperator "[^<>~=:+*/%$&@^.|#!?]=[^<>~=:+*/%$&@^.|#!?]"ms=s+1,me=e-1 syn match whyOperator "^=[^<>~=:+*/%$&@^.|#!?]"me=e-1 syn match whyOperator "[^<>~=:+*/%$&@^.|#!?]=$"ms=s+1 syn match whyAnyVar "\<_\>" syn match whyNumber "\<-\=\d\(_\|\d\)*\>" syn match whyNumber "\<-\=0[x|X]\(\x\|_\)\+\>" syn match whyNumber "\<-\=0[o|O]\(\o\|_\)\+\>" syn match whyNumber "\<-\=0[b|B]\([01]\|_\)\+\>" syn match whyFloat "\<-\=\d\+[eE][-+]\=\d\+\>" syn match whyFloat "\<-\=\d\+\.\d*\([eE][-+]\=\d\+\)\=\>" syn match whyFloat "\<-\=0[x|X]\x\+\.\?\x*[pP][-+]\=\d\+\>" " Synchronization syn sync minlines=50 syn sync maxlines=500 syn sync match whyDoSync grouphere whyDo "\" syn sync match whyDoSync groupthere whyDo "\" syn sync match whyEndSync grouphere whyEnd "\<\(begin\|abstract\|match\|loop\|try\)\>" syn sync match whyEndSync groupthere whyEnd "\" syn sync match whyTheorySync grouphere whyTheory "\" syn sync match whyTheorySync groupthere whyTheory "\" syn sync match whyModuleSync grouphere whyModule "\" syn sync match whyModuleSync groupthere whyModule "\" syn sync match whyNamespaceSync grouphere whyNamespace "\" syn sync match whyNamespaceSync groupthere whyNamespace "\" " Define the default highlighting. " For version 5.7 and earlier: only when not done already " For version 5.8 and later: only when an item doesn't have highlighting yet if version >= 508 || !exists("did_why_syntax_inits") if version < 508 let did_why_syntax_inits = 1 command -nargs=+ HiLink hi link else command -nargs=+ HiLink hi def link endif HiLink whyBraceErr Error HiLink whyBrackErr Error HiLink whyParenErr Error HiLink whyCommentErr Error HiLink whyCountErr Error HiLink whyDoErr Error HiLink whyDoneErr Error HiLink whyEndErr Error HiLink whyThenErr Error HiLink whyTheoryErr Error HiLink whyModuleErr Error HiLink whyComment Comment HiLink whyModPath Include HiLink whyModSpec Include HiLink whyImport Keyword HiLink whyExport Keyword HiLink whyModuleKeyword Keyword HiLink whyConstructor Constant HiLink whyKeyword Keyword HiLink whyKeyChar Keyword HiLink whyAnyVar Keyword HiLink whyOperator Keyword HiLink whySpec Identifier HiLink whyNumber Number HiLink whyFloat Float HiLink whyString String HiLink whyBoolean Boolean HiLink whyType Type HiLink whyTodo Todo HiLink whyEncl Keyword delcommand HiLink endif let b:current_syntax = "why3" " vim: ts=8 why3-0.87.3/share/bash/0000755000175000017500000000000013035416743015262 5ustar guillaumeguillaumewhy3-0.87.3/share/bash/why30000644000175000017500000001025413035416743016101 0ustar guillaumeguillaume# bash completion for Why3 # To use this script you should have bash-completion package installed # Put it in /etc/bash_completion.d or just source it from your .bashrc _why3() { local cur prev words cword split if declare -F _init_completion > /dev/null ; then _init_completion -n = || return else _get_comp_words_by_ref -n = cur prev words cword fi case "$prev" in -T|--theory) # this only completes the first '-T' option # also, we cannot complete library theories unset words[cword] words[cword-1]="--print-namespace" theories=$(${words[@]} 2>/dev/null | grep '^[^ ]' | cut -d '-' -f 1) COMPREPLY=( $( compgen -W "$theories" -- "$cur" ) ) return 0 ;; -G|--goal) unset words[cword] words[cword-1]="--print-namespace" goals=$(${words[@]} 2>/dev/null | grep -- '-goal ' | sed -e 's/.*-goal //') COMPREPLY=( $( compgen -W "$goals" -- "$cur" ) ) return 0 ;; -C|--config|--extra-config) _filedir return 0 ;; -L|--library|-I) _filedir -d return 0 ;; -P|--prover) provers=$($1 --list-provers | grep '^ [^ ]' | cut -d ' ' -f 3) COMPREPLY=( $( compgen -W "$provers" -- "$cur" ) ) return 0 ;; -F|--format) formats=$($1 --list-formats | grep '^ [^ ]' | cut -d ' ' -f 3) COMPREPLY=( $( compgen -W "$formats" -- "$cur" ) ) return 0 ;; -t|--timelimit|-m|--memlimit) return 0 ;; -a|--apply-transform) transforms=$($1 --list-transforms | grep '^ [^ ]') COMPREPLY=( $( compgen -W "$transforms" -- "$cur" ) ) return 0 ;; -M|--meta) metas=$($1 --list-metas | grep '^ [^ ]' | grep -v '\[\(function/predicate\|type\) symbol\]' | grep -v '\[\(type\|proposition\|integer\)\]' | grep -v '\] \[' | sed -e 's/(flag) //' | sed -e 's/ \[string\]/=/') COMPREPLY=( $( compgen -W "$metas" -- "$cur") ) return 0 ;; -D|--driver) _filedir return 0 ;; -o|--output) _filedir -d return 0 ;; --install-plugin) _filedir return 0 ;; --add-prover) ids=$($1 --list-prover-ids | grep -v '^Known \|^$') COMPREPLY=( $( compgen -W "$ids" -- "$cur") ) return 0 ;; --smoke-detector) COMPREPLY=( $( compgen -W 'none top deep' -- "$cur" ) ) return 0 ;; --debug) flags=$($1 --list-debug-flags | grep '^ [^ ]' | cut -d ' ' -f 3) COMPREPLY=( $( compgen -W "$flags" -- "$cur" ) ) return 0 ;; --filter-prover) provers=$(${1/session/} --list-provers | grep '^ [^ ]' | cut -d ' ' -f 3) COMPREPLY=( $( compgen -W "$provers" -- "$cur" ) ) return 0 ;; --filter-obsolete|--filter-archived|--filter-verified-goal|--filter-verified) COMPREPLY=( $( compgen -W 'yes no all' -- "$cur" ) ) return 0 ;; --style) COMPREPLY=( $( compgen -W 'simpletree table' -- "$cur" ) ) return 0 ;; session) cmds=$($1 session --help | grep '^ [^-]' | cut -d ' ' -f 3) COMPREPLY=( $( compgen -W "$cmds --help -h" -- "$cur" ) ) return 0 ;; esac if [ $cword -eq 1 ] ; then cmds=$($1 --help 2>&1 | grep '^ [^ ]' | cut -d ' ' -f 3) COMPREPLY=( $( compgen -W "$cmds" -- "$cur" ) ) return 0 fi _filedir case "$cur" in -*) words[cword]="--help" opts=$(${words[@]} 2>/dev/null | grep '^ -' | cut -d ' ' -f 3) COMPREPLY=( $( compgen -W "$opts" -- "$cur" ) ) return 0 ;; esac } && complete -F _why3 why3 why3.opt why3.byte why3-0.87.3/share/latex/0000755000175000017500000000000013035416743015462 5ustar guillaumeguillaumewhy3-0.87.3/share/latex/why3lang.sty0000644000175000017500000000253413035416743017763 0ustar guillaumeguillaume \RequirePackage{listings} \RequirePackage{amssymb} \lstdefinelanguage{why3} { basicstyle=\ttfamily,% morekeywords=[1]{abstract,absurd,any,assert,assume,axiom,by,% check,clone,coinductive,constant,diverges,do,done,downto,% else,end,ensures,exception,exists,export,for,forall,fun,% function,ghost,goal,if,import,in,inductive,invariant,lemma,% let,loop,match,meta,model,module,mutable,namespace,not,old,% predicate,private,raise,raises,reads,rec,requires,result,% returns,so,then,theory,to,try,type,use,val,variant,while,% with,writes},% string=[b]",% %keywordstyle=[1]{\color{red}},% morekeywords=[2]{true,false},% %keywordstyle=[2]{\color{blue}},% %otherkeywords={},% commentstyle=\itshape,% columns=[l]fullflexible,% sensitive=true,% morecomment=[s]{(*}{*)},% %breaks hevea %escapeinside={*?}{?*},% keepspaces=true,% %literate=% % {'a}{$\alpha$}{1}% % {'b}{$\beta$}{1}% % {<}{$<$}{1}% % {>}{$>$}{1}% % {<=}{$\le$}{1}% % {>=}{$\ge$}{1}% % {<>}{$\ne$}{1}% % {/\\}{$\land$}{1}% % {\\/}{ $\lor$ }{3}% % {\ or(}{ $\lor$(}{3}% % {not\ }{$\lnot$ }{2}% % {not(}{$\lnot$(}{2}% % {+->}{\texttt{+->}}{3}% % {+->}{$\mapsto$}{2}% % {-->}{\texttt{-\relax->}}{3}% % {-->}{$\longrightarrow$}{2}% % {->}{$\rightarrow$}{2}% % {<-}{$\leftarrow$}{2}% % {<->}{$\leftrightarrow$}{2}% } \lstnewenvironment{why3}{\lstset{language=why3}}{} \newcommand{\whyf}[1]{\lstinline[language=why3]{#1}} why3-0.87.3/share/why3session.dtd0000644000175000017500000000725413035416743017350 0ustar guillaumeguillaume why3-0.87.3/share/emacs/0000755000175000017500000000000013035416743015435 5ustar guillaumeguillaumewhy3-0.87.3/share/emacs/why3.el0000644000175000017500000001516713035416743016663 0ustar guillaumeguillaume ;; why3.el - GNU Emacs mode for Why3 (defvar why3-mode-hook nil) (defvar why3-mode-map nil "Keymap for Why3 major mode") (if why3-mode-map nil (setq why3-mode-map (make-keymap)) ;; (define-key why3-mode-map "\C-c\C-c" 'why3-generate-obligations) **) ;; (define-key why3-mode-map "\C-c\C-a" 'why3-find-alternate-file) **) ;; (define-key why3-mode-map "\C-c\C-v" 'why3-viewer) **) (define-key why3-mode-map [(control return)] 'font-lock-fontify-buffer)) (setq auto-mode-alist (append '(("\\.\\(why\\|mlw\\)" . why3-mode)) auto-mode-alist)) ;; font-lock (defun why3-regexp-opt (l) (regexp-opt l 'words)) (defconst why3-font-lock-keywords-1 (list ;; Note: comment font-lock is guaranteed by suitable syntax entries '("(\\*\\([^*)]\\([^*]\\|\\*[^)]\\)*\\)?\\*)" . font-lock-comment-face) ; '("{}\\|{[^|]\\([^}]*\\)}" . font-lock-type-face) `(,(why3-regexp-opt '("invariant" "variant" "diverges" "requires" "ensures" "returns" "raises" "reads" "writes" "assert" "assume" "check")) . font-lock-type-face) `(,(why3-regexp-opt '("use" "clone" "namespace" "import" "export" "coinductive" "inductive" "external" "constant" "function" "predicate" "val" "exception" "axiom" "lemma" "goal" "type" "mutable" "model" "abstract" "private" "any" "match" "let" "rec" "in" "if" "then" "else" "begin" "end" "while" "for" "to" "downto" "do" "done" "loop" "absurd" "ghost" "raise" "try" "with" "theory" "uses" "module" "converter" "fun" "by" "so" "meta")) . font-lock-keyword-face) ) "Minimal highlighting for Why3 mode") (defvar why3-font-lock-keywords why3-font-lock-keywords-1 "Default highlighting for Why3 mode") (defvar why3-indent 2 "How many spaces to indent in why3 mode.") (make-variable-buffer-local 'why3-indent) ;; syntax (defvar why3-mode-syntax-table nil "Syntax table for why3-mode") (defun why3-create-syntax-table () (if why3-mode-syntax-table () (setq why3-mode-syntax-table (make-syntax-table)) (set-syntax-table why3-mode-syntax-table) (modify-syntax-entry ?' "w" why3-mode-syntax-table) (modify-syntax-entry ?_ "w" why3-mode-syntax-table) ; comments (modify-syntax-entry ?\( ". 1" why3-mode-syntax-table) (modify-syntax-entry ?\) ". 4" why3-mode-syntax-table) (modify-syntax-entry ?* ". 23" why3-mode-syntax-table) )) ;indentation ;http://www.emacswiki.org/emacs/ModeTutorial (defun why3-indent-line () "Indent current line as why3 logic" (interactive) (save-excursion (beginning-of-line) ;(debug) (if (bobp) ; Check for rule 1 (indent-line-to 0) (let ((not-indented t) cur-indent) (if (looking-at "^[ \t]*end") ; Check for rule 2 (progn (save-excursion (forward-line -1) (setq cur-indent (- (current-indentation) why3-indent))) (if (< cur-indent 0) (setq cur-indent 0))) (progn (if (looking-at "^[ \t]*\\(logic\\|type\\|prop\\)") ; check for clone (progn (save-excursion (forward-line -1) (if (looking-at "^[ \t]*\\(logic\\|type\\|prop\\).*,[ \t]*$") (progn (setq cur-indent (current-indentation)) (setq not-indented nil)) (if (looking-at "^[ \t]*clone.*with ") (progn (setq cur-indent (+ (current-indentation) why3-indent)) (setq not-indented nil) )))))) ;For the definition its very badly done... (if (looking-at "^[ \t]*$") ;; (save-excursion ;; (forward-line -1) ;; (setq cur-indent (current-indentation)) ;; (setq not-indented nil)) (progn (setq cur-indent 0) (setq not-indented nil)) (if (not (looking-at "^[ \t]*(\*.*")) (if (not (looking-at "^[ \t]*\\(logic\\|type\\|axiom\\|goal\\|lemma\\|inductive\\|use\\|theory\\|clone\\)")) (save-excursion (condition-case nil (save-excursion (backward-up-list) (setq cur-indent (+ (current-column) 1)) (setq not-indented nil)) (error (forward-line -1) (if (looking-at "^[ \t]*\\(logic\\|type\\|axiom\\|goal\\|lemma\\|inductive\\)") (setq cur-indent (+ (current-indentation) why3-indent)) (setq cur-indent (current-indentation))) (setq not-indented nil))))))) ;For inside theory or namespace (save-excursion (while not-indented (forward-line -1) (if (looking-at "^[ \t]*end") ; Check for rule 3 (progn (setq cur-indent (current-indentation)) (setq not-indented nil)) ; Check for rule 4 (if (looking-at "^[ \t]*\\(theory\\|namespace\\)") (progn (setq cur-indent (+ (current-indentation) why3-indent)) (setq not-indented nil)) (if (bobp) ; Check for rule 5 (setq not-indented nil))))))) (if cur-indent (indent-line-to cur-indent) (indent-line-to 0))))))) ; compile will propose "why3 ide file" if no Makefile is present (add-hook 'why3-mode-hook (lambda () (unless (file-exists-p "Makefile") (set (make-local-variable 'compile-command) (let ((file (file-name-nondirectory buffer-file-name))) (format "why3 ide %s" file)))))) (add-hook 'why3-mode-hook (lambda () (modify-syntax-entry ?_ "w"))) ;; setting the mode (defun why3-mode () "Major mode for editing Why3 programs. \\{why3-mode-map}" (interactive) (kill-all-local-variables) (why3-create-syntax-table) ; hilight (make-local-variable 'font-lock-defaults) (setq font-lock-defaults '(why3-font-lock-keywords)) ; indentation ;(make-local-variable 'indent-line-function) ;(setq indent-line-function 'why3-indent-line) ; OCaml style comments for comment-region, comment-dwim, etc. (set (make-local-variable 'comment-start) "(*") (set (make-local-variable 'comment-end) "*)") ; menu ; providing the mode (setq major-mode 'why3-mode) (setq mode-name "Why3") (use-local-map why3-mode-map) (font-lock-mode 1) ; (why3-menu) (run-hooks 'why3-mode-hook)) (provide 'why3) why3-0.87.3/share/images/0000755000175000017500000000000013035416743015612 5ustar guillaumeguillaumewhy3-0.87.3/share/images/fatcow.rc0000644000175000017500000000146513035416743017431 0ustar guillaumeguillaume[iconset fatcow] name = "FatCow" license = "readme-fatcow.txt" default = "delete" undone = "bullet_white" scheduled = "control_pause_blue" running = "control_play_blue" valid = "accept" unknown = "help" invalid = "exclamation" timeout = "time_delete" outofmemory = "database_delete" steplimitexceeded = "brick_delete" failure = "bomb" valid_obs = "bullet_green" unknown_obs = "bullet_blue" invalid_obs = "bullet_red" timeout_obs = "time_delete" outofmemory_obs = "database_delete" steplimitexceeded_obs = "brick_delete" failure_obs = "bullet_black" yes = "accept" no = "delete" file = "package" theory = "folder" goal = "script" prover = "magic_wand_2" transf = "multitool" #TODO change metas metas = "ddr_memory" editor = "pencil" replay = "update" cancel = "cancel" reload = "delete" remove = "delete" cleaning = "bin" why3-0.87.3/share/images/fatcow/0000755000175000017500000000000013035416743017075 5ustar guillaumeguillaumewhy3-0.87.3/share/images/fatcow/folder.png0000644000175000017500000000207613035416743021063 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxWoG}3S!/ $$*b*T!UwDUVS䀐ʩVD Tp,p*m4vC8Nnul'Zy$z5{~3J)X4osրO9kBJ0 ^:VXLt}mm`sf{GG Cybe4KCw_̞YXP2U3@+l8ӌmbϬ"0ɥ0W1G~_h&.5_-vύ%B%0(/1Um~լmTh^eM%lо%/ . L)݅Դ I{r-qĞ 2c[ں_YZFbKKh%BS5e]UuuzGhMS>ѽChFg䋕k|5ZI2 ׇ{8ת{ވW8eZ6qmHՏ5~6zn&5?#`{`eOQO{8.f |ˇf ;=  {wP9XgM .I!Vؓ~l슍Ȅ*u׈ql&q_,qvl b85eMcs[?3%ĺ cGC:=z3W0tzkMc'6reH6q)x?fXZ(d'>>8s#Ae&(º8>='f5\m/oq+{3. ϟYȾң,nqO0/NcI }7uX˓^{Y3{H'fq p)IO6sӈ&­d霟 NP]ewqiK=FLqN{}@hΣ/@׿6o`s[h IENDB`why3-0.87.3/share/images/fatcow/magic_wand_2.png0000644000175000017500000000234713035416743022123 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxԗ{h[U.vH9J bY@ӭ+$-k 8 łi)M]u}lNVD6utm4}inzN{oY^{Kp׋Q|ϫ<|i\ 'wri:/lgQti)ȱC0I1 *%6`+^&)(de2|NIrQ[n(`N2=aXyl;KhӶP=dT.`nv ^mHllmHD +x(MU~ hS@lx#%k*sP*] Wt]mW_/q[%sRrYYVޕ0vs P^ίP edk=n6 7D1m*9Xqb(t8[EmyR'[sK1+ٿs 0QH qpvv8jh|ܾeX&kfv _?a޾AuuI3'}۟_rvt7mW9fl||@kz<\%\J9*CVٰ /t`%$˚&E&XKTxYY-&$!o1茅֊0~9 b5XIX&@=r^p\Ɔ <|ܣ712[)@<[P}|hߒ4vx8?m `ӧ;:y6OqE x>RǹR|QS*|lf@Sfp6#qt|c@ bPYp8ĵq>H5\*%AP+oFyLj0N)v .0N\lv(ViZnr1&iz$@zKC\s Tl*{/LRIQjBqK>kz0]ь%!#3h=|ȷju3Éy|D9 n;l!Mt: KˬΌFњ@VDjlkb|dfr5>~Fj，- @k4"XeeU sa6ռ^^{Őkqn'l/`oneIENDB`why3-0.87.3/share/images/fatcow/bullet_green.png0000644000175000017500000000134413035416743022254 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxVKSa~sΎLEPABƢxAMX7v^T@tc?Q`BEH[4Sgs[[眩 ωA};i9$y\ PB͝hGpaLy 3hBBE +'\%@>Ս>֋'ǁFxmD:h/?Bb1u:Z)I \ \>skO?BzNl9Gpyg ık8^7t I k/_߉DiFCVn!S1TQe090"nuxJAb2eIk1cs0ھ4T~ә7ek=c"J3= 2Q\ j3Xi}s9k i2AhUbp9넀Cd((+א9sa.pbDUIԆ6jkh-3Ocx6|JieDZ1~®8JmU&Jv}KLNYr3"p Y(I%pXrp*AܿjǛP$ ] ?6Td$IENDB`why3-0.87.3/share/images/fatcow/bin.png0000644000175000017500000000356413035416743020363 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxڬW]lTkڻ[XPl.Dۄ8$EiW*QE>DKU*G/Uۗ%C{Mzm]߽3LǍ4:{37s̅i'oq4#GSZ(zl(Gmt8͛Q_ͳOOy O7ڒ÷nllRw?(A9DB`^E6&6Zo} ~<=-OG45L$u]:xo`VӀā_t_3+0 .;l¢id~C(鋨vᅗ_շoB)ECu=o܈$qC'y*2 ;b}2?V@? /ߏv,.޾ǘz=[Zw`{#x/7~g>.|qF 0#L%y?55!$Dy`dWЎ?:t)f:>`PC۶e ܵbO6w#6wֶW]{*(ΩK8O]W+!xӗEa'1E'''e/xL1gMxBt~#G^p?Q-8vS,]2g%kkkPGхR3P( Á|>ttvum6ͺXR;/R)*VDC2F ǹQAg<cyl#[**+e04 f)$ K:0'%d,nY hgUBIyagn .:xBe@^\Vشc#wdP բ!@5E*3L ~pNmn:(0; E#Flĕ=O$(|4 ABhԖE6x3S+I1!"cYq%]hkE,Z w+++ uQihhfs0u jP?d|_ D>F’l\u╦)N@ll.Cwc2d=_ŅńnHo?="i&Jq2y[֘[ +so% hg7 suC%Y Bvʫ;[RpJ`fo4,\t6m,kuS(^yjD# O]?skXSvm/5Y j===|{Hdm} Ζ iN LJsjt:E{>EAO3樖l`?S*;cZ/wC|MeH[*JoCXp<@ZU)fFPVdQY@>N\YJ78t3IENDB`why3-0.87.3/share/images/fatcow/bomb.png0000644000175000017500000000403713035416743020526 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxڼWil\>ofx(mR M(N@T!DUG+U!,R6DbQ~UH! [Xǁ$؃'>={}MIȏott-~=; ĥ=ix[WKO_l DŽe3eнƷ&ggDۖko&ա%w s ƦjHIݾԃ?7CLOQL@=N]!7xᖚxo!'r=+cx^T]*7ࢗ*>i17UVuwP]Shh ѱQK40޾ PN>׺5qf*n삨CEjoG0`7FFFX? W_ҎO@.$;~}Ҟ 냆rmUuhfs'$sP4\JOCŲ !LR!͂81%iO??"Y 0ABr)뾥g[WAY'hZw *ؾm3|q0zŶ,lmN ??H%HB䭅搣zrٰ2A,! w^ WnWCC}= $@" A n.{'Id6 v׋my[} pz_`jtf`b_`T-H 9{qiX D"#Xht ]0 W؄ۚxM+\2pOnjJwkKXzu a-Y8;)a jP]] _~9^8,D& Y>o`H}ƞ057lki=(|p s\_ڮgkq"EH $1of㻐@cCN{L,"ʲ|W<g{ ף)PeqHa:A' X.4$}uCG3zB^dC8adEF lP Ç`~~dYA22D !=bh 4 6I9 I wEHL4Ib *P]p1\,4(o] f"s,Ϲ|)aEJD!P@2b$AfԎQ ZXKzIG\aE*|H./( K=+ p| 0#azՒF/iR7\+<Ty!6VQ%,\X4Ѐ+ƍ1s/`20{A]a-Ø*Ed#^gՍ:˗^_ ?KoKxޅtrNK0LnQj 7zj0${ rDcG-) At3 'i|bFCW,BZGFNRU5E@AwD!@mK6"+&@?tPV{A  1-,wBvf@]NC݃{`&ڷlQ$L 3g(EXI|soz(I m϶l;ִV. CqbFA144=Ux=>d,UHD4 3!"о O贏˿`=h KMRTA&Wt dgp©l]~ģj㘛z˯Z X~k1ԫA!|)yjtObtwL Jt] w^&,~:xjn Ue (X(H.!2,Lk%»| --쿊ě `̌ZklDt\};|{j2) @K% Io|/!'0>= wBpe{Y Ow}G#Ni}O ?l6wDw=s'>ֽ7婭$(eb#Og^"M'S)-qE:s!xvi > @ ҟ ME,ope\xm}Ѐ˕BM=Gx@4HS} !1p \g-E =AP(ڭ=;|#'b*`"G? x7XD8|~o`cI޺O'm\KSlbɑc3I" p "XA$l\Y%%]K=w^vJ $F AA3Ȇp7VܽЊCm/Y@N'((GR'1TI4^о1RԷ=YV/m+ӌB (B@czvuH>t4{VK*e(֭6umOnu?!Ye݂aq $$bD44xX00bl_'876 PLS;Jչh-b2Nt&aq/#BMBwg%x:M0ED8nG.Mhi4bJ* ,CtzbO0qswpVQrw#25A<SqWGĄxbS΄l D_:|/92> _xOJLZT:k[0XT9GS=սQʳ?1@=tNi?YeIRf,p^ʌ~Z}b |0_? 68nkUTA}-fಛIe{R[HaL@KTXEqò<1kҖ,6}@(ne5啲ᄖIRahZFވ qB^<<>A((pNh[T{rJMj\p-d3 `䤪fF }j\ȱ6U`/sгl 0!AպaUYg@E]%5MԈwÄ$FcBc!V?-OR$˽h`_Nš k3- Ť@z;6rZ O947TΌFqng)b4g#`S)xdnA rT~ϝ.GyiZ}<jѫ|wAEPW X -kU[pԜ텦hM)er\?>\8n_241rtGhӃD06(@ * :|Ht4F=L1TZxak~ENJd1:IH[0aECt|# n,vlhTw֡| }RORl.r ڷ?[Fl>k?iam䁭;Pfs@nXl1b13{7ľR_ k::a/5B8eW[D~罍KR&tr+;OwsJˁt i:`:讬RL&)DU\GsyFnRMv:bZ9ZEQyMUm+m^ow$3Me*VZW}Ql .K}-n ⃂/(-uU[ZӚvƚl'd2s=g2dfg w&sws RJVxQ #A0PbB9k|ґ#Ϗ1fMKI&.Gv. <}\qtْ=/~z2Ztj+U`0xA 3Ųetgmͥ-V_AcAm74 dC!ો^>u] b0cPr o"ff6*iOZ_7~h0* e)T+fA9X,'X VHԋSl([چP(._⟁[-bV9b("DcA| ǦO`=:,**v.N[莣 QRLn93XĔJht1BOZRܺh$hBD4hE/=VWSCd μ j4j_ >ИIENDB`why3-0.87.3/share/images/fatcow/delete.png0000644000175000017500000000353613035416743021054 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxڬW[lgz/^Y8NHlQcJR(K!} !QU*!E*X%HI[)!ik'N|O^_\8矱c>Z{g9w.`׫}"4x>}?OQ>r6Qk+|׏tmUG@5qIsX,O]Euީ\';vP:JD~s2GK'PVeb>KC?!w+v:oNO?FyhՉq8{4k]聱w?b 5A-7QL <=;|h탧=~ ` C˨$.<vį׏'f);?y5{{Oa^  r!?CY4سyxw"qszsc\nUb:}[ `}!HD ͉P؅%ZE@/b~)K ?9lr'oür"oҾ݋t 0DX[;:`yGbs=L0zeۗU\p$!lC%. F&tsM>҂oj~ 7MjxZx'l DJ7?#B:[clvh8Wml B_%"D!(uXm FDR;HYf4DwWRf)}|ۦo:' V%3AN؅b{yg띠+4=LNqZ( 4 iwɗGr/s8HvfCշjFB=$E#;ߗ={Q]-WQ@R:_ zH&$ѵIzbRUH$3Cv_NWF ^!v݌ 0WҎIENDB`why3-0.87.3/share/images/fatcow/help.png0000644000175000017500000000433713035416743020542 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxڜWkpT>6!l@SGiJV?NXgl?iEeM[#3t- I , lv7w{  !9s%ߺ%; Ig$d\ё&?U^J7꿫ֵve+4{ 0ryē:&04:0zۋ'U(OY^xXv vyZ!HD$ə8z%֗z~h>-YPSX8q)D0aG=O UX^mUD/>Ǩ?46 |-hXn=5h Y(yHE6ga r@'/⋳xo_Qƽ#yOX[Th"@(4KT:cqg zV>@)aȲk'.1Tofg{7mX |`CU#*2 K%,2d7>h >Ԍd:ɸ3NCY&W۵ʖ7֨bQ}O 9Y uQ-BOYcfu$դ)d*v? ur`C:{4s.0n$4>4THJx9Vd|ːӢa|!\n66PAn+R%oq.lGwYYwo^c a\*VԌ0:GSGE\Sa͇D"C^$6G K+c?O$0M)I}j{ęB_ںWę)ARR!,nLC.i\u*q!>y#HsNUf!Jw ӧva۲`x. |mi`>0L?>vS$!ei#.xΗOsW6ۛ*t&IN7һ ZHs$zeɶM4ջ55:-bT0\8f4/jlhWТܺ'Wj U.idFD=z+]m$;xQSu:< WG FI<_@Ą`aJVgAsmfoYMP[I5E iYl#Eb.mL#hlPA:FK 6 ～st:/97ww>ei EQQ۾ڵ ^rMMvQW[GHOL9IĢk™^tm,L[~E0Pz5ys&dp;-ތ`E n߆mm`X|jyYO1~u:p߃:Ex٧0; ]'Nhg7|ǯ5FX]]XRRi}D JK gː li`6 '`6SNP h<2ҥKKK\prٲe RO)`iHkVf P,PBrv x\rP__%7!^vt'"R/B(S.YI8f|Fs. +l0&$$lve?0fmh~V kjXd "ARh?MVe]#7r?Ǫw(+['x^n3u!V3n3065߭Ery"^+6\iy_~W.%p?XXףcpBꪯopB*`QoZK[2iMgWI`:p^/KRH)uL3^NF:^cC><.v)ziou\3%r%!4!ءgaUqT[Ḃјܔ'J~2uS78n<4p2aU.xR(vLbԈ4GQQq4X`ͥL?U)PK)2\cGW̃%yH 6Bk !5A)Q#C^ 'I'j'V.ѺBQ.CUubq@Jw;QU:^Q Z$ |0Nbȝ3f:,,81@2M$9cְ3#( r~=Du:5*%ܱH,̦\&W8PZj hY| /G3?ZSK8tɝODJoۙnL,0 e* 0AՐ!ӎՙ;(,@8}eK5f o0 R +3J*R]0TM:pL&W撀S/`et {)RTX^D, oضWr.BSLЖpQYT=\0|ߠa,|b B$Fo'),GQw'^m l6(9M0یQYyKލ[WPr4*_xc<}mo >yG0X5nd {DJ#ck|.(h'%[~S0)Cg`/gN:ߦݽ:zze4 4,P:1]@oo30HMtG
-\0?|oVѫ{YZ\X"n%QK&$'TWD;v;և';q4P~TDhI7T7OHD1p`1:MY.EKQ@QŽ/,[l)y~JjHF qd)udu,3NEŐ<^0XcskQR0sOOmqĈ&),+vq >:~9PC(J%;s$|Hߔ{;@<Ά;?;ɘVG[Åv?}w{*[.(]\dtfMqwח"MʗH&6q`pۙ?"uU曭]wwg,*)d6Y2&}iS3nw|69#&a{k*<U@r.u -?ںަgT7E8e=]VqKig!U0׏ Nُ?z 9t3YꂭQCr2yEZ_v^&b?$8+`IENDB`why3-0.87.3/share/images/fatcow/time_delete.png0000644000175000017500000000465013035416743022070 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe< JIDATxڜW PTkZ&Lfj}DM5ijK[k j'FƠ,w{2{!(c;Oz>gvɋ^ֱ`\/%8&Njڔ_GSS5,w/߯[ Ł@JN{ChcT hjD/S'5Vf,Xִ(9Q_]XN({ۏ~1L?AfOE预 5t\J2yb9b^|q,W6, S)F7nU0{ܮ v>UuS D2N&'l+ٸwV;<F UBA)AEk*$Ͳꁶ#( ۖª.I<.w ˗&F̆E%&)ИbC-h0ύOHFJVq iO3Ef4}4Gf ⣃ga@ש[yboٰ4I@1q+Y,~:BW&~D^>:M *LDn.Rb2=LJK+ A9B[HFz@t:=N'(a/D9 .5Q.=?q׋\!׮, 06]d@R5ChdBK!$1)&ӫ*gY7p9$` @#{z3UKsUܖ!+-g PSmKTetpRؓy3hJB 8Ybuʣ:tDS)lvr}aי$UM bN%Sb-?BL_E6u"u{X0obrQݵd[y^9bƈ6-@mqe 4U%ip5l ",(J5Q #k XX<ÿҝ(7?B ~ Z˾wx̪hz{yE)+%cqP蚰꺁9z[a=< (>ɏn-tn5@:$_iRsH3/z%4d uDIЈ0 Wo9Ǻ@F2֊9J18^B'zʩ6Hm3nB݃kא ˷o$3ˬ[XZˋ3HF(`%jWvVQɪz6+#og:Y]|v*CβAH\lŦduZ|m <׎o"EH+So2.*u4`@#"xru0~Z,B[Fdo+҂(hHzNi4B\nڒ#9cCcA[JH]X;mfS/ izwԻaNXE)  oyhjhp}}T w R*..g#k|`4d=(e{1=a\$W?f+aBBDs'lEW2\L(Dh޺Ep:BS3ROL>1+4zӊ۹LJ\S&UŽdQ|\Mxal!W{}OqBe*k*j6uϳ֩u".$}-+3u@LIENDB`why3-0.87.3/share/images/fatcow/control_play_blue.png0000644000175000017500000000366313035416743023327 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<UIDATxڜW{L}s@"LQˬ*vvٺ.Kivkc-ɲ6lgKLu1bKVf z(t}߷.xp=0gt'tQzT0~GDE]{-eYʒH܆(6Ed+nu?o!I)d%+!g\嬛 % FDR[Qy]x9GMO( b8yY'aUٽb~Y~oaoD8I,x~L'AN주uqc)h_n 0@C &nH4 5˭|FUŔ]'31qre27D&E˟}C)ܲ$w ٌqv^;7ӥDNb*Y0d|\<n8 "̢ ,(c^u'}d@׭YJYbF \{CX7涫RPW 3|)G>|*wP|uϮBЇ $nAVnXvijȗؐ j;GNv@uN-9ա ]L_Js2NγfI6[HT5u7n'GE(A=η>r/ q>˜䫘e̚֍I:&3)7OĜ4zێ5Ω4A=x!fz k,)P@tӜ xZ>||h򕌯zd=Y/..j6= 7'ݜHf]8Њwvm CN"r`mq7#+ynRh\ԮӨ~yδvYAR"DjƲ)Lk>k&յɞL2 5wG[yәv&_S~rnXZ'͙<Ty~3VɗR/N֋񑡮@ Vھj']>A%x[eݾ0 #rѾwojuO~%+64B:!IQ'o0d'٨8~N=E<Me #jbpIENDB`why3-0.87.3/share/images/fatcow/ddr_memory.png0000644000175000017500000000156513035416743021753 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxWMhAf6JZ =xQDz M zh&x*Xm AK$PtZ&mb҃`^^f as4r(hh h h hFue;QfL7^hR~x_̽UUqpTvn0cY&16˕r=m8#Tq]pkr]>;m@ ~!|(I#xt?KR@z6WsżcfZ*d|:L+TMSt ΕT5ljxt3U'89Dr5/= p}ՉH {Ղo?V5n2g!sJbd$0`k0tAU8,N+CCt v8դOщ\x1gNWOmBFk9e\x.I@.K>~RL .t]EmE.k* EoEg8 wڋUX ɷnAC{ cG{M C <|kSR1ڏX >4_@}8znLaH) Brr"IT0;:{MYZ_z\'LxRdl9s;2|G:!ѷu bO?>yZDHJƙ~%5akM}d;vWMu"rSd2cdRb?!6%ˠ?MM_ 4@eIENDB`why3-0.87.3/share/images/fatcow/database_delete.png0000644000175000017500000000346313035416743022677 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxڬWYlTe{lSHT6Dj>hAc.1 >d&$nq J "H*-t:L;xN 7sz{￝s&^Ⅽo_y7iBeYV2i޿y/npKoOab145ŠiZyD#J#N#_4玧Q7}F;/^ PiE݅g{gSR :\6{DjdUS;ۗ-*F]pڰ:]]Y~*a1xY.ln`6ܼF=6G~J280G ʹz`~bpI2kkAqt&X˨뀦C5FPs+c8:_G$IF5CF5 QTqd|ഋ]LJH$3T2%Y<4BQ@7tʱJŐwmΤqtZLhͥ <UhF8~BcQ) tRd2p2YbU\7F=tE"S8+VƱ??yMlL%B#[ 4b DBaBCPxG %*%Ĕt&Q"VZl>a: hEp5Da$ l}i & 2.)E̖lS|9f}~I)KlŦpMCpqd|'-TH 1!ˣ,K)HA󸩮Âc,) 4TUO CC_E KNr VQ:U[(C3WqͦVƂBtcl~h;ރwns+ 7?\qyv,-]Gjͦ0p}kki}9̴Y oDlӭЂAW+"sve߰n+!tTxO)Py~ оiTAנڻlUkc՗j~=r?;Qٹ7:7n@NȊTq9nSR |.}q]< 1A@A?T߱C/_ |`ϡE4B;8O,A"qw>-蝨`y,UjB՞ IENDB`why3-0.87.3/share/images/fatcow/pencil.png0000644000175000017500000000153113035416743021055 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxڼKHTQufZhԚBRC D5&[YmMA\JQF=!#J GWj#kiT޾+L΁os΁wsi5,ǹ'. o˯eCZ(RFb 0o#B:6jniq:6WN>~$E/|0^S!b"Мl#q)&-=^szJO`0x+O+ jb$1Krgݗҁ۫4%=r_x K UWkIENDB`why3-0.87.3/share/images/fatcow/bullet_blue.png0000644000175000017500000000143013035416743022077 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<IDATxVOHQ?u5 :X"!:t ZnS:DHԥCtP$aɰKQbB&3e]w˼Ǿy24a+[<GT[zqTLs aK..o@cfEEb[XcH?*` !-=ױ]UA7tXK~%@1"eGc1`.>^b(ٹǃ GFKms쑸hNkGR Ŗލ~)yOк</uNI&GC<F2r=q`w}ˡ~~M{yxe*Qm(H /G^}ɰYw_MrH; ;_(uAIENDB`why3-0.87.3/share/images/fatcow/timeline.png0000644000175000017500000000517613035416743021422 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe< IDATxڔW pTH6yl6y5IHxEP a)#SkTq @[R̀aP(CĠ7dǽl28̜wS9k dQTWU5҄de@ʼn;Ν5muZS{1발_en55,//ҧ/+Ylo>z?ܾ୭P'%#(1ف҃pB;}ɐ$R8܍% =ޥI' ׇDI|"K%HN2@g]f69yyڏ ݋o 39s"QFEkU%5cuUVW7Zӟ=8o^ᬫpS!NZr^Ff3F൳P{!_GSoj 'Oπu .'MJ=ckikq{X=MM uP{#*&O"vV%6 pt/ev9iHTOf̝zQYY['1ѓ%%%]ݘr]I*. #NܸRKyh롽1dU C$, { tii8s,֯_FM-r<<(.^3n(.\ekʰXa;~*~Ly]8ixtc0Ŷ)B]{gff,н trSxZdTW 11Z[4 bHM0@x!SsrqVBOnZ .Gvmb h5Z*B>n͸qHR4#p  K/~̟7HB{K+Ji3x%cώW1Hɳ %́h#gg8F(&&N ܨ`~~:c۶f[;fNK ;3 QY"a[tdf!$0LeZ`LJ D_{ر[KJpAt0wt[8}Li̘HA#fq SS(!FU8[[[Zy$eJe(}?v@{M-2ᣡ^,|0_'b(51y>e)! S'M: |6rΡ0$dI7ΝW"# 7:z)K(X  +w _PYȌ(tc=H3Кh1jjH\hʨ2Om؀ bkܜT@$i)-,U(HB'[]ߩz)8K٪PۨdϏfRLv)C‰` .q+mvv+*N%'{:3 hE2i͛7mԊEEIj6e.,V%m.Vj}kw 6<8~4vr~A (xH٩*h}}}XHa[ALa`յ;,ftx * ;14<#T-Kzx-') A!˙^jEuM5|TG_a~qhhHуk^OER1`%\<'|0\;f\%%VD]**G?<4HqŊN@`/_Y$6VG}'N4i (GhMke,]NN'hX1y7&چ ~叏Ӓ DINHHNLL*᠔U#%!* … u}ONrn'Qu!Rv M7zgˤ9*ZOԢy1 X=33stZobT,@r|н=~mFrJ݌Yi(00~T((J3  qC3A$/&MFFF ]NGp⥔FU5[^qEB>44 I/lfdVP.6zJG~ sq 22UWW[I*gN*#gɔ8.>:)D$]$=^p\~s^GvDÂyS qsHi&d93I*1lZC!; &f1+hZIbç2`tRi[X2x]^8$aLBJQ67?`9'a|& (r|6G,a7zsNbwE>ïGW@[*(єRh܆H|T69z|04 >Yh} nz6 ͏$Pvmۋ*3O~ThmCYF8!غ 3X ̈́#4wmD#7֩Ĕ;'Eo=-e>Y /yyǃ8Ljns͛p:""6oZ2'vn>vteA6*O#NO36p[F4.[iݭ "r7Y}I-oVA16T Q)C+" og˽C gqKOUgJEA!AnE΀HgнGAw8jD^˹zMkz~-ݶ|_{J$֡]gA[4~v=#[Ek咜[SZfg[遣{.#Џ!G|r6+g)Ⱥ4Zي&D*ZkYptF6Ȉt0%8\j]~=8xD(_~b9SBl ˄Ř4zr&:r)`'|(Zrndl& >^XK8P'\ee[Kȃ[κ8{01 G,Qc{kT f bLV'z]hBڂ-bwIQ^vQZ`O >s8xlٰG7h!-!eE0׶*ev96)mȔ \vҧ"#6t)I6\t-[%o=rvQY.zeO`fsƳMpWd  Va i"5h(uTVai ! Rl[ 3xHfj IxIĻv὜E' y:?>OeNьEB]ڽ].4r#Mz#1|1p=aQt.o|G,7I5IYAG]X h6ɖڝNKymTJ-,^y_U sB39IENDB`why3-0.87.3/share/images/fatcow/cancel.png0000644000175000017500000000326113035416743021032 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<SIDATxڔWklU>>iKZI*a|'Mc"'5!j5JH0P^ DYM`R`۲3ٝ}ingvy|{F@˿ﶎ0̔?[s/SeN|5Z.n4?:# `y0440u t|8轡L@W72W -Ӻt|n3PCNZ W$0N&6Pe m0:7l:l 0L]r/\>~"Q)-ϬIõ /`V?DWuCA\=_D)ϭ9O=7,r֐,ȱmZ)XC*!/rU:>{.hUï䁌cBAh :%Nԝ; t{fWiLztė: ӊSˬ<<ϗaRrO.Rr0|a|2L 5%ʑ ޥ}<kJc/yT85zw9J$b ؘNﻳk|0ͷDKaXa0&op$ ΣqMA9!]A(@4]%i$&◮ 1B 0rZݵ3=\)|<ޕ^آ!PE1@,0v5(֠cI$ӕןܡe@̄-ҋtHl- 6a Cw' \4pR1Ⱦ=^fɒ2 m{@&]NUHP=5 !Y!]M9Ho}SJpnCNJidHtt#gܵDJw,/UIaY>ge"RQf]'%Lb.c"#eҕӓ -KQïA5ɐ,.(JVV@6'1~7m1[@m磙m@p4}@b6 ;*6|Vֹ~-` zȭ_?UAD7=`Zu3@Aݸdbz&@kj)&v\7MK pE&Q wxK&Z*5.(?0zi$ꔣB@ΞgyXXi?PxX( u>T)Fqg b Ƚ Y vN"w~3mM"ǿcg\1rEa7I-v~ h2a]$lFN*ݪ]x)8rD0$uJN1ry#NCbΝYsx:A(idMڝѓgWP&ܖ\ nM5&ñ,lHC9##`:7=6ndAt55ZjSrNuC'`|my%hw{לnk:a^3'"(& $'GԭƔ?HJ9gU4+TG]$*kF3a_?P`~zq@50E"]0V?,,`IENDB`why3-0.87.3/share/images/fatcow/control_pause_blue.png0000644000175000017500000000365213035416743023475 0ustar guillaumeguillaumePNG  IHDR szztEXtSoftwareAdobe ImageReadyqe<LIDATxڜW{LSg?~-H0ET4#1>٦q3Ƹe-F=٦&1=Lf2TdL'NS*UiQ@w|Z|͹{wxu;DJq@_@효{;{.Z.Ew;`AL$k "DOUɀkw9YM0 YuxJVw;VO$0!z2ABJu#R_B țS Ok'!sG=ߍ#O յѿGFs;N]{tf1_ xO_jVQ29ș8n:y%7d YO cݧaܱ@"ޛǠr 4-fJL7zu!dm!;LXvɲկgC+n#/Prh C7#w7y,WaifBmj9EKf6\C+x2E 6V+_dD_1./ݹtlE.v\7Z3#SU&,MY I7Vt0`5P =C:H&݋O9`zڿd(ND<1gGEC2,}6;51VJ2;y1w!U3]hMW=i ހ +Eƭa%n)=5 DAn6A"^|н6 Fx$mz7"UCXchmWęxo^"9vq0It8k,P IX2f:*JF3xqrEp ݾ;WU{$YIE*mxs2Ix! Э8>{Pڛn 'x DHnԀŹpG _Ʃ/ޞByb7ASP'6SkV|TcݫYt)G8sx& NHO4x'cor=}/A-/6 IN*rފ=g0HI`P}?-^|yNiJ$;҈'۴is͎G~Iߔ ϖ.B1M4 cw+KzR-mi' VZ'`R5F.[d2VSW@O]5|1V Pj"H@<]i]١h7غ3[_pfV3} @5cT>H2%# ?Ӊ6LB_ 7Ùv]5 tz5C@ك^nQ`hsiz?wN]/j͗ HR_7Rd}9M1ER8zgρIENDB`why3-0.87.3/share/images/fatcow/readme-fatcow.txt0000644000175000017500000000242213035416743022354 0ustar guillaumeguillaumeFree FatCow-Farm Fresh Icons http://www.fatcow.com/free-icons FatCow Farm-Fresh final release (3926 icons, 5 parts): - fatcow-hosting-icons-3.9.2.zip default (10.9 Mb) - fatcow-hosting-icons-3.9.2-color.zip (11.1 Mb) - fatcow-hosting-icons-3.9.2-grey.zip (6.9 Mb) - fatcow-hosting-icons-3.9.2-ico.zip (8.9 Mb) - fatcow-hosting-icons-3.9.2-all.zip (30.7 Mb) - fatcow-hosting-icons-3.9.2-ai-src.zip (2.82 !Gb) These icons are licensed under a Creative Commons Attribution 3.0 License. http://creativecommons.org/licenses/by/3.0/us/ if you do not know how to link back to FatCow's website, you can ask https://plus.google.com/+MarcisGasuns Biggest icon set drawn by a single designer (in pixel smooth style) worldwide. We are unavailable for custom icon design work. The project is closed (April 2014) and we do not plan to draw more metaphors. http://twitter.com/FatCow http://plus.google.com/+FatCow http://www.facebook.com/FatCow --------------------------------------------------------------------------------- © Copyright 2009-2014 FatCow Web Hosting. All rights reserved. http://www.fatcow.com All other trademarks and copyrights are property of their respective owners. --------------------------------------------------------------------------------- why3-0.87.3/share/images/logo-why.png0000644000175000017500000000256713035416743020077 0ustar guillaumeguillaumePNG  IHDR00WsRGBbKGD pHYs B(xtIME"YIDATh՘kL[eƟs)==JaЖˠ-lt&AD " 0"85}c #L lQa 8P&MNzHr{OL^;@$~UkAA}y{Z-w.P˳[|H3 ~[ДlJTkףEyq붤>!nwiMjIc'N"ðʅouvYtv NwMVk9u6fB4|'_z *,{Q8R{=Qi~dlʚP;]Nf uheҹ{}=47H:H|a6R({U }O'6a4G`X*);!@d%Nra۰$ץDjbX݃إ؇.tW[-m6$˚a.31/SS<r-֢^Ѭ[onx)n \`S6ڋ`x! ^@:h|'~Ih5;P&ÝM5en9~RЧZ?hYgvĠpZV:3Xhi =f7!8~w=F%EKjRh)3qEGHE2W޿HC-KlpTVępaK ͷu:]~Z]F.`a^5צC;Hj@M0ZR @CZCZδrRl1y|H 9p7j . image/svg+xml why3-0.87.3/share/images/src/transformation.svg0000644000175000017500000022523313035416743022177 0ustar guillaumeguillaume image/svg+xml why3-0.87.3/share/images/src/logo-kim.svg0000644000175000017500000001655513035416743020654 0ustar guillaumeguillaume image/svg+xml why3-0.87.3/share/strategies.conf0000644000175000017500000000150113035416743017363 0ustar guillaumeguillaume[strategy] name = "Split" desc = "Split" shortcut = "s" code = "t split_goal_wp exit" [strategy] name = "Inline" desc = "Inline" shortcut = "i" code = "t inline_goal exit" [strategy] name = "Mini Blaster" desc = "A@ simple@ blaster" shortcut = "b" code = " start: c Alt-Ergo,0.95.2, 1 1000 c CVC4,1.4, 1 1000 t split_goal_wp start c Alt-Ergo,0.95.2, 10 4000 c CVC4,1.4, 10 4000" [strategy] name = "Mega Blaster" desc = "Mega@ Blaster@ of@ the@ death" code = " L0:c Alt-Ergo,0.95.2, 1 1000 c CVC4,1.4, 1 1000 t split_goal_wp L6 t introduce_premises L4 L4:t inline_goal L0 g L11 L6:c Alt-Ergo,0.95.2, 1 1000 c CVC4,1.4, 1 1000 t introduce_premises L9 L9:t inline_goal L0 t split_goal_wp L6 L11: c Alt-Ergo,0.95.2, 5 2000 c CVC4,1.4, 5 2000 c Alt-Ergo,0.95.2, 30 4000 c CVC4,1.4, 30 4000" why3-0.87.3/share/zsh/0000755000175000017500000000000013035416743015151 5ustar guillaumeguillaumewhy3-0.87.3/share/zsh/_why30000644000175000017500000001140013035416743016121 0ustar guillaumeguillaume#compdef whyml3 why3 ## ## zsh completion for why3 ## generated by ocompl ## ## ## ## typeset -A opt_args typeset -a last_theories local state line cmd ret=1 local last_file tmp last_theorie ## _arguments -s -S \ '(- *)'{-h,--help}'[Brief help message]' \ '-'"[Read the input file from stdin]"\ '*-T'"[ Select in the input file or in the library]::->theories"\ '*--theory'"[same as -T]::->theories"\ '*-G'"[ Select in the last selected theory]::->goals"\ '*--goal'"[same as -G]::->goals"\ '-C'"[ Read configuration from ]:Configuration File:_files -g '*.conf'"\ '--config'"[same as -C]:Configuration File:_files -g '*.conf'"\ "(-L --library -I)"'-L'"[ Add to the library search path]:Mlpost lib path:_files -/ "\ "(-L --library -I)"'--library'"[same as -L]:Mlpost lib path:_files -/ "\ "(-L --library -I)"'-I'"[same as -L (obsolete)]:Mlpost lib path (obsolete use -L):_files -/ "\ "(-D --driver -P -prover)"'-P'"[ Prove or print (with -o) the selected goals]::->provers"\ "(-D --driver -P -prover)"'--prover'"[same as -P]::->provers"\ '*-M'"[= Add a meta option to each tasks]:=:->metas"\ "(-F --format)"'-F'"[ Input format (default: \"why\")]::"\ "(-F --format)"'--format'"[same as -F]::"\ "(-t --timelimit)"'-t'"[ Set the prover\'s time limit (default=10, no limit=0)]::"\ "(-t --timelimit)"'--timelimit'"[same as -t]::"\ "(-m --memlimit)"'-m'"[ Set the prover\'s memory limit (default: no limit)]::"\ "(-m --memlimit)"'--memlimit'"[same as -m]::"\ "(-D --driver -P -prover)"'-D'"[ Specify a prover\'s driver (conflicts with -P)]:Prover\'s driver:_files -g '*.drv'"\ "(-D --driver -P -prover)"'--driver'"[same as -D]:Prover\'s driver:_files -g '*.drv'"\ "(-o --output)"'-o'"[ Print the selected goals to separate files in ]:directory output:_files -/ "\ "(-o --output)"'--output'"[same as -o]:directory output:_files -/ "\ '--print-theory'"[Print the selected theories]"\ '--print-namespace'"[Print the namespaces of selected theories]"\ '--list-transforms'"[List the registered transformations]"\ '--list-printers'"[List the registered printers]"\ '--list-provers'"[List the known provers]"\ '--list-formats'"[List the known input formats]"\ '--list-metas'"[List the known metas]"\ "(--type-only --parse-only -D --driver -P -prover -L --library -I -t --timelimit -m --memlimit)"'--parse-only'"[Stop after parsing]"\ "(--type-only --parse-only -D --driver -P -prover -L --library -I -t --timelimit -m --memlimit)"'--type-only'"[Stop after type checking]"\ '--debug'"[Set the debug flag]"\ '*-a'"[ Add a transformation to apply to the task]::->transforms"\ '*--apply-transform'"[same as -a]::->transforms"\ "*:The why3 file:->files"\ && return 0 cmd=$service last_file=$line[-1] tmp=$opt_args[-T] last_theories=(${(s<:>)tmp}) last_theory=$last_theories[-1] case $state in transforms) _message ""; compadd $($cmd --list-transforms | grep -e "^ "); return 0 ;; provers) _message ""; compadd $($cmd --list-provers | egrep -E "^ [a-z]"|cut -d' ' -f 3); return 0 ;; metas) _message ""; METAS="$($cmd --list-metas | egrep -E "^ [a-z]" | sed -e "s/^[ ]*//" -e "s/$/=/")"; METAS=(${(f)METAS}); compadd $METAS; return 0 ;; theories) tmp=$($cmd --print-namespace $last_file 2> /dev/null); if [[ $? = 0 ]]; then _message ""; compadd $(echo $tmp |grep "^[a-zA-Z]" | cut -d- -f 1); return 0 else _message ""; return 1 fi;; goals) tmp=$($cmd --print-namespace $last_file -T $last_theory 2> /dev/null); if [[ $? = 0 ]]; then _message ""; compadd $(echo $tmp |grep -e "-goal" | sed "s/[^-]*-goal //"); return 0 else _message ""; return 1 fi;; files) case $cmd in why3) _files -g '*.why'; return 0; ;; whyml3) _files -g '*.{why,mlw}'; return 0; ;; *) _message "absurd"; return 1; esac;; *) return 1 esac #_why3 "$@" why3-0.87.3/share/provers-detection-data.conf0000644000175000017500000004002113035416743021574 0ustar guillaumeguillaume[ATP alt-ergo] name = "Alt-Ergo" exec = "alt-ergo" exec = "alt-ergo-1.30" exec = "alt-ergo-1.20.prv" exec = "alt-ergo-1.10.prv" exec = "alt-ergo-1.01" exec = "alt-ergo-1.00.prv" version_switch = "-version" version_regexp = "^\\([0-9.]+\\(-dev\\|prv\\)?\\)$" version_ok = "1.30" version_ok = "1.20.prv" version_ok = "1.10.prv" version_ok = "1.01" version_ok = "1.00.prv" # %T means timelimit+1 command = "%l/why3-cpulimit %T %m -s %e -timelimit %t %f" # %U means 2*timelimit+1 command_steps = "%l/why3-cpulimit %U %m -s %e -steps-bound %S %f" driver = "drivers/alt_ergo.drv" editor = "altgr-ergo" [ATP alt-ergo] name = "Alt-Ergo" exec = "alt-ergo" exec = "alt-ergo-0.99.1" exec = "alt-ergo-0.95.2" version_switch = "-version" version_regexp = "^\\([0-9.]+\\)$" version_ok = "0.99.1" version_ok = "0.95.2" # %T means timelimit+1 command = "%l/why3-cpulimit %T %m -s %e -no-rm-eq-existential -timelimit %t %f" # %U means 2*timelimit+1 command_steps = "%l/why3-cpulimit %U %m -s %e -no-rm-eq-existential -steps-bound %S %f" driver = "drivers/alt_ergo.drv" editor = "altgr-ergo" # CVC4 version 1.5-prerelease [ATP cvc4] name = "CVC4" exec = "cvc4" exec = "cvc4-1.5-prerelease" exec = "cvc4-1.5" version_switch = "--version" version_regexp = "This is CVC4 version \\([^ \n\r]+\\)" version_ok = "1.5-prerelease" version_ok = "1.5" driver = "drivers/cvc4_15.drv" # --random-seed=42 is not needed as soon as --random-freq=0.0 by default # to try: --inst-when=full-last-call command = "%l/why3-cpulimit %T %m -s %e --tlimit-per=%t000 --lang=smt2 %f" command_steps = "%l/why3-cpulimit %U %m -s %e --stats --rlimit=%S --lang=smt2 %f" # CVC4 version 1.4, using SMTLIB fixed-size bitvectors [ATP cvc4] name = "CVC4" exec = "cvc4" exec = "cvc4-1.4" version_switch = "--version" version_regexp = "This is CVC4 version \\([^ \n\r]+\\)" version_ok = "1.4" driver = "drivers/cvc4_14.drv" # --random-seed=42 is not needed as soon as --random-freq=0.0 by default # to try: --inst-when=full-last-call # --rlimit=%S : cvc4 1.4 DOES NOT accept -1 as argument # cvc4 1.4 does not print steps used in --stats anyway command = "%l/why3-cpulimit %T %m -s %e --tlimit-per=%t000 --lang=smt2 %f" # CVC4 version 1.4, not using SMTLIB bitvectors [ATP cvc4] name = "CVC4" alternative = "noBV" exec = "cvc4" exec = "cvc4-1.4" version_switch = "--version" version_regexp = "This is CVC4 version \\([^ \n\r]+\\)" version_ok = "1.4" driver = "drivers/cvc4.drv" # --random-seed=42 is not needed as soon as --random-freq=0.0 by default # to try: --inst-when=full-last-call # --rlimit=%S : cvc4 1.4 DOES NOT accept -1 as argument # cvc4 .14 does not print steps used in --stats anyway command = "%l/why3-cpulimit %T %m -s %e --tlimit-per=%t000 --lang=smt2 %f" # CVC4 version 1.0 to 1.3 [ATP cvc4] name = "CVC4" exec = "cvc4" exec = "cvc4-1.3" exec = "cvc4-1.2" exec = "cvc4-1.1" exec = "cvc4-1.0" version_switch = "--version" version_regexp = "This is CVC4 version \\([^ \n\r]+\\)" version_old = "1.3" version_old = "1.2" version_old = "1.1" version_old = "1.0" driver = "drivers/cvc4.drv" command = "%l/why3-cpulimit %t %m -s %e --lang=smt2 %f" # Psyche version 2.x [ATP psyche] name = "Psyche" exec = "psyche" exec = "psyche-2.02" version_switch = "-version" version_regexp = "\\([^ \n\r]+\\)" version_ok = "2.0" driver = "drivers/psyche.drv" command = "%l/why3-cpulimit %t %m -s %e -gplugin dpll_wl %f" # CVC3 versions 2.4.x [ATP cvc3] name = "CVC3" exec = "cvc3" exec = "cvc3-2.4.1" exec = "cvc3-2.4" version_switch = "-version" version_regexp = "This is CVC3 version \\([^ \n]+\\)" version_ok = "2.4.1" version_old = "2.4" # the -timeout option is unreliable in CVC3 2.4.1 command = "%l/why3-cpulimit %t %m -s %e -seed 42 %f" driver = "drivers/cvc3.drv" # CVC3 versions 2.x [ATP cvc3] name = "CVC3" exec = "cvc3" exec = "cvc3-2.2" exec = "cvc3-2.1" version_switch = "-version" version_regexp = "This is CVC3 version \\([^ \n]+\\)" version_old = "2.2" version_old = "2.1" command = "%l/why3-cpulimit %T %m -s %e -seed 42 -timeout %t %f" driver = "drivers/cvc3.drv" [ATP yices] name = "Yices" exec = "yices" exec = "yices-1.0.38" version_switch = "--version" version_regexp = "\\([^ \n]+\\)" version_ok = "1.0.38" version_old = "^1\.0\.3[0-7]$" version_old = "^1\.0\.2[5-9]$" version_old = "^1\.0\.2[0-4]$" version_old = "^1\.0\.1\.*$" command = "%l/why3-cpulimit %t %m -s %e" driver = "drivers/yices.drv" [ATP yices-smt2] name = "Yices" exec = "yices-smt2" exec = "yices-smt2-2.3.0" version_switch = "--version" version_regexp = "^Yices \\([^ \n]+\\)$" version_ok = "2.3.0" command = "%l/why3-cpulimit %t %m -s %e" driver = "drivers/yices-smt2.drv" [ATP eprover] name = "Eprover" exec = "eprover" exec = "eprover-1.8" exec = "eprover-1.7" exec = "eprover-1.6" exec = "eprover-1.5" exec = "eprover-1.4" version_switch = "--version" version_regexp = "E \\([-0-9.]+\\) [^\n]+" version_ok = "1.8-001" version_old = "1.7" version_old = "1.6" version_old = "1.5" version_old = "1.4" command = "%l/why3-cpulimit %T %m -s %e -s -R -xAuto -tAuto --cpu-limit=%t --tstp-in %f" driver = "drivers/eprover.drv" [ATP gappa] name = "Gappa" exec = "gappa" exec = "gappa-1.3.2" exec = "gappa-1.3.0" exec = "gappa-1.2.0" exec = "gappa-1.1.1" exec = "gappa-1.1.0" exec = "gappa-1.0.0" exec = "gappa-0.16.1" exec = "gappa-0.14.1" version_switch = "--version" version_regexp = "Gappa \\([^ \n]*\\)" version_ok = "^1\.[0-3]\..+$" version_old = "^0\.1[1-8]\..+$" command = "%l/why3-cpulimit %t %m -s %e -Eprecision=70" driver = "drivers/gappa.drv" [ATP mathsat] name = "MathSAT5" exec = "mathsat" exec = "mathsat-5.2.2" version_switch = "-version" version_regexp = "MathSAT5 version \\([^ \n]+\\)" version_ok = "5.2.2" command = "%l/why3-cpulimit %t %m -s %e -input=smt2 -model -random_seed=80 %f" driver = "drivers/mathsat.drv" [ATP simplify] name = "Simplify" exec = "Simplify" exec = "simplify" exec = "Simplify-1.5.4" exec = "Simplify-1.5.5" version_switch = "-version" version_regexp = "Simplify version \\([^ \n,]+\\)" version_old = "1.5.5" version_old = "1.5.4" command = "%l/why3-cpulimit %t %m -s %e %f" driver = "drivers/simplify.drv" [ATP metis] name = "Metis" exec = "metis" version_switch = "-v" version_regexp = "metis \\([^ \n,]+\\)" version_ok = "2.3" # %U means 2*timelimit+1. Required because Metis tends to # react very slowly to the time limit given, hence answers # oscillate between Timeout and Unknown command = "%l/why3-cpulimit %U %m -s %e --time-limit %t %f" driver = "drivers/metis.drv" [ATP metitarski] name = "MetiTarski" exec = "metit" exec = "metit-2.4" exec = "metit-2.2" version_switch = "-v" version_regexp = "MetiTarski \\([^ \n,]+\\)" version_ok = "2.4" version_old = "2.2" command = "%l/why3-cpulimit %T %m -s %e --time %t %f" driver = "drivers/metitarski.drv" [ATP polypaver] name = "PolyPaver" exec = "polypaver" exec = "polypaver-0.3" version_switch = "--version" version_regexp = "PolyPaver \\([0-9.]+\\) (c)" version_ok = "0.3" command = "%l/why3-cpulimit %T %m -s %e -d 2 -m 10 --time=%t %f" driver = "drivers/polypaver.drv" [ATP spass] name = "Spass" exec = "SPASS" exec = "SPASS-3.7" version_switch = " | grep 'SPASS V'" version_regexp = "SPASS V \\([^ \n\t]+\\)" version_ok = "3.7" command = "%l/why3-cpulimit %T %m -s %e -TPTP -PGiven=0 -PProblem=0 -TimeLimit=%t %f" driver = "drivers/spass.drv" [ATP spass] name = "Spass" exec = "SPASS" exec = "SPASS-3.8ds" version_switch = " | grep 'SPASS[^ \\n\\t]* V'" version_regexp = "SPASS[^ \n\t]* V \\([^ \n\t]+\\)" version_ok = "3.8ds" command = "%l/why3-cpulimit %T %m -s %e -Isabelle=1 -PGiven=0 -TimeLimit=%t %f" driver = "drivers/spass_types.drv" [ATP vampire] name = "Vampire" exec = "vampire" exec = "vampire-0.6" version_switch = "--version" version_regexp = "Vampire \\([0-9.]+\\)" command = "%l/why3-cpulimit %T %m -s %e -t %t" driver = "drivers/vampire.drv" version_ok = "0.6" [ATP princess] name = "Princess" exec = "princess" # version_switch = "-h" version_regexp = "(CASC version \\([0-9-]+\\))" command = "%l/why3-cpulimit %T 0 -s %e -timeout=%t %f" driver = "drivers/princess.drv" version_ok = "2013-05-13" [ATP beagle] name = "Beagle" exec = "beagle" exec = "beagle-0.4.1" # version_switch = "-h" version_regexp = "version \\([0-9.]+\\)" command = "%l/why3-cpulimit %t 0 -s %e %f" driver = "drivers/beagle.drv" version_ok = "0.4.1" [ATP verit] name = "veriT" exec = "veriT" exec = "veriT-201410" version_switch = "--version" version_regexp = "version \\([^ \n\r]+\\)" command = "%l/why3-cpulimit %t %m -s %e --disable-print-success %f" driver = "drivers/verit.drv" version_ok = "201410" [ATP verit] name = "veriT" exec = "veriT" exec = "veriT-201310" version_switch = "--version" version_regexp = "version \\([^ \n\r]+\\)" command = "%l/why3-cpulimit %t %m -s %e --disable-print-success --enable-simp \ --enable-unit-simp --enable-simp-sym --enable-unit-subst-simp --enable-bclause %f" driver = "drivers/verit.drv" version_old = "201310" # Z3 >= 4.4.0, with BV support [ATP z3] name = "Z3" exec = "z3" exec = "z3-4.5.0" exec = "z3-4.4.1" exec = "z3-4.4.0" version_switch = "-version" version_regexp = "Z3 version \\([^ \n\r]+\\)" version_ok = "4.5.0" version_ok = "4.4.1" version_ok = "4.4.0" driver = "drivers/z3_440.drv" command = "%l/why3-cpulimit %t %m -s %e -smt2 sat.random_seed=42 nlsat.randomize=false smt.random_seed=42 %f" command_steps = "%l/why3-cpulimit %U %m -s %e -smt2 sat.random_seed=42 nlsat.randomize=false smt.random_seed=42 memory_max_alloc_count=%S %f" # Z3 >= 4.4.0, without BV support [ATP z3] name = "Z3" alternative = "noBV" exec = "z3" exec = "z3-4.5.0" exec = "z3-4.4.1" exec = "z3-4.4.0" version_switch = "-version" version_regexp = "Z3 version \\([^ \n\r]+\\)" version_ok = "4.5.0" version_ok = "4.4.1" version_ok = "4.4.0" driver = "drivers/z3_432.drv" command = "%l/why3-cpulimit %t %m -s %e -smt2 sat.random_seed=42 nlsat.randomize=false smt.random_seed=42 %f" command_steps = "%l/why3-cpulimit %U %m -s %e -smt2 sat.random_seed=42 nlsat.randomize=false smt.random_seed=42 memory_max_alloc_count=%S %f" # Z3 4.3.2 does not support option global option -rs anymore. # use settings given by "z3 -p" instead # Z3 4.3.2 supports Datatypes [ATP z3] name = "Z3" exec = "z3-4.3.2" version_switch = "-version" version_regexp = "Z3 version \\([^ \n\r]+\\)" version_ok = "4.3.2" driver = "drivers/z3_432.drv" command = "%l/why3-cpulimit %t %m -s %e -smt2 sat.random_seed=42 nlsat.randomize=false smt.random_seed=42 %f" command_steps = "%l/why3-cpulimit %U %m -s %e -smt2 sat.random_seed=42 nlsat.randomize=false smt.random_seed=42 memory_max_alloc_count=%S %f" [ATP z3] name = "Z3" exec = "z3" exec = "z3-4.3.1" exec = "z3-4.3.0" exec = "z3-4.2" exec = "z3-4.1.2" exec = "z3-4.1.1" exec = "z3-4.0" version_switch = "-version" version_regexp = "Z3 version \\([^ \n\r]+\\)" version_old = "4.3.1" version_old = "4.3.0" version_old = "4.2" version_old = "4.1.2" version_old = "4.1.1" version_old = "4.0" driver = "drivers/z3.drv" command = "%l/why3-cpulimit %t %m -s %e -smt2 -rs:42 %f" [ATP z3] name = "Z3" exec = "z3" exec = "z3-3.2" exec = "z3-3.1" exec = "z3-3.0" version_switch = "-version" version_regexp = "Z3 version \\([^ \n\r]+\\)" version_old = "3.2" version_old = "3.1" version_old = "3.0" driver = "drivers/z3.drv" # the -T is unreliable in Z3 3.2 command = "%l/why3-cpulimit %t %m -s %e -smt2 -rs:42 %f" [ATP z3] name = "Z3" exec = "z3" exec = "z3-2.19" exec = "z3-2.18" exec = "z3-2.17" exec = "z3-2.16" version_switch = "-version" version_regexp = "Z3 version \\([^ \n\r]+\\)" version_old = "^2\.2.+$" version_old = "^2\.1[6-9]$" driver = "drivers/z3.drv" command = "%l/why3-cpulimit %t %m -s %e -smt2 -rs:42 \ PHASE_SELECTION=0 \ RESTART_STRATEGY=0 \ RESTART_FACTOR=1.5 \ QI_EAGER_THRESHOLD=100 \ ARITH_RANDOM_INITIAL_VALUE=true \ SORT_AND_OR=false \ CASE_SPLIT=3 \ DELAY_UNITS=true \ DELAY_UNITS_THRESHOLD=16 \ %f" #Other Parameters given by Nikolaj Bjorner #BV_REFLECT=true #arith? #MODEL_PARTIAL=true #MODEL_VALUE_COMPLETION=false #MODEL_HIDE_UNUSED_PARTITIONS=false #MODEL_V1=true #ASYNC_COMMANDS=false #NNF_SK_HACK=true [ATP z3] name = "Z3" exec = "z3" exec = "z3-2.2" exec = "z3-2.1" exec = "z3-1.3" version_switch = "-version" version_regexp = "Z3 version \\([^ \n\r]+\\)" version_old = "^2\.1[0-5]$" version_old = "^2\.[0-9]$" version_old = "1.3" command = "%l/why3-cpulimit %t %m -s %e -smt %f" driver = "drivers/z3_smtv1.drv" [ATP zenon] name = "Zenon" exec = "zenon" exec = "zenon-0.8.0" exec = "zenon-0.7.1" version_switch = "-v" version_regexp = "zenon version \\([^ \n\t]+\\)" version_ok = "0.8.0" version_ok = "0.7.1" command = "%l/why3-cpulimit %T 0 -s %e -p0 -itptp -max-size %mM -max-time %ts %f" driver = "drivers/zenon.drv" [ATP zenon_modulo] name = "Zenon Modulo" exec = "zenon_modulo" version_switch = "-v" version_regexp = "zenon_modulo version \\([0-9.]+\\)" version_ok = "0.4.1" command = "%l/why3-cpulimit %T 0 -s %e -p0 -itptp -max-size %mM -max-time %ts %f" driver = "drivers/zenon_modulo.drv" [ATP iprover] name = "iProver" exec = "iprover" exec = "iprover-0.8.1" version_switch = " | grep iProver" version_regexp = "iProver v\\([^ \n\t]+\\)" version_ok = "0.8.1" command = "%l/why3-cpulimit %T %m -s %e --fof true --out_options none \ --time_out_virtual %t --clausifier /usr/bin/env --clausifier_options \ \"eprover --cnf --tstp-format \" %f" driver = "drivers/iprover.drv" [ATP mathematica] name = "Mathematica" exec = "math" version_switch = "-run \"Exit[]\"" version_regexp = "Mathematica \\([0-9.]+\\)" version_ok = "9.0" version_ok = "8.0" version_ok = "7.0" command = "%l/why3-cpulimit %t %m -s %e -noprompt" driver = "drivers/mathematica.drv" # Coq 8.6: do not limit memory [ITP coq] name = "Coq" compile_time_support = true exec = "coqtop -batch" version_switch = "-v" version_regexp = "The Coq Proof Assistant, version \\([^ \n]+\\)" version_ok = "8.6" command = "%e -I %l/coq-tactic -R %l/coq-tactic Why3 -R %l/coq Why3 -l %f" driver = "drivers/coq.drv" editor = "coqide" # Coq 8.5: do not limit memory [ITP coq] name = "Coq" compile_time_support = true exec = "coqtop -batch" version_switch = "-v" version_regexp = "The Coq Proof Assistant, version \\([^ \n]+\\)" version_ok = "8.5pl3" version_ok = "8.5pl2" version_ok = "8.5pl1" version_ok = "8.5" command = "%e -R %l/coq-tactic Why3 -R %l/coq Why3 -l %f" driver = "drivers/coq.drv" editor = "coqide" [ITP coq] name = "Coq" compile_time_support = true exec = "coqtop -batch" version_switch = "-v" version_regexp = "The Coq Proof Assistant, version \\([^ \n]+\\)" version_ok = "^8\.4pl[1-6]$" version_ok = "8.4" command = "%l/why3-cpulimit 0 %m -s %e -R %l/coq-tactic Why3 -R %l/coq Why3 -l %f" driver = "drivers/coq.drv" editor = "coqide" [ITP pvs] name = "PVS" compile_time_support = true exec = "pvs" version_switch = "-version" version_regexp = "PVS Version \\([^ \n]+\\)" version_ok = "6.0" version_bad = "^[0-5]\..+$" # not why3-cpulimit 0 %m because 'proveit' allocates 8Gb at start-up command = "%l/why3-cpulimit 0 0 -s %l/why3-call-pvs %l proveit -f %f" driver = "drivers/pvs.drv" in_place = true editor = "pvs" [ITP isabelle] name = "Isabelle" exec = "isabelle" version_switch = "version" version_regexp = "Isabelle\\([0-9]+\\(-[0-9]+\\)?\\)" version_ok = "2016-1" version_bad = "2016" version_bad = "2015" # not why3-cpulimit 0 %m because isabelle needs more memory at start-up command = "%l/why3-cpulimit 0 0 -s %e why3 -b %f" driver = "drivers/isabelle2016-1.drv" in_place = true editor = "isabelle-jedit" [ITP isabelle] name = "Isabelle" exec = "isabelle" version_switch = "version" version_regexp = "Isabelle\\([0-9]+\\(-[0-9]+\\)?\\)" # not why3-cpulimit 0 %m because isabelle needs more memory at start-up command = "%l/why3-cpulimit 0 0 -s %e why3 -b %f" version_ok = "2016" version_bad = "2016-1" version_bad = "2015" driver = "drivers/isabelle2016.drv" in_place = true editor = "isabelle-jedit" [editor pvs] name = "PVS" command = "%l/why3-call-pvs %l pvs %f" [editor coqide] name = "CoqIDE" command = "coqide -R %l/coq-tactic Why3 -R %l/coq Why3 %f" [editor proofgeneral-coq] name = "Emacs/ProofGeneral/Coq" command = "emacs --eval \"(setq coq-load-path '((\\\"%l/coq-tactic\\\" \\\"Why3\\\") \ (\\\"%l/coq\\\" \\\"Why3\\\")))\" %f" [editor isabelle-jedit] name = "Isabelle/jEdit" command = "isabelle why3 -i %f" [editor altgr-ergo] name = "AltGr-Ergo" command = "altgr-ergo %f" [shortcut shortcut1] name="Alt-Ergo" shortcut="altergo" why3-0.87.3/share/lang/0000755000175000017500000000000013035416743015266 5ustar guillaumeguillaumewhy3-0.87.3/share/lang/why3.lang0000644000175000017500000001755713035416743017042 0ustar guillaumeguillaume text/x-why3 *.mlw;*.why (* *)
<#en>The content of the current buffer will be lost <#fr>Le contenu actuel du programme sera perdu

<#en>Try Why3<#fr>Essayez Why3

<#en> Type some program in the text area below, then select 'Prove all' in the Why3 menu to generate proof obligations. <#fr> Tapez un programme dans la zone de texte ci-dessous, puis sélectionnez 'Prouver' dans le menu Why3 pour engendrer les obligations de preuve.

<#en>Related links<#fr>Liens utiles

why3-0.87.3/src/trywhy3/simplearith.why0000644000175000017500000000011413035416743020531 0ustar guillaumeguillaumetheory T use import int.Int goal g: exists x:int. x*(x+1) = 42 end why3-0.87.3/src/trywhy3/bin_mult.mlw0000644000175000017500000000112613035416743020015 0ustar guillaumeguillaumemodule BinaryMultiplication use import mach.int.Int use import ref.Ref let mult (a b: int) requires { b >= 0 } ensures { result = a * b } = let x = ref a in let y = ref b in let z = ref 0 in while !y <> 0 do invariant { 0 <= !y } invariant { !z + !x * !y = a * b } variant { !y } if !y % 2 <> 0 then z := !z + !x; x := 2 * !x; y := !y / 2 done; !z end module Test1 use BinaryMultiplication as B let main () = B.mult 6 7 end module Test2 use BinaryMultiplication as B let main () = B.mult 4546729 21993833369 endwhy3-0.87.3/src/trywhy3/editor_helper.js0000644000175000017500000000731413035416743020653 0ustar guillaumeguillaume/* Global objects */ var editor = ace.edit("editor"); editor.setTheme("ace/theme/chrome"); editor.getSession().setMode("ace/mode/why3"); var Range = ace.require("ace/range").Range; var selectedRange = null; var marker = null; editor.$blockScrolling = Infinity; function highlightError (x1, y1, x2, y2) { selectedRange = new Range (x1,y1,x2,y2); marker = editor.session.addMarker(selectedRange, "error", "text"); } function clearHighlight () { if (marker) { editor.session.removeMarker(marker); marker = null; }; } editor.on("change", clearHighlight); function moveToError () { if (selectedRange) { editor.selection.setSelectionRange(selectedRange); editor.moveCursorToPosition(selectedRange.start); selectedRange = null; } } editor.on("focus", moveToError); function openFile () { document.getElementById("file-selector").click(); editor.focus(); } var loadedBuffer = ""; var loadedFilename = ""; var currentFilename = ""; var fileSelector = document.getElementById("file-selector"); function realReplaceBuffer() { editor.setValue(loadedBuffer,-1); currentFilename = loadedFilename; //document.getElementById("filename_panel").innerHTML = loadedFilename; loadedFilename = ""; loadedBuffer = ""; } function confirmReplace () { realReplaceBuffer(); document.getElementById("background-shadow").style.display = "none"; document.getElementById("confirm-dialog").style.display = "none"; editor.focus(); } function cancelReplace () { loadedBuffer = ""; loadedFilename = ""; document.getElementById("background-shadow").style.display = "none"; document.getElementById("confirm-dialog").style.display = "none"; editor.focus(); } function replaceWithLoaded() { if (/\S/.test(editor.getValue())) { document.getElementById("background-shadow").style.display = "block"; document.getElementById("confirm-dialog").style.display = "block"; } else { realReplaceBuffer(); } editor.focus(); } function clearBuffer () { loadedBuffer = ""; loadedFilename = ""; replaceWithLoaded(); } function realOpenFile (ev) { var f = ev.target.files[0]; if (f) { var r = new FileReader(); r.onload = function(e) { loadedBuffer = e.target.result; loadedFilename = f.name; replaceWithLoaded(); }; r.readAsText(f); }; this.value = null; editor.focus(); } fileSelector.addEventListener("change", realOpenFile, false); var saveFile = (function () { var a = document.createElement ("a"); document.body.appendChild(a); a.style.height = "0"; a.style.width = "0"; a.style.position = "absolute"; a.style.top = "0"; a.style.left = "0"; a.style.zIndex = "-10"; return function () { a.href = "data:application/octet-stream;base64," + btoa(editor.getValue()+"\n"); a.download = /\S/.test(currentFilename) ? currentFilename : "Test.cd"; a.click(); editor.focus(); }; }) (); function standardView() { var e = document.getElementById("editor"); var c = document.getElementById("console"); e.style.width = "100%"; e.style.height = "60vh"; c.style.width = "100%"; c.style.height = "37vh"; editor.focus(); } function widescreenView() { var e = document.getElementById("editor"); var c = document.getElementById("console"); e.style.width = "50%"; e.style.height = "100%"; c.style.width = "40%"; c.style.height = "100%"; editor.focus(); } function prove() { document.getElementById("console").innerHTML = "

Execution feature is not yet implemented

"; console.focus(); editor.focus(); } function prove() { document.getElementById("console").innerHTML = "

Call to Why3 is not yet implemented

"; editor.focus(); } editor.focus(); why3-0.87.3/src/trywhy3/style.css0000644000175000017500000000661713035416743017347 0ustar guillaumeguillaumebody { padding:0; margin:0; font-family: sans-serif; } /* CSS MENU BAR */ .menu-bar { margin:0; z-index:10; font-size:2vh; padding:0; } .menu-bar:after { content:""; display:table; clear:both; } .menu-bar ul { padding:0; margin:0; list-style: none; position: relative; background-image: linear-gradient(to bottom, #eee, #ccc); height:3vh; z-index:10; box-sizing:border-box; } /* Positioning the navigation items inline */ .menu-bar ul li { margin: 0; padding:0; display:inline-block; float: left; height:100%; box-sizing:border-box; } /* Styling the links */ .menu-bar > ul > li > a { display:block; padding:0pt 1em; color:#444; text-decoration:none; border-radius: 5pt 5pt 0pt 0pt; border-style:solid; border-width:1pt; border-color:transparent; height:100%; box-sizing:border-box; margin:0; } /* Background color change on Hover */ .menu-bar > ul > li > a:hover { background-image: linear-gradient(to bottom, #eee, #bbb); border-color: #aaa; box-sizing:border-box; } .menu-bar > ul > li > ul { /* display:none;*/ height:0; overflow:hidden; box-sizing:border-box; } .menu-bar > ul > li:hover > ul { height:auto; background-color:#ddd; box-shadow:0pt 0pt 5pt #444; } .menu-bar > ul > li > ul > li { float:none; display:list-item; position: relative; } .menu-bar > ul > li > ul > li > a { display:block; padding:1pt 2pt 1pt 2pt; color:#444; text-decoration:none; border-radius: 1pt; border-style:solid; border-width:1pt; border-color:transparent; box-sizing:border-box; } .menu-bar > ul > li > ul > li > a:hover { border-color:#cce; background-image: linear-gradient(to bottom, #abe, #68b); } /* Hidden file selector */ #file-selector { position:absolute; left:0; top:0; width:0; height:0; z-index:-1; } #editor-panel { position:relative; display:block; box-sizing: border-box; padding:0; margin:0; height:97vh; } #console { position:relative; display:inline-block; box-sizing: border-box; /* font-size: large; */ /* font-family: monospace; */ /* white-space: pre-wrap; */ width:49%; height:100%; /* background: #444; */ margin:0 0 0 0; padding:0 0 0 0; vertical-align:top; } #console ul { list-style-type: none; padding: 8px; margin: 4px; } #console ul ul { list-style-type: disc; padding: 8px; margin: 4px; } #console ul ul ul { list-style-type: none; padding: 0px; margin: 4px; } #editor { position:relative; font-size: large; box-sizing: border-box; display:inline-block; width:49%; height:100%; margin:0 0 0 0; padding:0 0 0 0; z-index:0; vertical-align:top; } /* Confirmation dialog */ .btn { width:100%; z-index:1; margin:0 0 4pt 0; box-sizing:border-box; } #confirm-dialog { z-index:20; display:none; position:absolute; margin: 0 auto; padding: 2pt 0; width:50%; left:25%; right:25%; top:20%; border-radius:5pt; background: #eee; text-align:center; } #background-shadow { display:none; background-color: rgba(0,0,0,0.8); position:absolute; width:100%; height:100%; top: 0; left:0; z-index:15; } #confirm-dialog .btn { width:40%; } why3-0.87.3/src/trywhy3/trywhy3.conf0000644000175000017500000000072013035416743017762 0ustar guillaumeguillaume[main] cntexample = false loadpath = "/theories" loadpath = "/modules" magic = 14 memlimit = 1000 running_provers_max = 2 timelimit = 5 [prover] command = "%l/why3-cpulimit %T %m -s alt-ergo-0.99.1 -timelimit %t %f" command_steps = "%l/why3-cpulimit %U %m -s alt-ergo-0.99.1 -steps-bound %S %f" driver = "/try_alt_ergo.drv" editor = "altgr-ergo" in_place = false interactive = false name = "Alt-Ergo" shortcut = "altergo" shortcut = "alt-ergo" version = "0.99.1" why3-0.87.3/src/trywhy3/mode-why3.js0000644000175000017500000001551013035416743017637 0ustar guillaumeguillaumeace.define("ace/mode/why3_highlight_rules",["require","exports","module","ace/lib/oop","ace/mode/text_highlight_rules"], function(require, exports, module) { "use strict"; var oop = require("../lib/oop"); var TextHighlightRules = require("./text_highlight_rules").TextHighlightRules; var Why3HighlightRules = function() { var keywords = ( "and|as|assert|begin|do|done|downto|else|end|ensures|" + "exception|exists|for|forall|fun|function|goal|if|import|in|" + "invariant|let|match|module|mutable|predicate|" + "rec|requires|then|theory|to|try|type|use|val|variant|" + "while|with" ); var builtinConstants = ("true|false"); var builtinFunctions = (""); var keywordMapper = this.createKeywordMapper({ "variable.language": "this", "keyword": keywords, "constant.language": builtinConstants, "support.function": builtinFunctions }, "identifier"); var decimalInteger = "(?:(?:[1-9]\\d*)|(?:0))"; var octInteger = "(?:0[oO]?[0-7]+)"; var hexInteger = "(?:0[xX][\\dA-Fa-f]+)"; var binInteger = "(?:0[bB][01]+)"; var integer = "(?:" + decimalInteger + "|" + octInteger + "|" + hexInteger + "|" + binInteger + ")"; var exponent = "(?:[eE][+-]?\\d+)"; var fraction = "(?:\\.\\d+)"; var intPart = "(?:\\d+)"; var pointFloat = "(?:(?:" + intPart + "?" + fraction + ")|(?:" + intPart + "\\.))"; var exponentFloat = "(?:(?:" + pointFloat + "|" + intPart + ")" + exponent + ")"; var floatNumber = "(?:" + exponentFloat + "|" + pointFloat + ")"; this.$rules = { "start" : [ { token : "comment", regex : '\\(\\*.*?\\*\\)\\s*?$' }, { token : "comment", regex : '\\(\\*.*', next : "comment" }, { token : "string", // single line regex : '["](?:(?:\\\\.)|(?:[^"\\\\]))*?["]' }, { token : "string", // single char regex : "'.'" }, { token : "string", // " string regex : '"', next : "qstring" }, { token : "constant.numeric", // imaginary regex : "(?:" + floatNumber + "|\\d+)[jJ]\\b" }, { token : "constant.numeric", // float regex : floatNumber }, { token : "constant.numeric", // integer regex : integer + "\\b" }, { token : keywordMapper, regex : "[a-zA-Z_$][a-zA-Z0-9_$]*\\b" }, { token : "keyword.operator", regex : "&&|\\|\\||/\\\\|\\\\/|->|<->" }, { token : "paren.lparen", regex : "[[({]" }, { token : "paren.rparen", regex : "[\\])}]" }, { token : "text", regex : "\\s+" } ], "comment" : [ { token : "comment", // closing comment regex : ".*?\\*\\)", next : "start" }, { token : "comment", // comment spanning whole line regex : ".+" } ], "qstring" : [ { token : "string", regex : '"', next : "start" }, { token : "string", regex : '.+' } ] }; }; oop.inherits(Why3HighlightRules, TextHighlightRules); exports.Why3HighlightRules = Why3HighlightRules; }); ace.define("ace/mode/matching_brace_outdent",["require","exports","module","ace/range"], function(require, exports, module) { "use strict"; var Range = require("../range").Range; var MatchingBraceOutdent = function() {}; (function() { this.checkOutdent = function(line, input) { if (! /^\s+$/.test(line)) return false; return /^\s*\}/.test(input); }; this.autoOutdent = function(doc, row) { var line = doc.getLine(row); var match = line.match(/^(\s*\})/); if (!match) return 0; var column = match[1].length; var openBracePos = doc.findMatchingBracket({row: row, column: column}); if (!openBracePos || openBracePos.row == row) return 0; var indent = this.$getIndent(doc.getLine(openBracePos.row)); doc.replace(new Range(row, 0, row, column-1), indent); }; this.$getIndent = function(line) { return line.match(/^\s*/)[0]; }; }).call(MatchingBraceOutdent.prototype); exports.MatchingBraceOutdent = MatchingBraceOutdent; }); ace.define("ace/mode/why3",["require","exports","module","ace/lib/oop","ace/mode/text","ace/mode/why3_highlight_rules","ace/mode/matching_brace_outdent","ace/range"], function(require, exports, module) { "use strict"; var oop = require("../lib/oop"); var TextMode = require("./text").Mode; var Why3HighlightRules = require("./why3_highlight_rules").Why3HighlightRules; var MatchingBraceOutdent = require("./matching_brace_outdent").MatchingBraceOutdent; var Range = require("../range").Range; var Mode = function() { this.HighlightRules = Why3HighlightRules; this.$outdent = new MatchingBraceOutdent(); }; oop.inherits(Mode, TextMode); var indenter = /(?:[({[=:]|[-=]>|\b(?:else|try|with))\s*$/; (function() { this.toggleCommentLines = function(state, doc, startRow, endRow) { var i, line; var outdent = true; var re = /^\s*\(\*(.*)\*\)/; for (i=startRow; i<= endRow; i++) { if (!re.test(doc.getLine(i))) { outdent = false; break; } } var range = new Range(0, 0, 0, 0); for (i=startRow; i<= endRow; i++) { line = doc.getLine(i); range.start.row = i; range.end.row = i; range.end.column = line.length; doc.replace(range, outdent ? line.match(re)[1] : "(*" + line + "*)"); } }; this.getNextLineIndent = function(state, line, tab) { var indent = this.$getIndent(line); var tokens = this.getTokenizer().getLineTokens(line, state).tokens; if (!(tokens.length && tokens[tokens.length - 1].type === 'comment') && state === 'start' && indenter.test(line)) indent += tab; return indent; }; this.checkOutdent = function(state, line, input) { return this.$outdent.checkOutdent(line, input); }; this.autoOutdent = function(state, doc, row) { this.$outdent.autoOutdent(doc, row); }; this.$id = "ace/mode/why3"; }).call(Mode.prototype); exports.Mode = Mode; }); why3-0.87.3/src/trywhy3/trywhy3.ml0000644000175000017500000002622313035416743017453 0ustar guillaumeguillaume(********************************************************************) (* *) (* The Why3 Verification Platform / The Why3 Development Team *) (* Copyright 2010-2016 -- INRIA - CNRS - Paris-Sud University *) (* *) (* This software is distributed under the terms of the GNU Lesser *) (* General Public License version 2.1, with the special exception *) (* on linking described in file LICENSE. *) (* *) (********************************************************************) (* simple helpers *) let get_opt o = Js.Opt.get o (fun () -> assert false) let log s = Firebug.console ## log (Js.string s) (* module for generating HTML elements *) module Html = struct let d = Dom_html.document let node x = (x : #Dom.node Js.t :> Dom.node Js.t) let of_string s = node (d##createTextNode (Js.string s)) let img i = let x = Dom_html.createImg d in x##src <- Js.string i; x##height <- 12; (* X##align <- Js.string "bottom"; *) node x let img_accept () = img "accept32.png" let img_help () = img "help32.png" let img_bug () = img "bug32.png" let par nl = let x = d##createElement (Js.string "p") in List.iter (Dom.appendChild x) nl; node x let ul nl = let x = d##createElement (Js.string "ul") in List.iter (fun n -> let y = d##createElement (Js.string "li") in List.iter (Dom.appendChild y) n; Dom.appendChild x (node y)) nl; node x end (* Interface to Why3 and Alt-Ergo *) let why3_conf_file = "/trywhy3.conf" open Why3 open Format (* reads the config file *) let config : Whyconf.config = Whyconf.read_config (Some why3_conf_file) (* the [main] section of the config file *) let main : Whyconf.main = Whyconf.get_main config (* all the provers detected, from the config file *) let provers : Whyconf.config_prover Whyconf.Mprover.t = Whyconf.get_provers config (* One prover named Alt-Ergo in the config file *) let alt_ergo : Whyconf.config_prover = if Whyconf.Mprover.is_empty provers then begin eprintf "Prover Alt-Ergo not installed or not configured@."; exit 0 end else snd (Whyconf.Mprover.choose provers) (* builds the environment from the [loadpath] *) let env : Env.env = Env.create_env (Whyconf.loadpath main) let alt_ergo_driver : Driver.driver = try Printexc.record_backtrace true; Driver.load_driver env alt_ergo.Whyconf.driver [] with e -> let s = Printexc.get_backtrace () in eprintf "Failed to load driver for alt-ergo: %a@.%s@." Exn_printer.exn_printer e s; exit 1 module SAT = (val (Sat_solvers.get_current ()) : Sat_solvers.S) module FE = Frontend.Make (SAT) let print_status fmt _d status steps = match status with | FE.Unsat _dep -> fprintf fmt "Proved (%Ld steps)" steps | FE.Inconsistent -> () (* fprintf fmt "Inconsistent assumption" *) | FE.Unknown _t | FE.Sat _t -> fprintf fmt "Unknown (%Ld steps)@." steps type prover_answer = Valid | Unknown of string | Error of string let report_status report _d status _steps = match status with | FE.Unsat _dep -> report Valid | FE.Inconsistent -> () | FE.Unknown _t | FE.Sat _t -> report (Unknown "unknown") let run_alt_ergo_on_task t = (* printing the task in a string *) Driver.print_task alt_ergo_driver str_formatter t; let text = flush_str_formatter () in let lb = Lexing.from_string text in (* from Alt-Ergo, src/main/frontend.ml *) let a = Why_parser.file Why_lexer.token lb in Parsing.clear_parser (); let ltd, _typ_env = Why_typing.file false Why_typing.empty_env a in match Why_typing.split_goals ltd with | [d] -> let d = Cnf.make (List.map (fun (f, _env) -> f, true) d) in SAT.reset_steps (); let stat = ref (Error "no answer from Alt-Ergo") in let f s = stat := s in begin try let _x = Queue.fold (FE.process_decl (report_status f)) (SAT.empty (), true, Explanation.empty) d in !stat with Sat_solvers.StepsLimitReached -> Unknown "steps limit reached" end | _ -> Error "zero or more than 1 goal to solve" let split_trans = Trans.lookup_transform_l "split_goal_wp" env let why3_prove theories = let theories = Stdlib.Mstr.fold (fun thname th acc -> let tasks = Task.split_theory th None None in let tasks = List.rev_map (fun t -> let (id,expl,_) = Termcode.goal_expl_task ~root:true t in let expl = match expl with | Some s -> s | None -> id.Ident.id_string in let tl = Trans.apply split_trans t in let tasks = List.map (fun task -> let (id,expl,_) = Termcode.goal_expl_task ~root:false task in let expl = match expl with | Some s -> s | None -> id.Ident.id_string in let result = run_alt_ergo_on_task task in let img,res = match result with | Valid -> Html.img_accept, expl | Unknown s -> Html.img_help, expl ^ " (" ^ s ^ ")" | Error s -> Html.img_bug, expl ^ " (" ^ s ^ ")" in [img (); Html.of_string (" " ^ res)]) tl in [Html.of_string expl; Html.ul tasks]) tasks in let loc = Opt.get_def Loc.dummy_position th.Theory.th_name.Ident.id_loc in (loc,[ Html.of_string thname; Html.ul tasks]) :: acc) theories [] in let s = List.sort (fun (l1,_) (l2,_) -> Loc.compare l2 l1) theories in Html.ul (List.rev_map snd s) let execute_symbol m fmt ps = match Mlw_decl.find_definition m.Mlw_module.mod_known ps with | None -> fprintf fmt "function '%s' has no definition" ps.Mlw_expr.ps_name.Ident.id_string | Some d -> let lam = d.Mlw_expr.fun_lambda in match lam.Mlw_expr.l_args with | [pvs] when Mlw_ty.ity_equal pvs.Mlw_ty.pv_ity Mlw_ty.ity_unit -> begin let spec = lam.Mlw_expr.l_spec in let eff = spec.Mlw_ty.c_effect in let writes = eff.Mlw_ty.eff_writes in let body = lam.Mlw_expr.l_expr in try let res, _final_env = Mlw_interp.eval_global_expr env m.Mlw_module.mod_known m.Mlw_module.mod_theory.Theory.th_known writes body in match res with | Mlw_interp.Normal v -> Mlw_interp.print_value fmt v | Mlw_interp.Excep(x,v) -> fprintf fmt "exception %s(%a)" x.Mlw_ty.xs_name.Ident.id_string Mlw_interp.print_value v | Mlw_interp.Irred e -> fprintf fmt "cannot execute expression@ @[%a@]" Mlw_pretty.print_expr e | Mlw_interp.Fun _ -> fprintf fmt "result is a function" with e -> fprintf fmt "failure during execution of function: %a (%s)" Exn_printer.exn_printer e (Printexc.to_string e) end | _ -> fprintf fmt "Only functions with one unit argument can be executed" let why3_execute (modules,_theories) = let mods = Stdlib.Mstr.fold (fun _k m acc -> let th = m.Mlw_module.mod_theory in let modname = th.Theory.th_name.Ident.id_string in try let ps = Mlw_module.ns_find_ps m.Mlw_module.mod_export ["main"] in let result = Pp.sprintf "%a" (execute_symbol m) ps in let loc = Opt.get_def Loc.dummy_position th.Theory.th_name.Ident.id_loc in (loc,[Html.of_string (modname ^ ".main() returns " ^ result)]) :: acc with Not_found -> acc) modules [] in match mods with | [] -> Html.par [Html.of_string "No main function found"] | _ -> let s = List.sort (fun (l1,_) (l2,_) -> Loc.compare l2 l1) mods in Html.ul (List.rev_map snd s) (* Connecting Why3 calls to the interface *) let temp_file_name = "/input.mlw" let () = Sys_js.register_file ~name:temp_file_name ~content:"" let run_why3 f lang global text = let ch = open_out temp_file_name in output_string ch text; close_out ch; try (* TODO: add a function Env.read_string or Env.read_from_lexbuf ? *) let theories = Env.read_file lang env temp_file_name in f theories with | Loc.Located(loc,e') -> let (_,l,b,e) = Loc.get loc in ignore (Js.Unsafe.meth_call global "highlightError" (Array.map Js.Unsafe.inject [| l-1; b; l-1; e |])); Html.par [Html.of_string (Pp.sprintf "error line %d, columns %d-%d: %a" l b e Exn_printer.exn_printer e')] | e -> Html.par [Html.of_string (Pp.sprintf "unexpected exception: %a (%s)" Exn_printer.exn_printer e (Printexc.to_string e))] let add_why3_cmd buttonname f input_lang = let handler = Dom.handler (fun _ev -> let global = Js.Unsafe.global in let editor = Js.Unsafe.get global (Js.string "editor") in let lang = "en" (* Js.to_string (Js.Unsafe.meth_call editor "getAttribute" [| Js.Unsafe.inject (Js.string "lang") |]) *) in let code = Js.to_string (Js.Unsafe.meth_call editor "getValue" [| |]) in log ("Why3 is running, lang = " ^ lang); let answer = run_why3 f input_lang global code in log "Why3 answer given"; let console = get_opt (Dom_html.document ## getElementById (Js.string "console")) in (* remove the previous answer if any *) Js.Opt.iter (console##lastChild) (Dom.removeChild console); (* put the new answer *) Dom.appendChild console answer; (* give the focus back to the editor *) ignore (Js.Unsafe.meth_call editor "focus" [| |]); Js._false) in let button = get_opt (Dom_html.document ## getElementById (Js.string buttonname)) in button ## onclick <- handler let () = add_why3_cmd "prove" why3_prove Env.base_language; add_why3_cmd "run" why3_execute Mlw_module.mlw_language (* Predefined examples *) let add_file_example buttonname file = let handler = Dom.handler (fun _ev -> let text = Sysutil.file_contents file in let global = Js.Unsafe.global in let editor = Js.Unsafe.get global (Js.string "editor") in Js.Unsafe.set global (Js.string "loadedBuffer") (Js.string text); let loaded = Filename.basename file in Js.Unsafe.set global (Js.string "loadedFilename") (Js.string loaded); ignore (Js.Unsafe.meth_call global "replaceWithLoaded" [| |]); ignore (Js.Unsafe.meth_call editor "focus" [| |]); Js._false) in let button = get_opt (Dom_html.document ## getElementById (Js.string buttonname)) in button ## onclick <- handler let () = add_file_example "drinkers" "/drinkers.why"; (* add_file_example "simplearith" "/simplearith.why";*) add_file_example "bin_mult" "/bin_mult.mlw"; add_file_example "fact" "/fact.mlw"; add_file_example "isqrt" "/isqrt.mlw"; Options.set_steps_bound 100 (* Local Variables: compile-command: "unset LANG; make -C ../.. src/trywhy3/trywhy3.js" End: *) why3-0.87.3/src/trywhy3/fact.mlw0000644000175000017500000000150213035416743017117 0ustar guillaumeguillaumemodule FactWhile use import mach.int.Int use import int.Fact use import ref.Ref (** Factorial with a while loop *) let fact_imp (x:int) : int requires { x >= 0 } ensures { result = fact x } = let y = ref 0 in let r = ref 1 in while !y < x do invariant { 0 <= !y <= x } invariant { !r = fact !y } variant { x - !y } y := !y + 1; r := !r * !y done; !r let main () = (fact_imp 7, fact_imp 42) end module FactFor use import mach.int.Int use import int.Fact use import ref.Ref (** Factorial with a for loop *) let fact_imp (x:int) : int requires { x >= 0 } ensures { result = fact x } = let r = ref 1 in for y = 1 to x do invariant { !r = fact (y-1) } r := !r * !y done; !r let main () = (fact_imp 7, fact_imp 42) end why3-0.87.3/src/trywhy3/try_alt_ergo.drv0000644000175000017500000001333613035416743020700 0ustar guillaumeguillaume(* Driver for Alt-Ergo, specific variant for Try Why3 *) (* FIXME: it would be better to share the common parts with the regular Alt-Ergo driver *) prelude "(* this is the prelude for Alt-Ergo, version for Try Why3 *)" printer "alt-ergo" filename "%f-%t-%g.why" (* Try Why3 doesn't need these valid "Valid" invalid "Invalid" unknown "I don't know" "" timeout "Timeout" steplimitexceeded "Steps limit reached" outofmemory "Fatal error: out of memory" outofmemory "Fatal error: exception Stack_overflow" fail "typing error:\\(.*\\)$" "Failure : File generation error : \\1" *) (* FIXME: remaining of this file should be shared with regular Alt-Ergo driver *) transformation "inline_trivial" transformation "eliminate_builtin" transformation "eliminate_recursion" transformation "eliminate_inductive" transformation "eliminate_algebraic" transformation "eliminate_epsilon" transformation "eliminate_if" transformation "eliminate_let" transformation "split_premise_right" transformation "simplify_formula" (*transformation "simplify_trivial_quantification_in_goal"*) theory BuiltIn syntax type int "int" syntax type real "real" syntax predicate (=) "(%1 = %2)" end theory int.Int prelude "(* this is a prelude for Alt-Ergo integer arithmetic *)" syntax function zero "0" syntax function one "1" syntax function (+) "(%1 + %2)" syntax function (-) "(%1 - %2)" syntax function (*) "(%1 * %2)" syntax function (-_) "(-%1)" meta "invalid trigger" predicate (<=) meta "invalid trigger" predicate (<) meta "invalid trigger" predicate (>=) meta "invalid trigger" predicate (>) syntax predicate (<=) "(%1 <= %2)" syntax predicate (<) "(%1 < %2)" syntax predicate (>=) "(%1 >= %2)" syntax predicate (>) "(%1 > %2)" remove prop CommutativeGroup.Comm.Comm remove prop CommutativeGroup.Assoc remove prop CommutativeGroup.Unit_def_l remove prop CommutativeGroup.Unit_def_r remove prop CommutativeGroup.Inv_def_l remove prop CommutativeGroup.Inv_def_r remove prop Assoc.Assoc remove prop Mul_distr_l remove prop Mul_distr_r remove prop Comm.Comm remove prop Unitary remove prop Refl remove prop Trans remove prop Total remove prop Antisymm remove prop NonTrivialRing remove prop CompatOrderAdd remove prop ZeroLessOne end theory real.Real prelude "(* this is a prelude for Alt-Ergo real arithmetic *)" syntax function zero "0.0" syntax function one "1.0" syntax function (+) "(%1 + %2)" syntax function (-) "(%1 - %2)" syntax function (*) "(%1 * %2)" syntax function (/) "(%1 / %2)" syntax function (-_) "(-%1)" syntax function inv "(1.0 / %1)" meta "invalid trigger" predicate (<=) meta "invalid trigger" predicate (<) meta "invalid trigger" predicate (>=) meta "invalid trigger" predicate (>) syntax predicate (<=) "(%1 <= %2)" syntax predicate (<) "(%1 < %2)" syntax predicate (>=) "(%1 >= %2)" syntax predicate (>) "(%1 > %2)" remove prop CommutativeGroup.Comm.Comm remove prop CommutativeGroup.Assoc remove prop CommutativeGroup.Unit_def_l remove prop CommutativeGroup.Unit_def_r remove prop CommutativeGroup.Inv_def_l remove prop CommutativeGroup.Inv_def_r remove prop Assoc.Assoc remove prop Mul_distr_l remove prop Mul_distr_r remove prop Comm.Comm remove prop Unitary remove prop Refl remove prop Trans remove prop Total remove prop Antisymm remove prop Inverse remove prop NonTrivialRing remove prop CompatOrderAdd remove prop ZeroLessOne end theory real.RealInfix syntax function (+.) "(%1 + %2)" syntax function (-.) "(%1 - %2)" syntax function ( *.) "(%1 * %2)" syntax function (/.) "(%1 / %2)" syntax function (-._) "(-%1)" meta "invalid trigger" predicate (<=.) meta "invalid trigger" predicate (<.) meta "invalid trigger" predicate (>=.) meta "invalid trigger" predicate (>.) syntax predicate (<=.) "(%1 <= %2)" syntax predicate (<.) "(%1 < %2)" syntax predicate (>=.) "(%1 >= %2)" syntax predicate (>.) "(%1 > %2)" end theory Bool syntax type bool "bool" syntax function True "true" syntax function False "false" end theory Tuple0 syntax type tuple0 "unit" syntax function Tuple0 "void" end theory algebra.AC meta AC function op remove prop Comm.Comm remove prop Assoc end theory map.Map syntax type map "(%1,%2) farray" syntax function get "(%1[%2])" syntax function set "(%1[%2 <- %3])" remove prop Select_eq remove prop Select_neq end theory BuiltIn (* Alt-Ergo >= 0.95 supports enumerated datatypes and records *) meta "eliminate_algebraic" "keep_enums" meta "eliminate_algebraic" "keep_recs" end theory int.EuclideanDivision (* protection against wrong semantics for negative arguments last checked on 0.99.1: this is still needed *) prelude "logic safe_eucl_div: int, int -> int" prelude "axiom safe_eucl_div_def: forall x, y:int. x >= 0 and y > 0 -> safe_eucl_div(x,y) = x / y" prelude "logic safe_eucl_mod: int, int -> int" prelude "axiom safe_eucl_mod_def: forall x, y:int. x >= 0 and y > 0 -> safe_eucl_mod(x,y) = x % y" syntax function div "safe_eucl_div(%1,%2)" syntax function mod "safe_eucl_mod(%1,%2)" end theory int.ComputerDivision (* protection against wrong semantics for negative arguments last checked on 0.99.1: this is still needed *) prelude "logic safe_comp_div: int, int -> int" prelude "axiom safe_comp_div_def: forall x, y:int. x >= 0 and y > 0 -> safe_comp_div(x,y) = x / y" prelude "logic safe_comp_mod: int, int -> int" prelude "axiom safe_comp_mod_def: forall x, y:int. x >= 0 and y > 0 -> safe_comp_mod(x,y) = x % y" syntax function div "safe_comp_div(%1,%2)" syntax function mod "safe_comp_mod(%1,%2)" end (* Local Variables: mode: why compile-command: "make -C .. bench" End: *) why3-0.87.3/src/trywhy3/drinkers.why0000644000175000017500000000051013035416743020031 0ustar guillaumeguillaumetheory T (** Type of all persons *) type person (** Predicate saying that some person drinks *) predicate drinks person (** Paradox: there exists a person x such that if x drinks, then everybody drinks *) goal drinkers_paradox: exists x:person. drinks x -> forall y:person. drinks y end why3-0.87.3/src/trywhy3/isqrt.mlw0000644000175000017500000000120313035416743017342 0ustar guillaumeguillaumemodule M use import int.Int use import ref.Ref function sqr (x:int) : int = x * x lemma sqr_sum : forall x y : int. sqr(x+y) = sqr x + 2*x*y + sqr y let isqrt (x:int) : int requires { x >= 0 } ensures { result >= 0 } ensures { sqr result <= x < sqr (result + 1) } = let count = ref 0 in let sum = ref 1 in while !sum <= x do invariant { !count >= 0 } invariant { x >= sqr !count } invariant { !sum = sqr (!count+1) } variant { x - !count } count := !count + 1; sum := !sum + 2 * !count + 1 done; !count let main () ensures { result = 4 } = isqrt 17 end why3-0.87.3/doc/0000755000175000017500000000000013035417011013775 5ustar guillaumeguillaumewhy3-0.87.3/doc/technical.tex0000644000175000017500000005175713035416743016503 0ustar guillaumeguillaume\chapter{Technical Informations} \section{Structure of Session Files} The proof session state is stored in an XML file named \texttt{\textsl{}/why3session.xml}, where \texttt{\textsl{}} is the directory of the project. The XML file follows the DTD given in \texttt{share/why3session.dtd} and reproduced below. \lstinputlisting{../share/why3session.dtd} \section{Prover Detection} \label{sec:proverdetecttiondata} The data configuration for the automatic detection of installed provers is stored in the file \texttt{provers-detection-data.conf} typically located in directory \verb|/usr/local/share/why3| after installation. The content of this file is reproduced below. %BEGIN LATEX {\footnotesize %END LATEX \lstinputlisting{../share/provers-detection-data.conf} %BEGIN LATEX } %END LATEX \section{The \texttt{why3.conf} Configuration File} \label{sec:whyconffile} \index{why3.conf@\texttt{why3.conf}}\index{configuration file} One can use a custom configuration file. The \why tools look for it in the following order: \begin{enumerate} \item the file specified by the \texttt{-C} or \texttt{-{}-config} options, \item the file specified by the environment variable \texttt{WHY3CONFIG} if set, \item the file \texttt{\$HOME/.why3.conf} (\texttt{\$USERPROFILE/.why3.conf} under Windows) or, in the case of local installation, \texttt{why3.conf} in the top directory of \why sources. \end{enumerate} If none of these files exist, a built-in default configuration is used. The configuration file is a human-readable text file, which consists of association pairs arranged in sections. %BEGIN LATEX Figure~\ref{fig:why3conf} shows an example of configuration file. %END LATEX %HEVEA Below is an example of configuration file. %BEGIN LATEX \begin{figure}[p] {\footnotesize %END LATEX \begin{verbatim} [main] loadpath = "/usr/local/share/why3/theories" loadpath = "/usr/local/share/why3/modules" magic = 14 memlimit = 0 plugin = "/usr/local/lib/why3/plugins/tptp" plugin = "/usr/local/lib/why3/plugins/genequlin" plugin = "/usr/local/lib/why3/plugins/hypothesis_selection" running_provers_max = 4 timelimit = 2 [ide] default_editor = "editor %f" error_color = "orange" goal_color = "gold" iconset = "fatcow" intro_premises = true premise_color = "chartreuse" print_labels = false print_locs = false print_time_limit = false saving_policy = 2 task_height = 404 tree_width = 512 verbose = 0 window_height = 1173 window_width = 1024 [prover] command = "'why3-cpulimit' 0 %m -s coqtop -batch -I %l/coq-tactic -R %l/coq Why3 -l %f" driver = "/usr/local/share/why3/drivers/coq.drv" editor = "coqide" in_place = false interactive = true name = "Coq" shortcut = "coq" version = "8.3pl4" [prover] command = "'why3-cpulimit' %t %m -s alt-ergo %f" driver = "/usr/local/share/why3/drivers/alt_ergo_0.93.drv" editor = "" in_place = false interactive = false name = "Alt-Ergo" shortcut = "altergo" shortcut = "alt-ergo" version = "0.93.1" [editor coqide] command = "coqide -I %l/coq-tactic -R %l/coq Why3 %f" name = "CoqIDE" \end{verbatim} %BEGIN LATEX } \caption{Sample \texttt{why3.conf} file} \label{fig:why3conf} \end{figure} %END LATEX A section begins with a header inside square brackets and ends at the beginning of the next section. The header of a section can be only one identifier, \texttt{main} and \texttt{ide} in the example, or it can be composed by a family name and one family argument, \texttt{prover} is one family name, \texttt{coq} and \texttt{alt-ergo} are the family argument. Sections contain associations \texttt{key=value}. A value is either an integer (\eg \texttt{-555}), a boolean (\texttt{true}, \texttt{false}), or a string (\eg \texttt{"emacs"}). Some specific keys can be attributed multiple values and are thus allowed to occur several times inside a given section. In that case, the relative order of these associations matter. \section{Drivers for External Provers} \label{sec:drivers} Drivers for external provers are readable files from directory \texttt{drivers}. Experimented users can modify them to change the way the external provers are called, in particular which transformations are applied to goals. [TO BE COMPLETED LATER] \section{Transformations} \label{sec:transformations} This section documents the available transformations. We first describe the most important ones, and then we provide a quick documentation of the others, first the non-splitting ones, \eg those which produce exactly one goal as result, and the others which produce any number of goals. Notice that the set of available transformations in your own installation is given by \begin{verbatim} why3 --list-transforms \end{verbatim} \index{list-transforms@\verb+--list-transforms+} \subsection{Inlining definitions} Those transformations generally amount to replace some applications of function or predicate symbols with its definition. \begin{description} \item[inline\_trivial] expands and removes definitions of the form \begin{whycode} function f x_1 ... x_n = (g e_1 ... e_k) predicate p x_1 ... x_n = (q e_1 ... e_k) \end{whycode} when each $e_i$ is either a ground term or one of the $x_j$, and each $x_1 \dots x_n$ occurs at most once in all the $e_i$. \index{inline-trivial@\verb+inline_trivial+} \item[inline\_goal] expands all outermost symbols of the goal that have a non-recursive definition. \index{inline-goal@\verb+inline_goal+} \item[inline\_all] expands all non-recursive definitions. \index{inline-all@\verb+inline_all+} \end{description} \subsection{Induction Transformations} \begin{description} \item[induction\_ty\_lex] \index{induction-ty-lex@\verb+induction_ty_lex+} performs structural, lexicographic induction on goals involving universally quantified variables of algebraic data types, such as lists, trees, etc. For instance, it transforms the following goal \begin{whycode} goal G: forall l: list 'a. length l >= 0 \end{whycode} into this one: \begin{whycode} goal G : forall l:list 'a. match l with | Nil -> length l >= 0 | Cons a l1 -> length l1 >= 0 -> length l >= 0 end \end{whycode} When induction can be applied to several variables, the transformation picks one heuristically. A label \verb|"induction"| can be used to force induction over one particular variable, \eg with \begin{whycode} goal G: forall l1 "induction" l2 l3: list 'a. l1 ++ (l2 ++ l3) = (l1 ++ l2) ++ l3 \end{whycode} induction will be applied on \verb|l1|. If this label is attached to several variables, a lexicographic induction is performed on these variables, from left to right. %\item[] Induction on inductive predicates. %[TO BE COMPLETED] % TODO: implement also induction on int ! \end{description} \subsection{Simplification by Computation} These transformations simplify the goal by applying several kinds of simplification, described below. The transformations differ only by the kind of rules they apply: \begin{description} \item[compute\_in\_goal] aggressively applies all known computation/simplification rules. \index{compute-in-goal@\verb+compute_in_goal+} \item[compute\_specified] performs rewriting using only built-in operators and user-provided rules. \index{compute-specified@\verb+compute_specified+} \end{description} The kinds of simplification are as follows. \begin{itemize} \item Computations with built-in symbols, \eg operations on integers, when applied to explicit constants, are evaluated. This includes evaluation of equality when a decision can be made (on integer constants, on constructors of algebraic data types), Boolean evaluation, simplification of pattern-matching/conditional expression, extraction of record fields, and beta-reduction. At best, these computations reduce the goal to \verb|true| and the transformations thus does not produce any sub-goal. For example, a goal like \verb|6*7=42| is solved by those transformations. \item Unfolding of definitions, as done by \verb|inline_goal|. Transformation \verb|compute_in_goal| unfolds all definitions, including recursive ones. For \verb|compute_specified|, the user can enable unfolding of a specific logic symbol by attaching the meta \verb|rewrite_def| to the symbol. \begin{whycode} function sqr (x:int) : int = x * x meta "rewrite_def" function sqr \end{whycode} \item Rewriting using axioms or lemmas declared as rewrite rules. When an axiom (or a lemma) has one of the forms \begin{whycode} axiom a: forall ... t1 = t2 \end{whycode} or \begin{whycode} axiom a: forall ... f1 <-> f2 \end{whycode} then the user can declare \begin{whycode} meta "rewrite" prop a \end{whycode} to turn this axiom into a rewrite rule. Rewriting is always done from left to right. Beware that there is no check for termination nor for confluence of the set of rewrite rules declared. \end{itemize} Instead of using a meta, it is possible to declare an axiom as a rewrite rule by adding the label \verb|"rewrite"| on the axiom name or on the axiom itself, e.g.: \begin{whycode} axiom a "rewrite": forall ... t1 = t2 lemma b: "rewrite" forall ... f1 <-> f2 \end{whycode} The second form allows some form of local rewriting, e.g. \begin{whycode} lemma l: forall x y. ("rewrite" x = y) -> f x = f y \end{whycode} can be proved by \verb|introduce_premises| followed by \verb|"compute_specified"|. \paragraph{Bound on the number of reductions} The computations performed by these transformations can take an arbitrarily large number of steps, or even not terminate. For this reason, the number of steps is bounded by a maximal value, which is set by default to 1000. This value can be increased by another meta, \eg \begin{whycode} meta "compute_max_steps" 1_000_000 \end{whycode} When this upper limit is reached, a warning is issued, and the partly-reduced goal is returned as the result of the transformation. \subsection{Other Non-Splitting Transformations} \begin{description} \item[eliminate\_algebraic] replaces algebraic data types by first-order definitions~\cite{paskevich09rr}. \index{eliminate-algebraic@\verb+eliminate_algebraic+} \item[eliminate\_builtin] removes definitions of symbols that are declared as builtin in the driver, \ie with a ``syntax'' rule. \index{eliminate-builtin@\verb+eliminate_builtin+} \item[eliminate\_definition\_func] replaces all function definitions with axioms. \index{eliminate-definition-func@\verb+eliminate_definition_func+} \item[eliminate\_definition\_pred] replaces all predicate definitions with axioms. \index{eliminate-definition-pred@\verb+eliminate_definition_pred+} \item[eliminate\_definition] applies both transformations above. \index{eliminate-definition@\verb+eliminate_definition+} \item[eliminate\_mutual\_recursion] replaces mutually recursive definitions with axioms. \index{eliminate-mutual-recursion@\verb+eliminate_mutual_recursion+} \item[eliminate\_recursion] replaces all recursive definitions with axioms. \index{eliminate-recursion@\verb+eliminate_recursion+} \item[eliminate\_if\_term] replaces terms of the form \texttt{if formula then t2 else t3} by lifting them at the level of formulas. This may introduce \texttt{if then else} in formulas. \index{eliminate-if-term@\verb+eliminate_if_term+} \item[eliminate\_if\_fmla] replaces formulas of the form \texttt{if f1 then f2 else f3} by an equivalent formula using implications and other connectives. \index{eliminate-if-fmla@\verb+eliminate_if_fmla+} \item[eliminate\_if] applies both transformations above. \index{eliminate-if@\verb+eliminate_if+} \item[eliminate\_inductive] replaces inductive predicates by (incomplete) axiomatic definitions, \ie construction axioms and an inversion axiom. \index{eliminate-inductive@\verb+eliminate_inductive+} \item[eliminate\_let\_fmla] eliminates \texttt{let} by substitution, at the predicate level. \index{eliminate-let-fmla@\verb+eliminate_let_fmla+} \item[eliminate\_let\_term] eliminates \texttt{let} by substitution, at the term level. \index{eliminate-let-term@\verb+eliminate_let_term+} \item[eliminate\_let] applies both transformations above. \index{eliminate-let@\verb+eliminate_let+} % \item[encoding\_decorate\_mono] % \item[encoding\_enumeration] \item[encoding\_smt] encodes polymorphic types into monomorphic types~\cite{conchon08smt}. \index{encoding-smt@\verb+encoding_smt+} \item[encoding\_tptp] encodes theories into unsorted logic. %~\cite{cruanes10}. \index{encoding-tptp@\verb+encoding_tptp+} % \item[filter\_trigger] *) % \item[filter\_trigger\_builtin] *) % \item[filter\_trigger\_no\_predicate] *) % \item[hypothesis\_selection] *) % Filter hypothesis of goals~\cite{couchot07ftp,cruanes10}. *) \item[introduce\_premises] moves antecedents of implications and universal quantifications of the goal into the premises of the task. \index{introduce-premises@\verb+introduce_premises+} % \item[remove\_triggers] *) % removes the triggers in all quantifications. *) \item[simplify\_array] automatically rewrites the task using the lemma \verb|Select_eq| of theory \verb|map.Map|. \index{simplify-array@\verb+simplify_array+} \item[simplify\_formula] reduces trivial equalities $t=t$ to true and then simplifies propositional structure: removes true, false, simplifies $f \land f$ to $f$, etc. \index{simplify-formula@\verb+simplify_formula+} \item[simplify\_recursive\_definition] reduces mutually recursive definitions if they are not really mutually recursive, \eg \begin{whycode} function f : ... = ... g ... with g : ... = e \end{whycode} becomes \begin{whycode} function g : ... = e function f : ... = ... g ... \end{whycode} if $f$ does not occur in $e$. \index{simplify-recursive-definition@\verb+simplify_recursive_definition+} \item[simplify\_trivial\_quantification] simplifies quantifications of the form \begin{whycode} forall x, x = t -> P(x) \end{whycode} into \begin{whycode} P(t) \end{whycode} when $x$ does not occur in $t$. More generally, this simplification is applied whenever $x=t$ or $t=x$ appears in negative position. \index{simplify-trivial-quantification@\verb+simplify_trivial_quantification+} \item[simplify\_trivial\_quantification\_in\_goal] is the same as above but it applies only in the goal. \index{simplify-trivial-quantification-in-goal@\verb+simplify_trivial_quantification_in_goal+} \item[split\_premise] replaces axioms in conjunctive form by an equivalent collection of axioms. In absence of case analysis labels (see \texttt{split\_goal} for details), the number of axiom generated per initial axiom is linear in the size of that initial axiom. \index{split-premise@\verb+split_premise+} \item[split\_premise\_full] is similar to \texttt{split\_premise}, but it also converts the axioms to conjunctive normal form. The number of axioms generated per initial axiom may be exponential in the size of the initial axiom. \index{split-premise-full@\verb+split_premise_full+} \end{description} \subsection{Other Splitting Transformations} \label{tech:trans:split} \begin{description} \item[simplify\_formula\_and\_task] is the same as \texttt{simplify\_formula} but it also removes the goal if it is equivalent to true. \index{simplify-formula-and-task@\verb+simplify_formula_and_task+} \item[split\_goal] changes conjunctive goals into the corresponding set of subgoals. In absence of case analysis labels, the number of subgoals generated is linear in the size of the initial goal. \paragraph{Behavior on asymmetric connectives and \texttt{by}/\texttt{so}} The transformation treats specially asymmetric and \texttt{by}/\texttt{so} connectives. Asymmetric conjunction \verb|A && B| in goal position is handled as syntactic sugar for \verb|A /\ (A -> B)|. The conclusion of the first subgoal can then be used to prove the second one. Asymmetric disjunction \verb+A || B+ in hypothesis position is handled as syntactic sugar for \verb|A \/ ((not A) /\ B)|. In particular, a case analysis on such hypothesis would give the negation of the first hypothesis in the second case. The \texttt{by} connective is treated as a proof indication. In hypothesis position, \verb|A by B| is treated as if it were syntactic sugar for its regular interpretation \verb|A|. In goal position, it is treated as if \verb|B| was an intermediate step for proving \verb|A|. \verb|A by B| is then replaced by \verb|B| and the transformation also generates a side-condition subgoal \verb|B -> A| representing the logical cut. Although splitting stops at disjunctive points like symmetric disjunction and left-hand sides of implications, the occurrences of the \texttt{by} connective are not restricted. For instance: \begin{itemize} \item Splitting \begin{whycode} goal G : (A by B) && C \end{whycode} generates the subgoals \begin{whycode} goal G1 : B goal G2 : A -> C goal G3 : B -> A (* side-condition *) \end{whycode} \item Splitting \begin{whycode} goal G : (A by B) \/ (C by D) \end{whycode} generates \begin{whycode} goal G1 : B \/ D goal G2 : B -> A (* side-condition *) goal G3 : D -> C (* side-condition *) \end{whycode} \item Splitting \begin{whycode} goal G : (A by B) || (C by D) \end{whycode} generates \begin{whycode} goal G1 : B || D goal G2 : B -> A (* side-condition *) goal G3 : B || (D -> C) (* side-condition *) \end{whycode} Note that due to the asymmetric disjunction, the disjunction is kept in the second side-condition subgoal. \item Splitting \begin{whycode} goal G : exists x. P x by x = 42 \end{whycode} generates \begin{whycode} goal G1 : exists x. x = 42 goal G2 : forall x. x = 42 -> P x (* side-condition *) \end{whycode} Note that in the side-condition subgoal, the context is universally closed. \end{itemize} The \texttt{so} connective plays a similar role in hypothesis position, as it serves as a consequence indication. In goal position, \verb|A so B| is treated as if it were syntactic sugar for its regular interpretation \verb|A|. In hypothesis position, it is treated as if both \verb|A| and \verb|B| were true because \verb|B| is a consequence of \verb|A|. \verb|A so B| is replaced by \verb|A /\ B| and the transformation also generates a side-condition subgoal \verb|A -> B| corresponding to the consequence relation between formula. As with the \texttt{by} connective, occurrences of \texttt{so} are unrestricted. For instance: \begin{itemize} \item Splitting \begin{whycode} goal G : (((A so B) \/ C) -> D) && E \end{whycode} generates \begin{whycode} goal G1 : ((A /\ B) \/ C) -> D goal G2 : (A \/ C -> D) -> E goal G3 : A -> B (* side-condition *) \end{whycode} \item Splitting \begin{whycode} goal G : A by exists x. P x so Q x so R x by T x (* reads: A by (exists x. P x so (Q x so (R x by T x))) *) \end{whycode} generates \begin{whycode} goal G1 : exists x. P x goal G2 : forall x. P x -> Q x (* side-condition *) goal G3 : forall x. P x -> Q x -> T x (* side-condition *) goal G4 : forall x. P x -> Q x -> T x -> R x (* side-condition *) goal G5 : (exists x. P x /\ Q x /\ R x) -> A (* side-condition *) \end{whycode} In natural language, this corresponds to the following proof scheme for \verb|A|: There exists a \verb|x| for which \verb|P| holds. Then, for that witness \verb|Q| and \verb|R| also holds. The last one holds because \verb|T| holds as well. And from those three conditions on \verb|x|, we can deduce \verb|A|. \end{itemize} \paragraph{Labels controlling the transformation} The transformations in the split family can be controlled by using labels on formulas. The label \verb|"stop_split"| can be used to block the splitting of a formula. The label is removed after blocking, so applying the transformation a second time will split the formula. This is can be used to decompose the splitting process in several steps. Also, if a formula with this label is found in non-goal position, its \texttt{by}/\texttt{so} proof indication will be erased by the transformation. In a sense, formulas tagged by \verb|"stop_split"| are handled as if they were local lemmas. The label \verb|"case_split"| can be used to force case analysis on hypotheses. For instance, applying \texttt{split\_goal} on \begin{whycode} goal G : ("case_split" A \/ B) -> C \end{whycode} generates the subgoals \begin{whycode} goal G1 : A -> C goal G2 : B -> C \end{whycode} Without the label, the transformation does nothing because undesired case analysis may easily lead to an exponential blow-up. Note that the precise behavior of splitting transformations in presence of the \verb|"case_split"| label is not yet specified and is likely to change in future versions. \index{split-goal@\verb+split_goal+} \item[split\_all] performs both \texttt{split\_premise} and \texttt{split\_goal}. \index{split-all@\verb+split_all+} \item[split\_intro] performs both \texttt{split\_goal} and \texttt{introduce\_premises}. \index{split-intro@\verb+split_intro+} \item[split\_goal\_full] has a behavior similar to \texttt{split\_goal}, but also converts the goal to conjunctive normal form. The number of subgoals generated may be exponential in the size of the initial goal. \index{split-goal-full@\verb+split_goal_full+} \item[split\_all\_full] performs both \texttt{split\_premise} and \texttt{split\_goal\_full}. \index{split-all-full@\verb+split_all_full+} \end{description} %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: "manual" %%% End: why3-0.87.3/doc/manual.bib0000644000175000017500000001732713035416743015755 0ustar guillaumeguillaume@comment{{This file has been generated by bib2bib 1.94}} @comment{{Command line: /usr/bin/bib2bib -c '$key="schulz04ijcar" or $key="ayad10ijcar" or $key="CoqArt" or $key="conchon08smt" or $key="paskevich09rr" or $key="z3" or $key="ergo" or $key="simplify05" or $key="DM06" or $key="BarTin-CAV-07" or $key="vstte10comp" or $key="melquiond08rnc" or $key="filliatre07cav" or $key="okasaki98" or $key="boogie11why3" or 1=2' /home/cmarche/biblio/abbrevs.bib /home/cmarche/biblio/demons.bib /home/cmarche/biblio/demons2.bib /home/cmarche/biblio/demons3.bib /home/cmarche/biblio/team.bib /home/cmarche/biblio/crossrefs.bib /home/cmarche/biblio/crossrefs2.bib}} @string{sv = {Springer}} @string{lnai = {Lecture Notes in Artificial Intelligence}} @string{lncs = {Lecture Notes in Computer Science}} @inproceedings{BarTin-CAV-07, author = {Clark Barrett and Cesare Tinelli}, title = {{CVC3}}, booktitle = {Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07), Berlin, Germany}, pages = {}, year = 2007, editor = {W.~Damm and H.~Hermanns}, volume = {}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, url = {ftp://ftp.cs.uiowa.edu/pub/tinelli/papers/BarTin-CAV-07.pdf} } @book{CoqArt, author = {Yves Bertot and Pierre Cast\'eran}, title = {Interactive Theorem Proving and Program Development}, subtitle = {Coq'Art: The Calculus of Inductive Constructions}, publisher = {Springer-Verlag}, serie = {Texts in Theoretical Computer Science}, year = 2004 } @unpublished{DM06, author = {Bruno Dutertre and Leonardo de Moura}, institution = {SRI International}, title = {The {Yices} {SMT} Solver}, year = {2006}, note = {available at \url{http://yices.csl.sri.com/tool-paper.pdf}} } @article{simplify05, author = {David Detlefs and Greg Nelson and James B. Saxe}, title = {Simplify: a theorem prover for program checking.}, journal = {J. ACM}, volume = {52}, number = {3}, year = {2005}, pages = {365-473}, ee = {http://doi.acm.org/10.1145/1066100.1066102}, bibsource = {DBLP, http://dblp.uni-trier.de} } @misc{z3, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {{Z3}, An Efficient {SMT} Solver}, note = {\url{http://research.microsoft.com/projects/z3/}} } @inproceedings{schulz04ijcar, author = {S. Schulz}, title = {{System Description: E~0.81}}, booktitle = {Proc.\ of the 2nd IJCAR, Cork, Ireland}, editor = {D. Basin and M. Rusinowitch}, volume = 3097, series = {LNAI}, year = 2004, publisher = {Springer}, pages = {223--228} } @misc{vstte10comp, author = {Natarajan Shankar and Peter Mueller}, title = {{Verified Software: Theories, Tools and Experiments (VSTTE'10). Software Verification Competition}}, month = {August}, year = 2010, address = {Edinburgh, Scotland}, note = {\url{http://www.macs.hw.ac.uk/vstte10/Competition.html}} } @book{okasaki98, author = {Chris Okasaki}, title = {{Purely Functional Data Structures}}, publisher = {Cambridge University Press}, year = 1998 } @inproceedings{conchon08smt, author = {Fran\c{c}ois Bobot and Sylvain Conchon and \'Evelyne Contejean and St\'ephane Lescuyer}, title = {{Implementing Polymorphism in SMT solvers}}, booktitle = {SMT 2008: 6th International Workshop on Satisfiability Modulo}, pages = {1--5}, year = 2008, editor = {Clark Barrett and Leonardo de Moura}, volume = 367, series = {ACM International Conference Proceedings Series}, topics = {team,lri}, type_digiteo = {conf_autre}, type_publi = {colloque}, x-equipes = {demons PROVAL}, x-type = {article}, x-support = {actes_aux}, x-cle-support = {SMT}, x-pdf = {http://www.lri.fr/~conchon/publis/conchon-smt08.pdf}, url = {http://www.lri.fr/~conchon/publis/conchon-smt08.pdf}, x-editorial-board = {yes}, x-international-audience = {yes}, x-proceedings = {yes}, isbn = {978-1-60558-440-9} } @misc{ergo, author = {Sylvain Conchon and \'Evelyne Contejean}, title = {The {Alt-Ergo} automatic Theorem Prover}, url = {http://alt-ergo.lri.fr/}, howpublished = {\url{http://alt-ergo.lri.fr/}}, note = {APP deposit under the number IDDN FR 001 110026 000 S P 2010 000 1000}, topics = {team,lri}, year = 2008, x-equipes = {demons PROVAL}, x-type = {manuel}, x-support = {diffusion} } @inproceedings{filliatre07cav, author = {Jean-Christophe Filli\^atre and Claude March\'e}, title = {The {Why/Krakatoa/Caduceus} Platform for Deductive Program Verification}, crossref = {cav07}, pages = {173--177}, topics = {team, lri}, type_digiteo = {conf_isbn}, type_publi = {icolcomlec}, x-pdf = {http://www.lri.fr/~filliatr/ftp/publis/cav07.pdf}, url = {http://www.lri.fr/~filliatr/ftp/publis/cav07.pdf}, x-equipes = {demons PROVAL EXT}, x-type = {articlecourt}, x-support = {actes}, x-cle-support = {CAV} } @inproceedings{melquiond08rnc, author = {Guillaume Melquiond}, title = {Floating-point arithmetic in the {C}oq system}, booktitle = {Proceedings of the 8th Conference on Real Numbers and Computers}, address = {Santiago de Compostela, Spain}, year = {2008}, pages = {93--102}, x-equipes = {demons PROVAL}, x-type = {article}, x-support = {actes}, x-cle-support = {RNC}, topics = {team}, x-editorial-board = {yes}, x-international-audience = {yes}, x-proceedings = {yes}, x-pdf = {http://www.lri.fr/~melquion/doc/08-rnc8-article.pdf} } @techreport{paskevich09rr, author = {Andrei Paskevich}, title = {Algebraic types and pattern matching in the logical language of the {Why} verification platform}, institution = {INRIA}, year = 2009, topics = {team}, hal = {http://hal.inria.fr/inria-00439232/en/}, note = {\url{http://hal.inria.fr/inria-00439232/en/}}, number = 7128 } @inproceedings{ayad10ijcar, author = {Ali Ayad and Claude March\'e}, title = {Multi-Prover Verification of Floating-Point Programs}, crossref = {ijcar10}, url = {http://www.lri.fr/~marche/ayad10ijcar.pdf}, x-equipes = {demons PROVAL EXT}, topics = {team}, type_publi = {icolcomlec}, x-international-audience = {yes}, x-proceedings = {yes}, x-support = {actes}, x-cle-support = {IJCAR}, x-type = {article}, x-editorial-board = {yes} } @inproceedings{boogie11why3, author = {Fran\c{c}ois Bobot and Jean-Christophe Filli\^atre and Claude March\'e and Andrei Paskevich}, title = {Why3: Shepherd Your Herd of Provers}, topics = {team}, booktitle = {Boogie 2011: First International Workshop on Intermediate Verification Languages}, year = 2011, address = {Wroc\l{}aw, Poland}, month = {August}, url = {http://proval.lri.fr/submissions/boogie11.pdf}, abstract = {Why3 is the next generation of the Why software verification platform. Why3 clearly separates the purely logical specification part from generation of verification conditions for programs. This article focuses on the former part. Why3 comes with a new enhanced language of logical specification. It features a rich library of proof task transformations that can be chained to produce a suitable input for a large set of theorem provers, including SMT solvers, TPTP provers, as well as interactive proof assistants.} } @proceedings{ijcar10, title = {International Joint Conference on Automated Reasoning}, booktitle = {Fifth International Joint Conference on Automated Reasoning}, year = 2010, editor = {J{\"u}rgen Giesl and Reiner H{\"a}hnle}, address = {Edinburgh, Scotland}, month = jul, series = lnai, publisher = sv } @proceedings{cav07, editor = {Werner Damm and Holger Hermanns}, title = {Computer Aided Verification}, booktitle = {19th International Conference on Computer Aided Verification}, publisher = sv, series = lncs, volume = 4590, address = {Berlin, Germany}, month = jul, year = {2007} } why3-0.87.3/doc/spec.bnf0000644000175000017500000000152613035416743015435 0ustar guillaumeguillaume\begin{syntax} spec ::= requires | ensures | returns | raises ; | reads | writes | variant \ requires ::= "requires" "{" formula "}" \ ensures ::= "ensures" "{" formula "}" \ returns ::= "returns" "{" "|"? formula-case ("|" formula-case)* "}" \ reads ::= "reads" "{" term ( "," term )* "}" \ writes ::= "writes" "{" term ( "," term )* "}" \ raises ::= "raises" "{" "|"? raises-case ("|" raises-case)* "}" ; | "raises" "{" uqualid ("," uqualid)* "}" \ raises-case ::= uqualid pattern? "->" formula \ variant ::= "variant" "{" one-variant ("," one-variant)+ "}" \ one-variant ::= term ("with" variant-rel)? \ variant-rel ::= lqualid \ invariant ::= "invariant" "{" formula "}" ; \ assertion ::= ("assert" | "assume" | "check") "{" formula "}" ; | "absurd" \end{syntax} why3-0.87.3/doc/coq.tex0000644000175000017500000000426513035416743015323 0ustar guillaumeguillaume \section{Coq} \label{sec:coq} \index{Coq proof assistant} This section describes the content of the Coq files generated by \why for both proof obligations and theory realizations. When reading a Coq script, \why is guided by the presence of empty lines to split the script, so the user should refrain from removing empty lines around generated parts or adding empty lines inside them. \begin{enumerate} \item The header of the file contains all the library inclusions required by the driver file. Any user-made changes to this part will be lost when the file is regenerated by \why. This part ends at the first empty line. \item Abstract logic symbols are assumed with the vernacular directive \verb+Parameter+. Axioms are assumed with the \verb+Axiom+ directive. When regenerating a script, \why assumes that all such symbols have been generated by a previous run. As a consequence, the user should not introduce new symbols with these two directives, as they would be lost. \item Definitions of functions and inductive types in theories are printed in a block that starts with \verb+(* Why3 assumption *)+. This comment should not be removed; otherwise \why will assume that the definition is user-made. \item Finally, proof obligations and symbols to be realized are introduced by \verb+(* Why3 goal *)+. The user is supposed to fill the script after the statement. \why assumes that the user-made part extends up to \verb+Qed+, \verb+Admitted+, \verb+Save+, or \verb+Defined+, whichever comes first. In the case of definitions, the original statement can be replaced by a \verb+Notation+ directive, in order to ease the usage of already defined symbols. \why also recognizes \verb+Variable+ and \verb+Hypothesis+ and preserves them; they should be used in conjunction with Coq's \verb+Section+ mechanism to realize theories that still need some abstract symbols and axioms. \end{enumerate} Currently, the parser for Coq scripts is rather naive and does not know much about comments. For instance, \why can easily be confused by some terminating directive like \verb+Qed+ that would be present in a comment. %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: "manual" %%% End: why3-0.87.3/doc/isabelle.tex0000644000175000017500000000406313035416743016315 0ustar guillaumeguillaume\section{Isabelle/HOL} \label{sec:isabelle} \index{Isabelle proof assistant} When using Isabelle from \why, files generated from \why theories and goals are stored in a dedicated XML format. Those files should not be edited. Instead, the proofs must be completed in a file with the same name and extension \texttt{.thy}. This is the file that is opened when using ``Edit'' action in \texttt{why3 ide}. \subsection{Installation} You need version Isabelle2016 or Isabelle2016-1. Former versions are not supported. We assume below that your version is 2016-1, please replace 2016-1 by 2016 otherwise. Isabelle must be installed before compiling \why. After compilation and installation of \why, you must manually add the path \begin{verbatim} /isabelle \end{verbatim} into either the user file \begin{verbatim} .isabelle/Isabelle2016-1/etc/components \end{verbatim} or the system-wide file \begin{verbatim} /etc/components \end{verbatim} \subsection{Usage} The most convenient way to call Isabelle for discharging a \why goal is to start the Isabelle/jedit interface in server mode. In this mode, one must start the server once, before launching \texttt{why3 ide}, using \begin{verbatim} isabelle why3_jedit \end{verbatim} Then, inside a \texttt{why3 ide} session, any use of ``Edit'' will transfer the file to the already opened instance of jEdit. When the proof is completed, the user must send back the edited proof to \texttt{why3 ide} by closing the opened buffer, typically by hitting \texttt{Ctrl-w}. \subsection{Realizations} Realizations must be designed in some \texttt{.thy} as follows. The realization file corresponding to some \why file \texttt{f.why} should have the following form. \begin{verbatim} theory Why3_f imports Why3_Setup begin section {* realization of theory T *} why3_open "f/T.xml" why3_vc why3_vc by proof [...] why3_end \end{verbatim} See directory \texttt{lib/isabelle} for examples. %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: "manual" %%% End: why3-0.87.3/doc/itp.tex0000644000175000017500000001122013035416743015322 0ustar guillaumeguillaume \chapter{Interactive Proof Assistants} % ... We then provide specific information about some ITPs. \section{Using an Interactive Proof Assistant to Discharge Goals} Instead of calling an automated theorem prover to discharge a goal, \why offers the possibility to call an interactive theorem prover instead. In that case, the interaction is decomposed into two distinct phases: \begin{itemize} \item Edition of a proof script for the goal, typically inside a proof editor provided by the external interactive theorem prover; \item Replay of an existing proof script. \end{itemize} An example of such an interaction is given in the tutorial section~\ref{sec:gui}. Some proof assistants offer more than one possible editor, \eg a choice between the use of a dedicated editor and the use of the Emacs editor and the ProofGeneral mode. Selection of the preferred mode can be made in \texttt{why3ide} preferences, under the ``Editors'' tab. \section{Theory Realizations} \label{sec:realizations} Given a \why theory, one can use a proof assistant to make a \emph{realization} of this theory, that is to provide definitions for some of its uninterpreted symbols and proofs for some of its axioms. This way, one can show the consistency of an axiomatized theory and/or make a connection to an existing library (of the proof assistant) to ease some proofs. %Currently, realizations are supported for the proof assistants Coq and PVS. \subsection{Generating a realization} Generating the skeleton for a theory is done by passing to the \texttt{realize} command a driver suitable for realizations, the names of the theories to realize, and a target directory. \index{realize@\texttt{realize}} \begin{verbatim} why3 realize -D path/to/drivers/prover-realize.drv -T env_path.theory_name -o path/to/target/dir/ \end{verbatim} \index{driver@\verb+--driver+} \index{theory@\verb+--theory+} The theory is looked into the files from the environment, \eg the standard library. If the theory is stored in a different location, option \texttt{-L} should be used. The name of the generated file is inferred from the theory name. If the target directory already contains a file with the same name, \why extracts all the parts that it assumes to be user-edited and merges them in the generated file. Note that \why does not track dependencies between realizations and theories, so a realization will become outdated if the corresponding theory is modified. It is up to the user to handle such dependencies, for instance using a \texttt{Makefile}. \subsection{Using realizations inside proofs} If a theory has been realized, the \why printer for the corresponding prover will no longer output declarations for that theory but instead simply put a directive to load the realization. In order to tell the printer that a given theory is realized, one has to add a meta declaration in the corresponding theory section of the driver. \index{driver file} \begin{verbatim} theory env_path.theory_name meta "realized_theory" "env_path.theory_name", "optional_naming" end \end{verbatim} The first parameter is the theory name for \why. The second parameter, if not empty, provides a name to be used inside generated scripts to point to the realization, in case the default name is not suitable for the interactive prover. \index{realized_theory@\verb+realized_theory+} \subsection{Shipping libraries of realizations} While modifying an existing driver file might be sufficient for local use, it does not scale well when the realizations are to be shipped to other users. Instead, one should create two additional files: a configuration file that indicates how to modify paths, provers, and editors, and a driver file that contains only the needed \verb+meta "realized_theory"+ declarations. The configuration file should be as follows. \index{configuration file} \begin{verbatim} [main] loadpath="path/to/theories" [prover_modifiers] name="Coq" option="-R path/to/vo/files Logical_directory" driver="path/to/file/with/meta.drv" [editor_modifiers coqide] option="-R path/to/vo/files Logical_directory" [editor_modifiers proofgeneral-coq] option="--eval \"(setq coq-load-path (cons '(\\\"path/to/vo/files\\\" \ \\\"Logical_directory\\\") coq-load-path))\"" \end{verbatim} This configuration file can be passed to \why thanks to the \verb+--extra-config+ option. \index{extra-config@\verb+--extra-config+} \index{prover_modifiers@\verb+prover_modifiers+} \index{editor_modifiers@\verb+editor_modifiers+} \index{option@\verb+option+} \index{driver@\verb+driver+} \input{./coq.tex} \input{./coq_tactic.tex} \input{./isabelle.tex} \input{./pvs.tex} %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: "manual" %%% End: why3-0.87.3/doc/gui-0-70-2.png0000644000175000017500000020147213035416743016030 0ustar guillaumeguillaumePNG  IHDRKlי pHYs`%'/ IDATxw\GgwChAĂĞ5jĚػ{%*n,*ETP^q}c\pHq3<3cfv>@ @tƄ&DA ÐEM HSGsi%6?\#$aMfjblij]T-z%& F,"a<= EMfE+A5RZ}Vmt4Pb@٢Q95@N4,-]À67EmDFWE6N6PnS%4(@K%ژina}EI'WPZv((9lReyهRO(MV`uj0=wZh鰶Ti{Wa) Ȫ0LxR@ZKY3Uh,YWL{ UF&[A2lPHX)KBH-CZ50 r=kiلUAW}-NzUz;rwYj-k_LS9ԐjT*NS(D"L!hNh$jر/IZC5p!^xqx@(¯v]JϞ93c/D`vLurr*))9ܟlݽg8QWEx)iC:ͲjN7UGu0PX\\ED$ }|?{fkk`0T遦uB%# 2 QZe4N:is`VXӕR73uƪm:u#۷o{ {-1KjJrHHgLM51LÖ,]ֳW/sssDocD'J'^ #Wd jU־}Ӧߌ%Z;c gggD"?Y֘%OOZLR1u\i(^mc :+vW5/P(d0߸aܦ& dׯ_KYZX ٣'`gkUV@QE1jjOmW,--zM"kUV֫sg~$*j`npS&gϞ}(޳pW._NJ`0:t0tpV^^~⅗/^|;;tiIɓ~Wzݻv.[B'EWX>۵k?~4558p<6e999&Oi۶O+HKKߕ<~FNOO'FդL$S_.khhXsR0`L&uͻt˗/=KOd4gg0??@$__?1w܅{~~|CXxҌk׮*zU6%F?Jji*ң]V:aXyy bHHh4ayyM]=IAA}ʁab8/?aaİœ'ǣ }.g߾} [n0GyH$~oޱcܱԷF8q"ccP(Xv!C~?z4=}gF Hyy 5;w99׮]رBҚ3;[[;{]t%Ɵ40ݳ{7[AAMLMzT -,,>:q?b?{vSm4C'OS5uKwvvNLף{%괹/?wqvYx@ x:+66`?wY! V`ثcG?ğ~l[tndۿLtZJ{3EKP'PWL&l׶mUUae&T*OJl6R*gzeiiYw" /DFFvda;o;}_}׿D"Q ˰`hGXYǎSo==b(ֳmvv6nLaog߿:. ƌ{] ‚I׮!>{͛6HQQ' $e`` Hڴj̘w$`BH( ܸ~m2?ܺuK?EQزΝC1 326a̘GO``v^aa}"#L&.?Ϙ j"IjnjbX\,H#uPu`~_1ĚmAUUZZھ{{GDԌw@?@LL#I$D l~a111XF}FBӅBӘ1cUu΃ t2+KUg0L 2 }KHs>'Gq$"W'7O25111N|PO{'2mWY .`2Ȉbadeea.MTgi=0 EG}v`@tZQj0\X@&Ouue642P;SN :m;~(h'o!2#l-<߉IԾ!*(6ڛ)1ֻҾtZu0^%Y{v‚|":.+!m긯u\dħy<'O:&aH$*--hllah3G˫U؁Ʀtnsdx<\;|L&%*Ko``K 0Y:dȐY~ŷK(`˯}شq?0̬:)۷ٱ7cI XOW.(ml@j-dYꪖL$(*H޿Yw4i_5d2F+]W]I0D(*,;$%%{h"E}uf^;!t v0LONC kg6*Pm4Rn1373#H<<=oP۷i4'WEWhxxݻwd2靄޽e(}u ;$ =.%%Y(>Bg 1>AˮnQ7cc oތ;n"'yz:gpss<3سgnnn|*pic/+/3Mn,O` %lmmu6g'ON>H$mlmv:wO(枑Q}F gj@ĦϧZKœko\X Tz}у3V;5[=| 162|J3$bD,r8o^g͜KwJ F{𡱑!ht\ 9d(ruw۝;wO3uW+,,}4#CQѿ:tX_[h-˚/^@ A4ŋ̗;o# j;} yrA'ߌqR$';{Ϯr322PƩm޼ظcN|Ŕ}A\ܭ6? Eb͛7߻wħ6t155/:33s?nMNNHׯ]kð?nII~XYQ.H׮^m[!>}.\8&D"qzz ##*L }liieggMU8I.FzƩMKK+NJ Iqqq~~O: (po&Zmz殦r8ҧa;>u]n憢hA\3)-Pw4h0l`7cFFnnӦOwttOO&dS\9B1lǣ+**0 ۱c'YϜ>}...Wȅ3ȑ/ZH&۷?a“$SS ;wvaV3a;|АC1ds[_~u̙cG(ү j{2ӳq?w888xw|LSrW}w-^J6Fwp;sh(C60b;d͛gNfffO</!Co޺y̙ZI+1W._:|~ nn3Gi+9_Qa7]}*dUYIòC0L;;/^w#!NRMlNH$IYyX"zVh+zy^hS}ZZzPgp\ EA\.aDKc.$͝;g 2LRd2 d2DB!ϗoWl104!U=MDR$@T&J2 uc0 ^`05fPT x /_`3j,HdjQ(Ra# (x2L&d%1:Uh ۔6ΧBd|~:aRT&oh$ZP2ͥRyCjzT*yO"b<ȈQ(&[,ɯF<.ߖG$EN jQ/?PWTZPPÇllI ¢G}}}۴icooM{GZ@ѸVݻwx<ްÔ\> ]fQKSFu[dȨVhיuP}>cEUMHRS\\rv88:ؘDMuJ+pu&oFMM7B||X?hSAlFkΏNhN Ӻћ҇i[Wt_zUpquUc/D*LF& t:̝ZiӬE,P^ kjG³:{M_Uo݉.NR7^SC"U-yk7ҪOcW0 5\`i?\ h7ɽ&l g=b,J{e-k[YTs8Z :ka)kkR..~ԃ|KhN,uOK\9LeJ{%U=A5V+jD GpW5U^Ky4Sd_Nʩ,@,d␐ࠠSNyM#@  ҽ{'xѢÇ,Y2i{ʙ?ocя?3f̱c#̗g͚4irrrʎ;Ν;u͖-[>[q w8q#@ UPLfDD?:u8xܹq T9۷hSSӞ={٫hwiZpѡÇz`7t0|{\w֭GH@ zUivzzzϞ 1UǺu늊AF AjjjX^ݠ3220 Ja7))A Dj즦<.xfD#b[nXo6NN~~aa$ų>}"GRaB@ ZZl#cc|ȈͮTrw%sӟmu5<L:Yڳs|>ܹL61@ Q`9u԰p[nݻTc|,::99{ƌu #>)3cT?~„=zmX,7lXMXԱ㼹ڶms{@ rѓHQaaSǣH4@ F((M6/W @ H )M@ZM)Ti@ @@ @i@ 7@ PZA  ( @V@ z, G(UK$QH HtёF7V*תzՕD"!A _2|@B ƫ\V:KWL#Zmlm@}W3*[TcffVY^4 Z!H+U^5Ir121xJT]ZπX,&ZR@Z:T E**M߯gϜ+\.~ fgd#g#`(5iN4sC<@ "rG`gB AT=W_8z6,. Puk=V X>22^X>~4Ws￫w>TTTppph߾ot jP[%H&ǢO8>7א q:wܴEs-4K.7ubg@Z"VZ-桊p|;66v˖-&4iuUUUrrƌҫl fffڷwݻw7nm'[^QLy̭췠 *q0ݬҴ4 g`g1tϤIHٮ]wƶ:Ϝi&/(x}{r].3f:8K>#3OdgKK?gBVr:Tի[XNҩv3~oLu21@2BpyZ-E1ĺ`V_{~P tp& ?S{waZi|˝.ߴiӑ#Glk3755ӧO޽㏆QJ@@PH>}Xe-J[M1f5| JKSL%(*SE11E;fֶ-cHa3A {\]R֬y}|ӧ*LjQuX&.םhL:9t+%K[(x_QpiL~/Tm^';@ =zZT*ݶ}[XX&9"00OsgoݨAAnTySUUr.]B0Un5#"zĄxyjQQQ~AA`@ ǎk[g4g\m^Cݻw[zP(T>/aULƷ+**SM7?r XN 1f5˖/9$$xRj鲥!!;oM5&GG}F!:83ѣaII&ޜ9'o.(*bMuL̨˗Kݒ}*00ҥQiiQ.Y ӷo'Qp^޽#=K_?Uٳg^UEEIITCCtkHwќcGF\|'fZd>5nü޶ 8BknN8:z5U~rʕ+4ɓRRRׯ}ӧ̗g͚4irrrʎ;Ν;xÇ,Y2i{K8ŋݮ]{ u;Ը?ocя?3f̱cѣL$%޽i ra~<7wJa0]9r$M߻˗1u@"ښp4j/A[Gm=R@ Ou28al҅mO~ĘuDqǗ={e:@4ByH!57T$!HF-  H5C6$B1@&AH5IWΓ~o/]lӦMÆݻw#""m-\t=z<0wiOʃԱ~$ 0P۷hSSӞ={KCT#۫ nK.hb|=@+̳gφv>vVD:`gg7ƍp# Ƽ/^jԜ6(+TƩ7DcggyѢÉ#GfʕQL|4S7behkO_7$Y@ܛ퉧GNڷxƹ ey e@ PBBC:o%fgŷSSS͛/O qoջ{mc^aJTcݺuSN;WUUɓ[UΣ"!D۷msߩxL2|WvW 6xzxlظQU[iZBYKpS(:Ҷm5's!*1,-Ńo0rrRnn.,-/}?\USNNe) Ĥҫ$п~{W[YXƯLӘNպOp&\g"# ]c@ r+La0bf}DS}c<ԌdjjrU%֭[7_߷od''_?|޽@ ] $gӴ r֖_..L&S*+&JvH$6nXl={kj .ߋA}c G$ dn&TT"4oN\={9}:iKyzD"E))\%ҥ˖Ze}>yrF^?sқS}|@(T:Dέ,qbe}{9yy `R'T8D_lҩ5eF/3|p_RkLML%ٕ#l6X>ƭ]bqNvvZ~ >vXاq'_]11W^57S@x PYt颲W'zDt:]~T|5's3ͭիk5Oi̙II%O\#5~)(<¥BPG6nSVVj^ӻC&R4x]c774 kc;Oƀ4e0;@leS|&N4qu%h$cĈȚ' <:x0 !VV;yQ^Gd"KT5<>zҘ42e]Lbѫ142a\ 68_ԺBzfkbxk++.sxtHHiS{{{;}9=qĞz#RP= wqㆹsQ˗/RWM<_,LC?NM6}zHHg2ٳ}?z4䔘ؽ{wkwV^nz//}({!ƬwԜ̍NKpwMJ 4pΜ9sTy6tt ]NU1DPTGeHc?mui#ʷ==hjsm6m€@ :<<p;&xkDK@Zת|0LN-&t@ &~B :n;MZDoi(xty|?8HsfLQ@ ڤ쵂@Z%Ǝ ݵkwNvҥKDBa-Z/LR i)6iի}`O~5 kMӦNj@VZzȐ@qQ͚=`o_Pmjgd5ٳU o|j,VSpn+^bөS~3qu KKڕ玠jll۩̙&n_G·w ]pɍ$(.6b'T*ȍ>rdwI)f?a y2T.~?/z3ia_v32~VVeϞUL****LJ  ku⨴KEvҷo&M:&fTZ˥UUO{C&~4p6$Jwԯ3iI2s%K;uݝZBPés lm&y D.QQ&S!֭d:`8tQC\eS|&N4qu%h$cĈ[iTZܼeǏ)Jdd ;edSoٳ'++ жm۩ӦSlΝϟ3449oo l%%% o̘1={i!F"vH"2&!1G&r2_`emcDFBVgΜ[nQ?\cǢ?~;f̘cǎz L5BVU@R1L 澗cc 0 c)UXP\R&@eBKJׯe9ۅwڿ?1>;zT7U8tk+K/3\]j4rLk+K>?oܶVZ&0k+7@Cj=K_^^/H;|n4xW*jlF[%jHXTa>=GX#N'J;{Inii2 "%Qhw^khXWf.FFb(ثyvMiV;w00kk{ sa7os_}Y,Neej=֭[W׷)`meIQDVUV ȸ%&SJΣc/, *I2 @Q+X9nnnf϶RAAA7m>pZE}Xu޽K;/_QQQK,ݾm:tØ1cƎ7nvԩt:]˂~86n:zӑ#3vF4hpVV㭼cǍ@Q&\HD/].xh:r[⻇1*B7 ?4a_&˗1E73SH@ Q)*++-,jM$x)Jmm.ےG6&3 LC*B @ HQ)k/.L522b+l6ߎYz(yA]S6oҡC,Z!5|IHІBCav`H$@&*Fd@QPX̬Y{T qdDOUTTthY[Y:F#Qܼ677V%2*zajjSǏ10tcOCicwJyY@&Un~~~.3^G|~HpG̚56ƍ?=g܅ oCUEa P vn~ѳ2.J>zq[y^jd!k57o|,,*ȏبX`@UN,H2I3gL0чŒJ=Zz?_ԺHJ*\>8^Rt+-G|PR xU$BgX: rt 6tf(>"hӈX,vsuII}dooԱTSv{ׯ 'S#[3S&/qx* |)cNL1 :X=ҪlA?-VQ4h^zE&===gΜ1h`5 9޴722Ɖ .݌f80r棫6n~xfkO_HAD@,! ]:8x{V_؈D?nz|@ u*22222lw4ng ckGNLC M񽭐f% ߶}GSǢu+#~|xnY ޳gk_ӣ ӧMo` D)M ^=zh6mZ1 gZͼF*ݲeN_CY3K\Ç׭=gA @iEs̆ 47d>gnnؾ֭7u\HkVU,4g @ ހV@  򹑉o2nUf?9c[+V ,HdjSG@ ^dbLq|sPN D eAK_1M- h(ZK(W|j`1B }CIe|@ h+m{n$J'[[!ظpk=| *'?9a>7(~Qf+ s_~y&+׀@ J"|UK0ck; I||)aҸf6f"1UWot#TB"SQǏ&յ7ozyy;vذa3֛.._M҇'Ei']Y@{W"aR!@1%{w$Ī@ H}Ҫ $J20Q1 J}*056QHR x6? L'&u _Cc6u{?˹\?6RqkVgs2.!Ϩ"rf-ٙN177%02ÙIzzRZZ:fۚ!D6;ԁ@ _.ppPV0 U"2RJZTLͷqs0yimTuCZSǮ~}ܹs߾}WJaaa߬ c^/y. $Ns2/PdY9ŹMu3ðEΜ9!NYhK_!A ( bU@R1L 澗cc 0 c)UXP\Z&@e†A(77Ν;8~\qllA<===== t-5ƾ_`/qPC5Ngâ. * */f[f2-K3S,5+4+U+,ӟZj+ ~# <<>w=:sFDZ#fR_b O`gzkg6d1%he-=Q7P~QR :ہ`y/+0,Ec銯r J$ CzuPB DI$~-cי3'O~q?ԯ_^n'tgX $H$ j-4W{ywgx}h᢯|]Yj_͛;wРΗC֕^h^z:w!s)+ "@or8Uʳ:WlG7oKrW^yN<%X7+ZQG߬<`]5x(Vw3@ v"/ɞg;ze4D>,yPގYdڵו)ef:ef |rRmFFyv2.,juqZ=tZ` ȣ痞>jUŋ_XI?4$1}t+V]`_9ɷ:wªM%ɏ>ٶ;8 Ϋ Zʨ\IF5X>AgtFQӡ8BBμJ $<Z l [lt]TF{`pd;v@71Q,!$/~sݟjR7Z$ _L`uòwK99sέ j1ztƪU6mJz'|԰aLu"> w^\fbEի<\011jku+J5dmwkpr@b2>޽1?5-ݘ֒Gv=)4> xޜcd}b;Iiu[aX]ãVkXn}zA$ˊ$bA"&+\ -kȸNO7zFaƌ?m۶Y,rС &TVy/^kng]v/^zƽW`ww_);5,D h1r_4_"XN֜,)&I}uÒy4 YYƏK6y.ާfyVqR~BֺuWˏKf흫Kp8Z9ICzNx(vϜ;JpӥOsv{G {{._~tतgXnJR ޴^ۻt:'%5{ѻM%ݶz 4 0ug&oQccTK֎0 uqci\',tPNQ-F6R~X Ƿ|ݪ&"@ΰVCeM[0lRL& [ݾUT޾^{#׷ ,Wj*} p%jSf@z!)%ZՎC}[$ oI"SR_yTm㯜lW* 4HWy .m{x߾yaXԪv "[lہ` E"ZD8|c< &zuYہ`v©a@wŗ1 &<0 0 0 0 0 04VHwT!c ގh:rڸG`բƖZʶdv Ka5*x 0 ð#=DV:  ׉5Ŗk.˚ pav9R>d@}@-ϖA1zB0 alC'B#Z}y*~y)nCz{0>]ֳgT*4eJoGaVQcKxvU eRc|I%x9IytDkZm:Y $Aqy*X)M\M(0t&q # v T~{6X]߳֬YӪU0 EK/`06'b'9u\2TE:HxVh,Ŝ]}Kl>Pr/hiy򿽨=Sy-mbsC$5X5ލ 0ƖZq x~Ɵ҄[$1)%hXxf6?7d}UT'!T/%]8Y/i MtXYrTJIE]}0ȂBJ֤xRT9SG޾;Vvng 0` ðh|UBXȃd]ypHHD!Z$S(Xa8ƧͦzϩS䩎ϛ3ꬼBBDCs=sn ,`ߓJPiZƸ'y2ZEWH$/rh $JJO}m7K 񔻪aXCR;׊r{/ y);:xN$"6=lfst@ S:*>إ)pcS\b! =yp-:'BfA}$ֶ|]Rilt˨Y(]ޮk6ʡt>AicǎuaX 4Ԫ^$xQ uR\ ,26 !IrV03"syc}׆nɃטǝgiA+D%2(c1Z-}kJq/}ʯ Zxύ3cǎJ;^kaXE-jyfHՌU8gdS =ypHxcA@q['Ҁ'rQgFŴCb;B6\qa؝5Ԫ<ϳ X91 ˳ APp0hsy47M9#g IDAT0~REaYk3#G "IGxRz{;ZC'O'(Ȩ?#!XCH ,_̻?դn I-eaݏ[j`s<8T s HDP$A"IK J"PҀ`9y98v2[:7Yf؋oɃԯsqU@KYsyުMHdX *||}pd0 G-j_0YW%;$MeėBP ]"՝yxɟgzPlp jJaQIfRƧI(t_T#e&)Yy 0 k[j`sG*+tѿ~K9+ieh$C!jCQc45'Kt,U3qa E` @rmQS6`E,ò,HI$ L (=}@zvg_*>Qhx+e5=UV΍!+Ùbȍ|Fa8/\D UXHw mA:C--'v70 ZcK tC iG›hJKK&fxH$~J*G:65l5=vIm]׵*"n!+ʈe3Ib@lk |h6/G0=ȲeK?{ *=- D!pn @ƾvBA87nQ!6 " =po$BϧZlDsݏV!P+歹7 iV']|MĎB zy`5`/5{z#Jm^H%^fXVѣGj_~|OR 4*P!@X㏟zQxvuv \śp3) )Hڂ 6S E<ыƈ2J#Dtiѣ  nڕ`6[uW1\³*11~Ĉ~{wL=H3rdHՎ;Fntҥ[5x{ٱc?¤Iթw9?IGHlpcnŰ.z|8LI+ x1CUQLgΜ8p&d Im۶S_ڡc7xh vaJӤl~1cj󥽼`C˖`.,3~]sVМ:9uz?>qhNLJ֯wn>7<ô~*NVѣT`ƌ_yLn)Ӊ iLc1!hlҚ<,a}M,\`ܹ|V~ֱS5ؾ}hc~~OgZubWCYԩ%/Չ&5)iHc2]ݽWz5dZe۷O^PjcgByΝAfdd ;e23we3q#|f懷Ͳ TUiJnݻ/[~z}sys˱V[j5M"oGaX7wkС?kZEbc.#Ez|m[”\6sZr͉7*:e\_t$6kfZuuKq1ϲBs>a&<} 7˳c- ֭{(gg -ϟ_Yk@YV+gkN>8}ss2;M@yV]EXABB⑴# 5*~k>yY x)-@WϋٌW$U(۷k.6 kJjקlcj`2R߰%H <Ѥ<σ^6խBRo ŃCR?ULgOSU. hrV0Ɯnݺ}˖UoO?]`v©Uae׏-H#}l#^gż]/Ke~|?(uIpˎn2a(9͗s4UxXyv{P4^xk.e|R`X#Sc.9ԡzqL cd-Zfd-aN$<2EeMYCE9)iI]@z~СTԲycxb+M~G$ v+YfXIR))k^֯Em@ ^O];L(d]ypHHD)"2G'ˬFuΉ-Mi_<3uֿ1++oŬ?=ē:nݺ/fg߮f/<6]A}o>TbJgn1Z剓mTN "JJ߲c0 *-`}Jexx"8y_8I)S$o7e`Y1 #D٦gRlT_=?OA~E mGhhD?tȐ}GΒL'&<;vz;Yn)J6ydo' Lbm˷%[FwỌ*8M_)bć'(+0 ,jOg M)n8sʯR\ ,26 !IrV`9QHTGYv /* ޞsͷt^XTX'UI}-<۞gz˔&hni@)e?*=3N0 ks$6W(-ZRE@Fg& )v5c";yE $BȠ3 H94i]޽ZsjHsnDelvL#>B̴g\1(%g/DRX ^;.JL=O>S`U 98NPGFi5AHx k/cB9u,#@@xBKJ*,,l.n/|ђ%y`5=xcA@q['Ҁ'rQgFŴCb;B6暷nX23W(Yn]ƹs^ 0#u(0(ի!a5AAp8clZƬD /p,2 sAfTugE=ڵ[?.--}ŗ/^ܭ[<.Y:afXAB<2؉'{8ӌf/ oA){;~|?a 7%Gpp3ϚXsXyγ@ ."@MVc= V! 5Ǎk{UGgUؿQqÎv``>gi&}%rH` LJ6Zn@0 *"/7D Rf1#<HIHZJPDIVKŤL玽όwq^uWC ;uzzܸ[}DPDe֕"!&i )~L) })/%!%&Ab syl^X**--}zov=lںYibHJ@5!|CAPJKێPyN WҔlzF'z;ŋ@0 < ۷w߾g'LZG><ן̑}gWvs7'O:Wׯ[g+3p@ "I$H "(9*rfiٲ[o5G׮]{ep8\w߻<=iӦ=z~3ƍ:tdǎzaܸq-..~G=ZuRn^.is#[Y!eXIR"W!Dʙla?b:yl-|_}VZZJQTDDD.]ƌӡCub!=IrVzkgD)T(R0 j'~#^op=VRYfuC 믿*  Ia5RV>L&#W~;xr8zdoY;Sjqo5{hWVZQ4M4*u'AF$BڑڢRY9&%2R j4K*1!>ۧc^'J˿3Ib@lk |hf 9OnyUٴinϫ0  ܮʵky%: ܲK.^̹ncƌB1=(*'B JFR-F]~9@,"XV n5z;h6E2[>N~| !;Z !5mpab:yUƵkv a(lu64xd*'ǻ+8rԼeD"_HnrUX/TVf]>/-{w1!cL6nnbWNz6XV+vMJhϞݱ0RT(P+S_5s&лOoؿG+?Fczz|SN3 l畠NrU_`3DAa]A`A# EK,VW(Z2 eᓽg/M(0 *rfCΔQ+^q)99y_ZܷyOHL7˗^W.ÁAAϘ NnE}#l/BgHvٰaC0 [Fccc+ Թ߼?Pj+j\+ 0 (Zm۶_~̆6l0 U>sLf80 0BzA7k̙O<č;ubkaƌYYZAw  NI{[-XVW^ΝoyskaaֈP2 $''7=q8`7DFD5z\{ w&Rl׾O>i۶mNb0`yr[ F222_:}v۷㸚v2H$˽-?r9t +W_WUȽf^|$r^ŰEE ޻lgEb1A ֮)/:i3ncY% jcIJ8:-u잲cVVGNk| .[Z\Xy5hys9H0I;rsk-e]纲r%: wy_Q^컼L$IU loXBD$"dj_Fp_YwZ.4] a8#DC޹}7u鯽j2RSS?[4Zx7G;u괦M2 sｗ7gΛ~ em>E86;[&U*B]UDIsoׄ$Ҕ)Ν;vOo^ gV6a ;vH;vW_ .Wol  @@ Ç0><@۶g'0tvnOnu-Ʈ} IDATZ}6$'×_¬Y0iUQ{…u'/ХFGA$I4]RS[%$ĵjUm"Dan cͬ,p"H6Q}.#W\On߱#,,yE {y)7N n&AR9@&Ĥc .|pY1TQY/AQkJVsNQՁ֘ z8l>xގvceEh-e%2,cq"iM$*gt/WK*  h&cE>Mz3дRop̓> 58Y+9%UڴO}Ҷm[˞z-[l֬YUsO/6m3 6bb ) F|o9}|ࡇয়nVUP3yd`k {P9yVc )v5c3Vc3r6CyDP BH鱝kَ?ĉ=\- vg³CDqv\1s9D" v ĹK||D]BCXNq-`vaF.gnYׯT9%$Պx|\a؃ VY`eZ L3vg@7,ğ%۹~z< T"#‡ Dh7jtLxc\mYy$of-K(bJ,#Eb䪷nXBCòKΟ?Zq:ڶkCV߽"7|}:b1k'ݰy~`֚蔙 q$޵oTh8/p88ٴYXLڭ:°j8?̳&fVC98 4EZkH&M^e<ÙB9 B6l7~_jj(zAG9a/~sݟn_a2W"Vp|XˎގayzܸI&X"9Krr+WNyqc֠ѣAHM'O_ƚ. ŸB CNP^~sDؾ~ (^~^tRY0c̘Qnd L$YII4=n{7Wc 2I !"E2Dfcfzk͛O۶m॒&8ו +<UN"$U9"Cu?^n c”)p0u*Lk@o_۷۷ZV^"7{ƢǻW`8=Qi5tPS!HTG xpֵBEJͺR8D$-A9u iR,$%'JF΋/ 6<GU:qxv3i&F`vk)ӤYh:/@*l2Y1uc{ӧQ>rr`6oǁa 5'?#n3Ξn٣*;AK| "I$ BNR G9jq8-Uh'..n;2mګ G]~uԓ=?1)Rؿpe>3n hhʑXH,D#q QL9YRf#DyI*5M_}_} 0̫z)Ӻuu$f EfFFlE=Oh&i"$j)gmXeY$%H|"@ &8Pt.2&Ԙ1cZNrժիh4EEFFv]71׾f Jԥ7~ש煲z@PtGgtd6 R EG^0h j'{O0 _yaq2F"<AAMsNlv$ij29lV灤IL⧔||ngRyLu6_KbϞ={YgՄL}}gF!~R2Z)_+6YG_Fu=0 3P?wzx Biq`NfB JFR2V-F]~9@,"XV n5x;h67k7bo雗_<\ABv:BqPG^<Ua5o!(K;W[|r2"Ua{(eJAFmY sO4BLb^vX-^ہ;oFmB֢cAщx~aX#Q+n dӃ:+cbv4[tuXA-Ȏ(ZSE%|i#̓ÇZI>}f~CR0 ðu%CZ޼i׹S'BhoT eH[ hp2$Uȑ#g?~|jۻwMw8ގ 0Ip-Nwٳf~ٰ^x}0>/ߙ7oȐ2L& :lر0 ֲپ}au-\W}oyK߾^}u15y aX!VZ~s۷aҤ9' x,aXx; ðӼy:o߾|xZA)`UC)))%ފ0̝{RC97ڴiS7x䨧f_|ђ%7J]aWN5k&߿xbaXscjСIC MKKãV5WظqC^={/?ϛNPP0 ƨUJTCD"qR Ya9駟G|.s=c ._7lxcD"F5vm+Dm,SpO~VmҔjk5 jݶoJI4MYV۶*۵ڵk7/'bn^͛Ǐ__Ղ"C3zE ɏ6l w{fq]caVVc^ 0: KyofSKAPMph pg.*⋢Çeeb2{S4ij!ٳ䑑1#GN_nvXjbLWa3UD3UĘknynY vA*ן T]/xwm۶ or/<|8w 9sURaɛwbUӥKZj^[̅{ƏtΗS4NUkh[YUuk~Օ]e_}nyiKUw}Yx>yd ®ZeW4ZޜaX,Neh໪v{-pڭɓa2ZavARJz_ _fELQQ7{%c ^޶Bݱp<3FA(88uW=,//{c02 a͛geedgg֠)I@ \%˗+J0Jrw/Xt23G;Vͮ{5+S6X̬l D"^RRRV(r.jJMi}a AAq zkBH$+}Eq}~S,EThbîXbD jbAhy-jL(17vP"bEA ,R3+e^fΜNÙ3gZlkӻOPPP=)AAASP*=zĞ:e֭Y\7AAwVca#Id Pq\nv||J6Ya>J:팮#:r4n&dͤ1%q8j ٳ4%_ݳWsM8pGې1 nJWOOy;nܨQ7ˋDDD^U;7{ &7y7n<83|4Q :ϛ'nٿ3g͝[ӦwԖW+).;Kv-ZXX\|[xgL_{NNN~~qy{/?nA(,,lGF<Lq7pFGEYr\ DPy[mm_u'nݺu煅Esfzu'Nu6??Q{{{u-XMqq'|2  u:>]ny+ \ wp+ KjJ'Ol*kM]R&&J2sgw|oOmm(O4" hg\c (&' ))$$l% 7>$|BP (,,(--Uc wonݸl.WbȐA{;.sԊʯ0z2KQ%Clm+*DU_544:dRe> j{75<~sǙܣGdggKRhwt$I 44rEՏZuثgOŋc_P ?ɒ߯_@eK9WD5V6}z]p~ԩ췷o'7 ?x pqq։(/(Zh$v%&nݶ߾9/_+RiiQ{$^1y|]++Qɭ>{>O(jѢ13gWzR2bavvSd S\+YXn"7n:A6#{+hxy罼RR$bqŋ7oӗYP9܄;ql"ML4eJAfу wДU3jU#Y9]^ׯWHttp hsg^J̙mǍ41)y}b5۷ٳGM̬ONJ 9xUԮ]F]}}u,,Zs&fVϟر"+%x:El=];v$"1KN~_͛DmZ=D=k뮾{z6LФU|BQ=cK.D%i"C~oFnZjrӋrsew\\ܦMgS O0/5…f-[*pdvXiiqqҙqq)|QQQDNnwҥk.K 5fLQzb޻o-[i }츸w_9L =z<}ΪUs;l0l@<~[΍SU•+ $;T'U*?3GGw(>*K#0/|9'!7jH%#iֲ@?7޽˔ٵ⋛ e׵*/ #̀5zo _OuB*:CrX!QJvJTUcbqP_ȑI 0m]nNrr=WK*УV Dm455qC>ܰ; zmm40d*Z@u:96pl6x<̲ WGGG1| ċ/.?/^Pu"""N:uDoogŴiSSkhI&Jݿw ~jOY[[5wAr:99\s\AD~۰1Ta} F@Rpرߩd5ϟPqVĈ҈HOOO݁H;n@SbwDԣGu Vd$''OlJDD_ ^Z@(摗ׄgOZYY:tXȁ4W^g"K.~~fff@>9]+GGGG@#G̟??//oĈUwDU:::TXUsN+azӧO>-͆]Y|?jK@J;XIII;w"{͝7_:Ayޟ""#rss3?3gl"z{7n$&&2LKsݺ9} ~H)@R͒&ȐDSO_qر@isHBwf͞MDދKzիWGg%|޿!Lc~$TκkO:kv$?߿ Ӧ%BCCQQݻK,uh׮>O!1٫Y|fp0]kmm񬭭}QpHl?l٫@ ՝=gH47'/̙$\"3fdLs]vÇ& Νd{bP85<00pĈFFF\.300\ƎתUk,۴6mMT<@ IƮׯPUyK6&-H@yZU^^d]+hh4i Hz]dTTAA>k O ; :))*rܾ߯=_AZ@VwuӬta{ ʙK4Qob}v^^^ÇTnT/žxT2Ъ* g}iffVB B BKKEFFF›7&b\Mmm6m* 1t@=\nͩysuPW6B" Q, -Yl6ϯ j#??E:͚4r7G[ dEE['@~ZC aXb1V0444)iaceVWW7:*Ɩr8PsEm۶x,6аDǥ6/ꚷj.*..VyXӬY36bY,SZpfH!F S33qFFIqqQAA~CAFaaA)&F  [d N~~~bB8#?II`>__(437Wֵ5z'l6[%4⬬ׯ_iiiUPQ+***zY.]T[msV퐐d'vv |^6"gfdTN !?h2224䍢4!tusr*sDqCFB6Ƌ=ylj?LvvvtZHDkQ!l"GLZbXBMݎ-gve׼25'1ĐܰYDLDU7xY*\'D%D VQ;GDԿ jKM X@Ԋ!Q:s?DofMQx=} 5U:"+w)61LLL Ŕ!żeK9LfGGIG ꨔa߽O m*S_w^UJ|EZ%A5YDۈܙPϋGԟlDZD*| QQDDo|vTI=b޾JK,(/uĤ~?"G'ѕ~6ҫA9D?X>q;їDU^zN4P{Q'$)rh6u2Gj2TPm>QDԹƊ nLq㩿ZDDQNVmnjq9Uv2?--jϞRSy::&;;ϟke%-sgRHHAF@(l创 :rx+Cj &e 9*R.K_SǭW=ƙͬt0}_HwOF^>􄼢Iogގ{6)}h&Q;De)Dg6}NDD݈V -_*h(+% R"gDyE ZI4,(h1q "FFũRқPj&"1J}M4Ofe閥]!%GLt_&ȗ"Q#GD5?qql"ܹ3/%q̶i伾x1t͚#ɐaW";.ΪUi;wv_^D͛}3߼9=*JΎޥ$ߺn3dHUgQa:ySs2ft9ֹsw{zg;nTA3eٮ44^¾ħ,]AqaLmȩ졐W{~^'Pj3D,>ZI|M4hhMcs҉ zReD&. ZM"EDeX[;шZ5Z 5DDDd@4hXM*DM4W}Jt &-_ĆhYvWDf*wV=J%c F/mQ:fe)v/p\~~gEG+,,Tw8qiϞ D.9Yr(u"޿G]\#t"ݻ'ɐLD֮ճfsz]}}(9$D6!W˵0{_LiС.Bq#r?6k/ oy;U4ʰ%ͱ2lz,i/ɧˏS?H|p gnm\*e*WZ'r"t:9#hw"&#Ƞu2zQ^)őW%с(H2zы:$'SwIwS4%QD'IUK /ǝJwxWoMݖ-CU{@غMwHyDĔc>_DT+(HBzH]Am&L`xΜ" Qx70b ٣lr )-h!l!Mi-4UP!2uzxZWrK;kz}M#1$c nyy$}O$Y(h=CDmXefDoe oT5!&jG49'zlԪ'Q0M4B ZDeJ(@_kv\D eV]gQ/Y`ڵ DEEզ&y ۶mXlaIIzaqd&Ж_B0/5…f-[V,FDD0?--;.N:=;.N^ee5[ 2((Ym^4ptkW0aW:iqdwyBMl܏*.NVmJ^{-%*#eD4gDZU%w" D>D[ J=%VQzm7Xm=&C蔼Yb L"@4H (ȏx5˩iv$JI (zDǜerzX+߿ŋ###ѯj֬f,K:>T<kyDtk2LIIw☘LJ/^2us#;Ve2%%Y>>tOf TfȪZ:wgw=I}URZ(qN<8њbJJKb\/Mj+։XDGD4_aUKm#NfP_5JFkA@B4"щD2XqIIHȩ(8dR .GW˧MԵ Uqzf_ff C##SiD>YY<9W؁+;ϟ|s2$0o^ w@(tWmGG#W״gx͚Y Zm9V\Tx“U[۸u4Q_S+quGͩ=Q hDMI!DY6g6ѶJkh|J4)h'Q߲CVD+D埬s 5DQq#Pp9M"2 r'"-b~e΢&j Y[R>*<O_(,)))e$ r.ZebR&4 =fеdl>_Ҳ߯mnq옥028vLۼդnd"*)(h3t(WS j|~ZOK3>uq? ٟr))ID0KdkՀX!6>@ft>}ЯRLDSwZmxi,j?]nNrr=MG 0ի˚iHhoz 8MEG),,LORS-XijjuŧFOC=PS[ɣbi,awjTb|]=6vZZ:9ִ p8<dqutT.GNO4{aoikvڴ/ ZC ϧN޽={ڵk26vcƎUw\>hfgy<6?p@AȁQ+hY@v4)9I](Q+hz]f۶{+F X,>_/dX ۷oW^@]y dEE[@ ,Xbe] LqMp8+붺QQ6\.k@HII/wX\|]]V2E* sf/]*hL3Z@}KOO5{ vXFaaAiik֬YgO@5 ԥ|(ŋ/^X6֭ۺ @., M@t#uZVcPZLQwCǏܾ{~8><,bj $!yzYaaaw޿W%} ? !b﫹sy|w!ƾ >ݽxt O>Y, F'8qԔMMM[q wt$IUeek6{efgfY'd8Jh=iF.E.>Jp %oߺcXX@c~#F>}FKs󢢢[l7wCW-Zq y^/[KljPZ\" M5ksY Kc c<s.Ө#V׊mԃ]}kF5&- jk7>͙o[׶y)X%.K.gȑ z<.Ů|Y/_>ؼ9%4Fخԩ7, xIIQ;w&ddnniIk;{6ۛ|NV#F ]0[v!7mB܈`ibaVaVz9N;WSP_" _Y*(X,&VܒM ^mbbhS$BϿ//gϚ!ݧ7EDD{V_lr<~xm^^^(xiʔLɮу2\0!?#C'<}:ƍAǎI{Wl}"|۶Ң"9s7ʔR"lŪ'JK{h%C~z@LFM6m/?6 T:MD 0 cmmkSAӳgϟ5Cǎ&MbZTkWAfaCNrꔡlȝ;32\]yED 2ruȈܹSgP@I^(?mEDƙ[:u{vgr܈ΪUYLIIVll4ZZl.7;>J6-DP3Ehsx0 /KUfx98%q8%FllldS={cz}D `y_}. DmIVp"ԔOU>$*,*MLyeL>3ؑ.99ߞQbZcjf2gٟr))ID0KdsnXUb|~[;M-FүP^RHHRJ ,o|HNή*fs8YVٻoEDiu/ |:::AeVyZժ$̑H`I*A @eе&&--m`GGu VД0 wΟ?_݁ȇ4%~pȐ@>!2Z V*ʠkMC#QA-Wuq~ɶ|24Cdҳ Nۧ6+R|\颅 RIc'*Ym-\hnf8[ÇݺvֵKddjU' ^n=79Z@Hpj֫ѿ.>|llҒk/O3'"/N.*)-̻7yt֍nڴj ::T>>~H.JK׆o`iiefΝ;1cT%*7~ m۾$޼ID]׮շas66]׭͐LD֮ճfsz]}}(9$D8/-Auq9rq$"MJRq2l/B/}"}$*D-l nr+$dРAnݻר"/.\xDaA!Cd5Wwe ;;}$T{ ZJMMtnnn;/\~ *W!j{nе&iݫE)3XXHS$ݻ1Miq42s("2qƤ|dx+C_Vk+S֚7o^mFS(;vpNh*++Kn)iw-nie).{"(-=)9_LLLIG~_%ͣ)TvN;kkkKvtzeťKP! WKsUwQAH/Qe% Ҳt˺_qqt˗}r55߽ Tq^Vb{=VODTaڋ{K+*q:e Vּy7V١]];w9S?-v 544&yS9@@AAgݿkO{^eNUuw.?QnsÇY헠BxWLsŽ\Rb}ܼ% @ wرM{=u*ǧ˚5:[re nn/ZW";..G. jiK~iةRb;έ YDfnC 3Ճfsr+۲9NII)̲lllz)M nܹs'NKly/11q g_:G*@ ptrrtr5jt;{;ɯjOVH_KJJ.]wW&Æ rp QStqG[ dEE[Nfi^^;v( bg>%ʫܹ W޻wf0KqCP<:sܹ5mX[(Omy\7^]WK%[k62jpo߾ǏNT- +/wwgX >c%;wvrrJOO󋋏^2~XM QXX؞ݻVa7.^iKWy̦Z_rj>x`#96lS{ibb63/z){7L6Դe˖wvֽBp QSt33u}YYm:>.??D 52{>9³cǏ{?vy׍ـ#GzjjrCgg~ "VDZcFF,G1mssIΫVYk֌ 6mRuWs?mm]6Z< 6vzcSTkQosGgbƊ:ig̙=ˢu+An&=joopQGvv6۶n>cQXյCݰ_~9ݽ*"ڶm{۷.ή.y}ٳ}673߿_ff}9[B5rϝئ`s6K Pt U:>]ny+ \ wpoԔOU>$*,*MLyeL>3ؑ.99ߞQbhܯ"0gCI]]\~ڹn]ۿ٥BzÇ3fL}'rp $BKII"Y'sk=2#cׯ 4fI!!Ie+)H8oQWf̘7{ "V؊+և JD;~o5( p8b,^>}dSp&-C1Fm۶@)la,XvF>)׮]m^]TKD߿#1cfg}Dt~۶ ">m-[Y./q˖]tQw\qUX0,KHoܸQQTCV|fBE 8C/p8* Q٨ջܜ$[{> εb0=M$JMhcↅީKyuijia >f\'g:Vf9,+qutt@5*'xFhRt -^DhPV$:QÇE=|`> 竿>zcЄkMOii?[;5* tej]+hz]jddTrGkd vNq]RSZmnޢ{w# ۿt~ZZԞ=ׯ祦ttL:wv?_ʪ$=lgϸA;,^,~?g>{ֶ2>_OռsKZZJMJڹ3)$ #C pss7O̬B/Nx[7):Z.P +l r Lt F7H6% dϬjP t9tgS>}y ^()$DUW$^^y))bqŋ7oӷUŋ%/dfWCuBi H_O8~\yML0aB~FhH7;&]u([ÿyfv՘kh`X OǻP4%45޽'Ov\<ȝ;RRgqWDĘ.>>ޅo߮dFΜbdf ;sf½{|-:sBO{ED 2ru-̌ڵKL~FР iȝ;ekHy}ݛ- JǨ$)ߵ45=oݘHIG"|kh`[7Rb}ܼ%ƺVP95q"[_Zzڗ_Z[k9;:Ur4u"޿?z~R{䎞w׭#e)'K/0NRPJJJzp..#F8h ? RSR$a0<.wĉ~W}1`t 6uNVw\/]vo;v0ɉD$8>`@@b\622jhF~ʉx])4B삂B˔(ݝ2yѣ~~G&MTGݧI'-Z0220""bᢅS&OQw\q{iE xS666Vv䡮(#7/>|8q4w>fVcHr}||ݣ|׮#Q+a&Or`1cpܪ0j^{߻w??;.Bedw{Ohx-[%={ڲeŋ3? j^t}1OOOccc JRS%.Hk.%5E]Ts=\p2u1 bTZ0}lʣGL[+(n+3dU_lE5Zl%KWX٩S'" ];mtuPWuB}!QaD4y$M ۷?ڶrcƨ;.kw9I6rWѣG=ZQTV Dm455qC>Zܰ;u)b|~[;M-- YnjZ*l6xe9c@`^ʠk2\ ڵѣGPAHDʐ~$WYbCm=}?O!2G'e2:6}v0H)C[W$$(dOW/"X|Օ(-]QT!h%""@#Q+5GRZ@pmoo+݇^7_`{*֫EAs )))^ܓv>[)[D%Nz$<i%s޼Qa؍Y5~DӈnDDZj $е&`+WoݪuhXhOܹKyg^(%Iʸ_,YLG wP\Pe: 7FF3z!dQ ٰq |'#Ff$7SMM+h߿_J22΍[.Wsrp䫢Gǎe/T\_>?!uNt[Af95N!Kޏrl hժվ>wFINNڷ/qjgrFAΆn@x(R^*,]7bʕ+}|ƌ뫵f;!7=TgOJ|YBB2|nyu+"SSUWO6M*JӦ-^B56i}BMtU}򟷏gʔbq})S&סzڴy˿ 7{rN˖-}(nf*~:*wzSkMSg͚Iӧ!$6&fٲe eB.Y"pr".]z2/]"t[ޞwpx񉀀 7n|v\iVVD"O,ThC IDAT!R&SLRRlȗK+d?Zw121#'.ߪkJUf)oQ7 0[d2UPHŭj'v}?޶"m~Y,BBN)>twވA|ѯe7އд&k׮kiƍͭ:k!|BޞN1nVy"_/^(*J2S-r3Rٹmm35RVkL_ӢչBCÆ4:ڙ^6dq !:x\ E?w9j*ݴ BRHUA ^/yz\SSQNNӧt#8&&e/_=yb%z0hBHիm|}^^Ꜻ}u#=F98D5?B::Vڵ?~ܼm۶._^ӣU~<'չ{#"<~_q%$ )ItP?_kMRȠu8ݞ= ! =I.xcw{ \ -LKIiitφi``2>2o^s `>vvڨ߿J,|)J+/:1`Gy "%+! 7Bդ΅"66co%ߊ[>XzLBȽ :UTT{o8b?qnjwyL͔݄Shai'NtppuvKK+/.umʔ7n<ܧNCЉS˶|)S4=`]8/c5햜 9AD# e&u."P8k̃B(ZcF>-;ͼmMmRsj6zxj4|xj4EEEƊ)|>_XPxj֠iM+,,TL)((&hZ@x]Ŕ{988*iMOTTbJTTT_߾&˗nE-`l-ЈaÆmۺuQ .u\U1e2YIqѓ'Onڵ79vO͒m唔ۄCCÝ;w\b6BHnvء8T` ZTOO8%9ədi,[Q5Y neT*-//۴j#H, CV-Ѵ~pbqyeee`dz=A}x`^+^+^}CO8^TT< `+!dLJJß}B]btϞ:lh$<=G}<266　*++ r !$>Ƞ w77>t#**)8::a+@#.]׭˫K6m;6죏w:vQ]޹,ZػOǏ}7}u=@^L޼9Eы,[|lIݻebbEq;8v )|ի_\Fd2]ƍYaIarwv2mڴAl|XaÆP![·N2Ϗ2o޼;wF ыGegW=?"BLrIzz׉ !%Ǝ- [srД1LFd2__7LյuVEӉL/2Ӈd}}|M~JJ Z@JڰA2Q.u ' }?qc? ˅BsOOQQQ枞:( 4ALyǘ/.*//$dY JJJC ]V4zF%EBHʶm)۶)ܸcJ#q'NcGiV֫!ݖ,C;8t]D@@MSޱT xݺX[ڱsɻv411'dd;y$<5IY^^%%2А"{Oy^!ggG «)Cccb>  8]_0~_M]ϟA LE3F*vV(MSӲ/sÇDiģG^z%=#fsi7~„}(XU<O1@Kj1cF˒޸Wh((=S;U֎;.XS7o&0p@B- #Z?@SQQغz+ >}yzz1Z@%!:jiMIqqys !={u,@ c}ӫ2n1/_[9Rfs&&66y@+n߹=yҤ{{̡Gh7GLVR\ɓ䤛vm|S@Ksa֬Y"K.֭766uDc ZTOO8%9ədbP={\rС-fXF2T*J,t/MG0,^TVV&_i߮D"Y~w>nn س'B4!5kd0.s7n\*bxn?-cAX3gdAvvC&~aaidCFFʷ`zu`0a SjHK{'"Ӿ@'(RNg$&%UVV=Lf}N.W, H+*t[VT0̴ 7.Rk# t[),.)3;FM^PTmYM]A~T9y?5km!_ x, i>md@(Z[[W{CxҿΟ_I e``.///sD 4 EL}CC6mmWB4KkU^Vp0= 2QFz0?_,.G_;@Qr܆Xڒg"0ӫ׳@VXPz]۶ *d⢢O''tvio7pkUZR܎f)٫?xڥ[@  ;==={GV'jȳkJ&ܗ99/^ص Agڴik7.**u,4H$Db3HnצmCyUHQ6 \ ej:r!dyy;bh TQ%|VHQ+<#ƶUYl-GIIqVf{ |Ӵy왮W [ٽ}>,ɹ];VVffl6 ҾrC4+3/x</@d@(Z[[h+τybi@l֦ifggBn \z|z!ҟ?H$40XL]6R;8j1CzҬV&iiiI,-uD@kд݈0ݍ~}<^hR{wzܚn:uOޮ#+D*&WnjL.10 WC;MLlll9\!aaaѳ'8h_߾B7֬^~zN5^jM‚{wڶnhh;4{2I7]ӧ*M'k.\undxY%Q A:f6**vփ/DBa#hzzz<d7φ&бbr*zիݻgaa1I̿gΜacm3cLz׬y~nڴ?9\.Wk+WYieg͜%X~ w";/_ùs$Ig/ٳf;:VcMqnXBLLNNuss ox)H6o||kkO2fL0&Bxxxjj*!IxjՅuu}gΜ.((ŪOb_[ Q W!ޝ1sƉ'P83W A?NE=Jޝ4yRtUќбVϞi֘o\TT(%H$"Ȉgdmk\Ae=%6ݻwOŵk7lu/^ BO8~;;`ؠnW\=tpqIڵ?қ.]ң[ 1ǎEݽ}gΝ/ٽGlţǢRSܵ94tA'NG^\iNcqΞ50"b&={.888"">0&B>}䫋-9bʽ{m;jpՅ۷/VDuJګC /C#F~=x>J(u\ȠZhNyӪXlddS4$6-?R*U1P“yh>>;Ы*f>wŐ!׬׿k.]rss~~~SYY)OARRnӳ'hw(zAAA~~)j>nR3f EE;vRL_òֵiV___"xx[&&JJEE&_ϯ:SEk׮]bŀ[vts`0!qqq /277W̄b5BQqq1/PLj^uaW4 CBT@ظw?=z4`B`#O2Ϩp^4FE 4ctT*끌-$͸iηB_'PjW^fbbTE*zj]N:76[ka~~DĞsΞ=y򤉉|5+3aZ*"//DVkvvv6oŏҒv}~Ŋ Ҩ  F<^.E4 C AlQGDͣ%%͸iET~7Pi8TVVBe5ٺv!d)_w)H$\2/ϫс-;o.! [{jJPXRRo_:tȑ#GعcҤI9.8?R0?ݿuڕr3a*>t?v>L+UDQmT۠WQ{늢ÆWCoz:ڶmqㆴ?Tf@؜V{l6d ڽGM А8\nGww%:wcOGGM6=vۻOϞ=lFIDAT?h57_aաQLEEE.^OR$(n~lfc*,6Pױ4LthLql Vja߷oЏZNƤX,'vXXYlC=L&s_xҾu@pur{lD"u+//OL'U 7h(b9S[V,C%ߺ [t egg/rM$q 3C=|L;hD$D[ܮ<*C-r}}}/=qE]I(vP#1ajO\|ꥮh :mB%CIENDB`why3-0.87.3/doc/why_file.bnf0000644000175000017500000000005713035416743016307 0ustar guillaumeguillaume\begin{syntax} file ::= theory* \end{syntax} why3-0.87.3/doc/macros.tex0000644000175000017500000000422013035416743016014 0ustar guillaumeguillaume %\newcommand{\todo}[1]{{\Huge\bfseries TODO: #1}} \newcommand{\why}{\textsf{Why3}\xspace} \newcommand{\whyml}{\textsf{WhyML}\xspace} \newcommand{\eg}{\emph{e.g.}\xspace} \newcommand{\ie}{\emph{i.e.}\xspace} \newcommand{\emptyitem}{% %BEGIN LATEX ~ %END LATEX } % BNF grammar \newcommand{\keyword}[1]{\texttt{#1}} \newcommand{\indextt}[1]{\index{#1@\protect\keyword{#1}}} \newcommand{\indexttbs}[1]{\index{#1@\protect\keywordbs{#1}}} \newif\ifspace \newif\ifnewentry \newcommand{\addspace}{\ifspace \: \spacefalse \fi} \newcommand{\term}[2]{\addspace\mbox{\lstinline|#1|% \ifthenelse{\equal{#2}{}}{}{\indexttbase{#2}{#1}}}\spacetrue} \newcommand{\nonterm}[2]{% \ifthenelse{\equal{#2}{}}% {\addspace\mbox{\textsl{#1}\ifnewentry\index{#1@\textsl{#1}}\fi}\spacetrue}% {\addspace\mbox{\textsl{#1}\footnote{#2}\ifnewentry\index{grammar entries!\textsl{#1}}\fi}\spacetrue}} \newcommand{\repetstar}{$^*$\spacetrue} \newcommand{\repetplus}{$^+$\spacetrue} \newcommand{\repetone}{$^?$\spacetrue} \newcommand{\lparen}{\addspace(} \newcommand{\rparen}{)} \newcommand{\orelse}{\addspace$\mid$\spacetrue} \newcommand{\sep}{ \\[2mm] \spacefalse\newentrytrue} \newcommand{\newl}{ \\ & & \spacefalse} \newcommand{\alt}{ \\ & $\mid$ & \spacefalse} \newcommand{\is}{ & $::=$ & \spacefalse\newentryfalse} \newenvironment{syntax}{\begin{tabular}{@{}rrll@{}}\spacefalse\newentrytrue}{\end{tabular}} \newcommand{\synt}[1]{$\spacefalse#1$} \newcommand{\emptystring}{$\epsilon$} \newcommand{\below}{See\; below} %%% listings for Why3 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % cannot use \usepackage here because it breaks hevea (no colored keywords anymore :-() \input{../share/latex/why3lang.sty} % \RequirePackage{listings} % \RequirePackage{amssymb} \lstset{ basicstyle={\ttfamily}, framesep=2pt, frame=single, keywordstyle={\color{blue}}, stringstyle=\itshape, commentstyle=\itshape, columns=[l]fullflexible, showstringspaces=false, } \lstnewenvironment{whycode}{\lstset{language=why3}}{} \lstnewenvironment{ocamlcode}{\lstset{language={[Objective]Caml}}}{} %%% Local Variables: %%% mode: latex %%% TeX-master: "manual" %%% TeX-PDF-mode: t %%% End: why3-0.87.3/doc/hello_proof.png0000644000175000017500000005133113035416743017031 0ustar guillaumeguillaumePNG  IHDR(*qsBITO pHYs+ IDATxw|oi)@edTd)SQ! P([PȐ"Ȇ;i~$r\F+s璧`N~`8SFU8<.&/ _P(Nyb K}/cTJ5%6ˇ`{ٶ }:cy;N.|w1 ??Rwuye_?ǡCGs̙KWog E`mTʵ5hѦc<٭ GۓTkªTմU4wJԂ'<6ny޽t[oUk4Lh#=@5\[hv{_yaCm6Xxɇx{3Yz݉;^.Ifal4\9Pv&pCsƶxWm|5rV! DnkPԤ/ M^WkZɲϵ?;l vbA!u|Qyr|ϓFg aazqGZU?ppmior;]P\Ͽp_i mB7©>CgWm.R3af,/f7|?nkGmh_?4p ŷ;쬚O-w 1 /.6O-w.!#0*vfLI?0PjN7~O"z~o3qXu,Cv2' m}w"\ݯ64|V'ݲbJK'&:~;+7b;s}OP.ϓFVp2 b*Ƚ05&b'Ң7Oe/D$G)m'L(8-gJ1s9tgmynuz8SL a}= '$FP( nNlJPýQb|;VUB49DÑtr+;T{@ Y;8UIr]b$TEW<˟PըPN8%^^z$׌jT FQ3>ǀ>Y}9Nw MR#Pf^ꑏߛjVҨTAU$}cgo;N5+G)M$\J7w|mٝt uk9S(TloWuU" j_~ʠE%̿FQD81eJ\+tR3ӒZʝ׸_s]vSZoFj2 w[Y JSmvuqx;I׆E91.vK+5Y4V)*uW?_5 4F|"G.)9;K+Fnڮ|aLsFvWxĄu' ![FSkQ-Gh = "&PNwl lҮ딻mg㵉Zn%;qD~vuzgGVEﶽD96{5\ӱWte`"`CA#g.PPt[䄷Y~2NLh!…dއ9$>m_} fϊ;0̗m}װ~ڙ ŤS$Td//&;;4\1n)9x 2o;] ,_&EiRSȺv+==ownbCT/_=b*}9OOp_}m9).LJDZym_:N*8r_'j/σ'aLenUs#j唠)7yvL JSFq+~2 ep6ݧ,Zu7鶼] j Qceok)^[VD Yn..֒8*ƅ+MI fύjdzr|9=mv^` ʽ?vTS!q.NC}L`1aŤNMSrYvp==owQbdϕHOnn'yۓ]->gŕ[s29.cB(1Z m="? NLeh\\r!Bר[h}߰8_ x]PM}9m 1%WuqJLc;+;=zY3N~ei:G I=W"?]/\ yp v dPba]D0-e8z0 SZ,LMD+2y}ęP s"z_)yX0-"aydYKHƶdwB޸pf % ĄǎeqG tUvQӿxt f4qT+ͳzTQP%~[w`'54\1n)19x /vXGkdu?[0.6I)~YY-N9J@L칲)q*n_h+=!\}8{+FJrGD!' MLiD4aŕ j՜$rQQK W"O:DlŸpVO qy6B*a*ѣW}9ؗ" R q4`FͻΑR#ŔjYbJu r/-94˚ i4>ٰtޥN[i1n)19x B!aŤN/+i@.8MsM'29Cv w Uܦjq^Bhv*f8!RCDK9Y=E6DN001~fC>BT\~T)3Im)AwWUcOeAіMM}vGY/?6h_ၗ;uqJL~-VR!^h wz#^㒚&๦Ә9%Uܭ_$Pj(85/MsAQD_GN)!LmɉT+Zhm7B*QBFxY"K˹lO3(]vSZ}`Fu}ݿCbzsx˾XxVLsf]1yTZÝb5i f15CĽƫ'5^ ->QřJv'5xЍN)!󎄫?{ ̳^[8h"uywrNLȲ_ڲܟR(]j={ˈg}1 StW҅GEwRBe*U0C!l1%&F%HhgD)1yaXIx5pbc8΂fIY8k: 8HOi7՜w5 .Ku~*oɲn=;W;)izJjռsD?Os`o&0_3p\G )\9& ,.cŗ?f',`9QcM8aW f.3('`tu_cci.11"'kij_}Lb%p] gyn쓞t[xD&4F"?N>x .~YNAt6—a:Ȼ?TdR3{5ܬ+~^(UkopGbȲ-u͉m/0Mnd nqqj-4ĉh_8a:  " MMm8zÖ{o},Izg;j;wpʉ9_0LA:N]'}Lbp3 6ϲR51g FDJU)'=ixĔ/&"?=ap\_' 1g*Nn]ʹII -}.{&klvsOJ2jȩn:k`v7E5/ᒥusF"lA!_QIWwʒڐlÎf*JiD MtœHMFZgGXO,ifJ.f_OVV?Bܬۋ1e,aŬȵ_]Igo AT?9mL"'T$~xCC|L7?nRuX;/+T/O)|J{eݪXG\κ1Bt촒.BiQh뉛7Nv}ܮW̝>n۲njaA*BFDOؓ/nHsSV/y?&ukk e6F& ɚTgtaq,(Ni&?mx̉PFmpBЄFocUwNmZߣ T S UPXTL-\GvU/RRJ ܲsv%/׷^yU:QB k3fZO_$m, 1e,\aůHjgg ~kZBЄEow;'=醐6G;0? աF RVQ.}rwpK:G B̚ʩK4D?'H} (9<\|`>/bJ JR&NJ JuOGgT*?ږ[RZ͂~2]+6QqߜaUO 0&iWɘ~9#))+:5O1wFS/K&qud ӄ-}xݏ>"R(a`/Q?qa˄rQl?=x뙥AM }e:/Yr#PBa1qẅW{4+px].P&~// K0 // K0 // K0 // K0 // K0 // K0 KRGMa7Fĸ7@Z S:*6 /:A㟣%y'8j%~ZFzQXҨIDQT>u|%x1?1%Nqg(\O2ePmARY2wP{:B&ѝʾJ:-MT#7MYz@OB?&ZʦLڼOe$P0vwE&[0ߝNkƣ{s3{k.Y* iuz|ՙ1.q C'UZFd,oga̿2sǗ}11`v -ewHMF]`fXs KIY\;qZz[Kh˘lw_3]v7w+]׵Z;.)ëߖ k{ ^WνSubpUkM3 o~m~fD]cku 1j5f1jaI{KLLK Hj1ٝ~;[153 a>]8ݭ#5w͏3jLlfop)@Bܩ\# t,h%$ۖ0eܭv]j>9 IDATh e?:/vK"bXR^W6"+7\N4P(o7:LaN+bNK;v֑7wŅS/F lk ߱N72h&쭛jmw +N)1g]]vtR,!L)C^;[I){\b>eJ.EJAuT%n(Ŝ&mngwK9:Rfggq\5()mw t\CՆYHOUBN+_ܭ}TM`>*V|QAVñ`jQv6"t2 #e&m;fatk [#z-cv+/w3xEkM0v*ٿ\z.T.f͋׻uohW~HI-U+-H^커LQ^ح$)CC]=_Y_q LAurYY b&-Pвצ|zwIS[XHj1x=>P5=|.Xe}myT?Y;f%])4spMv+7IY ؋_)LȽێ><)y1C;Nu;{76b򊹅|6V9w|b$t;KZJj2L%,%igqj1F0!!bB0#=I$'(Zcu ݙL)ݭDyIbaߗ0 a>˘Kǘq}"f2࿾.{`d[揋9cك+bl[6_TiN]#&I-&\YmgKIMkɳY^-%,%ugZu uga]ύa]Ž"#svS^"=vbdܭDyrږ9|112x*;VNp yY- RhBWOYKA 3uC3B b*Tf:dfin[LhVS -#|D,Ťn| ;&" h2ҝTz!ۖ vL@xDKu mJK: pŽ xx xx ^^`%xx ^^`%xx ^^`%xx ^^`%xx ^^`%AI^O/_rJ_gr3"D\˗/u 3jG̒Gẏ hM>l'sS[ [#r=6<#U]v>K'-պ%sӏщ/yo݂K>Z8g3I]/=%n(r);3W}/ f~aN'9Ź'/$.hVy_*؍~ wh>{ʥ}j=>䨄 *>Ξr'ژGӋM:jVl-e'׫ZQ ;>PsۤVH8HPHmG%я SgTJs[5۰exEM곶y HP\*?].o^<װw.Gc-0㐮Ov~!f}/{jr81lo&aAj9#P)͢VvW}vsńk41z?l6ãw h+=<ՓoMc_#F ZsNuhf;[C[J ooD( ©-_?j@*Njg9ma8񿶽,j3\{J1?tTB`UFM]{fJh휣Oګ|( _hGkcI(wuTm4+ C>MU\Lj;mXA6:̍yި㠭Wr/mצVRM=7 9bw]f;lv(v]cPhzuiΆ!jկv mž∞z y̋nCbۻFכfS%y<۰Fo,sgp;%%WO6K5K>(Oh0w)_=!*nοSJJ.㴅ۢ糧>o;?QE*/v>{5~iݚ/#[&PQ!\e1}&ui? yTjݧΊa1gڹrpjgMDb{miEZ.hncfYk=jhGS;'z1'XR]d|75OEW7l639*SԪM;YsE0D U*U^}pquZgجvc۞yp`I5Α5=8o\57߶5WX؊r8xEh;sm?HQp؍Ù贅[hͿFdOJMʠHGy^C7S2W(CorSSc!яX9pI~0 AZeٕ 扷6 0LA sR"Qq bnWT KVI߁?H͹W BS;ÿ7Һw{n&Ge:x7 ܣ;l?0dxEX#J5\R,8 ;f#/1g* Gٝ*cc0E nJJ5_X/CGDObW6ssGMM洅[ZY{pd9'"[gه-o_JS,h=d2Դ$}~k!\e}&WccمŅv^#bĊYoGbF0.~XlkGr%)~v$5ZZyޛ[a}X2H&c3 )Rעr4W @S?J QV_M(>6q"U;_ 8S,Zpx]`{vUnNemp|'r. ̜a_&"o; 䙶g[DUh-'UI2adW9Ja1)jwdUvb6WQij.{Jnm~Y\ZZiaېT1gp|\ϯ[ẈYXp*2NFɐsd']z/pU/SqJ]\7_'1wۯٝuu뇵Ξiy":$SLEWod{I)7S,[PiU NMD.x͉Ki=Oo6Q1eԿI?}6\gTIyp’'"HyTR7 S !s˵ïdz mП=y֐/^X1$S2(Rqhu WiqdOṸp QGg=7v1ېC\ekn$O0u#(鼦w\=:}|;to&90pq*K'KϽ|#g1./[ԁ=coleLTm֫)c|/4c~!c甠P(?M'uf/+[U8ILz)0&vϧF}pbL[Cʽ.f;Zit㴅%OPu[ߌ& vLaF?wgliڛ_r5Ú9*^/KVt_ WiqۤCk65wM n hǞ NŽv1PPg+A!uD|]Dqg0IfJPLYgx7Q+gթuF1;3uǪ]kםͥDԾF{U;wp}ߚ `;»l}'ty}ɹwM;WO-|ߞ(--th2vLa$)(*K/*~{]>ͯxś¬k]V:v\.z;|nRr4nv>lTְҒAu^>=GI_?泌CrYWYqvєۦ?{veRWh`}V~ݺ }[fNAɘzjł׫Zq)GL6gc5{{<`4r޳G>8.&Z=Й<ĐϾ5k\|Dt]6$rb~QIѐr7>kӽkWR)?4n\*s[f6-ꅅ74e69gzׯV*?g ]7ثMVtHj^>ӛW ZvyM&^.ZGo9-5g6Ğky{ ӰFEJQz/;)tE";3 /ʾڟOIN bH2yM1 ^^hWmh&o]̮{b $G@Prb)qA.S:"c k/mif(Rڶ7=['kwķm" xw>#o)6׉-\9qHuHdA4O|͖N*-:XyN^h<&N.L޺ ic4҇]Ϸ, h?Y2[XWd+M_Mzd8_jC3y"@u]>n2:xtdoe h>M>! F@6ІS^"t+)IWMә|}hC?ax8j(Q1;fϞL[)))a!}b@F/ K0 O/5ڵh]d f̹%>UH1fHRK0bx7̌JǮ[.c[m~qg,aGzmEc) `VrEږ-i_}0wl MwpxQ/S ֽzp.*A^bGN\<*x[g2[(&RS%1ݵxQsSgya3QdO^Gg={J]~еxQ+Ӈ"&V^>GveO졿׵xQ#wG8}j))6ΤZػ^H4`mH^8^ji器W cʼn4eluԱNMM~뵬+ U]ӛY?(LZK- x yo'Nt6].<}=kw0onG[kRK;F'Λ?+87kyN568Hd_l 4'-?ǹ>͕,IUr6 ?v0G.(w/^YIЫ_U)\Z@[:O{yB1iuT1>`. V# // K0u:_Fӥ:6x+11[i4am!8%BGGy hM>l̤b_nC // K$ LD$B&@\%FԌHKNԎ d\hz2stȭx@Fb^D݉}DtD܋E LDDˈ#SJIKN,GYhT,u^Jy.K- @rrWY QDYk=G8Qeį{ &D J\I9MVNeov"v4u%^ji@7#^GlG],?,°F]fDw+6'^6S\Z,Ѝ%jീhK4.-V)ᑔbdn /Q:T9.-fJJ.K- @uMT{؛OԗD^݉ M7DKԍhQ=w+鼑Z[)HbҀԩcy*kY/5zM{/GN K4ʿZG-+ZQxRK ߂]uCDwdu&ZHsi.);vQD㥖 tcyxF4h"Q&. ZOt{히'P qn6W3iu5@13;- Ѝ%D-!Kt"Q >DbeQ'2-oJZ MBR>Ql8dIDATep<Z,Ѝ%vED?ttKp-BefH !2^`%xx:.YZ*A%͗t:]JJ(ЍbxSzz. /\%^%D5 &@ԗhY3tDÈ*i"(=kkr^ ! &zh*=Q?p(~DWT@&^] G':IT߽Y3t=:]&%G4D[?6=@t(h)t2D'!G_Z5&NtQW1}@t&$ZH6-JQ 5&xCD[6= 0g{ا#zM :5#"\M}[,ٚKʶoje8(MET"[jΉxG4h6QQD9Ulߪr%rNgxL&" wedo5 "Lt(h6UԍDjdI :c;d iǙCth/QѽKIKAiz}Gn+D3i2&4$wxT3UD TDxx=AQ s}JMd$'ї3hA=CtH#ٗ,Dl!Odٽ=It(CB #D4D5V XIt.QDO7Kּl"5Q[7!:Bth Ei$GN4C}Q{;K @^',-WD_ٛe]l Dg$ADDD߲xɢsl0bŬ)SW9 X[D D]|H|MDjD3Q~μfD^#w;@%4t:RlBDo8j׮wCxH9:╔n r3MQ)چ DRtu,E88(/4 m&{uJ(-GݫSnǻM:?s5=tcydNCgJTvh'2^aghKSW⥖Fe\%E=>㥖jJhJ,USLgfXG]e& RˑC7WxuṚ6S#)?xh&4PLHÿw7I?n rs9gFCTbt1^ji@.5ڭ90a@a'"R*酞is9c*7G^&<7˟ faBšG~|1o߸<BU ⥖ tcyk~,E8 IJ"ҨYs9 tc#^// K0u:]rr2\~N<`t:]JJ(Ѝ.K- @)*֩NdBЖK- :un̰9oF]VQdd&22+-Rƹdtp ۳_]Z,6'^6S\Z@5Z2}H*R-5:Y]{)eVQC˞C}kRK<a3%<\Z@u7^mݻDTi{05\Ϯ%Tc cL2{ŦjܻGRw+BU&*kRK"-HMmH)oxQGGm5%(ٕgg$$O<̞rxbrŒK- @i.);vQD㥖xD M>6#?LTZ\|7u[ `C\J /%2۽ǒkCitbrsϟTic-DErN㝖 &FEd( LZmI13;- >~5q}s%5KoREU\MB9fidИ-=XA {e_ z,P_OZ,JZ MBR>QeppjTyjޛOsPKv&CRBUo̺8˿/A8^x.Т!\fxlx ^^`%Bt:&?J# t:]JJ(ߞBA3ч/ʒ 6pyo[[«m9_7ĩ d?.Vk]2A}K7 N! Dx/"B@^! Dx/ Hp~IENDB`why3-0.87.3/doc/syntax.tex0000644000175000017500000004157513035416743016074 0ustar guillaumeguillaume\chapter{The \why Language} \label{chap:syntax} This chapter describes the input syntax, and informally gives its semantics, illustrated by examples. A \why text contains a list of \emph{theories}. A theory is a list of \emph{declarations}. Declarations introduce new types, functions and predicates, state axioms, lemmas and goals. These declarations can be directly written in the theory or taken from existing theories. The base logic of \why is first-order logic with polymorphic types. \section{Example 1: Lists} %BEGIN LATEX Figure~\ref{fig:tutorial1} contains an example of \why input text, containing three theories. %END LATEX %HEVEA The code below is an example of \why input text, containing three theories. %BEGIN LATEX \begin{figure} \centering %END LATEX \begin{whycode} theory List type list 'a = Nil | Cons 'a (list 'a) end theory Length use import List use import int.Int function length (l : list 'a) : int = match l with | Nil -> 0 | Cons _ r -> 1 + length r end lemma Length_nonnegative : forall l:list 'a. length l >= 0 end theory Sorted use import List use import int.Int inductive sorted (list int) = | Sorted_Nil : sorted Nil | Sorted_One : forall x:int. sorted (Cons x Nil) | Sorted_Two : forall x y : int, l : list int. x <= y -> sorted (Cons y l) -> sorted (Cons x (Cons y l)) end \end{whycode} %BEGIN LATEX \vspace*{-1em}%\hrulefill \caption{Example of \why text} \label{fig:tutorial1} \end{figure} %END LATEX The first theory, \texttt{List}, declares a new algebraic type for polymorphic lists, \texttt{list 'a}. As in ML, \texttt{'a} stands for a type variable. The type \texttt{list 'a} has two constructors, \texttt{Nil} and \texttt{Cons}. Both constructors can be used as usual function symbols, respectively of type \texttt{list 'a} and \texttt{'a $\times$ list 'a $\rightarrow$ list 'a}. We deliberately make this theory that short, for reasons which will be discussed later. The next theory, \texttt{Length}, introduces the notion of list length. The \texttt{use import List} command indicates that this new theory may refer to symbols from theory \texttt{List}. These symbols are accessible in a qualified form, such as \texttt{List.list} or \texttt{List.Cons}. The \texttt{import} qualifier additionally allows us to use them without qualification. Similarly, the next command \texttt{use import int.Int} adds to our context the theory \texttt{int.Int} from the standard library. The prefix \texttt{int} indicates the file in the standard library containing theory \texttt{Int}. Theories referred to without prefix either appear earlier in the current file, \eg\ \texttt{List}, or are predefined. The next declaration defines a recursive function, \texttt{length}, which computes the length of a list. The \texttt{function} and \texttt{predicate} keywords are used to introduce function and predicate symbols, respectively. \why checks every recursive, or mutually recursive, definition for termination. Basically, we require a lexicographic and structural descent for every recursive call for some reordering of arguments. Notice that matching must be exhaustive and that every \texttt{match} expression must be terminated by the \texttt{end} keyword. Despite using higher-order ``curried'' syntax, \why does not permit partial application: function and predicate arities must be respected. The last declaration in theory \texttt{Length} is a lemma stating that the length of a list is non-negative. The third theory, \texttt{Sorted}, demonstrates the definition of an inductive predicate. Every such definition is a list of clauses: universally closed implications where the consequent is an instance of the defined predicate. Moreover, the defined predicate may only occur in positive positions in the antecedent. For example, a clause: \begin{whycode} | Sorted_Bad : forall x y : int, l : list int. (sorted (Cons y l) -> y > x) -> sorted (Cons x (Cons y l)) \end{whycode} would not be allowed. This positivity condition assures the logical soundness of an inductive definition. Note that the type signature of \lstinline{sorted} predicate does not include the name of a parameter (see \texttt{l} in the definition of \texttt{length}): it is unused and therefore optional. \section{Example 1 (continued): Lists and Abstract Orderings} In the previous section we have seen how a theory can reuse the declarations of another theory, coming either from the same input text or from the library. Another way to referring to a theory is by ``cloning''. A \texttt{clone} declaration constructs a local copy of the cloned theory, possibly instantiating some of its abstract (\ie declared but not defined) symbols. %BEGIN LATEX Consider the continued example in Figure~\ref{fig:tutorial2}. %END LATEX %HEVEA Consider the continued example below. We write an abstract theory of partial orders, declaring an abstract type \texttt{t} and an abstract binary predicate \texttt{<=}. Notice that an infix operation must be enclosed in parentheses when used outside a term. We also specify three axioms of a partial order. %BEGIN LATEX \begin{figure} \centering %END LATEX \begin{whycode} theory Order type t predicate (<=) t t axiom Le_refl : forall x : t. x <= x axiom Le_asym : forall x y : t. x <= y -> y <= x -> x = y axiom Le_trans: forall x y z : t. x <= y -> y <= z -> x <= z end theory SortedGen use import List clone import Order as O inductive sorted (l : list t) = | Sorted_Nil : sorted Nil | Sorted_One : forall x:t. sorted (Cons x Nil) | Sorted_Two : forall x y : t, l : list t. x <= y -> sorted (Cons y l) -> sorted (Cons x (Cons y l)) end theory SortedIntList use import int.Int clone SortedGen with type O.t = int, predicate O.(<=) = (<=) end \end{whycode} %BEGIN LATEX \vspace*{-1em}%\hrulefill \caption{Example of \why text (continued)} \label{fig:tutorial2} \end{figure} %END LATEX There is little value in \texttt{use}'ing such a theory: this would constrain us to stay with the type \texttt{t}. However, we can construct an instance of theory \texttt{Order} for any suitable type and predicate. Moreover, we can build some further abstract theories using order, and then instantiate those theories. Consider theory \texttt{SortedGen}. In the beginning, we \texttt{use} the earlier theory \texttt{List}. Then we make a simple \texttt{clone} theory \texttt{Order}. This is pretty much equivalent to copy-pasting every declaration from \texttt{Order} to \texttt{SortedGen}; the only difference is that \why traces the history of cloning and transformations and drivers often make use of it (see Section~\ref{sec:drivers}). Notice an important difference between \texttt{use} and \texttt{clone}. If we \texttt{use} a theory, say \texttt{List}, twice (directly or indirectly: \eg by making \texttt{use} of both \texttt{Length} and \texttt{Sorted}), there is no duplication: there is still only one type of lists and a unique pair of constructors. On the contrary, when we \texttt{clone} a theory, we create a local copy of every cloned declaration, and the newly created symbols, despite having the same names, are different from their originals. Returning to the example, we finish theory \texttt{SortedGen} with a familiar definition of predicate \texttt{sorted}; this time we use the abstract order on the values of type \texttt{t}. Now, we can instantiate theory \texttt{SortedGen} to any ordered type, without having to retype the definition of \texttt{sorted}. For example, theory \texttt{SortedIntList} makes \texttt{clone} of \texttt{SortedGen} (\ie copies its declarations) substituting type \texttt{int} for type \texttt{O.t} of \texttt{SortedGen} and the default order on integers for predicate \texttt{O.(<=)}. \why will control that the result of cloning is well-typed. Several remarks ought to be made here. First of all, why should we clone theory \texttt{Order} in \texttt{SortedGen} if we make no instantiation? Couldn't we write \texttt{use import Order as O} instead? The answer is no, we could not. When cloning a theory, we only can instantiate the symbols declared locally in this theory, not the symbols imported with \texttt{use}. Therefore, we create a local copy of \texttt{Order} in \texttt{SortedGen} to be able to instantiate \texttt{t} and \texttt{(<=)} later. Secondly, when we instantiate an abstract symbol, its declaration is not copied from the theory being cloned. Thus, we will not create a second declaration of type \texttt{int} in \texttt{SortedIntList}. The mechanism of cloning bears some resemblance to modules and functors of ML-like languages. Unlike those languages, \why makes no distinction between modules and module signatures, modules and functors. Any \why theory can be \texttt{use}'d directly or instantiated in any of its abstract symbols. The command-line tool \texttt{why3} (described in Section~\ref{sec:batch}), allows us to see the effect of cloning. If the input file containing our example is called \texttt{lists.why}, we can launch the following command: \begin{verbatim} > why3 lists.why -T SortedIntList \end{verbatim} to see the resulting theory \texttt{SortedIntList}: \begin{whycode} theory SortedIntList (* use BuiltIn *) (* use Int *) (* use List *) axiom Le_refl : forall x:int. x <= x axiom Le_asym : forall x:int, y:int. x <= y -> y <= x -> x = y axiom Le_trans : forall x:int, y:int, z:int. x <= y -> y <= z -> x <= z (* clone Order with type t = int, predicate (<=) = (<=), prop Le_trans1 = Le_trans, prop Le_asym1 = Le_asym, prop Le_refl1 = Le_refl *) inductive sorted (list int) = | Sorted_Nil : sorted (Nil:list int) | Sorted_One : forall x:int. sorted (Cons x (Nil:list int)) | Sorted_Two : forall x:int, y:int, l:list int. x <= y -> sorted (Cons y l) -> sorted (Cons x (Cons y l)) (* clone SortedGen with type t1 = int, predicate sorted1 = sorted, predicate (<=) = (<=), prop Sorted_Two1 = Sorted_Two, prop Sorted_One1 = Sorted_One, prop Sorted_Nil1 = Sorted_Nil, prop Le_trans2 = Le_trans, prop Le_asym2 = Le_asym, prop Le_refl2 = Le_refl *) end \end{whycode} In conclusion, let us briefly explain the concept of namespaces in \why. Both \texttt{use} and \texttt{clone} instructions can be used in three forms (the examples below are given for \texttt{use}, the semantics for \texttt{clone} is the same): \begin{itemize} \item \texttt{use List as L} --- every symbol $s$ of theory \texttt{List} is accessible under the name \texttt{L.$s$}. The \texttt{as L} part is optional, if it is omitted, the name of the symbol is \texttt{List.$s$}. \item \texttt{use import List as L} --- every symbol $s$ from \texttt{List} is accessible under the name \texttt{L.$s$}. It is also accessible simply as \texttt{$s$}, but only up to the end of the current namespace, \eg the current theory. If the current theory, that is the one making \texttt{use}, is later used under the name \texttt{T}, the name of the symbol would be \texttt{T.L.$s$}. (This is why we could refer directly to the symbols of \texttt{Order} in theory \texttt{SortedGen}, but had to qualify them with \texttt{O.} in \texttt{SortedIntList}.) As in the previous case, \texttt{as L} part is optional. \item \texttt{use export List} --- every symbol $s$ from \texttt{List} is accessible simply as \texttt{$s$}. If the current theory is later used under the name \texttt{T}, the name of the symbol would be \texttt{T.$s$}. \end{itemize} \why allows to open new namespaces explicitly in the text. In particular, the instruction ``\texttt{clone import Order as O}'' can be equivalently written as: \begin{whycode} namespace import O clone export Order end \end{whycode} However, since \why favors short theories over long and complex ones, this feature is rarely used. \section{Example 2: Einstein's Problem} \index{Einstein's logic problem} We now consider another, slightly more complex example: how to use \why to solve a little puzzle known as ``Einstein's logic problem''.% %BEGIN LATEX \footnote{This \why example was contributed by St\'ephane Lescuyer.} %END LATEX %HEVEA {} (This \why example was contributed by St\'ephane Lescuyer.) The code given below is available in the source distribution in directory \verb|examples/logic/einstein.why|. The problem is stated as follows. Five persons, of five different nationalities, live in five houses in a row, all painted with different colors. These five persons own different pets, drink different beverages and smoke different brands of cigars. We are given the following information: \begin{itemize} \item The Englishman lives in a red house; \item The Swede has dogs; \item The Dane drinks tea; \item The green house is on the left of the white one; \item The green house's owner drinks coffee; \item The person who smokes Pall Mall has birds; \item The yellow house's owner smokes Dunhill; \item In the house in the center lives someone who drinks milk; \item The Norwegian lives in the first house; \item The man who smokes Blends lives next to the one who has cats; \item The man who owns a horse lives next to the one who smokes Dunhills; \item The man who smokes Blue Masters drinks beer; \item The German smokes Prince; \item The Norwegian lives next to the blue house; \item The man who smokes Blends has a neighbour who drinks water. \end{itemize} The question is: what is the nationality of the fish's owner? We start by introducing a general-purpose theory defining the notion of \emph{bijection}, as two abstract types together with two functions from one to the other and two axioms stating that these functions are inverse of each other. \begin{whycode} theory Bijection type t type u function of t : u function to_ u : t axiom To_of : forall x : t. to_ (of x) = x axiom Of_to : forall y : u. of (to_ y) = y end \end{whycode} We now start a new theory, \texttt{Einstein}, which will contain all the individuals of the problem. \begin{whycode} theory Einstein "Einstein's problem" \end{whycode} First we introduce enumeration types for houses, colors, persons, drinks, cigars and pets. \begin{whycode} type house = H1 | H2 | H3 | H4 | H5 type color = Blue | Green | Red | White | Yellow type person = Dane | Englishman | German | Norwegian | Swede type drink = Beer | Coffee | Milk | Tea | Water type cigar = Blend | BlueMaster | Dunhill | PallMall | Prince type pet = Birds | Cats | Dogs | Fish | Horse \end{whycode} We now express that each house is associated bijectively to a color, by cloning the \texttt{Bijection} theory appropriately. \begin{whycode} clone Bijection as Color with type t = house, type u = color \end{whycode} It introduces two functions, namely \texttt{Color.of} and \texttt{Color.to\_}, from houses to colors and colors to houses, respectively, and the two axioms relating them. Similarly, we express that each house is associated bijectively to a person \begin{whycode} clone Bijection as Owner with type t = house, type u = person \end{whycode} and that drinks, cigars and pets are all associated bijectively to persons: \begin{whycode} clone Bijection as Drink with type t = person, type u = drink clone Bijection as Cigar with type t = person, type u = cigar clone Bijection as Pet with type t = person, type u = pet \end{whycode} Next we need a way to state that a person lives next to another. We first define a predicate \texttt{leftof} over two houses. \begin{whycode} predicate leftof (h1 h2 : house) = match h1, h2 with | H1, H2 | H2, H3 | H3, H4 | H4, H5 -> true | _ -> false end \end{whycode} Note how we advantageously used pattern matching, with an or-pattern for the four positive cases and a universal pattern for the remaining 21 cases. It is then immediate to define a \texttt{neighbour} predicate over two houses, which completes theory \texttt{Einstein}. \begin{whycode} predicate rightof (h1 h2 : house) = leftof h2 h1 predicate neighbour (h1 h2 : house) = leftof h1 h2 \/ rightof h1 h2 end \end{whycode} The next theory contains the 15 hypotheses. It starts by importing theory \texttt{Einstein}. \begin{whycode} theory EinsteinHints "Hints" use import Einstein \end{whycode} Then each hypothesis is stated in terms of \texttt{to\_} and \texttt{of} functions. For instance, the hypothesis ``The Englishman lives in a red house'' is declared as the following axiom. \begin{whycode} axiom Hint1: Color.of (Owner.to_ Englishman) = Red \end{whycode} And so on for all other hypotheses, up to ``The man who smokes Blends has a neighbour who drinks water'', which completes this theory. \begin{whycode} ... axiom Hint15: neighbour (Owner.to_ (Cigar.to_ Blend)) (Owner.to_ (Drink.to_ Water)) end \end{whycode} Finally, we declare the goal in the fourth theory: \begin{whycode} theory Problem "Goal of Einstein's problem" use import Einstein use import EinsteinHints goal G: Pet.to_ Fish = German end \end{whycode} and we are ready to use \why to discharge this goal with any prover of our choice. %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: "manual" %%% End: why3-0.87.3/doc/replayer_macros.tex0000644000175000017500000000142413035416743017722 0ustar guillaumeguillaume\usepackage{xcolor} \usepackage{colortbl} \usepackage{rotating} \newcommand{\provername}[1]{\cellcolor{yellow!25} \begin{sideways}\textbf{#1}~~\end{sideways}} \newcommand{\explanation}[1]{\cellcolor{yellow!13}lemma \texttt{#1}} \newcommand{\transformation}[1]{\cellcolor{yellow!13}transformation \texttt{#1}} \newcommand{\subgoal}[2]{\cellcolor{yellow!13}subgoal #2} \newcommand{\valid}[1]{\cellcolor{green!13}#1} \newcommand{\unknown}[1]{\cellcolor{red!20}#1} \newcommand{\invalid}[1]{\cellcolor{red!50}#1} \newcommand{\timeout}[1]{\cellcolor{red!20}(#1)} \newcommand{\outofmemory}[1]{\cellcolor{red!20}(#1)} \newcommand{\noresult}{\multicolumn{1}{>{\columncolor[gray]{0.8}}c|}{~}} \newcommand{\failure}{\cellcolor{red!20}failure} \newcommand{\highfailure}{\cellcolor{red!50}FAILURE} why3-0.87.3/doc/gui1.png0000644000175000017500000012077213035416743015374 0ustar guillaumeguillaumePNG  IHDROXeK pHYs`%'/!tEXtDescriptionWindow Class: why3ideGtEXtTitlewhy GUI with database,e IDATxwxS_h{ i+"2 "!KT-CD!XddHG#m6!iF4i rYwN=WB_rD#ʻ[ @  ʖpaN4/JDR9űK}ƑHY>Gm6z~ڥT{zڲ窍*íyh #m1)2^k. RJpGƥ;Q8TLsɀa^R)JfI%PE?Hy΍m kMLF\~֨n{Zl yKE59""jѥRQnIKD^5io@XbkW$l(JӞqurqnr%\D5tR+OQ o4Қ\|*}ai m #6DeFrc+ͽbK""g\[RCP&>R}a/anO]X\b;9@y/(䬲$ُSp|UUhX7ݯyL7{'8:8n0ABBwޥdɒ5P.T*EPT* %%B0ĹFґ<>fY;z^X,=$OQ5h_#nb/=E=; n֤FNʚVRsS.,%$lOS4 Ҩ3 %oO],. Qb&s%99<<s(訙ЅgP,m|勺%O={ԉRiÐiڬ)aΝe&OʍyWaN;T|7|(_:ڙUel[\NKEAmfw"ftvŐ!!TPJ'ݻwϽ?9̣'aLTR$ޢ&o|Yܜy(%957. l7N)WgISfdRbNLwb{f=HBB&RB+ dOLL 7o[|RHHHD TJȲeF̌L$' 6fO Fg&O p7*$Ls^BΝx)Ls\~2;w[ft?V^}k#3#'OvV6Θq[ۤ8H){|$=MAjJ2(2N<Ɂ{IBmns<=8A%Ku*֯[ѣeJuu5.NptR;B[,'anߜ8yBGFRR׉u1rFsUo|Ǹߪ_VnZݻwZ/._ʿ.ҲeK&NҪuknݎ$aRSST|JSCݷ3toǓ|*^śp=XZ=#-;Mߎ;os/?5z4ZweFŇ&y.k׮cEX*i(StL&##CEMsC߂7Y嗃H%11' K/`ϨORٸa-5{7mԱ߸a#CBT*U?RJ!iҤ e͚5Rܺu#jٳg 6< DEEQ|ym1cyźi-o uu7mȬsX~NuJҌe2ͦ]oZChޜYkRosa3x`pss#$d(͚5VuK 0ʔ)ìs/fy.wH$Ծw_V[[3fX͛+x fgnM8q????2tҕM[j-XIBnPTԮS￟ʕ+ rxs l g涍Y!]jjFzi,T>,X`.497mlJ֬ e_,֜b{{cv\B}9z(;vt6)]r7-Z#LQIRv-BQyy \.G.P(Ζm&33KoBD&=SCBt>yva糫Hϻ-@^sP8III\v RI>}}KԣG$%%qQ^{5M"5RYfܺu_VԵazuFRӈnЙʢrR m3PT*z~"1!T*^B~>Qn$&&rzmv|DTjĴRe˖?c[DD{KTҷo?|=m[jT(_Z5k?*L:mZSj*V(W7DѣzڴiMjUTk|K^|D?zRIvv&S ԌRJZnŋlD4[9k07kG1oз0 a4c̘҅w=aĉdef1|tؿ΂yV };k~ eu-Jʖߦ Qhڬ$bNOPyh^{7ϝؾ{?Oמj-hzzmP(ee!H@7֊mk|fm헖˻+?+(L;^mRuߏ͛6ݻ7Z˯.Օ,Mz BCywp X">5u{MH$9FT9Z ܽ b۶m͛7BolXJŶ[sYG?On???n3䓻%$$뫷OVn'O۷o;=':1\QC=1ed"#onCҥuD (K||YԾ+V$&&vҥs'>٣KoӚ*+lU*Sv-#ȍo֞s ^c&3FZ+W|B?a؆tajJ k׮OI\.c[XiBC6mBժU{Kb888vvvӧMѣ/n޼g|LfVEM*io9\2:kgVVqAALtkV.*TDpttՕD S*$$$=5@7 f3۷ S}yfJ%֯cMa`S6tV4h'''{>nƷ~Nd^C͟Z??H ppp 33ۺ&Tº뉼s+VR۶,[ }S7o$ظ'FQPAFc?$-ɑ~z|z~HB`H=~[ڳiVEl.4;TRGQQd2S҇U+Vsعe˲}nEFO?Z[Kg{<,s`KɌ3Z5Mvvn䉣HTRT$x{ys!wsuqx{y 1n*N=Ud.⫔X^Z4}jy੟پOs&߿ Y̛7kqG5x{yQNmyjJdYLͯW1|J~Z59˗s]~թSgŒm[ԩ&"233{6קl2RQlYjTμys^ݺZ2GGG MKƏΝ;s۷ӏYYYH$OTlٲYcRԧM:^lݒ6صc^_ؾN:I(xޭtcJP)ԩ[yV9?vAFF^Ũ7rޚ&w~Pneׯk3?ǬA||cJ6n5K+&4q]L[ %IIBCܾutftTn(pv=ȲwҤ$]t53vQ4#r)w8a&ӤV)~KJBR耒JQ|y"DBLftsqq[TR__?M/ΛRC\&UOk-_yc_5_"?T*s֤|} t]*(J Ē%K?X3@Rѯ0 ~(ʧy/@{@j׮Mݺu7onݢGz䭱f͚|5y o+ 2Yde^*O?5fy܎$+;lnGF2w^M~n_񴏌D*eN,Z4(U*$$dު2ժUz`4T*8i/bㆍupN߿|4IIM%tM(׮]ˍZjD:#Q&$Jhh(5O<_6nHJj*)lܸK0aDXӧMbB)Y׮ׯ¶(:LF,Zu14c̞;IKK'--cǎo9Ty>S#m˩1l|7`o;`縑L/1a>LpKOŴ73>fJ&''sI҅ԜbmێTcɖɈɓ8:wbVl5&(l>הKI RW!QTSZ5:uL*.ԯ医k a[2N;˗I"#]*Mxyƭ$&&R|y͊_"6 Tmi|{VIYY~y?}aZ~Y>C'^yEn([,=zg*V.B#Yh!C`7GTү_?6m˗xs6Oƍ6l7n`*wy{h ףAz=4iRbŊz`[W_E[ޝeҫW/ϩZ2+U4hc[jl޼]vҢy3s0߹s撚iͿˏ?)Sŗ_Pj*W?'7 mpW;w>Klќ?-[\~ucŗ_~u{ڵjңgYd6-lf,'n6y|c#ǃQǐ|`OAiA߂ PYǒbUl[mb{ŒH\lN<(бܗwn_ps˻rB%+ҭsƟ˨$.ԨA`TQ;ry._MV-WJǏ?4nܘ*UPBn*{ͭ1v۬=K$Bk9G:_ yiFyOWPРA}N:s#:LTP*Q.$899mY]=uC;;yL'yZh榱uttISzM^L]s 2gm_0fW_nH$ fd"b rr΍Z5rtLIrPQn2Rs|2rsصǨ5>vUP_"|a[8BS>+SU<>k̡ݫo#TwIYcsI (F_ f7(99XSRxEff&nnnTTޔ-[%JΡʝnHϭIeH/H[|>sFK~k~f Hx{\NVVE#9br"1@=ij:MaKgQTLZ #/n QB{g%v+ rCT*t/"운 W|P׊aKoDpkjj.$wc HnUhY1J4sQ,B_L{aO]Xc+q.HW-nvlm[ u1 "6'f[(bHC'Nq%7q>c.{4πv!hg`tcV._tĹ~Pg=@ Zxǒu@ A!Ĺ@ @PL\ @ (&h9:@ (bι@ @P,\ @ (&hya4j{/_Q\|Ech߾={%Hѽ;{]vL[]y,j@ 'y/C8 b۶ {wQ[O!VfyTP@ Mk)lA9d6l؀B0B` 2(^?,@ 875=칳 8͛HضmWvmUJxxb8s,.b/+9rHc  zsgu|vMrr2J,YL<#ر;vG՗_g6|< O֭[?gn:#SNE<ND^da<|+@ (snht<"˗/gqP^=K~ ;:t̙3~v*qOpjۯ[lM61ymJPPf-[<@0ի4cv4)տg6gΜaECNԩMj7FW5#M4_IIMaE|̂/@PHh+z[~;w.;kպ5/_.H)8880x~[;zo1x 77z#HRnܸ\w=!&&TʩS'ѽ{b/ҩ8ܥ ^`6jǶ+X CNJƚcG}xե$%&RT)8r_~5(Q;kN}v^ $l6ƎǮ;y[7\]]mҖ?eLJԔ?>fΤ[WR24KQc/9F|}} KLLim@ ŹwOOOz͛yo(6oL=,PMAسg77og 1cزm+sfϱyTDҺBT*m6ժUc%dggs'2]dUdYo 9F)[ξJ*e@ FotE[1d`6mDff&7obM6dffpj׮ʕj*,ZO֭kviӦDDA&M-3 '8x+Vd߾}/B9F޾?m۶*K 8;v ~IFF:u1G,G*U_})4JI"зOV^^zo-]JnU0o\5u3<6b;mkNb?FPHP&CXs\"aaaFXXVb̘1X@ A;Ԯ]ŋ}v:uHXt o5ȦyBBB믿.hMMCguW󣻝nUӶm[Oe˖Ҿ};ڷoDzeK1ci3 o>hќIJ3g]dk_O |;w^VXIժ r@ KQ%gP Ԁrnspp,+hԨx@ g2+tu7fuQ%K.BX;sͦsg@ *q^Tqvy#@`O4\e]?@ Pi۶-˗UQj5… 8q,Y1TXQc^t׭ Q\9gȑ|jۼ~ K,ȑ߿ @͚5/پ}; 4`8::P(xs\owY9cD=x@e @PdI+)e˕#6_m0xChpƎ#̍# f"Ɉc 8G=#G J<⧟bfˀlܸG!HJJd 8ׯ0eTj׮͕W55kBr*aif3@ ^%JZeBƠ~!76+Ȣ HHHyܹΝhޢ ,Z@ϧbŊ,[9ω0lݢ|fS`?~ȑ#ٿ{O0m4pss~ݝ EÇ,\~'\so/@`l~ A~8;9!ˋ @Pd"۱ TZjox^?qBgYl WWWFͪիxlɎ9+Xa`f͚L6?LrVԘ3g5W7;@` J%n6A"JOof޽ݷ۷ob:@PTsh+W\tI#M@ժUu_'&&4k\絧'3\ &--MuϞ`B;@UUdgH$HT ^ $}j[ VeW3ʬSgzOAm_#q򾗷оw/_Qbhz_Iٽ{fݻw ɓ<~E׬"K)n}^Xddd}nz6mtwU <^z+ }VG{뽊ERy]}6,ֻ!%Kɓ'ܿ_3rp}yQߔƚҥK}Tr˗-#*!۷XcXmny//EtƯ7aeȑ)StΜ9ʕ+-Ƞdɒqbr=ٳU6QQQ,XÇ{Aݢ<+GԪUnJWѻE]@BcPu۔.]'O2bpΞ;KFF2 2XcSM%22\Ndd$Ӿ589;pU:u g_|εkW大sք2 2.\`%xxx鸻d.\`vNEСpt3g 0+쌏AAAlذÆۭ [a=3g͢~8;;Szu͝a#o{E;wbqԮ]K^x ~[.˒8N>ӧM7}""p5J,Ÿq[]`~Si?'NptKjj*| rO?LGMO>0)\ΒK۶D*V!! ~-2w_N2e3z }bٲeܸqu2z:u줱iԨ!gϞcΜ9۷T9(SŸF&M x1i,gj[hJr 'Mm,^ӓnǟ|^sLOI믗iUQ=ڔk m9hnԨ!gΜeY? >}߳>$ ŧ}69@ 1:_qFl߱>&M兣#J]vLtJ*yfzNNN믳yf*Udu&N/[laԬQgggQ: d ̘14oтAiz-hATCf̘aVNL5n.lڴg1s,֯[-OW1v*>#̙,ZH OfɌǎر >tЁÇ#$sr~$<<|;jr. >o׼ys"#ok^;w.;شjݚ˗/k^_xN:ܥ ^ԽǢs.eNZjߛ\5==/ߜ5Ԙ۶,͝K+A4k֔F߆x̩yAP Ѻѿ^ٽ@u!33SݺܻwOڜsG A1м_7775R)AAzv+㣿J))̋99ϟϬ3TL&Mҥ+;FzjzHyyW mw$O?Qz ݑ4k`ͩyٙ:hd2̞ŔSXlI_K]ԟO< S/49w@-q^8:˛=O&lJ(]WgT*[g9ƜժUc%dggs'2]dUdY@|.]tG8|(O οv`~CR5b T3MHvm󵵴iNN5...ԫ_X}989СC f7mYYY899l߹'tFg͞epOtptt4hgN_Yr7|5O&;E)d #Ĺ@1v8{ 2228ucFؼ;̛7pMxx8aP[shHv$c I % /K VBUM!Yʽ{F&q=8m[={IIIqn.hpws܀&4Ç ;;I'ϴ\2Ǐ1Adƌot2X-]u moabι#ڈ93FڵYx1?#SME.ӴiSaڶm[Oe˖9kשS3fo?Ϻ~LRSR([,/2sP!̓FԯW__OHё+ҪUk6lhqۦ=/wŅ]_!'=}2mׄi moabιSZK)I@`>,ҳg̝KOEMÇԭW.Px[K)XJQ ryMkb\ w)WSyQx+mĜs@ xpww/iE^@l9 эsIQ !Z;j{Ze-Lcl*X^ v@A@` y~/B v ++K8B /&B v@ @ !;p.A <u \ -3XG\ x1)R{v5l#1!RiVF(96;űDM@ Cknݼ7hѺ'qqDG?TZbz@ Y>i-n$1) #33ԔdJnnԩ[2~eػg7*@ AX5%3#[7o^}زe3{#)) 7WuKoӇ4j\΂ ҥ3͛7G[^.--ɓ" VZ2j(nݺgi׮޴Ç1hЛjՒVZ2hЛDݻ SxJ%{ӧ8{,yfm͛75zZ䥗2u fk9rZ$ )S&fQgƌlقǷ3!33`nir2};i֬)1mN=~jIO]vɷ.@ *q~5hAFF)),_ٳf?0gl/[Nff&~~ԨUh222lZ_ʦM9{3gblݲEn)hނÉ8Bˁ >} :t\|EL<#ر;vG՗_rYWNٹk:w܉\v }ȑqY-\_Vr1b8q:Hƍ2er}r]F7=zqiѢ%SMձ˯MIӦ:u[ Ixxxnz< $$u֙ےzBBBm9׮_MU|PN&+GxtiO%1$*BR^5 @ VwЬy 8z(vݝe ٽ=JRWVGٲeqvviӦL2 75i҄~兗ywXx]ڵիW1itwww dGX*FɢE E 5j4˗/gqBz/Y&Th"}] HFŋ{ӧƷo߾4k6 ?{Br2e*7̙3{}ʕ+#>>>tԙWےz^!22R/%IIIuMUPRw7\H擥ȤkqSR\%%1qz1˱orlA.xc8OII@Pggg$||JFRRJ WW7F}͛7'2ξ=zѓ'O/ҩSGtߋhܨUTaSiF||JұcsҹM֭|' Z ֧ͩS'֭WwMysJ͚5Q!>>`Zj̭ ;zuV:wLҾY'\% 6E.PCGjlJ6-PdtPNmdZb׏OG3J!VVv˖q;F)kU7zyy( 7ww|||P*dggT%J@TxB # =MoWKbbbRSS)LJ)3z'ӷ_?<< OC #%'bOƽG Ա?-QTHco1ѱgT^e@.3s4i܈߆+Wٝ8qWT-[4gڵfe߾VL*y+8`c%55>OթZ2ڵkzviii|~3:vW^tggriZn 4#`x6nXϢŋ{.2 LݻwYh!7m) ]$,,4 cU3,~yNFF3<6L6002eBR掏;??:ucFֲ/~ѩy֭\t)ZǎeKپcmsԡCfϞERRiiilܸ7n?4$]v1 DBׄ`>:uPF -ZHdd$=';`|dG'w=*!}*; ɤ$r$F7"xu "8;4 w)St6Mz:)))rW_o39N߾}hѢ9,2g\b EQ`@88QĜsE q1 'Gm$?Rpt%8늇wyj֬G&P|yiժeժ|ɧWWW6jd%cѢL5ݻwzSX`вeK퍷7!C2v8fϞc׺MwUزCۚtmذYvFз5lzz7n !!?vbC-U EiW9g<ݒ'yfgg 1cxxd|||^&*VBx{{A5jf?ͷ}GXXXQRdd2۰w>ʕ+g<'~Æԫ_(!nYNhݾ ۑp+є!Uurw R8}ŕ7? HTϗWRlYԩ]Qhؠ>J*t6i̭ۑXvinڜ8y??qqqoߎ7ne|eʗ/?::{Kjn!R)[s*U+W0fh""Хsg֮[GJHLL}s_;<>sR `B " 8 VV[j=V:*hU 8 ( HCyGH@vug=^Ͻo,V9|p_|xxžtwv(Mt?9We0]X.ͳy-JO~€)WNQ/^RonS^^Ά '3m3Ftw*pURO2`pc0X[,`&#\!q8hUUUu \7<[D8c)..>=t&PZ[Э[&/M7wOm#cfҤX~K0k,qoPe˘6m>>>7r _|N_{_rvW/9w\؁ш?!!!DDDAHH~~~>OΌ)SēOpE;v /ӦuvhbA\zx=<@gQ'%nK)ʭb,0krY,K.|#L/B"((~[]d $TPP@iZm,''ɾ&Ӎߟґ1ɡ-pr n]7%KrXφCZZ+,<7ި'|B6lXa~Ng㐖/wYFjnҥ0e޽[ /Щxtn1ܽ(IO.~>kt@q)'!$ 3v 43Pk KIa/Ya)mU[r%ƍX:2fѣGSQQɓO;f͜w}^~%wÝw&$4.^n=k<۶[o1},\}tFK{cn<`0pM7O`K Μu=^^xVCsHy'ٷoӦM/>WXAff&k֬+lOx"""""]ǕSPX΀(-) +ȡIOOnOwܳϱx񛞆&""""%yWVTp`>f TTT`t`ǎeۤXv-g1Ix 1{/IIƈ?>BYYY'_~oa o`uMc 6c󨬬lEO4i"C$1bE`ݺ/}_""""r(9OOOcС5I ˅[j#"Gf ***No[no7Ixu:;f3yլ[?CGoxG=j#_}_ի-[sDFFb2fܸʫߓ Ҡ{8V+ ̜9W__>kt}K  !wo쬬ffgoHp8n׷پ֬YMB@=C\l,|ss,;>eeeHݱA[o9> _|TTT_sr׵;v,O?totRXPo#|/""""r.j{T97 0qXlkfd˱cGoXv-.01 xbnS^ohZ>}h"; .ew??QFX}1G_̢Eg\tEuqJJJ8q&Md׮]On>> ~k:43gP\T3m9f<=xF6|9v\229z0E'6Qtm[?+Wvv(rټq# ١Hžtwv(MtDf﫬7M,[ V+? A[7]ljQqw߽_0h`[ne3gN%""""Xs߿#b9#LO>Azz:&s}2eMDDDDv'//0DDDDDNsǜH%"""""^BɹPr.""""%x %"""""^f*E7ݝy6Ms\DDDDjkXPr.""""%x %"""""^BɹPr.""""%cA̘1n_nn.&<ѣGlp+*.''3th2CpՓy SDDDDLjv̹4K.m\,~yg={d̛̙7VrW4c'++MaaW櫯ŀVq:ġCXt)wiiVWΫؾmoHLLl櫍xe+lݺn8 K OС|>$yPyif lڸzIwff&7mjrW`={6W!5u7nbܹMݴߖ-[xsbv[rJC _EDDD8e弹Y[ կIJJjU @\\ԩSظi\5y2+WUxo*\.&]FpP֯W_W_mrͭ۶:^QQxwuqqqt֍Ĥ$&_yzk@DDDD܀>eCHHH)^wM7{naa!111 n5s+W`Uq\ Nii|NsZ_xe_z:;w?g<<>9 Cݟ Cvc5jn׶^jwE~j5݊cͶw}rX-m߇'৬udjvHH9rrpȑϾtlقرbĈufgի]%%%j*9qܜ\v K.e/4=Ui'G>q8CRSwf۶ܫW IDATAvNNym}F=/""""5=[?<f9&$'7tO2KO 石p{|N~x O5iv9-c~խgufsͣv\uZ˓{̮KPp06C鲔vLjQBeeEE3L#((ݻvf١tIJ΁cG3ӧ/Avv8]tDTt4y9(9 1D***5nSUY)rJJ lx|=o-t졡-""""0T@aa}svJKK"9e&sǛy8[6n0?^1d  +l>U\EDDDTԼh0p-%|qf#GC8ssDث<,QDDDD<伝\.?8HuF$";1}a.a(/竵ۗ/gZ|"""" P3n'cIvV>RXXH@@ ={kN3q8n݆bt:f^x1WO\EÇswi&0H5U9o'ۍ餪Á?V}ڬlr[¡ld\n7PRTjkE_'3>ömxg2l>6n;4ODDDD<Bk4 'meG^88.bg7[ؽc'cƏ#4u;=zbᘌ&}8U+W#<°䡬] 6p˸sȑݻ{->a-'$oQ=Duu5rNa~Ϳa4{9ˊ2⋉#))>}4iu3gmϘ5,\ȓO=.""""^yjl46r=cbV`|L^v6^u%=z_||<|1ι̗_o[n!+3Aɓ?l޼&]DDDDUhWzv*,$oL^;a8}{-[Hуf3n L4[,d,c. @uu5S&>cF٠]s&#D""""g_]r窎~Jʥ`[K/-^aAno7|n/ v;۶mছnnv箝Z2Xr:w}ic+M7*sp9^\ďvKNqD&Nت눈șO+0&]W }|c 㘓U1GucǞt6bc g?v)ѐss`0Lkh0x<>fOq]X WFmz'ۍn'/7lzWZDDDDA95c΃O^nb۽b,2 '[秪H;)9?fa63 !y=шdbhHPr^dR)"""".9c`WiX) kJTT/ FQ]yOUO*.*b_^z傤$B)nJK8|0vһO,AlMDDDRrTW9p`#F]LPpvvX^d2׏ vE\f ͠OSVV쐺IUU%AADEGDDDDɹr)ϣWL V/UUUp8NٮLONx.."(/Pr."""ܹ{U%a-TUsvJKK"9e&sǙy8[6n0?^1d W|۫4H2dHie>5/7 VWKf&V+G ;;mۛTssDث:KsC)9o#ŏR]Q#NLl_~w~{|v=1}r%УW4qOK#?7BDDDDAEE;w֢伞TN'YYHaa!D;puncG_P[d$Jrs;~󴏎Hkjhyn\N'U8q8Kqa\GTt/8Y3qTTTBIQ.MkqTF#q,(aXП vIE ;YYqq۞vMKS\DDD(/`ǎ]TiXgF#cYXf Ub "qPZm||ؼn= JJ$($U_d%ȕW\?)o¬3IJLd xݶ?i k9VV—7ׯI t'= |ٷ{7ߧn'W4Cd4|FΝK/_Nhh({zY3?zkOK˯k7q\¡W5""dܸ=;񈏏׬r^ KLl_'%g{rx?rJJJ k'ק>лw ＃nݻcXHJJѹsy{ɒfkޚ3I&aZ??xMDDDDDڧ^rn}+Ȱ#×&?7 ڬc򲳹+6vM%?4^֜ݷr ڤ{6=i9ӦUXHbI ~v:)p>[ң=f.Lm!<">v[s~QQ&Mj`8UJkCd>A Mt? aS%b@_{HIw{$T10μO>&8(񈈈1v@gu5Y"02 =O$ ~o\;!f7LRTR>lռ ͆ѨDDDD%L&%""uvb`4 1a/h`4rNbb!Yf \JWѳ'8v8:;$9CC8W\DDY,BBCq:n <釘h̹C Pʹ+""":##;;syx %"""""^BcEDDs?})~)?wDOJEDDsSND&ZuE]{}b9;++6mjg#r^S\DD<vv"rRqZl.9w{0'Xp6mF_|1s={zܶb^~%ڰǏrŨ#6Zh{<\,~ygY]ݖ=lܸCq!,]3$yPyi6e\]gm\~l x9!d5{aXcظiGmw7~ ĉY O:k),, &&킂6'dcsٗΝ;Y`=>kOorF`eOшf jk[cs `4kA_[qٶOn뵥-X'!!!rbcc9r'mKJJbUdggs$9|,]ʂ_h695z%""ri'.a-O&}p88x sx[6v7|2JHJLb„ 7z/tuW̹uֳ}6LP̹ףB.""^x+QQQ,[iӦl&""Sl2Nֶf̘Itt B>}y= _DDDD뜶r~_QQQ/OBmzC aȐ!HWq\DDDDD:V]CEDDDZ=2CR_-e"""""gW\ZDDDDDs/\DDDDK(9JEDDDDs/q/O*++8~U5{ VPza0ZH"wX.HJ?ay-MYi fTz%(8١tYJ΁j;cĨ L&b]?ٌdDDDD|qh}%0(p:8N&?/%""""Tf⪜y #QUBmM>D\nȠ{d msʎgZb=IƮp { rƯ}&l>U\EDDDRrN?' 3^5wTq`ß/F]Ei|#T0fv|%"""%.g%6>eԴгr2P+B  +""""9%ʯYE殿~G/OqYR~PN1_|O(CjpnB|)NKO?_ s|"Y w;}RpUPc>?`/b`T |B#ɀ}dZwQr^OGW.;%ߢp?JK0`ӭUOGs=?3Fqw#&]\V6 /o~fϞd.>Gym&$4vΥy}XE.7~M/8Ĝ v⃯oG_oSe;?i+#6~_sG7f޽ 8{:""""r(9Rӊ45Ш>čw'*0g3^UEyJvo_Kyu)^_ l&O8L,Xmu3gu'4賥u\JqEя=tE"& 8Uc{5?*-orT1ߒrů0ưgϞƼi&&_s5<̳M*ͮHRr^O{T-i/de1՘s`"غ V.rI*ݻ IDAT&BÛ o҇*""""Iy}"9'?"X{P_V6p61/M bU<^Fө݊BBBͥ{ 5CsZq/{9/@1-}/їG +!3 -Iޅ`b;̶(b, m!1!kfei$ `ѢEĉ8qb3Ky=+ۅ8-sk՗>IW8t`0isI].0>G($^Nh l>wq CDDDKSrXVJJK1LTWW{Gaڽԭ/6!,z ͆ѨwEDDD<䜚d9Lttɹd[YQPOhH(&C鲔Qbؙ łg唗yZ;nzHsj}t$<<ժ1ԧv搓M>jXH;(9fyPp0qa_^v9?N= Bj."""NJOlf|}}qruvH^h4b2X,k."""c2dHa/\DDDDK(9JEDDDDs/Zꩬc`WiSFHh(QQ0\DDDT\TľII v)+-ڙJ>c:;4.K9P]m}u1A!TVVPTTay=Dl\?ؽkq`65WǎfЧO_)++p Ӊ$0(hrQr."""!%@A~.HB=-t졡-""""l-@U\.ggel>U\EDDDR圚 '""">x UiO7!>o׵7~FOy(m6?QVV-҉HWa-n1f}Y|vkv""""" '-̚9D&Mwmp|`Beee`249ٳgS^+//y?N!b{Jn~}yii7H)9|iiïkfq}/2*A_<ÒvZ6l.~#GZu?)IIlٲ+WRZR3<n7?-7q?s7`6 DDDDcJqci|~iYׯ;EpϜ9L4 Jx~a JLL亙3? fr`/>}:q\Vn/燃@s Yz 3ٮWj."""~z!vV d_p 7ݷ4VJJ 4wM|d??^UUł ʪb4b6s7o0o޼]귈H'Sr^O{S{ԭ7ܹ|)1iҤ&  oOXxoNã}v2C0!!,Aivk?8znxN+H+92y+ Q I *Ծ/@{\ګT\\t_xAEz?+%\.~̬mswkذa4iUSS h3ap^O9?V-ȐS_narb ĜJJJ \TXzg?Zbj=&..Nٷު.ƎUR-ά9@`yb[áC䊈ԇ+?iZ' rʳίXB^YK.={F… z5ףVap~ 'h 0~^{U}Cy<y<mذQOͶoŪPEEXs{|I%%%E wϞڥSN1s{.sT?%˥?P.]4c -YTYYY4hfϞQF5)fz2dVC͞ڷo_=LeVvvmۦg{޺Fs2/~pl̜4֜7m۶Eju׬3vg Y|״iUp84rˋp^G8^Zʴh"qjٲeX=3Վpa4]K233K^i2 I%9fmݺhoݺ5)Q]U-yGpQHR:>RXEj u)W,f%mAl,ݮȨPsũ(W^1v.rXsZѡc'ݳ[-[Rbb 9Piz*T"Ob}d:VQ ]dO{Zl)UH ^EEURRNf@5]/Tv[<'뭒o"#I<wj#`^3B^o@K;6)0.hּ2oNlyJGt%u*gt[Yl.̚2ءb$Q戼Oc@m8P*'ŶNR>II9,Uj%0Q PkgbsM?Y獝<5%jG9שƷZ=WWU&L5N`ꫮзT,%q֘҂###յkW9JJa5*;Iw\+TfdXeVM.ݡ$yjoV v^QQ_m /< {߽)v#i6 x)'gL OT㯖id/ӬQ ȰXeXz `]? UHK2ԠW;4@}8o 'O1٣Zlf徰\[U__]p, C6Kvg8ղ}/5۴ nefd(-zUQQ'|RU޽?I~_z'ԧwoا^x9WҨ#tݵkը#k$IwqTϵaÆF ùi61~Odg˲SK['%Eń56s|eSE!4rE'?9k.%&&9ޡo5fX}嗚9c̙k3h@Zf-[;v73Sh`ϴl2޽Wofm 7?>1ciݺuZn|hЦ/6*cGhҥֻt׷ojmz5pn6㭑uqt~:묖R$_M=ZP=2[I!CJ+eQ?yE֮]ɓƎ[{ohĉΖPjZq=o^X[ g9#"ԺMk=YwZek5-M[8P{mV rY -[H^ԡ}{-Z  n2spQn- Ect|>W^p(g:=۬rUTwPmw,6E?qB~_,V{o߱{YY6nܨL?$Tg5 #cq>\YybbUyYYƌc'WÇ+22R={2Mckkἡڲowiq2KJꆶrJWL4J3DZ},ex~JhV ?V-ȐS_narb Ĝs=KnJKtDvSd\M8Ao=W5;X/kih[R+/Peq *ˤJJ}I>rFt0 Ym.Yj$ݧ#߭W w9th\p2MS7Q>/|Ff>]6TA|A=mj4f옠S+[)\fbuGc-.'HRFzP-oFCŷ<*:J v#N6ah 1s&^}UPGG6l>2ZvUVk괩zޒ-Z{S||뗺VY F!*,-&F'бeKUn"|V8SBJޓJОu:Fj,\.-_t3ghɲҠA4{,5If뫧~Zo1[ ҠA̳ϨO>A 3wyۙro}m2WtD6 CZUSVùGiAUzUnbb#kѱ'up\w7.]6_kRuSiݻW|ٽ[NS%j+NA~~O0'~wgj CGܭ]P\I2-B*(VtjykNVTII+a!ED(s?f4pn@@2w\?hw.~_;헯J>rn^F}ev󨲴@Ev (s2=ٕنsár٬V|ۢTcevErk'*IGJ2UWUtbi;\fuoߡQ\,V۵StvWqqe=?;A mu7[6a+2**@ReE)[w9N)~lùiб٭Z)1/34zUx⸎cJg\.ԣنsáXuIMSڳk^//30N[ĩkj\̚C t:erTV@ %],Vv;kΣYsIZB\X 9&@ ap 9&@ ap 9&@ ap 9&@ ap 9&@ ap 9&@ ap 9&@ ap 9&@ ap 9&@ a"Iiu:[$92V# L8?}<=sβ T얠s9,ֈhi0P2uלhNS5>_ |l.erP˩0s48,+ uvC] 6IrX9Br۶:tP }ǎ.^.hvuùB&p:&9Y֭Sl\eY7 AidiJJJ̲*rf͹Mb9Д"##աcGJIDAT!&WT:́aTCZl6%%%III.1ǣm~I:Bhsrs\Ȑ,f- QVqY(""BJ|Jʐe9wxg <\.W풖̌ -R $٭VwKL RFzr<+DsO]kz8kϐMJ~á#%~QӢgɐ3O_m/_*HbU9(ȔXy?IENDB`why3-0.87.3/doc/manual.tex0000644000175000017500000002507313035416743016016 0ustar guillaumeguillaume\documentclass[a4paper,11pt,twoside,openright]{memoir} % rubber: module index %BEGIN LATEX \usepackage{comment} \newcommand{\ahref}[2]{{#2}} \excludecomment{htmlonly} \newenvironment{latexonly}{}{} %END LATEX %HEVEA\@addimagenopt{-pdf} %BEGIN LATEX % tells memoir style to number subsections \setsecnumdepth{subsection} %END LATEX \usepackage[T1]{fontenc} \usepackage{lmodern} %\usepackage{url} \usepackage[pdftex,colorlinks=true,urlcolor=blue,pdfstartview=FitH]{hyperref} %BEGIN LATEX \usepackage{upquote} %END LATEX %BEGIN LATEX \usepackage{graphicx} %END LATEX %HEVEA \newcommand{\includegraphics}[2][2]{\imgsrc{#2}} \usepackage{listings} \usepackage{xspace} %BEGIN LATEX \setulmarginsandblock{30mm}{30mm}{*} \setlrmarginsandblock{30mm}{30mm}{*} \setheadfoot{15pt}{38pt} \checkandfixthelayout % placement of figures \renewcommand{\textfraction}{0.01} \renewcommand{\topfraction}{0.99} \renewcommand{\bottomfraction}{0.99} %END LATEX \setcounter{topnumber}{4} \setcounter{bottomnumber}{4} \setcounter{totalnumber}{8} %HEVEA \newstyle{table.lstframe}{width:100\%;border-width:1px;} % \usepackage[toc,nonumberlist]{glossaries} % \makeglossaries % \usepackage{glossary} % \makeglossary % \glossary{name={entry name}, description={entry description}} % for ocamldoc generated pages %\usepackage{ocamldoc} %\let\tt\ttfamily %\let\bf\bfseries \usepackage{ifthen} \input{./macros.tex} \input{./replayer_macros.tex} \input{./version.tex} \makeindex %HEVEA\title{The Why3 platform} \begin{document} \sloppy %BEGIN LATEX \hbadness=5000 %END LATEX \thispagestyle{empty} \begin{center} %BEGIN LATEX \rule\textwidth{0.8mm} %END LATEX \vfill { %BEGIN LATEX \fontsize{40}{40pt}\selectfont %END LATEX %HEVEA \Huge \bfseries\sffamily The Why3 platform} \vfill %BEGIN LATEX \rule\textwidth{0.8mm} %END LATEX \vfill % \todo{NE PAS DISTRIBUER TANT QU'IL RESTE DES TODOS} %BEGIN LATEX \begin{LARGE} %END LATEX Version \whyversion{}, January 2016 %BEGIN LATEX \end{LARGE} %END LATEX \vfill %BEGIN LATEX \begin{Large} %END LATEX \begin{tabular}{c} Fran\c{c}ois Bobot$^{1,2}$ \\ Jean-Christophe Filli\^atre$^{1,2}$ \\ Claude March\'e$^{2,1}$ \\ Guillaume Melquiond$^{2,1}$\\ Andrei Paskevich$^{1,2}$ \end{tabular} %BEGIN LATEX \end{Large} %END LATEX \vfill \begin{flushleft} \begin{tabular}{l} $^1$ LRI, CNRS \& University Paris-Sud, Orsay, F-91405 \\ $^2$ Inria Saclay -- \^Ile-de-France, Palaiseau, F-91120 \end{tabular} %BEGIN LATEX \bigskip %END LATEX \textcopyright 2010--2016 University Paris-Sud, CNRS, Inria \urldef{\urlutcat}{\url}{http://frama-c.com/u3cat/} \urldef{\urlhilite}{\url}{http://www.open-do.org/projects/hi-lite/} \urldef{\urlbware}{\url}{http://bware.lri.fr/} \urldef{\urlproofinuse}{\url}{http://www.spark-2014.org/proofinuse} This work has been partly supported by the `\ahref{\urlutcat}{U3CAT}' national ANR project (ANR-08-SEGI-021-08\begin{latexonly}, \urlutcat\end{latexonly}) ; the `\ahref{\urlhilite}{Hi-Lite}' \begin{latexonly}(\urlhilite)\end{latexonly} FUI project of the System@tic competitivity cluster ; the `\ahref{\urlbware}{BWare}' ANR project (ANR-12-INSE-0010\begin{latexonly}, \urlbware\end{latexonly}) ; and the \ahref{\urlproofinuse}{Joint Laboratory ProofInUse} (ANR-13-LAB3-0007\begin{latexonly}, \urlproofinuse\end{latexonly}) \end{flushleft} \end{center} \chapter*{Foreword} %This is the manual for the Why platform version 3, or \why for %short. \why is a platform for deductive program verification. It provides a rich language for specification and programming, called \whyml, and relies on external theorem provers, both automated and interactive, to discharge verification conditions. \why comes with a standard library of logical theories (integer and real arithmetic, Boolean operations, sets and maps, etc.) and basic programming data structures (arrays, queues, hash tables, etc.). A user can write \whyml programs directly and get correct-by-construction OCaml programs through an automated extraction mechanism. \whyml is also used as an intermediate language for the verification of C, Java, or Ada programs. \why is a complete reimplementation %~\cite{boogie11why3} of the former Why platform~\cite{filliatre07cav}. %for program verification. Among the new features are: numerous extensions to the input language, a new architecture for calling external provers, and a well-designed API, allowing to use \why as a software library. An important emphasis is put on modularity and genericity, giving the end user a possibility to easily reuse \why formalizations or to add support for a new external prover if wanted. \subsection*{Availability} \why project page is \url{http://why3.lri.fr/}. The last distribution is available there, in source format, together with this documentation and several examples. \why is distributed as open source and freely available under the terms of the GNU LGPL 2.1. See the file \texttt{LICENSE}. See the file \texttt{INSTALL} for quick installation instructions, and Section~\ref{sec:install} of this document for more detailed instructions. \subsection*{Contact} There is a public mailing list for users' discussions: \url{http://lists.gforge.inria.fr/mailman/listinfo/why3-club}. Report any bug to the \why Bug Tracking System: \url{https://gforge.inria.fr/tracker/?atid=10293&group_id=2990&func=browse}. \subsection*{Acknowledgements} We gratefully thank the people who contributed to \why, directly or indirectly: Romain Bardou, Stefan Berghofer, Sylvie Boldo, Martin Clochard, Simon Cruanes, Leon Gondelman, Johannes Kanig, St\'ephane Lescuyer, David Mentr\'e, Sim\~ao Melo de Sousa, Benjamin Monate, Thi-Minh-Tuyen Nguyen, Asma Tafat, Piotr Trojanek. \cleardoublepage %BEGIN LATEX \tableofcontents %END LATEX %\input{intro.tex} \part{Tutorial} \input{starting.tex} \input{syntax.tex} % \input{ide.tex} \input{whyml.tex} \input{api.tex} \part{Reference Manual} \input{install.tex} \input{manpages.tex} \input{syntaxref.tex} \input{exec.tex} % maintaining library.tex up to date is hopeless % \input{library.tex} \input{itp.tex} % \chapter{Complete API documentation} *) % \label{chap:apidoc} *) % \input{./apidoc.tex} *) \input{technical.tex} \part{Appendix} \appendix \chapter{Release Notes} \section{Release Notes for version 0.80: syntax changes w.r.t. 0.73} The syntax of \whyml programs changed in release 0.80. The table in Figure~\ref{fig:syntax080} summarizes the changes. \begin{figure}[thbp] \centering \begin{tabular}{|p{0.45\textwidth}|p{0.45\textwidth}|} \hline \textbf{version 0.73} & \textbf{version 0.80} \\ \hline \ttfamily type t = \{| field~:~int |\} & \ttfamily type t = \{ field~:~int \} \\ \hline \ttfamily \{| field = 5 |\} & \ttfamily \{ field = 5 \} \\ \hline \ttfamily use import module M & \ttfamily use import M \\ \hline \ttfamily let rec f (x:int) (y:int)~:~t \newline \null~~~~variant \{ t \} with rel = \newline \null~~~~\{ P \} \newline \null~~~~e \newline \null~~~~\{ Q \} \newline \null~~~~| Exc1 -> \{ R1 \} \newline \null~~~~| Exc2 n -> \{ R2 \} & \ttfamily let rec f (x:int) (y:int)~:~t \newline \null~~~~variant \{ t with rel \} \newline \null~~~~requires \{ P \} \newline \null~~~~ensures \{ Q \} \newline \null~~~~raises \{ Exc1 -> R1 \newline \null~~~~~~~~~~~| Exc2 n -> R2 \} \newline \null~~~~= e \\ \hline \ttfamily val f (x:int) (y:int)~:\newline \null~~~~\{ P \} \newline \null~~~~t \newline \null~~~~writes a b \newline \null~~~~\{ Q \} \newline \null~~~~| Exc1 -> \{ R1 \} \newline \null~~~~| Exc2 n -> \{ R2 \} & \ttfamily val f (x:int) (y:int)~:~t \newline \null~~~~requires \{ P \} \newline \null~~~~writes \{ a, b \} \newline \null~~~~ensures \{ Q \} \newline \null~~~~raises \{ Exc1 -> R1 \newline \null~~~~~~~~~~~| Exc2 n -> R2 \} \\ \hline \ttfamily val f~:~x:int -> y:int ->\newline \null~~~~\{ P \} \newline \null~~~~t \newline \null~~~~writes a b \newline \null~~~~\{ Q \} \newline \null~~~~| Exc1 -> \{ R1 \} \newline \null~~~~| Exc2 n -> \{ R2 \} & \ttfamily val f (x y:int)~:~t \newline \null~~~~requires \{ P \} \newline \null~~~~writes \{ a, b \} \newline \null~~~~ensures \{ Q \} \newline \null~~~~raises \{ Exc1 -> R1 \newline \null~~~~~~~~~~~| Exc2 n -> R2 \} \\ \hline \ttfamily abstract e \{ Q \} & \ttfamily abstract e ensures \{ Q \} \\ \hline \end{tabular} \caption{Syntax changes from version 0.73 to version 0.80} \label{fig:syntax080} \end{figure} \section{Summary of Changes w.r.t. Why 2} The main new features with respect to Why 2.xx are the following. \begin{enumerate} \item Completely redesigned input syntax for logic declarations \begin{itemize} \item new syntax for terms and formulas \item enumerated and algebraic data types, pattern matching \item recursive definitions of logic functions and predicates, with termination checking \item inductive definitions of predicates \item declarations are structured in components called ``theories'', which can be reused and instantiated \end{itemize} \item More generic handling of goals and lemmas to prove \begin{itemize} \item concept of proof task \item generic concept of task transformation \item generic approach for communicating with external provers \end{itemize} \item Source code organized as a library with a documented API, to allow access to \why features programmatically. \item GUI with new features with respect to the former GWhy \begin{itemize} \item session save and restore \item prover calls in parallel \item splitting, and more generally applying task transformations, on demand \item ability to edit proofs for interactive provers (Coq only for the moment) on any subtask \end{itemize} \item Extensible architecture via plugins \begin{itemize} \item users can define new transformations \item users can add connections to additional provers \end{itemize} \end{enumerate} % \begin{itemize} % \item New syntax for terms and formulas % \item Algebraic data types, pattern matching % \item Recursive definitions % \item Inductive predicates % \item Declaration encapsulated in theories. Using and cloning theories. % \item Concept of proof task transformation % \item Generic communication with provers % \item OCaml library with documented API % \item New GUI with session save and restore % % \item New syntax for programs, new VC generator, intentionaly left *) % % undocumented, since the syntax is likely to evolve significantly in *) % % the future. Examples are available in \texttt{examples/programs}. *) % \end{itemize} \bibliographystyle{abbrv} \bibliography{manual} %\input{biblio-demons} % \cleardoublepage % \input{glossary.tex} \cleardoublepage \listoffigures \cleardoublepage \printindex \end{document} %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: t %%% End: why3-0.87.3/doc/theory.bnf0000644000175000017500000000315013035416743016010 0ustar guillaumeguillaume\begin{syntax} theory ::= "theory" uident label* decl* "end" \ decl ::= "type" type-decl ("with" type-decl)* ; | "constant" constant-decl ; | "function" function-decl ("with" logic-decl)* ; | "predicate" predicate-decl ("with" logic-decl)* ; | "inductive" inductive-decl ("with" inductive-decl)* ; | "coinductive" inductive-decl ("with" inductive-decl)* ; | "axiom" ident ":" formula ; | "lemma" ident ":" formula ; | "goal" ident ":" formula ; | "use" imp-exp tqualid ("as" uident)? ; | "clone" imp-exp tqualid ("as" uident)? subst? ; | "namespace" "import"? uident decl* "end" ; \ logic-decl ::= function-decl ; | predicate-decl \ constant-decl ::= lident label* ":" type ; | lident label* ":" type "=" term \ function-decl ::= lident label* type-param* ":" type ; | lident label* type-param* ":" type "=" term \ predicate-decl ::= lident label* type-param* ; | lident label* type-param* "=" formula \ inductive-decl ::= lident label* type-param* "=" ; "|"? ind-case ("|" ind-case)* ; \ ind-case ::= ident label* ":" formula ; \ imp-exp ::= ("import" | "export")? \ subst ::= "with" ("," subst-elt)+ \ subst-elt ::= "type" lqualid "=" lqualid ; | "function" lqualid "=" lqualid ; | "predicate" lqualid "=" lqualid ; | "namespace" (uqualid | ".") "=" (uqualid | ".") ; | "lemma" qualid ; | "goal" qualid ; \ tqualid ::= uident | ident ("." ident)* "." uident ; \ type-decl ::= lident label* ("'" lident label*)* type-defn; % \end{syntax} why3-0.87.3/doc/why.10000644000175000017500000000106513035416743014703 0ustar guillaumeguillaume.TH why 1 "February, 2010" .SH NAME why \- A language for program verification .SH SYNOPSIS .B why [ .B options ] .B files .SH DESCRIPTION .B why is a verification tool. It takes annotated programs as input and outputs verification conditions for several proof assistants (Coq, PVS, Isabelle/HOL, etc.) and decision procedures (Alt-Ergo, Simplify, Z3, etc.). .SH OPTIONS .TP .B \-h Help. Will give you the full list of command line options. .SH CONTACT .I Jean-Christophe Filliatre .SH SEE ALSO .I Why web site: http://why.lri.fr/ why3-0.87.3/doc/exec.tex0000644000175000017500000000765213035416743015470 0ustar guillaumeguillaume \chapter{Executing \whyml Programs} \label{chap:exec}\index{whyml@\whyml} This chapter shows how \whyml code can be executed, either by being interpreted or compiled to some existing programming language. \begin{latexonly} Let us consider the program in Figure~\ref{fig:MaxAndSum} on page~\pageref{fig:MaxAndSum} that computes the maximum and the sum of an array of integers. \end{latexonly} \begin{htmlonly} Let us consider the program of Section~\ref{sec:MaxAndSum} that computes the maximum and the sum of an array of integers. \end{htmlonly} Let us assume it is contained in a file \texttt{maxsum.mlw}. \section{Interpreting \whyml Code} \label{sec:execute} \index{execute@\texttt{execute}}\index{interpretation!of \whyml} \index{testing \whyml code} To test function \texttt{max\_sum}, we can introduce a \whyml test function in module \texttt{MaxAndSum} \begin{whycode} let test () = let n = 10 in let a = make n 0 in a[0] <- 9; a[1] <- 5; a[2] <- 0; a[3] <- 2; a[4] <- 7; a[5] <- 3; a[6] <- 2; a[7] <- 1; a[8] <- 10; a[9] <- 6; max_sum a n \end{whycode} and then we use the \texttt{execute} command to interpret this function, as follows: \begin{verbatim} > why3 execute maxsum.mlw MaxAndSum.test Execution of MaxAndSum.test (): type: (int, int) result: (45, 10) globals: \end{verbatim} We get the expected output, namely the pair \texttt{(45, 10)}. \section{Compiling \whyml to OCaml} \label{sec:extract} \index{OCaml}\index{extraction} \index{extract@\texttt{extract}} An alternative to interpretation is to compile \whyml to OCaml. We do so using the \texttt{extract} command, as follows: \begin{verbatim} > mkdir dir > why3 extract -D ocaml64 maxsum.mlw -o dir \end{verbatim} The \texttt{extract} command requires the name of a driver, which indicates how theories/modules from the \why standard library are translated to OCaml. Here we assume a 64-bit architecture and thus we pass \texttt{ocaml64}. On a 32-bit architecture, we would use \texttt{ocaml32} instead. Extraction also requires a target directory to be specified using option \verb+-o+. Here we pass a freshly created directory \texttt{dir}. Directory \texttt{dir} is now populated with a bunch of OCaml files, among which we find a file \texttt{maxsum\_\_MaxAndSum.ml} containing the OCaml code for functions \texttt{max\_sum} and \texttt{test}. To compile it, we create a file \texttt{main.ml} containing a call to \texttt{test}, that is, for example, \begin{whycode} let (s,m) = test () in Format.printf "sum=%s, max=%s@." (Why3__BigInt.to_string s) (Why3__BigInt.to_string m) \end{whycode} and we pass both files \texttt{maxsum\_\_MaxAndSum.ml} and \texttt{main.ml} to the OCaml compiler: \begin{verbatim} > cd dir > ocamlopt zarith.cmxa why3extract.cmxa maxsum__MaxAndSum.ml main.ml \end{verbatim} OCaml code extracted from \why must be linked with the library \texttt{why3extract.cmxa} that is shipped with \why. It is typically stored in subdirectory \texttt{why3} of the OCaml standard library. Depending on the way \why was installed, it depends either on library \texttt{nums.cmxa} or \texttt{zarith.cmxa} for big integers. Above we assumed the latter. It is likely that additional options \texttt{-I} must be passed to the OCaml compiler for libraries \texttt{zarith.cmxa} and \texttt{why3extract.cmxa} to be found. For instance, it could be \begin{verbatim} > ocamlopt -I `ocamlfind query zarith` zarith.cmxa \ -I `why3 --print-libdir`/why3 why3extract.cmxa \ ... \end{verbatim} To make the compilation process easier, one can write a \texttt{Makefile} which can include informations about Why3 configuration as follows. \begin{whycode} WHY3SHARE=$(shell why3 --print-datadir) include $(WHY3SHARE)/Makefile.config maxsum: ocamlopt $(INCLUDE) $(BIGINTLIB).cmxa why3extract.cmxa \ -o maxsum maxsum__MaxAndSum.ml main.ml \end{whycode} %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: "manual" %%% End: why3-0.87.3/doc/pvs.tex0000644000175000017500000000363013035416743015344 0ustar guillaumeguillaume\section{PVS} \label{sec:pvs} \index{PVS proof assistant} \subsection{Installation} You need version 6.0. \subsection{Usage} When a PVS file is regenerated, the old version is split into chunks, according to blank lines. Chunks corresponding to \why declarations are identified with a comment starting with \verb+% Why3+, \eg \begin{verbatim} % Why3 f f(x: int) : int \end{verbatim} Other chunks are considered to be user PVS declarations. Thus a comment such as \verb+% Why3 f+ must not be removed; otherwise, there will be two declarations for \texttt{f} in the next version of the file (one being regenerated and another one considered to be a user-edited chunk). \subsection{Realization} The user is allowed to perform the following actions on a PVS realization: \begin{itemize} \item give a definition to an uninterpreted symbol (type, function, or predicate symbol), by adding an equal sign (\texttt{=}) and a right-hand side to the definition. When the declaration is regenerated, the left-hand side is updated and the right-hand side is reprinted as is. In particular, the names of a function or predicate arguments should not be modified. In addition, the \texttt{MACRO} keyword may be inserted and it will be kept in further generations. \item turn an axiom into a lemma, that is to replace the PVS keyword \texttt{AXIOM} with either \texttt{LEMMA} or \texttt{THEOREM}. \item insert anything between generated declarations, such as a lemma, an extra definition for the purpose of a proof, an extra \texttt{IMPORTING} command, etc. Do not forget to surround these extra declarations with blank lines. \end{itemize} \why makes some effort to merge new declarations with old ones and with user chunks. If it happens that some chunks could not be merged, they are appended at the end of the file, in comments. %%% Local Variables: %%% mode: latex %%% TeX-PDF-mode: t %%% TeX-master: "manual" %%% End: why3-0.87.3/doc/gui4.png0000644000175000017500000016243713035416743015403 0ustar guillaumeguillaumePNG  IHDR pHYs`%'/ IDATxw|SUsor3&.PtRF*l2SEd?C_( E^즅yx~{9O9+.*B!Br_ϥ`0BwtHJՂT Z*KFcA~~Ey9I,6qL8d..><>jTIRp0և(Z#V*J$Ifdd!@.#23۵oV=pʋi*zzx4U4d2eyy#:TN0- OFutZ*f)"\V*, 0q/.<;33!܈qFaaU%%%6QJKM]h#G-=ھ}+WB>>>QQQ/bh `prr!k_ =zLJLLc#|5sύqtWkoVo||,'Oox3gr^eӦ jh0d2KyӦ .|嗝:u_߰k̭ SNÆ6tر9:ZsjKpL}B(''_<$D*2d}m-`pdB޳{׮>>>:|7:;:*ldNm͡C9:Z(jmvﶭ~ ## UgϞ4ibtt&M3>,A]r966S1ȗ_q߯VRg  U6 -?*5Nۘki<RSn|>Νm?o6RgΚADDDĒ%Kkڴiӛo};vlTm۶uѢ $ Ba\\܂ mAx'GmBBszzzr8TڿM6[x̙Z ??ر<sɒ'Nԃxlfh>]-[&Lݚ:ѣ^>1nVVt#F//>ǍzD_{p@T_=ʴ߸qc֪=,wY8;Tנ6oL&Ϸ( qyp@Q6޽{WYqcEϝ;-V)ӭ ~7o9~8Bs[宅6mrsc?H֪?}>Rz7ao6N:4ؾc{޽B5@N/X8);o6$Id^yd?/\T*u:޽{2ӟ x@3!ؾ}gϞ1 f9E N2Rw%Ɠ&Mܿ$ɒ7nͱ}bs6 +.*=rRphV'\=m SSSD"""^T>}zӦ322Bs̱Իvޝh<<<SSS~ e':Nj/QcʊO?… <oРA~QLLoKP4{PT۷nk׮q^~]pԩ+(**bYy<!k];)((pss{̞ӭ[D='1[lc[,h\ii]rDOPK`TT5jW_s1yy]t:3J4OOJ-Mز\(% -\.PXiucYw ͇@(Rh1'9UO|%mܓOf@UJHht74sUJ&R%ZUVթRFZZm47UJc_|o@ 7 JV,B0R%jAPfp,mPfQ+h件+as CxYsI;hRS2oqy!$HcEqNTu}īӘSm'J?3@"&Ѥ:P?J@eRdM.%DDh9*%[!wr|qii)Bh}Kq .ݣ"wi>lh;v~Ç =yDݴZyt o„񩩩:Evr ;rw7e=!ߏw~u{Z:)UUlֵm߯T*?n-t颫kHH_ڬٳܸܼek6_S%CƂ\S@ њ?4,/Vnܸ~~e>1bH$DFZx뾯1ݻ2uD"H$SM{rGϞ#FaLy_vb=ݳg/ڹߒ_v2uګicrN{5 [oc6y+X/0k֬XZ2==}k@B8e8eRҤC,Bj=G QZ.vL7788x={%p7_1}.A]]wkׯQVZµn!t@bIbx֒1cxxx<φZ5{ﾛ:mפ@aEEW.]  nP(׶;rFCJ4|;Dw6ʷc/[{H5}jfc@7nz{{;:8=-KP_bgS@PR\\l6!Υ`0j>CcӝWS)!DxE ԮK?Ú=Jm &BiFBȻ}W̸w/}B}z Ů\q AnxZ*a>A::;y>#@{Fڔ*=-*V.Y%jU=d28ff{X?Y%; UV[ci&&MQ[WOۯc [@sԒR Ԕ;"=Dmq׮] ,~~~:? v~vjX e-qB\mP%B%5JeQ.xa8a{t>$FH o𒒓f͚/ 5k,AUҥK-ꫯcc!Ν?`M~yΓ}/>|g}kӡڼZnښO,3w+6s ^YHgѥy*J/˨}Đh>z3.֮[`B!!7X]Ǎ?dذÇ++6ldh^tӧ[ M%hK]baPQwqXۧT*cbblKhjF&s-dzj&aJOe5[B}KeImJA zeq:A G~x""7r<8fPֈ!8_xA&֦DTV2T*%ε +OﰁmZdHSX \ZR"CZ H(@"h (-ѬKQ.qcN߾}N?^ƑݣNz ӧNu;lV巧zӸKLJቈ,- Pq*@:#2S~|;i#Y`)A\\B(11qӦM;v쨲񬙳~mrIڅ W7n;l6%,!(-+(i!Aj=*WBRwޓi }+W~EEEE͙3Ʊ_~պk~-PpP_ݧOznFh#"+.vQGwΦ:rFCJ4 ]}Gu:»Cgva @Sii]rPOϦRh@]+;*q amjE#OHpxt.;qzcXK8*!FL^t'pri-pyBGVJ@r@ UJՂT ZUo 2xjTe- 8ezK Ub+Te(XneIϲEv@7kũKʜyTFl֘MFBFz׹$8A+a G7/&QU\(g}x:yqqV*\ZHQ%Nޡ~z qeCkI Gk`.YdG$>ed_̩c37K|pn@TI[h6/>җF WSfb(N2U GWĹzuip֯?w\aaBϯWS&OcipܿwZ](kDžnNa#!Úb}ZS#gd]Uݪ; be* jJ ʨMz4 0!F{|__߆D Zŷp>0tA36rSz}%J(r$.N<' sr5i.{n&Iòf& )aY)"s04sbtZ3qFO.vkʵJ+4Ii9Ӣf8KܚC6I^1뽄~n"Y3r:;:juY%k>aM2a4:RFm60,C#fY!8pkt.J}lTQfiS͟3"dfL&L{^%{N5#ܽ7_gg3cfh#ݽ]wGG n*sFH20Z M q'y"O!8WqBQ{~bO|DBBƇr=<bA|5y|C;J;,)ֈ0ш#5-,gɐe2ùN0 !\ĮX8qbY# s~Ƶz5{Μ g?zA.Vfv7jIww{Qiצ}NIդl[o`cvutaYRjc;=k OEEpCp1ùmX2n#Mxґ#Glܰ!++d2l(4g)s$I+8zT[ Q#܌yvQ沭qgh[Bʨf ER`'89DXKzөg8qb׮aaÆ\.?&晿t3t\wSaDig0b(I^ YghGCC::du S%'zgܛro;ײBBajF0Cp"E&dԫ5ww5|v@VZy8y.G_՛^N" J.V>-).AxoV*! ,wHyV@,p+pE⊇4ۦXsf͑{f4 8p< Z֘*!$ ;+Bg8};E.,4eEJS 2o*KbƾC-|%z:8]Ȯ#|`h3UpNw=pv;a8:/؇eYʬשJX6 \~gPg[rt,SLBߩ}ذj1 #bG@SY܂yT ZvX?.U2 M @3@ UJ!IJd"s@ۺBBsƃ0X@Ke [˩{*Jq!℣PO*!EFEvtt8EJU8[z,t8f~"DgވJ`4'任{]޾U@KB2kԟ;CKgrs*m Z33ث ***yZ*H[myРA;v >/Ze[>m;?x`dd_=FwR=6Ci6ң3E!rڭU-;p [\Py5핏_W<g͜_0qĆw[W?_Ӗ-yyyyyyu}uww?p`-=,Ο?߫k`JR FlD5s0a[}I.F`rMe7Q @Ӎ?kxk׮^5<|„ CE߸N]@S%Ƙb'>u`bY2X_?ڵkBر{ߜKv^TT=:~/\0(K#U͛ݟS hñ}ݼަ=0$Hhf|]y(t 1f y܊ƍaݻϛ7O&ʤyEEFٽ^QOMI-DR`D/E'1%LrmǶeZ駟R{А%KSexE!!!L}%--ɡm;gYR2f̘ӧOWjܣGM&)9i+VhqWQ@tYu\o$Fd2I3M+}Ӌq9b:xƍɓ/{ɶq/?qm:UMrfh0Dp ;or&ɲL]{ڵoV|Il7n>} 7~G&&&>Ǎ~ #8qBNvvu=[agL߲eK6[6uT.vGDDo>**ꝹƑQ&OH$dɳfZ4j䨌 ۉcGʔ>' :d˖g=nܸgG޽{u;8AdiH O]jQuE>z%]9wPe|'9卼VRmL&STh\hM3YB!d"q#4]D~e(խޕ:m&kyhX-z:ujǍ{ɖ#F  ےYO+y~.\eHA[~l-ٽgwܐ!nn[՛dʖǏHKKw>ÕZR_W$L V5OP$ԘRHDž9 V´TX[־H2,KÜБX*́=\K%N^"bࠁ-ڰa͛7BBf.c>dl?ָ>WL豊rM;xk9rUV?Yv y61Wg~E̘L -"˙R.K&jF{/]nT*eOղqJ ޾8rքaO ri{GWو,oO{7Ï\nSVVjWu܉:~ℇ\dTُbbb*݁~w~r(E&ȅ3zy ĂSkwvYFSaaC7:tEm4U덷dr\bpg_Ozp]B]6hRGf#EY23Fղ>iťa:tua3vA䶭[_L)!ugϞUV==oYz܌Zҝ^FڵiߤSR5)[3~>'=|eP-CN7SWvT)AAiSz=# KZ{Q2eWS3\u|oĎCj͛3ɓzd2]OHxsΛ OMnݺ޽ZVw ,_luo=zL#0a‘#GJKKi.--ݲe+lܚx8ySID{3:VpT@g t "20GwPָ1L<֭STJjڵ7'Mdm`˷߸ƮmjVgpᾯO@L$qc˰\a/ҟd)2H?׈y\BP!gPHȒ%KBCCu|Ŋ^{msUn܈;**vӡC@];>}?egٓ de<uiĈ;p@x}g\xvl@ʝ| H;wv h'm0^~ۗn5ދ 1899۷cz;W$գq+~+.vQ5윒~8((LVmi#&EiեQ]#d,1G&wϯQVfsHHȥKH*cH!ҪŹrKK>쾳|ͅJNOKԔzxz6p%ŕJZ5BF1 >j{8>ޮG|eLci5}X!u28K,MycSFRwl>n8ȓKW|cǒf4 }g0ё*7npL*>+WeXw&/4z y+y<>&t,4O(::VM'EO:~⃋BL9קOXdTG*N& puusr74/f(vRyշxYKxtevY@cjB0H_]G̣j+j R%jAP*&j fvx[J,CrФ/#MzE8/sbLV*I9YwIUh)fd(d4a\wHy{LpWMgs.-'Pn=8W25Ҥ5C,6].{?_lbuJ,b߹B6g|RWĘT"P$1 xW*s8l(6/eTIuΤe֤MlN2U GWg4p-٣OL^sUK+g̘ԥ~>=4V*,]s+\cd D#a 'pebgH"ҫ~gY>|x 8QI,MMI=zsc(+*vٓ?q_~i .YSr_s6 &2424 `8'_ NS{lHUK>Zt#G-%...G9r?O/0 !a㏓&N|eFyxZaDS&MCgpRa,ER&M,M# 8r8XR ; cmXaΜ9< ˖Y/Yb[__ДZC4%2iPF m2fCYp.s0 S+uI\=ֹsg!'O hJU!JeUP2S5B8 ef)E,N`CbJ=!pz[+OSs[ݭTQfɓef3MhcS"ò KS E" "ah"f/py0?lBto}5xzWi> 5lJɂm12h!M ef4˲! \^)S͵-)UY~*,,,|yܸE׿z&T =5#;mJKKǏy钥Me+IsIP#I!'N>% Q1s8\ bZusn.b ʸu47VPP%KGqÆ,d6>ڲy_^`Aܐ!Д˶F!ΞniJ b(5`IQq8\@Ib9,KN~{fΜ5sdfI҆>U8ptt R%IJÒ{ҨȎH ebiB0;y7w۹Eܻ"WG6*1A FsrJ]]%$ e*Oا;*N$Jn34!tzW=J;!>V_tst * sxxJE^6%Z3x +վj4bϚ9388888x̙v?~ر:u6oo}O<ҸlK^ǫl|8ے!qCo}a׷բ:5vm QL SIf_nNlW{JsRo$Fᄌ5dg^?Ѹ1թScm:UMrfh0Dp ;or&ɲLi˖3g ^}M6=ŋ8͛N&Oر z/]hѢs߹sΝ;wz \zlKB" IDATCCk^jjj・vNF3b*KMfjkJ3dFt3ׅ6h`X^ƍNN_JhXcT@YZ f.$Yk(;b_=[H$hԚgBqqqͭwuGGG6[K]w损0A"H$ 'FEEYk7q' 6T$DÇG6lrhZ-JmKd2RqDDxےSOUٸB\reKkָɔe`,iBB]!}p:vÂLwRra;K|0LU;ԩ1*4*M&9BN'~^&yȈ_{K]mSfho-8O2i֭!CTjcFۖz^:th%:B1}Ɗ+yO}֩qS2蔌IGj Q&DSέg棯k 281_(q nE-LM9e$<Qeόe,սT[߬A.^;vdIh45>pss-=Uk42mL&ӨT*eONX7ر#222""bm+VmSTT4yߍխq|4*Mb450 Q&g!C_םZ; $2>oX=xuߺӫS,h0[1+jM4Nq 7~pB >wsg^^^ǎIODD={jܽʯKYcw==uH ZR)qv󠠠$ے.oyf߾}<gshkmqq+S_YlYmR:5nz>*,!hj2ʮ-I:yE,ui&_kD}:ñr8mKEl#Gk֒Gv:} %OUG\\ZC;~9sXPLye~ܷoXu@_K2&dY1'bȫ=vuH*Y\Hk9ĽCXE^+).vtHmtV)AAiSz=# KZ{Q2eWS3\u|oĎᕷU#aaa$P;;v̶]vΞk[#,\v~Mj}%lE5s+?aQt9sjoXnRRTk׮8i$kJ gNJN"I2';<={L; :Ǡ@'S>μ&|кwՍ:ɩoj9M z}]0+WB*Z%۸0'yA.2EЫFF[pu€j9aT祦 :[XBiԝnܼqcŧO[L=vcf5i٧ՠ{ceVL@pqqhaEVsbS%&ѧw+7!o]v$)3)e3&Kl~@S=~Zq]usFֲe<|HCCBϟ;rU8qܢf=}FY5jڪi~ ȫ[TJ)x?&a EQz)'[QPKJtnn.bR)๸4jEQs$ިI  R# 8ye) o70 8!!CBJ?fPQ!$UWBƑE4p  jJ  e^J 1Fcc""`yn `yT@}C'wH /z)ܰ?7F.Q{f$ ֊S%6[{! 44%5?׿6lh%^GRB_r&%_G/i_Ȝ>&@5S@_|Z9UB9Z!4PBL|^ʏv6z:K>Y:q4p=t5˕|Ta(UBi(CJKy.[Z^F|3|dcQ͛.^4dL]ș3]moؐIdD:u1m=ڳG -Ge7yĕiRVkQQ*Wmj=^toQ緽\_Td ];>['<wv߽ɚ]Uxlzn 4 [11oKJ>`@]2σ?0@#%4((;ea,2 0i;[ 8RӯEy6-EsI E|uuA&;9jԣ]tyy$Tӧ=8%ZAwjԨC 2umO_w"$nݚtJ~u#ri/<>thի;$2`}={-YGR$7hǫY\J-}y\NR^͈ZoJ|2yrΘe}7fjT^Mv > 0L;mld3i>t`]c>y);Ґ2%sTݲP)!!ݽѥK=%׺yI~mvϨ޼v=@vTfL-KUOSowiA*޲mͯFC,:uäRKۥGDFN嗌cZ͛rw߂*VbV*ܣtfC%m54yU ܸ־aF|KUqg{wlPfoM{i`8I.6?ݥ(j4;\ٖ| 0/4JST[z5q5_߷y;~8yJnݬyŻgkӾ,ZP.=޻ߧV G"1dCOr-}E"cQ&36[i-- ~HfQXXBskU'&#tnB3U 'D\}5Gѱ?lޫu 3"WN?>= @Te3;\ٖb*o аP"b2B…7ϙY:p9śue/yGӧKݏ8`}k/?U֧(j- g{(\P^ڸL)U{%-iB1$ǥRo[KX `BN ` i}O DGGjCvϯN]LީS7y ,F:Ѫs~'iܸ14mt_CCBm{_ }m۵^;\ زyT*9ͩSԎ^¤9w0HGeiي-ufUqdQ]3K0tq_dbߚ\n_mO?~OSRR޾}ryWN5Owp-ș3 ]߹s*̘wΝcCaD3*8"=*G..~UyH%>2ZɣZ܁޾vnn ݸ:"8Ki* `CʓՑH Wڔ:^* = 80,IR9L&W(t1W||f\\jnoNī3 P(<<;omvJ.j|2'Yŋ8̙408n_y֬M=* (Cn-߯3KUNLHlEIH}_]SuW&?Ŝ}S_xQVol5\$:`8b 3::JS5F>yD5*; )]Jܹݵ`:ݹT +|յ+WBCBC+:>h w_BBD̜B!v>Wo5+sr;n{_^yEFz㍾W*M޳W䤾}_RM6W^gϱV6|x= 9q⤟?T0W~1;v>9sf7iӹsb̬K$IqqD"ڵy*|h4ƺu۶m`#kɸ}\s- ,qGI;W|1D,AjK߹cif 0e徍BC.^,>T&=Cg+;d)!!٩Rߟ"W@Z^N K(rW _~Grs`0q-_,7բo둮[Z%ζv~}j՞={?~\Q:1ukر{gkݺ @0~„>oW;Ґ!CSRRJ屣G'7ٳ+gfV+W;v8l萄U^xìykMzfE\]>qxvfA^8pF`٥?)&Yl Jd5֥777H*.FeBrcŊ}R$ӣʓL1wj7eNpS% o|$\d\5~}S"F&iEnWqὋ;gg}~ZIXl}jÆ/[s]0`_f8rsF|… d2'N[l%_~50:td"_tٗ_~Yn͓'O&%%ŤIgjq&IS֝{Ҥ|S~;cMM#:i46-E 堳ٍWuHCz~az٩cJ=pu+33[1-$dibğB][=Qu3ΑycwqtMݧO>}l6/[dY{^5B,y=.[b6moX?*Nܺ0aBK/K$Amo~wp 2d矕k%y`uyksXI0p0'a}?Н^~ecWMgq Baqq_ J%z~pN5 5e-(:y׫21p}Zζ:D۩4Vk0'{7hчdSF1fK> kC8TcX,rrU+e]!ɦH")Q%ɠO8y򤇇G5ۊuz[EI%?`xxu-,1n8fֈѠKxQOca.]:x޽cODF,r}Bc0[ iЪ4t]%b|tANH}y!3_Mһi۾5C܉kղUT˻w8xW{F+TSȫ[s~ڹsQ-|cǎuDr9-Xl!Q{\v, ^6j5ڂmU :/5U1(YF/ðkj!m//o ş<ے+ttrl0ѤPk3Ncv{gq8yUJ;v5kvXXXzZڒ%G[oyUBRv]"`xd9պRC|ǽWֻw߰aWDDP@7æ)4X>EnҽtЕޢU(RՊMjDII۶=I5#{cKz, 0d f oݯiMw0#HE&8y9ֿf!!viJJ8z *1~ڹ9s;.εk7H"):R6cDG4zpGqGo_f0[0ߵW9.۫W6lXPuȾyF{(IRVʼ Y A*q)7 1U6յkd6YYbH$s ./Vodى{tۘ_dKHKpBpfu8 (jS%c"Ԙ^zL Qhku b)~)ʓƕ*r( [.@AG MJKL5\oOcFoe04%%Iv.ƶw'ȫ~A)AQaJ\%t_ nU {I..|VLrfv.*AU(yIe$h7S;sͱc]*t  M[Xl6s¼|gJ9|Y,[sx 3NO=1L^ΏKǰBS-Unvo?k5Ϭ  ~=!Cu\ωqU((uJƽ<'p _Уilu9Jyj!rAybH uZ7RI\vb>]\\h*) xX,AÆ>Fbn_̆^ڭ6V( iϾs%u %$#3kҥGVT²OW^YlYbbܹyyu~Jݾ(lyRb0FQ_}HO?ĩTɤR00VPY_~~`%w/ӏ),,4M U֡R:JպUrA^kҋ4Qi3ηݟlV5&K3#αZSk!-EyEZ˵ǚ̶yS5ŃIr fLcK*v_ `j R+ pb\ʲeHt lXTt}Ni23֏9g@5k|zdp^];G*Mŝ-sO& YGǖj\xe49D&ٶ]]7nR|H]xG^PTE=Dۻ( <9ZЈxxq[Y& ϩkr7K{7K[^X{:wrv[Xj#Gj'N A ^|``S9С˖_BФIIZZ%U)ȑإKmsn,[f-V 1x<ʊ_Ƿ|ic1)zXRЗ8u NATy3((֭[]t쌉mwɓcǎ}YQ";%6ƽUv.1dН 5܏zp=U\(../ iʔcƌj)i4k׮]vٲN5sϟݾ}lr+DΘwΝcC "Q'|{8v;}[rrs%5K 2>V4u&Ν=ۻOoM4oظy "fǎ̬gϟ٨r8}[nm޴i.xpG %r N#, \~`+8KXt4I]4K+U\^Aj͇NٱxbV+ZZn}ddS5kd7nP$2n l"}|}ϺJ*X+[s0a'^3{ 9w;N]HVq+'n/S'⠥˖ϟ?/77JfOl6uJvvq֮]cuohhhΝV98iDzHEsNc5]>就v3E 2p&GnӬ$r 7g8 RzxzVY!K[fp$\IYoxT!Rx4Sx4{$yV!] AW>o-̩xUP~$}# $.*eKǓ W*uo*uԥ.+PAaºB]zwZQ ȫT@DBƖAją1 BAgVSױ R|(UrfϿV#BiP (,)  bR%Azhu-FQo+,&=E5qa8y%Pp3gΜ?~]ǂ JD3+%qF]٬18FzuլX:ZAW_)HR%)(U:|֕Oq\۲ǵ1H Vxġs;>=u4hIIۻkA*UbTd][vc7k0L!ע+ M%<'t#o?۵eP;A^ɴ/V}5ϯX^Al*-3 v$I}ǬI6iMLNf}ɍlm׶wf͌~ݺڵ~8)$8۫g{??i`]"' kmkٲe] J*DQ2';%|@F0:Fc,:su y^]|cEUcǎ=EdgdOH\diÇV:dHJsgffƍ޲+iݥOF5tG&ORׁ H=nU"YՋF'MdL$n E- 14ϧ񄍪|.==mҥǎ򲖈D8pʕ֒ٳ,Z0ؼcƼ;~|Em^r]4~mtz] J*D&2ݵQ /dan-Fb0 3YLp '^mlsӦMI64meK˭B^z> K+%&>@R(7hdt7Z %('-&b"I111 Sc čl…ӦOw*3g΄V$iC(IBQS%dgy܏ Iܠ) p7hI-P4&@b=#b09Ux*U+׮[! Ԡ*YI%"sψQl&,¨SI8[1#IFc:v3X ̶]*&N\ΝTeAA^\Ol-)qdHɊ 0H\u IP$((dU"7U\Ooof͚هg(3fŗ_vhAl7yq={X}nx "$aHљ4Y<:Kcp0W!0U:MQMvԩVPP0zV< AAVHiDtƤ39t2y"_18. 6qzK`}[eSMۼiSfFFeFtҮ]:-  5ܹsΝk(8'xdE0:FgbtFg`4(n:U" ѝ6CBB/Y:p-7L&ٜ֭:~O>5VFAZS*Uq ϾG# q2`q,ŕPtzw}D*ov̘1͛GlڸqMr`4nܸC:mpS&O?*qP(,A̩Ab+,wAUPT!)m׮4+򋊊 Zh HL:)&^W4ob-2)ʊAAR0QnLĬ jKrON_uJ8y]yc-ϓkh QYIM,q*7w ֵE%M$UUmm~w(U FG=Mٽu( 7u%2"bGFyI^)L*;( Fo[4^=wřqJW܌uIn'?k_0Cm쎾~Kqu\wR*0.~*ڋaw͐A|?WYG1zqr>=0o] ̟&ÓEfP S}#,!*Oc3S\@%]JoYRҡ2j IDAT>OG%Φ: 1؃ֻ6:F;t/hV/@١FĢ ^Sh,&dVv'Ob.\V[󗇟״yI]Yǎ4 R/}㍯VtBɳfs BQ͓ﻕj"^܇Kƛ%؅UV~hPt-"L&E)nZdnJOkUplsk.bf;*}WiAXN'Ru~]|vOBjoalMk?g.u1Lʄ?iZI핺z|w[f T A^(NQ\%O~`QJQ֏9)yxO$q3mϚPGKn,{2W:d?ޟ:(F;l-Uycx A-nLlŕC.)vU}_R@{ %>Vb'rUJReۙg9'379r JzEY#]K'Z#!.cksDz]n-(0, RNO֭:+P 7{lĊcU@q/u"1uq/[9P$EhFź~3%EH3?1<h&((^Ʌɓ ܛA: !<[ 4ζmw _ i_W׹QS樏Vt&vɮ& >ĄNiyvp-M`ץz~fҁPߝ#ШRMR47ov'k0 NJntj={XW؛FmA^m'~0f֭[D"Juĉ[jE7y#,wlKr+Dv=sx~~V#"=H^4ÏK]2pUtEVBKT<w0jˤ6 泜4hJ*#t"[e~CO+weA޲azd=̥3{ pOWDz%wd*#]k]]Vf8tu'w{WJj EAzVQuR)#B/E*un|혇&!͇Aai11;Xj%Ittw;_hy2xn6ʫG|0ړri.J]Lz:Gx"nOFw 0*'ŕ 0QqGzܩ `]ݕfch۰dN6/?̻ht siUݱ Lf'zjlѺK^D4ͪOvq.r-jd*nnn~R7D|Gw^_ z_mH/i9k2MVr{k-`PKcu=Wߝ#a=fyʕp?GF y/#&}|C>0.KV/lٮ37(z'ۏRYy0+#L` 111mZ5kYR9qjT~_"nnZo#*&X<%;J0$$ݟ5;off>3T*R}ɜ9sl۾ք7))iŗ+N?Aѣ/^l2-_~1 7|sٲ Vye'OqH+bz@6#͊, |$̂qd[~KRL6ͣk^Z %nnn%%/^AIȼJ/ ȸ4XM& F皮IZ62I(rvKԲ~zߟ 2Df#/]8w<6.((um  Æ;|K.9x^L&gK-Tb۶۷f"7w}w…_u5O:2stŤIgjq&IS֝{Ҥ|S~;cMM#:i46-!,$Iرc!QQ- ɓuwQP ~~F,68i9]~hfr0b2={;w͛o߾2wܲDgdeKg+?ָ+UrwIR A_;ng>8;;z頢El.5c[h,h&{X( ]zG9-K.'p~؛}vYOqvvEԋZwm޼y߾JC{mI W#8NU)`J #x?D0|HNX7o\.a!PsqPe˖Դx;X*5 Abbgg!(!eΖރf>WVfR:)JpիDFD617򩨨05rw0152loOܽkiaĔj5rsszUcƭ,K`4> U@B^y,)L5gDDF7777]&''>>`u*--ݼiC zׯ]TjL*.ގJb(a'ERFiULRL!RUS.s^M6,/41ׯ~vZPP^=b֩Sj/'N|{Rܼq3 ]o:s ګAPY4-jd TKHvfv|3 *E9EG߾=W rn˕W\{AW0Ժ\xqjhf֬Tj"@Q&@Q!~UȨgb%Tq])RQznr֋L;ɝ?ѣGGy=LT*_DE}5&ΟH$\dqe׮]#Flt&@&Mu@ q\ ;voյ&6]GfJ G\ uGKGv(ϵ73C1TSV@g͛Chh苗/'auz߾}11SBht3 ZWR3v>s11N ZÇ[[[R$RExxFQ!I/D1]BYBVzJc_wm}YZܾ}{˗z~ٳ:vtҷ3g߿ԩt^y * qjpUo/o}38J@eSP!S535aQ'$Udd>-+6z222xBܫWzճg|\܅ lv%B@yS&?yq-X &:yAP˯'r/7klg 5*+SWTD"D,)1tD$ cw"1ߢ%~{kK6Jrwwu{k{9 G)<#+>`*"InD,PZU]G|IgLAh~ m[/^דږz^ AR[KP\Zwژ\t󞞝lLJBQV+ _ggWr.!WL,ES'O?Iu=tՙW>*9AjLR vAg;u 32ܯnK~ׯ_ot MRhA<΃q1QA$FV8`pVtd.lfXe۳X~1t.4еz&,1bB=}~)@PK&a0聁~.Ҋ Qu4 2e; fgѱerkݷ)ւJcڻڻvsڣ> Ѷ<~5NJ77`TpL7777bN|KSC5qfΚ ۷/G۶m۽CPD JAN߽kΝ;7}Q&{zzܹG ZoA ۷o7tu  Tj< ڑj3 AAP`AAT'8HS+*bB$@) 6ע3 &X*ՋĔBa޽1 P  %BeٸY} 0t)qy4'I ZVͥ[6Ț AHTQӥVfda:T6IKIQYaET ~% \*Qll,uy(~v!{̷65tP[v#F{*iФ$C';'▟oBMKwQ+*"1 i7*W-/TKKe5ۘbዿ2폚PEnEnX d9%BF u?̣1[o5tP\S Lk>jWR]$1*yc&/WeIBc2SH:L]mff~qqq޾GϞSC qpDǏPWWzCCxɍh q{Kee"T$W8ZzHedӕ769BAϜٵkyV:KvJu"I2/6f"pHA(JC)8B|SRQIj^#W;͛v/H$O>ݷ# +F >{OzZڢE rŴkM`%?$>mCd1qD)ȯMQl ʋ{.dNk޿ǏyyyuT)*(矋e$Ap?fWQ^p`QXfll`SzOsg/ө G/_^ut8l:]gϞSRRXt]6 GD(++&&ց>slmk=EYY\i;>0n;Et=Ǡ h`zK:J\ڠB)IT$& R'M!?{Y['eggmܰ[666#F 6l-E]ACL\WW0ԼfYW , 88N 0ڭ랬8 Tqg|ٲACN>Qseˊ#"99✜s4ńɓ奥ʪw<| ߵA._PTywFE)zSΜ2~Kj,Y. r钦ݙ4IQY+]+pA[-^lݚ~\CrW/j'{}! 5|ʽN8WfV"\! \$q BYH`8uσ?;wNBQtƍu#:Zա^Pe2,;2ZPʔJJA߇f P)Zvuۆj}q#EY*FE:5%!abtj?3zΞ=qq>q#&ڳg7q丸uJw͛YȹyFk& ~O)&8MFQYi7um2~~<Ф$MCҴ4. qk +4#=qk~53@T0707(2 )Kj\VqP \ER H(ԡ>?~4p Ҹw{.#jOYix\,+"DbV9|%Og*4.aDR̈oLRW_ݝ:5bp\[H:z}}i@{lurBTѣ5-7r(L)An|-[x..(svy3S.F-[xκ%ocMT&#:7|~o'_erf4P*lzgEoD\\H)+10SHpP+I@!hL>V_B;;PUUmޛk`KcQ-KTEV]y [BZZkuTE䭂k,gэͫ7tP'zp 7u?~w|WWTZ_={n ڻ]5٠ٚ - B7ѱƶ6eUջ4Lt>dИ$ z]UWh$ s3!IJ帢B-BcJA(JJT4B7"7Fn`_lC}G`YTJ>\V.՘2 >vqw O{J+{JfͲ7c[8\YCmŋx8AQ 0gx3aWyyҗ/ϝ۷Ә1lԝ;FKAk]S!$kj猋ssLSSGI7 Egc~8=C ^FU^cK8p$BZI`*$ 4F8C[[7_5"'s {Z IDATlz+j.fLªBP* $,CJH>̎s +:k-S/;VVCb1PGDD^pwԌKR݀AA4vի^&qɪRR^:z 33IeeEm[&0P z# 0nQ Pu3JPe9jJ@BcT A [&)(BAP*BA*T MP*L-sr>. s/+))4im՛^P3jnܟv,`"Btw4Ia?Z: R1aj謡޽΍;ر $;|X^zUQ[|,XP)=n\З 6֨Qڏt.{޼?(<\{sHmg~=x:UjYr2KNP6 |F(\''?ܱCif6E3NN( p8qٳMٽLJ`PL۠O;cg7Q47w5jȅ [L3֌Z6ogH )-)iTҷrW+Dw xV 941JAP (t&eL1qBTrJy1g1[6oZ`;;;A fjM[h'}h`ۮ\٥#PD*e"%H0SeҲXHu~Cg }JKRS]Z߀ZJٿ+iEߟf\\9pޤИ\+XSH91 # Jg2t1$T[ӓcdn'O,TC^u& 11ٳ=[̬Zi 5/*J+)q)'υL Ғ332TR՚!k{ 6tAި$IBQES"u0(.//K$*'@Ql&̂aa*B&DžTxyy|P]{-txj"K#uƪgхv6vFlcj4?' ` AFTwڹ/aZV$@Q*Bec$!)U8 tH J*"C' 4/[_[ 7Rh4B s1EfoA-]܀k4eg_Zwqdқkމ6!IB.,(+L)ʌ r <})C`ndni=?x ,-HX1w5ӄmRAЇ J,s͝X5H$IH06kȂPĠ2ܬܬ3t.APsR=h #ǺZB-Z2% Z , Z=O:y5Ͳm;=RnR RRS7oHNNa%EE߬]g kuCm\{n___:Nǵk ڂG y A5N`|&Q%V/tJ貥KU*J[l鴩 pAP7Lm 9L ڌ_*)B$@)tAAmc2:= ŋ[?q|YN Z6\*ZT(RTJ)VjH2]??BŲ jce^+*J3tvPw];wh> ڹsaAMfK%IqXU8Qnd'R$\,$EGyR௩4ZעW&l[ {kQ,JzUPc ʿe{ d9%BF u?_b^mBmׯ3lc tjmTbRk ^S˒0YZ!d"L%*(.;&Vr#G?)))u2iR@=y򤤸fu1mZرJ!|O_&6c:_m>cʕ+֭[߽{w@TT-? CAmA,HDP9\i/'tpP4#4:p1Z-G_ S}{m_}5wVVV422?;a&~5wZ۶u[vvβe˚!H|^u;˂bdg7NJrDw:k H?mT&(t,U˫rZ!B%'pIJEP "DF>UxxxP(bbb3}R]a̲H b\!I%J\KeBϹ=(y:W &5q #<~f! =@3폍@BRH)+1$pS$JC @2Gmܑ"[[ۆDjK#00pɒ%>)H.CiY (*JGZ n\c>Ä$B:! PF4n=x$RpWTBZ-a Z!rB$$Tj-l4{)Gٻwo32JP d2PfYqe {J+{Jƣ-(T.YCA1|Tc< 4mHISHqP+ LE8 q$Q)rI)}"x.x!pBO } LVUJT8[]I,Y6 ]ׇLW%|ׁK*W ҏK%fm: (Ba$$PBCLΦ 2*X.I*}{{WyyyO } &8@oif0ߛܻ' qC<:k H?QPP`oo uJEfRa9JИʍRh4B H [ *R^g֡q5kɓ ѱGƸ4Ї}o^B53YU**4؉6;G9R :{z:k͊8p`rr2bJ333C'ФJ_z_$`8futmM@|q/EI38MmLaPŒȨo|w2M{^x [~5 WK b| 84T2A MUY 0Rh (Ai*̄c 21؍85kF3o޼A"RTTGژSΘi]|Hݶﴫ.AUݠ[7,xN."vџ@;u3LTz,8='1U{6a 56={lŊ֭ xE8~NoιUdN{*T\Y*|-Y{H\TU(-L}UgtV{m~|>ҪH3x@c~* 4t/J  0#0Pt&ӈKg@RH9=_}iԭq0aC9R^^NR{q M_/,[L"vСCpJGEiNz:;9\(ADJq -939#)C%U|PNju 8lp߯L<Šy5T\S' 0Ҩ0OkQ};x8jL0='f5D\pEϗgkƌZ}ɨϏ=jجp^ZR8&K%d̮iEqyy\"Q)8A d3y&f S)r8FJO}յ700000ѝC2 k^,ЮΈmP-䗕 xŜ_"{paݖ~/\@RIQQ$Mfxd йy$-.Nؿ8"BYY01 ?fJ>]NGYzySp df~mmI<٢A(4752/_NxQcwf͚Æ-6'7_~};XwH}`w%*X3{ADѐJ?pܹS&BL1r @~N:nxzS V2TzX:ғSj(JeN2RPZ^AG1R.6tPkiutan'NKh B.3(N}g5@X'A-/==]xiQѽiӔB 6V[#ΤIJG@}Zqxxȅ oi6:3݄Z5wOٯnLj~;!xuks5mڱǎ HH?\X^WQT-`vOSݮlzۿ/tJhQ2Kk[,Y"LugV>26sb$I($U<HG#W:e3㘯xnSN{$IQu1n'A-+,,,$Ǐ $Phs(;uڀ~~=7o6vt>߰ի?;MLȿaIIwCC^z( !08ӎgYodhR3rQ'O9bѭ66bu%u.`ślh6\ǟWhJ1W|={=w'=zL߫ӧO>}b_پ%KO4)44ɩnKƝU3*vukRpfl3:áVƹIJ& H02ҘuwAcPs|i\/_۷/G۶mC,zs~~=nsm@ӧ^[p;u{n|kԨM&'80M'GI6lԊa~#^}̪4za҄}CHȐ7o>|$IKK &}o|.>Q*nj]|=ݦhfϞ5{vCVƟ~٧~z̙Æ9;N:e?w?f1յAódJAIϞ=wk~CuwޭW'ʪ*:9`6f[{ׯzOmdzȪ(+Jl4f7{] :UFy~z[aYsF_6l81":U͡1I4"fɧWi5|r劅 kK0+ƙfK%v%{,ڧOT.(;[7ab(/r-41[!?Oe0b@@CN?po9ɮ,?ԝ\9[}o۽{5TVT=z,%CAӌ"ͧF_EZZ3g.]ԩӾ}?is8tX j^Ο0a^ ڸQM0=71 <߰AE(++jFm;wLfT8/ڵ5QGFɥY[s=q#p$o L;Rܽ"%VꤒU7|uWUEե[Ǐss>mĄǏ7(T@jYN ӈbS' ?n,Fy͛jU{#8f)F5 *AK,3gKiIɱ--zՃ_>zT}sĈZ|/ 9R01?_m?p`͛Z-8}XΜʢPPQш^o]\UF_.P|ٲK/ٹkW)>y)b;ڥ r'y|wYo>rӧOΞ9s]Ͳ h'f w|gpU{`1ATjQw28dʕyy'M:u=plm?>}:ʢH໹F^ırBf *f ";;M@ RR:ur⋈+xv?;<sqVL~USqlGn]B3o?x, i-ע׌#l^W]Eե)rŊwO77qǭ\Yu\zMn\>nЭ۾kux47&OKFJKJt?G>}íKv Aա4-5ͭ%OjieUo߳gMnѵ+Œkٳ|WaW@JKkEߟf\\9pAVqDD#ņ>pZ7$P*oA;tȺW/*RaBΝ 6t^dHpT *+Eϟf3 Z)qy4'I ZVͥ[6Ț 5mPmP ,I̒wcݺu6t:P,zPrDYh²1@Tc/م1ض^ ,\LL37Ǒk茠DM"DCe!PLyd肘-{As@AAyeۯJD6%Hԧ7R^Z5cVPPg:uttg#ѣGÆ<﫹@+22b֬n6|;+؀KnDN+%9VW *jad)zr׷+V8wrj?]A^*$X`ddBQx<Ǐ ٙӧ o޸QW@&VisJ*.UOZ|/LMK??SR;jHaUsrs8pСӿVy 6G8|8T}Y t*BG$2{TXP^TG%lv WݼIB%9%y˖-zM ŋ/#Gŋ AK%H_emm%J8#} \I8֔ Ǐ8|Ps%~;u{K.|>ҥ]vj۷o䓱;n̙gΜ]hWuF<<=:w޺ΫWA(qͼ>ցdS15c8De4H5zqǵr*cոy͛^NOF\ \VCz*S3ӧϼK&}?w_|P(Z>Em IDATIj{uDdRRrM\\nLLFa'h0_##/^Rj 5 s3T|2.$%&N?}'-H${kH쇄 wn]߹It[&Nt  m [u޾λEzD(+WdETߑ)RT*TjUM>dg7NJвsn'6^ߎ^_]/]rr3-$=TJVV8N8 Fq-<^b(+jwn$Ç̝ b̃~;@s7VZ9pР$m'&;v\RrJ\|B=,oE .ZujԴ -??"i~K355饤~=`2^>1frDBR2[ܞI<ӸlIE"2#Wz};M*ߏ5ꍗ5ڒv]*V---r"eI 끍wcVh˓jEu#:ONJā5:wO0tPE~رcɒSBCCNֵv7nvСl6f>|ݺ_멫kĤJ(5{-wީ5j-libKcQ-KTEV]y [BZZkuTE䭂k,gэͫov ZwN233 %TqŋtSSSTQRFZ8[+-܇V\0sƇ[=Y1nxr6gL?zH}!5=Ze'hc?ސ!C^FltzZ+WZjkd2L&5W:3w>WpK%j@V.S1 eUw[]XDd<ۂHR{!7txz;uc'l-Afƴ**TJB`ɲY>4` (䟏(\:Pڡk׷W0ANK% 3@,$% ,{LQu1;;X[34'Oh.nn yܽhԴ\E#˭[UUjK.-IIInu=0?޺' -))4i▭[R,,)8Lp=c<̊a>,7G+w'3NR1aڼ9UBH$m RI*ĤQT #P%Hʈ8 *ոZ)D*qJ22䝻kjɓFָ_ǏXB@e|Ŝ_ڭ۽o(wd&]\pA C4GǧϘ'Nذ~CP^2WAW+$js#M$RwR^SN}dܝD’Ba_~^v^&~Ї׺-ΆڒvZ*;d( 0ׯ L_ 0*+eT*JMz5ů攠Zݸq˻C5;vtruuun6+WٽD";w"}ռM}fF۷7ov5}ƌ Bp/_6}6ƍ/<11AV,[F;h K,ӤtvUoY["1ߢ'A_tYt6uST;ׄmҼ9 ^]~]0T>ԖRI"?zggggQEH@$ ALc*P&:crUr F,Ҙ 3gͪuٳka+V,x$}_l|˗.wqؾcN ޽=wvvsgӧIFFFW#66ի߯^euzQsqt0ed77;vhw%&&|9{vc^AEiz}qNK)(Dϥ#SGS^4AZDBīTb՚!k{ nv ρb GE#ō?yAP[}ӧ]<<>lWNNɏ?^bL?lQYB&)$bIIČS%"ed34 x' Xv4tٳUV=zЉ5EknʑXYX%2o~3/x1tЇ4-5Uωb$))YQXX}Ϟ=k5VVڬ-DWP ٙ…Gdd2P PN^Q:>+?ǥxsy qE"uJ3O[`/a"#W\bJC'y2޿JB@ \.gP;w`[+&@UQŒ=J45$$7w/:&&622 HJpG=G I,NG|WЉgIk~DPWY=aDC'6Y~Z^?K +qL9y lIAPKjt暗W]\^^-JLLLJ8F6g'8fїod3rȑ#G:AeYY g\ NK% ݱN&VZ2+ >( 8 AAP`AAT*) z+ܺuS,pWg==II-yRj1pT uXjgFkOA.ׯh^ J@@R42Am<0yY* gnVEJwPٳqqjmm2n]Qvv?EE4qww1`A-JPU%~2#(ȓ͢:•2yYfEaV\*[{5wbڢ 5yߗ^)-zd3|WWmأs¸}sEEMS XAll]Hdg=|Z`\Jwf^/iRgVI݂ou"C'AswNi1՞=a[O˗5P ~~ï_7us??\  8 UrJuDDc SScCg&(=o?^8ebgSUì^`kd(, thѣhݏ۷[t 0^s検8!+)'Olܳ9;ܼ֨Q-?UEUU*oojIln8u9sO<oSqƄĄoý!ڿ!}y-Ǭ6BJC?eiᒴp ݔ2Y =K.]tr좢w`;XHQYYkZ*h_YOp$Ah>*++ƎJwڤ^*$RlllJQx<'O^V4۟~ƍ?)-5 sMV_[l=~XAAAA-\dnn~x$/^|r}_W?a "2sl@j6Uy~ EY2˫{qyJ'N~Ͻ'M$׾.ڻ jffQw&%P(:xڅaj j[t!Mj勒X(,Y[[ILjN++ITRo^OO֩SyjF. yIIInÇ.]Zh=z|1+eaǭ]<@e4&Q坑nK7TiO7gvu…|-\s֫+ D^]5LVԩ&Nl`6{o "q\|Æ1}uDdb: ĄWq%'c~3 PYYiaa۲xb2Db /OOwwo0T| wwwat2wwΝ;O>-55SvNeȑ<ܽ{w)ZLRrٳgmm^ (Cʴ{NVKlUEUƝ\[%{ W#Jөw7{?NeqwiD^]AςFƝp{+жyt.W{ss>>7G, A׮K%Lu8N"QiUS̥y1?'A={yy]t!k׮ $&&>}vn냠T~H(H-B)"eI⡍scظЙ|z/f<\P߾...]ᭆ=z5 boX?~ܸMnҶ[n%󿞯 :E:5T$ڽ{޽ Ii[lMMMS}VXx^V?;wL.uϜ=YkMF ѵkצװ*2BUc$K]_L9:u9?Ơ1P"Z^E"mFd~[F.[ֽǭF#S~{wT lj,SSSTQRFZ8[+-܇V\0s%D^Z{Wn`aa˖-R=zJ}VСC]rn{.9ڏ5f=&<<)hO?>{젏?633o`p/=zd0&|iӾ;w-X'58TH(jSL B[w>Z s~".J09 EiJ0p) VJ%wMy{4}jQ( d<XeΌg 0+28#:EK\Q\=J_b߀ڦIּ'w-mI{iMMܫdLK6IZzI&3+Agt8ypCSHO#H҇>iӦݻwWWٴyf1z}xax͸[bM\\!]|g6BGC>x5K[H!~qyp(F%SYg ]4ցŢuphGp4*lme'';XgcR~VaqPX X(_]yS8.rliy;,yL&~@%޷_$2ìMv+0m'zDJu~p{%7E.Ӊ 8E4Q%j1@&*k!''­s ӧ}GpX%][:mZD""ȧQ7KD&NF\Fk+Nz{111wX'|nݺ|pT=1[cx=`=zGd7UW0`T:rhtdee8~BD"⧴QO44_'~Kb7D".59iGF={Xȑ#N>uj SFﾻ[^C6&q:Ek╉̌dH$ebcExEKU;?V^}̙~bZ֝;wV=>]瓓23u H$XYH|"Z,SgKs,T_Kw|^Wlj%%RwQy`N^ޫ_XXo~SZZ>m̶nz̙s>9>KFFh;yvڵfi6x+lܸ`E fee-Yܹsh tDS v}v1+5{%,1kn ?Y"^Jusϝ[_WBCQu TeȈk]+ҥII3Ka3ܶk--j_d uγ|Y"5Qz򪪪70^9́S):aE=&dE~1k?2%j556Na>V2h]~k--+[pa널6U-|JIS [eoC+bTJ%A6Ȋ9[|u@04C5 uWJJ\.hxMk*rMܼտhڣ]*"1(kc?> (++V"u)TĴB>n0v\ im| "F;V sRn%&n(Jr%dF}4-!+WB/5=}$fTP(fsgG.(J*ȕ $37ߤC]%IBBIHrΝ?Wpo, p\.i0ͱ$D%\.L&n*o-oMr\r<46`8qٳg¨Z(!y<\n((T37U_Wcqs~_viѿ=C?2DRw xvBcG.WBX =Ol dYvҒӧOBb1!$~G%%%w+ڶ}{iiW۶m)Mk5@ PVlcc#=z$ XDGz>Ԡ}}vSScoooJJJZڍr>we_?G2f WTwjS_կ/0|#1:Gs MecǎBbzXLȗɣ /+{Svv댚:f4lIENDB`why3-0.87.3/doc/manpages.tex0000644000175000017500000013173213035416743016334 0ustar guillaumeguillaume\chapter{Reference Manuals for the \why Tools} \label{chap:manpages} This chapter details the usage of each of the command-line tools provided by the \why environment. The main command is \texttt{why3}; it acts as an entry-point to all the features of \why. It is invoked as such \begin{verbatim} why3 [general options...] [specific options...] \end{verbatim} The following commands are available: \begin{description} \item[\texttt{bench}] produces benchmarks. \item[\texttt{config}] manages the user's configuration, including the detection of installed provers. \item[\texttt{doc}] produces HTML versions of \why source codes. \item[\texttt{execute}] performs a symbolic execution of \whyml input files. \item[\texttt{extract}] generates an OCaml program corresponding to \whyml input files. \item[\texttt{ide}] provides a graphical interface to display goals and to run provers and transformations on them. \item[\texttt{prove}] reads \why and \whyml input files and calls provers, on the command-line. \item[\texttt{realize}] generates interactive proof skeletons for \why input files. \item[\texttt{replay}] replays the proofs stored in a session, for regression test purposes. \item[\texttt{session}] dumps various informations from a proof session, and possibly modifies the session. \item[\texttt{wc}] gives some token statistics about \why and \whyml source codes. \end{description} All these commands are also available as standalone executable files, if needed. The commands accept a common subset of command-line options. In particular, option \verb|--help| displays the usage and options. \begin{description} \item[\texttt{-L \textsl{}}] adds \texttt{\textsl{}} in the load path, to search for theories. \index{L@\verb+-L+|see{\texttt{-{}-library}}} \item[\texttt{-{}-library \textsl{}}] is the same as \verb|-L|. \index{library@\verb+--library+} \item[\texttt{-C \textsl{}}] reads the configuration from the given file. \index{C@\verb+-C+|see{\texttt{-{}-config}}} \item[\texttt{-{}-config \textsl{}}] is the same as \verb|-C|. \index{config@\verb+--config+} \item[\texttt{-{}-extra-config \textsl{}}] reads additional configuration from the given file. \index{extra-config@\verb+--extra-config+} \item[\texttt{-{}-list-debug-flags}] lists known debug flags. \index{list-debug-flags@\verb+--list-debug-flags+} \item[\texttt{-{}-debug-all}] sets all debug flags (except flags which change the behavior). \index{debug-all@\verb+--debug-all+} \item[\texttt{-{}-debug \textsl{}}] sets a specific debug flag. \index{debug@\verb+--debug+} \item[\texttt{-{}-help}] displays the usage and the exact list of options for the given tool. \index{help@\verb+--help+} \end{description} \section{The \texttt{config} Command} \label{sec:why3config} \why must be configured to access external provers. Typically, this is done by running the \texttt{config} command. This must be done each time a new prover is installed.% \index{config@\texttt{config}}% \index{configuration file} The provers that \why attempts to detect are described in the readable configuration file \texttt{provers-detection-data.conf} of the \why data directory (\eg \texttt{/usr/local/share/why3}). Advanced users may try to modify this file to add support for detection of other provers. (In that case, please consider submitting a new prover configuration on the bug tracking system.) The result of provers detection is stored in the user's configuration file (\verb+~/.why3.conf+ or, in the case of local installation, \verb+why3.conf+ in \why sources top directory). This file is also human-readable, and advanced users may modify it in order to experiment with different ways of calling provers, \eg different versions of the same prover, or with different options. The \texttt{config} command also detects the plugins installed in the \why plugins directory (\eg \texttt{/usr/local/lib/why3/plugins}). A plugin must register itself as a parser, a transformation or a printer, as explained in the corresponding section. \index{plugin} If the user's configuration file is already present, \texttt{config} will only reset unset variables to default value, but will not try to detect provers. The option \verb|--detect-provers| should be used to force \why to detect again the available provers and to replace them in the configuration file. The option \verb|--detect-plugins| will do the same for plugins. \index{detect-provers@\verb+--detect-provers+} \index{detect-plugins@\verb+--detect-plugins+} If a supported prover is installed under a name that is not automatically recognized by \texttt{why3config}, the option \verb|--add-prover| will add a specified binary to the configuration. For example, an Alt-Ergo executable \verb|/home/me/bin/alt-ergo-trunk| can be added as follows: \begin{verbatim} why3 config --add-prover alt-ergo /home/me/bin/alt-ergo-trunk \end{verbatim} As the first argument, one should put a prover identification string. The list of known prover identifiers can be obtained by the option \verb|--list-prover-ids|. \index{add-prover@\verb+--add-prover+} \index{list-prover-ids@\verb+--list-prover-ids+} \section{The \texttt{prove} Command} \label{sec:why3ref} \why is primarily used to call provers on goals contained in an input file. By default, such a file must be written either in \why language (extension \texttt{.why}) or in \whyml language (extension \texttt{.mlw}). However, a dynamically loaded plugin can register a parser for some other format of logical problems, \eg TPTP or SMT-LIB. \index{prove@\texttt{prove}} The \texttt{prove} command executes the following steps: \begin{enumerate} \item Parse the command line and report errors if needed. \item Read the configuration file using the priority defined in Section~\ref{sec:whyconffile}. \item Load the plugins mentioned in the configuration. It will not stop if some plugin fails to load. \item Parse and typecheck the given files using the correct parser in order to obtain a set of \why theories for each file. It uses the filename extension or the \verb|--format| option to choose among the available parsers. \verb|why3 --list-formats| lists the registered parsers. \index{list-formats@\verb+--list-formats+} \whyml modules are turned into theories containing verification conditions as goals. \item Extract the selected goals inside each of the selected theories into tasks. The goals and theories are selected using options \verb|-G/--goal| and \verb|-T/--theory|. Option \verb|-T/--theory| applies to the previous file appearing on the command line. Option \verb|-G/--goal| applies to the previous theory appearing on the command line. If no theories are selected in a file, then every theory is considered as selected. If no goals are selected in a theory, then every goal is considered as selected. \index{G@\verb+-G+|see{\texttt{-{}-goal}}} \index{goal@\verb+--goal+} \index{T@\verb+-T+|see{\texttt{-{}-theory}}} \index{theory@\verb+--theory+} \item Apply the transformations requested with \verb|-a/--apply-transform| in their order of appearance on the command line. \verb|why3 --list-transforms| lists the known transformations; plugins can add more of them. \index{a@\verb+-a+|see{\texttt{-{}-apply-transform}}} \index{apply-transform@\verb+--apply-transform+} \index{list-transforms@\verb+--list-transforms+} \item Apply the driver selected with the \verb|-D/--driver| option, or the driver of the prover selected with the \verb|-P/--prover| option. \verb|why3 --list-provers| lists the known provers, \ie the ones that appear in the configuration file. \index{D@\verb+-D+|see{\texttt{-{}-driver}}} \index{driver@\verb+--driver+} \index{P@\verb+-P+|see{\texttt{-{}-prover}}} \index{prover@\verb+--prover+} \index{list-provers@\verb+--list-provers+} \item If option \verb|-P/--prover| is given, call the selected prover on each generated task and print the results. If option \verb|-D/--driver| is given, print each generated task using the format specified in the selected driver. \end{enumerate} %\texttt{why3} calls the provers sequentially, use \texttt{why3bench} if *) %you want to call the provers concurrently. *) \subsection{Prover Results} The provers can give the following output: \begin{description} \item[Valid] The goal is proved in the given context. \item[Unknown] The prover has stopped its search. \item[Timeout] The prover has reached the time limit. \item[Failure] An error has occurred. \item[Invalid] The prover knows the goal cannot be proved. \end{description} % \why can also be *) % used to provide other informations : *) % \begin{itemize} *) % \item \texttt{print-namespace} print the namespace of the selected *) % theories *) % \item TO BE COMPLETED *) % \end{itemize} *) %Option \verb|--bisect| changes the behavior of why3. With this %option, \verb|-P/--prover| and \verb|-o/--output| must be given %and a valid goal must be selected. The last step executed by why3 is %replaced by computing a minimal set (in the great majority of the %case) of declarations that still prove the goal. Currently it does not %use any information provided by the prover; it calls the prover %multiple times with reduced context. The minimal set of declarations is %then written in the prover syntax into a file located in the directory %given to the \verb|-o/--output| option. \subsection{Additional Options} \label{sec:proveoptions} \begin{description} \item[\texttt{-{}-get-ce}] activates the generation of a potential counter-example when a proof does not succeed (experimental). \item[\texttt{-{}-extra-expl-prefix \textsl{}}] specifies \textsl{s} as an additional prefix for labels that denotes VC explanations. The option can be used several times to specify several prefixes. \end{description} \section{The \texttt{ide} Command} \label{sec:ideref} The basic usage of the GUI is described by the tutorial of Section~\ref{sec:gui}. There are no specific command-line options, apart from the common options detailed in introduction to this chapter. However at least one anonymous argument must be specified on the command line. More precisely, the first anonymous argument must be the directory of the session. If the directory does not exist, it is created. The other arguments should be existing files that are going to be added to the session. For convenience, if there is only one anonymous argument, it can be an existing file and in this case the session directory is obtained by removing the extension from the file name. We describe the actions of the various menus and buttons of the interface. \index{ide@\texttt{ide}} \subsection{Session} \label{sec:idref:session} \why stores in a session the way you achieve to prove goals that come from a file (\texttt{.why}), from weakest-precondition (\texttt{.mlw}) or by other means. A session stores which file you prove, by applying which transformations, by using which prover. A proof attempt records the complete name of a prover (name, version, optional attribute), the time limit and memory limit given, and the result of the prover. The result of the prover is the same as when you run the \texttt{prove} command. It contains the time taken and the state of the proof: \begin{description} \item[Valid] The task is valid according to the prover. The goal is considered proved. \item[Invalid] The task is invalid. \item[Timeout] the prover exceeded the time limit. \item[OufOfMemory] The prover exceeded the memory limit. \item[Unknown] The prover cannot determine if the task is valid. Some additional information can be provided. \item[Failure] The prover reported a failure. \item[HighFailure] An error occurred while trying to call the prover, or the prover answer was not understood. \end{description} Additionally, a proof attempt can have the following attributes: \begin{description} \item[obsolete]\index{obsolete!proof attempt} The prover associated to that proof attempt has not been run on the current task, but on an earlier version of that task. You need to replay the proof attempt, \ie run the prover with the current task of the proof attempt, in order to update the answer of the prover and remove this attribute. \item[archived]\index{archived!proof attempt} The proof attempt is not useful anymore; it is kept for history; no \why tools will select it by default. Section \ref{sec:uninstalledprovers} shows an example of this usage. \end{description} Generally, proof attempts are marked obsolete just after the start of the user interface. Indeed, when you load a session in order to modify it (not with \texttt{why3session info} for instance), \why rebuilds the goals to prove by using the information provided in the session. If you modify the original file (\texttt{.why}, \texttt{.mlw}) or if the transformations have changed (new version of \why), \why will detect that. Since the provers might answer differently on these new proof obligations, the corresponding proof attempts are marked obsolete. % non % We say that a session is obsolete if new % goals are made obsolete by this method during start-up. % Claude: Alors la je ne vois pas pourquoi % A session can % be not obsolete even if it contains obsolete goals. \subsection{Left toolbar actions} \begin{description} \item[Context] presents the context in which the other tools below will apply. If ``only unproved goals'' is selected, no action will ever be applied to an already proved goal. If ``all goals'', then actions are performed even if the goal is already proved. The second choice allows to compare provers on the same goal. \item[Provers] provide a button for each detected prover. Clicking on such a button starts the corresponding prover on the selected goal(s). \item[Split] splits the current goal into subgoals if it is a conjunction of two or more goals. It corresponds to the \verb|split_goal_wp| transformation. \item[Inline] replaces the head predicate symbol of the goal with its definition. It corresponds to the \verb|inline_goal| transformation. \item[Edit] starts an editor on the selected task. For automatic provers, this allows to see the file sent to the prover. For interactive provers, this also allows to add or modify the corresponding proof script. The modifications are saved, and can be retrieved later even if the goal was modified. \item[Replay] replays all the obsolete proofs. If ``only unproved goals'' is selected, only formerly successful proofs are rerun. If ``all goals'', then all obsolete proofs are rerun, successful or not. \item[Remove] removes a proof attempt or a transformation. \item[Clean] removes any unsuccessful proof attempt for which there is another successful proof attempt for the same goal \item[Interrupt] cancels all the proof attempts currently scheduled but not yet started. \end{description} \subsection{Menus} \begin{description} \item[Menu \textsf{File}]\emptyitem \begin{description} \item[Add File] adds a file in the GUI. %\item[Detect provers] runs provers auto-detection \item[Preferences] opens a window for modifying preferred configuration parameters, see details below. \item[Reload] reloads the input files from disk, and update the session state accordingly. \item[Save session] saves current session state on disk. The policy to decide when to save the session is configurable, as described in the preferences below. \item[Quit] exits the GUI. \end{description} \item[Menu \textsf{View}]\emptyitem \begin{description} \item[Expand All] expands all the rows of the tree view. \item[Collapse proved goals] closes all the rows of the tree view that are proved. % \item[Hide proved goals] completely hides the proved rows of the tree % view [EXPERIMENTAL] \end{description} \item[Menu \textsf{Tools}] A copy of the tools already available in the left toolbar, plus: \begin{description} \item[Mark as obsolete] marks all the proof as obsolete. This allows to replay every proof. \item[Non-splitting transformation] applies one of the available transformations, as listed in Section~\ref{sec:transformations}. \item[Splitting transformation] is the same as above, but for splitting transformations, \ie those that can generate several sub-goals. \end{description} \item[Menu \textsf{Help}] A very short online help, and some information about this software. \end{description} \subsection{Preferences Dialog} The preferences dialog allows you to customize various settings. They are grouped together under several tabs. \begin{description} \item[\textsf{General Settings} tab] allows one to set various general settings. \begin{itemize} \item the limits set on resource usages: \begin{itemize} \item the time limit given to provers, in seconds \item the memory given to provers, in megabytes \item the maximal number of simultaneous provers allowed to run in parallel \end{itemize} By default, modification of any of these settings has effect only for the current run of the GUI. A checkbox allows you to save these settings also for future sessions. \item a few display settings: \begin{itemize} \item introduce premises: if selected, the goal of the task shown in top-right window is displayed after introduction of universally quantified variables and implications, \eg a goal of the form $\forall x: t. P \rightarrow Q$ is displayed as \[ \begin{array}{l} x : t \\ H : P \\ \hline Q \end{array} \] \item show labels in formulas \item show source locations in formulas \item show time limit for each proof \end{itemize} \item the policy for saving session: \begin{itemize} \item always save on exit (default): the current state of the proof session is saving on exit \item never save on exit: the current state of the session is never saved automatically, you must use menu \textsf{File/Save session} \item ask whether to save: on exit, a popup window asks whether you want to save or not. \end{itemize} \end{itemize} \item[\textsf{Editors} tab] allows one to customize the use of external editors for proof scripts. \begin{itemize} \item The default editor to use when the \textsf{Edit} button is pressed. \urldef{\urlprfgen}{\url}{http://proofgeneral.inf.ed.ac.uk/} \item For each installed prover, a specific editor can be selected to override the default. Typically if you install the Coq prover, then the editor to use will be set to ``CoqIDE'' by default, and this dialog allows you to select the Emacs editor and its \ahref{\urlprfgen}{Proof General} mode instead% \begin{latexonly} (\urlprfgen)\end{latexonly}. \end{itemize} \item[\textsf{Provers} tab] allows to select which of the installed provers one wants to see as buttons in the left toolbar. \item[\textsf{Uninstalled Provers} tab] presents all the decision previously taken for missing provers, as described in Section~\ref{sec:uninstalledprovers}. You can remove any recorded decision by clicking on it. \end{description} % \subsection{Displaying Counterexamples} % % how to use counterexamples - explain labels, projections, the option --get-ce of why3prove and the setting in why3ide % % problem with set logic and counterexamples % % which provers % % where it is displayed % % how to interpret the display % % example \subsection{Additional Command-Line Options} The \texttt{ide} command also accepts the following options described for the command \texttt{prove} in Section~\ref{sec:proveoptions}. \begin{description} \item[\texttt{-{}-extra-expl-prefix \textsl{}}] \end{description} \section{The \texttt{bench} Command} The \texttt{bench} command adds a scheduler on top of the \why library. It is designed to compare various components of automatic proofs: automatic provers, transformations, definitions of a theory. For that purpose, it tries to prove predefined goals using each component to compare. Various formats can be used as outputs: \begin{description} \item[\texttt{csv}] the simpler and more informative format; the results are represented in an array; the rows correspond to the compared components, the columns correspond to the result (Valid, Unknown, Timeout, Failure, Invalid) and the CPU time taken in seconds. \item[\texttt{average}] it summarizes the number of the five different answers for each component. It also gives the average time taken. \item[\texttt{timeline}] for each component, it gives the number of valid goals along the time (10 slices between 0 and the longest time a component takes to prove a goal) \end{description} The compared components can be defined in an \emph{rc-file}; \texttt{examples/misc/prgbench.rc} is an example of such a file. More generally, a bench configuration file looks like \begin{verbatim} [probs "myprobs"] file = "examples/mygoal.why" #relatives to the rc file file = "examples/myprogram.mlw" theory = "myprogram.T" goal = "mygoal.T.G" transform = "split_goal" #applied in this order transform = "..." transform = "..." [tools "mytools"] prover = cvc3 prover = altergo #or only one driver = "..." command = "..." loadpath = "..." #added to the one in why3.conf loadpath = "..." timelimit = 30 memlimit = 300 use = "toto.T" #use the theory toto (allow to add metas) transform = "simplify_array" #only 1 to 1 transformation [bench "mybench"] tools = "mytools" tools = ... probs = "myprobs" probs = ... timeline = "prgbench.time" average = "prgbench.avg" csv = "prgbench.csv" \end{verbatim} Such a file can define three families \texttt{tools}, \texttt{probs}, \texttt{bench}. A \texttt{tools} section defines a set of components to compare. A \texttt{probs} section defines a set of goals on which to compare some components. A \texttt{bench} section defines which components to compare using which goals. It refers by name to some sections \texttt{tools} and \texttt{probs} defined in the same file. The order of the definitions is irrelevant. Notice that one can use \texttt{loadpath} in a \texttt{tools} section to compare different axiomatizations. One can run all the bench given in one bench configuration file with \begin{verbatim} why3 bench -B path_to_my_bench.rc \end{verbatim} \section{The \texttt{replay} Command} \label{sec:why3replayer} The \texttt{replay} command is meant to execute the proofs stored in a \why session file, as produced by the IDE. Its main purpose is to play non-regression tests. For instance, \texttt{examples/regtests.sh} is a script that runs regression tests on all the examples. \index{replay@\texttt{replay}} The tool is invoked in a terminal or a script using \begin{flushleft}\ttfamily why3 replay \textsl{[options] } \end{flushleft} The session file \texttt{why3session.xml} stored in the given directory is loaded and all the proofs it contains are rerun. Then, all the differences between the information stored in the session file and the new run are shown. Nothing is shown when there is no change in the results, whether the considered goal is proved or not. When all the proof are done, a summary of what is proved or not is displayed using a tree-shape pretty print, similar to the IDE tree view after doing ``Collapse proved goals''. In other words, when a goal, a theory, or a file is fully proved, the subtree is not shown. \paragraph{Obsolete proofs} When some proof attempts stored in the session file are obsolete\index{obsolete!proof attempt}, the replay is run anyway, as with the replay button in the IDE. Then, the session file will be updated if both \begin{itemize} \item all the replayed proof attempts give the same result as what is stored in the session \item every goals are proved. \end{itemize} In other cases, you can use the IDE to update the session, or use the option \verb|--force| described below. \paragraph{Exit code and options} The exit code is 0 if no difference was detected, 1 if there was. Other exit codes mean some failure in running the replay. Options are: \begin{description} \item[\texttt{-s}] suppresses the output of the final tree view. \item[\texttt{-q}] runs quietly (no progress info). \item[\texttt{-{}-force}] enforces saving the session, if all proof attempts replayed correctly, even if some goals are not proved. \item[\texttt{-{}-obsolete-only}] replays the proofs only if the session contains obsolete proof attempts. \item[\texttt{-{}-smoke-detector \{none|top|deep\}}] tries to detect if the context is self-contradicting. \item[\texttt{-{}-prover \textsl{}}] restricts the replay to the selected provers only. \end{description} \paragraph{Smoke detector} The smoke detector tries to detect if the context is self-contradicting and, thus, that anything can be proved in this context. The smoke detector can't be run on an outdated session and does not modify the session. It has three possible configurations: \begin{description} \item[\texttt{none}] Do not run the smoke detector. \item[\texttt{top}] The negation of each proved goal is sent with the same timeout to the prover that proved the original goal. \begin{verbatim} Goal G : forall x:int. q x -> (p1 x \/ p2 x) \end{verbatim} becomes \begin{verbatim} Goal G : ~ (forall x:int. q x -> (p1 x \/ p2 x)) \end{verbatim} In other words, if the smoke detector is triggered, it means that the context of the goal \texttt{G} is self-contradicting. \item[\texttt{deep}] This is the same technique as \texttt{top} but the negation is pushed under the universal quantification (without changing them) and under the implication. The previous example becomes \begin{verbatim} Goal G : forall x:int. q x /\ ~ (p1 x \/ p2 x) \end{verbatim} In other words, the premises of goal \texttt{G} are pushed in the context, so that if the smoke detector is triggered, it means that the context of the goal \texttt{G} and its premises are self-contradicting. It should be clear that detecting smoke in that case does not necessarily means that there is a mistake: for example, this could occur in the WP of a program with an unfeasible path. \end{description} At the end of the replay, the name of the goals that triggered the smoke detector are printed: \begin{verbatim} goal 'G', prover 'Alt-Ergo 0.93.1': Smoke detected!!! \end{verbatim} Moreover \texttt{Smoke detected} (exit code 1) is printed at the end if the smoke detector has been triggered, or \texttt{No smoke detected} (exit code 0) otherwise. \section{The \texttt{session} Command} \label{sec:why3session} The \texttt{session} command makes it possible to extract information from proof sessions on the command line, or even modify them to some extent. The invocation of this program is done under the form \begin{verbatim} why3 session [options] \end{verbatim} The available subcommands are as follows: \begin{description} \item[\texttt{info}] prints informations and statistics about sessions. \item[\texttt{latex}] outputs session contents in LaTeX format. \item[\texttt{html}] outputs session contents in HTML format. \item[\texttt{mod}] modifies some of the proofs, selected by a filter. \item[\texttt{copy}] duplicates some of the proofs, selected by a filter. \item[\texttt{copy-archive}] same as copy but also archives the original proofs\index{archived!proof attempt}. \item[\texttt{rm}] removes some of the proofs, selected by a filter. \end{description} The first three commands do not modify the sessions, whereas the last four modify them. Only the proof attempts recorded are modified. No prover is called on the modified or created proof attempts, and consequently the proof status is always marked as obsolete. \subsection{Command \texttt{info}} The command \texttt{why3 session info} reports various informations about the session, depending on the following specific options. \begin{description} \item[\texttt{-{}-provers}] prints the provers that appear inside the session, one by line. \item[\texttt{-{}-edited-files}] prints all the files that appear in the session as edited proofs. \item[\texttt{-{}-stats}] prints various proofs statistics, as detailed below. \item[\texttt{-{}-tree}] prints the structure of the session as a tree in ASCII, as detailed below. \item[\texttt{-{}-print0}] separates the results of the options \verb|provers| and \verb|--edited-files| by the character number 0 instead of end of line \verb|\n|. That allows you to safely use (even if the filename contains space or carriage return) the result with other commands. For example you can count the number of proof line in all the coq edited files in a session with: \begin{verbatim} why3 session info --edited-files vstte12_bfs --print0 | xargs -0 coqwc \end{verbatim} or you can add all the edited files in your favorite repository with: \begin{verbatim} why3 session info --edited-files --print0 vstte12_bfs.mlw | \ xargs -0 git add \end{verbatim} \end{description} \paragraph{Session Tree} The hierarchical structure of the session is printed as a tree in ASCII. The files, theories, goals are marked with a question mark \verb|?|, if they are not verified. A proof is usually said to be verified if the proof result is \verb|valid| and the proof is not obsolete. However here specially we separate these two properties. On the one hand if the proof suffers from an internal failure we mark it with an exclamation mark \verb|!|, otherwise if it is not valid we mark it with a question mark \verb|?|, finally if it is valid we add nothing. On the other hand if the proof is obsolete we mark it with an \verb|O| and if it is archived we mark it with an \verb|A|. For example, here are the session tree produced on the ``hello proof'' example of Section~\ref{chap:starting}. {\scriptsize \begin{verbatim} hello_proof---../hello_proof.why?---HelloProof?-+-G3-+-Simplify (1.5.4)? | `-Alt-Ergo (0.94) |-G2?-+-split_goal?-+-G2.2-+-Simplify (1.5.4) | | | `-Alt-Ergo (0.94) | | `-G2.1?-+-Coq (8.3pl4)? | | |-Simplify (1.5.4)? | | `-Alt-Ergo (0.94)? | |-Simplify (1.5.4)? | `-Alt-Ergo (0.94)? `-G1---Simplify (1.5.4) \end{verbatim} } \paragraph{Session Statistics} The proof statistics given by option \verb|--stats| are as follows: \begin{itemize} \item Number of goals: give both the total number of goals, and the number of those that are proved (possibly after a transformation). \item Goals not proved: list of goals of the session which are not proved by any prover, even after a transformation. \item Goals proved by only one prover: the goals for which there is only one successful proof. For each of these, the prover which was successful is printed. This also includes the sub-goals generated by transformations. \item Statistics per prover: for each of the prover used in the session, the number of proved goals is given. This also includes the sub-goals generated by transformations. The respective minimum, maximum and average time and on average running time is shown. Beware that these time data are computed on the goals \emph{where the prover was successful}. \end{itemize} For example, here are the session statistics produced on the ``hello proof'' example of Section~\ref{chap:starting}. {\footnotesize \begin{verbatim} == Number of goals == total: 5 proved: 3 == Goals not proved == +-- file ../hello_proof.why +-- theory HelloProof +-- goal G2 +-- transformation split_goal +-- goal G2.1 == Goals proved by only one prover == +-- file ../hello_proof.why +-- theory HelloProof +-- goal G1: Simplify (1.5.4) (0.00) +-- goal G3: Alt-Ergo (0.94) (0.00) == Statistics per prover: number of proofs, time (minimum/maximum/average) in seconds == Alt-Ergo (0.94) : 2 0.00 0.00 0.00 Simplify (1.5.4) : 2 0.00 0.00 0.00 \end{verbatim} } \subsection{Command \texttt{latex}} Command \texttt{latex} produces a summary of the replay under the form of a tabular environment in LaTeX, one tabular for each theory, one per file. The specific options are \begin{description} \item[\texttt{-style \textsl{}}] sets output style (1 or 2, default 1) Option \texttt{-style 2} produces an alternate version of LaTeX output, with a different layout of the tables. \item[\texttt{-o \textsl{}}] indicates where to produce LaTeX files (default: the session directory). \item[\texttt{-longtable}] uses the `longtable' environment instead of `tabular'. \item[\texttt{-e \textsl{}}] produces a table for the given element, which is either a file, a theory or a root goal. The element must be specified using its path in dot notation, \eg \verb|file.theory.goal|. The file produced is named accordingly, \eg \verb|file.theory.goal.tex|. This option can be given several times to produce several tables in one run. When this option is given at least once, the default behavior that is to produce one table per theory is disabled. \end{description} \paragraph{Customizing LaTeX output} The generated LaTeX files contain some macros that must be defined externally. Various definitions can be given to them to customize the output. \begin{description} \item[\texttt{\bs{}provername}] macro with one parameter, a prover name \item[\texttt{\bs{}valid}] macro with one parameter, used where the corresponding prover answers that the goal is valid. The parameter is the time in seconds. \item[\texttt{\bs{}noresult}] macro without parameter, used where no result exists for the corresponding prover \item[\texttt{\bs{}timeout}] macro without parameter, used where the corresponding prover reached the time limit \item[\texttt{\bs{}explanation}] macro with one parameter, the goal name or its explanation \end{description} \begin{figure}[t] \begin{center} \lstinputlisting[basicstyle={\ttfamily\small}]{./replayer_macros.tex} \end{center} \caption{Sample macros for the LaTeX command} \label{fig:custom-latex} \end{figure} \begin{figure}[t] \begin{center} %HEVEA\begin{toimage} \input{HelloProof.tex} %HEVEA\end{toimage} %HEVEA\imageflush \end{center} \caption{LaTeX table produced for the HelloProof example (style 1)} \label{fig:latex} \end{figure} \begin{figure}[t] \begin{center} %HEVEA\begin{toimage} \input{HelloProof-style2.tex} %HEVEA\end{toimage} %HEVEA\imageflush \end{center} \caption{LaTeX table produced for the HelloProof example (style 2)} \label{fig:latexstyle2} \end{figure} Figure~\ref{fig:custom-latex} suggests some definitions for these macros, while Figures~\ref{fig:latex} and~\ref{fig:latexstyle2} show the tables obtained from the HelloProof example of Section~\ref{chap:starting}, respectively with style 1 and 2. \subsection{Command \texttt{html}} This command produces a summary of the proof session in HTML syntax. There are two styles of output: `table' and `simpletree'. The default is `table'. The file generated is named \texttt{why3session.html} and is written in the session directory by default (see option \texttt{-o} to override this default). \begin{figure}[t] %BEGIN LATEX \begin{center} \fbox{\includegraphics[width=0.9\textwidth]{hello_proof.png}} \end{center} %END LATEX \begin{htmlonly} \begin{rawhtml}

Why3 Proof Results for Project "hello_proof"

Theory "HelloProof": not fully verified

ObligationsAlt-Ergo (0.94)Coq (8.3pl4)Simplify (1.5.4)
G1------0.00
G20.00---0.00
split_goal
  1.0.000.430.00
2.0.00---0.00
G30.00---0.00
\end{rawhtml} \end{htmlonly} \caption{HTML table produced for the HelloProof example} \label{fig:html} \end{figure} The style `table' outputs the contents of the session as a table, similar to the LaTeX output above. Figure~\ref{fig:html} is the HTML table produced for the `HelloProof' example, as typically shown in a Web browser. The gray cells filled with \texttt{---} just mean that the prover was not run on the corresponding goal. Green background means the result was ``Valid'', other cases are in orange background. The red background for a goal means that the goal was not proved. The style `simpletree' displays the contents of the session under the form of tree, similar to the tree view in the IDE. It uses only basic HTML tags such as \verb|
    | and \verb|
  • |. Specific options for this command are as follows. \begin{description} \item[\texttt{-{}-style \textsl{