mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
793 lines
45 KiB
XML
793 lines
45 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="Z3" version="4.8.6" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="3" name="Alt-Ergo" version="2.6.0" timelimit="5" steplimit="0" memlimit="1000"/>
|
|
<prover id="4" name="CVC4" version="1.5" timelimit="5" steplimit="0" memlimit="4000"/>
|
|
<prover id="6" name="CVC4" version="1.8" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="7" name="CVC5" version="1.0.2" timelimit="5" steplimit="0" memlimit="1000"/>
|
|
<prover id="8" name="Z3" version="4.8.10" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="maximum_subarray.mlw"/>
|
|
<theory name="Algo1" proved="true">
|
|
<goal name="maximum_subarray'vc" expl="VC for maximum_subarray" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.593460" steps="1295074"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Algo2" proved="true">
|
|
<goal name="maximum_subarray'vc" expl="VC for maximum_subarray" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.072954" steps="207282"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Algo3" proved="true">
|
|
<goal name="maximum_subarray_rec'vc" expl="VC for maximum_subarray_rec" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="maximum_subarray_rec'vc.0" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="22"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.1" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="11"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.2" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="3"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="45"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="23"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.5" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="9"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.6" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.7" expl="assertion" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="79"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.8" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="19"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.9" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.070000" steps="103965"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.10" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="19"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="18"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.12" expl="loop invariant preservation" proved="true">
|
|
<transf name="inline_all" proved="true" >
|
|
<goal name="maximum_subarray_rec'vc.12.0" expl="loop invariant preservation" proved="true">
|
|
<proof prover="4" memlimit="1000"><result status="valid" time="0.050000" steps="12732"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="18"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.14" expl="assertion" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.15" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="16"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.16" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="41"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.17" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="0"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.18" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="40"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.19" expl="assertion" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="103"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.20" expl="assertion" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="132"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.21" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="46"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.22" expl="loop invariant preservation" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="maximum_subarray_rec'vc.22.0" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="82704"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.23" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.24" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.25" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.051275" steps="114860"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.26" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.27" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="56"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.28" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.29" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="38"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.30" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="114"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.31" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="52"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.32" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="102"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.33" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="52"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.34" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="101"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.35" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="38"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.36" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="114"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.37" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="52"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.38" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="99"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.39" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="52"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.40" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="100"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.41" expl="out of loop bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="27"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray_rec'vc.42" expl="out of loop bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="26"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc" expl="VC for maximum_subarray" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="33"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Algo4" proved="true">
|
|
<goal name="maximum_subarray'vc" expl="VC for maximum_subarray" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="maximum_subarray'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="25"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="20"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="12"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="15"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.4" expl="index in array bounds" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="28"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.5" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.068899" steps="715"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.6" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.050000" steps="96461"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.7" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="46"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.8" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="62"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.9" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="34"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.10" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000" steps="83426"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.100000" steps="703"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="48493"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.13" expl="index in array bounds" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="28"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.020000" steps="109"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.15" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="56707"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.16" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.010000" steps="44"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.17" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.010000" steps="58"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.18" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="32"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.19" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="45789"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.20" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.010000" steps="92"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.21" expl="loop invariant preservation" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.030000" steps="40514"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.22" expl="postcondition" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="22"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.23" expl="postcondition" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.010000" steps="61"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.24" expl="out of loop bounds" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.000000" steps="8"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Algo5" proved="true">
|
|
<goal name="maximum_subarray'vc" expl="VC for maximum_subarray" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="maximum_subarray'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.022478" steps="14755"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.033197" steps="14976"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.025278" steps="17217"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.012300" steps="1238"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.4" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.030031" steps="17659"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.5" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.038008" steps="26988"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.6" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.030833" steps="25149"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.7" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.034215" steps="40903"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.8" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.026135" steps="11135"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.9" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.040333" steps="39875"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.10" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.028901" steps="25002"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.040873" steps="35956"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.034304" steps="20141"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.043041" steps="40285"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.035423" steps="36833"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.15" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.030609" steps="30171"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.16" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.025429" steps="11103"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.17" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.040634" steps="39990"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.18" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.033971" steps="35767"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.19" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.037923" steps="42913"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.20" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.026726" steps="20217"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.21" expl="postcondition" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.027683" steps="18182"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.22" expl="postcondition" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.032597" steps="26000"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.23" expl="out of loop bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.023355" steps="14957"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BoundedIntegers" proved="true">
|
|
<goal name="maximum_subarray'vc" expl="VC for maximum_subarray" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="maximum_subarray'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="45"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="18"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="7"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="17"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.4" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="18"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.5" expl="integer overflow" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="50"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.6" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="40"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.7" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.179113" steps="1083"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.8" expl="loop invariant preservation" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="maximum_subarray'vc.8.0" expl="loop invariant preservation" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="maximum_subarray'vc.8.0.0" expl="loop invariant preservation" proved="true">
|
|
<proof prover="7" timelimit="10" memlimit="4000"><result status="valid" time="1.922379" steps="158950"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.9" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.040000" steps="53"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.10" expl="loop invariant preservation" proved="true">
|
|
<transf name="split_all_full" proved="true" >
|
|
<goal name="maximum_subarray'vc.10.0" expl="loop invariant preservation" proved="true">
|
|
<transf name="introduce_premises" proved="true" >
|
|
<goal name="maximum_subarray'vc.10.0.0" expl="loop invariant preservation" proved="true">
|
|
<transf name="inline_goal" proved="true" >
|
|
<goal name="maximum_subarray'vc.10.0.0.0" expl="loop invariant preservation" proved="true">
|
|
<proof prover="4" timelimit="30"><result status="valid" time="0.077581" steps="18044"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.11" expl="integer overflow" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="51"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.12" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="40"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.050000" steps="42"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="7"><result status="valid" time="2.297238" steps="198598"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.15" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.104547" steps="807"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.16" expl="loop invariant preservation" proved="true">
|
|
<proof prover="7"><result status="valid" time="0.289727" steps="31032"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.17" expl="assertion" proved="true">
|
|
<proof prover="3" timelimit="15"><result status="valid" time="0.010000" steps="47"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.18" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="20"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.19" expl="integer overflow" proved="true">
|
|
<proof prover="3" timelimit="15"><result status="valid" time="0.092192" steps="231"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.20" expl="integer overflow" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.040000" steps="65"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.21" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="46"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.22" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.060000" steps="271"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.23" expl="loop invariant preservation" proved="true">
|
|
<proof prover="7"><result status="valid" time="1.135423" steps="90914"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.24" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.050000" steps="58"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.25" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="120"><result status="valid" time="0.033492" steps="95"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.26" expl="integer overflow" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.050000" steps="65"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.27" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="46"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.28" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="48"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.29" expl="loop invariant preservation" proved="true">
|
|
<proof prover="7"><result status="valid" time="5.109066" steps="336290"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.30" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="264"/></proof>
|
|
<proof prover="8"><result status="valid" time="0.057270" steps="38819"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.31" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="60"><result status="valid" time="1.311377" steps="11093"/></proof>
|
|
<proof prover="7" timelimit="1"><result status="valid" time="0.313413" steps="22709"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.32" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="19"/></proof>
|
|
<proof prover="8"><result status="valid" time="0.034109" steps="21792"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.33" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="38"/></proof>
|
|
<proof prover="8"><result status="valid" time="0.034657" steps="22173"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
<theory name="MaxProd" proved="true">
|
|
<goal name="prod'vc" expl="VC for prod" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.039940" steps="6272"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc" expl="VC for maximum_subarray" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="maximum_subarray'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.026567" steps="6652"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.028479" steps="7069"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.022208" steps="616"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.018063" steps="626"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.020403" steps="652"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.5" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.022984" steps="7563"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.6" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.023679" steps="8065"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.7" expl="loop invariant init" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.018031" steps="775"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.8" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.030312" steps="11712"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.9" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.020952" steps="1491"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.10" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.10.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.030494" steps="1536"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.10.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.016028" steps="44"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.019296" steps="1560"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.017421" steps="1626"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.019946" steps="1690"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.018547" steps="1832"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.15" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.020055" steps="1923"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.16" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.015973" steps="2029"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.17" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.023946" steps="14292"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.18" expl="loop invariant preservation" proved="true">
|
|
<proof prover="7" timelimit="1"><result status="valid" time="0.141545" steps="6286"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.19" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.021871" steps="1533"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.20" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.019134" steps="1599"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.21" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.013921" steps="1663"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.22" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.031899" steps="16353"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.23" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.031193" steps="17060"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.24" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.025654" steps="16366"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.25" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.031355" steps="12978"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.26" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.024240" steps="13115"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.27" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.027762" steps="13169"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.28" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.026068" steps="14594"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.29" expl="loop invariant preservation" proved="true">
|
|
<proof prover="6"><result status="valid" time="0.700312" steps="90731"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.30" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.035130" steps="22246"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.31" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.050259" steps="45511"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.32" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.119035" steps="57274"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.33" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.034736" steps="29104"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.34" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.019432" steps="18011"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.35" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.026643" steps="9782"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.36" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.033915" steps="19246"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.37" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.37.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.027799" steps="14596"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.37.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.112921" steps="1389"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.38" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.032429" steps="21400"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.39" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3" timelimit="1"><result status="valid" time="0.046717" steps="367"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.40" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.40.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.033250" steps="17130"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.40.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.117174" steps="1503"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.41" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.036519" steps="30357"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.42" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.030091" steps="20885"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.43" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.032260" steps="17274"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.44" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.024442" steps="13243"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.45" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.031962" steps="13243"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.46" expl="loop invariant preservation" proved="true">
|
|
<proof prover="7" timelimit="1"><result status="valid" time="0.117958" steps="4174"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.47" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.47.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.029453" steps="15365"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.47.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="6"><result status="valid" time="0.825936" steps="102099"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.48" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.099518" steps="24241"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.49" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.042216" steps="17319"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.50" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.50.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.033353" steps="16906"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.50.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="8" timelimit="5"><result status="valid" time="0.050115" steps="97810"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.51" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.029960" steps="23831"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.52" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.028760" steps="28218"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.53" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.021182" steps="10320"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.54" expl="loop invariant preservation" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="maximum_subarray'vc.54.0" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.016440" steps="5433"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.54.1" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.023699" steps="13488"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.54.2" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.022749" steps="14325"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.54.3" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.028114" steps="16871"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.55" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.55.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.036233" steps="15192"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.55.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="7" timelimit="1"><result status="valid" time="1.018362" steps="113196"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.56" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.021933" steps="18599"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.57" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.028734" steps="17159"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.58" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.58.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.026347" steps="16738"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.58.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="7"><result status="valid" time="1.487969" steps="190206"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.59" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.033591" steps="24996"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.60" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.046820" steps="37088"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.61" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.025587" steps="18201"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.62" expl="index in array bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.027059" steps="12823"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.63" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.018955" steps="1545"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.64" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.023265" steps="1581"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.65" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.024613" steps="1629"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.66" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.011216" steps="1707"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.67" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.018111" steps="1828"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.68" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.019757" steps="1928"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.69" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.018593" steps="1936"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.70" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.019625" steps="2042"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.71" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.024221" steps="13908"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.72" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.72.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.023472" steps="7999"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.72.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.025944" steps="18509"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.73" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.021655" steps="16570"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.74" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.016302" steps="15928"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.75" expl="loop invariant preservation" proved="true">
|
|
<transf name="case" proved="true" arg1="(l=i+1)">
|
|
<goal name="maximum_subarray'vc.75.0" expl="true case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.024646" steps="8851"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.75.1" expl="false case (loop invariant preservation)" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.037605" steps="70382"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.76" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.029671" steps="19258"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.77" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.027517" steps="18222"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.78" expl="loop invariant preservation" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.026063" steps="17550"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.79" expl="postcondition" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.016461" steps="12538"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.80" expl="postcondition" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.016648" steps="12686"/></proof>
|
|
</goal>
|
|
<goal name="maximum_subarray'vc.81" expl="out of loop bounds" proved="true">
|
|
<proof prover="8"><result status="valid" time="0.022353" steps="7587"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|