source: CIVL/examples/arithmetic/multiplicationInLoopCondition.cvl@ b4371ee

1.23 2.0 main test-branch
Last change on this file since b4371ee was b4371ee, checked in by Manchun Zheng <zmanchun@…>, 12 years ago

use smaller upper bound for i to reduce execution time.

git-svn-id: svn://vsl.cis.udel.edu/civl/trunk@456 fb995dde-84ed-4084-dfe6-e5aef3e2452c

  • Property mode set to 100644
File size: 274 bytes
RevLine 
[289a368]1$input int N;
2$input int M;
3$assume N > 0 && N < 3;
4$assume M > 0 && M < 3;
5
6void main() {
7 int k = M*N;
8 int a[k];
9
10 for (int i = 0; i < k; i++) {
11 a[i] = i;
[b4371ee]12 if(i == 35) // the upper bound of i should be at least 33 to trigger the exception.
[289a368]13 break;
14 }
15}
Note: See TracBrowser for help on using the repository browser.