mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
178 lines
9.2 KiB
XML
178 lines
9.2 KiB
XML
<?xml version="1.0" encoding="UTF-8"?>
|
|
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
|
|
"https://www.why3.org/why3session.dtd">
|
|
<why3session shape_version="6">
|
|
<prover id="0" name="CVC5" version="1.0.5" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="1" name="Z3" version="4.12.2" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="2" name="CVC4" version="1.7" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="3" name="Alt-Ergo" version="2.6.2" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="9" name="Z3" version="4.8.10" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="binary_search.mlw"/>
|
|
<theory name="BinarySearch" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="3" timelimit="10"><result status="valid" time="0.050000" steps="231"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchAnyMidPoint" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="3" timelimit="10"><result status="valid" time="0.010000" steps="97"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchBranchless" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="3" timelimit="5"><result status="valid" time="0.033699" steps="333"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchInt32" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="binary_search'vc.0" expl="integer overflow" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="1068"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.020000" steps="989"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.020000" steps="1099"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.3" expl="integer overflow" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="1462"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.4" expl="division by zero" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="1115"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.5" expl="integer overflow" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="3364"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.6" expl="integer overflow" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="3571"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.7" expl="assertion" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="3558"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.8" expl="index in array bounds" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="2629"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.9" expl="integer overflow" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="3967"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.10" expl="loop variant decrease" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="2691"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="2678"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="4607"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.13" expl="index in array bounds" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="2661"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.14" expl="integer overflow" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="3969"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.15" expl="loop variant decrease" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="2715"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.16" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="2709"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.17" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="4703"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.18" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="2818"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.19" expl="exceptional postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="23"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchBoolean" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="3" timelimit="10"><result status="valid" time="0.080000" steps="284"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Complexity" proved="true">
|
|
<goal name="log2'vc" expl="VC for log2" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="29"/></proof>
|
|
</goal>
|
|
<goal name="log2_monotone'vc" expl="VC for log2_monotone" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.060000" steps="136"/></proof>
|
|
</goal>
|
|
<goal name="upper_bound" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.148291" steps="101230"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="binary_search'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="4"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="10"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.2" expl="loop invariant init" proved="true">
|
|
<transf name="compute_in_goal" proved="true" >
|
|
<goal name="binary_search'vc.2.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="17"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="binary_search'vc.3" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="12"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.4" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="66"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.5" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="34"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.6" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="82"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.7" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="71"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.8" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.050000" steps="336"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.9" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="77"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.10" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="66"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="45"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.100000" steps="5568"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.050000" steps="206"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.14" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="71"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.15" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="116"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.16" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="34"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.17" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="26"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
<theory name="TwoDimensional" proved="true">
|
|
<goal name="search'vc" expl="VC for search" proved="true">
|
|
<proof prover="9"><result status="valid" time="0.037675" steps="31396"/></proof>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|