file_content stringlengths 65 76k | goals int64 1 283 |
|---|---|
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
int A, B, C;
#pragma GCC diagnostic pop
/*@ requires A==100 && B==100;
assigns A,B;
ensures C==0 ==> A==100 && B==100;
ensures C!=0 ==> A==C && B==C;*/
void bidon(){
if ( C != 0 ){
A = C;
B = C;
}
}
/*@ requires \va... | 24 |
/*@ requires size>0;
requires \valid(t+(0..size-1));
requires \valid(s+(0..size-1));
requires \valid(r+(0..size-1));
requires \separated(t+(0..size-1), s+(0..size-1));
requires \separated(t+(0..size-1), r+(0..size-1));
requires \separated(s+(0..size-1), r+(0..size-1));
requires \forall integ... | 22 |
#include <limits.h>
#include <string.h>
/*@ predicate submatcher_0(char * x22) = ((x22[0]=='\0') || (((x22[0]=='\0')) ? (0) : (((x22[0]=='a') &&
submatcher_0((x22+1))))));*/
/*@
requires ((strlen(x22)>=0) &&
\valid_read(x22+(0..strlen(x22))));
decreases strlen(x22);
assigns \nothing;
ensures \result <==> submatcher_0(... | 31 |
#ifndef BASETYPE_H
#define BASETYPE_H
#include <stddef.h>
// this is just renaming for types
typedef unsigned long size_t; // forward declaration
/////////////////////////////////////////////////
// integers
// format [s|u]int[<size in bits>]
typedef signed char sint8_t;
typedef unsigned char uint8_t;
typedef shor... | 120 |
/* run.config_qualif
OPT: -pp-annot -wp -wp-par 1 -wp-prop="-qed_ko"
OPT: -pp-annot -wp -wp-par 1 -wp-prop qed_ko -wp-timeout 2
*/
#define OK 33
#define KO 55
int k ;
int inp[5] ;
int out[5] ;
/*@ requires 0 <= k < 5 ;
@ ensures \result == out[\old(k)] ;
@ ensures inp[\old(k)] == u;
@ ensures k == \old(... | 27 |
#include<limits.h>
/*@ requires 0 < length <= INT_MAX && \valid_read(arr+(0..length-1));
requires \forall integer i,j; 0 <= i < j < length ==> arr[i] <= arr[j];
assigns \nothing;
ensures -1 <= \result < length &&
(\result == -1 ==> (\forall integer i; 0 <= i < length ==> arr[i] != query)) &&
(\... | 25 |
/* a.h */
typedef struct s_t { int n; } t;
/*@ type invariant inv_t(t x) = x.n > 0; */
/* @ predicate p(int x) reads x; */
int i = 42;
/*@ predicate p{Here}(int x) = x >= i; */
/*@ axiomatic Bar {
logic integer li;
axiom init: li == 42;
} */
/*@ ensures i == 0;
assigns i; */
void test() { i = 0; }
/*@ axi... | 4 |
/* This file is part of CPAchecker,
// a tool for configurable software verification:
// https://cpachecker.sosy-lab.org
//
// SPDX-FileCopyrightText: 2007-2020 Dirk Beyer <https://www.sosy-lab.org>
//
// SPDX-License-Identifier: Apache-2.0
*/
/*@
requires x > -2147483648;
assigns \nothing;
ensures \result... | 10 |
/*@ requires n>0 && \valid(a+(0..n-1));
@ assigns \nothing;
@ behavior success:
@ assumes \forall integer i; 0<=i<n-1 ==> a[i]<=a[i+1];
@ ensures \result==1;
@ behavior failure:
@ assumes \exists integer i; 0<=i<n-1 && a[i]>a[i+1];
@ ensures \result==0;
@ complete behaviors success, failure;
@... | 21 |
/*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/
int loop(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0 ;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
return y;
}
/*@ assigns \nothing; */
int main()
{
int result = loop(6);
return... | 18 |
/*@ requires k>0;
@ ensures \result<1;
@*/
int f(int k, int g);
int f(int k, int g){
return 0;
}
void main(){
f(1,0);
} | 6 |
/*@ assigns \nothing;
*/
void inconditional_exit(int state) {
exit (state);
} | 4 |
/*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer j; 0 <= j < n ==> \result >= a[j];
assigns \nothing;
*/
int Max_element(int a[], int n)
{
int max = a[0];
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> max >= a[j];
loop invariant 1 <= i <= n;
loo... | 15 |
/*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer k; (0<=k<n) && (k%2==0) ==> (a[k] == 0);
assigns a[0..n-1];
*/
void func(int *a, int n) {
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer k; (0 <= k < i) && (k%2==0) ==> a[k] == 0;
loop invariant \vali... | 17 |
/*@
@ requires -10000 <= x <= 10000;
@ requires 0 <= y <= 10000;
@
@ ensures \result == x * y;
@ assigns \nothing;
*/
int mult(int x, int y) {
int res = 0;
/*@
@ loop invariant 0 <= i <= y;
@ loop invariant res == i * x;
@ loop assigns res, i;
@ loop variant y - i;
... | 14 |
/* run.config
EXECNOW: make -s @PTEST_DIR@/@PTEST_NAME@.cmxs
OPT: -load-module @PTEST_DIR@/@PTEST_NAME@.cmxs
*/
/*@ requires x <= 0;
ensures \result == x;
assigns \nothing;
*/
int f(int x) { //@ assert x<=0;
int y = x;
/*@ assert y <= 0 &&
x == y; */
return y;
}
struct inner {
int a, b;
... | 9 |
/*@ ensures (\result>0); */
int main() {
int x0 = 0;
/*@assert (x0<100);*/
int x4 = x0 + 1;
/*@assert (x4>x0);*/
return x4;
} | 6 |
/*@ axiomatic Count {
logic integer count{L}(int *a, integer m, integer n, integer p);
axiom count_base:
\forall int *a, integer m, integer n, integer p; m >= n ==> count(a, m, n, p) == 0;
axiom count_split:
\forall int *a, integer m, integer n, integer k, integer p; m <= n <= k ==> count(a, m... | 34 |
/*@ axiomatic A {
}
*/
/*@ assigns \nothing; */
int main() { return 0; }
/*@ assigns \nothing; */
void f() {
int x = 0;
}
/*@ assigns \nothing; */
void g(char*s); | 6 |
#include <limits.h>
/* run.config
EXECNOW: make -s tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_acces_params.ya -aorai-test 1 -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 &&... | 20 |
#include <limits.h>
int e;
/*@ requires
INT_MIN / 4 <= x <= INT_MAX / 4;
ensures
\result == 4 * x && e == 4 * x;
assigns e;
*/
int f(int x) {
int y = 4 * x;
e = y;
return y;
}
int main() {
f(42);
return 0;
} | 9 |
/*@
requires -1000 <= n <= 1000; // Add a reasonable input range
decreases n > 100 ? 1 : 102 - n;
assigns \nothing;
ensures ((n <= 100) ==> (\result == 91));
ensures ((n > 100) ==> (\result == (n-10)));
*/
int foo(int n) {
if (n > 100) {
return n - 10;
} else {
return foo(foo(n + 11));
}
} | 17 |
/*@ 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 |
/* run.config
OPT: -rpp
*/
/*
* Based on http://stackoverflow.com/questions/22768302/why-i-get-comparison-method-violates-its-general-contract
*
*/
struct CatBPos{
int getHdopBPosGetTime;
int getBPosGetTime;
int getBPosGetStat;
int getBPosIsDeparture;
int getBPosIsVacation;
int getBPosIsArrival;
i... | 21 |
/*@
requires n > 0;
requires \valid(arr+(0..n-1));
ensures \forall integer i; 0 <= i < n ==> arr[i] == 0;
*/
void arrayreset(int arr[], int n) {
/*@
loop invariant 0 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> arr[i] == 0;
loop assigns j, arr[0..n-1];
loop variant n - j;
*/
for (int j=0; ... | 14 |
// In some versions of Frama-C, an additional option -pp-annot should be used to parse this example
#include <limits.h>
/*@
requires (*b >= 0 && *a <= INT_MAX - *b);
requires (*b < 0 && *a >= INT_MIN - *b);
requires \valid(a) && \valid(a);
assigns *a;
ensures *a == \old(*a) + *b;
*/
void incr_a_by_b(int* a,... | 9 |
/* run.config
OPT: -rpp
*/
/*
* Based on http://codedbot.com/questions/402185/java-comparator-violates-general-contract
*
*/
struct SolutionComparator {
int getValue;
int solutionCost;
};
/*@ requires 0 <= h < 100;
@ requires 0 <= o1.getValue <= 10 && 0 <= o1.solutionCost <= 10 && 0 <= o2.getValue <= 10 ... | 25 |
/*@ requires \valid(a+(0..length-1));
@ requires length > 0;
@ ensures \forall integer j; 0 <= j < length ==> a[\result] <= a[j];
@ assigns \nothing;
*/
int find_min(int* a, int length) {
int min, min_idx;
min_idx = 0;
min = a[0];
/*@ loop invariant 1 <= i <= length;
@ loop invariant 0 <= min_idx <... | 22 |
#include <limits.h>
/*@
requires x > INT_MIN;
assigns \nothing; // forbid any side effects
ensures 0 <= x ==> \result == x;
ensures 0 > x ==> \result == -x;
*/
int abs_int(int x)
{
return (x >= 0) ? x : -x;
}
| 7 |
/* Generated by Frama-C */
#include "stdio.h"
#include "stdlib.h"
extern int __e_acsl_sound_verdict;
/*@ assigns \nothing; */
int *__gen_e_acsl_f(int *x, int *y);
/*@ assigns \nothing; */
int *f(int *x, int *y)
{
return x;
}
int main(void)
{
int __retres;
int *p;
int x = 0;
int *q = malloc(sizeof(int));
... | 10 |
/* run.config
OPT: -load-module lib/plugins/Report -rte -rte-precond -then -val -then -report -report-print-properties
OPT: -load-module lib/plugins/Report -val -then -rte -rte-precond -then -report -report-print-properties
*/
// Fuse with precond.c when bts #1208 is solved
int x = 0;
/*@ requires i >= -1;
as... | 21 |
/* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_boucle.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
/*@ requires \true;
@ ensures 0<=\result<=1;
@ assigns \nothing;
*/
int a() {
return 1;
}
/*@ re... | 30 |
/*@ requires \true;
@ behavior x_ge_y:
@ assumes x >= y;
@ ensures \result == x;
@ behavior x_lt_y:
@ assumes x < y;
@ ensures \result == y;
@ complete behaviors x_ge_y, x_lt_y;
@ disjoint behaviors x_ge_y, x_lt_y;
@*/
int max (int x, int y) {
if (x >= y) {
return x;
} else {
retur... | 6 |
/* run.config
COMMENT: test option -e-acsl-functions
LOG: gen_@PTEST_NAME@.c
OPT: -machdep gcc_x86_64 -e-acsl-functions f -e-acsl -then-last -load-script tests/print.cmxs -print -ocode tests/special/result/gen_@PTEST_NAME@.c -kernel-verbose 0 -eva-verbose 0 -eva -wp-rte
*/
/*@ requires \valid(p);
@ requires... | 31 |
/*@
@ requires 0 <= n <= 1000;
@ ensures \result == n * n;
@ assigns \nothing;
*/
int sum_n_odds(int n) {
int res = 0;
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant res == i * i;
@ loop assigns res, i;
@ loop variant n - i;
*/
for (int i = 0; i < n; ++i) {
re... | 17 |
/*@ requires x >= -2147483647;
assigns \nothing;
ensures \result >= 0;
ensures x < 0 ==> \result == -x;
ensures x >= 0 ==> \result == x;
*/
int abs(int x)
{
if (x < 0)
return -x;
else
return x;
} | 8 |
#include <stdbool.h>
/*@ requires n >= 0;
requires \valid_read(a + (0 .. n-1));
requires \valid_read(b + (0 .. n-1));
assigns \nothing;
behavior eq:
assumes \forall integer i; 0 <= i < n ==> a[i] == b[i];
ensures \result;
behavior neq:
assumes \exists integer i; 0 <= i < n && a[... | 19 |
/*@
requires \valid(a) && \valid(b);
requires \separated(a,b);
assigns *a, *b;
ensures *a == \old(*b) && *b == \old(*a);
*/
void swap(int *a, int *b){
int tmp = *a ; *a = *b ; *b = tmp ;
}
int main(){
int x = 2;
int y = 4;
swap(&x, &y);
//@ assert x == 4 && y == 2 ;
} | 14 |
struct MaxAndMin{
int max;
int min;
};
/*@ requires size > 0 && \valid_read(a+(0..size-1));
ensures \forall integer i ; 0 <= i < size ==> ( a[i] <= \result.max && \result.min <= a[i] ) ;
*/
struct MaxAndMin findMaxAndMin(int* a,int size){
... | 29 |
/*@
requires x >= y > 0;
requires \valid (r);
ensures *r < y;
ensures x == \result*y + *r;
assigns *r;
*/
int fun(int x, int y , int *r) {
*r = x;
int d = 0;
/*@
loop invariant *r == x - y*d;
loop invariant d >= 0;
loop assigns *r, d;
loop variant *r;
... | 21 |
// complete is not effective, although negative is missing, taking it in/out doesn't make a difference still proved.
#pragma JessieIntegerModel(exact)
/*@ requires -2147483647 <= a <= 2147483647;
assigns \nothing;
behavior zero:
assumes a == 0;
ensures \result == 0;
behavior positive:
... | 11 |
/*@ requires 1==1;
*/
void test(long x)
{
unsigned a = 0x10203040;
unsigned b = (a << 16);
unsigned long long al = a;
unsigned long long bl = al << 16;
//@ assert b == (unsigned)bl;
//@ assert b == 0x30400000;
} | 4 |
/* run.config
STDOPT: +"-pp-annot"
*/
/* run.config_qualif
STDOPT: +"-pp-annot"
*/
#define ST(a) (((a)&2)!=0)
/*@
behavior sum_ok:
ensures ok: ST(\result) <==> ST(a) || ST(b) ;
complete behaviors sum_ok;
*/
char sum( char a , char b )
{ return a|b; }
#define BIT_TEST(x,n) (((x)&(1<<(n)))!=0)
/*@ requ... | 8 |
/*@ requires -1000000 < x < 1000000;
ensures \result == x + 1;
assigns \nothing; */
int f(int x) { return x+1; }
/*@ requires -1000000 < x < 1000000;
requires -1000000 < y < 1000000;
ensures \result == x + y + 1;
assigns \nothing; */
int g(int x, int y) { return (x+y+1); } | 12 |
/*@
requires n > 0;
requires \valid(a + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> a[i]==0;
*/
void Zero_array(int a[], int n)
{
/*@
loop invariant \forall integer i;
0 <= i < j ==> a[i]==0;
loop invariant 0 <= j <= n;
loop assigns j,a[0..n-1];
loop variant n - j;
*/
for (int j =... | 14 |
/*@ requires \valid(a+(0..n-1));
requires 0 <= i < n;
requires 0 <= j < n;
assigns a[i], a[j];
ensures a[i] == \old(a[j]);
ensures a[j] == \old(a[i]);
*/
static inline void swap(int a[], int i, int j, int n)
{
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
} | 10 |
/*@
requires -2147483647 <= n <= 2147483647;
ensures \result >=0;
assigns \nothing;
behavior positive:
assumes n >= 0;
ensures \result == n;
assigns \nothing;
behavior negative:
assumes n < 0;
ensures \result == -n;
assigns \nothing;
complete behaviors positive, negative;
disjoi... | 14 |
#include <limits.h>
/*@
requires (x > INT_MIN) && (y > INT_MIN) && (x >= y && x - y <= INT_MAX || x < y && x - y >= INT_MIN);
ensures y == x-\result;
assigns \nothing;
*/
int diff (int x, int y) {
return x-y;
}
/*@ assigns \nothing; */
void main() {
int t = diff(10, 5);
//@ assert t == 5;
} | 13 |
#include "limits.h"
/*@ requires b != 0;
@ requires !(a == INT_MIN && b == -1);
@ ensures \result == a/b;
@ assigns \nothing;
@*/
int div(int a, int b) {
return a / b;
} | 6 |
/* run.config
OPT: -rpp
*/
/*
* Based on http://stackoverflow.xluat.com/questions/31235938/java-order-by-priority-list
*
*/
struct MyClass{
int Name;
};
struct hack{
int t[3];
};
/*@ assigns \result \from x,y;
@ ensures x < y ==> \result == -1;
@ ensures x > y ==> \result == 1;
@ ensures x == y ==> ... | 34 |
/*@ requires n>0;
requires \valid(t+(0..n-1));
assigns t[0..n-1];
ensures \forall integer i; 0<=i<n ==> t[i] == i ;
ensures \forall integer i; 0<=i<n-1 ==> t[i] <= t[i+1];
*/
int doubleint(int t[],int n) {
/*@ loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] == j ;
loo... | 17 |
/*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
ensures (\forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1]) ==> \result==1;
ensures (\exists integer i; 0<=i<taille-1 && t[i]>t[i+1]) ==> \result==0;
*/
int increasing(int t[], int taille){
/*@
loop invariant 0<=i<=taille-1;
loop in... | 19 |
#pragma CIVL ACSL
enum t{RED, BLUE};
/*@ requires \valid_read(a) && *a==BLUE;
@ ensures \result == 2;
@ assigns \nothing;
@*/
int f(enum t* a){
return (*a)*2;
} | 5 |
/*@
requires n > 0;
requires \valid_read(a + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result <= a[i];
*/
int Min_elements(int a[], int n)
{
int min = a[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer k; 0 <= k < j ==> min <= a[k];
loop assigns j, min;
loop variant n - j... | 14 |
#include <limits.h>
/*@
requires INT_MIN <= a - b <= INT_MAX;
ensures (\result == a - b);
assigns \nothing;
*/
int sub(int a,int b)
{
int diff = a - b;
return diff;
}
/*@ assigns \nothing; */
int main(void)
{
int a = 7;
int b = 6;
sub(a,b);
return 0;
} | 12 |
/*@ requires \valid_read(t+(0..tt-1)) && tt>0;
requires \valid_read(s+(0..ts-1)) && ts>0;
requires \valid(r+(0..tt+ts-1));
requires 0<tt<100;
requires 0<ts<100;
requires \separated(t+(0..tt-1), s+(0..ts-1), r+(0..tt+ts-1));
ensures \forall integer i; 0<=i<tt ==> r[i]==t[i];
ensures \forall i... | 36 |
#include "limits.h"
/*@
requires
a*x <= INT_MAX
&& a*x+b <= INT_MAX
&& a*x >= INT_MIN
&& a*x+b >= INT_MIN;
ensures \result >= INT_MIN && \result <= INT_MAX && \result == a*x+b;
*/
int f(int a,int b,int x) {
return a*x+b;
} | 7 |
/*@ requires \valid(t+(0..n-1)) && n>0;
behavior success:
assumes \exists integer i; 0<=i<n && t[i]==val;
ensures 0<=\result<n;
behavior failure:
assumes \forall integer i; 0<=i<n ==> t[i]!=val;
ensures \result==-1;
complete behaviors success, failure;
disjoint behaviors ... | 15 |
/*@
requires \valid(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
ensures \exists integer i; 0<=i<n && i == \result;
assigns \nothing;
*/
int min(int t[], int n) {
int index = 0;
/*@
loop invariant 1 <= i <= n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==... | 18 |
/*@ requires \valid_read(p+(0..n-1));
@ ensures \result == 0;
@ assigns \nothing;
@ */
int somefun(char *p, int n) {
return 0;
} | 4 |
/* run.config
OPT: -rpp
*/
/*
* Based on http://stackoverflow.com/questions/23907134/comparing-two-arrays-using-dictionary-order-in-an-array-of-arrays-java
*
*/
struct AInt{
int t[10];
int length;
};
/*@ requires 0 <= o1.length && o1.length <= 10;
@ requires 0 <= o2.length && o2.length <= 10;
@ assign... | 23 |
/*@ ensures (x==0||y==1)?\result==1:\result == 0;
assigns \nothing;
*/
int f(int x, int y) { return (x==0||y==1); }
/*@ assigns \nothing; */
int main() {
int x = f(42,1);
int y = f(0,36);
return 0;
} | 14 |
/*@ requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/
int sum(int n){
int res=0;
/*@ loop invariant 0<=i<=n;
loop invariant res == i*(i-1)/2;
loop assigns res, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
res+=i;
}
return res;
} | 13 |
struct S { int x; };
#include <limits.h>
/*@
requires \valid(s);
assigns s->x;
ensures s->x == 0;
*/
void reset (struct S* s) {
s->x = 0;
}
/*@
requires \valid(s);
requires s->x < INT_MAX;
assigns s->x;
ensures s->x > \at(s->x,Pre);
*/
void inc(struct S* s) {
//@ assert s->x < INT_MAX;
s->x++;
}
... | 29 |
/*@ requires b != 0 && (a != -2147483648 || b != -1); // Prevent potential overflow
assigns \nothing;
ensures \result == (a % b);
*/
int mod(int a, int b)
{
return a % b;
} | 6 |
#include <stdbool.h>
/*@
requires \valid(t1+(0..n-1)) && \valid(t2+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t1[i] == t2[i]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t1[i] != t2[i]) ==> \result==0;
assigns \nothing;
*/
int compare(int t1[], int t2[], int n){
int i=0;
bool diff_found =... | 23 |
/*@
requires \valid_read(t+(0..n-1)) && n > 0;
ensures \forall integer i; 0<=i<n ==> \result <= t[i];
ensures \exists integer i; 0<=i<n && t[i] == \result;
assigns \nothing;
*/
int min(int t[], int n) {
int res = t[0];
/*@
loop invariant 1 <= i <= n;
loop invariant \forall integer j; 0 <= j < i ==> res <= t[j];
lo... | 18 |
/*@
axiomatic LCM {
logic integer lcm(integer m, integer n);
}
*/
/*@ requires a>0 && b>0;
decreases a+b;
assigns \nothing;
ensures a == 0 ==> \result == b;
ensures b == 0 ==> \result == a;
ensures a == b ==> \result == a;
*/
int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
... | 25 |
/* run.config
OPT: -load-module lib/plugins/Obfuscator -obfuscate -journal-disable
*/
/*@ ensures \valid(q);
*/
int f(int *q) ;
#define LV X_9999999999999999999999999999999999999999999999999999
int global_LV;
enum { OK = 1,
NOT_OK = 0 } e ;
/*@ ensures \valid(p);
*/
void main (int * p) {
int LV = 0;
e ... | 3 |
/*@
requires \valid (s+(0..n-1));
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n ==> s[i] == t[i]);
*/
int compare_array(int s[], int t[], int n)
{
int i = 0;
/*@
loop invariant \forall integer j; 0 <= j < i ==> s[j] == t[j];
loop invaria... | 15 |
/*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@
@ assigns \nothing;
@ behavior true_:
@ assumes \forall integer i; 0 <= i < n / 2 ==> a[i] == a[n - i - 1];
@ ensures \result == 1;
@ behavior false_:
@ assumes \exists integer i; 0 <= i < n / 2 && a[i] != a[n - i - 1];
@ ensures \resu... | 22 |
/* bts 60: 1 should be lifted to a real number implicitely. */
/*@ ensures 1.0 == 1;
assigns \nothing;*/
void f();
/*@ lemma foo: 1.0 == (float)1; */
void f() {
double B;
}
typedef int T, T4[4], *T_PTR;
const T X, Tab[4];
typedef T_PTR T_PTR_T4[4];
const T_PTR_T4 Tab_Ptr = { &X, &X, &X, &X};
| 5 |
/*@ predicate dom{L}(int k,int n) = k >= 0 && k <= n - 1;
*/
/*@
requires A: n >= 0 && \valid (a +(0.. n-1));
requires B: dom( i, n ) && dom( j, n );
assigns a[i], a[j];
ensures \old(a[i]) == a[j] && \old(a[j]) == a[i];
ensures \forall int i1; dom(i1,n) ==>
\exists i... | 10 |
/* public interface */
/*@ assigns \nothing;
@ ensures \result >= 0;
@*/
int gen() {
return 0;
} | 4 |
/*@ requires \valid_read(p+(0..n-1));
@ ensures \result > 0;
@ assigns \nothing;
@ */
int somefun(char *p, int n) {
return 1;
} | 4 |
/*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i; 0 <= i < n ==> \result >= arr[i];
*/
int arraymax(int arr[], int n) {
int max = arr[0];
/*@
loop invariant 1 <= j <= n;
loop invariant \forall integer i; 0 <= i < j ==> max >= arr[i];
loop invariant max >= arr[0];
loop as... | 16 |
/*@ requires 0 <= n <= 1000;
ensures \result == n*n;
assigns \nothing;
*/
int oddsum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum==i*i;
loop assigns i, sum;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum += i*2 + 1;
}
return sum;
} | 17 |
/* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_boucle_rechercheTableau.ya -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
/*@ requires \valid(t+(0..max));
@ requires max>=0;
@ requires max < 2147483... | 30 |
/*@
requires \valid_read(a + (0..n-1));
requires n > 0;
ensures \forall integer k; 0 <= k < n ==> \result >= a[k];
ensures \exists integer k; 0 <= k < n && \result == a[k];
assigns \nothing;
*/
int arraymax(int* a, int n) {
int i = 1;
int max = a[0];
/*@
loop invariant \forall integer k; 0 <= k < n =... | 18 |
/*@ requires 1000>taille>0;
requires \valid(t+(0..taille-1));
ensures \forall integer i; 0<=i<taille ==> t[i] == (i*2) ;
ensures \forall integer i; 0<=i<taille-1 ==> t[i]<=t[i+1];
*/
void doubleint(int t[],int taille) { // void double() --> not possible since datatype!
/*@ loop invariant 0<=i<=t... | 19 |
/*@
requires \valid(t+(0..n-1)) && n>0;
// assigns \nothing;
ensures (\forall integer i; 0<=i<n ==> t[i] == t[n-i-1]) ==> \result==1;
ensures (\exists integer i; 0<=i<n && t[i] != t[n-i-1]) ==> \result==0;
*/
int palindrome(int t[], int n){
/*@
loop invariant 0<=i<=n/2;
loop invariant \forall integer j; 0<=j<... | 17 |
/*
* A simple string matching
* Takuo Watanabe (Tokyo Institute of Technology)
*
* This file can be successfully verified using Frama-C with Jessie plugin.
* Frama-C Carbon-20110201
* Alt-Ergo 0.92.2 / CVC3 2.2
*/
/*@ predicate MatchAt{L}(char *t, char *p, integer k, integer m) =
@ \forall integer l; 0... | 31 |
/*@
requires 0 <= n <= 1000;
ensures \result == n*(n-1)/2;
*/
int sum(int n){
int sum=0;
/*@
loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns i, sum;
loop variant n-i;
*/
for (int i=0;i<n;i++)
sum += i;
return sum;
} | 13 |
/*@
requires 0 <= n <= 1000;
ensures \result == n * n;
assigns \nothing;
*/
int sumOdd(int n){
int res=0;
int i=0;
/*@
loop invariant 0<=i<=n;
loop invariant res == i*i;
loop assigns res,i;
loop variant n-i;
*/
while(i<n){
res+=i*2+1;
i++;
}
return res;
} | 17 |
/*@
requires \valid_read(a+(0..N-1)) && 0 <= x && x < N && 0 <= y && y < N;
ensures \result >= 0;
*/
int lcp(int a[], int N, int x, int y)
{
int l = 0;
/*@ loop invariant 0 <= l <= N;
loop invariant x + l <= N && y + l <= N;
loop assigns l;
loop variant N - l;
*/
for (;;)... | 21 |
/*@
requires n > 0;
requires \valid_read(t+(0..n-1));
ensures \result <==> (\forall integer i; 0 <= i < n ==> t[i] == 0);
*/
int arraynull(int t[], int n){
/*@
loop invariant 0 <= i <= n;
loop invariant \forall integer j ; 0 <= j < i ==> t[j] == 0;
loop assigns i;
loop variant n-i;
*/
for(int i = 0; i < n ... | 12 |
/*@
ensures \result == x || \result == y;
ensures \result >= x && \result >= y;
*/
int max(int x, int y) {
if (x >= y) {
return x;
}
return y;
} | 4 |
/*@ requires n>=0 && \valid(t+(0..n-1));
ensures \result != 0 <==> (\forall integer j; 0 <= j < n ==> t[j] == 0);
*/
int all_zeros(int t[], int n) {
int k;
/*@ loop invariant 0 <= k <= n;
loop invariant \forall integer j; 0 <= j < k ==> t[j] == 0;
loop assigns k;
loop variant n-k;
*/
for(... | 12 |
/*@ requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
assigns \nothing;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
ens... | 24 |
#include <limits.h>
/*@
assigns \nothing;
*/
void try_initialize_array ( void )
{
int array[5];
// To prove asserts at the end of this function,
// uncomment following loop invariant. It might also be helpful to ensure
// that i has proper bounds (or use -wp-invariants).
/*@ loop invariant I1:
0 <= i <= 5 &&... | 54 |
/*@
requires c >= 0;
assigns \nothing;
ensures \true;
*/
void f (int c) {
/*@ loop invariant c >= 0;
loop invariant c <= \at(c, Pre);
loop assigns c;
loop variant c;
*/
while (c != 0) {
c--;
}
return;
} | 12 |
#ifndef _FIND_H_
#define _FIND_H_
/*@
requires \valid_read(a + (0..n-1));
ensures 0 <= \result <= n;
behavior some:
assumes \exists integer i; 0 <= i < n && a[i] == v;
ensures 0 <= \result < n;
ensures a[\result] == v;
ensures \forall inte... | 21 |
/*@
requires \valid(t+(0..taille-1)) && taille>0 && 2*(taille-1) < 2147483647;
assigns t[0..taille-1];
ensures \forall integer i; 0<=i<taille ==> t[i] == 2*i;
*/
void doubled(int t[], int taille){
/*@
loop invariant 0 <= i <= taille;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 2*j;
loop assigns i... | 18 |
/*@
requires \valid(t+(0..taille-1)) && taille>0;
behavior increasing:
assumes \forall integer i; 1 <= i < taille ==> t[i] >= t[i - 1];
ensures \result == 1;
behavior decreasing:
assumes \exists integer i; 1 <= i < taille && t[i] < t[i - 1];
ensures \result == 0;
assigns \nothing;
complete ... | 21 |
/*@ requires n>0;
requires \valid(a+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> a[i]==a[n-i-1];
ensures \result==1;
behavior failure:
assumes \exists integer i; 0<=i<n && a[i]!=a[n-i-1];
ensures \result==0;
complete behaviors success... | 22 |
/*@ requires length > 0 && \valid(a+(0..length-1));
assigns \nothing; // Changed assigns clause to \nothing
ensures 0<=\result<length &&
(\forall integer j; 0<=j<length ==> a[\result]<=a[j]);
*/
int find_min(int* a, int length) {
int min, min_idx;
min_idx = 0;
min = a[0];
/*@ loop invariant 0<=i<=... | 21 |
/*@ requires \valid(a) && \valid(b);
@ ensures *a == \old(*b);
@ ensures *b == \old(*a);
@*/
void swap(int* a, int* b) {
int temp = *a;
*a = *b;
*b = temp;
} | 8 |
struct S {
char *x;
int *y;
};
/*@
requires \valid(s) && \valid_read(s->x) && \valid_read(s->y) &&
(int)(*s->x) + *s->y >= -2147483648 && (int)(*s->x) + *s->y <= 2147483647;
ensures \result == (int)(*s->x) + *s->y;
assigns \nothing;
*/
int f(struct S* s) {
return *s->x + *s->y;
} | 10 |
// teste si un tableau est un palindrome
// ESOPE RESTE ELU PAR CETTE CRAPULE ET SE REPOSE
/*@
requires \valid (t+(0..n-1));
requires n > 0;
assigns \nothing;
ensures \result <==> (\forall integer i; 0 <= i < n/2 ==> t[i] == t[n-i-1]);
*/
int is_palindrome(int t[], int n)
{
int mid = n/2;
int i = 0;
/*@
loop... | 18 |
/*@
requires \valid(a) && \valid(b) && \valid_read(a) && \valid_read(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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.