When you run this program, you get results like this:

carseq 1:
cars = IlcIntVarArrayI[[0] [1] [5] [2] [4] [3] [3] [4] [2] [5]]
Number of fails               : 1
Number of choice points       : 3
Number of variables           : 308
Number of constraints         : 239
Reversible stack (bytes)      : 40224
Solver heap (bytes)           : 168864
Solver global heap (bytes)    : 4044
And stack (bytes)             : 4044
Or stack (bytes)              : 4044
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 11144
Total memory used (bytes)     : 236408
Elapsed time since creation   : 0.11
 
carseq 2 1 1:
number of times each configuration is required:
5 3 7 1 10 2 11 5 4 6 12 1 1 5 9 5 12 1
configuration required by each option:
option:0 0 1 2 4 5 6 7 13
option:1 0 1 2 3 4 8 9 10 14
option:2 2 3 7 10 11 12 17
option:3 1 3 6 9 12 16
option:4 0 5 8 11 15
number of times each option is required
option:0 48 x 1/2
option:1 57 x 2/3
option:2 28 x 1/3
option:3 34 x 2/5
option:4 17 x 1/5
cars = IlcIntVarArrayI[[17] [16] [16] [7] [15] [13] [10] [13] [14] [6] [10] [6]
[15] [4] [14] [6] [10] [4] [16] [0] [14] [6] [10] [1] [15] [2] [14] [6] [10] [0]
 [16] [4] [9] [7] [8] [4] [16] [2] [9] [5] [10] [4] [16] [2] [8] [6] [14] [2] [1
6] [0] [3] [13] [14] [2] [15] [1] [10] [6] [14] [0] [12] [4] [9] [7] [8] [4] [16
] [2] [9] [5] [10] [4] [16] [2] [8] [6] [10] [4] [16] [0] [10] [6] [14] [1] [11]
 [4] [9] [7] [9] [13] [10] [6] [14] [6] [10] [13] [15] [7] [16] [16]]
Number of fails               : 0
Number of choice points       : 160
Number of variables           : 4768
Number of constraints         : 2367
Reversible stack (bytes)      : 836184
Solver heap (bytes)           : 1977864
Solver global heap (bytes)    : 4044
And stack (bytes)             : 4044
Or stack (bytes)              : 8064
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 15152
Total memory used (bytes)     : 2849396
Elapsed time since creation   : 4.677
 
carseq 2 1 2
number of times each configuration is required:
7 11 1 3 15 2 8 5 3 4 5 2 6 2 2 4 3 5 2 4 1 1 1 1 2
configuration required by each option:
option:0 0 1 3 5 10 11 15 16 17 18 19 20 21
option:1 1 2 4 6 9 11 12 14 15 17 18 19 21 22 23
option:2 2 3 5 7 9 11 12 13 15 18 23
option:3 0 2 5 6 8 9 15 17 20 21 22
option:4 2 11 13 14 16 19 20 21 22 23 24
number of times each option is required
option:0 50 x 1/2
option:1 67 x 2/3
option:2 32 x 1/3
option:3 37 x 2/5
option:4 20 x 1/5
No solution
Number of fails               : 41
Number of choice points       : 40
Number of variables           : 626
Number of constraints         : 0
Reversible stack (bytes)      : 872364
Solver heap (bytes)           : 2126604
Solver global heap (bytes)    : 4044
And stack (bytes)             : 4044
Or stack (bytes)              : 4044
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 21160
Total memory used (bytes)     : 3036304
Elapsed time since creation   : 5.458