file_content stringlengths 65 76k | goals int64 1 283 |
|---|---|
/*@ predicate sorted{L}(long *t, integer a, integer b) =
@ \forall integer i,j; a <= i <= j <= b ==> t[i] <= t[j];
@*/
/*@ requires n >= 0 && \valid_range(t,0,n-1);
@ ensures -1 <= \result < n;
@ behavior success:
@ ensures \result >= 0 ==> t[\result] == v;
@ behavior failure:
@ assumes sorted(t,0... | 13 |
//@ predicate is_pos(int x) = x > 0;
//@ predicate is_nat(int x) = x >= 0;
/*@ requires is_pos(x);
ensures is_nat(\result);
*/
int minus1(int x) {
return x-1;
}
| 4 |
/*@
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;
}
| 10 |
/* run.config
DONTRUN: linked with first which is the real test.
*/
/*@ behavior b:
requires \valid(second);
ensures \result == 0;*/
int bar(int *second);
void sub (char * c) {
bar(c);
}
| 10 |
// This program used an advanced ACSL clause: \max()
// Note: Some versions of 'wp' plugin may not support the \lambda clause.
// The program may not verify in every machine.
/*@
requires n > 0;
requires \valid_read(arr+(0..n-1));
ensures \result == \max(0, n-1, \lambda integer i; arr[i]);
assign... | 10 |
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
assigns *a, *b;
ensures a_value: *a == \at(*b,Pre);
ensures b_value: *b == \at(*a, Pre);
*/
void swap(int* a, int *b);
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
requires c_valid: \valid(c);
requires sep: \sepa... | 9 |
/*@
requires \valid(p);
ensures \result == *p;
*/
int foo(int* p) {
return *p;
}
| 4 |
/*
Software versions:
frama-c : 18.0 (Argon)
alt-ergo : 2.2.0
This script was run using this command:
frama-c -wp -wp-prover alt-ergo -wp-rte -wp-timeout 300 -wp-verbose 0 countSameConsecutive.c -then -report
*/
// This predicate is true if there is a subsequence of length "answer"
// with all its ele... | 31 |
/*@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-... | 23 |
/*@
@ 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]);
@
... | 10 |
/*@ensures\result == a &&\result>b
|| \result>a &&\result == b
|| \result == a &&\result == b;*/
int max(int a, int b)
{return a>b ? a : b;} | 3 |
#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[... | 37 |
#include <string.h>
/*@
requires strlen(input)>=0 && \valid(input+(0..strlen(input)));
assigns \nothing;
ensures \result==0 || \result==1;
*/
int dfa_aab(char* input) {
if (*input == '\0') return 0/*false*/;
int id = 0;
char c;
/*@
loop invariant strlen(input)>0 && \valid(input+(0..strlen(input)));
loop inv... | 39 |
/* @ requires \valid(t+(start..end)) && start <= i <= end && start <= j <= end
*/
void swap(int t[], int i, int j, int start, int end) {
int tmp = t[i];
t[i] = t[j];
t[j] = tmp;
}
/*@ requires 0 <= p <= r && \valid(A+(p..r)); @*/
int partition (int A[], int p, int r)
{
int x = A[r];
int j, i = ... | 39 |
#define HASHTBL_LEN 17
typedef struct {
int b;
int size;
} Buckets;
typedef struct {
Buckets data[HASHTBL_LEN];
int size;
} Hashtbl;
/*@ requires \valid(tbl);
@ requires \valid(tbl->data+(0 .. HASHTBL_LEN - 1));
@ requires 0 <= d < HASHTBL_LEN;
@
@ assigns tbl->data[d], tbl->size; // approximation... | 8 |
#include<stdio.h>
#include<limits.h>
/*@ requires x>=0;
ensures \result == x*x*x; */
int p2(int x){
int z=0,v=0,w=1,t=3,u=0;
/*@ loop invariant u<=x && t==6*u+3 && w==3*u+1 && v==3*u*u && z==u*u*u;
loop assigns z,v,t,w,u;*/
while ( u <= x ){
z=z+v+w;
v=v+t ;
t = t+6... | 8 |
// 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() {
... | 9 |
/*@
requires \valid(a) && \valid_read(b);
requires \separated(a, b);
assigns *a;
ensures *a == \old(*a) + *b;
ensures *b == \old(*b);
*/
int incr_a_by_b(int* a, int const* b){
*a += *b;
return *a;
} | 9 |
/*@
requires n>0;
requires\valid_read(arr + (0..n-1));
*/
void cummilativeSum(int arr[], int n)
{
int sum = 0, prev = 0, j, x;
/*@
loop invariant \exists integer i; 0 <= i < n ==> arr[j] == prev + arr[i];
loop invariant 0 <= j <= n;
loop assigns j, arr[0..j+1], prev;
loop variant n-j;
*/
for (j = 0; j ... | 9 |
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ requires \valid(a+(0..length-1));
requires length > 0;
assigns a[0..length-1];
ensures sorted(a,length);
*/
void sort (int* a, int length) {
int current;
/*@ loop invariant 0<=current<lengt... | 39 |
/*@
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;
} | 12 |
/*@ requires \true;
assigns \nothing;
ensures \result == b;
*/
int deadcode(int a, int b)
{
if (a > b) {
if (a < b) {
return a / b;
} else if (a == b) {
//@ assert 0 == 1;
}
}
return b;
}
| 8 |
#include<limits.h>
/*@ ensures \result >= a && \result >= b; */
int max ( int a, int b ) {
return INT_MAX ;
}
| 3 |
/*@
@ assigns \nothing;
@ ensures \result <= a;
@ ensures \result <= b;
@ ensures \result == a || \result == b;
*/
int min(int a, int b) {
return (a < b) ? a : b;
} | 7 |
#include <stddef.h>
/*@ predicate monotone_slice(int* a, size_t low, size_t up) =
(\forall integer i,j; low <= i < j < up ==> a[i] < a[j]) ||
(\forall integer i,j; low <= i <= j < up ==> a[i] >= a[j]);
*/
/*@
requires length < 100;
requires a_valid: \valid(a + (0 .. length - 1));
requires res_valid: \va... | 57 |
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures (*a) == \old(*b);
ensures (*b) == \old(*a);
*/
void foo(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
| 10 |
/*@requires a>0 && a<2147483647;
ensures\result>1;*/
int next(int a)
{return a + 1;} | 4 |
/*@
predicate swapped {L1, L2}(int* a, int* b) =
\at(*a, L1) == \at(*b, L2) &&
\at(*b, L1) == \at(*a, L2);
*/
/*@
requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
ensures swapped{Here, Old}(a,b);... | 11 |
#include <stdio.h>
/*@
requires \valid(a+(0..n-1));
requires n > 0;
ensures \forall integer i,j; 0<=i<=j<=n-1 ==> a[i]<=a[j];
*/
void bubbleSort(int *a, int n) {
int i, j, temp;
/*@
loop invariant \forall integer p,q; i<=p<=q<=n-1 ==> a[p]<=a[q];
loop invariant \forall integer p,q;... | 38 |
/*
* Frama-C version: Sulfur-20171101
* Alt-Ergo version: 1.30
*
* Run with:
* frama-c -wp -wp-prover alt-ergo -wp-rte -wp-timeout 10 -wp-verbose 0 find-double.c -then -report
*
*/
#include <stdbool.h>
#define MAXV 1000000
/*@ predicate doublesInside(integer N, int* a, integer res) =
@ \exists integer ii; ... | 34 |
/*@ 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; //Найдите ошибку
... | 20 |
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) ;
@*/
/*@ inductive Permuta{L1,L2}(int *a, integer l, integer h) {
@ case Permut_refl{L}:
@ \forall int *a, integer l, h; Permuta{L,L}(a, l, h) ;
@ case Permut_sym{L1... | 42 |
/*@ assigns \nothing;
ensures \result == (a+b)/2;
*/
int average(int a, int b)
{
int average = 0;
int greater;
int smaller;
if (a > b) {
greater = a;
smaller = b;
} else {
greater = b;
smaller = a;
}
if (a >= 0 && b >= 0) {
average = smaller + (greater - smaller) / 2;
} else if (a < 0... | 20 |
#define INT_MIN (-2147483648)
#define INT_MAX 2147483647
/*@ requires INT_MIN <= a + b <= INT_MAX;
assigns \nothing;
ensures \result == a + b;
*/
int sum(int a, int b)
{
return a + b;
}
| 6 |
#include <limits.h>
struct A
{
unsigned int size;
unsigned int pos;
};
typedef struct A A;
/*@
requires \valid(a);
requires length <= 64;
requires a->pos + length <= UINT_MAX;
requires a->pos + length <= a->size;
assigns a->pos;
ensures a->pos == \old(a->pos) + length;
*/
void f... | 25 |
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j)
#ifndef OUT_OF_TASK
;
#else
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
#endif
/*@ predicate reverse{L1,L2}(int* a, integer size... | 28 |
/*@ assigns \nothing;
ensures \result >= a;
ensures \result >= b;
ensures \result == a || \result == b;
*/
int max(int a, int b)
{
return a > b ? a : b;
}
| 7 |
/*@
requires n>0;
behavior one:
assumes n>0;
ensures \result == n;
behavior two:
assumes n<0;
ensures \result == (-1)*n;
complete behaviors;
disjoint behaviors;
*/
int ABS(int n)
{
if (n < 0)
{
n = (-1) * n;
}
return n;
} | 8 |
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length && ... | 43 |
// remplir un tableau avec une valeur donnée
/*@
requires \valid (t+(0..n-1));
requires n > 0;
assigns t[0..n-1];
ensures \forall integer i; 0 <= i < n ==> t[i] == val;
*/
void fill_array(int t[], int n, int val)
{
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> t[j] == val;
loop invariant ... | 43 |
#include <limits.h>
/*@
requires INT_MIN<x && INT_MIN<y;
ensures \result>=x && \result>=y;
ensures \result==x || \result==y;
*/
int max ( int x, int y ) {
if ( x >=y )
return x ;
return y ;
}
void foo()
{
int s = max(34,45);
int t = max(-43,34);
} | 8 |
/* Run with:
*
* frama-c -wp -wp-prover alt-ergo -wp-rte -wp-timeout 60 -wp-verbose 0 samenum.c -then -report
*
* Tested with Frama-C Phosphorus-20170501.
*/
#define MAXN 1000000
#define MAXV 2000000
/*@ predicate isPair{L}(integer N, int* x, integer i, integer j) =
@ 0 <= i < j < N && \at(x[i], L) == \at(x[j... | 47 |
/*@ requires \valid(&a[i]);
requires \valid(&a[j]);
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
void swap(int a[], int i, int j);
/*@ predicate reverse{L1,L2}(int* a, integer size, integer i, integer j) =
\forall integer k; i <= k < j ==>
\at(a[k], L... | 28 |
#include <limits.h>
/*@ requires x < INT_MAX;
ensures \result > x;
*/
int inc (int x) { return x+1; }
| 4 |
#include <limits.h>
#include <string.h>
/*@ predicate star_A(char * x93, integer x94, integer x95) = ((x94==x95) || (\exists integer x98; (((x94<x98) &&
(x98<=x95)) ==> ((('A'==x93[x94]) &&
(x98==(x94+1))) &&
star_A(x93,x98,x95)))));*/
/*@ predicate star_D(char * x114, integer x115, integer x116) = ((x115==x116)... | 84 |
/*@
axiomatic IntArray {
type int_array;
logic int access(int_array a, integer i);
logic int_array update(int_array a, integer i, int v);
axiom access_update_eq :
\forall int_array a, integer i, int v; access(update(a, i, v), i) == v;
axiom access_update_neq :
... | 84 |
/*@ axiomatic abs {
@ logic int abs(int x);
@ axiom pos: \forall int x; x >= 0 ==> abs(x) == x;
@ axiom neg: \forall int x; x <= 0 ==> abs(x) == -x;
@ }
*/
/*@ ensures \result == abs(x);
@ assigns \nothing;
*/
int abs(int x);
/*@ ensures (\result == x || \result == y)
@ && \resu... | 10 |
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate inv_vec_vec_Int(int * * x16, int * x17, int x18) = (((x18==0) || ((x18>0) &&
(\valid(x16+(0..x18-1)) &&
\valid(x17+(0..x18-1))))) &&
(\forall int x28; (0<=x28<x18) ==> ((x17[x28]==0) || ... | 32 |
/*@
requires \valid(q) && \valid(r);
requires 0<y<1000000000 && 0<=x<1000000000;
assigns *q, *r ;
*/
void div_rem(unsigned x,unsigned y,unsigned* q,unsigned* r){
*q = x / y ;
//@ assert *q==x/y;
*r = x % y ;
//@ assert *r==x%y;
}
| 10 |
/* run.config_qualif
DONTRUN:
*/
#define NULL ((void *) 0L)
/*@
ensures e1: \result == \null;
ensures e2: \result == 0;
ensures e3: \result == (int *) \null;
ensures e4: \result == (int *) 0;
ensures e5: \result == (int *)((void *)0);
*/
int * f (void) {
return NULL;
}
| 7 |
#include <limits.h>
/*@
requires x > INT_MIN;
ensures 0 <= x ==> \result == x;
ensures 0 > x ==> \result == -x;
*/
int abs_int(int x)
{
return (x >= 0) ? x : -x;
}
| 5 |
#include <stdio.h>
#include <stdlib.h>
/*@
requires n >= 0;
requires \valid_read(a+(0..n-1));
ensures \forall integer k; 0 <= k < n ==> a[k] == a[k]+c;
*/
void arrayinc(int *a,int n,int c){
/*@
loop invariant 0 <= p <= n;
loop invariant \forall integer k; 0 <= k < p ==> a[k] == a[k]+c;
... | 5 |
#define SPEC_INT_MIN -2147483648
#define SPEC_INT_MAX 2147483647
/*@ assigns \nothing;
ensures \result >= 0;
behavior positive:
assumes a > 0;
ensures \result == a;
behavior zero:
assumes a == 0;
ensures \result == 0;
ensures \result == a;
behavior negative:
as... | 12 |
#include<stdbool.h>
/*@
axiomatic error_bounds {
logic real ulp(real X);
logic real errAdd( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X + Y) + E_X + E_Y)/2;
logic real errSub( real X, real Y, real E_X, real E_Y)
= E_X + E_Y + ulp(\abs(X - Y) + E_X + E_Y)/2;
}
*/
struct m... | 36 |
/*@ ensures \result <= sizeof(int); */
int f() { return sizeof(char); }
| 3 |
/*
* memswap()
*
* Swaps the contents of two nonoverlapping memory areas.
* This really could be done faster...
*/
#include <string.h>
/*@
requires n >= 0;
requires \valid(((char*)m1)+(0..n-1));
requires \valid(((char*)m2)+(0..n-1));
requires \separated(((char*)m1)+(0..n-1), ((char*)m2)+(0..n-1));
assigns (... | 33 |
/* run.config
COMMENT: bts #1478 about wrong detection of initializers in pre-analysis
*/
int global_i;
int* global_i_ptr = &global_i;
int global_i = 0;
/*@ requires global_i == 0;
requires \valid(global_i_ptr);
requires global_i_ptr == &global_i; */
void loop(void) { }
int main(void) {
loop();
return... | 7 |
/*@ requires \valid(p+ (0..1));
ensures p[0] == \old(p[1]);
ensures p[1] == \old(p[0]);
assigns p[0], p[1];
*/
void array_swap(int* p) {
int tmp = p[0];
p[0] = p[1];
p[1] = tmp;
}
| 10 |
// Returns the index of an element in a given array
/*@ requires n>0;
requires \valid(t+(0..n-1));
behavior success:
assumes \exists integer i; 0<=i<n && t[i] == e;
ensures 0 <= \result < n && t[\result]==e;
behavior failure:
assumes \forall integer i; 0<=i<n ==> t[i]!=e;
ensures \result==... | 10 |
#define SPEC_INT_MIN -2147483648
#define SPEC_INT_MAX 2147483647
/*@ //requires SPEC_INT_MIN < a <= SPEC_INT_MAX;
requires SPEC_INT_MIN < a;
assigns \nothing;
ensures \result >= 0;
behavior positive:
assumes a > 0;
ensures \result == a;
behavior zero:
assumes a == 0;
ens... | 12 |
/* Run with:
*
* frama-c -wp -wp-rte -wp-prover alt-ergo -wp-timeout 10 -wp-verbose 0 \
* kylikeio.c -then -report
*
* Tested with Frama-C Aluminium-20160502.
*/
/*@ predicate canSee{L}(integer N, int *x, integer i) =
@ \forall integer j; i < j < N ==> \at(x[i], L) > \at(x[j], L);
@*/
/*@ predicate cou... | 23 |
#include <limits.h>
/*@ requires x > INT_MIN;
assigns \nothing;
behavior positive:
assumes x >= 0;
ensures \result == x;
behavior negative:
assumes x < 0;
ensures \result == -x;
complete behaviors;
disjoint behaviors;
*/
int abs(int x) {
if (x < 0)
return -x;
else if(x >= 0... | 11 |
/*
* @UBERXMHF_LICENSE_HEADER_START@
*
* uber eXtensible Micro-Hypervisor Framework (Raspberry Pi)
*
* Copyright 2018 Carnegie Mellon University. All Rights Reserved.
*
* NO WARRANTY. THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING
* INSTITUTE MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON
... | 21 |
#include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x... | 26 |
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@
requires inv_vec_Int(x16,x17);
assigns \nothing;
ensures inv_vec_Int(x16,x17);
*/
int count_pos(int * x16, int x17) {
int x19 = 0;
/*@
loop invariant 0<=x21<=x17;
loop invariant ((0<=x19) &... | 17 |
/*@
requires \valid(p);
assigns \nothing;
ensures \result == 42;
*/
int foo(int* p) {
return 42;
}
| 4 |
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N>=1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
void insertionSort(int A[], int N) {
int i, j, key;
/*@ loop assigns i, key, j, A[0.... | 4 |
struct counter
{
int seconds, minutes, hours;
};
struct counter c;
/*@
requires 0<=c.seconds<60 && 0<=c.minutes<60 && 0<=c.hours<24;
behavior one:
assumes c.seconds < 59 && c.minutes < 59;
ensures c.seconds == \old(c.seconds)+1;
behavior two:
assumes c.seconds == 59 && c.minutes ... | 19 |
/*@
requires n >= 0;
requires \valid(t+(0..(n-1)));
behavior empty :
assumes n==0;
ensures \result==0;
behavior not_empty:
assumes n>0;
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];
complete behaviors empty... | 24 |
#include <string.h>
/*@
logic integer cypher(integer s) = s==26 ? 0 : s+1;
logic integer decypher(integer s) = s==0 ? 26 : s-1;
*/
/*@
requires 0 <= s <= 26;
ensures 0 <= \result <= 26;
ensures \result == cypher(s);
assigns \nothing;
*/
int cypher(int s) {
return s==26 ? 0 : s+1;
}
/*@
requires 0 <= s <... | 95 |
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
@ \at(a[i],L1) == \at(a[j],L2) &&
@ \at(a[j],L1) == \at(a[i],L2) &&
@ \forall integer k; k != i && k != j
@ ==> \at(a[k],L1) == \at(a[k],L2);
@*/
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k... | 28 |
/*@
ensures \result == *p;
*/
int foo(int* p) {
return *p;
}
| 28 |
/*
* strnlen()
*/
#include <string.h>
/*@
requires maxlen >= 0;
requires \valid(s+(0..maxlen-1));
assigns \nothing;
behavior bigger:
assumes \forall integer i; 0 <= i < maxlen ==> s[i] != 0;
ensures \result == maxlen;
behavior smaller:
assumes \exists integer i; 0 <= i < maxlen && s[i] == 0... | 21 |
/*@ requires a_valid: \valid(a);
requires b_valid: \valid(b);
ensures a_value: *a == \at(*b, Pre);
ensures b_value: *b == \at(*a, Pre);
*/
void swap(int* a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
| 8 |
/*@ requires y > 10;
@ ensures \result >= 0;
*/
int g(int y){
int x=0;
if(y>0){
x=100;
x=x+50;
x=x-100;
}else{
x = x - 150;
x=x-100;
x=x+100;
}
return x;
}
int main(){
int a = g(11);
return a;
} | 11 |
/* run.config
COMMENT: function call
STDOPT: +"-val-builtin malloc:Frama_C_alloc_size,free:Frama_C_free -no-val-malloc-returns-null"
*/
#include <stdlib.h>
//extern void *malloc(unsigned int size);
/*@ ensures \valid(\result); */
int *f(int *x, int *y) {
*y = 1;
return x;
}
int main() {
int x = 0, *p, *... | 11 |
typedef struct _list {
int i;
} *list;
/*@ requires \valid(p); */
void f(list p) {}
/*@ requires \valid(p); */
void g(struct _list* p) {}
| 4 |
#ifndef SPEC_SORTING_H
#define SPEC_SORTING_H
/*@ predicate Swap{L1,L2}(int *a, integer i, integer j) =
\at(a[i],L1) == \at(a[j],L2) &&
\at(a[j],L1) == \at(a[i],L2) &&
\forall integer k; k != i && k != j
==> \at(a[k],L1) == \at(a[k],L2);
*/
/*@ inductive Permut{L1,L2}(int *a, integer l... | 9 |
/*@
requires \valid(a) && \valid(b);
ensures A: *a==\old(*b);
ensures B: *b==\old(*a);
assigns *a, *b;
*/
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
} | 10 |
#define N 12
int array[ N ];
/*@ ensures 0 <= \result < N; */
int get_index(void);
void main()
{
int i = get_index();
array[ i ] = 3;
}
#ifndef FRAMA_C
int get_index(void)
{
int i = 7;
return i;
}
#endif
| 7 |
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
*/
int max_ptr ( int *p, int *q ) {
*p = 0;
*q = 0;
return 0 ;
}
| 6 |
struct account {
int lower_limit;
int balance;
int upper_limit;
};
/*@
predicate valid_account{L}(struct account* account) =
\valid(account) &&
account->lower_limit <= account->balance <= account->upper_limit;
*/
/*@
requires valid_account(account) &&
0<= amount <= account->upper_limit - account -> balance;
as... | 37 |
/*@ requires \valid(a + (0..n-1));
requires \forall integer i, integer j; 0 <= i < j < n ==> a[i] <= a[j];
assigns \nothing;
ensures 0 <= \result <= n;
ensures \forall integer k; 0 <= k < \result ==> a[k] < val;
ensures \forall integer k; \result <= k < n ==> val <= a[k];
*/
unsigned lower_bound(co... | 33 |
/*@ 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 not_equal_in_range{L}(int *x, integer minidx, integer maxidx) =
@ \exists integer k; minidx <= k < maxidx && \at(x[m... | 33 |
/*@ predicate is_divisor(integer m, integer n) =
(m != 0) ==> n % m == 0;
*/
/*@ predicate is_gcd(integer z, integer x1, integer x2) =
is_divisor(z, x1)
&& is_divisor(z, x2)
&& \forall integer i; is_divisor(i, x1) && is_divisor(i, x2) ==> (i <= z);
*/
/*@ axiomatic gcd {
logic integer gcd(integer... | 33 |
#include <limits.h>
#include <string.h>
/*@ predicate match_w(char * x0) = ((x0[0]=='a') &&
((x0[1]=='a') &&
((x0[2]=='b') &&
((x0[3]=='a') &&
(x0[4]=='a')))));*/
/*@
assigns \nothing;
ensures \result <==> match_w(x0);
*/
int match_w(char * x0) {
char x2 = x0[0];
int x3 = x2 == 'a';
int x16;
if (x3) {
cha... | 33 |
/*@ predicate sorted{L}(int* a, integer length) =
\forall integer i,j; 0<=i<=j<length ==> a[i]<=a[j];
*/
/*@ predicate swap{L1,L2}(int* a,integer i,integer j,integer length)=
0<=i<j<length
&& \at(a[i],L1) == \at(a[j],L2)
&& \at(a[i],L2) == \at(a[j],L1)
&& \forall integer k; 0<=k<length &... | 43 |
#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_... | 54 |
/*@ requires n > 0;
requires \forall int i; 0<= i <= n-1 ==> \valid(p + i);
assigns \nothing;
ensures \forall int i; 0 <= i <= n-1 ==> \result >= p[i];
ensures \exists int i; 0 <= i <= n-1 && \result == p[i];
*/
int max_seq(int* p, int n);
int max_seq(int* p, int n) {
int res = *p;
int i;
/*@ gho... | 54 |
/*@
@ predicate canSee{L} (integer N, int *x, integer i) =
@ \forall integer j; i < j < N ==> \at(x[i], L) > \at(x[j], L);
@*/
/*@
@ predicate countTall{L} (integer N, int *x, integer i, integer c) =
@ i >= N ? c == 0 :
@ canSee{L}(N, x, i) ? countTall{L}(N, x, i + 1, c - 1)
@ : countTall{L}(... | 24 |
//binary search
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
requires val>0;
behavior notfound:
assumes \forall integer nf;
0<=nf<n ==> arr[nf]!= val;
ensures \result == 0;
behavior found:
assumes \exists integer f;
0<=f<n && arr[f]==val;
ensures \result == 1;
... | 15 |
/*@
@ requires n > 0;
@ requires \valid(a+(0..n - 1));
@
@ assigns \nothing;
@ behavior okay_:
@ assumes \exists int i; 0 <= i < n && a[i] == val;
@ ensures 0 <= \result < n;
@ ensures \forall int i; 0 <= i < \result ==> a[i] != val;
@ ensures a[\result] == val;
@ behavior not_okay_:
@ ... | 15 |
/*@
requires \valid(a + (0..n-1));
assigns a[0..n]; // should be a[0..n-1]
*/
void foo(int* a, unsigned int n)
{
/*@
loop invariant 0 <= i <= n;
loop assigns i, a[0..n]; // should be a[0..n-1];
loop variant n-i;
*/
for(unsigned int i = 0; i < n; ++i)
a[i] = 0;
}
| 11 |
/*@
requires n > 0;
requires \forall integer i,j; 0 <= i <= j <= n-1 ==> a[i] <= a[j];
requires \valid_read(a + (0..n-1));
ensures (\forall integer k; 0 <= k <= n-1 ==> a[k] != x) || x == a[\result];
assigns \nothing;
*/
int binarysearch(int* a, int x, int n) {
int low = -1;
int high = n;
int p;
/*... | 11 |
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher_a_end(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((st... | 15 |
/* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/goto.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<=5000;
/*@ requires rr<5000;
@ behavior j :
@ e... | 11 |
/*@
requires 0<=first<=180 && 0<=second<=180;
ensures \result + first + second == 180;
*/
int last_angle(int first,int second){
return 180 - first - second;
}
| 6 |
#include <limits.h>
/*@
requires (x0<INT_MAX);
assigns \nothing;
ensures (\result>x0);
*/
int inc(int x0) {
int x2 = x0 + 1;
return x2;
}
| 5 |
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher_a(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop variant ((strlen... | 14 |
#include <stdio.h>
/*@ requires a >= 0 && b > 0;
@ requires \valid(r);
@ assigns *r;
@ ensures a == b * \result + *r;
*/
int idiv(int a, int b, int *r) {
int q = 0;
int p = a;
/*@ assert a == b * q + p;*/
/*@ loop invariant a == b * q + p;
@ loop assigns q, p;
@ loop variant p;
*/
while (p >= b) {
... | 15 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.