This example is distilled from some code where I am storing pairs of elements in an array.
The compiler should be able to eliminate the index bounds check.

pr(List a) {
  for (int i = 0; i + 1 < a.length; i += 2) {
    print('${a[i]} ${a[i+1]}');
  }
}

main() {
  var f = pr;
  f([1,2]);
  f([1,2,3,4,5]);
}

$.pr = function(a) {
  if (typeof a !== 'string' && (typeof a !== 'object' || a === null || a.constructor !== Array && !a.is$JavaScriptIndexingBehavior))
    return $.pr$bailout(1, a);
  for (var i = 0; t1 = i + 1, t2 = a.length, t1 < t2; i += 2) {
    if (i >= t2)
      throw $.ioore(i);
    var t3 = $.S(a[i]) + ' ';
    if (t1 >= a.length)
      throw $.ioore(t1);
    $.print(t3 + $.S(a[t1]));
  }
  var t2, t1;
};

If I change the check to i < a.length - 1, one access check is eliminated, but the other is not:
(I prefer the first version since the loop condition states the quantity (i+1) that must be in range.)

$.pr = function(a) {
  if (typeof a !== 'string' && (typeof a !== 'object' || a === null || a.constructor !== Array && !a.is$JavaScriptIndexingBehavior))
    return $.pr$bailout(1, a);
  for (var i = 0; i < a.length - 1; i += 2) {
    var t1 = $.S(a[i]) + ' ';
    var t2 = i + 1;
    if (t2 >= a.length)
      throw $.ioore(t2);
    $.print(t1 + $.S(a[t2]));
  }
};