mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
223 lines
12 KiB
XML
223 lines
12 KiB
XML
<?xml version="1.0" encoding="UTF-8"?>
|
|
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
|
|
"http://why3.lri.fr/why3session.dtd">
|
|
<why3session shape_version="6">
|
|
<prover id="1" name="Z3" version="4.6.0" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="2" name="Alt-Ergo" version="2.0.0" timelimit="36" steplimit="0" memlimit="1000"/>
|
|
<prover id="3" name="CVC4" version="1.7" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="5" name="Alt-Ergo" version="2.3.0" timelimit="5" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="insertion_sort.mlw"/>
|
|
<theory name="InsertionSort" proved="true">
|
|
<goal name="insertion_sort'vc" expl="VC for insertion_sort" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="insertion_sort'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="12"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.1" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="7"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="7"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.06" steps="135"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="32"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.5" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="10"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.6" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="12"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.7" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="21"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.8" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="12"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.9" expl="assertion" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="43"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.10" expl="loop variant decrease" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="17"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.88" steps="811"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.13" steps="191"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.03" steps="109"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.15" expl="assertion" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="38"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.16" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="12"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.17" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.13" steps="120"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.18" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="9832"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.19" expl="postcondition" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="6"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.20" expl="out of loop bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="13"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="test1'vc" expl="VC for test1" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.00" steps="11"/></proof>
|
|
</goal>
|
|
<goal name="test2'vc" expl="VC for test2" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="38"/></proof>
|
|
</goal>
|
|
<goal name="bench'vc" expl="VC for bench" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="36"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="InsertionSortGen" proved="true">
|
|
<goal name="insertion_sort'vc" expl="VC for insertion_sort" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="insertion_sort'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="10282"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="31422"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.2" expl="index in array bounds" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="31511"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="31909"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="2" timelimit="1"><result status="valid" time="0.04" steps="135"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.5" expl="loop invariant init" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.40" steps="824875"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.6" expl="loop invariant init" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="33264"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.7" expl="index in array bounds" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="35088"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.8" expl="index in array bounds" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="35550"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.9" expl="index in array bounds" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="35543"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.10" expl="assertion" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.04" steps="49998"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.11" expl="loop variant decrease" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="44641"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="45329"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2" timelimit="1"><result status="valid" time="0.62" steps="816"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.03" steps="64499"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.15" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.05" steps="75035"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.16" expl="assertion" proved="true">
|
|
<proof prover="2" timelimit="1"><result status="valid" time="0.01" steps="45"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.17" expl="index in array bounds" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="35908"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.18" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1" timelimit="5"><result status="valid" time="0.03" steps="53588"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.19" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.03" steps="44770"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.20" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="10141"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.21" expl="postcondition" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="31187"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.22" expl="out of loop bounds" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.02" steps="31914"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
<theory name="InsertionSortSwaps" proved="true">
|
|
<goal name="insertion_sort'vc" expl="VC for insertion_sort" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="insertion_sort'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="8792"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="9659"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.02" steps="9206"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="8914"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="10156"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.5" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="9869"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.6" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="9883"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.7" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="10144"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.8" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="9633"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.9" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="10213"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.10" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.06" steps="12414"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="5"><result status="valid" time="0.10" steps="449"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="13814"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="9747"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.14" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="9828"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.15" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.02" steps="8787"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.16" expl="out of loop bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="10148"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|