ArraySearch
<init>()V linSearch([II)I binSearch([II)I equals(Ljava/lang/Object;)Z main([Ljava/lang/String;)V
b) Coverage criterion: Block-k: Depth-k:
c) Get numeric test-cases or path-constraints: Path-constraints Numeric (In this case a range must be especified in step d)
d) Specify the range of integers to take data from: None Range: ..
e) Labeling strategy (see the SWI-Prolog CLPFD library) : ff leftmost min max
f) References aliasing: Don't alias Might alias CLP Heap Solver
g) Verbosity level: 1 2 3
h) Generate JUnit test: Type: no minimum complete Use reflection: no yes
i) Tracing: no statements blocks
j) Check code coverage: no yes