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
|
// Test case for kelloggm 215
// https://github.com/kelloggm/checker-framework/issues/215
import org.checkerframework.checker.index.qual.NonNegative;
public class RefineSubtrahend {
void withConstant(int[] a, @NonNegative int l) {
if (a.length - l > 10) {
int x = a[l + 10];
}
if (a.length - 10 > l) {
int x = a[l + 10];
}
if (a.length - l >= 10) {
// :: error: (array.access.unsafe.high)
int x = a[l + 10];
int x1 = a[l + 9];
}
}
void withVariable(int[] a, @NonNegative int l, @NonNegative int j, @NonNegative int k) {
if (a.length - l > j) {
if (k <= j) {
int x = a[l + k];
}
}
if (a.length - j > l) {
if (k <= j) {
int x = a[l + k];
}
}
if (a.length - j >= l) {
if (k <= j) {
// :: error: (array.access.unsafe.high)
int x = a[l + k];
// :: error: (array.access.unsafe.low)
int x1 = a[l + k - 1];
}
}
}
void cases(int[] a, @NonNegative int l) {
switch (a.length - l) {
case 1:
int x = a[l];
break;
case 2:
int y = a[l + 1];
break;
}
}
}
|
