file_name stringlengths 33 36 | verified_c_file_content stringlengths 38 76k | dependency_acls stringlengths 0 9.54k | function_implementation stringlengths 12 11.9k | verified bool 1
class | total_goals int64 1 124 | verified_goals int64 1 124 | error_cause stringclasses 1
value | c_code_snippet stringlengths 12 11.9k | acsl_snippet stringlengths 0 9.54k |
|---|---|---|---|---|---|---|---|---|---|
frama_c_files_v2/test_frama_c_2054.c | /*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/
int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
}
|
/*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/ | int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
} | true | 7 | 7 | int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
} | /*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/ | |
frama_c_files_v2/test_frama_c_717.c | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \vali... |
/*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/ | int pick_index(int n) { return 0; } | true | 4 | 4 | int pick_index(int n) { return 0; } | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/ | |
frama_c_files_v2/test_frama_c_717.c | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \vali... |
/*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \va... | int pick_first(int* p) {
return p[0];
} | true | 18 | 18 | int pick_first(int* p) {
return p[0];
} | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \vali... | |
frama_c_files_v2/test_frama_c_2473.c | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0... | int matcher_ab(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x7;
if (x3) {
x7 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x6;
if (x4) {
x6 = 0/*false*/;
} else {
x6 = 0/*false*/;
}
x7 = x6;
}
int x17;
if (x3) {
x17 = 0/*false*/;
} else {
int... | true | 21 | 21 | int matcher_ab(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x7;
if (x3) {
x7 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x6;
if (x4) {
x6 = 0/*false*/;
} else {
x6 = 0/*false*/;
}
x7 = x6;
}
int x17;
if (x3) {
x17 = 0/*false*/;
} else {
int... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0... | |
frama_c_files_v2/test_frama_c_2371.c | /*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/
void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a... |
/*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/ | void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | true | 23 | 23 | void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | /*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/ | |
frama_c_files_v2/test_frama_c_1505.c | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/
void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
... |
/*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ | void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
} | true | 24 | 24 | void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
} | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ | |
frama_c_files_v2/test_frama_c_1653.c | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/
void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
}
/*@
requires ((x26>0) &&
\valid(x25+(0..x26-1)));
ens... | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/ | void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
} | true | 9 | 9 | void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
} | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/ | |
frama_c_files_v2/test_frama_c_1345.c | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b... | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==... | enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
} | true | 7 | 7 | enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
} | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==... | |
frama_c_files_v2/test_frama_c_1345.c | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b... | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && ... | enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
} | true | 30 | 30 | enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
} | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && ... | |
frama_c_files_v2/test_frama_c_2823.c | #define LENGTH 100
int vec[LENGTH];
int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/
int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0... | int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/ | int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0 <= max < i <= size &&
@ (\forall integer a;
@ 0 <= a < i ==> u[a] <= u[max]);
@ loop assigns i, max;
@ loop variant size-i;
@*/
while (i < size) {
if (u[i] > u[max])... | true | 13 | 13 | int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0 <= max < i <= size &&
@ (\forall integer a;
@ 0 <= a < i ==> u[a] <= u[max]);
@ loop assigns i, max;
@ loop variant size-i;
@*/
while (i < size) {
if (u[i] > u[max])... | int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/ | |
frama_c_files_v2/test_frama_c_1665.c | /*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/
int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invar... |
/*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/ | int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invariant 0 <= i < n;
loop invariant 0 <= minInd < n;
loop invariant 0 <= minInd <= i;
loop invariant \forall integer k; 0 <= k <= i ==> t[minInd] <= t[k];
loop invariant \forall integer k; 0 <... | true | 23 | 23 | int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invariant 0 <= i < n;
loop invariant 0 <= minInd < n;
loop invariant 0 <= minInd <= i;
loop invariant \forall integer k; 0 <= k <= i ==> t[minInd] <= t[k];
loop invariant \forall integer k; 0 <... | /*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/ | |
frama_c_files_v2/test_frama_c_2303.c | /*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s[i... |
/*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s... | static int indexOf(char* s, char c, int from, int to) {
/*@ loop invariant from <= k <= to;
@ loop invariant \forall int i; from <= i < k ==> s[i] != c;
@ loop assigns k;
@ loop variant to - k;
@*/
for(int k = from; k < to; k++) {
if(s[k] == c) {
return k;
}
}
return -1;
} | true | 17 | 17 | static int indexOf(char* s, char c, int from, int to) {
/*@ loop invariant from <= k <= to;
@ loop invariant \forall int i; from <= i < k ==> s[i] != c;
@ loop assigns k;
@ loop variant to - k;
@*/
for(int k = from; k < to; k++) {
if(s[k] == c) {
return k;
}
}
return -1;
} | /*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s[i... | |
frama_c_files_v2/test_frama_c_412.c | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = ... | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/ | int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return x7;
} | true | 4 | 4 | int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return x7;
} | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/ | |
frama_c_files_v2/test_frama_c_646.c | /*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/
int max2(int *r... |
/*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/ | int max2(int *r, int* i, int* j) {
if (!r) return -1;
*r = (*i < *j) ? *j : *i;
return 0;
} | true | 23 | 23 | int max2(int *r, int* i, int* j) {
if (!r) return -1;
*r = (*i < *j) ? *j : *i;
return 0;
} | /*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/ | |
frama_c_files_v2/test_frama_c_2330.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_switch2.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int status=0;
int rr=1;
//@ global invariant inv : 0<=rr<=50;
/*@ requires rr<50;
@ behavior j :
... | int rr=1;
/*@ requires rr<50;
@ behavior j :
@ ensures rr<51;
*/ | void opa() {
rr++;
} | true | 4 | 4 | void opa() {
rr++;
} | int rr=1;
/*@ requires rr<50;
@ behavior j :
@ ensures rr<51;
*/ | |
frama_c_files_v2/test_frama_c_838.c | /*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complete ... |
/*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complet... | int is_sorted(int a[],int n){
/*@
loop invariant \forall integer j;
1<=j<i ==> a[j]>=a[j-1];
loop invariant 1<= i <= n;
loop assigns i;
loop variant n-i;
*/
for (int i=1;i<n;i++){
if (a[i-1]>a[i]){
return 0;
}
}
return 1;
} | true | 17 | 17 | int is_sorted(int a[],int n){
/*@
loop invariant \forall integer j;
1<=j<i ==> a[j]>=a[j-1];
loop invariant 1<= i <= n;
loop assigns i;
loop variant n-i;
*/
for (int i=1;i<n;i++){
if (a[i-1]>a[i]){
return 0;
}
}
return 1;
} | /*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complete ... | |
frama_c_files_v2/test_frama_c_2524.c | /*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/
int min(int a, int b){
if(a<b)
return a;
else
return b;
} |
/*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/ | int min(int a, int b){
if(a<b)
return a;
else
return b;
} | true | 4 | 4 | int min(int a, int b){
if(a<b)
return a;
else
return b;
} | /*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/ | |
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/ | int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
} | true | 4 | 4 | int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/ | |
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/ | int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
} | true | 8 | 8 | int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/ | |
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | int minus1(int x6) {
int x8 = x6 - 1;
return x8;
} | true | 13 | 13 | int minus1(int x6) {
int x8 = x6 - 1;
return x8;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | |
frama_c_files_v2/test_frama_c_1103.c | /*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/
void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main()
{
int a=13,b=14;
swap(&a,&b);
}
|
/*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/ | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | true | 7 | 7 | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | /*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/ | |
frama_c_files_v2/test_frama_c_1714.c | /*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/
int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
}
int main(){
int ch ;
ch = alphabet_letter('x') ;
//@ assert ch==... |
/*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/ | int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
} | true | 4 | 4 | int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
} | /*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/ | |
frama_c_files_v2/test_frama_c_1412.c | #include<assert.h>
/*@
@ ensures \result == 1;
@
*/
int gimmeOne() {
return 1;
}
int main() {
int x = gimmeOne();
assert(x == 1);
}
| #include<assert.h>
/*@
@ ensures \result == 1;
@
*/ | int gimmeOne() {
return 1;
} | true | 3 | 3 | int gimmeOne() {
return 1;
} | #include<assert.h>
/*@
@ ensures \result == 1;
@
*/ | |
frama_c_files_v2/test_frama_c_84.c | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensur... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensu... | int matcher_a_or_b(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x9;
if (x3) {
x9 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x8;
if (x4) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x8 = x7;
} else {
x8 = 0/*false*/;
}
x9 = x... | true | 17 | 17 | int matcher_a_or_b(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x9;
if (x3) {
x9 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x8;
if (x4) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x8 = x7;
} else {
x8 = 0/*false*/;
}
x9 = x... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensu... | |
frama_c_files_v2/test_frama_c_187.c |
/*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint b... |
/*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint b... | void max_ptr(int*p, int*q) {
if (*p > *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
} | true | 13 | 13 | void max_ptr(int*p, int*q) {
if (*p > *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
} | /*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint beh... | |
frama_c_files_v2/test_frama_c_679.c | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | true | 26 | 26 | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2301.c | /*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/
int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
t... |
/*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/ | int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
... | true | 26 | 26 | int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
... | /*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/ | |
frama_c_files_v2/test_frama_c_1775.c | // TODO : mettre les bonnes annotations...
/*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/
void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauc... |
/*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/ | void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauche
/*@
loop invariant -1 <= i <= n-1;
loop invariant
\forall int k; i < k <= n-1 ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k... | true | 33 | 33 | void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauche
/*@
loop invariant -1 <= i <= n-1;
loop invariant
\forall int k; i < k <= n-1 ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k... | /*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/ | |
frama_c_files_v2/test_frama_c_919.c | // __out o, __in i
/*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/
void OutAndIn(int *i, int *o) {
*o = *i;
}
void OutAndIn_test()
{
int a = 5;
int b = 0;
OutAndIn(&a, &b);
//@ assert a == b;
}
|
/*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/ | void OutAndIn(int *i, int *o) {
*o = *i;
} | true | 6 | 6 | void OutAndIn(int *i, int *o) {
*o = *i;
} | /*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/ | |
frama_c_files_v2/test_frama_c_2746.c | /* ****************************************************************************
MAXIMUM D'UN TABLEAU
L'énoncé est introduit sous la forme de commentaires C. Les différents
morceaux de programme et de spécification à considérer sont mentionnés en
programmation littéraire :
... | #include <limits.h>
/*@ requires \valid(t+(0..len-1));
@ requires len >= 0;
@ requires \forall integer n; 0 <= n < len ==> t[n] <= INT_MAX;
@ assigns \nothing;
@ behavior t_vide:
@ assumes len == 0;
@ ensures \result == -1;
@ behavior t_max:
@ assumes len > 0;
@ ensures \forall integer n;... | int max_idx(unsigned int *t, int len) {
int max = 0;
/*@loop invariant 1 <= i <= len;
@loop invariant \forall integer n; 0 <= n < i ==> t[max] >= t[n];
@loop invariant 0 <= max < len;
@loop assigns i, max;
@loop variant len - i;
@ */
for(int i = 1; i < len; i++)
if (t[max] < t[i])
ma... | true | 34 | 34 | int max_idx(unsigned int *t, int len) {
int max = 0;
/*@loop invariant 1 <= i <= len;
@loop invariant \forall integer n; 0 <= n < i ==> t[max] >= t[n];
@loop invariant 0 <= max < len;
@loop assigns i, max;
@loop variant len - i;
@ */
for(int i = 1; i < len; i++)
if (t[max] < t[i])
ma... | #include <limits.h>
/*@ requires \valid(t+(0..len-1));
@ requires len >= 0;
@ requires \forall integer n; 0 <= n < len ==> t[n] <= INT_MAX;
@ assigns \nothing;
@ behavior t_vide:
@ assumes len == 0;
@ ensures \result == -1;
@ behavior t_max:
@ assumes len > 0;
@ ensures \forall integer n;... | |
frama_c_files_v2/test_frama_c_1795.c | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_... | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/ | int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
} | true | 8 | 8 | int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
} | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/ | |
frama_c_files_v2/test_frama_c_669.c | /*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/
int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
}
|
/*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/ | int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
} | true | 7 | 7 | int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
} | /*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/ | |
frama_c_files_v2/test_frama_c_2344.c | /*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/
void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall... |
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/ | void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
} | true | 20 | 20 | void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
} | /*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/ | |
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | void dfa_spec_aab1(char* r, char* s) {} | true | 4 | 4 | void dfa_spec_aab1(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | |
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | void dfa_spec_aab1_1(char* r, char* s) {} | true | 8 | 8 | void dfa_spec_aab1_1(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | |
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | void dfa_spec_aab0(char* r, char* s) {} | true | 12 | 12 | void dfa_spec_aab0(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | |
frama_c_files_v2/test_frama_c_1432.c | /*@ ensures \result==0 || \result==1;
assigns \nothing;
*/
int predicate(int v) {
return v % 2 == 0;
}
/*@ requires n > 0;
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
ensures 0 <= \result <= n;
ensures \forall int i; 0 <= i < \result ==> 0 <= o[i] < n;
ensures \forall int i; 0 ... |
/*@ ensures \result==0 || \result==1;
assigns \nothing;
*/ | int predicate(int v) {
return v % 2 == 0;
} | true | 4 | 4 | int predicate(int v) {
return v % 2 == 0;
} | /*@ ensures \result==0 || \result==1;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1527.c | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | true | 26 | 26 | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2890.c | /*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/
int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
}
extern int h ;
int main(){
h =42;
int a =24,b =42;
int x= max_ptr(&a,&b);
}
|
/*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/ | int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
} | true | 7 | 7 | int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
} | /*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/ | |
frama_c_files_v2/test_frama_c_1708.c | /*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/
void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
int a = 42;
int b = 37;
swap(&a, &b);
//@ assert a == 37 && b == 42;
return 0;
}
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/ | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | true | 10 | 10 | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | /*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/ | |
frama_c_files_v2/test_frama_c_537.c | /*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i) ... |
/*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i... | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
// we try to maintain an essence of current best in order to reach total (best)
// for that we replace N <- i+1 (to look until i array positions)
/*@ loop invariant 0 <= i <= N;
@ loop invariant 0 <= best <= N;
@ loop invariant 0 < i <==> 0... | true | 34 | 34 | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
// we try to maintain an essence of current best in order to reach total (best)
// for that we replace N <- i+1 (to look until i array positions)
/*@ loop invariant 0 <= i <= N;
@ loop invariant 0 <= best <= N;
@ loop invariant 0 < i <==> 0... | /*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i) ... | |
frama_c_files_v2/test_frama_c_1127.c | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/ | int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
} | true | 8 | 8 | int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
} | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/ | |
frama_c_files_v2/test_frama_c_1127.c | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
} | true | 17 | 17 | char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
} | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | |
frama_c_files_v2/test_frama_c_2724.c | /*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for Ve... |
/*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for ... | int eq_VC(char *a1, char *a2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> a1[j]==a2[j];
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (a1[i] != a2[i]) return 0;
}
r... | true | 19 | 19 | int eq_VC(char *a1, char *a2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> a1[j]==a2[j];
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (a1[i] != a2[i]) return 0;
}
r... | /*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for Ve... | |
frama_c_files_v2/test_frama_c_478.c | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x1... | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x... | int eq_vec_Int(int * x16, int x17, int * x18, int x19) {
int x21 = x17 == x19;
int x33;
if (x21) {
int x32 = 1;
/*@ loop invariant (0 <= x24 <= x17);
loop invariant \forall int x23; (0 <= x23 < x24) ==> (x16[x23]==x18[x23]);
loop assigns x24;
loop variant (x17-x24); */
for (int x24 = ... | true | 18 | 18 | int eq_vec_Int(int * x16, int x17, int * x18, int x19) {
int x21 = x17 == x19;
int x33;
if (x21) {
int x32 = 1;
/*@ loop invariant (0 <= x24 <= x17);
loop invariant \forall int x23; (0 <= x23 < x24) ==> (x16[x23]==x18[x23]);
loop assigns x24;
loop variant (x17-x24); */
for (int x24 = ... | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
} | true | 14 | 14 | void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | true | 28 | 28 | void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | true | 40 | 40 | void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
} | true | 90 | 90 | void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
} | true | 115 | 115 | void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma2f(char* s, int i, int j) {
//@assert bwd2(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j-1);
//@assert s[j-1]=='B';
//@assert s[j]=='\0' ==> match_aapb(s, i, j);
} | true | 124 | 124 | void lemma2f(char* s, int i, int j) {
//@assert bwd2(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j-1);
//@assert s[j-1]=='B';
//@assert s[j]=='\0' ==> match_aapb(s, i, j);
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2740.c | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... |
/*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) |... | void mv_mult2_bool(int *m, int *v, int *o) {
o[0] = (m[0] && v[0]) || (m[1] && v[1]);
o[1] = (m[2] && v[0]) || (m[3] && v[1]);
} | true | 24 | 24 | void mv_mult2_bool(int *m, int *v, int *o) {
o[0] = (m[0] && v[0]) || (m[1] && v[1]);
o[1] = (m[2] && v[0]) || (m[3] && v[1]);
} | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... | |
frama_c_files_v2/test_frama_c_2740.c | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... |
/*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) |... | void mv_mult2(int *m, int *v, int *o) {
o[0] = m[0]*v[0]+m[1]*v[1];
o[1] = m[2]*v[0]+m[3]*v[1];
} | true | 52 | 52 | void mv_mult2(int *m, int *v, int *o) {
o[0] = m[0]*v[0]+m[1]*v[1];
o[1] = m[2]*v[0]+m[3]*v[1];
} | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... | |
frama_c_files_v2/test_frama_c_2740.c | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... |
/*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) |... | void mv_mult2r_bool(int n, int *m, int *v, int *o) {
/*@
loop invariant 0 <= r <= n;
loop invariant \forall int i; 0 <= i < r ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
loop assigns r, o[0..n-1];
loop variant n-r;
*/
for (int r = 0; r < n; r++) {
int t = 0;
/*@
loop invar... | true | 86 | 86 | void mv_mult2r_bool(int n, int *m, int *v, int *o) {
/*@
loop invariant 0 <= r <= n;
loop invariant \forall int i; 0 <= i < r ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
loop assigns r, o[0..n-1];
loop variant n-r;
*/
for (int r = 0; r < n; r++) {
int t = 0;
/*@
loop invar... | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... | |
frama_c_files_v2/test_frama_c_2740.c | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... |
/*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) |... | void mv_mult2s_bool(int n, int *m, int *v, int *o) {
int r = 0;
int t = 0;
/*@
loop invariant 0 <= c <= n;
loop invariant t == ((c==0) ? 0 : ((m[n*r+0] && v[0]) || ((c==1)? 0 : (m[n*r+1] && v[1]))));
loop assigns c, t;
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
t = t || (m[n*r+c] &... | true | 112 | 112 | void mv_mult2s_bool(int n, int *m, int *v, int *o) {
int r = 0;
int t = 0;
/*@
loop invariant 0 <= c <= n;
loop invariant t == ((c==0) ? 0 : ((m[n*r+0] && v[0]) || ((c==1)? 0 : (m[n*r+1] && v[1]))));
loop assigns c, t;
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
t = t || (m[n*r+c] &... | /*@
requires \valid(m+(0..3));
requires \valid(v+(0..1));
requires \valid(o+(0..1));
requires \forall int i; \forall int j;
0 <= i < 4 && 0 <= j < 2 ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < 2 && 0 <= j < 2 ==> \separated(v+i,o+j);
assigns o[0..1];
ensures o[0] == (m[0] && v[0]) || ... | |
frama_c_files_v2/test_frama_c_1394.c | /*@ ensures \result<=a && \result<=b && (\result==a || \result==b);
*/
int min(int a, int b) {
return (a<b)?a:b;
} |
/*@ ensures \result<=a && \result<=b && (\result==a || \result==b);
*/ | int min(int a, int b) {
return (a<b)?a:b;
} | true | 3 | 3 | int min(int a, int b) {
return (a<b)?a:b;
} | /*@ ensures \result<=a && \result<=b && (\result==a || \result==b);
*/ | |
frama_c_files_v2/test_frama_c_2940.c | /*@
ensures \result==a || \result==b;
*/
int max(int a,int b)
{
if(a==b) return a;
return a>b?a:b;
}
|
/*@
ensures \result==a || \result==b;
*/ | int max(int a,int b)
{
if(a==b) return a;
return a>b?a:b;
} | true | 3 | 3 | int max(int a,int b)
{
if(a==b) return a;
return a>b?a:b;
} | /*@
ensures \result==a || \result==b;
*/ | |
frama_c_files_v2/test_frama_c_547.c | /*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a;
*/
int divmult(int a, int b)
{
return (a / b) * b + (a % b);
}
|
/*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a;
*/ | int divmult(int a, int b)
{
return (a / b) * b + (a % b);
} | true | 12 | 12 | int divmult(int a, int b)
{
return (a / b) * b + (a % b);
} | /*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a;
*/ | |
frama_c_files_v2/test_frama_c_2497.c | /*@ predicate sorted{L}(int* a, int length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires sorted(a,length);
requires length >=0;
assigns \nothing;
behavior exists:
assumes \exists integer i; 0<=i<length && a[i] == key;
ensures ... |
/*@ predicate sorted{L}(int* a, int length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires sorted(a,length);
requires length >=0;
assigns \nothing;
behavior exists:
assumes \exists integer i; 0<=i<length && a[i] == key;
ensure... | int binary_search(int* a, int length, int key) {
int low = 0, high = length - 1;
/*@ loop invariant 0<=low<=high+1;
loop invariant high<length;
loop assigns low,high;
loop invariant \forall integer k; 0<=k<low ==> a[k] < key;
loop invariant \forall integer k; high<k<length ==> a[k] > key;
... | true | 29 | 29 | int binary_search(int* a, int length, int key) {
int low = 0, high = length - 1;
/*@ loop invariant 0<=low<=high+1;
loop invariant high<length;
loop assigns low,high;
loop invariant \forall integer k; 0<=k<low ==> a[k] < key;
loop invariant \forall integer k; high<k<length ==> a[k] > key;
... | /*@ predicate sorted{L}(int* a, int length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires sorted(a,length);
requires length >=0;
assigns \nothing;
behavior exists:
assumes \exists integer i; 0<=i<length && a[i] == key;
ensures ... | |
frama_c_files_v2/test_frama_c_640.c | #include<string.h>
/*@
predicate star_A(char* s, integer i, integer n) =
n==0 || (n>0 && (s[i+n-1]=='A' && star_A(s, i, n-1)));
predicate match_aapb(char* s) =
strlen(s)>=2 && s[0]=='A' && star_A(s,1,strlen(s)-2) && s[strlen(s)-1]=='B';
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires 0 <= i;
r... | #include<string.h>
/*@
predicate star_A(char* s, integer i, integer n) =
n==0 || (n>0 && (s[i+n-1]=='A' && star_A(s, i, n-1)));
predicate match_aapb(char* s) =
strlen(s)>=2 && s[0]=='A' && star_A(s,1,strlen(s)-2) && s[strlen(s)-1]=='B';
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires 0 <= i;
r... | int lemma_not_star_A(char* s, int i, int n, int stop) {
int j = n;
/*@
loop invariant 0 <= j <= stop;
loop invariant !star_A(s, i, j);
loop assigns j;
loop variant stop-j;
*/
while (j!=stop) {
j++;
}
return 0;
} | true | 13 | 13 | int lemma_not_star_A(char* s, int i, int n, int stop) {
int j = n;
/*@
loop invariant 0 <= j <= stop;
loop invariant !star_A(s, i, j);
loop assigns j;
loop variant stop-j;
*/
while (j!=stop) {
j++;
}
return 0;
} | #include<string.h>
/*@
predicate star_A(char* s, integer i, integer n) =
n==0 || (n>0 && (s[i+n-1]=='A' && star_A(s, i, n-1)));
predicate match_aapb(char* s) =
strlen(s)>=2 && s[0]=='A' && star_A(s,1,strlen(s)-2) && s[strlen(s)-1]=='B';
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires 0 <= i;
r... | |
frama_c_files_v2/test_frama_c_1033.c | /*@ requires \valid(arr + (0..size-1));
requires \forall integer i; 0 <= i < size ==> 0 <= arr[i] < size;
requires 0 <= addr < size;
assigns arr[0..size-1];
ensures arr[\at(arr[addr],Pre)] == 0;
*/
void indaddr(unsigned size, int arr[size], unsigned addr)
{
arr[arr[addr]] = 0;
}
|
/*@ requires \valid(arr + (0..size-1));
requires \forall integer i; 0 <= i < size ==> 0 <= arr[i] < size;
requires 0 <= addr < size;
assigns arr[0..size-1];
ensures arr[\at(arr[addr],Pre)] == 0;
*/ | void indaddr(unsigned size, int arr[size], unsigned addr)
{
arr[arr[addr]] = 0;
} | true | 6 | 6 | void indaddr(unsigned size, int arr[size], unsigned addr)
{
arr[arr[addr]] = 0;
} | /*@ requires \valid(arr + (0..size-1));
requires \forall integer i; 0 <= i < size ==> 0 <= arr[i] < size;
requires 0 <= addr < size;
assigns arr[0..size-1];
ensures arr[\at(arr[addr],Pre)] == 0;
*/ | |
frama_c_files_v2/test_frama_c_2404.c | /*@ requires n >= 0 && 0 <= n1 < n && 0 <= n2 < n;
requires \valid(a+(0..n-1));
ensures (a[n1] == \old(a[n2]) && a[n2] == \old(a[n1]));
*/
void array_swap(int n, int a[], int n1, int n2)
{
int tmp;
tmp = a[n1]; a[n1] = a[n2]; a[n2] = tmp;
}
|
/*@ requires n >= 0 && 0 <= n1 < n && 0 <= n2 < n;
requires \valid(a+(0..n-1));
ensures (a[n1] == \old(a[n2]) && a[n2] == \old(a[n1]));
*/ | void array_swap(int n, int a[], int n1, int n2)
{
int tmp;
tmp = a[n1]; a[n1] = a[n2]; a[n2] = tmp;
} | true | 7 | 7 | void array_swap(int n, int a[], int n1, int n2)
{
int tmp;
tmp = a[n1]; a[n1] = a[n2]; a[n2] = tmp;
} | /*@ requires n >= 0 && 0 <= n1 < n && 0 <= n2 < n;
requires \valid(a+(0..n-1));
ensures (a[n1] == \old(a[n2]) && a[n2] == \old(a[n1]));
*/ | |
frama_c_files_v2/test_frama_c_2883.c | /*@ requires n>0 && \valid(p+(0..n-1));
ensures \result==-1 ==> !(\exists int i; 0<=i<n && p[i]==v);
ensures \result!=-1 ==> 0 <= \result < n && p[\result]==v;
assigns \nothing;
*/
int member(int* p, int n, int v) {
/*@
loop invariant (0 <= i <= n);
loop invariant !(\exists int j; 0 <= j < i && p[... |
/*@ requires n>0 && \valid(p+(0..n-1));
ensures \result==-1 ==> !(\exists int i; 0<=i<n && p[i]==v);
ensures \result!=-1 ==> 0 <= \result < n && p[\result]==v;
assigns \nothing;
*/ | int member(int* p, int n, int v) {
/*@
loop invariant (0 <= i <= n);
loop invariant !(\exists int j; 0 <= j < i && p[j]==v);
loop assigns i;
loop variant n-i;
*/
for (int i=0; i<n; i++) {
if (p[i]==v) return i;
}
return -1;
} | true | 16 | 16 | int member(int* p, int n, int v) {
/*@
loop invariant (0 <= i <= n);
loop invariant !(\exists int j; 0 <= j < i && p[j]==v);
loop assigns i;
loop variant n-i;
*/
for (int i=0; i<n; i++) {
if (p[i]==v) return i;
}
return -1;
} | /*@ requires n>0 && \valid(p+(0..n-1));
ensures \result==-1 ==> !(\exists int i; 0<=i<n && p[i]==v);
ensures \result!=-1 ==> 0 <= \result < n && p[\result]==v;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2883.c | /*@ requires n>0 && \valid(p+(0..n-1));
ensures \result==-1 ==> !(\exists int i; 0<=i<n && p[i]==v);
ensures \result!=-1 ==> 0 <= \result < n && p[\result]==v;
assigns \nothing;
*/
int member(int* p, int n, int v) {
/*@
loop invariant (0 <= i <= n);
loop invariant !(\exists int j; 0 <= j < i && p[... |
/*@ requires n>0 && \valid(p+(0..n-1));
ensures \result==-1 ==> !(\exists int i; 0<=i<n && p[i]==v);
ensures \result!=-1 ==> 0 <= \result < n && p[\result]==v;
assigns \nothing;
*/
int member(int* p, int n, int v) {
/*@
loop invariant (0 <= i <= n);
loop invariant !(\exists int j; 0 <= j < i && ... | int member_noreturn(int* p, int n, int v) {
int r = -1;
/*@
loop invariant (0 <= i <= n);
loop invariant r==-1 ==> !(\exists int j; 0 <= j < i && p[j]==v);
loop invariant r!=-1 ==> 0 <= r < n && p[r]==v;
loop assigns i, r;
loop variant n-i;
*/
for (int i=0; i<n; i++) {
if (r==-1 && p[i]=... | true | 32 | 32 | int member_noreturn(int* p, int n, int v) {
int r = -1;
/*@
loop invariant (0 <= i <= n);
loop invariant r==-1 ==> !(\exists int j; 0 <= j < i && p[j]==v);
loop invariant r!=-1 ==> 0 <= r < n && p[r]==v;
loop assigns i, r;
loop variant n-i;
*/
for (int i=0; i<n; i++) {
if (r==-1 && p[i]=... | /*@ requires n>0 && \valid(p+(0..n-1));
ensures \result==-1 ==> !(\exists int i; 0<=i<n && p[i]==v);
ensures \result!=-1 ==> 0 <= \result < n && p[\result]==v;
assigns \nothing;
*/
int member(int* p, int n, int v) {
/*@
loop invariant (0 <= i <= n);
loop invariant !(\exists int j; 0 <= j < i && p[... | |
frama_c_files_v2/test_frama_c_2567.c | /*@
behavior first_case:
behavior first1_case:
assumes num1>num2;
assumes num1>num3;
ensures \result == num1;
behavior first2_case:
assumes num1>num2;
assumes num1<=num3;
ensures \result == num3;
behavior second_case:
behavior second1_case:
assumes num1<=num2;
assumes num2>num3;
... |
/*@
behavior first_case:
behavior first1_case:
assumes num1>num2;
assumes num1>num3;
ensures \result == num1;
behavior first2_case:
assumes num1>num2;
assumes num1<=num3;
ensures \result == num3;
behavior second_case:
behavior second1_case:
assumes num1<=num2;
assumes num2>num3;... | int max3(int num1, int num2, int num3){
if(num1 > num2){
if(num1 > num3)
return num1;
else
return num3;
}
else
{
if(num2 > num3)
return num2;
else
return num3;
}
} | true | 6 | 6 | int max3(int num1, int num2, int num3){
if(num1 > num2){
if(num1 > num3)
return num1;
else
return num3;
}
else
{
if(num2 > num3)
return num2;
else
return num3;
}
} | /*@
behavior first_case:
behavior first1_case:
assumes num1>num2;
assumes num1>num3;
ensures \result == num1;
behavior first2_case:
assumes num1>num2;
assumes num1<=num3;
ensures \result == num3;
behavior second_case:
behavior second1_case:
assumes num1<=num2;
assumes num2>num3;
... | |
frama_c_files_v2/test_frama_c_2476.c | /* run.config_ci
COMMENT: test option -e-acsl-instrument; cannot run Eva on this example
LOG: gen_@PTEST_NAME@.c
STDOPT:#"-e-acsl-instrument='@@all,-uninstrument1,-uninstrument2'"
*/
#include <stdarg.h>
int uninstrument1(int *p) {
*p = 0;
return 0;
}
/*@ requires \valid(p); */
int uninstrument2(int *p) ... | #include <stdarg.h>
/*@ requires \valid(p); */ | int uninstrument2(int *p) {
{ int *q = p;
*p = 0;
goto L;
}
L:
return 0;
} | true | 3 | 3 | int uninstrument2(int *p) {
{ int *q = p;
*p = 0;
goto L;
}
L:
return 0;
} | #include <stdarg.h>
/*@ requires \valid(p); */ | |
frama_c_files_v2/test_frama_c_926.c | /*@ ensures (\result >= x && \result >=y) ; */
int maxint (int x, int y) {
return (x > y) ? x : y;
}
|
/*@ ensures (\result >= x && \result >=y) ; */ | int maxint (int x, int y) {
return (x > y) ? x : y;
} | true | 3 | 3 | int maxint (int x, int y) {
return (x > y) ? x : y;
} | /*@ ensures (\result >= x && \result >=y) ; */ | |
frama_c_files_v2/test_frama_c_2379.c | /*@ ensures \result >= a && \result >= b;
ensures \result == a || \result == b ;
*/
int max ( int a, int b ) {
if ( a >= b )
return a ;
return b ;
}
|
/*@ ensures \result >= a && \result >= b;
ensures \result == a || \result == b ;
*/ | int max ( int a, int b ) {
if ( a >= b )
return a ;
return b ;
} | true | 4 | 4 | int max ( int a, int b ) {
if ( a >= b )
return a ;
return b ;
} | /*@ ensures \result >= a && \result >= b;
ensures \result == a || \result == b ;
*/ | |
frama_c_files_v2/test_frama_c_1268.c | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_... | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv... | void add(int * x79, int x80, int x81, int * x82, int x83, int x84, int * x85, int x86, int x87) {
/*@assert \separated(x85+0,x79+0);*/
/*@assert \separated(x85+0,x82+0);*/
int x89 = x86 * x87;
/*@
loop invariant 0<=x97<=x89;
loop invariant (\forall int x98; (((0<=x98) &&
(x98<x97)) ==> (x85[x98]... | true | 33 | 33 | void add(int * x79, int x80, int x81, int * x82, int x83, int x84, int * x85, int x86, int x87) {
/*@assert \separated(x85+0,x79+0);*/
/*@assert \separated(x85+0,x82+0);*/
int x89 = x86 * x87;
/*@
loop invariant 0<=x97<=x89;
loop invariant (\forall int x98; (((0<=x98) &&
(x98<x97)) ==> (x85[x98]... | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv... | |
frama_c_files_v2/test_frama_c_1268.c | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_... | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv... | void scalar_mult(int x203, int * x204, int x205, int x206, int * x207, int x208, int x209) {
/*@assert \separated(x207+0,x204+0);*/
int x211 = x208 * x209;
/*@
loop invariant 0<=x216<=x211;
loop invariant (\forall int x217; (((0<=x217) &&
(x217<x216)) ==> (x207[x217]==(x203 &&
x204[x217]))));
lo... | true | 54 | 54 | void scalar_mult(int x203, int * x204, int x205, int x206, int * x207, int x208, int x209) {
/*@assert \separated(x207+0,x204+0);*/
int x211 = x208 * x209;
/*@
loop invariant 0<=x216<=x211;
loop invariant (\forall int x217; (((0<=x217) &&
(x217<x216)) ==> (x207[x217]==(x203 &&
x204[x217]))));
lo... | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv... | |
frama_c_files_v2/test_frama_c_1756.c | #include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} e... | #include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/ | int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
} | true | 7 | 7 | int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
} | #include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/ | |
frama_c_files_v2/test_frama_c_1756.c | #include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} e... | #include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} ... | int decypher(int x15) {
int x17 = x15 == 0;
int x19;
if (x17) {
x19 = 26;
} else {
int x18 = x15 - 1;
x19 = x18;
}
return x19;
} | true | 14 | 14 | int decypher(int x15) {
int x17 = x15 == 0;
int x19;
if (x17) {
x19 = 26;
} else {
int x18 = x15 - 1;
x19 = x18;
}
return x19;
} | #include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} ... | |
frama_c_files_v2/test_frama_c_2231.c | //check if every element is equal to index
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
behavior one:
assumes \forall integer j;
0<=j<n ==> arr[j]==j;
ensures \result == 1;
behavior two:
assumes \exists integer j;
0<=j<n && arr[j]!=j;
ensures \res... |
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
behavior one:
assumes \forall integer j;
0<=j<n ==> arr[j]==j;
ensures \result == 1;
behavior two:
assumes \exists integer j;
0<=j<n && arr[j]!=j;
ensures \result == 0;
complete behaviors;
disj... | int checkIndex(int arr[], int n){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer k;
0<=k<i ==> arr[k]==k;
loop assigns i;
loop variant n-i;
*/
for (int i = 0; i < n; i++)
{
if(arr[i]!=i){
return 0;
}
}
return... | true | 15 | 15 | int checkIndex(int arr[], int n){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer k;
0<=k<i ==> arr[k]==k;
loop assigns i;
loop variant n-i;
*/
for (int i = 0; i < n; i++)
{
if(arr[i]!=i){
return 0;
}
}
return... | /*@
requires n>0;
requires \valid_read(arr+(0..n-1));
behavior one:
assumes \forall integer j;
0<=j<n ==> arr[j]==j;
ensures \result == 1;
behavior two:
assumes \exists integer j;
0<=j<n && arr[j]!=j;
ensures \result == 0;
complete behaviors;
disjoi... | |
frama_c_files_v2/test_frama_c_1310.c | /*@ terminates \true;
@ assigns \nothing;
@ ensures \false;
@ exits \exit_status == status;
@*/
void exit(int status);
int status;
/*@ terminates \true;
@ assigns status;
@ exits !cond && \exit_status == 1 && status == val;
@ ensures cond && status == \old(status);
@*/
void may_exit(int cond, int... | int status;
/*@ terminates \true;
@ assigns \nothing;
@ ensures \false;
@ exits \exit_status == status;
@*/
void exit(int status);
int status;
/*@ terminates \true;
@ assigns status;
@ exits !cond && \exit_status == 1 && status == val;
@ ensures cond && status == \old(status);
@*/ | void may_exit(int cond, int val) {
if (! cond) {
status = val;
exit(1);
}
} | true | 5 | 5 | void may_exit(int cond, int val) {
if (! cond) {
status = val;
exit(1);
}
} | int status;
/*@ terminates \true;
@ assigns \nothing;
@ ensures \false;
@ exits \exit_status == status;
@*/
void exit(int status);
int status;
/*@ terminates \true;
@ assigns status;
@ exits !cond && \exit_status == 1 && status == val;
@ ensures cond && status == \old(status);
@*/ | |
frama_c_files_v2/test_frama_c_1801.c | /*@ axiomatic Factorial {
logic integer factorial(integer i);
axiom nil:
factorial(0) == 1;
axiom step:
\forall integer i; i >= 0 ==>
factorial(i) == factorial(i - 1) * i;
lemma non_negative:
\forall integer i; i >= 0 ==>
factorial(i) > 0;
}
*/
#define SPE... | #include <stdio.h>
/*@ axiomatic Factorial {
logic integer factorial(integer i);
axiom nil:
factorial(0) == 1;
axiom step:
\forall integer i; i >= 0 ==>
factorial(i) == factorial(i - 1) * i;
lemma non_negative:
\forall integer i; i >= 0 ==>
factorial(i) > 0;
... | unsigned long factorial(unsigned i)
{
unsigned long f = 1;
/*@ loop invariant 0 <= i;
loop assigns f, i;
loop variant i;
*/
while (i) {
f *= i--;
}
return f;
} | true | 11 | 11 | unsigned long factorial(unsigned i)
{
unsigned long f = 1;
/*@ loop invariant 0 <= i;
loop assigns f, i;
loop variant i;
*/
while (i) {
f *= i--;
}
return f;
} | #include <stdio.h>
/*@ axiomatic Factorial {
logic integer factorial(integer i);
axiom nil:
factorial(0) == 1;
axiom step:
\forall integer i; i >= 0 ==>
factorial(i) == factorial(i - 1) * i;
lemma non_negative:
\forall integer i; i >= 0 ==>
factorial(i) > 0;
... | |
frama_c_files_v2/test_frama_c_2686.c |
/*@ assigns \nothing;
ensures \result == 0 || \result == 1 || \result == -1;
behavior positive:
assumes x > 0;
ensures \result == 1;
behavior zero:
assumes x == 0;
ensures \result == 0;
behavior negative:
assumes x < 0;
ensures \result == -1;
complete behav... | #include <stdio.h>
/*@ assigns \nothing;
ensures \result == 0 || \result == 1 || \result == -1;
behavior positive:
assumes x > 0;
ensures \result == 1;
behavior zero:
assumes x == 0;
ensures \result == 0;
behavior negative:
assumes x < 0;
ensures \result == -1;... | int spec_sign(int x)
{
return (x > 0) - (x < 0);
} | true | 11 | 11 | int spec_sign(int x)
{
return (x > 0) - (x < 0);
} | #include <stdio.h>
/*@ assigns \nothing;
ensures \result == 0 || \result == 1 || \result == -1;
behavior positive:
assumes x > 0;
ensures \result == 1;
behavior zero:
assumes x == 0;
ensures \result == 0;
behavior negative:
assumes x < 0;
ensures \result == -1;... | |
frama_c_files_v2/test_frama_c_314.c | /*@requires\valid(a) &&\valid(b);
ensures *a ==\old(*b) && *b ==\old(*a);*/
int swap(int *a, int *b)
{
int temp = *a;
*a = *b;
*b = temp;
return 0;
} |
/*@requires\valid(a) &&\valid(b);
ensures *a ==\old(*b) && *b ==\old(*a);*/ | int swap(int *a, int *b)
{
int temp = *a;
*a = *b;
*b = temp;
return 0;
} | true | 7 | 7 | int swap(int *a, int *b)
{
int temp = *a;
*a = *b;
*b = temp;
return 0;
} | /*@requires\valid(a) &&\valid(b);
ensures *a ==\old(*b) && *b ==\old(*a);*/ | |
frama_c_files_v2/test_frama_c_1459.c | /**
*
* Frama-C Version: Frama-C Silicon-20161101
* Alt-Ergo Version: 1.30
*
* Run the following:
* frama-c -wp -wp-rte -wp-prover alt-ergo -wp-timeout 10 countSameConsecutiveFinal.c -then -report
*
**/
/*@ predicate all_equal_in_range{L}(int *x, integer minidx, integer maxidx) =
@ \forall integer k; mi... |
/*@ predicate all_equal_in_range{L}(int *x, integer minidx, integer maxidx) =
@ \forall integer k; minidx <= k < minidx + maxidx ==> \at(x[minidx], L) == \at(x[k], L)
@ ;
*/
/*@ predicate all_smaller_than_best{L}(int *x, integer i, integer maxidx, integer best) =
@ \forall integer k1;
@ (
@ ... | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
/*@ loop invariant 0 <= i <= N;
@ loop invariant i == 0 ==> best == 0;
@ loop invariant i > 0 ==> 1 <= best <= N;
@ loop invariant i > 0 ==> \exists integer k1; 0 <= k1 < i && all_equal_in_range(x, k1, best);
@ loop invariant 0 < i < N ... | true | 35 | 35 | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
/*@ loop invariant 0 <= i <= N;
@ loop invariant i == 0 ==> best == 0;
@ loop invariant i > 0 ==> 1 <= best <= N;
@ loop invariant i > 0 ==> \exists integer k1; 0 <= k1 < i && all_equal_in_range(x, k1, best);
@ loop invariant 0 < i < N ... | /*@ predicate all_equal_in_range{L}(int *x, integer minidx, integer maxidx) =
@ \forall integer k; minidx <= k < minidx + maxidx ==> \at(x[minidx], L) == \at(x[k], L)
@ ;
*/
/*@ predicate all_smaller_than_best{L}(int *x, integer i, integer maxidx, integer best) =
@ \forall integer k1;
@ (
@ ... | |
frama_c_files_v2/test_frama_c_1923.c | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x10>0) &&
\valid(x9+(0..x10-1)));
assigns \nothing;
*/
int pick_element(int * x9, int x10) {
int x12 = pick_index(x10);
int x13 = x9[x12];
return x13;
}
/*... | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/ | int pick_index(int x0) {
return 0;
} | true | 4 | 4 | int pick_index(int x0) {
return 0;
} | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/ | |
frama_c_files_v2/test_frama_c_1923.c | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x10>0) &&
\valid(x9+(0..x10-1)));
assigns \nothing;
*/
int pick_element(int * x9, int x10) {
int x12 = pick_index(x10);
int x13 = x9[x12];
return x13;
}
/*... | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x10>0) &&
\valid(x9+(0..x10-1)));
assigns \nothing;
*/
int pick_element(int * x9, int x10) {
int x12 = pick_index(x10);
int x13 = x9[x12];
return x13;
}
/... | int pick_first(int * x20) {
int x22 = x20[0];
return x22;
} | true | 16 | 16 | int pick_first(int * x20) {
int x22 = x20[0];
return x22;
} | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x10>0) &&
\valid(x9+(0..x10-1)));
assigns \nothing;
*/
int pick_element(int * x9, int x10) {
int x12 = pick_index(x10);
int x13 = x9[x12];
return x13;
}
/... | |
frama_c_files_v2/test_frama_c_2449.c | /*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1),... |
/*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1... | void mv_mult_bool(int n, int *m, int *v, int *o) {
/*@
loop invariant 0 <= r <= n;
loop invariant \forall int i; 0 <= i < r ==> o[i] == row_col_bool(n, i, n, m, v);
loop assigns r, o[0..n-1];
loop variant n-r;
*/
for (int r = 0; r < n; r++) {
o[r] = 0;
/*@
loop invariant 0 <= c <= n... | true | 41 | 41 | void mv_mult_bool(int n, int *m, int *v, int *o) {
/*@
loop invariant 0 <= r <= n;
loop invariant \forall int i; 0 <= i < r ==> o[i] == row_col_bool(n, i, n, m, v);
loop assigns r, o[0..n-1];
loop variant n-r;
*/
for (int r = 0; r < n; r++) {
o[r] = 0;
/*@
loop invariant 0 <= c <= n... | /*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1),... | |
frama_c_files_v2/test_frama_c_2449.c | /*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1),... |
/*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1... | void mv_mults_bool(int n, int *m, int *v, int *o) {
int r = 0;
o[r] = 0;
/*@
loop invariant 0 <= c <= n;
loop invariant 0 <= r < n;
loop invariant \forall int i; 0 <= i < r ==> o[i] == row_col_bool(n, i, n, m, v);
loop invariant o[r] == row_col_bool(c, r, n, m, v);
loop assigns c, o[r];
lo... | true | 74 | 74 | void mv_mults_bool(int n, int *m, int *v, int *o) {
int r = 0;
o[r] = 0;
/*@
loop invariant 0 <= c <= n;
loop invariant 0 <= r < n;
loop invariant \forall int i; 0 <= i < r ==> o[i] == row_col_bool(n, i, n, m, v);
loop invariant o[r] == row_col_bool(c, r, n, m, v);
loop assigns c, o[r];
lo... | /*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1),... | |
frama_c_files_v2/test_frama_c_2449.c | /*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1),... |
/*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1... | void mv_multu_bool(int n, int *m, int *v, int *o) {
o[0] = 0;
o[0] = o[0] || v[0];
o[0] = o[0] || v[1];
o[1] = 0;
} | true | 95 | 95 | void mv_multu_bool(int n, int *m, int *v, int *o) {
o[0] = 0;
o[0] = o[0] || v[0];
o[0] = o[0] || v[1];
o[1] = 0;
} | /*@
logic boolean row_col_bool(integer c, int r, int n, int* m, int* v) =
(0 < c <= n) ? ((row_col_bool(c-1, r, n, m, v)) || (m[n*r+(c-1)] && v[(c-1)])) : 0;
*/
/*@
requires n>0;
requires n<3;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \separated(m+(0..n*n-1),... | |
frama_c_files_v2/test_frama_c_9.c | /*@
requires \valid(q) && \valid(r);
requires \separated(q, r);
requires y != 0;
assigns *q, *r;
ensures x == *q * y + *r;
ensures *r < y;
*/
void div_rem(unsigned x, unsigned y, unsigned* q, unsigned* r) {
*q = x / y;
*r = x % y;
} |
/*@
requires \valid(q) && \valid(r);
requires \separated(q, r);
requires y != 0;
assigns *q, *r;
ensures x == *q * y + *r;
ensures *r < y;
*/ | void div_rem(unsigned x, unsigned y, unsigned* q, unsigned* r) {
*q = x / y;
*r = x % y;
} | true | 10 | 10 | void div_rem(unsigned x, unsigned y, unsigned* q, unsigned* r) {
*q = x / y;
*r = x % y;
} | /*@
requires \valid(q) && \valid(r);
requires \separated(q, r);
requires y != 0;
assigns *q, *r;
ensures x == *q * y + *r;
ensures *r < y;
*/ | |
frama_c_files_v2/test_frama_c_2022.c | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/
void q1(int a[],int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j=0;j<n-1;j++)
{
if(a[j]>a[j+1])
{... |
/*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ | void q1(int a[],int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j=0;j<n-1;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | true | 24 | 24 | void q1(int a[],int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j=0;j<n-1;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ | |
frama_c_files_v2/test_frama_c_509.c | /*@ logic integer max(integer a, integer b) =
a > b ? a : b;
*/
/*@ assigns \nothing;
ensures \result >= a;
ensures \result >= b;
ensures \result == a || \result == b;
ensures \result == max(a, b);
*/
int max(int a, int b)
{
return a > b ? a : b;
}
|
/*@ logic integer max(integer a, integer b) =
a > b ? a : b;
*/
/*@ assigns \nothing;
ensures \result >= a;
ensures \result >= b;
ensures \result == a || \result == b;
ensures \result == max(a, b);
*/ | int max(int a, int b)
{
return a > b ? a : b;
} | true | 8 | 8 | int max(int a, int b)
{
return a > b ? a : b;
} | /*@ logic integer max(integer a, integer b) =
a > b ? a : b;
*/
/*@ assigns \nothing;
ensures \result >= a;
ensures \result >= b;
ensures \result == a || \result == b;
ensures \result == max(a, b);
*/ | |
frama_c_files_v2/test_frama_c_1967.c | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_element(int * x6, int x7) {
int x9 = pick_index(x7);
int x10 = x6[x9];
return x10;
}
/*@
requ... | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_element(int * x6, int x7) {
int x9 = pick_index(x7);
int x10 = x6[x9];
return x10;
}
/*@
req... | int pick_first(int * x15) {
int x17 = x15[0];
return x17;
} | true | 16 | 16 | int pick_first(int * x15) {
int x17 = x15[0];
return x17;
} | #include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int pick_index(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_element(int * x6, int x7) {
int x9 = pick_index(x7);
int x10 = x6[x9];
return x10;
}
/*@
req... | |
frama_c_files_v2/test_frama_c_995.c | /*@
requires \valid(p);
requires \valid(q);
behavior p_changed:
assumes n >0;
assigns *p;
ensures *p == n;
behavior q_changed:
assumes n <= 0;
assigns *q;
ensures *q == n;
*/
void f(int n, int *p, int *q)
{
if (n > 0) *p = n; else *q = n;
}
|
/*@
requires \valid(p);
requires \valid(q);
behavior p_changed:
assumes n >0;
assigns *p;
ensures *p == n;
behavior q_changed:
assumes n <= 0;
assigns *q;
ensures *q == n;
*/ | void f(int n, int *p, int *q)
{
if (n > 0) *p = n; else *q = n;
} | true | 10 | 10 | void f(int n, int *p, int *q)
{
if (n > 0) *p = n; else *q = n;
} | /*@
requires \valid(p);
requires \valid(q);
behavior p_changed:
assumes n >0;
assigns *p;
ensures *p == n;
behavior q_changed:
assumes n <= 0;
assigns *q;
ensures *q == n;
*/ | |
frama_c_files_v2/test_frama_c_1167.c | /*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
assigns *a, *b;
ensures a_value: *a == \at(*b,Pre);
ensures b_value: *b == \at(*a, Pre);
*/
void swap(int* a, int *b);
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
requires c_valid: \valid(c);
requires sep: \sepa... |
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
assigns *a, *b;
ensures a_value: *a == \at(*b,Pre);
ensures b_value: *b == \at(*a, Pre);
*/
void swap(int* a, int *b);
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
requires c_valid: \valid(c);
requires sep: \se... | void permut(int* a, int *b, int *c) {
swap(a,b);
swap(b,c);
} | true | 9 | 9 | void permut(int* a, int *b, int *c) {
swap(a,b);
swap(b,c);
} | /*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
assigns *a, *b;
ensures a_value: *a == \at(*b,Pre);
ensures b_value: *b == \at(*a, Pre);
*/
void swap(int* a, int *b);
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
requires c_valid: \valid(c);
requires sep: \sepa... | |
frama_c_files_v2/test_frama_c_1483.c | /*@
requires \valid(p);
ensures \result == *p;
*/
int foo(int* p) {
return *p;
}
|
/*@
requires \valid(p);
ensures \result == *p;
*/ | int foo(int* p) {
return *p;
} | true | 4 | 4 | int foo(int* p) {
return *p;
} | /*@
requires \valid(p);
ensures \result == *p;
*/ | |
frama_c_files_v2/test_frama_c_2831.c | /*
Software versions:
frama-c : 18.0 (Argon)
alt-ergo : 2.2.0
This script was run using this command:
frama-c -wp -wp-prover alt-ergo -wp-rte -wp-timeout 300 -wp-verbose 0 countSameConsecutive.c -then -report
*/
// This predicate is true if there is a subsequence of length "answer"
// with all its ele... |
/*@ predicate isValidAnswer(integer N, int *x, int answer) =
@ \exists integer i; 0 <= i <= N-answer &&
@ (\forall integer j; i <= j <= i+answer-1 ==> x[j] == x[i]);
@*/
// This predicate is true if there is no subsequence of length "answer+1"
// with all its elements equal.
/*@
@ predicate noBet... | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
/*@ loop invariant 0 <= i <= N;
@ loop invariant i == 0 ==> best == 0;
@ loop invariant 0 < i <= N ==> isBest(i, x, best);
@ loop invariant 0 < i < N ==> x[i] != x[i-1];
@ loop assigns i, best;
@ loop variant N... | true | 31 | 31 | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
/*@ loop invariant 0 <= i <= N;
@ loop invariant i == 0 ==> best == 0;
@ loop invariant 0 < i <= N ==> isBest(i, x, best);
@ loop invariant 0 < i < N ==> x[i] != x[i-1];
@ loop assigns i, best;
@ loop variant N... | /*@ predicate isValidAnswer(integer N, int *x, int answer) =
@ \exists integer i; 0 <= i <= N-answer &&
@ (\forall integer j; i <= j <= i+answer-1 ==> x[j] == x[i]);
@*/
// This predicate is true if there is no subsequence of length "answer+1"
// with all its elements equal.
/*@
@ predicate noBette... | |
frama_c_files_v2/test_frama_c_1820.c |
/*@predicate who_is_taller{L}(int *x,integer j, integer last)=
@ \forall integer i; j < i < last ==> x[j] > x[i];
@
*/
/*@ predicate how_many{L}(int *x, integer counter, integer size,integer cnt) =
@ (counter < size) ?
@ (who_is_taller(x,counter,size))? how_many(x,counter+1,size,cnt-... |
/*@predicate who_is_taller{L}(int *x,integer j, integer last)=
@ \forall integer i; j < i < last ==> x[j] > x[i];
@
*/
/*@ predicate how_many{L}(int *x, integer counter, integer size,integer cnt) =
@ (counter < size) ?
@ (who_is_taller(x,counter,size))? how_many(x,counter+1,size,cnt... | int countWhoCanSee (int N, int x[])
{
int tallest = x[N-1];
int count = 1;
/*@ loop invariant -1 <= i < N-1;
@ loop invariant 1 <= count < N-i;
@ loop invariant \exists integer j;
@ i<j<N && tallest==x[j];
@ loop invariant \forall integer j;
@ i<j<N ==> tallest >=x[j];
@ loop invariant how_many(x... | true | 23 | 23 | int countWhoCanSee (int N, int x[])
{
int tallest = x[N-1];
int count = 1;
/*@ loop invariant -1 <= i < N-1;
@ loop invariant 1 <= count < N-i;
@ loop invariant \exists integer j;
@ i<j<N && tallest==x[j];
@ loop invariant \forall integer j;
@ i<j<N ==> tallest >=x[j];
@ loop invariant how_many(x... | /*@predicate who_is_taller{L}(int *x,integer j, integer last)=
@ \forall integer i; j < i < last ==> x[j] > x[i];
@
*/
/*@ predicate how_many{L}(int *x, integer counter, integer size,integer cnt) =
@ (counter < size) ?
@ (who_is_taller(x,counter,size))? how_many(x,counter+1,size,cnt-1... | |
frama_c_files_v2/test_frama_c_2331.c | /*@
@ requires
@ \valid(t + (0..size - 1)) &&
@ 0 <= i < size &&
@ 0 <= j < size;
@
@ ensures
@ \forall integer k;
@ 0 <= k < size && k != i && k != j ==>
@ t[k] == \old(t[k]);
@
@ ensures
@ t[i] == \old(t[j]) &&
@ t[j] == \old(t[i]);
@
... |
/*@
@ requires
@ \valid(t + (0..size - 1)) &&
@ 0 <= i < size &&
@ 0 <= j < size;
@
@ ensures
@ \forall integer k;
@ 0 <= k < size && k != i && k != j ==>
@ t[k] == \old(t[k]);
@
@ ensures
@ t[i] == \old(t[j]) &&
@ t[j] == \old(t[i]);
@
... | void swap(int t[], int size, int i, int j) {
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
} | true | 10 | 10 | void swap(int t[], int size, int i, int j) {
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
} | /*@
@ requires
@ \valid(t + (0..size - 1)) &&
@ 0 <= i < size &&
@ 0 <= j < size;
@
@ ensures
@ \forall integer k;
@ 0 <= k < size && k != i && k != j ==>
@ t[k] == \old(t[k]);
@
@ ensures
@ t[i] == \old(t[j]) &&
@ t[j] == \old(t[i]);
@
... | |
frama_c_files_v2/test_frama_c_1416.c | /*@ensures\result == a &&\result>b
|| \result>a &&\result == b
|| \result == a &&\result == b;*/
int max(int a, int b)
{return a>b ? a : b;} |
/*@ensures\result == a &&\result>b
|| \result>a &&\result == b
|| \result == a &&\result == b;*/ | int max(int a, int b)
{return a>b ? a : b;} | true | 3 | 3 | int max(int a, int b)
{return a>b ? a : b;} | /*@ensures\result == a &&\result>b
|| \result>a &&\result == b
|| \result == a &&\result == b;*/ | |
frama_c_files_v2/test_frama_c_2833.c | #include <stddef.h>
#include <stdio.h>
/*@
predicate valid_range_rw(int* arr, integer n) =
n >= 0 && \valid(arr + (0 .. n-1));
predicate valid_range_r(int* arr, integer n) =
n >= 0 && \valid_read(arr + (0 .. n-1));
predicate sorted(int* arr, integer n) =
\forall integer i, j; 0 <= i <= j < n ==> arr[... | #include <stddef.h>
#include <stdio.h>
/*@
predicate valid_range_rw(int* arr, integer n) =
n >= 0 && \valid(arr + (0 .. n-1));
predicate valid_range_r(int* arr, integer n) =
n >= 0 && \valid_read(arr + (0 .. n-1));
predicate sorted(int* arr, integer n) =
\forall integer i, j; 0 <= i <= j < n ==> arr[... | int bsearch(int* arr, int len, int value){
if(len == 0) return -1 ;
int low = 0 ;
int up = len-1 ;
/*@
loop invariant 0 <= low && up <= len-1;
loop invariant \forall integer i; 0 <= i < low ==> arr[i] != value;
loop invariant \forall integer i; up < i <= len-1 ==> arr[i] != value;
loop assigns l... | true | 29 | 29 | int bsearch(int* arr, int len, int value){
if(len == 0) return -1 ;
int low = 0 ;
int up = len-1 ;
/*@
loop invariant 0 <= low && up <= len-1;
loop invariant \forall integer i; 0 <= i < low ==> arr[i] != value;
loop invariant \forall integer i; up < i <= len-1 ==> arr[i] != value;
loop assigns l... | #include <stddef.h>
#include <stdio.h>
/*@
predicate valid_range_rw(int* arr, integer n) =
n >= 0 && \valid(arr + (0 .. n-1));
predicate valid_range_r(int* arr, integer n) =
n >= 0 && \valid_read(arr + (0 .. n-1));
predicate sorted(int* arr, integer n) =
\forall integer i, j; 0 <= i <= j < n ==> arr[... | |
frama_c_files_v2/test_frama_c_288.c | // Version 2: Better specification
#include <limits.h>
/*@ requires x > INT_MIN;
behavior positive:
assumes x > 0;
ensures \result == \old(x);
behavior negative:
assumes x < 0;
ensures \result == \old(-x);
*/
int abs(int x) {
if (x < 0)
return -x;
else
return x;
}
int main() {
... | #include <limits.h>
/*@ requires x > INT_MIN;
behavior positive:
assumes x > 0;
ensures \result == \old(x);
behavior negative:
assumes x < 0;
ensures \result == \old(-x);
*/ | int abs(int x) {
if (x < 0)
return -x;
else
return x;
} | true | 5 | 5 | int abs(int x) {
if (x < 0)
return -x;
else
return x;
} | #include <limits.h>
/*@ requires x > INT_MIN;
behavior positive:
assumes x > 0;
ensures \result == \old(x);
behavior negative:
assumes x < 0;
ensures \result == \old(-x);
*/ | |
frama_c_files_v2/test_frama_c_2113.c | /*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires length > 0;
assigns a[0..length-1];
ensures sorted(a,length);
*/
void sort (int* a, int length) {
int current;
/*@ loop invariant 0<=current<lengt... |
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires length > 0;
assigns a[0..length-1];
ensures sorted(a,length);
*/ | void sort (int* a, int length) {
int current;
/*@ loop invariant 0<=current<length;
loop assigns a[0..length-1],current;
loop invariant sorted(a,current);
loop invariant
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
loop variant length-current;
*/
for (current = ... | true | 39 | 39 | void sort (int* a, int length) {
int current;
/*@ loop invariant 0<=current<length;
loop assigns a[0..length-1],current;
loop invariant sorted(a,current);
loop invariant
\forall integer i,j; 0<=i<current<=j<length ==> a[i] <= a[j];
loop variant length-current;
*/
for (current = ... | /*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires length > 0;
assigns a[0..length-1];
ensures sorted(a,length);
*/ | |
frama_c_files_v2/test_frama_c_1845.c | /*@
requires a!=0;
ensures \result == 1;
assigns \nothing;
*/
int func(int a) {
int x, y;
int sum, res;
if (a == 0){
x = 0; y = 0;
}
else {
x = 5; y = 5;
}
sum = x + y;
res = 10/sum;
return res;
} |
/*@
requires a!=0;
ensures \result == 1;
assigns \nothing;
*/ | int func(int a) {
int x, y;
int sum, res;
if (a == 0){
x = 0; y = 0;
}
else {
x = 5; y = 5;
}
sum = x + y;
res = 10/sum;
return res;
} | true | 12 | 12 | int func(int a) {
int x, y;
int sum, res;
if (a == 0){
x = 0; y = 0;
}
else {
x = 5; y = 5;
}
sum = x + y;
res = 10/sum;
return res;
} | /*@
requires a!=0;
ensures \result == 1;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1434.c | #include<limits.h>
/*@ ensures \result >= a && \result >= b; */
int max ( int a, int b ) {
return INT_MAX ;
}
| #include<limits.h>
/*@ ensures \result >= a && \result >= b; */ | int max ( int a, int b ) {
return INT_MAX ;
} | true | 3 | 3 | int max ( int a, int b ) {
return INT_MAX ;
} | #include<limits.h>
/*@ ensures \result >= a && \result >= b; */ | |
frama_c_files_v2/test_frama_c_1170.c | /*@
@ assigns \nothing;
@ ensures \result <= a;
@ ensures \result <= b;
@ ensures \result == a || \result == b;
*/
int min(int a, int b) {
return (a < b) ? a : b;
} |
/*@
@ assigns \nothing;
@ ensures \result <= a;
@ ensures \result <= b;
@ ensures \result == a || \result == b;
*/ | int min(int a, int b) {
return (a < b) ? a : b;
} | true | 7 | 7 | int min(int a, int b) {
return (a < b) ? a : b;
} | /*@
@ assigns \nothing;
@ ensures \result <= a;
@ ensures \result <= b;
@ ensures \result == a || \result == b;
*/ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.