ok    1  v(k)++ on REAL and INT elements by REAL / INT / literal / expression subscripts
ok    2  a fraction, a wide value and a rational element increment exactly
ok    3  v(k) = v(k) + 1, 1 + v(k), v(k) - 1 on REAL and INT elements (v(2) holds 1e20 + 1 from check 2); + 2 stays a plain store
ok    4  INTERR at both INT edges, the element untouched
ok    5  out of bounds above and below raises SUBOUTBND, a frozen array raises and keeps its value
ok    6  a sorted array re-places the element; an expandable array grows on an increment past its end (from 0)
ok    7  c->m++ on a REAL and an INT member at the current row, both rows
ok    8  an indexed member keeps its findrow index in step with the increment
ok    9  a frozen member raises and keeps its value; a cluster with no rows increments its scalar field; a row once added
ok    10  INTERR on a member at the INT edge, the member untouched
ok    11  increments inside a for each and in a one-line if / else
ok    12  a thousand bucket increments by a computed subscript
ok    13  a table field ++ twice, then once in a one-line if with an else; the record rolled back
ok    14  report: v(k)++ 26.55 ns, v(k) = v(k) + 1 26.55 ns, c->m++ 264.85 ns (the bare loop not subtracted)

passed:  14   failed:  0 
