Commit 5553027c authored by Jean-Christophe Filliâtre's avatar Jean-Christophe Filliâtre
Browse files

ported example optimal_replay

one VC is proved only by CVC3 2.4.1, even after bisection
and increased timeout to 20s
parent fe74f428
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="Alt-Ergo" version="0.99.1" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="1" name="CVC3" version="2.4.1" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="2" name="Z3" version="4.3.2" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="3" name="CVC4" version="1.4" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="4" name="Alt-Ergo" version="1.30" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="5" name="Z3" version="3.2" timelimit="5" steplimit="0" memlimit="1000"/>
<file name="../optimal_replay.mlw" expanded="true">
<theory name="OptimalReplay" sum="51d6887fdfe4034bfe77baf9d12fec8f" expanded="true">
<goal name="VC n" expl="VC for n">
<proof prover="4"><result status="valid" time="0.00" steps="1"/></proof>
</goal>
<goal name="VC distance" expl="VC for distance" expanded="true">
<transf name="split_goal_wp" expanded="true">
<goal name="VC distance.1" expl="1. array creation size">
<proof prover="0"><result status="valid" time="0.01" steps="2"/></proof>
</goal>
<goal name="VC distance.2" expl="2. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="3"/></proof>
</goal>
<goal name="VC distance.3" expl="3. array creation size">
<proof prover="0"><result status="valid" time="0.01" steps="5"/></proof>
</goal>
<goal name="VC distance.4" expl="4. loop invariant init">
<proof prover="0"><result status="valid" time="0.01" steps="11"/></proof>
</goal>
<goal name="VC distance.5" expl="5. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="11"/></proof>
</goal>
<goal name="VC distance.6" expl="6. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="28"/></proof>
</goal>
<goal name="VC distance.7" expl="7. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="15"/></proof>
</goal>
<goal name="VC distance.8" expl="8. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="17"/></proof>
</goal>
<goal name="VC distance.9" expl="9. precondition">
<proof prover="0"><result status="valid" time="0.01" steps="17"/></proof>
</goal>
<goal name="VC distance.10" expl="10. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="19"/></proof>
</goal>
<goal name="VC distance.11" expl="11. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="21"/></proof>
</goal>
<goal name="VC distance.12" expl="12. loop variant decrease">
<proof prover="3"><result status="valid" time="0.04"/></proof>
</goal>
<goal name="VC distance.13" expl="13. loop invariant preservation">
<proof prover="0"><result status="valid" time="0.02" steps="28"/></proof>
</goal>
<goal name="VC distance.14" expl="14. loop invariant preservation">
<proof prover="1"><result status="valid" time="0.04"/></proof>
<proof prover="3"><result status="valid" time="0.05"/></proof>
</goal>
<goal name="VC distance.15" expl="15. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="20"/></proof>
</goal>
<goal name="VC distance.16" expl="16. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="20"/></proof>
</goal>
<goal name="VC distance.17" expl="17. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="22"/></proof>
</goal>
<goal name="VC distance.18" expl="18. loop invariant preservation">
<proof prover="1"><result status="valid" time="0.04"/></proof>
<proof prover="2"><result status="valid" time="0.03"/></proof>
<proof prover="3"><result status="valid" time="0.02"/></proof>
<proof prover="5"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC distance.19" expl="19. loop invariant preservation">
<proof prover="1" timelimit="17"><result status="valid" time="0.78"/></proof>
</goal>
<goal name="VC distance.20" expl="20. loop invariant preservation" expanded="true">
<transf name="inline_goal" expanded="true">
<goal name="VC distance.20.1" expl="1. loop invariant preservation" expanded="true">
<transf name="split_goal_wp" expanded="true">
<goal name="VC distance.20.1.1" expl="1. loop invariant preservation">
<proof prover="0" timelimit="36"><result status="valid" time="9.21" steps="2946"/></proof>
</goal>
<goal name="VC distance.20.1.2" expl="2. loop invariant preservation" expanded="true">
<proof prover="1"><result status="valid" time="4.04"/></proof>
<metas
expanded="true">
<ts_pos name="real" arity="0" id="real" ip_theory="BuiltIn">
<ip_library name="why3"/>
<ip_library name="BuiltIn"/>
<ip_qualid name="real"/>
</ts_pos>
<ts_pos name="bool" arity="0" id="bool" ip_theory="Bool">
<ip_library name="why3"/>
<ip_library name="Bool"/>
<ip_qualid name="bool"/>
</ts_pos>
<ts_pos name="tuple0" arity="0" id="tuple0" ip_theory="Tuple0">
<ip_library name="why3"/>
<ip_library name="Tuple0"/>
<ip_qualid name="tuple0"/>
</ts_pos>
<ts_pos name="unit" arity="0" id="unit" ip_theory="Unit">
<ip_library name="why3"/>
<ip_library name="Unit"/>
<ip_qualid name="unit"/>
</ts_pos>
<ts_pos name="map" arity="2" id="map" ip_theory="Map">
<ip_library name="map"/>
<ip_qualid name="map"/>
</ts_pos>
<ls_pos name="infix =" id="infix =" ip_theory="BuiltIn">
<ip_library name="why3"/>
<ip_library name="BuiltIn"/>
<ip_qualid name="infix ="/>
</ls_pos>
<ls_pos name="infix @" id="infix @" ip_theory="HighOrd">
<ip_library name="why3"/>
<ip_library name="HighOrd"/>
<ip_qualid name="infix @"/>
</ls_pos>
<ls_pos name="zero" id="zero" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="zero"/>
</ls_pos>
<ls_pos name="one" id="one" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="one"/>
</ls_pos>
<ls_pos name="prefix -" id="prefix -" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="prefix -"/>
</ls_pos>
<ls_pos name="infix +" id="infix +" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix +"/>
</ls_pos>
<ls_pos name="infix *" id="infix *" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix *"/>
</ls_pos>
<ls_pos name="infix &lt;" id="infix &lt;" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix &lt;"/>
</ls_pos>
<ls_pos name="infix &gt;" id="infix &gt;" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix &gt;"/>
</ls_pos>
<ls_pos name="infix &gt;=" id="infix &gt;=" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix &gt;="/>
</ls_pos>
<ls_pos name="prefix !" id="prefix !" ip_theory="Ref">
<ip_library name="ref"/>
<ip_qualid name="prefix !"/>
</ls_pos>
<ls_pos name="get" id="get" ip_theory="Map">
<ip_library name="map"/>
<ip_qualid name="get"/>
</ls_pos>
<ls_pos name="mixfix []" id="mixfix []" ip_theory="Map">
<ip_library name="map"/>
<ip_qualid name="mixfix []"/>
</ls_pos>
<ls_pos name="mixfix [&lt;-]" id="mixfix [&lt;-]" ip_theory="Map">
<ip_library name="map"/>
<ip_qualid name="mixfix [&lt;-]"/>
</ls_pos>
<ls_pos name="elts" id="elts" ip_theory="Array">
<ip_library name="array"/>
<ip_qualid name="elts"/>
</ls_pos>
<ls_pos name="length" id="length" ip_theory="Array">
<ip_library name="array"/>
<ip_qualid name="length"/>
</ls_pos>
<ls_pos name="mixfix [&lt;-]" id="mixfix [&lt;-]1" ip_theory="Array">
<ip_library name="array"/>
<ip_qualid name="mixfix [&lt;-]"/>
</ls_pos>
<ls_pos name="n" id="n" ip_theory="OptimalReplay">
<ip_qualid name="n"/>
</ls_pos>
<ls_pos name="f" id="f" ip_theory="OptimalReplay">
<ip_qualid name="f"/>
</ls_pos>
<ls_pos name="distance" id="distance" ip_theory="OptimalReplay">
<ip_qualid name="distance"/>
</ls_pos>
<pr_pos name="Assoc" id="Assoc" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Assoc"/>
</pr_pos>
<pr_pos name="Unit_def_l" id="Unit_def_l" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Unit_def_l"/>
</pr_pos>
<pr_pos name="Unit_def_r" id="Unit_def_r" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Unit_def_r"/>
</pr_pos>
<pr_pos name="Inv_def_l" id="Inv_def_l" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Inv_def_l"/>
</pr_pos>
<pr_pos name="Inv_def_r" id="Inv_def_r" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Inv_def_r"/>
</pr_pos>
<pr_pos name="Comm" id="Comm" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Comm"/>
</pr_pos>
<pr_pos name="Assoc" id="Assoc1" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="MulAssoc"/>
<ip_qualid name="Assoc"/>
</pr_pos>
<pr_pos name="Mul_distr_l" id="Mul_distr_l" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Mul_distr_l"/>
</pr_pos>
<pr_pos name="Mul_distr_r" id="Mul_distr_r" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Mul_distr_r"/>
</pr_pos>
<pr_pos name="Comm" id="Comm1" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="MulComm"/>
<ip_qualid name="Comm"/>
</pr_pos>
<pr_pos name="Unitary" id="Unitary" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Unitary"/>
</pr_pos>
<pr_pos name="NonTrivialRing" id="NonTrivialRing" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="NonTrivialRing"/>
</pr_pos>
<pr_pos name="Refl" id="Refl" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Refl"/>
</pr_pos>
<pr_pos name="Trans" id="Trans" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Trans"/>
</pr_pos>
<pr_pos name="Antisymm" id="Antisymm" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Antisymm"/>
</pr_pos>
<pr_pos name="Total" id="Total" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="Total"/>
</pr_pos>
<pr_pos name="ZeroLessOne" id="ZeroLessOne" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="ZeroLessOne"/>
</pr_pos>
<pr_pos name="CompatOrderAdd" id="CompatOrderAdd" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="CompatOrderAdd"/>
</pr_pos>
<pr_pos name="CompatOrderMult" id="CompatOrderMult" ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="CompatOrderMult"/>
</pr_pos>
<pr_pos name="mixfix [&lt;-]_spec" id="mixfix [&lt;-]_spec"
ip_theory="Array">
<ip_library name="array"/>
<ip_qualid name="mixfix [&lt;-]_spec"/>
</pr_pos>
<pr_pos name="n_def" id="n_def" ip_theory="OptimalReplay">
<ip_qualid name="n_def"/>
</pr_pos>
<pr_pos name="f_spec" id="f_spec" ip_theory="OptimalReplay">
<ip_qualid name="f_spec"/>
</pr_pos>
<meta name="remove_logic">
<meta_arg_ls id="infix ="/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="infix @"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="zero"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="one"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="prefix -"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="infix +"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="infix *"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="infix &lt;"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="infix &gt;"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="infix &gt;="/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="prefix !"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="get"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="mixfix []"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="mixfix [&lt;-]"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="elts"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="length"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="mixfix [&lt;-]1"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="n"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="f"/>
</meta>
<meta name="remove_logic">
<meta_arg_ls id="distance"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Assoc"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Unit_def_l"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Unit_def_r"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Inv_def_l"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Inv_def_r"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Comm"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Assoc1"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Mul_distr_l"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Mul_distr_r"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Comm1"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Unitary"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="NonTrivialRing"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Refl"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Trans"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Antisymm"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="Total"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="ZeroLessOne"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="CompatOrderAdd"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="CompatOrderMult"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="mixfix [&lt;-]_spec"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="n_def"/>
</meta>
<meta name="remove_prop">
<meta_arg_pr id="f_spec"/>
</meta>
<meta name="remove_type">
<meta_arg_ts id="real"/>
</meta>
<meta name="remove_type">
<meta_arg_ts id="bool"/>
</meta>
<meta name="remove_type">
<meta_arg_ts id="tuple0"/>
</meta>
<meta name="remove_type">
<meta_arg_ts id="unit"/>
</meta>
<meta name="remove_type">
<meta_arg_ts id="map"/>
</meta>
<goal name="VC distance.20.1.2" expl="2. loop invariant preservation" expanded="true">
<transf name="eliminate_builtin" expanded="true">
<goal name="VC distance.20.1.2.1" expl="1. loop invariant preservation" expanded="true">
<proof prover="1"><result status="valid" time="1.94"/></proof>
</goal>
</transf>
</goal>
</metas>
</goal>
</transf>
</goal>
</transf>
</goal>
<goal name="VC distance.21" expl="21. assertion">
<proof prover="3"><result status="valid" time="0.06"/></proof>
</goal>
<goal name="VC distance.22" expl="22. assertion">
<proof prover="0" timelimit="36"><result status="valid" time="0.00" steps="17"/></proof>
</goal>
<goal name="VC distance.23" expl="23. out of loop bounds">
<proof prover="0"><result status="valid" time="0.02" steps="6"/></proof>
</goal>
</transf>
</goal>
</theory>
</file>
</why3session>
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="Alt-Ergo" version="0.99.1" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="1" name="CVC3" version="2.4.1" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="2" name="Z3" version="4.3.2" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="3" name="CVC4" version="1.4" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="5" name="Z3" version="3.2" timelimit="5" steplimit="0" memlimit="1000"/>
<file name="../optimal_replay.mlw" expanded="true">
<theory name="OptimalReplay" sum="af50008bb1221478dad330d6726d16c3" expanded="true">
<goal name="WP_parameter distance" expl="VC for distance" expanded="true">
<transf name="split_goal_wp" expanded="true">
<goal name="WP_parameter distance.1" expl="1. array creation size">
<proof prover="0"><result status="valid" time="0.01" steps="2"/></proof>
</goal>
<goal name="WP_parameter distance.2" expl="2. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="5"/></proof>
</goal>
<goal name="WP_parameter distance.3" expl="3. array creation size">
<proof prover="0"><result status="valid" time="0.01" steps="8"/></proof>
</goal>
<goal name="WP_parameter distance.4" expl="4. assertion">
<proof prover="0"><result status="valid" time="0.01" steps="11"/></proof>
</goal>
<goal name="WP_parameter distance.5" expl="5. assertion">
<proof prover="0"><result status="valid" time="0.02" steps="30"/></proof>
</goal>
<goal name="WP_parameter distance.6" expl="6. loop invariant init">
<proof prover="0"><result status="valid" time="0.01" steps="12"/></proof>
</goal>
<goal name="WP_parameter distance.7" expl="7. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="12"/></proof>
</goal>
<goal name="WP_parameter distance.8" expl="8. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="24"/></proof>
</goal>
<goal name="WP_parameter distance.9" expl="9. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="17"/></proof>
</goal>
<goal name="WP_parameter distance.10" expl="10. loop invariant init">
<proof prover="0"><result status="valid" time="0.02" steps="17"/></proof>
</goal>
<goal name="WP_parameter distance.11" expl="11. type invariant">
<proof prover="0"><result status="valid" time="0.01" steps="19"/></proof>
</goal>
<goal name="WP_parameter distance.12" expl="12. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="21"/></proof>
</goal>
<goal name="WP_parameter distance.13" expl="13. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="23"/></proof>
</goal>
<goal name="WP_parameter distance.14" expl="14. loop invariant preservation">
<proof prover="1"><result status="valid" time="0.04"/></proof>
<proof prover="2"><result status="valid" time="0.03"/></proof>
<proof prover="3"><result status="valid" time="0.02"/></proof>
<proof prover="5"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="WP_parameter distance.15" expl="15. loop invariant preservation">
<proof prover="1" timelimit="17"><result status="valid" time="0.04"/></proof>
<proof prover="5" timelimit="17"><result status="valid" time="0.39"/></proof>
</goal>
<goal name="WP_parameter distance.16" expl="16. loop variant decrease">
<proof prover="0"><result status="valid" time="0.11" steps="177"/></proof>
</goal>
<goal name="WP_parameter distance.17" expl="17. type invariant">
<proof prover="0"><result status="valid" time="0.02" steps="22"/></proof>
</goal>
<goal name="WP_parameter distance.18" expl="18. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="22"/></proof>
</goal>
<goal name="WP_parameter distance.19" expl="19. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="23"/></proof>
</goal>
<goal name="WP_parameter distance.20" expl="20. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="26"/></proof>
</goal>
<goal name="WP_parameter distance.21" expl="21. loop invariant preservation">
<proof prover="0"><result status="valid" time="0.02" steps="28"/></proof>
</goal>
<goal name="WP_parameter distance.22" expl="22. loop invariant preservation">
<proof prover="1"><result status="valid" time="0.28"/></proof>
<proof prover="3"><result status="valid" time="0.05"/></proof>
</goal>
<goal name="WP_parameter distance.23" expl="23. loop invariant preservation">
<transf name="inline_goal">
<goal name="WP_parameter distance.23.1" expl="1. loop invariant preservation">
<transf name="split_goal_wp">
<goal name="WP_parameter distance.23.1.1" expl="1. loop invariant preservation">
<proof prover="0" timelimit="36"><result status="valid" time="0.12" steps="79"/></proof>
</goal>
<goal name="WP_parameter distance.23.1.2" expl="2. loop invariant preservation">
<proof prover="3" timelimit="36"><result status="valid" time="0.17"/></proof>
</goal>
</transf>
</goal>
</transf>
</goal>
<goal name="WP_parameter distance.24" expl="24. assertion">
<proof prover="0"><result status="valid" time="0.02" steps="38"/></proof>
</goal>
<goal name="WP_parameter distance.25" expl="25. assertion">
<proof prover="0" timelimit="36"><result status="valid" time="0.00" steps="18"/></proof>
</goal>
</transf>
</goal>
</theory>
</file>
</why3session>
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment