Datasets:
program_id stringlengths 12 12 | source_dataset stringclasses 4
values | original_file stringlengths 7 13 | source_language stringclasses 1
value | target_language stringclasses 1
value | dafny_loc int64 5 297 | c_loc int64 8 273 | complexity_bucket stringclasses 4
values | has_loop bool 2
classes | has_array_access bool 2
classes | requires_count int64 0 106 | ensures_count int64 0 30 | loop_invariant_count int64 0 23 | assert_count int64 0 41 | verified bool 1
class | final_status stringclasses 1
value | dafny_code stringlengths 65 8.74k | c_code stringlengths 84 8.5k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
program_0001 | custom_ir_seed | raw_101_new.c | Dafny | C+ACSL | 26 | 53 | 41-60 | true | true | 3 | 2 | 5 | 9 | true | success | method max(x: array<nat>) returns (y: nat)
requires x.Length > 0
ensures forall j :: 0 <= j < x.Length ==> y >= x[j]
ensures y in x[..]
{
y := x[0];
var i := 0;
while i < x.Length
invariant 0 <= i <= x.Length
invariant forall j :: 0 <= j < i ==> y >= x[j]
invariant y in x[..]
{
if y <= x[i... | // Generated C + ACSL
/*@
requires x_len > 0;
requires x != \null;
requires \valid_read(x + (0 .. x_len-1));
assigns \nothing;
ensures \forall integer j; 0 <= j < x_len ==> \result >= x[j];
ensures \exists integer k; 0 <= k < x_len && \result == x[k];
*/
int max(int* x, int x_len)
{
int y = x... |
program_0002 | dafnybench_all.json | raw_1.c | Dafny | C+ACSL | 21 | 28 | 21-40 | true | true | 3 | 0 | 4 | 0 | true | success | method replace(v:array<int>, x:int, y:int)
modifies v
ensures forall k::0<=k<old(v.Length) && old(v[k])==x ==> v[k]==y
ensures forall k::0<=k<old(v.Length) && old(v[k])!=x ==> v[k]==old(v[k])
{
var i:=0;
while(i<v.Length)
decreases v.Length - i
invariant 0<=i<=v.Length
invariant forall k::0<=k<i && ... | // Generated C + ACSL
/*@
requires v != \null;
requires v_len >= 0;
requires \valid(v + (0 .. v_len-1));
assigns v[0 .. v_len-1];
*/
void replace(int* v, int v_len, int x, int y)
{
int i = 0;
/*@
loop invariant 0 <= i <= v_len;
loop invariant \forall integer k; 0 <= k < i && \at(v[k], LoopEntry) ... |
program_0003 | dafnybench_all.json | raw_101.c | Dafny | C+ACSL | 38 | 56 | 41-60 | true | true | 3 | 2 | 5 | 12 | true | success | //Given an array of natural numbers, it returns the maximum value. [5,1,3,6,12,3]->12
method max(x:array<nat>) returns (y:nat)
// for index loop problems
requires x.Length > 0
// ensuring that we maintain y as greater than the elements in the array
ensures forall j :: 0 <= j < x.Length ==> y >= x[j]
// ensuring that... | // Generated C + ACSL
/*@
requires x_len > 0;
requires x != \null;
requires \valid(x + (0 .. x_len-1));
assigns \nothing;
ensures \forall integer j; 0 <= j < x_len ==> \result >= x[j];
ensures \exists integer k; 0 <= k < x_len && \result == x[k];
*/
int max(int* x, int x_len)
{
int y = x[0];
... |
program_0004 | dafnybench_all.json | raw_103.c | Dafny | C+ACSL | 35 | 48 | 41-60 | false | false | 1 | 1 | 0 | 0 | true | success | function exp(x:int, e:int):int
decreases e
requires e >= 0
ensures x > 0 ==> exp(x,e) > 0
{
if e == 0 then 1 else x*exp(x,e-1)
}
lemma exp3_Lemma(n:int)
decreases n
requires n >= 1
ensures (exp(3,n)-1)%2 == 0
{}
lemma mult8_Lemma(n:int)
decreases n
requires n >= 1
ensures (exp(3,2*n) - 1)%... | // Generated C + ACSL
/*@
requires e >= 0;
decreases e;
assigns \nothing;
ensures x > 0 ==> \result > 0;
*/
int exp(int x, int e)
{
return ((e == 0)) ? (1) : ((x * exp(x, (e - 1))));
}
// ```acsl
// /*@
// axiomatic exp3_Lemma_properties {
// lemma exp3_Lemma_statement:
// \forall intege... |
program_0005 | dafnybench_all.json | raw_105.c | Dafny | C+ACSL | 31 | 45 | 41-60 | true | true | 4 | 0 | 9 | 0 | true | success | method twoSum(nums: array<int>, target: int) returns (index1: int, index2: int)
requires 2 <= nums.Length
requires exists i, j :: (0 <= i < j < nums.Length && nums[i] + nums[j] == target)
ensures index1 != index2
ensures 0 <= index1 < nums.Length
ensures 0 <= index2 < nums.Length
ensures nums[in... | // Generated C + ACSL
/*@
requires nums != \null;
requires nums_len >= 2;
requires \valid(nums + (0 .. nums_len-1));
requires \exists integer i, j;
0 <= i < j < nums_len && nums[i] + nums[j] == target;
assigns \nothing;
*/
void twoSum(int* nums, int nums_len, int target)
{
int i = 0;
/*@
... |
program_0006 | dafnybench_all.json | raw_11.c | Dafny | C+ACSL | 42 | 28 | 21-40 | true | false | 2 | 2 | 3 | 1 | true | success | method main(n: int, k: int) returns (k_out: int)
requires n > 0;
requires k > n;
ensures k_out >= 0;
{
k_out := k;
var j: int := 0;
while(j < n)
invariant 0 <= j <= n;
invariant j + k_out == k;
{
j := j + 1;
k_out := k_out - 1;
}
}
// C code:
// MODULE main
// int i;
// in... | // Generated C + ACSL
/*@
requires n > 0;
requires k > n;
assigns \nothing;
ensures \result >= 0;
ensures \result == k - n;
*/
int dafny_main(int n, int k)
{
int k_out = k;
/*@ assert k_out >= 0 && k_out <= 2147483647; */
int j = 0;
/*@
loop invariant 0 <= j <= n;
loop invariant j + k_out... |
program_0007 | dafnybench_all.json | raw_111.c | Dafny | C+ACSL | 27 | 55 | 41-60 | true | false | 4 | 4 | 8 | 1 | true | success | function max(x:nat, y:nat) : nat
{
if (x < y) then y else x
}
method slow_max(a: nat, b: nat) returns (z: nat)
ensures z == max(a, b)
{
z := 0;
var x := a;
var y := b;
while (z < x && z < y)
invariant x >=0;
invariant y >=0;
invariant z == a - x && z == b - y;
invariant a-x == b-y
decr... | // Generated C + ACSL
/*@
requires x >= 0;
requires y >= 0;
assigns \nothing;
ensures \result >= x && \result >= y;
ensures \result == x || \result == y;
ensures (x < y ==> \result == y) && (x >= y ==> \result == x);
*/
int max(int x, int y)
{
return ((x < y)) ? (y) : (x);
}
/*@
requires... |
program_0008 | dafnybench_all.json | raw_114.c | Dafny | C+ACSL | 6 | 13 | 0-20 | false | false | 1 | 1 | 0 | 1 | true | success | method LateralSurfaceArea(size: int) returns (area: int)
requires size > 0
ensures area == 4 * size * size
{
area := 4 * size * size;
} | // Generated C + ACSL
/*@
requires size > 0;
assigns \nothing;
ensures \result == 4 * size * size;
*/
int LateralSurfaceArea(int size)
{
int area = ((4 * size) * size);
/*@ assert area >= 0 && area <= 2147483647; */
return area; // Dafny implicit return
}
|
program_0009 | dafnybench_all.json | raw_12.c | Dafny | C+ACSL | 6 | 16 | 0-20 | false | false | 3 | 2 | 0 | 1 | true | success | method CountNonEmptySubstrings(s: string) returns (count: int)
ensures count >= 0
ensures count == (|s| * (|s| + 1)) / 2 // Formula for the number of non-empty substrings of a string
{
count := (|s| * (|s| + 1)) / 2;
} | // Generated C + ACSL
/*@
requires s != \null || s_len == 0;
requires s_len >= 0;
requires s != \null ==> \valid_read(s + (0 .. s_len-1));
assigns \nothing;
ensures \result >= 0;
ensures \result == s_len * (s_len + 1) / 2;
*/
int CountNonEmptySubstrings(char* s, int s_len)
{
int count = ((s_l... |
program_0010 | dafnybench_all.json | raw_120.c | Dafny | C+ACSL | 26 | 24 | 21-40 | true | true | 4 | 0 | 2 | 0 | true | success | // Sorting:
// Pre/Post Condition Issues - An investigation
// -- Stephanie McIntyre
// Based on examples in class
// First Attempt at specifying requirements for sorting array A in incrementing order
// We want our Hoare triple of (|Pre-Condition|) Code (|Post-Condition|... | // Generated C + ACSL
/*@
requires n == A_len;
requires n >= 0;
requires A != \null;
requires \valid(A + (0 .. A_len-1));
assigns A[0 .. A_len-1];
*/
void sort(int* A, int A_len, int n)
{
int k = 0;
/*@
loop invariant 0 <= k <= n;
loop invariant \forall integer i; 0 <= i < k ==> A[i] == i;
... |
program_0011 | dafnybench_all.json | raw_123.c | Dafny | C+ACSL | 59 | 115 | 60+ | false | false | 7 | 6 | 0 | 16 | true | success | function Average(a: int, b: int): int
{
(a + b) / 2
}
ghost method Triple(x: int) returns (r: int)
ensures r == 3 * x
{
r := Average(2 * x, 4 * x);
}
method Triple1(x: int) returns (r: int)
ensures r == 3 * x
{
var y := 2 * x;
r := x + y;
ghost var a, b := DoubleQuadruple(x);
assert ... | // Generated C + ACSL
/*@
assigns \nothing;
ensures \result == (a + b) / 2;
*/
int Average(int a, int b)
{
return ((a + b) / 2);
}
/*@
requires x >= 0;
requires x <= 715827882;
assigns \nothing;
ensures \result == 3 * x;
*/
int Triple(int x)
{
/*@ assert 2 * x >= 0 && 2 * x <= 1431655764; ... |
program_0012 | dafnybench_all.json | raw_125.c | Dafny | C+ACSL | 6 | 20 | 0-20 | false | false | 2 | 3 | 0 | 5 | true | success | method StarNumber(n: int) returns (star: int)
requires n >= 0
ensures star == 6 * n * (n - 1) + 1
{
star := 6 * n * (n - 1) + 1;
} | // Generated C + ACSL
/*@
requires n >= 0;
requires n <= 18918; // Ensure no overflow: 6 * 18918 * 18917 + 1 < INT_MAX
assigns \nothing;
ensures \result == 6 * n * (n - 1) + 1;
ensures \result >= 0;
ensures \result <= 2147483647;
*/
int StarNumber(int n)
{
/*@ assert 6 * n * (n - 1) >= -6 * n... |
program_0013 | dafnybench_all.json | raw_129.c | Dafny | C+ACSL | 14 | 28 | 21-40 | true | false | 1 | 0 | 3 | 2 | true | success | method SumAndAverage(n: int) returns (sum: int, average: real)
requires n > 0
ensures sum == n * (n + 1) / 2
ensures average == sum as real / n as real
{
sum := 0;
for i := 1 to n + 1
invariant 0 <= i <= n + 1
invariant sum == (i - 1) * i / 2
{
sum := sum + i;
}
average :... | // Generated C + ACSL
/*@
requires n > 0;
assigns \nothing;
*/
void SumAndAverage(int n)
{
int sum = 0;
/*@ assert sum >= 0 && sum <= 2147483647; */
{
int i = 1;
/*@
loop invariant 0 <= i <= n + 2;
loop invariant sum == (i - 1) * i / 2;
loop invariant \at(i, LoopEntry) <= i;
loop assigns i, s... |
program_0014 | dafnybench_all.json | raw_130.c | Dafny | C+ACSL | 71 | 85 | 60+ | true | true | 3 | 4 | 5 | 6 | true | success |
method RemoveDuplicates(nums: array<int>) returns (num_length: int)
modifies nums
requires forall i, j | 0 <= i < j < nums.Length :: nums[i] <= nums[j]
ensures nums.Length == old(nums).Length
ensures 0 <= num_length <= nums.Length
ensures forall i, j | 0 <= i < j < num_length :: nums[i] != nums[j]
ensures ... | // Generated C + ACSL
/*@
requires nums_len >= 0;
requires nums_len == 0 || (nums != \null && \valid(nums + (0 .. nums_len-1)));
requires \forall integer i, j; 0 <= i < j < nums_len ==> nums[i] <= nums[j];
assigns nums[0 .. nums_len-1];
ensures 0 <= \result <= nums_len;
ensures \forall integer ... |
program_0015 | dafnybench_all.json | raw_133.c | Dafny | C+ACSL | 5 | 13 | 0-20 | false | false | 0 | 2 | 0 | 1 | true | success | method IsOdd(n: int) returns (result: bool)
ensures result <==> n % 2 == 1
{
result := n % 2 == 1;
} | // Generated C + ACSL
/*@
assigns \nothing;
ensures \result == 1 <==> n % 2 == 1;
ensures \result == 0 <==> n % 2 != 1;
*/
int IsOdd(int n)
{
int result = ((n % 2) == 1);
/*@ assert result >= 0 && result <= 2147483647; */
return result; // Dafny implicit return
}
|
program_0016 | dafnybench_all.json | raw_138.c | Dafny | C+ACSL | 19 | 36 | 21-40 | true | true | 3 | 2 | 4 | 1 | true | success | method IsGreater(n: int, a: array<int>) returns (result: bool)
requires a != null
ensures result ==> forall i :: 0 <= i < a.Length ==> n > a[i]
ensures !result ==> exists i :: 0 <= i < a.Length && n <= a[i]
{
result := true;
var i := 0;
while i < a.Length
invariant 0 <= i <= a.Length
... | // Generated C + ACSL
/*@
requires a != \null;
requires a_len >= 0;
requires \valid(a + (0 .. a_len-1));
assigns \nothing;
ensures \result == 1 ==>
(\forall integer i; 0 <= i < a_len ==> n > a[i]);
ensures \result == 0 ==>
(\exists integer i; 0 <= i < a_len && n <= a[i]);
*/
int... |
program_0017 | dafnybench_all.json | raw_140.c | Dafny | C+ACSL | 126 | 101 | 60+ | true | true | 13 | 5 | 9 | 5 | true | success | /**
Ather, Mohammad Faiz (s4648481/3)
CSSE3100
Assignemnt 3
The University of Queensland
*/
// Question 1
method Tangent(r: array<int>, x: array<int>)
returns (found: bool)
requires forall i:: 1 <= i < x.Length ==>
x[i-1] < x[i]
requires forall i, j ::
0 <= i < j < x.Length ==>
... | // Generated C + ACSL
/*@
requires a_len >= 0;
requires a_len > 0 ==> a != \null;
requires a_len > 0 ==> \valid_read(a + (0 .. a_len-1));
requires \forall integer i; 1 <= i < a_len ==> a[i - 1] < a[i];
requires \forall integer i, j; 0 <= i < j < a_len ==> a[i] < a[j];
assigns \nothing;
ensu... |
program_0018 | dafnybench_all.json | raw_141.c | Dafny | C+ACSL | 15 | 27 | 21-40 | true | false | 1 | 1 | 4 | 1 | true | success | method TriangleNumber(N: int) returns (t: int)
requires N >= 0
ensures t == N * (N + 1) / 2
{
t := 0;
var n := 0;
while n < N
invariant 0 <= n <= N
invariant t == n * (n + 1) / 2
decreases N - n;// can be left out because it is guessed correctly by Dafny
{
n:= n +... | // Generated C + ACSL
/*@
requires N >= 0;
assigns \nothing;
ensures \result == N * (N + 1) / 2;
*/
int TriangleNumber(int N)
{
int t = 0;
/*@ assert t >= 0 && t <= 2147483647; */
int n = 0;
/*@
loop invariant 0 <= n <= N;
loop invariant t == n * (n + 1) / 2;
loop invariant n >= \at(n, LoopEntr... |
program_0019 | dafnybench_all.json | raw_144.c | Dafny | C+ACSL | 24 | 29 | 21-40 | false | false | 0 | 1 | 0 | 0 | true | success | // RUN: %dafny /compile:0 /print:"%t.print" /dprint:"%t.dprint" /printTooltips "%s" > "%t"
// RUN: %diff "%s.expect" "%t"
// This example was listed in IronClad's notebook as one place were z3 picked
// much too liberal triggers. THe Boogie code for this is shown below:
//
// forall k#2: Seq Box :: $Is(k#2, TSeq(TInt)... | // Generated C + ACSL
/*@
assigns \nothing;
ensures \true;
*/
int HashtableLookup(int h, int k)
{
return 0;
}
// ```c
// /*@
// axiomatic HashtableAgreement_properties {
// lemma HashtableAgreement_statement:
// \forall Hashtable h1, Hashtable h2, Key k;
// (\forall Key k2; HashtableLook... |
program_0020 | dafnybench_all.json | raw_145.c | Dafny | C+ACSL | 6 | 19 | 0-20 | false | false | 2 | 0 | 0 | 7 | true | success | method DoubleQuadruple(x: int) returns (a: int, b: int)
ensures a == 2 * x && b == 4 * x
{
a := 2 * x;
b := 2 * a;
}
| // Generated C + ACSL
/*@
requires x >= 0;
requires x <= 536870911; // 2^29 - 1, ensures 4*x <= INT_MAX
assigns \nothing;
*/
void DoubleQuadruple(int x)
{
/*@ assert 2 * x <= 2147483647; */
int a = (2 * x);
/*@ assert a == 2 * x; */
/*@ assert a >= 0 && a <= 2147483647; */
/*@ assert 2 * a <= 214... |
program_0021 | dafnybench_all.json | raw_154.c | Dafny | C+ACSL | 16 | 32 | 21-40 | true | true | 4 | 1 | 2 | 0 | true | success | method MinLengthSublist(s: seq<seq<int>>) returns (minSublist: seq<int>)
requires |s| > 0
ensures minSublist in s
ensures forall sublist :: sublist in s ==> |minSublist| <= |sublist|
{
minSublist := s[0];
for i := 1 to |s|
invariant 0 <= i <= |s|
invariant minSublist in s[..i]
... | // Generated C + ACSL
/*@
requires s != \null;
requires s_len > 0;
requires \valid_read(s + (0 .. s_len-1));
requires \forall integer i; 0 <= i < s_len ==> s[i] != \null;
assigns \nothing;
ensures \exists integer k; 0 <= k < s_len && \result == s[k];
*/
int* MinLengthSublist(int** s, int s_len)... |
program_0022 | dafnybench_all.json | raw_161.c | Dafny | C+ACSL | 20 | 33 | 21-40 | true | true | 3 | 2 | 4 | 1 | true | success | method FindMax(a: array<int>) returns (max: int)
requires a != null && a.Length > 0;
ensures 0 <= max < a.Length;
ensures forall x :: 0 <= x < a.Length ==> a[max] >= a[x];
{
var i := 0;
max := 0;
while (i < a.Length)
invariant i <= a.Length;
invariant 0 <= max;
invariant max == 0 || 0 < max ... | // Generated C + ACSL
/*@
requires a != \null;
requires a_len > 0;
requires \valid(a + (0 .. a_len-1));
assigns \nothing;
ensures 0 <= \result < a_len;
ensures \forall integer x; 0 <= x < a_len ==> a[\result] >= a[x];
*/
int FindMax(int* a, int a_len)
{
int i = 0;
int max = 0;
/*@ assert ... |
program_0023 | dafnybench_all.json | raw_163.c | Dafny | C+ACSL | 26 | 43 | 41-60 | true | true | 3 | 3 | 2 | 0 | true | success | method firste(a: array<char>) returns (c:int)
ensures -1 <= c < a.Length
ensures 0 <= c < a.Length ==> a[c] == 'e' && forall x :: 0 <= x < c ==> a[x] != 'e'
ensures c == -1 ==> forall x :: 0 <= x < a.Length ==> a[x] != 'e'
{
var i:int := 0;
while i < a.Length
invariant 0 <= i <= a.Length
invariant foral... | // Generated C + ACSL
/*@
requires a != \null;
requires a_len >= 0;
requires \valid_read(a + (0 .. a_len-1));
assigns \nothing;
ensures -1 <= \result < a_len;
ensures 0 <= \result < a_len ==>
a[\result] == 'e' &&
(\forall integer x; 0 <= x < \result ==> a[x] != 'e');
ensures... |
program_0024 | dafnybench_all.json | raw_164.c | Dafny | C+ACSL | 5 | 14 | 0-20 | false | false | 1 | 2 | 0 | 1 | true | success | method IsEven(n: int) returns (result: bool)
ensures result <==> n % 2 == 0
{
result := n % 2 == 0;
} | // Generated C + ACSL
/*@
requires \true;
assigns \nothing;
ensures \result == 1 <==> n % 2 == 0;
ensures \result == 0 <==> n % 2 != 0;
*/
int IsEven(int n)
{
int result = ((n % 2) == 0);
/*@ assert result >= 0 && result <= 2147483647; */
return result; // Dafny implicit return
}
|
program_0025 | dafnybench_all.json | raw_165.c | Dafny | C+ACSL | 17 | 28 | 21-40 | false | false | 1 | 4 | 0 | 1 | true | success | method CountEqualNumbers(a: int, b: int, c: int) returns (count: int)
ensures count >= 0 && count <= 3
ensures (count == 3) <==> (a == b && b == c)
ensures (count == 2) <==> ((a == b && b != c) || (a != b && b == c) || (a == c && b != c))
ensures (count == 1) <==> (a != b && b != c && a != c)
{
coun... | // Generated C + ACSL
/*@
requires \true;
assigns \nothing;
ensures \result >= 0 && \result <= 3;
ensures \result == 3 <==> (a == b && b == c);
ensures \result == 2 <==> ((a == b && b != c) || (a != b && b == c) || (a == c && b != c));
ensures \result == 1 <==> (a != b && b != c && a != c);
*/
... |
program_0026 | dafnybench_all.json | raw_169.c | Dafny | C+ACSL | 43 | 29 | 21-40 | true | false | 2 | 1 | 4 | 1 | true | success | // Exemplo de invariantes
// Invariante significa que o valor não muda desde a pré-condição até a pós-condição
method Mult(x:nat, y:nat) returns (r:nat)
ensures r == x * y
{
// parΓ’metros de entrada sΓ£o imutΓ‘veis, por isso
// Γ© preciso a atribuir a variΓ‘veis locais para usar em blocos de cΓ³digos para mudar
... | // Generated C + ACSL
/*@
requires x >= 0;
requires y >= 0;
assigns \nothing;
ensures \result == x * y;
*/
int Mult(int x, int y)
{
int m = x;
int n = y;
int r = 0;
/*@ assert r >= 0 && r <= 2147483647; */
/*@
loop invariant m >= 0;
loop invariant m * n + r == \at(m, LoopEntry) * \at(n, Loo... |
program_0027 | dafnybench_all.json | raw_179.c | Dafny | C+ACSL | 6 | 13 | 0-20 | false | false | 1 | 1 | 0 | 1 | true | success | method NthDecagonalNumber(n: int) returns (decagonal: int)
requires n >= 0
ensures decagonal == 4 * n * n - 3 * n
{
decagonal := 4 * n * n - 3 * n;
} | // Generated C + ACSL
/*@
requires n >= 0;
assigns \nothing;
ensures \result == 4 * n * n - 3 * n;
*/
int NthDecagonalNumber(int n)
{
int decagonal = (((4 * n) * n) - (3 * n));
/*@ assert decagonal >= 0 && decagonal <= 2147483647; */
return decagonal; // Dafny implicit return
}
|
program_0028 | dafnybench_all.json | raw_182.c | Dafny | C+ACSL | 32 | 35 | 21-40 | true | true | 3 | 2 | 2 | 0 | true | success | method Symmetric(a: array<int>) returns (flag: bool)
ensures flag == true ==> forall x :: 0 <= x < a.Length ==> a[x] == a[a.Length - x - 1]
ensures flag == false ==> exists x :: 0 <= x < a.Length && a[x] != a[a.Length - x - 1]
{
// empty == symmetrical
if a.Length == 0 {
return true;
}
var i:i... | // Generated C + ACSL
/*@
requires a != \null || a_len == 0;
requires a_len >= 0;
requires a_len > 0 ==> \valid_read(a + (0 .. a_len-1));
assigns \nothing;
ensures \result == 1 ==>
(\forall integer x; 0 <= x < a_len ==> a[x] == a[a_len - x - 1]);
ensures \result == 0 ==>
(\exist... |
program_0029 | dafnybench_all.json | raw_184.c | Dafny | C+ACSL | 11 | 16 | 0-20 | false | true | 2 | 3 | 0 | 0 | true | success | method SwapFirstAndLast(a: array<int>)
requires a.Length > 0
modifies a
ensures a[0] == old(a[a.Length - 1])
ensures a[a.Length - 1] == old(a[0])
ensures forall k :: 1 <= k < a.Length - 1 ==> a[k] == old(a[k])
{
var tmp := a[0];
a[0] := a[a.Length - 1];
a[a.Length - 1] := tmp;
} | // Generated C + ACSL
/*@
requires a_len > 0;
requires \valid(a + (0 .. a_len-1));
assigns a[0], a[a_len-1];
ensures a[0] == \old(a[a_len-1]);
ensures a[a_len-1] == \old(a[0]);
ensures \forall integer k; 1 <= k < a_len-1 ==> a[k] == \old(a[k]);
*/
void SwapFirstAndLast(int* a, int a_len)
{
in... |
program_0030 | dafnybench_all.json | raw_187.c | Dafny | C+ACSL | 37 | 28 | 21-40 | false | false | 0 | 0 | 0 | 1 | true | success | // NONUNIFORM: Tests printing much more than compilation
// RUN: %dafny /dafnyVerify:0 /compile:0 /env:0 /dprint:"%t.dfy" "%s" > "%t"
// RUN: %dafny /dafnyVerify:0 /compile:0 /env:0 /printMode:DllEmbed /dprint:"%t1.dfy" "%t.dfy" >> "%t"
// RUN: %dafny /env:0 /compile:3 /printMode:DllEmbed /dprint:"%t2.dfy" "%t1.dfy" >>... | // Generated C + ACSL
typedef struct {
int dummy;
} C;
/*@
assigns \nothing;
*/
void m(C* c);
/*@
assigns \nothing;
*/
void Main(void)
{
C c;
m(&c);
}
/*@
assigns \nothing;
*/
void m(C* c)
{
int k = 0;
/*@ assert (k == k); */
} |
program_0031 | dafnybench_all.json | raw_192.c | Dafny | C+ACSL | 8 | 16 | 0-20 | false | false | 0 | 1 | 0 | 1 | true | success | method ComputeIsEven(x:int) returns (is_even:bool)
ensures (x % 2 == 0)==is_even
{
is_even:=false;
if x%2==0{
is_even:=true;
}
}
| // Generated C + ACSL
/*@
assigns \nothing;
ensures \result == ((x % 2 == 0) ? 1 : 0);
*/
int ComputeIsEven(int x)
{
int is_even = 0;
/*@ assert is_even >= 0 && is_even <= 2147483647; */
if (((x % 2) == 0))
{
is_even = 1;
}
return is_even; // Dafny implicit return
}
|
program_0032 | dafnybench_all.json | raw_193.c | Dafny | C+ACSL | 7 | 14 | 0-20 | false | false | 2 | 0 | 0 | 2 | true | success | method MultipleReturns(x: int, y: int) returns (more: int, less: int)
ensures more == x+y
ensures less == x-y
{
more := x + y;
less := x - y;
}
| // Generated C + ACSL
/*@
requires x >= -1073741823 && x <= 1073741823;
requires y >= -1073741823 && y <= 1073741823;
assigns \nothing;
*/
void MultipleReturns(int x, int y)
{
int more = (x + y);
/*@ assert more >= -2147483646 && more <= 2147483646; */
int less = (x - y);
/*@ assert less >= -214748... |
program_0033 | dafnybench_all.json | raw_20.c | Dafny | C+ACSL | 6 | 18 | 0-20 | false | false | 4 | 3 | 0 | 1 | true | success | method Quotient(a: int, b: int) returns (result: int)
requires b != 0
ensures result == a / b
{
result := a / b;
} | // Generated C + ACSL
/*@
requires b != 0;
requires a >= 0;
requires b > 0;
requires a / b <= 2147483647;
assigns \nothing;
ensures \result == a / b;
ensures \result >= 0;
ensures \result <= 2147483647;
*/
int Quotient(int a, int b)
{
int result = (a / b);
/*@ assert result >= 0 && ... |
program_0034 | dafnybench_all.json | raw_200.c | Dafny | C+ACSL | 7 | 14 | 0-20 | false | false | 1 | 2 | 0 | 1 | true | success | method LastDigit(n: int) returns (d: int)
requires n >= 0
ensures 0 <= d < 10
ensures n % 10 == d
{
d := n % 10;
} | // Generated C + ACSL
/*@
requires n >= 0;
assigns \nothing;
ensures 0 <= \result < 10;
ensures n % 10 == \result;
*/
int LastDigit(int n)
{
int d = (n % 10);
/*@ assert d >= 0 && d <= 2147483647; */
return d; // Dafny implicit return
}
|
program_0035 | dafnybench_all.json | raw_207.c | Dafny | C+ACSL | 18 | 33 | 21-40 | true | true | 4 | 3 | 3 | 1 | true | success | method LinearSearch3<T>(a: array<T>, P: T -> bool) returns (n: int)
requires exists i :: 0 <= i < a.Length && P(a[i])
ensures 0 <= n < a.Length && P(a[n])
ensures forall k :: 0 <= k < n ==> !P(a[k])
{
n := 0;
while true
invariant 0 <= n < a.Length
invariant exists i :: n <= i < a.Length && P(a[i])
... | // Generated C + ACSL
/*@
requires a != \null;
requires a_len > 0;
requires \valid_read(a + (0 .. a_len-1));
requires \exists integer i; 0 <= i < a_len && a[i] == P;
assigns \nothing;
ensures 0 <= \result < a_len;
ensures a[\result] == P;
ensures \forall integer k; 0 <= k < \result ==> ... |
program_0036 | dafnybench_all.json | raw_212.c | Dafny | C+ACSL | 11 | 22 | 21-40 | false | false | 0 | 0 | 0 | 0 | true | success | lemma {:induction false} Divby2(n: nat)
ensures (n*(n-1))%2 == 0
{
if n == 0 {
assert (1*(1-1))%2 == 0; // base case
} else {
Divby2(n - 1); // proved in case n - 1
assert (n-1)*(n-2) == n*n -3*n + 2; // expanded case n - 1
}
}
| // Generated C + ACSL
/*@
axiomatic Divby2_properties {
// Helper lemma: if n is even, then n*(n-1) is even
lemma Divby2_even_case:
\forall integer n; n >= 0 && n % 2 == 0 ==> (n * (n - 1)) % 2 == 0;
// Helper lemma: if n is odd, then (n-1) is even, so n*(n-1) is even
lemma Divby2_odd... |
program_0037 | dafnybench_all.json | raw_216.c | Dafny | C+ACSL | 10 | 27 | 21-40 | false | false | 1 | 2 | 0 | 6 | true | success | method Max(a: int, b: int) returns (maxValue: int)
ensures maxValue == a || maxValue == b
ensures maxValue >= a && maxValue >= b
{
if a >= b {
maxValue := a;
} else {
maxValue := b;
}
} | // Generated C + ACSL
/*@
requires \true;
assigns \nothing;
ensures \result == a || \result == b;
ensures \result >= a && \result >= b;
*/
int Max(int a, int b)
{
int maxValue;
if ((a >= b))
{
maxValue = a;
/*@ assert maxValue == a; */
/*@ assert maxValue >= b; */
}
else
{
m... |
program_0038 | dafnybench_all.json | raw_218.c | Dafny | C+ACSL | 109 | 103 | 60+ | false | false | 0 | 0 | 0 | 0 | true | success | lemma max(a:int, b:int) returns (m:int)
ensures m >= a
ensures m >= b
ensures m == a || m == b
{
if (a > b) {
m := a;
} else {
m := b;
}
}
predicate post_max(a:int, b:int, m:int)
{
&& m >= a
&& m >= b
&& (m == a || m == b)
}
// to check if it is functioning: postcon... | // Generated C + ACSL
/*@
axiomatic max_properties {
logic integer max(integer a, integer b);
axiom max_greater_equal_a:
\forall integer a, b; max(a, b) >= a;
axiom max_greater_equal_b:
\forall integer a, b; max(a, b) >= b;
axiom max_is_one_of_inputs:
\forall integer a, b; max(a,... |
program_0039 | dafnybench_all.json | raw_225.c | Dafny | C+ACSL | 21 | 59 | 41-60 | true | true | 3 | 2 | 6 | 12 | true | success | method AllCharactersSame(s: string) returns (result: bool)
ensures result ==> forall i, j :: 0 <= i < |s| && 0 <= j < |s| ==> s[i] == s[j]
ensures !result ==> (|s| > 1) && (exists i, j :: 0 <= i < |s| && 0 <= j < |s| && i != j && s[i] != s[j])
{
if |s| <= 1 {
return true;
}
var firstChar :=... | // Generated C + ACSL
/*@
requires s != \null;
requires s_len >= 0;
requires \valid_read(s + (0 .. s_len-1));
assigns \nothing;
ensures \result == 1 ==>
\forall integer i, j;
0 <= i < s_len && 0 <= j < s_len ==> s[i] == s[j];
ensures \result == 0 ==>
s_len > 1 &&
... |
program_0040 | dafnybench_all.json | raw_227.c | Dafny | C+ACSL | 38 | 20 | 0-20 | false | true | 0 | 0 | 0 | 0 | true | success |
///////////////////////////
// Lemma to prove Transitive
// Got A<B, B<C.
// Prove A<C
///////////////////////////
predicate IsSubset(A: set, B: set) // <=
{
forall n :: n in A ==> n in B // same as the next line
//forall n :: if n in A then n in B else true // same as "A <= B"
}
// lemma - ΧΧ©Χ€Χ
// subsetIsTransitiv... | // Generated C + ACSL
/*@
predicate IsSubset(int *A, integer lenA, int *B, integer lenB) =
\forall integer i; 0 <= i < lenA ==>
\exists integer j; 0 <= j < lenB && A[i] == B[j];
*/
/*@
axiomatic subsetIsTransitive_properties {
lemma subsetIsTransitive_statement:
\forall int *A, integer lenA, i... |
program_0041 | dafnybench_all.json | raw_229.c | Dafny | C+ACSL | 50 | 51 | 41-60 | true | true | 4 | 2 | 8 | 1 | true | success |
//Method barrier below receives an array and an integer p
//and returns a boolean b which is true if and only if
//all the positions to the left of p and including also position p contain elements
//that are strictly smaller than all the elements contained in the positions to the right of p
//Examples:
// If v=[... | // Generated C + ACSL
/*@
requires v != \null;
requires v_len > 0;
requires 0 <= p < v_len;
requires \valid(v + (0 .. v_len-1));
assigns \nothing;
ensures \result == 1 <==>
(\forall integer k, l;
(0 <= k <= p && p < l < v_len) ==> v[k] < v[l]);
ensures \result == 0 <==>
... |
program_0042 | dafnybench_all.json | raw_234.c | Dafny | C+ACSL | 10 | 23 | 21-40 | false | false | 2 | 2 | 0 | 1 | true | success | method CalculateLoss(costPrice: int, sellingPrice: int) returns (loss: int)
requires costPrice >= 0 && sellingPrice >= 0
ensures (costPrice > sellingPrice ==> loss == costPrice - sellingPrice) && (costPrice <= sellingPrice ==> loss == 0)
{
if (costPrice > sellingPrice) {
loss := costPrice - sellingP... | // Generated C + ACSL
/*@
requires costPrice >= 0;
requires sellingPrice >= 0;
assigns \nothing;
ensures (costPrice > sellingPrice ==> \result == costPrice - sellingPrice);
ensures (costPrice <= sellingPrice ==> \result == 0);
*/
int CalculateLoss(int costPrice, int sellingPrice)
{
int loss;
if... |
program_0043 | dafnybench_all.json | raw_238.c | Dafny | C+ACSL | 87 | 105 | 60+ | true | true | 12 | 6 | 3 | 21 | true | success | // Author of question: Snorri Agnarsson
// Permalink of question: https://rise4fun.com/Dafny/CGB1z
// Authors of solution: Alexander GuΓ°mundsson
// Permalink of solution: https://rise4fun.com/Dafny/VnB5
// Use the command
// dafny H2-skeleton.dfy
// or
// compile H2-skeleton.dfy
// to compile the file.
// Or us... | // Generated C + ACSL
/*@
requires a != \null;
requires 0 <= i <= j <= a_len;
requires \valid_read(a + (0 .. a_len-1));
requires \forall integer p, q; i <= p < q < j ==> a[p] >= a[q];
decreases j - i;
assigns \nothing;
ensures i <= \result <= j;
ensures \forall integer r; i <= r < \resu... |
program_0044 | dafnybench_all.json | raw_239.c | Dafny | C+ACSL | 14 | 25 | 21-40 | true | false | 1 | 1 | 2 | 1 | true | success | method Carre(a: nat) returns (c: nat)
ensures c == a*a
{
var i := 0;
c := 0;
while i != a
invariant 0 <= i <= a
invariant c == i*i
decreases a - i
{
c := c + 2*i +1;
i := i + 1;
}
}
| // Generated C + ACSL
/*@
requires a >= 0;
assigns \nothing;
ensures \result == a * a;
*/
int Carre(int a)
{
int i = 0;
int c = 0;
/*@ assert c >= 0 && c <= 2147483647; */
/*@
loop invariant 0 <= i <= a;
loop invariant c == i * i;
loop assigns i, c;
loop variant a - i;
*/
while ((i != a))
... |
program_0045 | dafnybench_all.json | raw_24.c | Dafny | C+ACSL | 17 | 15 | 0-20 | false | false | 1 | 0 | 0 | 1 | true | success | // RUN: %dafny /ironDafny /compile:0 /print:"%t.print" /dprint:"%t.dprint" "%s" > "%t"
// RUN: %diff "%s.expect" "%t"
// In one version of opaque + fuel, the following failed to verify
// because the quantifier in the requires used a trigger that included
// StartFuel_P, while the assert used StartFuelAssert_P. Since... | // Generated C + ACSL
/*@
predicate P(integer x) =
\true;
*/
/*@
requires \forall integer x; P(x);
assigns \nothing;
*/
void test(int y)
{
/*@ assert P(y); */
}
|
program_0046 | dafnybench_all.json | raw_242.c | Dafny | C+ACSL | 177 | 29 | 21-40 | false | false | 0 | 0 | 0 | 5 | true | success | // RUN: %dafny /compile:3 /env:0 /dprint:- "%s" > "%t"
// RUN: %diff "%s.expect" "%t"
method Main() {
var m := new M0.MyClass.Init(20);
print m.a, ", ", m.b, ", ", m.c, "\n";
var r0 := new Regression.A.Make0();
var r1 := new Regression.A.Make1();
assert r0.b != r1.b;
print r0.b, ", ", r1.b, "\n";
}
module... | // Generated C + ACSL
/*@
assigns \nothing;
*/
void Main(void)
{
int m; /* unsupported init: Microsoft.Dafny.AllocateClass */
/* unsupported stmt: print m.a, ", ", m.b, ", ", m.c, "\n"; */
int r0; /* unsupported init: Microsoft.Dafny.AllocateClass */
int r1; /* unsupported init: Microsoft.Dafny.AllocateCla... |
program_0047 | dafnybench_all.json | raw_243.c | Dafny | C+ACSL | 5 | 15 | 0-20 | false | false | 1 | 2 | 0 | 2 | true | success | method AsciiValue(c: char) returns (ascii: int)
ensures ascii == c as int
{
ascii := c as int;
} | // Generated C + ACSL
/*@
requires c >= 0 && c <= 127;
assigns \nothing;
ensures \result == c;
ensures \result >= 0 && \result <= 127;
*/
int AsciiValue(int c)
{
int ascii = c;
/*@ assert ascii >= 0 && ascii <= 127; */
/*@ assert ascii == c; */
return ascii; // Dafny implicit return
} |
program_0048 | dafnybench_all.json | raw_245.c | Dafny | C+ACSL | 69 | 131 | 60+ | false | false | 5 | 5 | 0 | 28 | true | success | method Index(n: int) returns (i: int)
requires 1 <= n
ensures 0 <= i < n
{
i := n/2;
}
method Min(x: int, y: int) returns (m: int)
ensures m <= x && m <= y
ensures m == x || m == y
{
if (x >= y) {
m := y;
} else {
m := x;
}
assert m <= x && m <= y;
}
method Max(x: int, y: int) re... | // Generated C + ACSL
/*@
requires n >= 1;
assigns \nothing;
ensures 0 <= \result < n;
*/
int Index(int n)
{
int i = (n / 2);
/*@ assert i >= 0 && i < n; */
return i; // Dafny implicit return
}
/*@
assigns \nothing;
ensures \result <= x && \result <= y;
ensures \result == x || \result =... |
program_0049 | dafnybench_all.json | raw_248.c | Dafny | C+ACSL | 281 | 169 | 60+ | false | false | 0 | 15 | 0 | 2 | true | success | /**
This ADT represents a multiset.
*/
trait MyMultiset {
// internal invariant
ghost predicate Valid()
reads this
// abstract variable
ghost var theMultiset: multiset<int>
method Add(elem: int) returns (didChange: bool)
modifies this
requires Valid()
ensures Valid()
ensures theMulti... | // Generated C + ACSL
/*@
assigns \nothing;
ensures \result == 0 || \result == 1;
*/
int Valid(void)
{
int result = 0;
return result;
}
/*@
assigns \nothing;
ensures \result == 1;
*/
int Add(int elem)
{
int didChange = 1;
return didChange;
}
/*@
assigns \nothing;
ensures \result == 0 ... |
program_0050 | dafnybench_all.json | raw_253.c | Dafny | C+ACSL | 27 | 34 | 21-40 | true | true | 4 | 2 | 3 | 0 | true | success | // returns an index of the largest element of array 'a' in the range [0..n)
method findMax (a : array<int>, n : int) returns (r:int)
requires a.Length > 0
requires 0 < n <= a.Length
ensures 0 <= r < n <= a.Length;
ensures forall k :: 0 <= k < n <= a.Length ==> a[r] >= a[k];
ensures multiset(a[..]) == multiset(old(a[..]... | // Generated C + ACSL
/*@
requires a != \null;
requires a_len > 0;
requires 0 < n <= a_len;
requires \valid_read(a + (0 .. a_len-1));
assigns \nothing;
ensures 0 <= \result < n <= a_len;
ensures \forall integer k; 0 <= k < n ==> a[\result] >= a[k];
*/
int findMax(int* a, int a_len, int n)
{... |
program_0051 | dafnybench_all.json | raw_257.c | Dafny | C+ACSL | 23 | 36 | 21-40 | true | false | 1 | 0 | 5 | 3 | true | success | method main(n : int) returns (i: int, x: int, y:int)
requires n >= 0
ensures (i % 2 != 0) || (x == 2 * y)
{
i := 0;
x := 0;
y := 0;
while (i < n)
invariant 0 <= i <= n
invariant x == i
invariant y == i / 2
{
i := i + 1;
x := x + 1;
if (i % 2 == 0)
... | // Generated C + ACSL
/*@
requires n >= 0;
assigns \nothing;
*/
void dafny_main(int n)
{
int i = 0;
/*@ assert i >= 0 && i <= 2147483647; */
int x = 0;
/*@ assert x >= 0 && x <= 2147483647; */
int y = 0;
/*@ assert y >= 0 && y <= 2147483647; */
/*@
loop invariant 0 <= i <= n;
loop invariant x =... |
program_0052 | dafnybench_all.json | raw_258.c | Dafny | C+ACSL | 27 | 73 | 60+ | true | false | 0 | 2 | 0 | 0 | true | success | function f(x: int): int
function ff(x: int): int
lemma {:axiom} ff_eq()
ensures forall x {:trigger ff(x)} :: ff(x) == f(f(x))
lemma {:axiom} ff_eq2()
ensures forall x {:trigger f(f(x))} :: ff(x) == f(f(x))
lemma {:axiom} ff_eq_bad()
// dafny ignores this trigger because it's an obvious loop
ensures forall x... | // Generated C + ACSL
/*@
assigns \nothing;
ensures \true;
*/
int f(int x)
{
return x;
}
/*@
assigns \nothing;
ensures \true;
*/
int ff(int x)
{
return f(f(x));
}
// ```c
// /*@
// axiomatic ff_eq_properties {
// lemma ff_eq_statement:
// \forall integer x; ff(x) == f(f(x));
// }
//... |
program_0053 | dafnybench_all.json | raw_267.c | Dafny | C+ACSL | 17 | 28 | 21-40 | false | true | 0 | 0 | 0 | 0 | true | success | // RUN: %dafny /compile:0 "%s" > "%t"
// RUN: %diff "%s.expect" "%t"
function M1(f:map<int, bool>, i:int):bool
function M2(f:map<int, bool>, i:int):bool
{
M1(map j | j in f :: f[j], i)
}
lemma L(f:map<int, bool>, i:int)
requires i in f;
requires M2(f, i);
requires forall j:int, f:map<int, bool> :: M... | // Generated C + ACSL
// Note: The original code had no actual C functions or ACSL annotations to fix.
// The skipped functions M1 and M2 were not provided, and the lemma L is a
// mathematical property that cannot be directly expressed as executable C code
// with ACSL annotations.
// If M1 and M2 were boolean func... |
program_0054 | dafnybench_all.json | raw_27.c | Dafny | C+ACSL | 23 | 38 | 21-40 | true | false | 2 | 0 | 5 | 2 | true | success | method div_ent_it(a: int, b: int) returns (c: int, r: int)
// Algoritmo iterativo de la divisiΓ³n de enteros
// que calcula su cociente y resto
requires a >= 0 && b > 0
ensures a == b*c + r && 0 <= r < b
{
c := 0; r := a ;
while (r >= b)
invariant a == b * c + r && r >= 0 && b > 0
decreases r ... | // Generated C + ACSL
/*@
requires a >= 0;
requires b > 0;
assigns \nothing;
*/
void div_ent_it(int a, int b)
{
int c = 0;
/*@ assert c >= 0 && c <= 2147483647; */
int r = a;
/*@ assert r >= 0 && r <= 2147483647; */
/*@
loop invariant a == b * c + r;
loop invariant r >= 0;
loop invariant b > ... |
program_0055 | dafnybench_all.json | raw_280.c | Dafny | C+ACSL | 21 | 62 | 60+ | true | true | 4 | 2 | 2 | 17 | true | success | // Given an array of integers, it returns the sum. [1,3,3,2]->9
function Sum(xs: seq<int>): int {
if |xs| == 0 then 0 else Sum(xs[..|xs|-1]) + xs[|xs|-1]
}
method SumArray(xs: array<int>) returns (s: int)
ensures s == Sum(xs[..])
{
s := 0;
var i := 0;
while i < xs.Length
invariant 0 <= i <... | // Generated C + ACSL
/*@ logic integer Sum(int* xs, integer xs_len) =
(xs_len == 0) ? 0 : Sum(xs, xs_len - 1) + xs[xs_len - 1];
*/
/*@
requires xs_len >= 0;
requires \valid_read(xs + (0 .. xs_len - 1));
decreases xs_len;
ensures \result == Sum(xs, xs_len);
*/
int Sum(int* xs, int xs_len)
{
/*... |
program_0056 | dafnybench_all.json | raw_282.c | Dafny | C+ACSL | 6 | 14 | 0-20 | false | false | 1 | 2 | 0 | 1 | true | success | method CountLists(lists: seq<seq<int>>) returns (count: int)
ensures count >= 0
ensures count == |lists|
{
count := |lists|;
} | // Generated C + ACSL
/*@
requires lists_len >= 0;
assigns \nothing;
ensures \result >= 0;
ensures \result == lists_len;
*/
int CountLists(int** lists, int lists_len)
{
int count = lists_len;
/*@ assert count >= 0 && count <= 2147483647; */
return count; // Dafny implicit return
}
|
program_0057 | dafnybench_all.json | raw_285.c | Dafny | C+ACSL | 22 | 51 | 41-60 | false | false | 3 | 0 | 0 | 13 | true | success | method MaxSum(x:int, y:int) returns (s:int, m:int)
ensures s == x+y
ensures (m == x || m == y) && x <= m && y <= m
{
s := x+y;
if x > y{
m := x;
} else if y > x{
m := y;
} else {
m := x;
}
assert m >= y;
}
method Main()
{
var m, n := 4,5;
var a,b := MaxSum(m,n);
... | // Generated C + ACSL
/*@
requires x >= 0 && y >= 0;
requires x + y <= 2147483647;
assigns \nothing;
*/
void MaxSum(int x, int y)
{
int s = (x + y);
int m;
/*@ assert s >= 0 && s <= 2147483647; */
if ((x > y))
{
m = x;
/*@ assert m >= 0 && m <= 2147483647; */
/*@ assert m == x; */
... |
program_0058 | dafnybench_all.json | raw_287.c | Dafny | C+ACSL | 30 | 43 | 41-60 | false | true | 12 | 4 | 0 | 4 | true | success | method swap3(a: array<int>, h: int, i: int, j: int)
modifies a
requires 0 <= h < a.Length
requires 0 <= i < a.Length
requires 0 <= j < a.Length
requires i != j && j != h && h != i;
ensures a[h] == old(a[i]);
ensures a[j] == old(a[h]);
ensures a[i] == old(a[j]);
ensures forall k: int :: 0 <= k < a.Leng... | // Generated C + ACSL
/*@
requires a != \null;
requires 0 <= h < a_len;
requires 0 <= i < a_len;
requires 0 <= j < a_len;
requires i != j && j != h && h != i;
requires \valid(a + (0 .. a_len-1));
assigns a[0 .. a_len-1];
ensures a[h] == \old(a[i]);
ensures a[j] == \old(a[h]);
en... |
program_0059 | dafnybench_all.json | raw_288.c | Dafny | C+ACSL | 6 | 15 | 0-20 | false | true | 3 | 1 | 0 | 1 | true | success | method StartAndEndWithSameChar(s: string) returns (result: bool)
requires |s| > 0
ensures result <==> s[0] == s[|s| - 1]
{
result := s[0] == s[|s| - 1];
} | // Generated C + ACSL
/*@
requires s != \null;
requires s_len > 0;
requires \valid_read(s + (0 .. s_len-1));
assigns \nothing;
ensures \result <==> (s[0] == s[s_len - 1]);
*/
int StartAndEndWithSameChar(char* s, int s_len)
{
int result = (s[0] == s[(s_len - 1)]);
/*@ assert result >= 0 && resul... |
program_0060 | dafnybench_all.json | raw_29.c | Dafny | C+ACSL | 51 | 73 | 60+ | true | true | 6 | 3 | 7 | 2 | true | success | predicate sorted (a: array<int>)
reads a
{
sortedA(a, a.Length)
}
predicate sortedA (a: array<int>, i: int)
requires 0 <= i <= a.Length
reads a
{
forall k :: 0 < k < i ==> a[k-1] <= a[k]
}
method lookForMin (a: array<int>, i: int) returns (m: int)
requires 0 <= i < a.Length
ensures i <= m < a.Length
ensure... | // Generated C + ACSL
/*@
predicate sortedA(int *a, integer len, integer i) =
\forall integer k; 0 < k && k < i ==> a[k - 1] <= a[k];
*/
/*@
predicate sorted(int *a, integer len) =
sortedA(a, len, len);
*/
/*@
requires 0 <= i < a_len;
requires a != \null;
requires \valid(a + (0 .. a_len-1));
... |
program_0061 | dafnybench_all.json | raw_292.c | Dafny | C+ACSL | 18 | 31 | 21-40 | true | false | 0 | 0 | 4 | 4 | true | success | method main() returns (t1: int, t2: int, x: int, y: int)
ensures y >= 1
{
x := 1;
y := 1;
t1 := 0;
t2 := 0;
while(x <= 100000)
invariant x == y;
{
t1 := x;
t2 := y;
x := t1 + t2;
y := t1 + t2;
}
}
| // Generated C + ACSL
/*@
assigns \nothing;
*/
void dafny_main(void)
{
int x = 1;
/*@ assert x >= 0 && x <= 2147483647; */
int y = 1;
/*@ assert y >= 0 && y <= 2147483647; */
int t1 = 0;
/*@ assert t1 >= 0 && t1 <= 2147483647; */
int t2 = 0;
/*@ assert t2 >= 0 && t2 <= 2147483647; */
/*@
loop inv... |
program_0062 | dafnybench_all.json | raw_293.c | Dafny | C+ACSL | 46 | 79 | 60+ | true | true | 3 | 0 | 9 | 0 | true | success | predicate sorted(a: array?<int>, l: int, u: int)
reads a;
requires a != null;
{
forall i, j :: 0 <= l <= i <= j <= u < a.Length ==> a[i] <= a[j]
}
predicate partitioned(a: array?<int>, i: int)
reads a
requires a != null
{
forall k, k' :: 0 <= k <= i < k' < a.Length ==> a[k] <= a[k']
}
method Bu... | // Generated C + ACSL
/*@
predicate sorted(int *a, integer len, integer l, integer u) =
\forall integer i, j; 0 <= l && l <= i && i <= j && j <= u && u < len ==> a[i] <= a[j];
*/
/*@
predicate partitioned(int *a, integer len, integer i) =
\forall integer k, k_prime;
0 <= k && k <= i && i < k_prime &... |
program_0063 | dafnybench_all.json | raw_299.c | Dafny | C+ACSL | 41 | 48 | 41-60 | false | false | 1 | 2 | 0 | 13 | true | success | // A8Q2 β Steph Renee McIntyre
// Following the solutions from Carmen Bruni
method A8Q1(x: int, y: int, z: int) returns (m: int)
/*Pre-Condition*/ requires true;
/*Post-Condition*/ ensures m<=x && m<=y && m<=z;
{
/* (| true |) - Pre-Condition */
if(z<y){
/* (| z<y |) ... | // Generated C + ACSL
/*@
requires \true;
assigns \nothing;
ensures \result <= x && \result <= y && \result <= z;
ensures \result == x || \result == y || \result == z;
*/
int A8Q1(int x, int y, int z)
{
int m;
if ((z < y))
{
if ((z < x))
{
m = z;
/*@ assert m == z; */
/*... |
program_0064 | dafnybench_all.json | raw_30.c | Dafny | C+ACSL | 25 | 56 | 41-60 | true | true | 4 | 3 | 8 | 11 | true | success | method FindFirstOccurrence(arr: array<int>, target: int) returns (index: int)
requires arr != null
requires forall i, j :: 0 <= i < j < arr.Length ==> arr[i] <= arr[j]
ensures 0 <= index < arr.Length ==> arr[index] == target
ensures index == -1 ==> forall i :: 0 <= i < arr.Length ==> arr[i] != target
... | // Generated C + ACSL
/*@
requires arr != \null;
requires arr_len >= 0;
requires \valid_read(arr + (0 .. arr_len-1));
requires \forall integer i, j; 0 <= i < j < arr_len ==> arr[i] <= arr[j];
assigns \nothing;
ensures (0 <= \result < arr_len) ==> arr[\result] == target;
ensures (\result == ... |
program_0065 | dafnybench_all.json | raw_308.c | Dafny | C+ACSL | 24 | 40 | 21-40 | true | true | 3 | 2 | 5 | 2 | true | success | method RemoveElement(nums: array<int>, val: int) returns (newLength: int)
modifies nums
ensures 0 <= newLength <= nums.Length
ensures forall x :: x in nums[..newLength] ==> x != val
ensures multiset(nums[..newLength]) == multiset(old(nums[..]))[val := 0]
{
var i := 0;
var j := 0;
while i < n... | // Generated C + ACSL
/*@
requires nums != \null;
requires nums_len >= 0;
requires \valid(nums + (0 .. nums_len-1));
assigns nums[0 .. nums_len-1];
ensures 0 <= \result <= nums_len;
ensures \forall integer k; 0 <= k < \result ==> nums[k] != val;
*/
int RemoveElement(int* nums, int nums_len, int... |
program_0066 | dafnybench_all.json | raw_313.c | Dafny | C+ACSL | 14 | 35 | 21-40 | false | true | 11 | 1 | 0 | 5 | true | success | method FindMedian(a: array<int>, b: array<int>) returns (median: int)
requires a != null && b != null
requires a.Length == b.Length
requires a.Length > 0
requires forall i :: 0 <= i < a.Length - 1 ==> a[i] <= a[i + 1]
requires forall i :: 0 <= i < b.Length - 1 ==> b[i] <= b[i + 1]
ensures median... | // Generated C + ACSL
/*@
requires a != \null && b != \null;
requires a_len == b_len;
requires a_len > 0;
requires \valid_read(a + (0 .. a_len-1));
requires \valid_read(b + (0 .. b_len-1));
requires \forall integer i; 0 <= i < a_len - 1 ==> a[i] <= a[i + 1];
requires \forall integer i; 0 <=... |
program_0067 | dafnybench_all.json | raw_316.c | Dafny | C+ACSL | 48 | 24 | 21-40 | true | false | 1 | 0 | 2 | 2 | true | success | method main(x :int) returns (j :int, i :int)
requires x > 0
ensures j == 2 * x
{
i := 0;
j := 0;
while i < x
invariant 0 <= i <= x
invariant j == 2 * i
{
j := j + 2;
i := i + 1;
}
}
// MODULE main
// int i;
// int j;
// int x;
// assume(j == 0);
// assume(x >... | // Generated C + ACSL
/*@
requires x > 0;
assigns \nothing;
*/
void dafny_main(int x)
{
int i = 0;
/*@ assert i >= 0 && i <= 2147483647; */
int j = 0;
/*@ assert j >= 0 && j <= 2147483647; */
/*@
loop invariant 0 <= i <= x;
loop invariant j == 2 * i;
loop assigns i, j;
loop variant x - i;
*/
... |
program_0068 | dafnybench_all.json | raw_319.c | Dafny | C+ACSL | 20 | 32 | 21-40 | true | true | 2 | 2 | 4 | 1 | true | success | method FindMax(a: array<int>) returns (i: int)
// Annotate this method with pre- and postconditions
// that ensure it behaves as described.
requires a.Length > 0
ensures 0<= i < a.Length
ensures forall k :: 0 <= k < a.Length ==> a[k] <= a[i]
{
// Fill in the body that calculates the INDEX of the maximum.
... | // Generated C + ACSL
/*@
requires a_len > 0;
requires \valid_read(a + (0 .. a_len-1));
assigns \nothing;
ensures 0 <= \result < a_len;
ensures \forall integer k; 0 <= k < a_len ==> a[k] <= a[\result];
*/
int FindMax(int* a, int a_len)
{
int i = 0;
/*@ assert i >= 0 && i <= 2147483647; */
int... |
program_0069 | dafnybench_all.json | raw_320.c | Dafny | C+ACSL | 19 | 48 | 41-60 | true | false | 3 | 2 | 6 | 8 | true | success | function Sum(n:nat):nat
{
if n==0 then 0 else n + Sum(n-1)
}
method ComputeSum(n:nat) returns (s:nat)
ensures s ==Sum(n)
{
s := 0;
var i := 0;
while i< n
invariant 0 <= i <= n
invariant s == Sum(i)
{
s := s + i + 1;
i := i+1;
}
}
| // Generated C + ACSL
/*@ logic integer Sum(integer n) = (n == 0) ? 0 : n + Sum(n - 1); */
/*@
requires n >= 0;
decreases n;
ensures \result == Sum(n);
*/
int Sum(int n)
{
return ((n == 0)) ? (0) : ((n + Sum((n - 1))));
}
/*@
requires n >= 0;
requires n <= 65535;
ensures \result == n * (n + 1) / 2;
*/
... |
program_0070 | dafnybench_all.json | raw_323.c | Dafny | C+ACSL | 5 | 16 | 0-20 | false | false | 3 | 2 | 0 | 1 | true | success | method IsLengthOdd(s: string) returns (result: bool)
ensures result <==> |s| % 2 == 1
{
result := |s| % 2 == 1;
} | // Generated C + ACSL
/*@
requires s != \null;
requires s_len >= 0;
requires \valid_read(s + (0 .. s_len-1));
assigns \nothing;
ensures \result == 1 <==> s_len % 2 == 1;
ensures \result == 0 <==> s_len % 2 == 0;
*/
int IsLengthOdd(char* s, int s_len)
{
int result = ((s_len % 2) == 1);
/*@ a... |
program_0071 | dafnybench_all.json | raw_324.c | Dafny | C+ACSL | 27 | 36 | 21-40 | true | true | 2 | 2 | 5 | 1 | true | success | method FindMax(a: array<int>) returns (i: int)
// Annotate this method with pre- and postconditions
// that ensure it behaves as described.
requires 0 < a.Length
ensures 0 <= i < a.Length
ensures forall k: int :: 0 <= k < a.Length ==> a[k] <= a[i]
{
// Fill in the body that calculates the INDEX ... | // Generated C + ACSL
/*@
requires a_len > 0;
requires \valid(a + (0 .. a_len-1));
assigns \nothing;
ensures 0 <= \result < a_len;
ensures \forall integer k; 0 <= k < a_len ==> a[k] <= a[\result];
*/
int FindMax(int* a, int a_len)
{
int j = 0;
int max = a[0];
int i = 1;
/*@ assert i >= 0 &&... |
program_0072 | dafnybench_all.json | raw_327.c | Dafny | C+ACSL | 27 | 37 | 21-40 | true | true | 4 | 0 | 6 | 2 | true | success | method findMax(a:array<int>) returns (pos:int, maxVal: int)
requires a.Length > 0;
requires forall i :: 0 <= i < a.Length ==> a[i] >= 0;
ensures forall i :: 0 <= i < a.Length ==> a[i] <= maxVal;
ensures exists i :: 0 <= i < a.Length && a[i] == maxVal;
ensures 0 <= pos < a.Length
ensures a[pos] == maxVal;
{... | // Generated C + ACSL
/*@
requires a_len > 0;
requires a != \null;
requires \valid(a + (0 .. a_len-1));
requires \forall integer i; 0 <= i < a_len ==> a[i] >= 0;
assigns \nothing;
*/
void findMax(int* a, int a_len)
{
int pos = 0;
/*@ assert pos >= 0 && pos <= 2147483647; */
int maxVal = a[0];... |
program_0073 | dafnybench_all.json | raw_328.c | Dafny | C+ACSL | 17 | 40 | 21-40 | true | true | 3 | 2 | 3 | 7 | true | success | method FindSmallest(s: array<int>) returns (min: int)
requires s.Length > 0
ensures forall i :: 0 <= i < s.Length ==> min <= s[i]
ensures exists i :: 0 <= i < s.Length && min == s[i]
{
min := s[0];
for i := 1 to s.Length
invariant 0 <= i <= s.Length
invariant forall k :: 0 <= k < i ==> min <= s[k]
... | // Generated C + ACSL
/*@
requires s != \null;
requires s_len > 0;
requires \valid_read(s + (0 .. s_len-1));
assigns \nothing;
ensures \forall integer i; 0 <= i < s_len ==> \result <= s[i];
ensures \exists integer i; 0 <= i < s_len && \result == s[i];
*/
int FindSmallest(int* s, int s_len)
{
... |
program_0074 | dafnybench_all.json | raw_331.c | Dafny | C+ACSL | 41 | 49 | 41-60 | true | true | 4 | 2 | 2 | 3 | true | success | method binarySearch(a:array<int>, val:int) returns (pos:int)
requires a.Length > 0
requires forall i, j :: 0 <= i < j < a.Length ==> a[i] <= a[j]
ensures 0 <= pos < a.Length ==> a[pos] == val
ensures pos < 0 || pos >= a.Length ==> forall i :: 0 <= i < a.Length ==> a[i] != val
{
var left := 0;
var right :... | // Generated C + ACSL
/*@
requires a != \null;
requires a_len > 0;
requires \valid_read(a + (0 .. a_len-1));
requires \forall integer i, j; 0 <= i < j < a_len ==> a[i] <= a[j];
assigns \nothing;
ensures (0 <= \result < a_len) ==> a[\result] == val;
ensures (\result < 0 || \result >= a_len) ... |
program_0075 | dafnybench_all.json | raw_332.c | Dafny | C+ACSL | 97 | 168 | 60+ | true | true | 18 | 14 | 15 | 12 | true | success | //Algorithm 1: From left to right return the first
method mmaximum1(v:array<int>) returns (i:int)
requires v.Length>0
ensures 0<=i<v.Length
ensures forall k:: 0<=k<v.Length ==> v[i]>=v[k]
{
var j:=1; i:=0;
while(j<v.Length)
decreases v.Length - j
invariant 0<=j<=v.Length
invariant 0<=i... | // Generated C + ACSL
/*@
requires v_len > 0;
requires v != \null;
requires \valid(v + (0 .. v_len-1));
assigns \nothing;
ensures 0 <= \result < v_len;
ensures \forall integer k; 0 <= k < v_len ==> v[\result] >= v[k];
*/
int mmaximum1(int* v, int v_len)
{
int j = 1;
int i = 0;
/*@ assert ... |
program_0076 | dafnybench_all.json | raw_333.c | Dafny | C+ACSL | 131 | 91 | 60+ | true | false | 1 | 1 | 4 | 41 | true | success | /**
(a) Verify whether or not the following program
satisfies total correctness.
You should use weakest precondition reasoning
and may extend the loop invariant if required.
You will need to add a decreases clause to prove termination
(a) Weakest precondition proof (without termination) (6 m... | // Generated C + ACSL
/*@ logic integer fusc(integer n); */
/*@
axiomatic fusc_properties {
axiom rule1_statement: fusc(0) == 0;
axiom rule2_statement: fusc(1) == 1;
axiom rule3_statement:
\forall integer n; n >= 0 ==> fusc(2 * n) == fusc(n);
axiom rule4_statement:
\forall integer n; n >... |
program_0077 | dafnybench_all.json | raw_334.c | Dafny | C+ACSL | 68 | 89 | 60+ | false | false | 3 | 4 | 0 | 18 | true | success |
/*
* Formal specification and verification of a dynamic programming algorithm for calculating C(n, k).
* FEUP, MIEIC, MFES, 2020/21.
*/
// Initial recursive definition of C(n, k), based on the Pascal equality.
function comb(n: nat, k: nat): nat
requires 0 <= k <= n
{
if k == 0 || k == n then 1 else comb(n-1, k)... | // Generated C + ACSL
/*@ axiomatic Binomial {
@ logic integer comb(integer n, integer k);
@
@ axiom comb_base_k0:
@ \forall integer n; 0 <= n ==> comb(n, 0) == 1;
@
@ axiom comb_base_kn:
@ \forall integer n; 0 <= n ==> comb(n, n) == 1;
@
@ axiom comb_recursive:
@ \forall integer n, k; ... |
program_0078 | dafnybench_all.json | raw_336.c | Dafny | C+ACSL | 83 | 39 | 21-40 | true | true | 3 | 2 | 4 | 1 | true | success | // RUN: %dafny /compile:0 /dprint:"%t.dprint" "%s" > "%t"
// RUN: %diff "%s.expect" "%t"
/*
Rustan Leino, 5 Oct 2011
COST Verification Competition, Challenge 1: Maximum in an array
http://foveoos2011.cost-ic0701.org/verification-competition
Given: A non-empty integer array a.
Verify that the index returned by the m... | // Generated C + ACSL
/*@
requires a != \null;
requires a_len > 0;
requires \valid(a + (0 .. a_len-1));
assigns \nothing;
ensures 0 <= \result < a_len;
ensures \forall integer i; 0 <= i < a_len ==> a[i] <= a[\result];
*/
int max(int* a, int a_len)
{
int x = 0;
/*@ assert x >= 0 && x <= 2147... |
program_0079 | dafnybench_all.json | raw_339.c | Dafny | C+ACSL | 33 | 25 | 21-40 | true | false | 1 | 0 | 3 | 2 | true | success | method main(n: int) returns (sum: int, i: int)
requires n >= 0
{
sum := 0;
i := 0;
while(i < n)
invariant sum >= 0
invariant 0 <= i <= n
{
sum := sum + i;
i := i + 1;
}
}
// MODULE main
// int i;
// int sum;
// int n;
// assume(sum == 0);
// assume(n >= 0);
/... | // Generated C + ACSL
/*@
requires n >= 0;
assigns \nothing;
*/
void dafny_main(int n)
{
int sum = 0;
/*@ assert sum >= 0 && sum <= 2147483647; */
int i = 0;
/*@ assert i >= 0 && i <= 2147483647; */
/*@
loop invariant 0 <= i <= n;
loop invariant sum >= 0;
loop invariant sum == i * (i - 1) / 2;
... |
program_0080 | dafnybench_all.json | raw_342.c | Dafny | C+ACSL | 80 | 80 | 60+ | false | true | 1 | 8 | 0 | 0 | true | success | // Nim version 3: fix the bug and demonstrate a behavior.
//
// In this version, we've fixed the bug by actually flipping whose turn it is in
// each transition.
datatype Player = P1 | P2
{
function Other(): Player {
if this == P1 then P2 else P1
}
}
datatype Variables = Variables(piles: seq<nat>, turn: Player... | // Generated C + ACSL
typedef enum { P1, P2 } Player;
typedef struct {
int piles[3];
int piles_len;
Player turn;
} Variables;
typedef struct {
int p;
int take;
} TurnStepData;
typedef enum { TURN_STEP, NOOP_STEP } StepType;
typedef struct {
StepType type;
TurnStepData data;
} Step;
/*@
assigns \... |
End of preview. Expand in Data Studio
CRYCHIC Dafny-to-ACSL-C Verified Translation Benchmark
This anonymized review artifact accompanies the NeurIPS 2026 Evaluations and Datasets submission: CRYCHIC: A Universal Framework for Cross-Language Verified Code Translation.
CRYCHIC translates verified Dafny programs into C programs annotated with ACSL specifications, then checks the generated artifacts with Frama-C WP. This release contains the 1,679 fully verified Dafny/C+ACSL pairs used as the positive benchmark corpus.
The Dafny source programs in this benchmark are derived from the Re:Form corpus (Yan et al., 2025): https://github.com/Veri-Code/ReForm.
Contents
crychic_dataset_release/
βββ programs/ # Generated verified C+ACSL programs
βββ sources/ # Original Dafny source programs
βββ records.jsonl # Hugging Face / tabular viewer records with code text
βββ records.csv # Lightweight metadata table without code text
βββ manifest.jsonl # File-level manifest, provenance, checksums
βββ metadata.json # Full dataset metadata and statistics
βββ croissant.json # Croissant + RAI metadata for NeurIPS E&D hosting
βββ DATASHEET.md # Dataset card / datasheet
βββ BENCHMARK_PROTOCOL.md # Evaluation protocol
βββ NEURIPS_ED_SUBMISSION_CHECKLIST.md
βββ LICENSE.md
βββ checksums.sha256
Dataset Summary
| Metric | Value |
|---|---|
| Source programs evaluated | 6,654 |
| Generated C programs | 6,540 |
| Fully verified release pairs | 1,679 |
| Verification pass rate | 25.3% |
| GCC syntax success | 92.2% |
| ACSL syntax success | 73.5% |
| Programs with loops | 721 |
| Programs with arrays | 628 |
Programs with ACSL requires |
1,344 |
Programs with ACSL ensures |
1,217 |
| Programs with loop invariants | 675 |
| Average Dafny LOC | 37.07 |
| Average C+ACSL LOC | 51.15 |
Schema
Each records.jsonl row contains:
program_id: anonymized stable ID.source_dataset,original_file: source subset and anonymized original file name.dafny_code: original Dafny program.c_code: generated C+ACSL program.dafny_loc,c_loc,complexity_bucket: size metadata.requires_count,ensures_count,loop_invariant_count,assert_count: ACSL feature counts.verified,final_status: final verification label. All released rows are fully verified.
Intended Use
Use this artifact to evaluate and analyze systems for cross-language verified-code generation, ACSL annotation generation, and verifier-guided repair. The primary benchmark task is:
Input: verified Dafny program.
Output: C program with ACSL annotations that passes the CRYCHIC Frama-C WP verification protocol.
Verification Command
frama-c -wp -wp-prover alt-ergo,z3 -wp-timeout 5 programs/program_0001.c
The exact benchmark protocol and toolchain assumptions are documented in BENCHMARK_PROTOCOL.md.
Responsible Use
The generated C+ACSL programs are research artifacts. Passing the stated verifier configuration does not imply deployment safety, security, or correctness outside the encoded specifications and toolchain assumptions.
License and Anonymity
This is an anonymous review artifact. Licensing and provenance are documented in LICENSE.md. Re:Form source-data use is permission-based with attribution; after acceptance, anonymous metadata will be replaced with author metadata and final public release terms. The final release will cite the Re:Form paper and link back to https://github.com/Veri-Code/ReForm.
Citation
@inproceedings{anonymous2026crychic,
title = {CRYCHIC: A Universal Framework for Cross-Language Verified Code Translation},
author = {Anonymous},
booktitle = {Advances in Neural Information Processing Systems},
year = {2026},
note = {Under review}
}
- Downloads last month
- 1,822