blob: b120d3545786ee6f2b75e433c26a9757dc943d6c (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
// RUN: %llvmgcc %s -emit-llvm -O0 -c -o %t2.bc
// RUN: %klee %t2.bc
// RUN: %klee --search=random-state %t2.bc
// RUN: %klee --search=nurs:depth %t2.bc
// RUN: %klee --search=nurs:qc %t2.bc
// RUN: %klee --use-batching-search %t2.bc
// RUN: %klee --use-batching-search --search=random-state %t2.bc
// RUN: %klee --use-batching-search --search=nurs:depth %t2.bc
// RUN: %klee --use-batching-search --search=nurs:qc %t2.bc
// RUN: %klee --search=random-path --search=nurs:qc %t2.bc
// RUN: %klee --use-merge --search=dfs --debug-log-merge --debug-log-state-merge %t2.bc
// RUN: %klee --use-merge --use-batching-search --search=dfs %t2.bc
// RUN: %klee --use-merge --use-batching-search --search=random-state %t2.bc
// RUN: %klee --use-merge --use-batching-search --search=nurs:depth %t2.bc
// RUN: %klee --use-merge --use-batching-search --search=nurs:qc %t2.bc
// RUN: %klee --use-iterative-deepening-time-search --use-batching-search %t2.bc
// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --search=random-state %t2.bc
// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --search=nurs:depth %t2.bc
// RUN: %klee --use-iterative-deepening-time-search --use-batching-search --search=nurs:qc %t2.bc
/* this test is basically just for coverage and doesn't really do any
correctness check (aside from testing that the various combinations
don't crash) */
#include <stdlib.h>
int validate(char *buf, int N) {
int i;
for (i=0; i<N; i++) {
if (buf[i]==0) {
klee_merge();
return 0;
}
}
klee_merge();
return 1;
}
#ifndef SYMBOLIC_SIZE
#define SYMBOLIC_SIZE 15
#endif
int main(int argc, char **argv) {
int N = SYMBOLIC_SIZE;
unsigned char *buf = malloc(N);
int i;
klee_make_symbolic(buf, N);
if (validate(buf, N))
return buf[0];
return 0;
}
|
