example.name = 3 - Binary Search
example.path = Benchmarks/WeideEtAl
example.additionalFile.1 = src/BinarySearch.java

The second benchmark from the paper "Incremental Benchmarks for Software Verification Tools and Techniques" by Bruce W. Weide, Murali Sitaraman, Heather K. Harton, Bruce Adcock, Paolo Bucci, Derek Bronish, Wayne D. Heym, Jason Kirschenbaum and David Frazier: 

Verify an operation that uses binary search to find a given entry in an array of entries that are in sorted order.

The proof obligation is verifiable without user interaction.
