blob: 41d55e847d1db8bdd4adf1e7096cba74b565121a (
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
56
57
58
59
60
61
62
63
|
// RUN: %clang -emit-llvm -g -c -o %t.bc %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --use-incomplete-merge --debug-log-incomplete-merge --search=nurs:covnew --use-batching-search %t.bc 2>&1 | FileCheck %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --use-incomplete-merge --debug-log-incomplete-merge --search=bfs --use-batching-search %t.bc 2>&1 | FileCheck %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --use-incomplete-merge --debug-log-incomplete-merge --search=dfs --use-batching-search %t.bc 2>&1 | FileCheck %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --use-incomplete-merge --debug-log-incomplete-merge --search=nurs:covnew %t.bc 2>&1 | FileCheck %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --use-incomplete-merge --debug-log-incomplete-merge --search=random-path %t.bc 2>&1 | FileCheck %s
// CHECK: open merge:
// 5 close merges
// CHECK: close merge:
// CHECK: close merge:
// CHECK: close merge:
// CHECK: close merge:
// CHECK: close merge:
// This test merges branches with vastly different instruction counts.
// The incomplete merging heuristic merges preemptively if a branch takes too long.
// It might occur that the random branch selection completes the heavy branch first,
// which results in the branches being merged completely.
#include "klee/klee.h"
int main(int argc, char **args) {
int x;
int a;
int foo = 0;
klee_make_symbolic(&x, sizeof(x), "x");
klee_make_symbolic(&a, sizeof(a), "a");
klee_open_merge();
if (a == 0) {
klee_open_merge();
for (int i = 0; i < 5; ++i){
foo += 2;
}
if (x == 1) {
foo += 5;
} else if (x == 2) {
for (int i = 0; i < 10; ++i) {
foo += foo;
}
} else {
foo += 7;
}
klee_close_merge();
} else if (a == 1) {
foo = 4;
} else {
foo = 3;
}
klee_close_merge();
return foo;
}
|
