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 \valid(p);
assigns \nothing;
ensures \result == p[0];
*/
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; }
| 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 \valid(p);
assigns \nothing;
ensures \result == p[0];
*/
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 \valid(p);
assigns \nothing;
ensures \result == p[0];
*/
|
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 \valid(p);
assigns \nothing;
ensures \result == p[0];
*/
|
|
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+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_ab(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 x4 = x2 == 'a';
int x16;
if (x4) {
char *x5 = x0+1;
char x8 = x5[0];
int x9 = x8 == '\0';
int x15;
if (x9) {
x15 = 0/*false*/;
} else {
int x10 = x8 == 'b';
int x14;
if (x10) {
char *x11 = x5+1;
char x12 = x11[0];
int x13 = x12 == '\0';
x14 = x13;
} else {
x14 = 0/*false*/;
}
x15 = x14;
}
x16 = x15;
} else {
x16 = 0/*false*/;
}
x17 = x16;
}
int x18 = x7 || x17;
return x18;
}
|
#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+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_ab(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 x4 = x2 == 'a';
int x16;
if (x4) {
char *x5 = x0+1;
char x8 = x5[0];
int x9 = x8 == '\0';
int x15;
if (x9) {
x15 = 0/*false*/;
} else {
int x10 = x8 == 'b';
int x14;
if (x10) {
char *x11 = x5+1;
char x12 = x11[0];
int x13 = x12 == '\0';
x14 = x13;
} else {
x14 = 0/*false*/;
}
x15 = x14;
}
x16 = x15;
} else {
x16 = 0/*false*/;
}
x17 = x16;
}
int x18 = x7 || x17;
return x18;
}
| 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 x4 = x2 == 'a';
int x16;
if (x4) {
char *x5 = x0+1;
char x8 = x5[0];
int x9 = x8 == '\0';
int x15;
if (x9) {
x15 = 0/*false*/;
} else {
int x10 = x8 == 'b';
int x14;
if (x10) {
char *x11 = x5+1;
char x12 = x11[0];
int x13 = x12 == '\0';
x14 = x13;
} else {
x14 = 0/*false*/;
}
x15 = x14;
}
x16 = x15;
} else {
x16 = 0/*false*/;
}
x17 = x16;
}
int x18 = x7 || x17;
return x18;
}
|
#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+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensures \result <==> matcher_ab(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[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];
*/
|
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++)
{
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];
*/
|
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)));
ensures (\forall int x203; (((0<=x203) &&
(x203<(x26-1))) ==> (x25[x203]<=x25[(x203+1)])));
assigns x25[(0..x26-1)];
*/
void insort(int * x25, int x26) {
int x29 = x26;
/*@
loop invariant ((((0<=x29) &&
(x29<=x26)) &&
(\forall int x152; (((x29<=x152) &&
(x152<(x26-1))) ==> (x25[x152]<=x25[(x152+1)])))) &&
(\forall int x168; ((((0<=x168) &&
(x168<x29)) &&
(x29<=(x26-1))) ==> (x25[x168]<=x25[x29]))));
loop assigns x29, x25[(0..x26-1)];
loop variant x29;
*/
for (;;) {
int x30 = x29;
int x31 = x30 > 1;
if (!x31) break;
int x33 = 0;
int x34 = x29;
/*@
loop invariant ((((((((0<=x29) &&
(x29<=x26)) &&
(0<=x36)) &&
(x36<=x29)) &&
(0<=x33)) &&
(x33<=(x29-1))) &&
((x29-1)<x26)) &&
(\forall int x74; (((0<=x74) &&
(x74<x36)) ==> (x25[x74]<=x25[x33]))));
loop assigns x36, x33;
loop variant (x29-x36);
*/
for(int x36=0; x36 < x34; x36++) {
int x37 = x25[x36];
int x38 = x33;
int x39 = x25[x38];
int x40 = x37 >= x39;
if (x40) {
x33 = x36;
} else {
}
}
int x96 = x33;
int x95 = x34 - 1;
inswap(x25,x95,x96);
/*@assert (\forall int x98; ((((x29-1)<x98) &&
(x98<(x26-1))) ==> (x25[x98]<=x25[(x98+1)])));*/
/*@assert ((x29<=(x26-1)) ==> (x25[(x29-1)]<=x25[x29]));*/
/*@assert (\forall int x127; (((0<=x127) &&
(x127<x29)) ==> (x25[x127]<=x25[(x29-1)])));*/
x29 = x95;
}
}
|
#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!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
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;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/
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};
/*@
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==scalene;
complete behaviors;
disjoint behaviors;
*/
|
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==scalene;
complete behaviors;
disjoint behaviors;
*/
|
|
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!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
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;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/
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 && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
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;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/
|
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 && b!=c && c!=a;
ensures \result==scalene;
complete behaviors;
disjoint behaviors;
*/
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;
}
/*@
requires a>=b>0 && a>=c>0 && a*a<=10000000 && c*c<=10000000 && b*b<=10000000;
behavior ri:
assumes a*a==b*b+c*c;
ensures \result==right;
behavior ac:
assumes a*a<b*b+c*c;
ensures \result==acute;
behavior ob:
assumes a*a>b*b+c*c;
ensures \result==obtuse;
complete behaviors;
disjoint behaviors;
*/
|
|
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 <= 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]) { max = i; }
i++;
}
return max;
}
void main() {
max = maxarray(vec, LENGTH);
/*@ assert 0 <= max < LENGTH &&
@ (\forall integer a;
@ 0 <= a < LENGTH ==> vec[a] <= vec[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;
@*/
|
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]) { max = i; }
i++;
}
return 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]) { max = i; }
i++;
}
return 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 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 <= k < minInd ==> t[k] > t[minInd];
loop variant n-1-i;
*/
while(i<n-1)
if (t[++i] < t[minInd])
minInd = i;
//@ assert i == n-1;
return minInd;
}
|
/*@
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 <= k < minInd ==> t[k] > t[minInd];
loop variant n-1-i;
*/
while(i<n-1)
if (t[++i] < t[minInd])
minInd = i;
//@ assert i == n-1;
return minInd;
}
| 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 <= k < minInd ==> t[k] > t[minInd];
loop variant n-1-i;
*/
while(i<n-1)
if (t[++i] < t[minInd])
minInd = i;
//@ assert i == n-1;
return minInd;
}
|
/*@
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] != c);
@ assigns \nothing;
@*/
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;
}
/*@ predicate replace_space_by_new_line{L1,L2}(char* s, int n) =
@ \forall int i; 0 <= i < n && \at(s[i], L1) != \at(s[i],L2) ==>
@ \at(s[i], L1) == ' ' && \at(s[i],L2) == '\n';
*/
/*@ predicate at_least_lineLength(char* s, int lineLength, int n) =
@ \forall int i,j; 0 <= i < j < n && s[i] == '\n' && s[j] == '\n' ==> j-i >= lineLength;
*/
/*@ requires lineLength > 0;
@ requires 0 < n;
@ requires \valid(s+(0..n-1));
@ requires \forall int i; 0 <= i < n ==> s[i] != '\n';
@ ensures replace_space_by_new_line{Pre,Post}(s,n);
@ ensures at_least_lineLength(s,lineLength,n);
@ assigns s[0 .. n -1];
@*/
void wrapLines_simpl(char* s, int lineLength, int n) {
int lastBreak = -1;
int lastSpace = indexOf(s, ' ', 0, n);
/*@ loop invariant -1 <= lastSpace < n;
@ loop invariant -1 <= lastBreak < n;
@ loop invariant lastSpace == -1 || (lastBreak < lastSpace < n && s[lastSpace] == ' ');
@ loop invariant \forall int i; lastBreak < i < n ==> \at(s[i], LoopEntry) == s[i];
@ loop invariant replace_space_by_new_line{LoopEntry,Here}(s,n);
@ loop invariant at_least_lineLength(s,lineLength,n);
@ loop assigns s[0..n-1],lastBreak,lastSpace;
@ loop variant lastSpace == -1 ? 0 : n + 1 - lastSpace;
@*/
while(lastSpace != -1) {
if(lastSpace - lastBreak > lineLength) {
s[lastSpace] = '\n';
lastBreak = lastSpace;
}
lastSpace = indexOf(s, ' ', lastSpace+1, n);
}
return;
}
/*@ predicate impossible_to_break(char* s, int length, int n) =
@ \forall int i; 0 <= i < n - length ==>
@ (\forall int j; i <= j <= i + length ==> s[j] != '\n') ==>
@ (\forall int j; i <= j <= i + length ==> s[j] != ' ');
*/
/*@ predicate break_largest{L1,L2}(char* s, int length, int n) =
@ \forall int a, b, c; 0 <= a < b < c < n &&
@ (a == -1 || \at(s[a],L2) == '\n') &&
@ \at(s[b],L2) == '\n' && \at(s[b],L1) == ' ' &&
@ (\at(s[c],L2) == ' ' || \at(s[c],L2) == '\n') ==>
@ c - a > length;
*/
/*@ requires 0 < length;
@ requires 0 < n < 2147483646; // the length of array is limited to MAX_INT -1 because of an overflow
@ requires \valid(s+(0..n-1));
@ ensures replace_space_by_new_line{Pre,Post}(s,n);
@ ensures impossible_to_break(s,length,n);
@ ensures break_largest{Pre,Post}(s, length, n);
@ assigns s[0 .. n-1];
@*/
void wrapLines(char* s, int length, int n) {
int lastChange = -1;
int lastSpace = -1;
/*@ loop invariant -1 <= lastSpace < n;
@ loop invariant -1 <= lastChange <= lastSpace;
@ loop invariant lastSpace <= lastChange + length + 1;
@ loop invariant lastChange == -1 || s[lastChange] == '\n';
@ loop invariant 0 <= lastSpace ==> \at(s[\at(lastSpace,Here)],LoopEntry) == ' ' || \at(s[\at(lastSpace,Here)],LoopEntry) == '\n';
@ loop invariant \forall int x; lastChange < x < n ==> s[x] == \at(s[x],LoopEntry);
@ loop invariant \forall int x; lastChange < x <= lastSpace ==> s[x] != '\n';
@ loop invariant replace_space_by_new_line{LoopEntry,Here}(s,n);
@ loop invariant impossible_to_break(s, length, lastSpace);
@ loop invariant \forall int a, b, c; 0 <= a < b < c < n &&
b <= lastChange && (a == -1 || s[a] == '\n') &&
s[b] == '\n' && \at(s[b],LoopEntry) == ' ' &&
(s[c] == ' ' || s[c] == '\n') ==> c - a > length;
@ loop assigns s[0 .. n-1],lastChange, lastSpace;
@ loop variant 2*n - lastSpace - lastChange;
@*/
while(1) {
int nextSpace = indexOf(s, ' ', lastSpace + 1,n);
int nextNewLine = indexOf(s, '\n', lastSpace + 1,n);
if(nextSpace == -1) {
/*n - lastChange can overflow if the array contain no space and is of size MAX_INT*/
if(n - lastChange > length &&
(nextNewLine - lastChange > length || nextNewLine == -1) &&
lastSpace >= 0) {
s[lastSpace] = '\n';
}
return;
}
if(0 <= nextNewLine && nextNewLine < nextSpace) {
if(nextNewLine - lastChange > length && lastSpace >= 0) {
s[lastSpace] = '\n';
}
lastChange = lastSpace = nextNewLine;
} else {
if(nextSpace - lastChange > length) {
if(lastChange == lastSpace) {
s[nextSpace] = '\n';
lastChange = lastSpace = nextSpace;
} else {
s[lastSpace] = '\n';
lastChange = lastSpace;
}
} else {
lastSpace = nextSpace;
}
}
}
return;
}
|
/*@ 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] != c);
@ assigns \nothing;
@*/
|
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] != c);
@ assigns \nothing;
@*/
|
|
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 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return 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, 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;
@*/
|
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 :
@ ensures rr<51;
*/
void opa() {
rr++;
}
void opb () {
status=1;
}
void opc() {
rr=9000;
}
int main(){
switch (rr) {
case 1 :
opa();
break;
case 3 :
opa();
default :
opc();
}
opb();
return 1;
}
|
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 behaviors;
disjoint behaviors;
*/
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 behaviors;
disjoint behaviors;
*/
|
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 behaviors;
disjoint behaviors;
*/
|
|
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;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
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;
}
| 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;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
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;
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;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
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;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
|
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;
return x5;
}
/*@
requires is_pos(x6);
assigns \nothing;
ensures is_nat(\result);
*/
|
|
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==1 ;
ch = alphabet_letter('H') ;
//@ assert ch==1 ;
ch = alphabet_letter(' ') ;
//@ 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;
ensures \result <==> matcher_a_or_b(x0);
*/
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 = x8;
}
int x12;
if (x3) {
x12 = 0/*false*/;
} else {
int x10 = x2 == 'b';
int x11;
if (x10) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x11 = x7;
} else {
x11 = 0/*false*/;
}
x12 = x11;
}
int x13 = x9 || x12;
return x13;
}
|
#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;
ensures \result <==> matcher_a_or_b(x0);
*/
|
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 = x8;
}
int x12;
if (x3) {
x12 = 0/*false*/;
} else {
int x10 = x2 == 'b';
int x11;
if (x10) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x11 = x7;
} else {
x11 = 0/*false*/;
}
x12 = x11;
}
int x13 = x9 || x12;
return x13;
}
| 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 = x8;
}
int x12;
if (x3) {
x12 = 0/*false*/;
} else {
int x10 = x2 == 'b';
int x11;
if (x10) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x11 = x7;
} else {
x11 = 0/*false*/;
}
x12 = x11;
}
int x13 = x9 || x12;
return x13;
}
|
#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;
ensures \result <==> matcher_a_or_b(x0);
*/
|
|
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 behaviors p_minimum, q_minimum;
*/
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 behaviors p_minimum, q_minimum;
*/
|
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 behaviors p_minimum, q_minimum;
*/
|
|
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(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==2) || ((x3==1) || (x3==0)));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x37 = x5;
char *x38 = x37+1;
x5 = x38;
/*@ghost x4 = (x4+1);*/
}
char *x84 = x5;
char x85 = x84[0];
int x86 = x85 == '\0';
int x89;
if (x86) {
int x87 = x2;
x89 = x87;
} else {
x89 = 0/*false*/;
}
int x93;
if (x89) {
int x90 = x3;
int x91 = x90 == 2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x93;
}
|
#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 invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==2) || ((x3==1) || (x3==0)));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x37 = x5;
char *x38 = x37+1;
x5 = x38;
/*@ghost x4 = (x4+1);*/
}
char *x84 = x5;
char x85 = x84[0];
int x86 = x85 == '\0';
int x89;
if (x86) {
int x87 = x2;
x89 = x87;
} else {
x89 = 0/*false*/;
}
int x93;
if (x89) {
int x90 = x3;
int x91 = x90 == 2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x93;
}
| 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 invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==2) || ((x3==1) || (x3==0)));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x37 = x5;
char *x38 = x37+1;
x5 = x38;
/*@ghost x4 = (x4+1);*/
}
char *x84 = x5;
char x85 = x84[0];
int x86 = x85 == '\0';
int x89;
if (x86) {
int x87 = x2;
x89 = x87;
} else {
x89 = 0/*false*/;
}
int x93;
if (x89) {
int x90 = x3;
int x91 = x90 == 2;
x93 = x91;
} else {
x93 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x93;
}
|
#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++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i+1;
}
|
/*@ 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;
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i+1;
}
| 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;
}
tmp = A[i+1];
A[i+1] = A[r];
A[r] = tmp;
return i+1;
}
|
/*@ 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 à 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; 0 <= k <= i ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant i+1;
*/
for (int i = n-1; -1 < i; i--) {
dst[i] = src[i];
}
} else {
// recopier de gauche à droite
/*@
loop invariant 0 <= i <= n;
loop invariant
\forall int k; 0 <= k < i ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; i <= k < n ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
dst[i] = src[i];
}
}
}
|
/*@
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; 0 <= k <= i ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant i+1;
*/
for (int i = n-1; -1 < i; i--) {
dst[i] = src[i];
}
} else {
// recopier de gauche à droite
/*@
loop invariant 0 <= i <= n;
loop invariant
\forall int k; 0 <= k < i ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; i <= k < n ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
dst[i] = src[i];
}
}
}
| 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; 0 <= k <= i ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant i+1;
*/
for (int i = n-1; -1 < i; i--) {
dst[i] = src[i];
}
} else {
// recopier de gauche à droite
/*@
loop invariant 0 <= i <= n;
loop invariant
\forall int k; 0 <= k < i ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k; i <= k < n ==> src[k] == \at(src[k], Pre);
loop assigns i, dst[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
dst[i] = src[i];
}
}
}
|
/*@
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 :
https://en.wikipedia.org/wiki/Literate_programming
************************************************************************* */
/* ---------------------------------------------------------------------------
Cet exercice est une variation de l'exercice "Maximum d'un tableau" du TD
6. Cet exercice n'a pas été corrigé en cours, mais si vous avez pris le temps
de le faire par vous-même comme je l'avais demandé, cela devrait vous
permettre de gagner un peu de temps pour ce TP noté...
------------------------------------------------------------------------- */
/* ---------------------------------------------------------------------------
La fonction [max_idx] est une fonction auxiliaire de la fonction principale
[max_seq], définie juste après. Nous ne donnons ici que sa déclaration. Sa
définition est fournie en fin de fichier.
------------------------------------------------------------------------- */
#include <limits.h>
int max_idx(unsigned int *t, int len);
/* ---------------------------------------------------------------------------
La fonction [max_seq] retourne la valeur maximale contenue dans
le tableau [t] de longueur [len]. Elle retourne -1 si le tableau est vide.
Question 1 : spécifier cette fonction en utilisant des comportements ACSL.
Question 2 : prouver cette fonction, y compris sa terminaison et l'absence
d'erreurs à l'exécution. On prendra garde à ne spécifier que les
préconditions strictement nécessaires pour garantir l'absence d'erreurs à
l'exécution.
Indice : il est autorisé d'inclure un fichier de la bibliothèque standard du
C (déjà utilisé en TD dans des cas similaires).
------------------------------------------------------------------------- */
/*@ 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; 0 <= n < len ==> \result >= t[n];
@ ensures \exists int e; 0 <= e < len && \result == t[e];
@ ensures \result >= 0;
@ complete behaviors;
@ disjoint behaviors;
@ */
int max_seq(unsigned int *t, int len) {
if (len <= 0) return -1;
return t[max_idx(t, len)];
}
/* ---------------------------------------------------------------------------
Ci-après, la définition de la fonction [max_idx].
------------------------------------------------------------------------- */
/*@ requires \valid(t+(0..len-1));
@ requires len > 0;
@ assigns \nothing;
@ ensures len == 0 ==> \result == 0;
@ ensures \forall integer n; 0 <= n < len ==> t[\result] >= t[n];
@ ensures 0 <= \result < len;
@ */
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])
max = i;
return max;
}
|
#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; 0 <= n < len ==> \result >= t[n];
@ ensures \exists int e; 0 <= e < len && \result == t[e];
@ ensures \result >= 0;
@ complete behaviors;
@ disjoint behaviors;
@ */
int max_seq(unsigned int *t, int len) {
if (len <= 0) return -1;
return t[max_idx(t, len)];
}
/* ---------------------------------------------------------------------------
Ci-après, la définition de la fonction [max_idx].
------------------------------------------------------------------------- */
/*@ requires \valid(t+(0..len-1));
@ requires len > 0;
@ assigns \nothing;
@ ensures len == 0 ==> \result == 0;
@ ensures \forall integer n; 0 <= n < len ==> t[\result] >= t[n];
@ ensures 0 <= \result < len;
@ */
|
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])
max = i;
return max;
}
| 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])
max = i;
return max;
}
|
#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; 0 <= n < len ==> \result >= t[n];
@ ensures \exists int e; 0 <= e < len && \result == t[e];
@ ensures \result >= 0;
@ complete behaviors;
@ disjoint behaviors;
@ */
int max_seq(unsigned int *t, int len) {
if (len <= 0) return -1;
return t[max_idx(t, len)];
}
/* ---------------------------------------------------------------------------
Ci-après, la définition de la fonction [max_idx].
------------------------------------------------------------------------- */
/*@ requires \valid(t+(0..len-1));
@ requires len > 0;
@ assigns \nothing;
@ ensures len == 0 ==> \result == 0;
@ ensures \forall integer n; 0 <= n < len ==> t[\result] >= t[n];
@ ensures 0 <= \result < len;
@ */
|
|
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_matrix_Boolean(int * x26, integer x27, integer x28) = (((((x27<100) &&
(x28<100)) &&
(0<x27)) &&
(0<x28)) &&
(((x27*x28)>0) &&
\valid(x26+(0..(x27*x28)-1))));*/
/*@
requires (((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71)) &&
((((x64==x67) &&
(x64==x70)) &&
(x65==x68)) &&
(x65==x71)));
ensures ((inv_matrix_Boolean(x63,x64,x65) &&
inv_matrix_Boolean(x66,x67,x68)) &&
inv_matrix_Boolean(x69,x70,x71));
*/
void add(int * x63, int x64, int x65, int * x66, int x67, int x68, int * x69, int x70, int x71) {
/*@
loop invariant 0<=x76<=x70;
loop assigns x76, x69[(0..(x70*x71)-1)];
loop variant x70-x76;
*/
for(int x76=0; x76 < x70; x76++) {
/*@
loop invariant 0<=x78<=x71;
loop assigns x78, x69[(0..(x70*x71)-1)];
loop variant x71-x78;
*/
for(int x78=0; x78 < x71; x78++) {
int x79 = index(x64,x65,x76,x78);
int x80 = x63[x79];
int x81 = index(x67,x68,x76,x78);
int x82 = x66[x81];
int x83 = x80 || x82;
int x84 = index(x70,x71,x76,x78);
x69[x84] = x83;
}
}
}
/*@
requires ((inv_matrix_Boolean(x111,x112,x113) &&
inv_matrix_Boolean(x114,x115,x116)) &&
((x112==x115) &&
(x113==x116)));
ensures (inv_matrix_Boolean(x111,x112,x113) &&
inv_matrix_Boolean(x114,x115,x116));
*/
void scalar_mult(int x110, int * x111, int x112, int x113, int * x114, int x115, int x116) {
/*@
loop invariant 0<=x121<=x115;
loop assigns x121, x114[(0..(x115*x116)-1)];
loop variant x115-x121;
*/
for(int x121=0; x121 < x115; x121++) {
/*@
loop invariant 0<=x123<=x116;
loop assigns x123, x114[(0..(x115*x116)-1)];
loop variant x116-x123;
*/
for(int x123=0; x123 < x116; x123++) {
int x126;
if (x110) {
int x124 = index(x112,x113,x121,x123);
int x125 = x111[x124];
x126 = x125;
} else {
x126 = 0/*false*/;
}
int x127 = index(x115,x116,x121,x123);
x114[x127] = x126;
}
}
}
|
#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 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];
*/
|
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
|
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
|
|
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
|
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
|
|
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
|
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]==s[0])) &&
matchhere(r+1, s+1));
*/
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='B' && s[3]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='A' && s[3]=='B' && s[4]=='\0';
ensures matchhere(r, s);
assigns \nothing;
*/
void dfa_spec_aab1_1(char* r, char* s) {}
/*@
requires strlen(r)>=0 && \valid(r+(0..strlen(r)));
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires r[0]=='.' && r[1]=='*' && r[2]=='A' && r[3]=='A' && r[4]=='B' && r[5]=='\0';
requires s[0]=='A' && s[1]=='A' && s[2]=='X' && s[3]=='\0';
ensures !matchhere(r, s);
assigns \nothing;
*/
|
|
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 < i < \result ==> o[i-1] < o[i];
assigns o[0..n-1];
*/
int index_where(int* v, int n, int* o) {
int r = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant 0 <= r <= i;
loop invariant \forall int j; 0 <= j < r ==> 0 <= o[j] < i;
loop invariant \forall int j; 0 < j < r ==> o[j-1] < o[j];
loop assigns i, r, o[0..n-1];
loop variant n-i;
*/
for (int i = 0; i < n; i++) {
if (predicate(v[i])) {
o[r++] = i;
}
}
return r;
}
|
/*@ 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(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==3) || ((x3==2) || ((x3==1) || (x3==0))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x39 = x5;
char *x40 = x39+1;
x5 = x40;
/*@ghost x4 = (x4+1);*/
}
char *x86 = x5;
char x87 = x86[0];
int x88 = x87 == '\0';
int x91;
if (x88) {
int x89 = x2;
x91 = x89;
} else {
x91 = 0/*false*/;
}
int x95;
if (x91) {
int x92 = x3;
int x93 = x92 == 3;
x95 = x93;
} else {
x95 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x95;
}
|
#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 invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==3) || ((x3==2) || ((x3==1) || (x3==0))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x39 = x5;
char *x40 = x39+1;
x5 = x40;
/*@ghost x4 = (x4+1);*/
}
char *x86 = x5;
char x87 = x86[0];
int x88 = x87 == '\0';
int x91;
if (x88) {
int x89 = x2;
x91 = x89;
} else {
x91 = 0/*false*/;
}
int x95;
if (x91) {
int x92 = x3;
int x93 = x92 == 3;
x95 = x93;
} else {
x95 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x95;
}
| 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 invariant ((x5[0]=='\0') ==> (strlen(x0)==x4));
loop invariant ((!(x5[0]=='\0')) ==> (strlen(x0)!=x4));
loop invariant ((x3==3) || ((x3==2) || ((x3==1) || (x3==0))));
loop assigns x5, x4, x3, x2;
loop variant strlen(x5);
*/
for (;;) {
char *x7 = x5;
char x8 = x7[0];
int x9 = x8 == '\0';
int x13;
if (x9) {
x13 = 0/*false*/;
} else {
int x11 = x2;
x13 = x11;
}
if (!x13) break;
char *x39 = x5;
char *x40 = x39+1;
x5 = x40;
/*@ghost x4 = (x4+1);*/
}
char *x86 = x5;
char x87 = x86[0];
int x88 = x87 == '\0';
int x91;
if (x88) {
int x89 = x2;
x91 = x89;
} else {
x91 = 0/*false*/;
}
int x95;
if (x91) {
int x92 = x3;
int x93 = x92 == 3;
x95 = x93;
} else {
x95 = 0/*false*/;
}
/*@assert ((x5[0]=='\0') || (!x2));*/
return x95;
}
|
#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) ==> (\forall integer rp; (1 < rp < N && allequ(j,x,rp)) ==> (rp <= res));
@*/
//Examines that res is the max res the you can get in length N
//For every r that satisfies allequ this r must be smaller-equal from res
/*@ predicate cond{L}(integer N, int *x, integer res) =
@ \exists integer i; (0 <= i < N-res) ==> (allequ(i,x,res) && ismax(i,x,res,N));
@*/
//For something to satisfy the given condition there must exist an integer such that for i to
// i+res-1 positions we will have equality and this will be the max length
/*@ requires N > 0;
@ requires \valid(x + (0..N-1));
@ ensures cond(N, x,\result);
@*/
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 < best;
@ loop invariant (0 < best <==> allequ(i,x,best)) || (best == 0 <==> i==0) ;
@ loop invariant (0 < best <==> ismax(i,x,best,i+1)) || (best == 0 <==> i==0);
@ loop invariant ((0 < i < N && 0 < best) <==> cond(i+1,x,best)) || (best == 0 <==> i==0);
@ loop assigns i, best;
@ loop variant N-i;
@*/
while (i < N) {
int j = i+1;
// while we are inside the second loop everything allequ for j-i
// (starting from i) matrix positions is maintained
/*@ loop invariant i+1 <= j <= N;
@ loop invariant (x[j] == x[i]) ==> allequ(i,x,j-i);
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
|
/*@ 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) ==> (\forall integer rp; (1 < rp < N && allequ(j,x,rp)) ==> (rp <= res));
@*/
//Examines that res is the max res the you can get in length N
//For every r that satisfies allequ this r must be smaller-equal from res
/*@ predicate cond{L}(integer N, int *x, integer res) =
@ \exists integer i; (0 <= i < N-res) ==> (allequ(i,x,res) && ismax(i,x,res,N));
@*/
//For something to satisfy the given condition there must exist an integer such that for i to
// i+res-1 positions we will have equality and this will be the max length
/*@ requires N > 0;
@ requires \valid(x + (0..N-1));
@ ensures cond(N, x,\result);
@*/
|
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 < best;
@ loop invariant (0 < best <==> allequ(i,x,best)) || (best == 0 <==> i==0) ;
@ loop invariant (0 < best <==> ismax(i,x,best,i+1)) || (best == 0 <==> i==0);
@ loop invariant ((0 < i < N && 0 < best) <==> cond(i+1,x,best)) || (best == 0 <==> i==0);
@ loop assigns i, best;
@ loop variant N-i;
@*/
while (i < N) {
int j = i+1;
// while we are inside the second loop everything allequ for j-i
// (starting from i) matrix positions is maintained
/*@ loop invariant i+1 <= j <= N;
@ loop invariant (x[j] == x[i]) ==> allequ(i,x,j-i);
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
| 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 < best;
@ loop invariant (0 < best <==> allequ(i,x,best)) || (best == 0 <==> i==0) ;
@ loop invariant (0 < best <==> ismax(i,x,best,i+1)) || (best == 0 <==> i==0);
@ loop invariant ((0 < i < N && 0 < best) <==> cond(i+1,x,best)) || (best == 0 <==> i==0);
@ loop assigns i, best;
@ loop variant N-i;
@*/
while (i < N) {
int j = i+1;
// while we are inside the second loop everything allequ for j-i
// (starting from i) matrix positions is maintained
/*@ loop invariant i+1 <= j <= N;
@ loop invariant (x[j] == x[i]) ==> allequ(i,x,j-i);
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
|
/*@ 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) ==> (\forall integer rp; (1 < rp < N && allequ(j,x,rp)) ==> (rp <= res));
@*/
//Examines that res is the max res the you can get in length N
//For every r that satisfies allequ this r must be smaller-equal from res
/*@ predicate cond{L}(integer N, int *x, integer res) =
@ \exists integer i; (0 <= i < N-res) ==> (allequ(i,x,res) && ismax(i,x,res,N));
@*/
//For something to satisfy the given condition there must exist an integer such that for i to
// i+res-1 positions we will have equality and this will be the max length
/*@ requires N > 0;
@ requires \valid(x + (0..N-1));
@ ensures cond(N, x,\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;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/
char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
}
/*@
assigns \nothing;
ensures '0'<=c<='9' ==> \result==c;
ensures c!=\result ==> \result==' ';
ensures e(d(c))==\result;
*/
char ed(char c) {
return e(d(c));
}
/*@
assigns \nothing;
ensures 0<=i<=9 ==> \result==i;
ensures i!=\result ==> \result==-1;
ensures d(e(i))==\result;
*/
int de(int i) {
return d(e(i));
}
/*@
assigns \nothing;
ensures d(e(d(c)))==d(c);
*/
int ded(char c) {
return d(e(d(c)));
}
/*@
assigns \nothing;
ensures e(d(e(i)))==e(i);
*/
char ede(int i) {
return e(d(e(i)));
}
|
#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;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/
char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
}
/*@
assigns \nothing;
ensures '0'<=c<='9' ==> \result==c;
ensures c!=\result ==> \result==' ';
ensures e(d(c))==\result;
*/
char ed(char c) {
return e(d(c));
}
/*@
assigns \nothing;
ensures 0<=i<=9 ==> \result==i;
ensures i!=\result ==> \result==-1;
ensures d(e(i))==\result;
*/
int de(int i) {
return d(e(i));
}
/*@
assigns \nothing;
ensures d(e(d(c)))==d(c);
*/
int ded(char c) {
return d(e(d(c)));
}
/*@
assigns \nothing;
ensures e(d(e(i)))==e(i);
*/
char ede(int i) {
return e(d(e(i)));
}
|
#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;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/
|
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;
ensures '0'<=\result<='9' || \result==' ';
ensures e(i)==\result;
*/
|
|
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 Vector[Vector[Char]]
predicate spec_Inv_VVC(char **a1, int *an1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)) && \valid(an1+(0..n-1))) &&
(\forall int j; (0<=j<n) ==> spec_Inv_VC(a1[j],an1[j]));
predicate spec_Eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]));
*/
// Contract and implementation for Vector[Char] equality
/*@ requires spec_Inv_VC(a1,n1) && spec_Inv_VC(a2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VC(a1,a2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VC(a1,a2,n1,n2);
assigns \nothing; */
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;
}
return 1;
}
// Contract and implementation for Vector[Vector[Char]] equality
/*@ requires spec_Inv_VVC(a1,an1,n1) && spec_Inv_VVC(a2,an2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VVC(a1,a2,an1,an2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VVC(a1,a2,an1,an2,n1,n2);
assigns \nothing; */
int eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]);
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (eq_VC(a1[i],a2[i],an1[i],an2[i]) != 1) return 0;
}
return 1;
}
|
/*@
// 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 Vector[Vector[Char]]
predicate spec_Inv_VVC(char **a1, int *an1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)) && \valid(an1+(0..n-1))) &&
(\forall int j; (0<=j<n) ==> spec_Inv_VC(a1[j],an1[j]));
predicate spec_Eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]));
*/
// Contract and implementation for Vector[Char] equality
/*@ requires spec_Inv_VC(a1,n1) && spec_Inv_VC(a2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VC(a1,a2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VC(a1,a2,n1,n2);
assigns \nothing; */
|
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;
}
return 1;
}
| 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;
}
return 1;
}
|
/*@
// 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 Vector[Vector[Char]]
predicate spec_Inv_VVC(char **a1, int *an1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)) && \valid(an1+(0..n-1))) &&
(\forall int j; (0<=j<n) ==> spec_Inv_VC(a1[j],an1[j]));
predicate spec_Eq_VVC(char **a1, char **a2, int *an1, int *an2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> spec_Eq_VC(a1[j],a2[j],an1[j],an2[j]));
*/
// Contract and implementation for Vector[Char] equality
/*@ requires spec_Inv_VC(a1,n1) && spec_Inv_VC(a2,n2);
ensures (\result == 1) || (\result == 0);
ensures (\result == 1) <==> spec_Eq_VC(a1,a2,n1,n2);
ensures (\result == 0) <==> !spec_Eq_VC(a1,a2,n1,n2);
assigns \nothing; */
|
|
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,x19));
assigns \nothing;
ensures (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
ensures \result <==> eq_vec_Int(x16, x17, x18, x19);
*/
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 = 0; x24 < x17; x24++) {
int x29 = x16[x24];
int x30 = x18[x24];
int x31 = x29 == x30;
if (!x31) { x32 = 0; break; }
}
x33 = x32;
} else {
x33 = 0/*false*/;
}
return x33;
}
/*@ predicate inv_vec_vec_Int(int * * x37, int * x38, int x39) = (((x39==0) || ((x39>0) &&
(\valid(x37+(0..x39-1)) &&
\valid(x38+(0..x39-1))))) &&
(\forall int x49; (0<=x49<x39) ==> inv_vec_Int(x37[x49],x38[x49])));*/
/*@ predicate eq_vec_vec_Int(int * * x61, int * x62, int x63, int * * x64, int * x65, int x66) = ((x63==x66) &&
(\forall int x70; (0<=x70<x63) ==> eq_vec_Int(x61[x70],x62[x70],x64[x70],x65[x70])));*/
/*@
requires (inv_vec_vec_Int(x61,x62,x63) &&
inv_vec_vec_Int(x64,x65,x66));
assigns \nothing;
ensures (inv_vec_vec_Int(x61,x62,x63) &&
inv_vec_vec_Int(x64,x65,x66));
ensures \result <==> eq_vec_vec_Int(x61, x62, x63, x64, x65, x66);
*/
int eq_vec_vec_Int(int * * x61, int * x62, int x63, int * * x64, int * x65, int x66) {
int x68 = x63 == x66;
int x84;
if (x68) {
int x83 = 1;
/*@ loop invariant (0 <= x71 <= x63);
loop invariant \forall int x70; (0 <= x70 < x71) ==> eq_vec_Int(x61[x70],x62[x70],x64[x70],x65[x70]);
loop assigns x71;
loop variant (x63-x71); */
for (int x71 = 0; x71 < x63; x71++) {
int *x78 = x61[x71];
int x79 = x62[x71];
int *x80 = x64[x71];
int x81 = x65[x71];
int x82 = eq_vec_Int(x78,x79,x80,x81);
if (!x82) { x83 = 0; break; }
}
x84 = x83;
} else {
x84 = 0/*false*/;
}
return x84;
}
|
#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,x19));
assigns \nothing;
ensures (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
ensures \result <==> eq_vec_Int(x16, x17, x18, x19);
*/
|
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 = 0; x24 < x17; x24++) {
int x29 = x16[x24];
int x30 = x18[x24];
int x31 = x29 == x30;
if (!x31) { x32 = 0; break; }
}
x33 = x32;
} else {
x33 = 0/*false*/;
}
return x33;
}
| 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 = 0; x24 < x17; x24++) {
int x29 = x16[x24];
int x30 = x18[x24];
int x31 = x29 == x30;
if (!x31) { x32 = 0; break; }
}
x33 = x32;
} else {
x33 = 0/*false*/;
}
return x33;
}
|
#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,x19));
assigns \nothing;
ensures (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x19));
ensures \result <==> eq_vec_Int(x16, x17, x18, x19);
*/
|
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
|
#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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
|
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
|
#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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
|
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
|
#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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
|
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
|
#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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
|
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
|
#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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
|
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s, 0, strlen(s)) ==> \result==1;
ensures \result==1 ==> match_aapb(s, 0, strlen(s));
assigns \nothing;
*/
int m_aapb(char* s) {
char* cur = s;
int id = 0;
int m = 1;
//@ghost int i = 0;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant strlen(cur)>=0 && \valid(cur+(0..strlen(cur)));
loop invariant 0<=i<=strlen(s);
loop invariant (id == 0) && m ==> bwd0(s, 0, i);
loop invariant (id == 1) && m ==> bwd1(s, 0, i);
loop invariant (id == 2) && m ==> bwd2(s, 0, i);
loop invariant (m == 0) ==> !bwd0(s, 0, i) && !bwd1(s, 0, i) && !bwd2(s, 0, i);
loop invariant (id == 0) && !m ==> s[0]!='A';
loop invariant (id == 1) && !m ==> s[i-1]!='A' && s[i-1]!='B';
loop invariant (id == 2) && !m ==> s[i-2]=='B';
loop invariant (id == 0) && !m ==> bwd0(s, 0, i-1);
loop invariant (id == 1) && !m ==> bwd1(s, 0, i-1);
loop invariant (id == 2) && !m ==> bwd2(s, 0, i-1);
loop invariant (id == 2) && cur[0]=='\0' && m ==> match_aapb(s, 0, i);
loop invariant (id != 2) || cur[0]!='\0' || !m ==> !match_aapb(s, 0, i);
loop invariant (id == 0) || (id == 1) || (id == 2);
loop invariant cur==s+i;
loop invariant cur[0]==s[i];
loop assigns cur, id, i, m;
loop variant strlen(cur);
*/
while (cur[0]!='\0' && m) {
m = 0;
if (id == 0) {
//@assert (id == 0) ==> bwd0(s, 0, i);
//@assert bwd0(s, 0, i);
//@assert i==0;
if (cur[0] == 'A') {
id = 1;
//@ghost lemma01(s, 0, i);
//@assert bwd1(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1) && !bwd1(s, 0, i+1) && !bwd2(s, 0, i+1);
}
} else if (id == 1) {
//@assert (id == 1) ==> bwd1(s, 0, i);
//@assert bwd1(s, 0, i);
if (cur[0] == 'A') {
//@ghost lemma11(s, 0, i);
id = 1;
//@assert bwd1(s, 0, i+1);
m = 1;
} else if (cur[0] == 'B') {
//@ghost lemma12(s, 0, i);
id = 2;
//@assert bwd2(s, 0, i+1);
//@ghost lemma2f(s, 0, i+1);
m = 1;
} else {
//@assert !bwd0(s, 0, i+1);
//@assert s[i]!='A';
//@ghost lemma_star_A_not(s, 1, i, i+1);
//@assert !bwd1(s, 0, i+1);
//@assert !bwd2(s, 0, i+1);
}
} else if (id == 2) {
//@assert (id == 2) ==> bwd2(s, 0, i);
//@assert bwd2(s, 0, i);
//@assert !bwd0(s, 0, i+1);
//@assert s[i-1]!='A';
//@ghost lemma_star_A_not(s, 1, i-1, i+1);
//@assert !star_A(s, 1, i+1);
//@assert !bwd1(s, 0, i+1);
//@ghost lemma_star_A_not(s, 1, i-1, i);
//@assert !star_A(s, 1, i);
//@assert !bwd2(s, 0, i+1);
} else {
//@assert \false;
}
cur++;
//@ghost i++;
}
int res = id==2 && cur[0]=='\0' && m;
/*@ghost
if (!res) {
if (!m) {
//@assert i>=1;
//@assert !match_aapb(s, 0, i);
//@assert !bwd2(s, 0, i);
int x = i;
int j = strlen(s);
if (id==0) {
//@assert s[0]!='A';
//@assert !bwd2(s, 0, j);
} else if (id==1) {
//@assert s[i-1]!='A' && s[i-1]!='B';
//@assert s[i-1]!='A';
if (i-1<j-1) {
//@ghost lemma_star_A_not(s, 1, i-1, j-1);
} else {
//@assert i==j;
}
//@assert !bwd2(s, 0, j);
} else if (id==2) {
//@assert s[i-2]=='B';
//@assert s[i-2]!='A';
//@ghost lemma_star_A_not(s, 1, i-2, j-1);
//@assert !bwd2(s, 0, j);
}
//@assert !bwd2(s, 0, strlen(s));
//@assert !match_aapb(s, 0, strlen(s));
}
}
*/
return res;
}
|
#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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
|
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* s, integer i, integer j) = i>=j;
predicate bwd1(char* s, integer i, integer j) = s[i]=='A' && \exists integer m; i<m<=j && star_A(s,i+1,m) && m>=j;
predicate bwd2(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && m+1>=j;
*/
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires star_A(s, i, j);
ensures \forall integer m; 0<=i<=m<j ==> s[m]=='A';
assigns \nothing;
*/
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++;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=strlen(s);
requires \forall integer m; 0<=i<=m<j ==> s[m]=='A';
ensures star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=m<j<=strlen(s);
requires s[m]!='A';
ensures !star_A(s, i, j);
assigns \nothing;
*/
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--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<j;
requires star_A(s, i, j);
ensures star_A(s, i, j-1);
assigns \nothing;
*/
void lemma_star_A_dec(char* s, int i, int j) {
//@ghost lemma_star_A_all(s, i, j);
//@ghost lemma_all_star_A(s, i, j-1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=j<=n<=strlen(s);
requires star_A(s, i, j);
requires star_A(s, j, n);
ensures star_A(s, i, n);
assigns \nothing;
*/
void lemma_star_A(char* s, int i, int j, int n) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= n <= strlen(s);
loop invariant star_A(s, x, n);
loop invariant star_A(s, i, x);
loop assigns x;
loop variant x;
*/
while (i < x) {
//@ghost lemma_star_A_dec(s, i, x);
//@assert i<x;
//@ghost lemma_star_A_all(s, i, x);
//@assert s[x-1]=='A';
//@assert star_A(s, x, n);
//@assert star_A(s, x-1, n);
x--;
}
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd0(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires i<=j;
requires bwd1(s, 0, j);
requires s[j]=='A';
ensures bwd1(s, 0, j+1);
assigns \nothing;
*/
void lemma11(char* s, int i, int j) {
//@assert s[0]=='A';
//@assert star_A(s, 1, j);
//@assert s[j]=='A';
//@assert star_A(s, j+1, j+1);
//@ghost lemma_star_A(s, 1, j, j+1);
//@assert star_A(s, 1, j+1);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd1(s, i, j);
requires s[j]=='B';
ensures bwd2(s, i, j+1);
assigns \nothing;
*/
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);
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
requires 0<=i<=strlen(s);
requires 0<=j<=strlen(s);
requires bwd2(s, i, j);
ensures s[j]=='\0' ==> match_aapb(s, i, j);
assigns \nothing;
*/
|
|
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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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 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] && v[c]);
}
o[r] = t;
}
}
/*@
requires n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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] && v[c]);
}
o[r] = t;
o[1] = 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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
|
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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
|
|
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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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 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] && v[c]);
}
o[r] = t;
}
}
/*@
requires n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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] && v[c]);
}
o[r] = t;
o[1] = 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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
|
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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
|
|
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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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 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] && v[c]);
}
o[r] = t;
}
}
/*@
requires n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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] && v[c]);
}
o[r] = t;
o[1] = 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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
|
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 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] && v[c]);
}
o[r] = t;
}
}
| 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 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] && v[c]);
}
o[r] = t;
}
}
|
/*@
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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
|
|
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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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 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] && v[c]);
}
o[r] = t;
}
}
/*@
requires n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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] && v[c]);
}
o[r] = t;
o[1] = 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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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 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] && v[c]);
}
o[r] = t;
}
}
/*@
requires n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
|
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] && v[c]);
}
o[r] = t;
o[1] = 0;
}
| 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] && v[c]);
}
o[r] = t;
o[1] = 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]) || (m[1] && v[1]);
ensures o[1] == (m[2] && v[0]) || (m[3] && v[1]);
*/
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);
requires \forall int i; 0 <= i < 4 ==> 0 <= m[i] <= 1;
requires \forall int i; 0 <= i < 2 ==> 0 <= v[i] <= 1;
assigns o[0..1];
ensures o[0] == m[0]*v[0]+m[1]*v[1];
ensures o[1] == m[2]*v[0]+m[3]*v[1];
*/
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 n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
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 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] && v[c]);
}
o[r] = t;
}
}
/*@
requires n==2;
requires \valid(m+(0..n*n-1));
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
requires \forall int i; \forall int j;
0 <= i < n*n && 0 <= j < n ==> \separated(m+i,o+j);
requires \forall int i; \forall int j;
0 <= i < n && 0 <= j < n ==> \separated(v+i,o+j);
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==> o[i] == (m[n*i+0] && v[0]) || (m[n*i+1] && v[1]);
*/
|
|
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 0<=\result<length && a[\result] == key;
behavior not_exists:
assumes \forall integer i; 0<=i<length ==> a[i] != key;
ensures \result == -1;
complete behaviors;
disjoint behaviors;
*/
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;
loop variant high-low;
*/
while (low<=high) {
int mid = low+(high-low)/2;
if (a[mid] == key) return mid;
if (a[mid] < key) { low = mid+1; }
else { high = mid - 1; }
}
return -1;
}
|
/*@ 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 0<=\result<length && a[\result] == key;
behavior not_exists:
assumes \forall integer i; 0<=i<length ==> a[i] != key;
ensures \result == -1;
complete behaviors;
disjoint behaviors;
*/
|
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;
loop variant high-low;
*/
while (low<=high) {
int mid = low+(high-low)/2;
if (a[mid] == key) return mid;
if (a[mid] < key) { low = mid+1; }
else { high = mid - 1; }
}
return -1;
}
| 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;
loop variant high-low;
*/
while (low<=high) {
int mid = low+(high-low)/2;
if (a[mid] == key) return mid;
if (a[mid] < key) { low = mid+1; }
else { high = mid - 1; }
}
return -1;
}
|
/*@ 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 0<=\result<length && a[\result] == key;
behavior not_exists:
assumes \forall integer i; 0<=i<length ==> a[i] != key;
ensures \result == -1;
complete behaviors;
disjoint behaviors;
*/
|
|
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;
requires strlen(s)-i>=stop;
requires 0 <= n <= stop;
requires !star_A(s, i, n);
ensures !star_A(s, i, stop);
assigns \nothing;
*/
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;
}
/*@
requires strlen(s)>=0 && \valid(s+(0..strlen(s)));
requires strlen(s)<=INT_MAX;
ensures match_aapb(s) ==> \result==1;
ensures \result==1 ==> match_aapb(s);
assigns \nothing;
*/
int m_aapb(char* s) {
if (strlen(s)<2) {
//@assert !match_aapb(s);
return 0;
}
//@assert strlen(s)>=2;
int n = 0;
if (s[n]!='A') {
//@assert !match_aapb(s);
return 0;
}
//@assert s[n]=='A';
/*@
loop invariant 0 <= n <= strlen(s)-2;
loop invariant star_A(s, 1, n);
loop assigns n;
loop variant strlen(s)-2-n;
*/
while (n!=strlen(s)-2 && s[1+n]=='A') {
n++;
}
if (n!=strlen(s)-2) {
//@assert n < strlen(s)-2;
//@assert s[1+n]!='A';
//@assert star_A(s, 1, n);
//@assert !star_A(s, 1, n+1);
//@ghost lemma_not_star_A(s, 1, n+1, strlen(s)-2);
//@assert !star_A(s, 1, strlen(s)-2);
//@assert !match_aapb(s);
return 0;
}
//@assert star_A(s, 1, strlen(s)-2);
n++;
if (s[n]!='B') {
//@assert !match_aapb(s);
return 0;
}
//@assert s[n]=='B';
n++;
//@assert s[n]=='\0';
//@assert match_aapb(s);
return s[n]=='\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;
requires strlen(s)-i>=stop;
requires 0 <= n <= stop;
requires !star_A(s, i, n);
ensures !star_A(s, i, stop);
assigns \nothing;
*/
|
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;
requires strlen(s)-i>=stop;
requires 0 <= n <= stop;
requires !star_A(s, i, n);
ensures !star_A(s, i, stop);
assigns \nothing;
*/
|
|
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[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;
*/
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]==v) {
r = i;
}
}
return r;
}
|
/*@ 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[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;
*/
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]==v) {
r = i;
}
}
return r;
}
|
/*@ 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;
}
/*@ 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_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]==v) {
r = i;
}
}
return r;
}
| 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]==v) {
r = i;
}
}
return r;
}
|
/*@ 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;
}
/*@ 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_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;
ensures \result == num2;
behavior second2_case:
assumes num1<=num2;
assumes num2<=num3;
ensures \result == 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;
}
}
|
/*@
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;
ensures \result == num2;
behavior second2_case:
assumes num1<=num2;
assumes num2<=num3;
ensures \result == 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;
ensures \result == num2;
behavior second2_case:
assumes num1<=num2;
assumes num2<=num3;
ensures \result == 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_@[email protected]
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) {
{ int *q = p;
*p = 0;
goto L;
}
L:
return 0;
}
int instrument1(int *p) {
*p = 0;
return 0;
}
/*@ requires \valid(p); */
int instrument2(int *p) {
{ int *q = p;
*p = 0;
goto L;
}
L:
return 0;
}
/* test combination of -e-acsl-instrument and -variadic-no-translation;
see gitlab's issue #88 */
int vol(int n, ...) {
va_list vl;
va_start(vl, n);
int r = va_arg(vl, int);
va_end(vl);
return 1;
}
int main(void) {
int x;
int y = 0;
instrument1(&x);
uninstrument1(&x);
instrument2(&x);
uninstrument2(&x);
/*@ assert \initialized(&x); */
/*@ assert \initialized(&y); */
return vol(6, 1);
}
|
#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_matrix_Boolean(int * x36, int x37, int x38) = (((((x37<100) &&
(x38<100)) &&
(0<x37)) &&
(0<x38)) &&
(((x37*x38)>0) &&
\valid(x36+(0..(x37*x38)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
((x86==x80) &&
(x87==x81))) &&
((x86==x83) &&
(x87==x84))) &&
((\forall int x141; (\forall int x142; ((((0<=x141) &&
(x141<(x86*x87))) &&
((0<=x142) &&
(x142<(x80*x81)))) ==> \separated(x85+x141,x79+x142)))) &&
(\forall int x161; (\forall int x162; ((((0<=x161) &&
(x161<(x86*x87))) &&
((0<=x162) &&
(x162<(x83*x84)))) ==> \separated(x85+x161,x82+x162))))));
ensures (((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
(\forall int x188; (((0<=x188) &&
(x188<(x86*x87))) ==> (x85[x188]==(x79[x188] || x82[x188])))));
*/
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]==(x79[x98] || x82[x98]))));
loop assigns x97, x85[(0..x89-1)];
loop variant x89-x97;
*/
for(int x97=0; x97 < x89; x97++) {
int x112 = x79[x97];
int x113 = x82[x97];
int x114 = x112 || x113;
x85[x97] = x114;
/*@assert \separated(x85+x97,x79+x97);*/
/*@assert \separated(x85+x97,x82+x97);*/
}
}
/*@
requires (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
((x208==x205) &&
(x209==x206))) &&
(\forall int x248; (\forall int x249; ((((0<=x248) &&
(x248<(x208*x209))) &&
((0<=x249) &&
(x249<(x205*x206)))) ==> \separated(x207+x248,x204+x249)))));
ensures (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
(\forall int x274; (((0<=x274) &&
(x274<(x208*x209))) ==> (x207[x274]==(x203 &&
x204[x274]))))) &&
((x203==\false) ==> (\forall int x289; (0<=x289<x208) ==> (\forall int x292; (0<=x292<x209) ==> (x207[((x289*x209)+x292)]==\false)))));
*/
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]))));
loop assigns x216, x207[(0..x211-1)];
loop variant x211-x216;
*/
for(int x216=0; x216 < x211; x216++) {
int x231;
if (x203) {
int x230 = x204[x216];
x231 = x230;
} else {
x231 = 0/*false*/;
}
x207[x216] = x231;
/*@assert \separated(x207+x216,x204+x216);*/
}
}
|
#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_matrix_Boolean(int * x36, int x37, int x38) = (((((x37<100) &&
(x38<100)) &&
(0<x37)) &&
(0<x38)) &&
(((x37*x38)>0) &&
\valid(x36+(0..(x37*x38)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
((x86==x80) &&
(x87==x81))) &&
((x86==x83) &&
(x87==x84))) &&
((\forall int x141; (\forall int x142; ((((0<=x141) &&
(x141<(x86*x87))) &&
((0<=x142) &&
(x142<(x80*x81)))) ==> \separated(x85+x141,x79+x142)))) &&
(\forall int x161; (\forall int x162; ((((0<=x161) &&
(x161<(x86*x87))) &&
((0<=x162) &&
(x162<(x83*x84)))) ==> \separated(x85+x161,x82+x162))))));
ensures (((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
(\forall int x188; (((0<=x188) &&
(x188<(x86*x87))) ==> (x85[x188]==(x79[x188] || x82[x188])))));
*/
|
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]==(x79[x98] || x82[x98]))));
loop assigns x97, x85[(0..x89-1)];
loop variant x89-x97;
*/
for(int x97=0; x97 < x89; x97++) {
int x112 = x79[x97];
int x113 = x82[x97];
int x114 = x112 || x113;
x85[x97] = x114;
/*@assert \separated(x85+x97,x79+x97);*/
/*@assert \separated(x85+x97,x82+x97);*/
}
}
| 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]==(x79[x98] || x82[x98]))));
loop assigns x97, x85[(0..x89-1)];
loop variant x89-x97;
*/
for(int x97=0; x97 < x89; x97++) {
int x112 = x79[x97];
int x113 = x82[x97];
int x114 = x112 || x113;
x85[x97] = x114;
/*@assert \separated(x85+x97,x79+x97);*/
/*@assert \separated(x85+x97,x82+x97);*/
}
}
|
#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_matrix_Boolean(int * x36, int x37, int x38) = (((((x37<100) &&
(x38<100)) &&
(0<x37)) &&
(0<x38)) &&
(((x37*x38)>0) &&
\valid(x36+(0..(x37*x38)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
((x86==x80) &&
(x87==x81))) &&
((x86==x83) &&
(x87==x84))) &&
((\forall int x141; (\forall int x142; ((((0<=x141) &&
(x141<(x86*x87))) &&
((0<=x142) &&
(x142<(x80*x81)))) ==> \separated(x85+x141,x79+x142)))) &&
(\forall int x161; (\forall int x162; ((((0<=x161) &&
(x161<(x86*x87))) &&
((0<=x162) &&
(x162<(x83*x84)))) ==> \separated(x85+x161,x82+x162))))));
ensures (((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
(\forall int x188; (((0<=x188) &&
(x188<(x86*x87))) ==> (x85[x188]==(x79[x188] || x82[x188])))));
*/
|
|
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_matrix_Boolean(int * x36, int x37, int x38) = (((((x37<100) &&
(x38<100)) &&
(0<x37)) &&
(0<x38)) &&
(((x37*x38)>0) &&
\valid(x36+(0..(x37*x38)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
((x86==x80) &&
(x87==x81))) &&
((x86==x83) &&
(x87==x84))) &&
((\forall int x141; (\forall int x142; ((((0<=x141) &&
(x141<(x86*x87))) &&
((0<=x142) &&
(x142<(x80*x81)))) ==> \separated(x85+x141,x79+x142)))) &&
(\forall int x161; (\forall int x162; ((((0<=x161) &&
(x161<(x86*x87))) &&
((0<=x162) &&
(x162<(x83*x84)))) ==> \separated(x85+x161,x82+x162))))));
ensures (((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
(\forall int x188; (((0<=x188) &&
(x188<(x86*x87))) ==> (x85[x188]==(x79[x188] || x82[x188])))));
*/
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]==(x79[x98] || x82[x98]))));
loop assigns x97, x85[(0..x89-1)];
loop variant x89-x97;
*/
for(int x97=0; x97 < x89; x97++) {
int x112 = x79[x97];
int x113 = x82[x97];
int x114 = x112 || x113;
x85[x97] = x114;
/*@assert \separated(x85+x97,x79+x97);*/
/*@assert \separated(x85+x97,x82+x97);*/
}
}
/*@
requires (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
((x208==x205) &&
(x209==x206))) &&
(\forall int x248; (\forall int x249; ((((0<=x248) &&
(x248<(x208*x209))) &&
((0<=x249) &&
(x249<(x205*x206)))) ==> \separated(x207+x248,x204+x249)))));
ensures (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
(\forall int x274; (((0<=x274) &&
(x274<(x208*x209))) ==> (x207[x274]==(x203 &&
x204[x274]))))) &&
((x203==\false) ==> (\forall int x289; (0<=x289<x208) ==> (\forall int x292; (0<=x292<x209) ==> (x207[((x289*x209)+x292)]==\false)))));
*/
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]))));
loop assigns x216, x207[(0..x211-1)];
loop variant x211-x216;
*/
for(int x216=0; x216 < x211; x216++) {
int x231;
if (x203) {
int x230 = x204[x216];
x231 = x230;
} else {
x231 = 0/*false*/;
}
x207[x216] = x231;
/*@assert \separated(x207+x216,x204+x216);*/
}
}
|
#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_matrix_Boolean(int * x36, int x37, int x38) = (((((x37<100) &&
(x38<100)) &&
(0<x37)) &&
(0<x38)) &&
(((x37*x38)>0) &&
\valid(x36+(0..(x37*x38)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
((x86==x80) &&
(x87==x81))) &&
((x86==x83) &&
(x87==x84))) &&
((\forall int x141; (\forall int x142; ((((0<=x141) &&
(x141<(x86*x87))) &&
((0<=x142) &&
(x142<(x80*x81)))) ==> \separated(x85+x141,x79+x142)))) &&
(\forall int x161; (\forall int x162; ((((0<=x161) &&
(x161<(x86*x87))) &&
((0<=x162) &&
(x162<(x83*x84)))) ==> \separated(x85+x161,x82+x162))))));
ensures (((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
(\forall int x188; (((0<=x188) &&
(x188<(x86*x87))) ==> (x85[x188]==(x79[x188] || x82[x188])))));
*/
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]==(x79[x98] || x82[x98]))));
loop assigns x97, x85[(0..x89-1)];
loop variant x89-x97;
*/
for(int x97=0; x97 < x89; x97++) {
int x112 = x79[x97];
int x113 = x82[x97];
int x114 = x112 || x113;
x85[x97] = x114;
/*@assert \separated(x85+x97,x79+x97);*/
/*@assert \separated(x85+x97,x82+x97);*/
}
}
/*@
requires (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
((x208==x205) &&
(x209==x206))) &&
(\forall int x248; (\forall int x249; ((((0<=x248) &&
(x248<(x208*x209))) &&
((0<=x249) &&
(x249<(x205*x206)))) ==> \separated(x207+x248,x204+x249)))));
ensures (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
(\forall int x274; (((0<=x274) &&
(x274<(x208*x209))) ==> (x207[x274]==(x203 &&
x204[x274]))))) &&
((x203==\false) ==> (\forall int x289; (0<=x289<x208) ==> (\forall int x292; (0<=x292<x209) ==> (x207[((x289*x209)+x292)]==\false)))));
*/
|
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]))));
loop assigns x216, x207[(0..x211-1)];
loop variant x211-x216;
*/
for(int x216=0; x216 < x211; x216++) {
int x231;
if (x203) {
int x230 = x204[x216];
x231 = x230;
} else {
x231 = 0/*false*/;
}
x207[x216] = x231;
/*@assert \separated(x207+x216,x204+x216);*/
}
}
| 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]))));
loop assigns x216, x207[(0..x211-1)];
loop variant x211-x216;
*/
for(int x216=0; x216 < x211; x216++) {
int x231;
if (x203) {
int x230 = x204[x216];
x231 = x230;
} else {
x231 = 0/*false*/;
}
x207[x216] = x231;
/*@assert \separated(x207+x216,x204+x216);*/
}
}
|
#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_matrix_Boolean(int * x36, int x37, int x38) = (((((x37<100) &&
(x38<100)) &&
(0<x37)) &&
(0<x38)) &&
(((x37*x38)>0) &&
\valid(x36+(0..(x37*x38)-1))));*/
/*@
requires (((((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
((x86==x80) &&
(x87==x81))) &&
((x86==x83) &&
(x87==x84))) &&
((\forall int x141; (\forall int x142; ((((0<=x141) &&
(x141<(x86*x87))) &&
((0<=x142) &&
(x142<(x80*x81)))) ==> \separated(x85+x141,x79+x142)))) &&
(\forall int x161; (\forall int x162; ((((0<=x161) &&
(x161<(x86*x87))) &&
((0<=x162) &&
(x162<(x83*x84)))) ==> \separated(x85+x161,x82+x162))))));
ensures (((inv_matrix_Boolean(x79,x80,x81) &&
inv_matrix_Boolean(x82,x83,x84)) &&
inv_matrix_Boolean(x85,x86,x87)) &&
(\forall int x188; (((0<=x188) &&
(x188<(x86*x87))) ==> (x85[x188]==(x79[x188] || x82[x188])))));
*/
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]==(x79[x98] || x82[x98]))));
loop assigns x97, x85[(0..x89-1)];
loop variant x89-x97;
*/
for(int x97=0; x97 < x89; x97++) {
int x112 = x79[x97];
int x113 = x82[x97];
int x114 = x112 || x113;
x85[x97] = x114;
/*@assert \separated(x85+x97,x79+x97);*/
/*@assert \separated(x85+x97,x82+x97);*/
}
}
/*@
requires (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
((x208==x205) &&
(x209==x206))) &&
(\forall int x248; (\forall int x249; ((((0<=x248) &&
(x248<(x208*x209))) &&
((0<=x249) &&
(x249<(x205*x206)))) ==> \separated(x207+x248,x204+x249)))));
ensures (((inv_matrix_Boolean(x204,x205,x206) &&
inv_matrix_Boolean(x207,x208,x209)) &&
(\forall int x274; (((0<=x274) &&
(x274<(x208*x209))) ==> (x207[x274]==(x203 &&
x204[x274]))))) &&
((x203==\false) ==> (\forall int x289; (0<=x289<x208) ==> (\forall int x292; (0<=x292<x209) ==> (x207[((x289*x209)+x292)]==\false)))));
*/
|
|
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;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
}
/*@ logic integer decypher(int x15) = (((x15==0)) ? (26) : ((x15-1)));*/
/*@
requires ((0<=x15) &&
(x15<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == decypher(x15);
*/
int decypher(int x15) {
int x17 = x15 == 0;
int x19;
if (x17) {
x19 = 26;
} else {
int x18 = x15 - 1;
x19 = x18;
}
return x19;
}
/*@
requires ((((((x33>0) &&
\valid(x30+(0..x33-1))) &&
\valid(x31+(0..x33-1))) &&
\valid(x32+(0..x33-1))) &&
(\forall int x116; (((0<=x116) &&
(x116<x33)) ==> (\forall int x121; (((0<=x121) &&
(x121<x33)) ==> (\forall int x126; (((0<=x126) &&
(x126<x33)) ==> ((\separated(x30+x116,x31+x121) &&
\separated(x30+x116,x32+x126)) &&
\separated(x31+x121,x32+x126))))))))) &&
(\forall int x148; (((0<=x148) &&
(x148<x33)) ==> ((0<=x30[x148]) &&
(x30[x148]<=26)))));
ensures ((((\forall int x163; (((0<=x163) &&
(x163<x33)) ==> (x31[x163]==cypher(x30[x163])))) &&
(\forall int x175; (((0<=x175) &&
(x175<x33)) ==> ((0<=x31[x175]) &&
(x31[x175]<=26))))) &&
(\forall int x189; (((0<=x189) &&
(x189<x33)) ==> (\old(x30[x189])==x30[x189])))) &&
(\forall int x202; (((0<=x202) &&
(x202<x33)) ==> (\old(x32[x202])==x32[x202]))));
assigns x31[(0..x33-1)];
*/
void encode(int * x30, int * x31, int * x32, int x33) {
/*@
loop invariant 0<=x36<=x33;
loop invariant (\forall int x37; (((0<=x37) &&
(x37<x33)) ==> ((0<=x30[x37]) &&
(x30[x37]<=26))));
loop invariant (\forall int x51; (((0<=x51) &&
(x51<x33)) ==> (\at(x30[x51],Pre)==x30[x51])));
loop invariant (\forall int x64; (((0<=x64) &&
(x64<x33)) ==> (\at(x32[x64],Pre)==x32[x64])));
loop invariant (\forall int x77; (((0<=x77) &&
(x77<x36)) ==> (x31[x77]==cypher(x30[x77]))));
loop assigns x36, x31[(0..x33-1)];
loop variant x33-x36;
*/
for(int x36=0; x36 < x33; x36++) {
int x94 = x30[x36];
int x95 = cypher(x94);
x31[x36] = x95;
/*@assert (x31[x36]==cypher(x30[x36]));*/
}
}
/*@
requires ((((((x219>0) &&
\valid(x216+(0..x219-1))) &&
\valid(x217+(0..x219-1))) &&
\valid(x218+(0..x219-1))) &&
(\forall int x302; (((0<=x302) &&
(x302<x219)) ==> (\forall int x307; (((0<=x307) &&
(x307<x219)) ==> (\forall int x312; (((0<=x312) &&
(x312<x219)) ==> ((\separated(x216+x302,x217+x307) &&
\separated(x216+x302,x218+x312)) &&
\separated(x217+x307,x218+x312))))))))) &&
(\forall int x334; (((0<=x334) &&
(x334<x219)) ==> ((0<=x216[x334]) &&
(x216[x334]<=26)))));
ensures ((((\forall int x349; (((0<=x349) &&
(x349<x219)) ==> (x217[x349]==decypher(x216[x349])))) &&
(\forall int x361; (((0<=x361) &&
(x361<x219)) ==> ((0<=x217[x361]) &&
(x217[x361]<=26))))) &&
(\forall int x375; (((0<=x375) &&
(x375<x219)) ==> (\old(x216[x375])==x216[x375])))) &&
(\forall int x388; (((0<=x388) &&
(x388<x219)) ==> (\old(x218[x388])==x218[x388]))));
assigns x217[(0..x219-1)];
*/
void decode(int * x216, int * x217, int * x218, int x219) {
/*@
loop invariant 0<=x222<=x219;
loop invariant (\forall int x223; (((0<=x223) &&
(x223<x219)) ==> ((0<=x216[x223]) &&
(x216[x223]<=26))));
loop invariant (\forall int x237; (((0<=x237) &&
(x237<x219)) ==> (\at(x216[x237],Pre)==x216[x237])));
loop invariant (\forall int x250; (((0<=x250) &&
(x250<x219)) ==> (\at(x218[x250],Pre)==x218[x250])));
loop invariant (\forall int x263; (((0<=x263) &&
(x263<x222)) ==> (x217[x263]==decypher(x216[x263]))));
loop assigns x222, x217[(0..x219-1)];
loop variant x219-x222;
*/
for(int x222=0; x222 < x219; x222++) {
int x280 = x216[x222];
int x281 = decypher(x280);
x217[x222] = x281;
/*@assert (x217[x222]==decypher(x216[x222]));*/
}
}
/*@
requires ((((((x405>0) &&
\valid(x402+(0..x405-1))) &&
\valid(x403+(0..x405-1))) &&
\valid(x404+(0..x405-1))) &&
(\forall int x421; (((0<=x421) &&
(x421<x405)) ==> (\forall int x426; (((0<=x426) &&
(x426<x405)) ==> (\forall int x431; (((0<=x431) &&
(x431<x405)) ==> ((\separated(x402+x421,x403+x426) &&
\separated(x402+x421,x404+x431)) &&
\separated(x403+x426,x404+x431))))))))) &&
(\forall int x453; (((0<=x453) &&
(x453<x405)) ==> ((0<=x402[x453]) &&
(x402[x453]<=26)))));
ensures ((\forall int x468; (((0<=x468) &&
(x468<x405)) ==> (x404[x468]==x402[x468]))) &&
(\forall int x479; (((0<=x479) &&
(x479<x405)) ==> (\old(x402[x479])==x402[x479]))));
assigns x403[(0..x405-1)], x404[(0..x405-1)];
*/
void autoencode(int * x402, int * x403, int * x404, int x405) {
encode(x402,x403,x404,x405);
decode(x403,x404,x402,x405);
}
|
#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;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
}
/*@ logic integer decypher(int x15) = (((x15==0)) ? (26) : ((x15-1)));*/
/*@
requires ((0<=x15) &&
(x15<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == decypher(x15);
*/
int decypher(int x15) {
int x17 = x15 == 0;
int x19;
if (x17) {
x19 = 26;
} else {
int x18 = x15 - 1;
x19 = x18;
}
return x19;
}
/*@
requires ((((((x33>0) &&
\valid(x30+(0..x33-1))) &&
\valid(x31+(0..x33-1))) &&
\valid(x32+(0..x33-1))) &&
(\forall int x116; (((0<=x116) &&
(x116<x33)) ==> (\forall int x121; (((0<=x121) &&
(x121<x33)) ==> (\forall int x126; (((0<=x126) &&
(x126<x33)) ==> ((\separated(x30+x116,x31+x121) &&
\separated(x30+x116,x32+x126)) &&
\separated(x31+x121,x32+x126))))))))) &&
(\forall int x148; (((0<=x148) &&
(x148<x33)) ==> ((0<=x30[x148]) &&
(x30[x148]<=26)))));
ensures ((((\forall int x163; (((0<=x163) &&
(x163<x33)) ==> (x31[x163]==cypher(x30[x163])))) &&
(\forall int x175; (((0<=x175) &&
(x175<x33)) ==> ((0<=x31[x175]) &&
(x31[x175]<=26))))) &&
(\forall int x189; (((0<=x189) &&
(x189<x33)) ==> (\old(x30[x189])==x30[x189])))) &&
(\forall int x202; (((0<=x202) &&
(x202<x33)) ==> (\old(x32[x202])==x32[x202]))));
assigns x31[(0..x33-1)];
*/
void encode(int * x30, int * x31, int * x32, int x33) {
/*@
loop invariant 0<=x36<=x33;
loop invariant (\forall int x37; (((0<=x37) &&
(x37<x33)) ==> ((0<=x30[x37]) &&
(x30[x37]<=26))));
loop invariant (\forall int x51; (((0<=x51) &&
(x51<x33)) ==> (\at(x30[x51],Pre)==x30[x51])));
loop invariant (\forall int x64; (((0<=x64) &&
(x64<x33)) ==> (\at(x32[x64],Pre)==x32[x64])));
loop invariant (\forall int x77; (((0<=x77) &&
(x77<x36)) ==> (x31[x77]==cypher(x30[x77]))));
loop assigns x36, x31[(0..x33-1)];
loop variant x33-x36;
*/
for(int x36=0; x36 < x33; x36++) {
int x94 = x30[x36];
int x95 = cypher(x94);
x31[x36] = x95;
/*@assert (x31[x36]==cypher(x30[x36]));*/
}
}
/*@
requires ((((((x219>0) &&
\valid(x216+(0..x219-1))) &&
\valid(x217+(0..x219-1))) &&
\valid(x218+(0..x219-1))) &&
(\forall int x302; (((0<=x302) &&
(x302<x219)) ==> (\forall int x307; (((0<=x307) &&
(x307<x219)) ==> (\forall int x312; (((0<=x312) &&
(x312<x219)) ==> ((\separated(x216+x302,x217+x307) &&
\separated(x216+x302,x218+x312)) &&
\separated(x217+x307,x218+x312))))))))) &&
(\forall int x334; (((0<=x334) &&
(x334<x219)) ==> ((0<=x216[x334]) &&
(x216[x334]<=26)))));
ensures ((((\forall int x349; (((0<=x349) &&
(x349<x219)) ==> (x217[x349]==decypher(x216[x349])))) &&
(\forall int x361; (((0<=x361) &&
(x361<x219)) ==> ((0<=x217[x361]) &&
(x217[x361]<=26))))) &&
(\forall int x375; (((0<=x375) &&
(x375<x219)) ==> (\old(x216[x375])==x216[x375])))) &&
(\forall int x388; (((0<=x388) &&
(x388<x219)) ==> (\old(x218[x388])==x218[x388]))));
assigns x217[(0..x219-1)];
*/
void decode(int * x216, int * x217, int * x218, int x219) {
/*@
loop invariant 0<=x222<=x219;
loop invariant (\forall int x223; (((0<=x223) &&
(x223<x219)) ==> ((0<=x216[x223]) &&
(x216[x223]<=26))));
loop invariant (\forall int x237; (((0<=x237) &&
(x237<x219)) ==> (\at(x216[x237],Pre)==x216[x237])));
loop invariant (\forall int x250; (((0<=x250) &&
(x250<x219)) ==> (\at(x218[x250],Pre)==x218[x250])));
loop invariant (\forall int x263; (((0<=x263) &&
(x263<x222)) ==> (x217[x263]==decypher(x216[x263]))));
loop assigns x222, x217[(0..x219-1)];
loop variant x219-x222;
*/
for(int x222=0; x222 < x219; x222++) {
int x280 = x216[x222];
int x281 = decypher(x280);
x217[x222] = x281;
/*@assert (x217[x222]==decypher(x216[x222]));*/
}
}
/*@
requires ((((((x405>0) &&
\valid(x402+(0..x405-1))) &&
\valid(x403+(0..x405-1))) &&
\valid(x404+(0..x405-1))) &&
(\forall int x421; (((0<=x421) &&
(x421<x405)) ==> (\forall int x426; (((0<=x426) &&
(x426<x405)) ==> (\forall int x431; (((0<=x431) &&
(x431<x405)) ==> ((\separated(x402+x421,x403+x426) &&
\separated(x402+x421,x404+x431)) &&
\separated(x403+x426,x404+x431))))))))) &&
(\forall int x453; (((0<=x453) &&
(x453<x405)) ==> ((0<=x402[x453]) &&
(x402[x453]<=26)))));
ensures ((\forall int x468; (((0<=x468) &&
(x468<x405)) ==> (x404[x468]==x402[x468]))) &&
(\forall int x479; (((0<=x479) &&
(x479<x405)) ==> (\old(x402[x479])==x402[x479]))));
assigns x403[(0..x405-1)], x404[(0..x405-1)];
*/
void autoencode(int * x402, int * x403, int * x404, int x405) {
encode(x402,x403,x404,x405);
decode(x403,x404,x402,x405);
}
|
#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;
}
/*@ logic integer decypher(int x15) = (((x15==0)) ? (26) : ((x15-1)));*/
/*@
requires ((0<=x15) &&
(x15<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == decypher(x15);
*/
|
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;
} else {
int x3 = x0 + 1;
x4 = x3;
}
return x4;
}
/*@ logic integer decypher(int x15) = (((x15==0)) ? (26) : ((x15-1)));*/
/*@
requires ((0<=x15) &&
(x15<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == decypher(x15);
*/
|
|
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 \result == 0;
complete behaviors;
disjoint behaviors;
*/
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 1;
}
|
/*@
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;
disjoint behaviors;
*/
|
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 1;
}
| 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 1;
}
|
/*@
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;
disjoint behaviors;
*/
|
|
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 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);
@*/
|
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 SPEC_ULONG_MAX 18446744073709551615UL
/*@ requires factorial(i) <= SPEC_ULONG_MAX;
assigns \nothing;
ensures \result == factorial(i);
*/
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;
}
#ifdef OUT_OF_TASK
#include <stdio.h>
int main(void)
{
printf("res: %lu\n", factorial(10));
printf("res: %lu\n", factorial(20));
return 0;
}
#endif
|
#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;
}
*/
#define SPEC_ULONG_MAX 18446744073709551615UL
/*@ requires factorial(i) <= SPEC_ULONG_MAX;
assigns \nothing;
ensures \result == factorial(i);
*/
|
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;
}
*/
#define SPEC_ULONG_MAX 18446744073709551615UL
/*@ requires factorial(i) <= SPEC_ULONG_MAX;
assigns \nothing;
ensures \result == factorial(i);
*/
|
|
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 behaviors;
disjoint behaviors;
*/
int spec_sign(int x)
{
return (x > 0) - (x < 0);
}
/* 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 behaviors;
disjoint behaviors;
*/
/*int sign2(int x)
{
// assumes 32-bit int and 2s complement signed shifts work (implementation defined by C spec)
return (x>>31) | ((unsigned)-x >> 31);
}*/
#ifdef OUT_OF_TASK
#include <stdio.h>
int main(void)
{
printf("res: %d\n", spec_sign(-10));
return 0;
}
#endif
|
#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;
complete behaviors;
disjoint behaviors;
*/
|
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;
complete behaviors;
disjoint behaviors;
*/
|
|
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; 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;
@ (
@ i <= k1 < maxidx
@ && k1 + best < maxidx
@ && (0 < k1 < maxidx ==> \at(x[k1],L) != \at(x[k1-1],L)
@ )
@ && all_equal_in_range{L}(x, k1, best))
@ ==> \at(x[k1],L) != \at(x[k1+best],L);
@*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0..N-1));
@ ensures \exists integer k1; 0 <= k1 < N && all_equal_in_range(x, k1, \result);
@ ensures all_smaller_than_best(x, 0, N, \result);
*/
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 ==> x[i] != x[i-1];
@ loop invariant i > 0 ==> all_smaller_than_best(x, 0, i, best);
@ loop assigns i, best;
@ loop variant N - i;
*/
while (i < N) {
int j = i+1;
/*@ loop invariant i < j <= N;
@ loop invariant all_equal_in_range(x, i, j-i);
@ loop assigns j;
@ loop variant N - j;
*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
|
/*@ 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;
@ (
@ i <= k1 < maxidx
@ && k1 + best < maxidx
@ && (0 < k1 < maxidx ==> \at(x[k1],L) != \at(x[k1-1],L)
@ )
@ && all_equal_in_range{L}(x, k1, best))
@ ==> \at(x[k1],L) != \at(x[k1+best],L);
@*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0..N-1));
@ ensures \exists integer k1; 0 <= k1 < N && all_equal_in_range(x, k1, \result);
@ ensures all_smaller_than_best(x, 0, N, \result);
*/
|
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 ==> x[i] != x[i-1];
@ loop invariant i > 0 ==> all_smaller_than_best(x, 0, i, best);
@ loop assigns i, best;
@ loop variant N - i;
*/
while (i < N) {
int j = i+1;
/*@ loop invariant i < j <= N;
@ loop invariant all_equal_in_range(x, i, j-i);
@ loop assigns j;
@ loop variant N - j;
*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
| 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 ==> x[i] != x[i-1];
@ loop invariant i > 0 ==> all_smaller_than_best(x, 0, i, best);
@ loop assigns i, best;
@ loop variant N - i;
*/
while (i < N) {
int j = i+1;
/*@ loop invariant i < j <= N;
@ loop invariant all_equal_in_range(x, i, j-i);
@ loop assigns j;
@ loop variant N - j;
*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
|
/*@ 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;
@ (
@ i <= k1 < maxidx
@ && k1 + best < maxidx
@ && (0 < k1 < maxidx ==> \at(x[k1],L) != \at(x[k1-1],L)
@ )
@ && all_equal_in_range{L}(x, k1, best))
@ ==> \at(x[k1],L) != \at(x[k1+best],L);
@*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0..N-1));
@ ensures \exists integer k1; 0 <= k1 < N && all_equal_in_range(x, k1, \result);
@ ensures all_smaller_than_best(x, 0, N, \result);
*/
|
|
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;
}
/*@
requires \valid(x20);
assigns \nothing;
ensures (\result==x20[0]);
*/
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;
}
| 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;
}
/*@
requires \valid(x20);
assigns \nothing;
ensures (\result==x20[0]);
*/
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;
}
/*@
requires \valid(x20);
assigns \nothing;
ensures (\result==x20[0]);
*/
|
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;
}
/*@
requires \valid(x20);
assigns \nothing;
ensures (\result==x20[0]);
*/
|
|
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
o[1] = 0;
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
|
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
| 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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
|
|
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
o[1] = 0;
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
|
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
o[1] = 0;
}
| 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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
|
|
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
o[1] = 0;
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
o[1] = 0;
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
|
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), v+(0..n-1), o+(0..n-1));
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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;
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
}
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
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];
loop variant n-c;
*/
for (int c = 0; c < n; c++) {
o[r] = o[r] || (m[n*r+c] && v[c]);
}
o[1] = 0;
}
/*@
requires n>0;
requires n==2;
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), v+(0..n-1), o+(0..n-1));
requires m[0]==1;
requires m[1]==1;
requires m[2]==0;
requires m[3]==0;
assigns o[0..n-1];
ensures \forall int i; 0 <= i < n ==>
o[i] == row_col_bool(n, i, n, m, v);
*/
|
|
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])
{
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];
*/
|
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;
}
/*@
requires \valid(x15);
assigns \nothing;
ensures (\result==x15[0]);
*/
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;
}
/*@
requires \valid(x15);
assigns \nothing;
ensures (\result==x15[0]);
*/
|
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;
}
/*@
requires \valid(x15);
assigns \nothing;
ensures (\result==x15[0]);
*/
|
|
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: \separated(a,b,c);
ensures a_value: *a == \at(*b, Pre);
ensures b_value: *b == \at(*c, Pre);
ensures c_value: *c == \at(*a, Pre);
*/
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: \separated(a,b,c);
ensures a_value: *a == \at(*b, Pre);
ensures b_value: *b == \at(*c, Pre);
ensures c_value: *c == \at(*a, Pre);
*/
|
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: \separated(a,b,c);
ensures a_value: *a == \at(*b, Pre);
ensures b_value: *b == \at(*c, Pre);
ensures c_value: *c == \at(*a, Pre);
*/
|
|
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 elements equal.
/*@ 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 noBetterAnswerExists(integer N, int *x, int answer) =
@ (N == answer) ||
@ ((1 <= answer < N) && (\forall integer i; 0 <= i <= N-1-answer ==>
@ (\exists integer j; i < j <= i+answer && x[j] != x[i])));
@*/
/*@
@ predicate isBest(integer N, int *x, int answer) =
@ isValidAnswer(N, x, answer) &&
@ noBetterAnswerExists(N, x, answer);
@*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0 .. N-1));
@ assigns \nothing;
@ ensures isBest(N, x, \result);
@*/
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-i;
@*/
while (i < N) {
int j = i+1;
/*@ loop invariant i+1 <= j <= N;
@ loop invariant \forall integer k; i+1 <= k < j ==> x[i] == x[k];
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
|
/*@ 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 noBetterAnswerExists(integer N, int *x, int answer) =
@ (N == answer) ||
@ ((1 <= answer < N) && (\forall integer i; 0 <= i <= N-1-answer ==>
@ (\exists integer j; i < j <= i+answer && x[j] != x[i])));
@*/
/*@
@ predicate isBest(integer N, int *x, int answer) =
@ isValidAnswer(N, x, answer) &&
@ noBetterAnswerExists(N, x, answer);
@*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0 .. N-1));
@ assigns \nothing;
@ ensures isBest(N, x, \result);
@*/
|
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-i;
@*/
while (i < N) {
int j = i+1;
/*@ loop invariant i+1 <= j <= N;
@ loop invariant \forall integer k; i+1 <= k < j ==> x[i] == x[k];
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
| 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-i;
@*/
while (i < N) {
int j = i+1;
/*@ loop invariant i+1 <= j <= N;
@ loop invariant \forall integer k; i+1 <= k < j ==> x[i] == x[k];
@ loop assigns j;
@ loop variant N-j;
@*/
while (j < N && x[j] == x[i]) ++j;
if (j-i > best) best = j-i;
i = j;
}
return best;
}
|
/*@ 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 noBetterAnswerExists(integer N, int *x, int answer) =
@ (N == answer) ||
@ ((1 <= answer < N) && (\forall integer i; 0 <= i <= N-1-answer ==>
@ (\exists integer j; i < j <= i+answer && x[j] != x[i])));
@*/
/*@
@ predicate isBest(integer N, int *x, int answer) =
@ isValidAnswer(N, x, answer) &&
@ noBetterAnswerExists(N, x, answer);
@*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0 .. N-1));
@ assigns \nothing;
@ ensures isBest(N, x, \result);
@*/
|
|
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-1)
@ : how_many(x,counter+1,size,cnt)
@ : cnt == 0;
@*/
/*@ requires 0< N <= 1000000 ;
@ requires \valid(x+(0..N-1));
@ requires \forall integer i;
0 <= i <= N-1 ==> 0< x[i] <= 1000000;
@ ensures how_many(x,0,N,\result);
@*/
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,i+1,N,count);
@ loop assigns i,count,tallest;
@ loop variant i;
@*/
for (int i = N-2; i >= 0; i--)
if (tallest < x[i]) {
tallest = x[i];
count++;
}
return count;
}
|
/*@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)
@ : how_many(x,counter+1,size,cnt)
@ : cnt == 0;
@*/
/*@ requires 0< N <= 1000000 ;
@ requires \valid(x+(0..N-1));
@ requires \forall integer i;
0 <= i <= N-1 ==> 0< x[i] <= 1000000;
@ ensures how_many(x,0,N,\result);
@*/
|
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,i+1,N,count);
@ loop assigns i,count,tallest;
@ loop variant i;
@*/
for (int i = N-2; i >= 0; i--)
if (tallest < x[i]) {
tallest = x[i];
count++;
}
return count;
}
| 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,i+1,N,count);
@ loop assigns i,count,tallest;
@ loop variant i;
@*/
for (int i = N-2; i >= 0; i--)
if (tallest < x[i]) {
tallest = x[i];
count++;
}
return count;
}
|
/*@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)
@ : how_many(x,counter+1,size,cnt)
@ : cnt == 0;
@*/
/*@ requires 0< N <= 1000000 ;
@ requires \valid(x+(0..N-1));
@ requires \forall integer i;
0 <= i <= N-1 ==> 0< x[i] <= 1000000;
@ ensures how_many(x,0,N,\result);
@*/
|
|
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]);
@
@ assigns
@ t[i], t[j];
@
@*/
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]);
@
@ assigns
@ t[i], t[j];
@
@*/
|
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]);
@
@ assigns
@ t[i], t[j];
@
@*/
|
|
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[i] <= arr[j];
predicate contains(int* arr, integer n, integer elem) =
\exists integer off; 0 <= off < n && arr[off] == elem;
*/
/*@
requires valid_range_r(arr, len);
requires sorted(arr, len);
assigns \nothing;
behavior in:
assumes contains(arr, len, value);
ensures arr[\result] == value;
ensures 0 <= \result <= len-1;
behavior notin:
assumes !contains(arr, len, value);
ensures \result == -1;
disjoint behaviors;
complete behaviors;
*/
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 low, up;
loop variant up - low;
*/
while(low <= up){
int mid = low + (up - low)/2 ;
if (arr[mid] > value) up = mid-1 ;
else if(arr[mid] < value) low = mid+1 ;
else return mid ;
}
return -1 ;
}
int main(){
int i;
int a[] = {1,2,3,4,5,6,7,8,9,10};
i = bsearch(a, 10, 3);
//@ assert i == 2;
i = bsearch(a, 10, 0);
//@ assert i == -1;
//printf("i = %d\n", i);
return 0;
}
|
#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[i] <= arr[j];
predicate contains(int* arr, integer n, integer elem) =
\exists integer off; 0 <= off < n && arr[off] == elem;
*/
/*@
requires valid_range_r(arr, len);
requires sorted(arr, len);
assigns \nothing;
behavior in:
assumes contains(arr, len, value);
ensures arr[\result] == value;
ensures 0 <= \result <= len-1;
behavior notin:
assumes !contains(arr, len, value);
ensures \result == -1;
disjoint behaviors;
complete behaviors;
*/
|
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 low, up;
loop variant up - low;
*/
while(low <= up){
int mid = low + (up - low)/2 ;
if (arr[mid] > value) up = mid-1 ;
else if(arr[mid] < value) low = mid+1 ;
else return mid ;
}
return -1 ;
}
| 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 low, up;
loop variant up - low;
*/
while(low <= up){
int mid = low + (up - low)/2 ;
if (arr[mid] > value) up = mid-1 ;
else if(arr[mid] < value) low = mid+1 ;
else return mid ;
}
return -1 ;
}
|
#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[i] <= arr[j];
predicate contains(int* arr, integer n, integer elem) =
\exists integer off; 0 <= off < n && arr[off] == elem;
*/
/*@
requires valid_range_r(arr, len);
requires sorted(arr, len);
assigns \nothing;
behavior in:
assumes contains(arr, len, value);
ensures arr[\result] == value;
ensures 0 <= \result <= len-1;
behavior notin:
assumes !contains(arr, len, value);
ensures \result == -1;
disjoint behaviors;
complete behaviors;
*/
|
|
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() {
abs(10);
abs(-20);
return 0;
}
|
#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<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 = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant current<=min_idx<i;
loop invariant a[min_idx] == min;
loop invariant
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
}
}
}
|
/*@ 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 = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant current<=min_idx<i;
loop invariant a[min_idx] == min;
loop invariant
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
}
}
}
| 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 = 0; current < length - 1; current++) {
int min_idx = current;
int min = a[current];
/*@ loop invariant current+1<=i<=length;
loop assigns i,min,min_idx;
loop invariant current<=min_idx<i;
loop invariant a[min_idx] == min;
loop invariant
\forall integer j; current<=j<i ==> min <= a[j];
loop variant length -i;
*/
for (int i = current + 1; i < length; i++) {
if (a[i] < min) {
min = a[i];
min_idx = i;
}
}
if(min_idx != current) {
L: a[min_idx]=a[current];
a[current]=min;
}
}
}
|
/*@ 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.