1 <?xml version="1.0" encoding="UTF-8"?>
2 <!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
3 "https://www.why3.org/why3session.dtd">
4 <why3session shape_version="6">
5 <prover id="0" name="Alt-Ergo" version="2.1.0" timelimit="5" steplimit="0" memlimit="1000"/>
6 <prover id="2" name="Z3" version="4.12.2" timelimit="5" steplimit="0" memlimit="1000"/>
7 <prover id="4" name="CVC3" version="2.4.1" timelimit="5" steplimit="0" memlimit="1000"/>
8 <prover id="5" name="CVC4" version="1.5" timelimit="5" steplimit="0" memlimit="1000"/>
9 <file format="whyml" proved="true">
10 <path name=".."/><path name="verifythis_2017_pair_insertion_sort.mlw"/>
11 <theory name="Challenge1" proved="true">
12 <goal name="pair_insertion_sort'vc" expl="VC for pair_insertion_sort" proved="true">
13 <transf name="split_goal_right" proved="true" >
14 <goal name="pair_insertion_sort'vc.0" expl="loop invariant init" proved="true">
15 <proof prover="0"><result status="valid" time="0.000000" steps="2"/></proof>
17 <goal name="pair_insertion_sort'vc.1" expl="loop invariant init" proved="true">
18 <proof prover="0"><result status="valid" time="0.000000" steps="3"/></proof>
20 <goal name="pair_insertion_sort'vc.2" expl="loop invariant init" proved="true">
21 <proof prover="0"><result status="valid" time="0.010000" steps="7"/></proof>
23 <goal name="pair_insertion_sort'vc.3" expl="index in array bounds" proved="true">
24 <proof prover="0"><result status="valid" time="0.000000" steps="10"/></proof>
26 <goal name="pair_insertion_sort'vc.4" expl="index in array bounds" proved="true">
27 <proof prover="0"><result status="valid" time="0.000000" steps="10"/></proof>
29 <goal name="pair_insertion_sort'vc.5" expl="loop invariant init" proved="true">
30 <proof prover="0"><result status="valid" time="0.000000" steps="16"/></proof>
32 <goal name="pair_insertion_sort'vc.6" expl="loop invariant init" proved="true">
33 <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
35 <goal name="pair_insertion_sort'vc.7" expl="loop invariant init" proved="true">
36 <proof prover="0"><result status="valid" time="0.010000" steps="22"/></proof>
38 <goal name="pair_insertion_sort'vc.8" expl="loop invariant init" proved="true">
39 <proof prover="0"><result status="valid" time="0.000000" steps="18"/></proof>
41 <goal name="pair_insertion_sort'vc.9" expl="loop invariant init" proved="true">
42 <proof prover="0"><result status="valid" time="0.000000" steps="18"/></proof>
44 <goal name="pair_insertion_sort'vc.10" expl="loop invariant init" proved="true">
45 <proof prover="0"><result status="valid" time="0.150000" steps="314"/></proof>
47 <goal name="pair_insertion_sort'vc.11" expl="index in array bounds" proved="true">
48 <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
50 <goal name="pair_insertion_sort'vc.12" expl="index in array bounds" proved="true">
51 <proof prover="0"><result status="valid" time="0.000000" steps="30"/></proof>
53 <goal name="pair_insertion_sort'vc.13" expl="index in array bounds" proved="true">
54 <proof prover="0"><result status="valid" time="0.000000" steps="30"/></proof>
56 <goal name="pair_insertion_sort'vc.14" expl="assertion" proved="true">
57 <proof prover="0"><result status="valid" time="0.010000" steps="117"/></proof>
59 <goal name="pair_insertion_sort'vc.15" expl="assertion" proved="true">
60 <proof prover="0"><result status="valid" time="0.050000" steps="220"/></proof>
62 <goal name="pair_insertion_sort'vc.16" expl="assertion" proved="true">
63 <proof prover="0"><result status="valid" time="0.100000" steps="389"/></proof>
65 <goal name="pair_insertion_sort'vc.17" expl="loop variant decrease" proved="true">
66 <proof prover="0"><result status="valid" time="0.000000" steps="44"/></proof>
68 <goal name="pair_insertion_sort'vc.18" expl="loop invariant preservation" proved="true">
69 <proof prover="0"><result status="valid" time="0.000000" steps="44"/></proof>
71 <goal name="pair_insertion_sort'vc.19" expl="loop invariant preservation" proved="true">
72 <proof prover="0"><result status="valid" time="0.070000" steps="311"/></proof>
74 <goal name="pair_insertion_sort'vc.20" expl="loop invariant preservation" proved="true">
75 <proof prover="0"><result status="valid" time="0.160000" steps="381"/></proof>
77 <goal name="pair_insertion_sort'vc.21" expl="loop invariant preservation" proved="true">
78 <proof prover="0"><result status="valid" time="0.240000" steps="380"/></proof>
80 <goal name="pair_insertion_sort'vc.22" expl="loop invariant preservation" proved="true">
81 <proof prover="0"><result status="valid" time="0.020000" steps="125"/></proof>
83 <goal name="pair_insertion_sort'vc.23" expl="loop invariant preservation" proved="true">
84 <proof prover="4"><result status="valid" time="0.100000"/></proof>
86 <goal name="pair_insertion_sort'vc.24" expl="index in array bounds" proved="true">
87 <proof prover="0"><result status="valid" time="0.010000" steps="26"/></proof>
89 <goal name="pair_insertion_sort'vc.25" expl="loop invariant init" proved="true">
90 <proof prover="0"><result status="valid" time="0.010000" steps="32"/></proof>
92 <goal name="pair_insertion_sort'vc.26" expl="loop invariant init" proved="true">
93 <proof prover="0"><result status="valid" time="0.030000" steps="126"/></proof>
95 <goal name="pair_insertion_sort'vc.27" expl="loop invariant init" proved="true">
96 <proof prover="0"><result status="valid" time="0.040000" steps="145"/></proof>
98 <goal name="pair_insertion_sort'vc.28" expl="loop invariant init" proved="true">
99 <proof prover="0"><result status="valid" time="0.080000" steps="190"/></proof>
101 <goal name="pair_insertion_sort'vc.29" expl="loop invariant init" proved="true">
102 <proof prover="0"><result status="valid" time="0.010000" steps="69"/></proof>
104 <goal name="pair_insertion_sort'vc.30" expl="loop invariant init" proved="true">
105 <proof prover="0"><result status="valid" time="3.340000" steps="2040"/></proof>
107 <goal name="pair_insertion_sort'vc.31" expl="index in array bounds" proved="true">
108 <proof prover="0"><result status="valid" time="0.010000" steps="42"/></proof>
110 <goal name="pair_insertion_sort'vc.32" expl="index in array bounds" proved="true">
111 <proof prover="0"><result status="valid" time="0.010000" steps="46"/></proof>
113 <goal name="pair_insertion_sort'vc.33" expl="index in array bounds" proved="true">
114 <proof prover="0"><result status="valid" time="0.010000" steps="46"/></proof>
116 <goal name="pair_insertion_sort'vc.34" expl="assertion" proved="true">
117 <proof prover="0"><result status="valid" time="0.020000" steps="163"/></proof>
119 <goal name="pair_insertion_sort'vc.35" expl="loop variant decrease" proved="true">
120 <proof prover="0"><result status="valid" time="0.010000" steps="56"/></proof>
122 <goal name="pair_insertion_sort'vc.36" expl="loop invariant preservation" proved="true">
123 <proof prover="0"><result status="valid" time="0.010000" steps="56"/></proof>
125 <goal name="pair_insertion_sort'vc.37" expl="loop invariant preservation" proved="true">
126 <proof prover="0"><result status="valid" time="0.050000" steps="236"/></proof>
128 <goal name="pair_insertion_sort'vc.38" expl="loop invariant preservation" proved="true">
129 <proof prover="0"><result status="valid" time="0.080000" steps="294"/></proof>
131 <goal name="pair_insertion_sort'vc.39" expl="loop invariant preservation" proved="true">
132 <proof prover="0"><result status="valid" time="0.140000" steps="283"/></proof>
134 <goal name="pair_insertion_sort'vc.40" expl="loop invariant preservation" proved="true">
135 <proof prover="0"><result status="valid" time="0.020000" steps="119"/></proof>
137 <goal name="pair_insertion_sort'vc.41" expl="loop invariant preservation" proved="true">
138 <proof prover="2"><result status="valid" time="0.020000" steps="63939"/></proof>
139 <proof prover="5"><result status="valid" time="0.090000" steps="27205"/></proof>
141 <goal name="pair_insertion_sort'vc.42" expl="index in array bounds" proved="true">
142 <proof prover="0"><result status="valid" time="0.010000" steps="42"/></proof>
144 <goal name="pair_insertion_sort'vc.43" expl="loop variant decrease" proved="true">
145 <proof prover="0"><result status="valid" time="0.010000" steps="50"/></proof>
147 <goal name="pair_insertion_sort'vc.44" expl="loop invariant preservation" proved="true">
148 <proof prover="0"><result status="valid" time="0.010000" steps="50"/></proof>
150 <goal name="pair_insertion_sort'vc.45" expl="loop invariant preservation" proved="true">
151 <proof prover="0"><result status="valid" time="0.330000" steps="1437"/></proof>
153 <goal name="pair_insertion_sort'vc.46" expl="loop invariant preservation" proved="true">
154 <proof prover="0"><result status="valid" time="0.020000" steps="52"/></proof>
156 <goal name="pair_insertion_sort'vc.47" expl="assertion" proved="true">
157 <proof prover="0"><result status="valid" time="0.020000" steps="74"/></proof>
159 <goal name="pair_insertion_sort'vc.48" expl="loop invariant init" proved="true">
160 <proof prover="0"><result status="valid" time="0.000000" steps="14"/></proof>
162 <goal name="pair_insertion_sort'vc.49" expl="loop invariant init" proved="true">
163 <proof prover="0"><result status="valid" time="0.000000" steps="24"/></proof>
165 <goal name="pair_insertion_sort'vc.50" expl="loop invariant init" proved="true">
166 <proof prover="0"><result status="valid" time="0.010000" steps="20"/></proof>
168 <goal name="pair_insertion_sort'vc.51" expl="loop invariant init" proved="true">
169 <proof prover="0"><result status="valid" time="0.000000" steps="16"/></proof>
171 <goal name="pair_insertion_sort'vc.52" expl="loop invariant init" proved="true">
172 <proof prover="0"><result status="valid" time="0.000000" steps="16"/></proof>
174 <goal name="pair_insertion_sort'vc.53" expl="loop invariant init" proved="true">
175 <proof prover="0"><result status="valid" time="0.020000" steps="80"/></proof>
177 <goal name="pair_insertion_sort'vc.54" expl="index in array bounds" proved="true">
178 <proof prover="0"><result status="valid" time="0.000000" steps="24"/></proof>
180 <goal name="pair_insertion_sort'vc.55" expl="index in array bounds" proved="true">
181 <proof prover="0"><result status="valid" time="0.000000" steps="28"/></proof>
183 <goal name="pair_insertion_sort'vc.56" expl="index in array bounds" proved="true">
184 <proof prover="0"><result status="valid" time="0.000000" steps="28"/></proof>
186 <goal name="pair_insertion_sort'vc.57" expl="assertion" proved="true">
187 <proof prover="0"><result status="valid" time="0.010000" steps="158"/></proof>
189 <goal name="pair_insertion_sort'vc.58" expl="assertion" proved="true">
190 <proof prover="0"><result status="valid" time="0.040000" steps="309"/></proof>
192 <goal name="pair_insertion_sort'vc.59" expl="assertion" proved="true">
193 <proof prover="0"><result status="valid" time="0.130000" steps="494"/></proof>
195 <goal name="pair_insertion_sort'vc.60" expl="loop variant decrease" proved="true">
196 <proof prover="0"><result status="valid" time="0.000000" steps="42"/></proof>
198 <goal name="pair_insertion_sort'vc.61" expl="loop invariant preservation" proved="true">
199 <proof prover="0"><result status="valid" time="0.010000" steps="42"/></proof>
201 <goal name="pair_insertion_sort'vc.62" expl="loop invariant preservation" proved="true">
202 <proof prover="0"><result status="valid" time="0.080000" steps="364"/></proof>
204 <goal name="pair_insertion_sort'vc.63" expl="loop invariant preservation" proved="true">
205 <proof prover="0"><result status="valid" time="0.280000" steps="458"/></proof>
207 <goal name="pair_insertion_sort'vc.64" expl="loop invariant preservation" proved="true">
208 <proof prover="0"><result status="valid" time="0.320000" steps="457"/></proof>
210 <goal name="pair_insertion_sort'vc.65" expl="loop invariant preservation" proved="true">
211 <proof prover="0"><result status="valid" time="0.120000" steps="133"/></proof>
213 <goal name="pair_insertion_sort'vc.66" expl="loop invariant preservation" proved="true">
214 <proof prover="4"><result status="valid" time="0.110000"/></proof>
216 <goal name="pair_insertion_sort'vc.67" expl="index in array bounds" proved="true">
217 <proof prover="0"><result status="valid" time="0.010000" steps="24"/></proof>
219 <goal name="pair_insertion_sort'vc.68" expl="loop invariant init" proved="true">
220 <proof prover="0"><result status="valid" time="0.000000" steps="30"/></proof>
222 <goal name="pair_insertion_sort'vc.69" expl="loop invariant init" proved="true">
223 <proof prover="0"><result status="valid" time="0.040000" steps="179"/></proof>
225 <goal name="pair_insertion_sort'vc.70" expl="loop invariant init" proved="true">
226 <proof prover="0"><result status="valid" time="0.020000" steps="222"/></proof>
228 <goal name="pair_insertion_sort'vc.71" expl="loop invariant init" proved="true">
229 <proof prover="0"><result status="valid" time="0.200000" steps="289"/></proof>
231 <goal name="pair_insertion_sort'vc.72" expl="loop invariant init" proved="true">
232 <proof prover="0"><result status="valid" time="0.020000" steps="77"/></proof>
234 <goal name="pair_insertion_sort'vc.73" expl="loop invariant init" proved="true">
235 <proof prover="0"><result status="valid" time="4.520000" steps="2352"/></proof>
237 <goal name="pair_insertion_sort'vc.74" expl="index in array bounds" proved="true">
238 <proof prover="0"><result status="valid" time="0.010000" steps="40"/></proof>
240 <goal name="pair_insertion_sort'vc.75" expl="index in array bounds" proved="true">
241 <proof prover="0"><result status="valid" time="0.000000" steps="44"/></proof>
243 <goal name="pair_insertion_sort'vc.76" expl="index in array bounds" proved="true">
244 <proof prover="0"><result status="valid" time="0.010000" steps="44"/></proof>
246 <goal name="pair_insertion_sort'vc.77" expl="assertion" proved="true">
247 <proof prover="0"><result status="valid" time="0.020000" steps="204"/></proof>
249 <goal name="pair_insertion_sort'vc.78" expl="loop variant decrease" proved="true">
250 <proof prover="0"><result status="valid" time="0.010000" steps="54"/></proof>
252 <goal name="pair_insertion_sort'vc.79" expl="loop invariant preservation" proved="true">
253 <proof prover="0"><result status="valid" time="0.010000" steps="54"/></proof>
255 <goal name="pair_insertion_sort'vc.80" expl="loop invariant preservation" proved="true">
256 <proof prover="0"><result status="valid" time="0.160000" steps="289"/></proof>
258 <goal name="pair_insertion_sort'vc.81" expl="loop invariant preservation" proved="true">
259 <proof prover="0"><result status="valid" time="0.100000" steps="366"/></proof>
261 <goal name="pair_insertion_sort'vc.82" expl="loop invariant preservation" proved="true">
262 <proof prover="0"><result status="valid" time="0.160000" steps="360"/></proof>
264 <goal name="pair_insertion_sort'vc.83" expl="loop invariant preservation" proved="true">
265 <proof prover="0"><result status="valid" time="0.040000" steps="127"/></proof>
267 <goal name="pair_insertion_sort'vc.84" expl="loop invariant preservation" proved="true">
268 <proof prover="0"><result status="valid" time="0.050000" steps="204"/></proof>
270 <goal name="pair_insertion_sort'vc.85" expl="index in array bounds" proved="true">
271 <proof prover="0"><result status="valid" time="0.010000" steps="40"/></proof>
273 <goal name="pair_insertion_sort'vc.86" expl="loop variant decrease" proved="true">
274 <proof prover="0"><result status="valid" time="0.000000" steps="48"/></proof>
276 <goal name="pair_insertion_sort'vc.87" expl="loop invariant preservation" proved="true">
277 <proof prover="0"><result status="valid" time="0.010000" steps="48"/></proof>
279 <goal name="pair_insertion_sort'vc.88" expl="loop invariant preservation" proved="true">
280 <proof prover="0"><result status="valid" time="0.430000" steps="2094"/></proof>
282 <goal name="pair_insertion_sort'vc.89" expl="loop invariant preservation" proved="true">
283 <proof prover="0"><result status="valid" time="0.020000" steps="50"/></proof>
285 <goal name="pair_insertion_sort'vc.90" expl="index in array bounds" proved="true">
286 <proof prover="0"><result status="valid" time="0.000000" steps="12"/></proof>
288 <goal name="pair_insertion_sort'vc.91" expl="loop invariant init" proved="true">
289 <proof prover="0"><result status="valid" time="0.000000" steps="12"/></proof>
291 <goal name="pair_insertion_sort'vc.92" expl="loop invariant init" proved="true">
292 <proof prover="0"><result status="valid" time="0.000000" steps="22"/></proof>
294 <goal name="pair_insertion_sort'vc.93" expl="loop invariant init" proved="true">
295 <proof prover="0"><result status="valid" time="0.000000" steps="18"/></proof>
297 <goal name="pair_insertion_sort'vc.94" expl="loop invariant init" proved="true">
298 <proof prover="0"><result status="valid" time="0.000000" steps="14"/></proof>
300 <goal name="pair_insertion_sort'vc.95" expl="loop invariant init" proved="true">
301 <proof prover="0"><result status="valid" time="0.000000" steps="14"/></proof>
303 <goal name="pair_insertion_sort'vc.96" expl="loop invariant init" proved="true">
304 <proof prover="0"><result status="valid" time="0.170000" steps="251"/></proof>
306 <goal name="pair_insertion_sort'vc.97" expl="index in array bounds" proved="true">
307 <proof prover="0"><result status="valid" time="0.000000" steps="22"/></proof>
309 <goal name="pair_insertion_sort'vc.98" expl="index in array bounds" proved="true">
310 <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
312 <goal name="pair_insertion_sort'vc.99" expl="index in array bounds" proved="true">
313 <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
315 <goal name="pair_insertion_sort'vc.100" expl="assertion" proved="true">
316 <proof prover="0"><result status="valid" time="0.010000" steps="85"/></proof>
318 <goal name="pair_insertion_sort'vc.101" expl="loop variant decrease" proved="true">
319 <proof prover="0"><result status="valid" time="0.010000" steps="36"/></proof>
321 <goal name="pair_insertion_sort'vc.102" expl="loop invariant preservation" proved="true">
322 <proof prover="0"><result status="valid" time="0.000000" steps="36"/></proof>
324 <goal name="pair_insertion_sort'vc.103" expl="loop invariant preservation" proved="true">
325 <proof prover="0"><result status="valid" time="0.050000" steps="157"/></proof>
327 <goal name="pair_insertion_sort'vc.104" expl="loop invariant preservation" proved="true">
328 <proof prover="0"><result status="valid" time="0.060000" steps="215"/></proof>
330 <goal name="pair_insertion_sort'vc.105" expl="loop invariant preservation" proved="true">
331 <proof prover="0"><result status="valid" time="0.100000" steps="211"/></proof>
333 <goal name="pair_insertion_sort'vc.106" expl="loop invariant preservation" proved="true">
334 <proof prover="0"><result status="valid" time="0.010000" steps="79"/></proof>
336 <goal name="pair_insertion_sort'vc.107" expl="loop invariant preservation" proved="true">
337 <proof prover="0"><result status="valid" time="0.030000" steps="116"/></proof>
339 <goal name="pair_insertion_sort'vc.108" expl="index in array bounds" proved="true">
340 <proof prover="0"><result status="valid" time="0.000000" steps="22"/></proof>
342 <goal name="pair_insertion_sort'vc.109" expl="postcondition" proved="true">
343 <proof prover="0"><result status="valid" time="0.070000" steps="199"/></proof>
345 <goal name="pair_insertion_sort'vc.110" expl="postcondition" proved="true">
346 <proof prover="0"><result status="valid" time="0.010000" steps="28"/></proof>
348 <goal name="pair_insertion_sort'vc.111" expl="postcondition" proved="true">
349 <proof prover="0"><result status="valid" time="0.000000" steps="20"/></proof>
351 <goal name="pair_insertion_sort'vc.112" expl="postcondition" proved="true">
352 <proof prover="0"><result status="valid" time="0.010000" steps="12"/></proof>