Which argument proves that recursive binary search on [low, high) terminates?

Which argument proves that recursive binary search on [low, high) terminates?

1. The interval width is nonnegative and strictly decreases on every recursive branch.
2. The target usually occurs near the middle of real data.
3. Every call has fewer local variables than its caller.
4. The runtime eventually removes old call frames.