Datasets:
Download experiments/t2/examples/R02/annotated.c from PV-SJTU/PV-Bench: direct link, hf CLI and curl.
- Browser
- Download file 3.14 kB
-
https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/experiments/t2/examples/R02/annotated.c
- Command line
-
hf download hf://datasets/PV-SJTU/PV-Bench/experiments/t2/examples/R02/annotated.c
-
curl -L -o annotated.c https://huggingface.co/datasets/PV-SJTU/PV-Bench/resolve/main/experiments/t2/examples/R02/annotated.c
3.14 kB
| /*@ Import Coq Require Import SimpleC.EE.QCP_demos_LLM.int_array_merge_rel_lib */ | |
| /*@ Extern Coq | |
| (maketuple: list Z -> list Z -> ((list Z) * (list Z))) | |
| (merge_rel: list Z -> list Z -> program unit (list Z)) | |
| (merge_from_mid_rel: list Z -> list Z -> list Z -> program unit (list Z)) | |
| */ | |
| void merge(int *arr, int p, int q, int r, int *ret) | |
| /*@ With s1 s2 l0 X | |
| Require safeExec(ATrue, merge_rel(s1, s2), X) && | |
| 0 <= p && p <= q && | |
| q < r && r + 1 <= INT_MAX && | |
| IntArray::seg(arr, p, q + 1, s1) * | |
| IntArray::seg(arr, q + 1, r + 1, s2) * | |
| IntArray::seg(ret, p, r + 1, l0) | |
| Ensure exists s3 l1, safeExec(ATrue, return(s3), X) && | |
| IntArray::seg(arr, p, r + 1, l1) * | |
| IntArray::seg(ret, p, r + 1, s3) | |
| */ | |
| { | |
| int i = p; | |
| int j = q + 1; | |
| int k = p; | |
| /*@ Inv Assert | |
| exists l1 l2 l3 l4 l5 l6, | |
| safeExec(ATrue, merge_from_mid_rel(l1, l2, l3), X) && | |
| p == p@pre && q == q@pre && r == r@pre && | |
| arr == arr@pre && ret == ret@pre && | |
| 0 <= p && p <= q && | |
| q < r && r + 1 <= INT_MAX && | |
| p <= i && | |
| q + 1 <= j && | |
| k == p + (i - p) + (j - (q + 1)) && | |
| IntArray::seg(arr, p, i, l4) * | |
| IntArray::seg(arr, i, q + 1, l1) * | |
| IntArray::seg(arr, q + 1, j, l5) * | |
| IntArray::seg(arr, j, r + 1, l2) * | |
| IntArray::seg(ret, p, k, l3) * | |
| IntArray::seg(ret, k, r + 1, l6) | |
| */ | |
| while (i < q + 1 && j < r + 1) { | |
| if (arr[i] <= arr[j]) { | |
| ret[k] = arr[i]; | |
| i++; | |
| } else { | |
| ret[k] = arr[j]; | |
| j++; | |
| } | |
| k++; | |
| } | |
| /*@ Inv Assert | |
| exists l1 l2 l3 l4 l5 l6, | |
| safeExec(ATrue, merge_from_mid_rel(l1, l2, l3), X) && | |
| p == p@pre && q == q@pre && r == r@pre && | |
| arr == arr@pre && ret == ret@pre && | |
| 0 <= p && p <= q && | |
| q < r && r + 1 <= INT_MAX && | |
| p <= i && | |
| q + 1 <= j && | |
| k == p + (i - p) + (j - (q + 1)) && | |
| (i == q + 1 || j == r + 1) && | |
| IntArray::seg(arr, p, i, l4) * | |
| IntArray::seg(arr, i, q + 1, l1) * | |
| IntArray::seg(arr, q + 1, j, l5) * | |
| IntArray::seg(arr, j, r + 1, l2) * | |
| IntArray::seg(ret, p, k, l3) * | |
| IntArray::seg(ret, k, r + 1, l6) | |
| */ | |
| while (i < q + 1) { | |
| ret[k] = arr[i]; | |
| i++; | |
| k++; | |
| } | |
| /*@ Inv Assert | |
| exists l2 l3 l4 l5 l6, | |
| safeExec(ATrue, merge_from_mid_rel(nil, l2, l3), X) && | |
| p == p@pre && q == q@pre && r == r@pre && | |
| arr == arr@pre && ret == ret@pre && | |
| 0 <= p && p <= q && | |
| q < r && r + 1 <= INT_MAX && | |
| p <= i && | |
| q + 1 <= j && | |
| k == p + (i - p) + (j - (q + 1)) && | |
| i == q + 1 && | |
| IntArray::seg(arr, p, i, l4) * | |
| IntArray::seg(arr, q + 1, j, l5) * | |
| IntArray::seg(arr, j, r + 1, l2) * | |
| IntArray::seg(ret, p, k, l3) * | |
| IntArray::seg(ret, k, r + 1, l6) | |
| */ | |
| while (j < r + 1) { | |
| ret[k] = arr[j]; | |
| j++; | |
| k++; | |
| } | |
| } | |