| 1 | | % (c) 2009-2024 Lehrstuhl fuer Softwaretechnik und Programmiersprachen, |
| 2 | | % Heinrich Heine Universitaet Duesseldorf |
| 3 | | % This software is licenced under EPL 1.0 (http://www.eclipse.org/org/documents/epl-v10.html) |
| 4 | | |
| 5 | | % each cli_testcase consists of: id, list of categories, arguments to probcli, comment |
| 6 | | |
| 7 | | :- module(testcases, [cli_testcase/5, |
| 8 | | set_generating_coverage/0, unset_generating_coverage/0, |
| 9 | | test_requires_extension/3, test_category_requires_extension/2, |
| 10 | | cli_testcase_diff_check_output/3, cli_testcase_do_not_delete/2, |
| 11 | | extra_testcase_file/2]). |
| 12 | | |
| 13 | | %:- use_module('../extensions/profiler/profiler.pl'). |
| 14 | | %:- use_module('../extensions/profiler/profiler_te.pl'). |
| 15 | | %:- enable_profiling(cli_testcase/5). |
| 16 | | |
| 17 | | :- use_module(probsrc(module_information),[module_info/2]). |
| 18 | | :- module_info(group,testing). |
| 19 | | :- module_info(description,'This module defines the (integration) tests.'). |
| 20 | | |
| 21 | | :- use_module(library(lists), [append/2]). |
| 22 | | cli_testcase(Id,Groups,TestConfiguration,Arguments,Description) :- |
| 23 | ? | cli_testcase(Id,Groups,ArgumentsTemp,Description), |
| 24 | | options_all_tests(Id,AdditionalArguments), |
| 25 | | append(ArgumentsTemp,AdditionalArguments,Arguments), |
| 26 | | findall(Conf,additional_configuration(Id,Conf),TestConfiguration). |
| 27 | | |
| 28 | | |
| 29 | | % options that should be used in all testcases |
| 30 | | options_all_tests(1303,['-strict']) :- !. |
| 31 | | options_all_tests(1351,['-strict']) :- !. % tests generate warnings and we still want to load the B machines |
| 32 | | options_all_tests(1658,['-strict']) :- !. |
| 33 | | options_all_tests(_,['-strict','-p','STRICT_RAISE_WARNINGS','TRUE']). |
| 34 | | |
| 35 | | :- dynamic generating_coverage/0. |
| 36 | | set_generating_coverage :- (generating_coverage -> true ; assertz(generating_coverage)). |
| 37 | | unset_generating_coverage :- retractall(generating_coverage). |
| 38 | | |
| 39 | | :- use_module(probsrc(tools),[host_platform/1,platform_is_64_bit/0]). |
| 40 | | :- use_module(probsrc(parsercall),[get_parser_version/6]). |
| 41 | | additional_configuration(37, conditional_skip(\+(platform_is_64_bit))). /* CLP(FD) buffer overflow on win32 */ |
| 42 | | additional_configuration(43, conditional_skip(\+(platform_is_64_bit))). /* integer too large for 32-bit systems */ |
| 43 | | additional_configuration(50, conditional_skip(host_platform(windows))). |
| 44 | | additional_configuration(161, conditional_skip(host_platform(windows))). |
| 45 | | additional_configuration(271, conditional_skip(host_platform(windows))). |
| 46 | | %additional_configuration(324, skip). /* because only works if SMT mode is allowed to instantiate */ |
| 47 | | additional_configuration(539, conditional_skip(host_platform(windows))). |
| 48 | | additional_configuration(469, conditional_skip(\+(platform_is_64_bit))). /* timeout */ |
| 49 | | additional_configuration(767, conditional_skip(\+(platform_is_64_bit))). /* integer overflow on 32-bit systems */ |
| 50 | | %additional_configuration(865, conditional_skip(host_platform(windows))). |
| 51 | | additional_configuration(875, skip). % The type checker temporarily also allows {x|->y | x=y+1 } (added to support UNION/INTER with Prolog BParser) |
| 52 | | additional_configuration(943, skip). % Skip until we move to new parser |
| 53 | | additional_configuration(1101, conditional_skip(\+(platform_is_64_bit))). % not enough memory |
| 54 | | additional_configuration(1102, conditional_skip(\+(platform_is_64_bit))). % not enough memory |
| 55 | | additional_configuration(1103, conditional_skip(\+(platform_is_64_bit))). % not enough memory |
| 56 | | additional_configuration(1131, conditional_skip(\+(platform_is_64_bit))). % not enough memory |
| 57 | | additional_configuration(1157, conditional_skip(\+(platform_is_64_bit))). % not enough memory |
| 58 | | additional_configuration(1162, conditional_skip(host_platform(linux))). /* linux32 is too slow for this testcase Timeout when posting constraint: clpfd_interface:(list_to_fdset([506,506],_374556577),_374485321 in_set _374556577) -> timeout; ditto for linux 64?! */ |
| 59 | | additional_configuration(1207, conditional_skip(\+(platform_is_64_bit))). /* integer overflow on 32-bit systems */ |
| 60 | | additional_configuration(1360, conditional_skip(\+(platform_is_64_bit))). /* funnily enough: no clpfd overflow */ |
| 61 | | %additional_configuration(810, conditional_skip(host_platform(windows))). /* java heap space */ |
| 62 | | additional_configuration(844, skip). % repl option is not anymore available |
| 63 | | additional_configuration(988, skip). % skip test case until merging 'feature/avl_sets_csp' with 'develop' |
| 64 | | additional_configuration(987, skip). % no reductions can be gained in this test case |
| 65 | | %additional_configuration(1086, skip). % works now, commit a731e9377f4d8dce092b448b8d8ce915d5ae9948 was meant to unskip it earlier |
| 66 | | additional_configuration(1316, conditional_skip(host_platform(windows))). |
| 67 | | % Crashes on Windows, but only when running entire b_test category. |
| 68 | | % Probably caused by an earlier test, but don't know which. |
| 69 | | additional_configuration(1414, conditional_skip(host_platform(windows))). |
| 70 | | additional_configuration(1441, conditional_skip(\+(platform_is_64_bit))). /* timeout */ |
| 71 | | additional_configuration(1447, conditional_skip(\+(platform_is_64_bit))). /* timeout */ |
| 72 | | additional_configuration(1452, conditional_skip(\+(platform_is_64_bit))). /* timeout */ |
| 73 | | additional_configuration(1609, conditional_skip(\+(platform_is_64_bit))). /* integer overflow on 32-bit systems */ |
| 74 | | additional_configuration(1654, conditional_skip(host_platform(windows))). % file contains unicode and can not be checked out properly on windows |
| 75 | | additional_configuration(1716, conditional_skip(\+(platform_is_64_bit))). /* timeout */ |
| 76 | | additional_configuration(1753, conditional_skip(\+(host_platform(linux)))). % solving table/2 issue causes further slowdown; TODO: re-evaluate for SICStus 4.8 |
| 77 | | additional_configuration(1771, conditional_skip(host_platform(windows))). |
| 78 | | additional_configuration(1792, conditional_skip(\+(platform_is_64_bit))). /* CLP(FD) overflow on win32 */ |
| 79 | | |
| 80 | | % seems slow on Windows for SICStus 4.6 and 4.7 |
| 81 | | additional_configuration(1800, conditional_skip((host_platform(windows), current_prolog_flag(version_data,sicstus(V1,V2,_,_,_)), v(V1,V2) @>= v(4,6)))). |
| 82 | | |
| 83 | | additional_configuration(1812, skip). % sometimes unknown or segfault using 4.12.2, wait for release of 4.12.3 |
| 84 | | |
| 85 | | additional_configuration(1926, conditional_skip(host_platform(windows))). % Alloy bug on windows: https://github.com/AlloyTools/org.alloytools.alloy/issues/112 |
| 86 | | |
| 87 | | % platoon_2_mch and platoon_3_0_mch platoon_4_0_mch are not animatable (any more) with more restrictive enumeration warning treatment; they require infinite total functions (xpos: NATURAL ** .... --> ) |
| 88 | | additional_configuration(129, skip). |
| 89 | | additional_configuration(130, skip). |
| 90 | | additional_configuration(131, skip). |
| 91 | | additional_configuration(132, skip). |
| 92 | | additional_configuration(333, skip). |
| 93 | | additional_configuration(334, skip). |
| 94 | | %additional_configuration(1308, skip). % Kodkod test, now fails with more conservative card treatment, 20th April 2016, git sha: a422afcd2949b8b0a40821f0029b41240935e695; works again 7th March 2024 |
| 95 | | additional_configuration(1552, skip). % removed unsafe function application treatment in b_compiler, 22nd July 2016 |
| 96 | | additional_configuration(1705, skip). % requires feature b_write_eventb_machine_to_classicalb_to_file to be added to cli_start_mc_with_tlc |
| 97 | | %additional_configuration(1755, skip). % requires solving test 614, 1101 for new UNION translation |
| 98 | | %additional_configuration(1791, skip). % parse errors due to change in Rules machine parser; fixed by adapting model |
| 99 | | additional_configuration(1809, skip). % skip until Kodkod problem solved |
| 100 | | %additional_configuration(2021, conditional_skip(host_platform(windows))). % skip until kernel_attr used for not_empty_set and eq_empty_set |
| 101 | | additional_configuration(2166, conditional_skip(host_platform(windows))). % occasional cdclt timeouts on windows |
| 102 | | additional_configuration(2249, conditional_skip(host_platform(windows))). % |
| 103 | | additional_configuration(2252, conditional_skip(host_platform(windows))). % |
| 104 | | additional_configuration(2261, conditional_skip(host_platform(windows))). % |
| 105 | | additional_configuration(2262, conditional_skip(host_platform(windows))). % |
| 106 | | additional_configuration(2267, conditional_skip(host_platform(windows))). % |
| 107 | | additional_configuration(2280, conditional_skip(host_platform(windows))). % |
| 108 | | additional_configuration(2281, conditional_skip(host_platform(windows))). % |
| 109 | | additional_configuration(2282, conditional_skip((host_platform(windows) ; generating_coverage))). % some also time out in coverage build |
| 110 | | additional_configuration(2293, conditional_skip(host_platform(windows))). % |
| 111 | | additional_configuration(2294, conditional_skip(host_platform(windows))). % |
| 112 | | additional_configuration(2363, conditional_skip((host_platform(windows) ; generating_coverage))). % |
| 113 | | additional_configuration(2365, conditional_skip(host_platform(windows))). % |
| 114 | | additional_configuration(2366, conditional_skip(host_platform(windows))). % |
| 115 | | additional_configuration(2367, conditional_skip(host_platform(windows))). % |
| 116 | | additional_configuration(2368, conditional_skip(host_platform(windows))). % |
| 117 | | additional_configuration(2369, conditional_skip((host_platform(windows) ; generating_coverage))). % |
| 118 | | additional_configuration(2370, conditional_skip((host_platform(windows) ; generating_coverage))). % |
| 119 | | additional_configuration(2374, conditional_skip(host_platform(windows))). % |
| 120 | | additional_configuration(2375, conditional_skip(host_platform(windows))). % |
| 121 | | additional_configuration(2376, conditional_skip(host_platform(windows))). % |
| 122 | | |
| 123 | | % TODO: include test when Z3 4.12.3 is released, see https://github.com/Z3Prover/z3/issues/6748 |
| 124 | | %additional_configuration(2251, skip). % works again, 7th March 2024 |
| 125 | | |
| 126 | | % these machines cannot be model checked symbolically as of now |
| 127 | | % solvers / provers are too weak |
| 128 | | % or they just take too long |
| 129 | | additional_configuration(1431, skip). |
| 130 | | additional_configuration(1582, skip). |
| 131 | | additional_configuration(1583, skip). |
| 132 | | additional_configuration(1585, skip). |
| 133 | | |
| 134 | | % Very slow (or possibly hanging) on SWI |
| 135 | | additional_configuration(24, conditional_skip(current_prolog_flag(dialect, swi))). |
| 136 | | additional_configuration(31, conditional_skip(current_prolog_flag(dialect, swi))). |
| 137 | | additional_configuration(62, conditional_skip(current_prolog_flag(dialect, swi))). |
| 138 | | additional_configuration(1829, conditional_skip(current_prolog_flag(dialect, swi))). |
| 139 | | |
| 140 | | % fails due to limitation of CLP(FD) in SWI, not detecting failure of X #= Y+1, Y #=X+1. |
| 141 | | additional_configuration(2415, swi_expected_failure). |
| 142 | | |
| 143 | | % Tests that are currently expected to fail on SWI - used to check for regressions in SWI support. |
| 144 | | % Note: Many of these are because of timeouts and will pass with a higher timeout. |
| 145 | | % TODO Allow selectively increasing/multiplying timeouts for certain tests on SWI |
| 146 | | |
| 147 | | % Unexpected residue |
| 148 | | additional_configuration(289, swi_expected_failure). % happens since c274ab9695d37ee2e78db8c930ae809cf8b9c637 (or up to 2 commits before) on CI with SWI 9.1, not locally with 9.0.3; even though commit has no influence whatsoever on generated ast |
| 149 | | additional_configuration(981, swi_expected_failure). |
| 150 | | additional_configuration(1263, swi_expected_failure). |
| 151 | | additional_configuration(1161, swi_expected_failure). % happens only on CI currently? |
| 152 | | additional_configuration(1352, swi_expected_failure). |
| 153 | | additional_configuration(1373, swi_expected_failure). % happens only on CI currently? |
| 154 | | additional_configuration(2131, swi_expected_failure). |
| 155 | | additional_configuration(2132, swi_expected_failure). |
| 156 | | additional_configuration(2134, swi_expected_failure). |
| 157 | | additional_configuration(2264, swi_expected_failure). |
| 158 | | |
| 159 | | |
| 160 | | % Unexpected unbounded enumeration |
| 161 | | additional_configuration(362, swi_expected_failure). |
| 162 | | additional_configuration(1038, swi_expected_failure). |
| 163 | | additional_configuration(1175, swi_expected_failure). |
| 164 | | additional_configuration(1488, swi_expected_failure). % since Jan 2, 2023 ace9abbc9f6bf295c7d9e37421b57d0d215e6dc6 |
| 165 | | % possibly due to change in order of waking up not_equal_object after changing block to when |
| 166 | | additional_configuration(1619, swi_expected_failure). |
| 167 | | additional_configuration(2210, swi_expected_failure). |
| 168 | | |
| 169 | | % Timeout while expanding a set comprehension, closure, forall, etc. |
| 170 | | additional_configuration(40, swi_expected_failure). |
| 171 | | additional_configuration(496, swi_expected_failure). |
| 172 | | additional_configuration(979, swi_expected_failure). |
| 173 | | additional_configuration(980, swi_expected_failure). |
| 174 | | additional_configuration(982, swi_expected_failure). |
| 175 | | additional_configuration(1059, swi_expected_failure). |
| 176 | | additional_configuration(1101, swi_expected_failure). |
| 177 | | additional_configuration(1108, swi_expected_failure). |
| 178 | | additional_configuration(1331, swi_expected_failure). |
| 179 | | additional_configuration(1332, swi_expected_failure). |
| 180 | | additional_configuration(1384, swi_expected_failure). |
| 181 | | additional_configuration(1562, swi_expected_failure). % not always a time-out |
| 182 | | additional_configuration(1679, swi_expected_failure). |
| 183 | | additional_configuration(1739, swi_expected_failure). |
| 184 | | additional_configuration(2014, swi_expected_failure). |
| 185 | | additional_configuration(2033, swi_expected_failure). |
| 186 | | additional_configuration(2128, swi_expected_failure). |
| 187 | | additional_configuration(2129, swi_expected_failure). |
| 188 | | additional_configuration(2385, swi_expected_failure). |
| 189 | | |
| 190 | | % Timeout during constants setup or transition |
| 191 | | additional_configuration(41, swi_expected_failure). |
| 192 | | additional_configuration(49, swi_expected_failure). |
| 193 | | additional_configuration(292, swi_expected_failure). |
| 194 | | additional_configuration(293, swi_expected_failure). |
| 195 | | additional_configuration(305, swi_expected_failure). |
| 196 | | additional_configuration(307, swi_expected_failure). |
| 197 | | additional_configuration(387, swi_expected_failure). |
| 198 | | additional_configuration(456, swi_expected_failure). |
| 199 | | additional_configuration(642, swi_expected_failure). % sometimes times out |
| 200 | | additional_configuration(708, swi_expected_failure). |
| 201 | | additional_configuration(710, swi_expected_failure). |
| 202 | | additional_configuration(1112, swi_expected_failure). |
| 203 | | additional_configuration(1157, swi_expected_failure). |
| 204 | | additional_configuration(1194, swi_expected_failure). |
| 205 | | additional_configuration(1222, swi_expected_failure). |
| 206 | | additional_configuration(1305, swi_expected_failure). |
| 207 | | additional_configuration(1316, swi_expected_failure). |
| 208 | | additional_configuration(1338, swi_expected_failure). |
| 209 | | additional_configuration(1393, swi_expected_failure). |
| 210 | | additional_configuration(1631, swi_expected_failure). |
| 211 | | additional_configuration(1634, swi_expected_failure). |
| 212 | | additional_configuration(1920, swi_expected_failure). |
| 213 | | additional_configuration(1976, swi_expected_failure). |
| 214 | | additional_configuration(2110, swi_expected_failure). |
| 215 | | additional_configuration(2185, swi_expected_failure). |
| 216 | | additional_configuration(2187, swi_expected_failure). |
| 217 | | additional_configuration(2189, swi_expected_failure). |
| 218 | | additional_configuration(2413, swi_expected_failure). |
| 219 | | |
| 220 | | % Timeout during model check, CBC deadlock check, etc. |
| 221 | | additional_configuration(324, swi_expected_failure). |
| 222 | | additional_configuration(1306, swi_expected_failure). |
| 223 | | additional_configuration(2399, swi_expected_failure). |
| 224 | | |
| 225 | | % Timeout during something else |
| 226 | | additional_configuration(1165, swi_expected_failure). |
| 227 | | %additional_configuration(1207, swi_expected_failure). |
| 228 | | additional_configuration(1611, swi_expected_failure). |
| 229 | | additional_configuration(2106, swi_expected_failure). |
| 230 | | |
| 231 | | % Trace replay fails |
| 232 | | additional_configuration(220, swi_expected_failure). |
| 233 | | additional_configuration(626, swi_expected_failure). % only on CI |
| 234 | | %additional_configuration(983, swi_expected_failure). % now seems to work |
| 235 | | additional_configuration(1105, swi_expected_failure). |
| 236 | | additional_configuration(1276, swi_expected_failure). |
| 237 | | additional_configuration(1394, swi_expected_failure). |
| 238 | | additional_configuration(1751, swi_expected_failure). |
| 239 | | additional_configuration(1886, swi_expected_failure). |
| 240 | | additional_configuration(1924, swi_expected_failure). |
| 241 | | additional_configuration(1925, swi_expected_failure). |
| 242 | | |
| 243 | | % Apparently bogus invariant violations found |
| 244 | | additional_configuration(654, swi_expected_failure). % caused by https://github.com/SWI-Prolog/swipl-devel/issues/1160 |
| 245 | | additional_configuration(1185, swi_expected_failure). % ditto |
| 246 | | additional_configuration(1207, swi_expected_failure). % time-out |
| 247 | | additional_configuration(1655, swi_expected_failure). % also caused by table bug in CLPFD of SWI, issue 1160 |
| 248 | | additional_configuration(2315, swi_expected_failure). % see test 654, SetRelLaws_NatBool |
| 249 | | |
| 250 | | % Predicate both true and false |
| 251 | | %additional_configuration(788, swi_expected_failure). % now seems to work |
| 252 | | |
| 253 | | % Did not get expected error |
| 254 | | additional_configuration(396, swi_expected_failure). % happens only on CI currently? |
| 255 | | |
| 256 | | % Unable to set up constants, but no timeout |
| 257 | | % additional_configuration(2151, swi_expected_failure). % was due to not detecting prob-ignore and missing double-quotes flag |
| 258 | | |
| 259 | | % Predicate unknown, but no timeout |
| 260 | | additional_configuration(1247, swi_expected_failure). |
| 261 | | |
| 262 | | % Errors from external function READ_CSV |
| 263 | | additional_configuration(1575, swi_expected_failure). |
| 264 | | |
| 265 | | % External functions HASH and hash use term_hash/2 |
| 266 | | % and so gives different hashes on SWI than on SICStus. |
| 267 | | additional_configuration(2182, swi_expected_failure). |
| 268 | | |
| 269 | | % ----------------------------------- |
| 270 | | |
| 271 | | % we can infer required extensions for a test by looking at probcli commands, preferences |
| 272 | | % but sometimes preferences are hidden in B model and/or in -evalt strings like -evalt :kodkod ... |
| 273 | | % test_requires_extension(TestNr,Categories,...) |
| 274 | | test_requires_extension(1538,_,kodkod_extension). |
| 275 | | test_requires_extension(1856,_,avl_ugraphs_extension). |
| 276 | | test_requires_extension(1935,_,xml2b_extension). |
| 277 | | test_requires_extension(1936,_,xml2b_extension). |
| 278 | | test_requires_extension(2039,_,wd_extension). |
| 279 | | test_requires_extension(2053,_,unsat_core_extension). |
| 280 | | test_requires_extension(2221,_,meta_interface_extension). |
| 281 | ? | test_requires_extension(_,Cats,Extension) :- member(Cat,Cats), test_category_requires_extension(Cat,Extension). |
| 282 | | |
| 283 | | % associate some test categories with extensions that are definitely required |
| 284 | | test_category_requires_extension(alloy,alloy2b_extension). |
| 285 | | %test_category_requires_extension(cache,cache_extension). % value_persistance |
| 286 | | test_category_requires_extension(bmc,symbolic_model_checker_extension). |
| 287 | | test_category_requires_extension(cache,probhash_extension). % cache needs probhash for machines |
| 288 | | test_category_requires_extension(cbc_tests,cbc_extension). |
| 289 | | test_category_requires_extension(chr,chr_extension). |
| 290 | | test_category_requires_extension(cse,cse_extension). |
| 291 | | test_category_requires_extension(cse_test,cse_extension). |
| 292 | | test_category_requires_extension(csp_test,cspm_extension). |
| 293 | | test_category_requires_extension(cspb,cspm_extension). |
| 294 | | test_category_requires_extension(ctl,ltl_extension). |
| 295 | | test_category_requires_extension(disprover,disprover_extension). |
| 296 | | test_category_requires_extension(dot,dot_extension). |
| 297 | | test_category_requires_extension(dot,meta_interface_extension). |
| 298 | | test_category_requires_extension(cdclt,cdclt_extension). |
| 299 | | test_category_requires_extension(enabling,cbc_extension). |
| 300 | | test_category_requires_extension(fairness,ltl_extension). |
| 301 | | test_category_requires_extension(hash,probhash_extension). |
| 302 | | test_category_requires_extension(json_trace_replay,json_extension). |
| 303 | | test_category_requires_extension(kodkod,kodkod_extension). |
| 304 | | test_category_requires_extension(latex,latex_extension). |
| 305 | | test_category_requires_extension(ltl,ltl_extension). |
| 306 | | test_category_requires_extension(ltsmin_test,ltsmin_extension). |
| 307 | | test_category_requires_extension(mcm_tests,cbc_extension). % mcm test case generation is in sap.pl |
| 308 | | % Previously we said that only operation_reuse_full requires opcache_extension. |
| 309 | | % But even with OPERATION_REUSE = TRUE (not full), |
| 310 | | % ProB gives a warning if opcache_extension is unavailable, |
| 311 | | % and the warning counts as an unexpected error and makes the tests fail. |
| 312 | | test_category_requires_extension(operation_reuse,opcache_extension). |
| 313 | | test_category_requires_extension(pge,pge_extension). |
| 314 | | test_category_requires_extension(pge_fast,pge_extension). |
| 315 | | test_category_requires_extension(por,por_extension). |
| 316 | | test_category_requires_extension(proz,fuzz_extension). |
| 317 | | test_category_requires_extension(random,random_permutations). |
| 318 | | test_category_requires_extension(reals,external_reals_extension). |
| 319 | | test_category_requires_extension(refinement,refinement_extension). |
| 320 | | test_category_requires_extension(regex,regexp_extension). |
| 321 | | test_category_requires_extension(satsolver_test,satsolver_extension). |
| 322 | | test_category_requires_extension(setlog,setlog_extension). |
| 323 | | test_category_requires_extension(smt,smtlib_extension). |
| 324 | | test_category_requires_extension(smt_solver_integration,smt_extension). |
| 325 | | test_category_requires_extension(symbolic_model_checker,symbolic_model_checker_extension). |
| 326 | | test_category_requires_extension(symmetry_test,symmetry_extension). |
| 327 | | test_category_requires_extension(tla,tla2b_extension). |
| 328 | | test_category_requires_extension(tlc,tlc4b_extension). |
| 329 | | test_category_requires_extension(visb,visb_extension). |
| 330 | | test_category_requires_extension(wd,wd_extension). |
| 331 | | test_category_requires_extension(xml,xml2b_extension). |
| 332 | | |
| 333 | | % ----------------------------------- |
| 334 | | |
| 335 | | cli_testcase(0, [unit], ['-selfcheck', '-strict', '-p', 'CLPFD', 'FALSE'], 'Unit tests'). |
| 336 | | cli_testcase(1, [unit], ['-selfcheck', '-strict', '-p', 'CLPFD', 'TRUE'], 'Unit tests (with CLPFD)'). |
| 337 | | cli_testcase(2, [unit], ['-selfcheck', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SYMBOLIC', 'TRUE'], 'Unit tests (with CLPDFD and SYMBOLIC)'). |
| 338 | | cli_testcase(3, [b_test], ['-t', '-strict', '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/SETPREF.mch', '-p', 'MAXINT', '1024', '-card', 'ID', '3'], 'check set MAXINT & card'). |
| 339 | | cli_testcase(4, [b_test], ['-t', '-strict', '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/DefinitionScopeOk.mch'], 'DEFINITION scope test'). |
| 340 | | cli_testcase(5, [b_test,forall], ['-t', '-strict', '../prob_examples/public_examples/B/FeatureChecks/ForAll_VariousVersions.mch'], 'For all test'). |
| 341 | | cli_testcase(6, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/NotMemberCheck.mch', '-t', '-strict', '-assertions', '-expcterr', virtual_time_out], 'Not member closures test'). |
| 342 | | cli_testcase(7, [bench], ['../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.mch', '-t', '-strict'], 'Carla Travel Agency trace check'). |
| 343 | | cli_testcase(8, [bench], ['../prob_examples/public_examples/B/Benchmarks/RouteIsSeq.mch', '-t', '-strict'], ''). |
| 344 | | cli_testcase(9, [bench], ['../prob_examples/public_examples/B/Benchmarks/Sets2.mch', '-t', '-strict'], ''). |
| 345 | | cli_testcase(10, [bench], ['../prob_examples/public_examples/B/Benchmarks/Doors.mch', '-t', '-strict'], ''). |
| 346 | | cli_testcase(11, [bench], ['../prob_examples/public_examples/B/Benchmarks/DSP0.mch', '-t', '-mc', '100', '-noinv', '-strict', '-nodead', '-expcterr', 'model_check_incomplete'], ''). |
| 347 | | cli_testcase(12, [bench], ['../prob_examples/public_examples/B/Benchmarks/DSP0_complicated_initialisation.mch', '-t', '-mc', '100', '-noinv', '-strict', '-nodead', '-expcterr', 'model_check_incomplete'], ''). |
| 348 | | cli_testcase(13, [bench], ['../prob_examples/public_examples/B/Benchmarks/CSM.mch', '-mc', '1000', '-strict', '-check_complete', '-cc', '341', '1229'], 'Model check CSM'). |
| 349 | | cli_testcase(14, [bench], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-t', '-mc', '100', '-strict', '-check_complete', '-cc', '36', '121'], 'Model check scheduler'). |
| 350 | | cli_testcase(15, [bench], ['../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', '-t', '-mc', '100', '-expcterr', 'model_check_incomplete', '-strict'], 'Model check phonebook7'). |
| 351 | | cli_testcase(16, [bench], ['../prob_examples/public_examples/B/Benchmarks/tictac.mch', '-mc', '100', '-noinv', '-nodead', '-expcterr', 'model_check_incomplete', '-strict'], ''). |
| 352 | | cli_testcase(17, [bench,case], ['../prob_examples/public_examples/B/Benchmarks/Teletext_bench.mch', '-mc', '100', '-check_complete', '-cc', '14', '122', '-strict'], 'Teletext benchmark'). |
| 353 | | cli_testcase(18, [bench], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-t', '-strict'], ''). |
| 354 | | cli_testcase(19, [bench], ['../prob_examples/public_examples/B/BZTT/TestBZTT_Data.mch', '-mc', '100', '-check_complete', '-cc', '26', '176', '-strict', '-l', 'log/TestBZTT_Data.log'], ''). |
| 355 | | cli_testcase(20, [performance_tests], ['../prob_examples/public_examples/B/Daniel/Kodkod/Power2Nr.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE', '-aa', '4', '0', '0'], ''). |
| 356 | | cli_testcase(21, [performance_tests], ['../prob_examples/public_examples/B/Daniel/Kodkod/Power2Nr.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE', '-ma', '4', '0', '0'], ''). |
| 357 | | cli_testcase(22, [performance_tests], ['../prob_examples/public_examples/B/Daniel/Kodkod/StarTopologySingleSol.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], ''). |
| 358 | | cli_testcase(23, [performance_tests,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/conc_seq_test.mch', '-strict', '-t'], 'sequence concatenation test'). |
| 359 | | cli_testcase(24, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/LargeSets/PartialFunCheck.mch', '-strict', '-t'], ''). |
| 360 | | cli_testcase(25, [performance_tests,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAll_NATURAL.mch', '-strict', '-t'], ''). |
| 361 | | cli_testcase(26, [performance_tests,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion.mch', '-strict', '-t', '-mc', 100, '-p', 'MAX_INITIALISATIONS', 10, '-cc', 15, 49], 'Forall quantifier test'). |
| 362 | | cli_testcase(27, [performance_tests,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansian_Cartesian.mch', '-strict', '-t', '-assertions'], ''). |
| 363 | | cli_testcase(28, [performance_tests,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion_Cartesian2.mch', '-strict', '-t', '-assertions', '-p', 'CLPFD', 'FALSE'], ''). |
| 364 | | cli_testcase(29, [performance_tests,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion_Cartesian2.mch', '-strict', '-t', '-assertions', '-p', 'CLPFD', 'TRUE'], ''). |
| 365 | | cli_testcase(30, [performance_tests,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion_Cartesian3.mch', '-strict', '-t', '-assertions'], ''). |
| 366 | | cli_testcase(31, [performance_tests], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 367 | | '../prob_examples/public_examples/B/PerformanceTests/LargeSets/SeqCheck.mch', '-strict', '-t'], 'checks on large sequences'). |
| 368 | | cli_testcase(32, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SetLogInefficiencies.mch', '-t', '-strict'], ''). |
| 369 | | cli_testcase(33, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SetLogInefficiencies2.mch', |
| 370 | | '-p', 'SMT', 'TRUE', '-t', '-strict'], 'A complex propagation test with sets of cardinality 1'). % TO DO: also get to work without SMT mode |
| 371 | | cli_testcase(34, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SetLogInefficiencies3.mch', '-p', 'SMT', 'TRUE', '-t', '-strict'], 'A complex propagation test with many sets of cardinality 4'). % TO DO: also get to work efficiently without SMT mode; times-out on Windows runner without SMT |
| 372 | | cli_testcase(35, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteClosures.mch', '-strict', '-t'], 'check whether ProB deals adequately with some infinite closures 1'). |
| 373 | | cli_testcase(36, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteClosures2.mch', '-strict', '-t'], 'check whether ProB deals adequately with some infinite closures 2'). |
| 374 | | cli_testcase(37, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteAbsSqrt.mch', '-strict', '-t'], 'InfiniteAbsSqrt'). |
| 375 | | cli_testcase(38, [performance_tests,card], ['../prob_examples/public_examples/B/PerformanceTests/InfCardChecks.mch', '-p', 'CLPFD', 'TRUE', '-strict', '-t'], 'InfCardChecks'). |
| 376 | | cli_testcase(39, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ID_Checks.mch', '-strict', '-t', '-assertions'], ''). |
| 377 | | cli_testcase(40, [performance_tests,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/DirectProductPerformance.mch', '-strict', '-init', '-p', 'TIME_OUT', '20000'], 'Test the performance of the direct product operator.'). |
| 378 | | cli_testcase(41, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/DirectProductPerformance.mch', '-strict', '-init', '-p', 'SYMBOLIC', 'TRUE', '-p', 'TIME_OUT', '15000'], ''). |
| 379 | | cli_testcase(42, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/Sieve.mch', '-mc', '1000', '-strict', '-expcterr', 'goal_found', '-l', 'log/Sieve.log', '-expcterr', virtual_time_out], ''). |
| 380 | | % StartSieve generates virtual_time_out |
| 381 | | cli_testcase(43, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/BinomialCoefficients.mch', '-t', '-strict'], ''). |
| 382 | | cli_testcase(44, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/SieveAlternate.mch', '-mc', '1000', '-strict', '-expcterr', 'goal_found', '-l', 'log/SieveAlternate.log', '-expcterr', virtual_time_out], ''). |
| 383 | | cli_testcase(45, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/GraphIso/CheckGraphIsomorphism.mch', '-t', '-strict', '-l', 'log/CheckGraphIsomorphism.log'], ''). |
| 384 | | cli_testcase(46, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/GraphIso/CheckLargeGraphIsomorphismAsConstants.mch', '-t', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '5000'], ''). |
| 385 | | cli_testcase(47, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/Theories/FiniteSequences1.mch', '-t', '-mc', '100', '-expcterr', 'model_check_incomplete', '-strict'], ''). |
| 386 | | cli_testcase(48, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/Theories/FiniteSequences2.mch', '-t', '-mc', '100', '-expcterr', 'model_check_incomplete', '-strict'], ''). |
| 387 | | cli_testcase(49, [performance_tests,sat,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/SATLIB/flat200-90.mch', '-t', '-p', 'STATIC_ORDERING', 'TRUE', '-strict', '-p', 'TIME_OUT', '15000', '-l', 'log/SAT_flat200-90.log'], 'SAT test (flat200-90)'). |
| 388 | | cli_testcase(50, [parser,performance_tests,sat], ['../prob_examples/public_examples/B/PerformanceTests/SATLIB/sudoku.mch', '-init', '-p', 'STATIC_ORDERING', 'TRUE', '-strict', '-p', 'TIME_OUT', '60000'], 'Large machine to test the parser/JVM, skipped on Windows because the Windows build bot can not reserve enough memory.'). % used to require LARGE_JVM |
| 389 | | cli_testcase(51, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/MaxPropagation.mch', '-strict', '-t'], ''). |
| 390 | | cli_testcase(52, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/MaxPropagation2.mch', '-strict', '-t'], ''). |
| 391 | | cli_testcase(53, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/SetMembershipInference.mch', '-strict', '-t'], ''). |
| 392 | | cli_testcase(54, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/SetMembershipReification.mch', '-strict', '-t'], ''). |
| 393 | | cli_testcase(55, [performance_tests,codespeed], ['../prob_examples/public_examples/B/Demo/SortByPermutation_v2.mch', '-strict', '-t','-p', 'TIME_OUT', '7000'], 'Sort by permutation'). |
| 394 | | cli_testcase(56, [performance_tests,codespeed], ['../prob_examples/public_examples/B/IPD/colouring/GraphColouringNAT2.mch', '-t', '-strict'], 'Graph colouring'). |
| 395 | | cli_testcase(57, [performance_tests,codespeed], ['../prob_examples/public_examples/EventBPrologPackages/Puzzles/Instance_small_60_400_9_ctx.eventb', '-init', '-strict', '-p', 'CLPFD', 'TRUE'], ''). |
| 396 | | cli_testcase(58, [performance_tests], ['../prob_examples/public_examples/B/BZTT/PO_Scheduler.mch', '-mc', '100', '-check_complete', '-cc', '7', '6', '-strict', '-t', '-nodead'], 'Scheduler variation'). |
| 397 | | cli_testcase(59, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/IDL_SimpleUnsat.mch', '-strict', '-init', '-expcterr', 'setup_constants_fails'], ''). |
| 398 | | cli_testcase(60, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/int_completeness1.mch', '-strict', '-init', '-p', 'CLPFD', 'TRUE', '-expcterr', 'setup_constants_fails'], ''). |
| 399 | | cli_testcase(61, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/int_completeness1_event.mch', '-strict', '-p', 'CLPFD', 'TRUE', '-t'], ''). |
| 400 | | cli_testcase(62, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/SquareEquivalenceProblem.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE', '-mc', '10', '-cc', '2', '2'], ''). |
| 401 | | cli_testcase(63, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/clpfd_constraint_checks/IntegerComprSets.mch', '-strict', '-t'], ''). |
| 402 | | cli_testcase(64, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SeqEnumWithLargeMAXINT.mch', '-strict', '-t'], ''). |
| 403 | | cli_testcase(65, [performance_tests,sequences,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/SequenceSolving.mch', '-strict', '-t'], 'SequenceSolving'). |
| 404 | | cli_testcase(66, [performance_tests,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/SAT_Tests/SubsetReificationTest.mch', '-strict', '-t'], ''). |
| 405 | | cli_testcase(67, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/monitor2.mch', '-mc', '100', '-cc', '15', '92', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], ''). |
| 406 | | cli_testcase(68, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/Symetric.mch', '-mc', '100', '-cc', '2', '6', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], ''). |
| 407 | | cli_testcase(69, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', '-mc', '100', '-cc', '11', '47', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], ''). |
| 408 | | cli_testcase(70, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', '-mc', '100', '-cc', '36', '156', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'off', '-strict'], ''). |
| 409 | | cli_testcase(71, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', '-mc', '100', '-cc', '11', '47', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'hash', '-strict'], ''). |
| 410 | | cli_testcase(72, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', '-mc', '100', '-cc', '36', '73', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'flood', '-strict'], ''). |
| 411 | | cli_testcase(73, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '150', '-cc', '145', '447', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'off', '-strict'], ''). |
| 412 | | cli_testcase(74, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '100', '-cc', '29', '92', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], 'scheduler1.ref with nauty (3)'). % used to be 94 instead of 92 transitions; change of INITIALISATION argument treatment April 2016 |
| 413 | | cli_testcase(75, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '100', '-cc', '29', '92', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'hash', '-strict'], 'scheduler1.ref with hash (3)'). % used to be 94 instead of 92 transitions; change of INITIALISATION argument treatment April 2016 |
| 414 | | cli_testcase(76, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '150', '-cc', '145', '210', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'flood', '-strict'], ''). |
| 415 | | cli_testcase(77, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '100', '-cc', '51', '208', '-p', 'DEFAULT_SETSIZE', '4', '-p', 'SYMMETRY_MODE', 'nauty', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with nauty (4)'). % used to be 211 instead of 208 transitions; change of INITIALISATION argument treatment April 2016 |
| 416 | | cli_testcase(78, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '100', '-cc', '51', '208', '-p', 'DEFAULT_SETSIZE', '4', '-p', 'SYMMETRY_MODE', 'hash', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with hash (4)'). % used to be 211 instead of 208 transitions; change of INITIALISATION argument treatment April 2016 |
| 417 | | cli_testcase(79, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '1000', '-cc', '81', '401', '-p', 'DEFAULT_SETSIZE', '5', '-p', 'SYMMETRY_MODE', 'nauty', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with nauty (5)'). % used to be 405 transitions, see above |
| 418 | | cli_testcase(80, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '1000', '-cc', '81', '401', '-p', 'DEFAULT_SETSIZE', '5', '-p', 'SYMMETRY_MODE', 'hash', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with hash (5)'). % used to be 405 transitions, see above |
| 419 | | cli_testcase(81, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '1000', '-cc', '120', '696', '-p', 'DEFAULT_SETSIZE', '6', '-p', 'SYMMETRY_MODE', 'nauty', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with nauty (6)'). % used to be 701 transitions, see above |
| 420 | | cli_testcase(82, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '1000', '-cc', '120', '696', '-p', 'DEFAULT_SETSIZE', '6', '-p', 'SYMMETRY_MODE', 'hash', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with hash (6)'). % used to be 701 transitions, see above |
| 421 | | cli_testcase(83, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '1000', '-cc', '169', '1121', '-p', 'DEFAULT_SETSIZE', '7', '-p', 'SYMMETRY_MODE', 'nauty', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with nauty (7)'). % used to be 1127 transitions, see above |
| 422 | | cli_testcase(84, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '1000', '-cc', '169', '1121', '-p', 'DEFAULT_SETSIZE', '7', '-p', 'SYMMETRY_MODE', 'hash', '-p', 'MAX_INITIALISATIONS', '20', '-p', 'MAX_OPERATIONS', '120', '-strict'], 'scheduler1.ref with hash (7)'). % used to be 1127 transitions, see above |
| 423 | | cli_testcase(85, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/PairRelation.mch', '-mc', '100', '-cc', '39', '173', '-p', 'DEFAULT_SETSIZE', '3', '-strict'], ''). |
| 424 | | cli_testcase(86, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/PairRelation.mch', '-mc', '100', '-cc', '11', '47', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], ''). |
| 425 | | cli_testcase(87, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/PairRelation.mch', '-mc', '100', '-cc', '39', '75', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'flood', '-strict'], ''). |
| 426 | | cli_testcase(88, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/SetRelation.mch', '-mc', '100', '-cc', '38', '172', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'off', '-strict'], ''). |
| 427 | | cli_testcase(89, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/SetRelation.mch', '-mc', '100', '-cc', '10', '46', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], ''). |
| 428 | | cli_testcase(90, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/SetRelation.mch', '-mc', '100', '-cc', '38', '74', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'flood', '-strict'], ''). |
| 429 | | cli_testcase(91, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/RussianPostalPuzzle.mch', '-mc', '1000', '-cc', '81', '177', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'off', '-nogoal', '-strict'], ''). |
| 430 | | cli_testcase(92, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/RussianPostalPuzzle.mch', '-mc', '1000', '-cc', '48', '105', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'nauty', '-nogoal', '-strict'], ''). |
| 431 | | cli_testcase(93, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/RussianPostalPuzzle.mch', '-mc', '1000', '-cc', '48', '105', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'hash', '-nogoal', '-strict', '-expcterr', 'model_check_incomplete'], ''). |
| 432 | | cli_testcase(94, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/RussianPostalPuzzle.mch', '-mc', '1000', '-cc', '81', '138', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'flood', '-nogoal', '-strict'], ''). |
| 433 | | cli_testcase(95, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/TicTacToe_SimplerSym.mch', '-mc', '1500', '-cc', '1450', '4547', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'hash', '-nogoal', '-nodead', '-strict', '-expcterr', 'model_check_incomplete'], ''). |
| 434 | | cli_testcase(96, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/TicTacToe_SimplerSym.mch', '-mc', '1500', '-cc', '1450', '4547', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'nauty', '-nogoal', '-nodead', '-strict'], ''). |
| 435 | | cli_testcase(97, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/TicTacToe_SimplerSym.mch', '-mc', '6000', '-cc', '5480', '8577', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'flood', '-nogoal', '-nodead', '-strict'], ''). |
| 436 | | cli_testcase(98, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/USB_4Endpoints.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'nauty', '-cc', '355', '11220', '-strict'], ''). |
| 437 | | cli_testcase(99, [symmetry_test,codespeed], ['../prob_examples/public_examples/B/SymmetryReduction/USB_4Endpoints.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'hash', '-cc', '355', '11220', '-strict'], 'USB with Hash symmetry'). |
| 438 | | cli_testcase(100, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/USB_4Endpoints.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'flood', '-cc', '694', '11572', '-strict'], ''). |
| 439 | | cli_testcase(101, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/USB_4Endpoints.mch', '-mc', '10000', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'hash', '-cc', '3013', '97730', '-strict', '-expcterr', 'model_check_incomplete'], ''). |
| 440 | | cli_testcase(102, [symmetry_test,proz], ['../prob_examples/public_examples/Z/Derrick/video_club_abz08.fuzz', '-strict', '-card', 'TITLE', '2', '-card', 'PERSON', '2', '-mc', '100000', '-p', 'SYMMETRY_MODE', 'hash', '-cc', '113', '596', '-expcterr', 'model_check_incomplete', '-expcterr', virtual_time_out], ''). |
| 441 | | cli_testcase(103, [symmetry_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch', '-mc', '10000', '-p', 'SYMMETRY_MODE', 'off', '-cc', '731', '2187', '-nogoal', '-strict'], ''). |
| 442 | | cli_testcase(104, [symmetry_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch', '-mc', '10000', '-p', 'SYMMETRY_MODE', 'hash', '-cc', '367', '1095', '-nogoal', '-strict'], 'Hanoi6Sym with hash'). % used to be 1096 transitions; changed in April 2016 due to INITIALISATION arg treatment change |
| 443 | | cli_testcase(105, [symmetry_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch', '-mc', '10000', '-p', 'SYMMETRY_MODE', 'nauty', '-cc', '367', '1095', '-nogoal', '-strict'], 'Hanoi6Sym with nauty'). % was also 1096 transitions, see above |
| 444 | | cli_testcase(106, [symmetry_test,tickets], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/DiningCryptographers.mch', '-mc', '100', '-cc', '65', '96', '-p', 'MAX_INITIALISATIONS', '100', '-p', 'SYMMETRY_MODE', 'off', '-strict'], ''). |
| 445 | | cli_testcase(107, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/DiningCryptographers.mch', '-mc', '100', '-cc', '65', '96', '-p', 'MAX_INITIALISATIONS', '100', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], ''). |
| 446 | | cli_testcase(108, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/DiningCryptographers.mch', '-mc', '100', '-cc', '65', '96', '-p', 'MAX_INITIALISATIONS', '100', '-p', 'SYMMETRY_MODE', 'hash', '-strict'], ''). |
| 447 | | cli_testcase(109, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/Fraikin/Library_FullSym.mch', '-mc', '10000', '-cc', '1158', '12064', '-p', 'MAX_INITIALISATIONS', '100', '-p', 'SYMMETRY_MODE', 'hash', '-strict', '-expcterr', 'model_check_incomplete'], ''). |
| 448 | | cli_testcase(110, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '2', '-mc', '10000', '-strict', '-nodead', '-cc', '149', '248', '-expcterr', 'model_check_incomplete'], ''). |
| 449 | | cli_testcase(111, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '2', '-mc', '10000', '-strict', '-nodead', '-cc', '82', '136', '-p', 'SYMMETRY_MODE', 'nauty', '-expcterr', 'model_check_incomplete'], ''). % used to be 137 transitions; changed in April 2016 due to INITIALISATION arg treatment change |
| 450 | | cli_testcase(112, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '2', '-mc', '10000', '-strict', '-nodead', '-cc', '82', '136', '-p', 'SYMMETRY_MODE', 'hash', '-expcterr', 'model_check_incomplete'], ''). % ditto |
| 451 | | cli_testcase(113, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '2', '-mc', '10000', '-strict', '-nodead', '-cc', '149', '204', '-p', 'SYMMETRY_MODE', 'flood', '-expcterr', 'model_check_incomplete'], ''). |
| 452 | | cli_testcase(114, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '3', '-mc', '10000', '-strict', '-nodead', '-cc', '144', '331', '-p', 'SYMMETRY_MODE', 'nauty', '-expcterr', 'model_check_incomplete'], '').% used to be 332 transitions; changed in April 2016 due to INITIALISATION arg treatment change |
| 453 | | cli_testcase(115, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '3', '-mc', '10000', '-strict', '-nodead', '-cc', '144', '331', '-p', 'SYMMETRY_MODE', 'hash', '-expcterr', 'model_check_incomplete'], ''). % ditto |
| 454 | | cli_testcase(116, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '4', '-mc', '10000', '-strict', '-nodead', '-cc', '360', '1093', '-p', 'SYMMETRY_MODE', 'nauty', '-expcterr', 'model_check_incomplete'], ''). |
| 455 | | cli_testcase(117, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-p', 'DEFAULT_SETSIZE', '4', '-mc', '10000', '-strict', '-nodead', '-cc', '360', '1093', '-p', 'SYMMETRY_MODE', 'hash' , '-expcterr', 'model_check_incomplete'], ''). |
| 456 | | cli_testcase(118, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb', '-p', 'DEFAULT_SETSIZE', '3', '-mc', '10000', '-strict', '-nodead', '-cc', '1339', '3786', '-p', 'SYMMETRY_MODE', 'hash' , '-expcterr', 'model_check_incomplete'], ''). % used to be 3787 transitions; changed in April 2016 due to INITIALISATION arg treatment change |
| 457 | | cli_testcase(119, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb', '-p', 'DEFAULT_SETSIZE', '3', '-mc', '10000', '-strict', '-nodead', '-cc', '1339', '3786', '-p', 'SYMMETRY_MODE', 'nauty', '-expcterr', 'model_check_incomplete'], ''). % used to be 3787 transitions; changed in April 2016 due to INITIALISATION arg treatment change |
| 458 | | cli_testcase(120, [symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb', '-p', 'DEFAULT_SETSIZE', '3', '-mc', '10000', '-strict', '-nodead', '-cc', '3893', '10970', '-p', 'SYMMETRY_MODE', 'off', '-expcterr', 'model_check_incomplete'], ''). |
| 459 | | cli_testcase(121, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/PhilRing.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'hash', '-cc', '8', '18', '-strict' , '-expcterr', 'model_check_incomplete'], ''). |
| 460 | | cli_testcase(122, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/PhilRing.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'nauty', '-cc', '8', '18', '-strict'], ''). |
| 461 | | cli_testcase(123, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/PhilRing.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'nauty', '-cc', '13', '46', '-strict'], ''). % used to be 47 transitions; changed in April 2016 due to INITIALISATION arg treatment change |
| 462 | | cli_testcase(124, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/PhilRing.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'hash', '-cc', '13', '46', '-strict' , '-expcterr', 'model_check_incomplete'], ''). % ditto |
| 463 | | cli_testcase(125, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/PhilRing.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '5', '-p', 'SYMMETRY_MODE', 'nauty', '-cc', '53', '342', '-strict', '-expcterr', 'model_check_incomplete'], ''). % used to be 345 transitions; changed in April 2016 due to INITIALISATION arg treatment change |
| 464 | | cli_testcase(126, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/PhilRing.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '5', '-p', 'SYMMETRY_MODE', 'hash', '-cc', '53', '342', '-strict' , '-expcterr', 'model_check_incomplete'], ''). % ditto |
| 465 | | cli_testcase(127, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/TestValidation_ctx.eventb', '-init', '-aa', '10', '0', '0', '-strict'], 'Assertion validation on Event-B model'). % 17.11.2018: there were 11 assertions; now that labels are respected there are 10 |
| 466 | | cli_testcase(128, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_1_mch.eventb', '-t', '-strict', '-expcterr', virtual_time_out], ''). |
| 467 | | cli_testcase(129, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_2_mch.eventb', '-t', '-p', 'CLPFD', 'FALSE', '-strict'], ''). |
| 468 | | cli_testcase(130, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_2_mch.eventb', '-t', '-p', 'CLPFD', 'TRUE', '-strict'], ''). |
| 469 | | cli_testcase(131, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_3_0_mch.eventb', '-t', '-strict'], ''). |
| 470 | | cli_testcase(132, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_4_0_mch.eventb', '-t', '-strict'], ''). |
| 471 | | cli_testcase(133, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Records/SampleThreeRecordsTranslated.mch', '-t', '-strict', '-mc', '100', '-cc', '4', '6'], 'Check record translation'). |
| 472 | | cli_testcase(134, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Records/INTEGER_Record.mch', '-t', '-strict', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE'], ''). |
| 473 | | cli_testcase(135, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Test1.0/Testid_mch.eventb', '-t', '-strict', '-pref_group', integer, int32, '-p', 'CLPFD', 'TRUE'], ''). |
| 474 | | cli_testcase(136, [eventb_test,hash], ['../prob_examples/public_examples/EventBPrologPackages/sieve.eventb', '-t', '-strict', '-mc', '1000', '-check_complete', '-cc', '33', '33', '-strict', |
| 475 | | '--hash64', 177433764074139889 % used to be 142217803204665821 until Sep 9th 2021 until state packing adapted |
| 476 | | ], 'Complete model check of Sieve'). |
| 477 | | cli_testcase(137, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_0.eventb', '-t', '-strict'], ''). |
| 478 | | cli_testcase(138, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_1.eventb', '-t', '-strict'], ''). |
| 479 | | cli_testcase(139, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_3.eventb', '-t', '-strict'], ''). |
| 480 | | cli_testcase(140, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-t', '-strict'], ''). |
| 481 | | cli_testcase(141, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/SET_Game/SET_Game_mch.eventb', '-t', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'MAX_OPERATIONS', 93], ''). |
| 482 | | cli_testcase(142, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Stefan_SecureBuilding/M21_mch.eventb', '-mc', '10000', '-t', '-check_complete', '-cc', '11', '80', '-strict'], 'Event-B Secure Building'). |
| 483 | | cli_testcase(143, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas.eventb', '-mc', '200', '-t', '-strict', '-noass', '-expcterr', 'model_check_incomplete'], 'Abrial Train 4'). |
| 484 | | cli_testcase(144, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Test1.0/Testid_mch.eventb', '-t', '-strict', '-p', 'MAXINT', '99999', '-p', 'MININT', '-99999', '-p', 'CLPFD', 'TRUE'], ''). |
| 485 | | cli_testcase(145, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Test1.0/Testprj_mch.eventb', '-t', '-strict', '-p', 'MAXINT', '99999', '-p', 'MININT', '-99999'], ''). |
| 486 | | cli_testcase(146, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Test1.0/TestPartition_mch.eventb', '-t', '-strict'], 'Partition for Event-B'). |
| 487 | | cli_testcase(147, [eventb_test], ['../prob_examples/public_examples/B/EventB_AtelierB/Lift.sys', '-t', '-strict'], ''). |
| 488 | | cli_testcase(148, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TestMC_m1_mch.eventb', '-mc', '1000', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:evt1:simulation_error'], 'Test simulation error'). |
| 489 | | cli_testcase(149, [eventb_test,hash], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/countdown_r_mch.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-cc', '7', '7', '--hash64', 714084921427841469], ''). |
| 490 | | cli_testcase(150, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/anticipated_grd_error.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:decr:variant_negative'], ''). |
| 491 | | cli_testcase(151, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/anticipated_var_error.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:inc:invalid_variant'], ''). |
| 492 | | cli_testcase(152, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/anticipated_svar_error.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:add:invalid_variant'], ''). |
| 493 | | cli_testcase(153, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/convergent_grd_error.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:decr:variant_negative'], ''). |
| 494 | | cli_testcase(154, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/convergent_var_error.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:decr:invalid_variant'], ''). |
| 495 | | cli_testcase(155, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/convergent_svar_error.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:do_nothing:invalid_variant'], ''). |
| 496 | | cli_testcase(156, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/variant_integer.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-cc', '8', '19'], 'Event-B variant check'). |
| 497 | | cli_testcase(157, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/variant_set.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-cc', '17', '97'], ''). |
| 498 | | cli_testcase(158, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Merging/merging_R2.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-cc', '12', '11'], ''). |
| 499 | | cli_testcase(159, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TheoremsInGuardsOK.eventb', '-mc', '10', '-nodead', '-check_complete', '-cc', '5', '4', '-strict'], 'Theorems in guards'). |
| 500 | | cli_testcase(160, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TheoremsInGuardsKO.eventb', '-mc', '10', '-nodead', '-expcterr', 'event_error:inc:invalid_theorem_in_guard', '-strict'], ''). |
| 501 | | cli_testcase(161, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/CompareWithFDR/GenPrime.csp', '-t', '-strict'], ''). |
| 502 | | cli_testcase(162, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/buses.csp', '-t', '-strict'], ''). |
| 503 | | cli_testcase(163, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/Peterson_v2.csp', '-t', '-strict', '-mc',1000, '-cc', 215, 429], ''). |
| 504 | | cli_testcase(164, [csp_test], ['-cs', '../prob_examples/public_examples/CSP/mydemos/demo/mbuff.csp', '-t', '-strict'], ''). |
| 505 | | cli_testcase(165, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/crossing.csp', '-t', '-strict', '-mc', '3910', '-check_complete', '-cc', '3933', '9367'], 'CSP crossing'). |
| 506 | | cli_testcase(166, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/SetCompTests.csp', '-t', '-strict'], ''). |
| 507 | | cli_testcase(167, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/SimpleCompLinkedPar.csp', '-t', '-strict', '-v'], 'CSP linked parallel test and exercise verbose flag in CSP mode'). |
| 508 | | cli_testcase(168, [csp_test], ['-cs', '../prob_examples/public_examples/CSP/mydemos/SequenceComprTests2.csp', '-t', '-strict'], 'Sequence comprehension in CSP'). |
| 509 | | cli_testcase(169, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/BigUnionInterTests.csp', '-t', '-strict'], ''). |
| 510 | | cli_testcase(170, [csp_test], ['../prob_examples/public_examples/B/Tickets/299/faust_deadlock.csp', '-mc', '100000', '-strict', '-expcterr', 'deadlock'], ''). |
| 511 | | cli_testcase(171, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/LargeStateSpace.csp', |
| 512 | | '-silent', '-mc', '999999', '-cc', '101102', '101101', '-strict', '-expcterr', 'deadlock'], 'Long counter-example trace'). |
| 513 | | cli_testcase(172, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/RenameRecordPattern.csp', '-mc', '999999', '-t', '-check_complete', '-cc', '4', '4'], ''). |
| 514 | | cli_testcase(173, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/RenameRecordPattern2.csp', '-t', '-assertions', '-strict'], ''). |
| 515 | | cli_testcase(174, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/SimpleRefTest.csp', '-assertions', '-strict'], ''). |
| 516 | | cli_testcase(175, [csp_test], ['../prob_examples/public_examples/CSP/fontaine/RecDataType.csp', '-t', '-strict'], ''). |
| 517 | | cli_testcase(176, [csp_test], ['../prob_examples/public_examples/CSP/fontaine/RecDataTypeFunctions.csp', '-t', '-strict'], ''). |
| 518 | | cli_testcase(177, [csp_test], ['../prob_examples/public_examples/CSP/simple/InSituRefChecks.csp', '-csp_assertion', 'Q [F= MAIN', '-csp_assertion', 'MAIN [F= Q', '-csp_assertion', 'Q [T= R', '-csp_assertion', 'R [F= Q', '-cc', 9, 20, '-strict'], ''). |
| 519 | | cli_testcase(178, [csp_test], ['../prob_examples/public_examples/CSP/simple/InSituRefChecks.csp', '-csp_assertion', 'Q [F= MAIN', '-csp_assertion', 'Q [F= R', '-strict', '-expcterr', 'refinement_check_fails'], ''). |
| 520 | | cli_testcase(179, [csp_test], ['../prob_examples/public_examples/CSP/UML_Compass/Microwave.csp', '-assertions', '-strict'], ''). |
| 521 | | cli_testcase(180, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/roscoe_section2-2.csp', '-assertions', '-strict'], ''). |
| 522 | | cli_testcase(181, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/ref_benchmarks/SimpleDeadlockCheck.csp', '-assertions', '-strict'], ''). |
| 523 | | cli_testcase(182, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/simple/DivChecks.csp', '-assertions', '-strict'], ''). |
| 524 | | cli_testcase(183, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/other/Ivo/Failure_Divergence_Tests.csp', '-assertions', '-strict'], ''). |
| 525 | | cli_testcase(184, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Deadlock_Skip_Tests.csp', '-assertions', '-strict'], ''). |
| 526 | | cli_testcase(185, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Failures_Tests.csp', '-assertions', '-strict'], ''). |
| 527 | | cli_testcase(186, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/AgentErrorsLetWithIn.csp', '-assertions', '-strict'], ''). |
| 528 | | cli_testcase(188, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Deterministic_simple_v2.csp', '-assertions', '-strict'], ''). |
| 529 | | cli_testcase(189, [csp_test,codespeed], ['../prob_examples/public_examples/CSP/ref_benchmarks/abp_chapter5_roscoe_bench.csp', '-assertions', '-strict'], 'Roscoe chapter 5 tests'). |
| 530 | | cli_testcase(190, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/ucs1.csp', '-assertions', '-strict'], ''). |
| 531 | | cli_testcase(191, [csp_test], ['../prob_examples/public_examples/CSP/simple/check_print.csp', '-t', '-strict'], ''). |
| 532 | | cli_testcase(192, [csp_test], ['../prob_examples/public_examples/CSP/simple/check_set_compr_pat.csp', '-t', '-mc', '1000', '-nodead', '-cc', '6', '10', '-strict'], ''). |
| 533 | | cli_testcase(193, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/failsim.csp', '-assertions', '-strict'], ''). |
| 534 | | cli_testcase(194, [typechecker_test], ['../prob_examples/public_examples/B/Tickets/305/Environment.mch', '-t', '-strict'], ''). |
| 535 | | cli_testcase(195, [typechecker_test], ['../prob_examples/public_examples/B/Tickets/308/Basic_Controller.mch', '-t', '-mc', '100', '-strict', '-expcterr', 'model_check_incomplete'], ''). |
| 536 | | cli_testcase(196, [typechecker_test,unit], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/expressions.mch', '-strict'], ''). |
| 537 | | |
| 538 | | % SBMF 2010 |
| 539 | | cli_testcase(197, [counterex], ['../prob_examples/public_examples/B/Counterexamples/CarlaTravelAgencyErr.mch', '-mc', '1000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF TravelAgency'). |
| 540 | | cli_testcase(198, [counterex], ['../prob_examples/public_examples/EventBPrologPackages/Stefan_SecureBuilding/M21_err3_mch.eventb', '-mc', '1000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF SecureBldg_M21_err3'). |
| 541 | | cli_testcase(199, [counterex], ['../prob_examples/public_examples/B/PerformanceTests/dfcheck_houseset.mch', '-mc', '1000', '-df', '-expcterr', 'invariant_violation', '-expcterr', 'invariant_violation', '-strict'], 'SBMF Houseset'). |
| 542 | | cli_testcase(200, [counterex], ['../prob_examples/public_examples/B/PerformanceTests/BreadthFirstTest.mch', '-mc', '100000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF BFTest'). |
| 543 | | cli_testcase(201, [counterex], ['../prob_examples/public_examples/B/PerformanceTests/DepthFirstTest.mch', '-mc', '100000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF DFTest'). |
| 544 | | cli_testcase(202, [counterex], ['../prob_examples/public_examples/B/SymmetryReduction/Peterson_err.mch', '-mc', '10000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF Peterson_err'). |
| 545 | | cli_testcase(203, [counterex], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-mc', '10000', '-strict', '-expcterr', 'deadlock'], ''). |
| 546 | | cli_testcase(204, [counterex], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M3_mch.eventb', '-mc', '10000', '-strict', '-expcterr', 'deadlock'], ''). |
| 547 | | cli_testcase(205, [counterex,infinite,total_function], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_infinite_int.eventb', '-p', 'CLPFD', 'TRUE', |
| 548 | | '-p', 'DEFAULT_SETSIZE', 3, |
| 549 | | '-t', '-expcterr', virtual_time_out ], 'Requires total function from NATURAL to TC_Type; now succeeds again'). % was '-expcterr', setup_constants_fails |
| 550 | | |
| 551 | | cli_testcase(206, [log_performance_tests,hash], ['../prob_examples/public_examples/EventBPrologPackages/sieve.eventb', '-mc', '1000', '-l', 'log/sieve.log', '-strict', '--hash64', 177433764074139889, % used to be 142217803204665821 until Sep 9 2021 |
| 552 | | '-check_complete', '-cc', '33', '33'], 'Sieve Event-B version'). |
| 553 | | cli_testcase(207, [puzzles_test], ['../prob_examples/public_examples/B/Demo/RussianPostalPuzzle.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). |
| 554 | | cli_testcase(208, [puzzles_test], ['../prob_examples/public_examples/B/Demo/TrainTorchPuzzle.mch', '-mc', '10000', '-nodead', '-expcterr', 'goal_found'], ''). |
| 555 | | cli_testcase(209, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/BlocksWorldGeneric.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). |
| 556 | | cli_testcase(210, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Farmer.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). |
| 557 | | cli_testcase(211, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). |
| 558 | | cli_testcase(212, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). |
| 559 | | cli_testcase(213, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi8.mch', '-mc', '10000', '-expcterr', 'goal_found'], 'Hanoi 8'). |
| 560 | | cli_testcase(214, [puzzles_test,symmetry_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch', '-p', 'SYMMETRY_MODE', 'hash', '-mc', '10000', '-expcterr', 'goal_found'], ''). |
| 561 | | cli_testcase(215, [puzzles_test,symmetry_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch','-p','SYMMETRY_MODE','hash','-mc','10000','-card','Stakes','4','-expcterr','goal_found'], 'Hanoi 6 with symmetry'). |
| 562 | | cli_testcase(216, [puzzles_test,symmetry_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi8Sym.mch', '-p', 'SYMMETRY_MODE', 'hash', '-mc', '10000', '-expcterr', 'goal_found'], 'Hanoi 8 with symmetry'). |
| 563 | | cli_testcase(217, [puzzles_test,xtl], ['-mc', '10000', '../prob_examples/public_examples/XTL/Hanoi.P', '-nodead', '-expcterr', 'xtl_error'], 'Test XTL Hanoi example'). |
| 564 | | cli_testcase(218, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/water.mch', '-mc', '10000', '-expcterr', 'goal_found', '-vv'], 'Water puzzle'). |
| 565 | | cli_testcase(219, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/LatinSquares.mch', '-mc', '10000', '-p', 'MAXINT', 5, '-expcterr', deadlock], 'Latin squares puzzle'). |
| 566 | | cli_testcase(220, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/CrewAllocationConstants.mch', '-t', '-p', 'TIME_OUT', '5000', '-p', 'CLPFD', 'FALSE'], 'Crew allocation puzzle (no CLPFD)'). |
| 567 | | cli_testcase(221, [puzzles_test,codespeed], ['../prob_examples/public_examples/B/Puzzles/CrewAllocationConstants.mch', '-t', '-p', 'TIME_OUT', '8000', '-p', 'CLPFD', 'TRUE'], 'Crew allocation puzzle'). |
| 568 | | cli_testcase(222, [b_test,cruise,codespeed,hash], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '25696', '-strict', '--hash64', 753243318772366897 , '-p', 'MAX_INITIALISATIONS', 5], 'Complete Model Check of Cruise Controller'). % 17.9.2021: adapted hash from 203058745203935766 for sorted order of variables, 8.12.2015: adapted hash from 212678735433640605 for new order of variables |
| 569 | | cli_testcase(223, [error_checks,wd,card], ['../prob_examples/public_examples/B/ErrorMachines/CardInfOverflow.mch', '-mc', '100', '-strict', '-expcterr', 'well_definedness_error', '-expcterr', 'invariant_violation', '-p', 'CLPFD', 'FALSE'], ''). |
| 570 | | cli_testcase(224, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TwoOpsSameName.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Two operations with the same name'). |
| 571 | | cli_testcase(225, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/PreCondViolated.mch', '-mc', '10', '-strict', '-expcterr', 'precondition_error'], 'Precondition violation detected'). |
| 572 | | cli_testcase(226, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/AssertCondViolated.mch', '-mc', '10', '-strict', '-expcterr', 'assert_error'], 'Assertion condition violation detected'). |
| 573 | | cli_testcase(227, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopOk.mch', '-t', '-mc', '30', '-p', 'MAX_OPERATIONS', 30, '-check_complete', '-cc', '11', '66'], 'While loop check'). |
| 574 | | cli_testcase(228, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopVariantError.mch', '-mc', '10', '-strict', '-expcterr', 'while_variant_error'], ''). |
| 575 | | cli_testcase(229, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopVariantErr2.mch', '-mc', '10', '-strict', '-expcterr', 'while_variant_error'], ''). |
| 576 | | cli_testcase(230, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopInvariantError.mch', '-mc', '10', '-strict', '-expcterr', 'while_invariant_violation'], ''). |
| 577 | | cli_testcase(231, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/FunLaws_wderror.mch', '-mc', '2500', '-strict', '-expcterr', 'well_definedness_error', |
| 578 | | '-opterr', invariant_violation % as of 17.3.2023 we also raise an invariant error here |
| 579 | | ], 'FunLaws with wd_error'). |
| 580 | | cli_testcase(232, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/DivByZero.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). |
| 581 | | cli_testcase(233, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/TestWDProblems_mch.eventb', '-init', '-animate', '1', '-strict', '-expcterr', 'well_definedness_error', '-expcterr', 'invariant_violation', '-expcterr', 'event_error:divby0:action_not_executable'], ''). |
| 582 | | cli_testcase(234, [error_checks,wd,exists], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/DivByZeroInsideNotExists.mch', '-strict', '-init', '-expcterr', 'well_definedness_error', '-expcterr', 'setup_constants_unknown'], ''). |
| 583 | | cli_testcase(235, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/PowerOfNegativeNumber.mch', '-strict', '-t', '-expcterr', 'well_definedness_error'], ''). |
| 584 | | cli_testcase(236, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedInter.mch', '-init', '-animate', '1', '-strict', '-expcterr', 'well_definedness_error','-expcterr', 'animate'], ''). |
| 585 | | cli_testcase(237, [error_checks,wd,quantified], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedBigINTER.mch', '-init', '-animate', '1', '-strict', '-expcterr', 'well_definedness_error','-expcterr', 'animate'], ''). |
| 586 | | cli_testcase(238, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/MaxOfEmptySet.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). |
| 587 | | cli_testcase(239, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/MinOfEmptySet.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). |
| 588 | | cli_testcase(240, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedSeqOperations/LastEmptySeq.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). |
| 589 | | cli_testcase(241, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedSeqOperations/FrontEmptySeq.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). |
| 590 | | cli_testcase(242, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/OpCalls/Caller.mch', '-strict', '-expcterr', 'precondition_error', '-mc', '100'], ''). |
| 591 | | cli_testcase(243, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/MultiAssignInit_bug.mch', '-t', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check that we detect when we assign a variable twice in the INITIALISATION'). |
| 592 | | cli_testcase(244, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError1.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 593 | | cli_testcase(245, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError2.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 594 | | cli_testcase(246, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError3.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 595 | | cli_testcase(247, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError4.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 596 | | cli_testcase(248, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/CstDefError1.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 597 | | cli_testcase(249, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/CstDefError2.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 598 | | cli_testcase(250, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/ParameterError1.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 599 | | cli_testcase(251, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TicTacToe_ErrOp.mch','-strict','-expcterr','type_error','-expcterr','load_main_file','-expcterr',bmachine_static_checks], ''). |
| 600 | | cli_testcase(252, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/AssignmentToParameterErr.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 601 | | cli_testcase(253, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/NoTypingForPara.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). |
| 602 | | cli_testcase(254, [error_checks,parser], ['../prob_examples/public_examples/B/ErrorMachines/RecursiveDefinition.mch', '-strict', '-expcterrpos', 'parse_error', 10, 0, '-expcterr', 'load_main_file'], ''). |
| 603 | | cli_testcase(255, [tickets,codespeed], ['../prob_examples/public_examples/B/Tickets/184/ModeProtocolMachine_mch.eventb', '-mc', '20000', '-noass', '-card', 'MANAGERS', '1', '-p', 'MAX_INITIALISATIONS', '10', '-p', 'CLPFD', 'TRUE', '-strict' , '-expcterr', 'model_check_incomplete'], 'ModeProtocol model check'). |
| 604 | | cli_testcase(256, [tickets,card], ['../prob_examples/public_examples/B/Tickets/184/ModeProtocolMachine_mch.eventb', '-mc', '200000', '-noass', '-p', 'MAX_INITIALISATIONS', '10', '-cs', '--goal', 'card(incoming(MnAOC))>0 & card(outgoing(MnAOC))>0', '-strict', '-expcterr', 'goal_found'], 'ModeProtocol searching for goal'). |
| 605 | | cli_testcase(257, [tickets], ['../prob_examples/public_examples/B/Tickets/102/Bijections_mch.eventb', '-t', '-mc', '1000', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 606 | | cli_testcase(258, [tickets], ['../prob_examples/public_examples/B/Tickets/102/PartialInjections_mch.eventb', '-t', '-mc', '1000', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 607 | | cli_testcase(259, [tickets], ['../prob_examples/public_examples/B/Tickets/102/PartialFunctions_mch.eventb', '-mc', '1000', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 608 | | cli_testcase(260, [tickets], ['../prob_examples/public_examples/B/Tickets/102/Relations_mch.eventb', '-mc', '1000', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 609 | | cli_testcase(261, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalFunctions_mch.eventb', '-mc', '1000', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 610 | | cli_testcase(262, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalInjections_mch.eventb', '-mc', '1000', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 611 | | cli_testcase(263, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalSurjections_mch.eventb', '-mc', '1000', '-t', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 612 | | cli_testcase(264, [tickets], ['../prob_examples/public_examples/B/Tickets/102/PartialSurjections_mch.eventb', '-mc', '1000', '-t', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 613 | | cli_testcase(265, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalRelations_mch.eventb', '-mc', '1000', '-t', '-nodead', '-check_complete', '-cc', '2', '1'], ''). |
| 614 | | cli_testcase(266, [tickets], ['../prob_examples/public_examples/B/Tickets/Sven1/AbsIntern.mch', '-t', '-strict'], ''). |
| 615 | | cli_testcase(267, [tickets], ['../prob_examples/public_examples/B/Tickets/Sven1/AbsInternCst.mch', '-t', '-strict'], ''). |
| 616 | | cli_testcase(268, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio1/MAX_BIT_VECTOR_DEFINITION_v2.mch', '-t', '-strict', '-properties'], ''). |
| 617 | | cli_testcase(269, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio1/MAX_BIT_VECTOR_DEFINITION_v2.mch', '-t', '-strict', '-p', 'SYMBOLIC', 'TRUE'], ''). |
| 618 | | cli_testcase(270, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio1/MAX_BIT_VECTOR_DEFINITION_v2.mch', '-t', '-strict', '-p', 'MAXINT', '100', '-properties', '-p', 'SYMBOLIC', 'TRUE'], ''). % , '-p', 'EXPAND_CLOSURES_FOR_STATE', 'FALSE' |
| 619 | | cli_testcase(271, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio1/MAX_BIT_VECTOR_DEFINITION_v2.mch', '-t', '-strict', '-p', 'MAXINT', '100', '-properties', '-p', 'SYMBOLIC', 'TRUE'], 'Valerio1 Ticket. Can not be run on windows due to memory restrictions.'). % , '-p', 'EXPAND_CLOSURES_FOR_STATE', 'TRUE' |
| 620 | | cli_testcase(272, [tickets], ['../prob_examples/public_examples/B/Tickets/Butler1/M2_mch.eventb', '-mc', '1000', '-strict', '-expcterr', 'invariant_violation', '-expcterr', 'event_error:Enter:simulation_error'], ''). |
| 621 | | cli_testcase(273, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/BV16_DEFINITION.mch', '-t', '-strict', '-properties', '-p', 'SYMBOLIC', 'TRUE', '-p', 'CLPFD', 'TRUE'], ''). % , '-p', 'EXPAND_CLOSURES_FOR_STATE', 'FALSE' |
| 622 | | cli_testcase(274, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/POWER2_v2.mch', '-init', '-strict', '-aa', '19', '0', '0'], ''). |
| 623 | | cli_testcase(275, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/POWER2.mch', '-init', '-strict', '-ma', '18', '0', '0'], ''). |
| 624 | | cli_testcase(276, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio4/FailingInit1.mch', '-init', '-strict', '-expcterr', 'initialisation_fails', '-expcterr', bmachine_static_checks], ''). |
| 625 | | cli_testcase(277, [tickets,wd], ['../prob_examples/public_examples/B/Tickets/Valerio4/FailingInit2.mch', '-init', '-strict', '-expcterr', 'initialisation_fails', '-expecterr', 'well_definedness_error', '-expcterr', bmachine_static_checks], ''). |
| 626 | | cli_testcase(278, [tickets,wd], ['../prob_examples/public_examples/B/Tickets/Valerio4/FailingInit3.mch', '-init', '-strict', '-expcterrpos', 'initialisation_fails', 10, 27, '-expcterr', 'well_definedness_error', '-expcterr', bmachine_static_checks], ''). |
| 627 | | cli_testcase(279, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio4/FailingInit4.mch', '-init', '-strict', '-expcterr', 'initialisation_fails', '-expcterr', bmachine_static_checks], ''). |
| 628 | | cli_testcase(280, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio4/FailingInit5.mch', '-init', '-strict', '-expcterr', 'initialisation_fails', '-expcterr', 'initialisation_fails', '-expcterr', bmachine_static_checks], ''). |
| 629 | | cli_testcase(281, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio6/Z80_Simple.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], ''). |
| 630 | | cli_testcase(282, [tickets], ['../prob_examples/public_examples/B/Tickets/Alstom1/TestBecomesElementOf.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], 'becomes element of cartesian product'). |
| 631 | | cli_testcase(283, [tickets], ['../prob_examples/public_examples/B/Tickets/Alstom1/TestPFBecomeSuch.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], 'becomes element of partial function'). |
| 632 | | cli_testcase(284, [tickets], ['../prob_examples/public_examples/B/Tickets/Alstom1/MAXINT_M1.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], ''). |
| 633 | | cli_testcase(285, [tickets], ['../prob_examples/public_examples/B/Tickets/93/lift.eventb', '-strict', '-t', '-expcterr', 'event_error:ScheduleGoingUp:invalid_theorem_in_guard', '-expcterr', 'event_error:ScheduleGoingUp:invalid_modification'], ''). |
| 634 | | cli_testcase(286, [tickets,exists], ['../prob_examples/public_examples/B/Tester/TestExistsLetExtraction.mch', '-t', '-strict'], ''). |
| 635 | | cli_testcase(287, [tickets,imp], ['../prob_examples/public_examples/B/Tickets/177/loop_invariant.imp', '-strict', '-t'], ''). |
| 636 | | cli_testcase(288, [tickets], ['../prob_examples/public_examples/B/Tickets/181/alstom_memory.mch', '-strict', '-t', '-mc', '100', '-check_complete', '-cc', '3', '8'], ''). |
| 637 | | cli_testcase(289, [laws,rel_fnc], ['../prob_examples/public_examples/EventBPrologPackages/Laws/ExplicitComputationsEventB_ctx.eventb', '-init', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '9500'], 'Many explicit computations which check that all operators work as expected on various concrete data (for Event-B).'). % increased time-out from 7 sec to 9.5 sec on 18th of May; TO DO: investigate whether we can reduce it again; % was slowed down by commit ab8c8667c43324c15b337c213c4140af6ec7d110 add propagate_result_to_input for domain operator |
| 638 | | cli_testcase(290, [laws], ['../prob_examples/public_examples/EventBPrologPackages/Laws/LawsEventBSpecific.eventb', '-t', '-mc', '1000', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'FALSE', |
| 639 | | '-opterr', virtual_time_out, % no longer required when x:NATURAL translated to x>=0 |
| 640 | | '-expcterr', 'model_check_incomplete'], 'LawsEventBSpecific (CLPFD FALSE)'). |
| 641 | | cli_testcase(291, [laws], ['../prob_examples/public_examples/B/Laws/EqualityLaws.mch', '-t', '-mc', '100000', '-nodead', '-cs', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], ''). |
| 642 | | cli_testcase(292, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/ExplicitComputations.mch', '-t', '-mc', '100000', '-nodead', '-cs', '-strict', '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', '7000'], 'Many explicit computations which check that all operators work as expected on various concrete data (CLPFD FALSE).'). |
| 643 | | cli_testcase(293, [laws,rel_fnc,cbc], ['../prob_examples/public_examples/B/Laws/ExplicitComputations.mch', '-t', '-mc', '100000', '-nodead', '-cs', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '9000'], 'Many explicit computations which check that all operators work as expected on various concrete data (CLPFD mode).'). |
| 644 | | cli_testcase(294, [laws], ['../prob_examples/public_examples/B/Laws/BoolLaws.mch', '-mc', '100000', '-nodead', '-cs', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Various laws about BOOL datatype and boolean connectives.'). |
| 645 | | cli_testcase(295, [laws], ['../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 646 | | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', |
| 647 | | '-mc', '100000', '-cs', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Various arithmetic laws.'). |
| 648 | | cli_testcase(296, [laws], ['../prob_examples/public_examples/B/Laws/NatRangeLaws.mch', '-mc', '100000', '-cs', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Laws about intervals etc.'). |
| 649 | | cli_testcase(297, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/RelLaws.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on relations.'). |
| 650 | | cli_testcase(298, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 651 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '600', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'FALSE'], 'Mathematical Laws about Sets'). |
| 652 | | cli_testcase(299, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 653 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '600', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'SYMBOLIC', 'TRUE', '-p', 'CLPFD', 'FALSE'], 'Mathematical Laws about Sets'). |
| 654 | | cli_testcase(300, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 655 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '600', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE'], 'Mathematical Laws about Sets'). |
| 656 | | cli_testcase(301, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 657 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '600', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SYMBOLIC', 'TRUE'], 'Mathematical Laws about Sets'). |
| 658 | | cli_testcase(302, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 659 | | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'FALSE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets (with Natural Numbers, CLPFD FALSE)'). |
| 660 | | cli_testcase(303, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 661 | | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets (with Natural Numbers)'). |
| 662 | | cli_testcase(304, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 663 | | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'SYMBOLIC', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets (with Natural Numbers)'). |
| 664 | | cli_testcase(305, [laws,repl], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 665 | | '../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS0.mch', '-t', '-mc', '100000', '-cs', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '28000'], 'Some REPL Unit Tests'). |
| 666 | | cli_testcase(306, [laws,repl], ['../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS1.mch', '-t', '-mc', '100000', '-cs', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '28000'], 'Some REPL Unit Tests'). |
| 667 | | cli_testcase(307, [laws,repl], ['../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS.mch', '-t', '-mc', '100000', '-cs', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '45000'], 'Some REPL Unit Tests'). |
| 668 | | cli_testcase(308, [laws,rel_fnc], ['../prob_examples/public_examples/B/Daniel/rel_fnc.mch', '-t', '-mc', '20000', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'A small machine to check that rel/fnc work as expected.'). |
| 669 | | cli_testcase(309, [laws,card], ['../prob_examples/public_examples/B/Laws/CardinalityLaws.mch', '-mc', '2500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE'], 'Cardinality Laws'). |
| 670 | | cli_testcase(310, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). |
| 671 | | cli_testcase(311, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). |
| 672 | | cli_testcase(312, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M2_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). |
| 673 | | cli_testcase(313, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M3_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). |
| 674 | | cli_testcase(314, [cbc_deadlock], ['../prob_examples/public_examples/B/Demo/Lift.mch', '-cbc_deadlock', '-strict'], ''). |
| 675 | | cli_testcase(315, [cbc_deadlock], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-cbc_deadlock', '-strict'], ''). |
| 676 | | cli_testcase(316, [cbc_deadlock], ['../prob_examples/public_examples/B/Demo/RussianPostalPuzzle.mch', '-cbc_deadlock', '-strict'], ''). |
| 677 | | cli_testcase(317, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/NoDeadlock.mch', '-cbc_deadlock', '-strict'], ''). |
| 678 | | cli_testcase(318, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/SimpleDeadlock1.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 679 | | cli_testcase(319, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/DeadlockIntBools.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 680 | | cli_testcase(320, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 681 | | cli_testcase(321, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc_deadlock', '-strict'], ''). |
| 682 | | cli_testcase(322, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/MinSet_Deadlock.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 683 | | cli_testcase(323, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Vizing_Breitner/m12_Deadlock_Freedom_mch.eventb', '-p','TIME_OUT','200','-cbc_deadlock', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-strict', '-p','DEFAULT_SETSIZE',1], ''). /* with size 2 only works if SMT mode is allowed to instantiate */ |
| 684 | | cli_testcase(324, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Vizing_Breitner/m11_Conv_Stages_mch.eventb', '-cbc_deadlock', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-strict','-p', 'DEFAULT_SETSIZE',2, |
| 685 | | '-p', 'TIME_OUT', '9500'], 'Vizing_Breitner challenging Deadlock Test'). % increased time-out for jenkins; locally the test runs in 22-23 seconds (MBA, Sept. 2015); time-out factor is 10 for -cbc_deadlock |
| 686 | | % increased time-out from 7500 further for Windows gitlab runner on 14th Feb 2019 |
| 687 | | cli_testcase(325, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Deadlock/BrakeSystem_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 688 | | cli_testcase(326, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Deadlock/QueenEventsTF_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'CLPFD', 'FALSE'], ''). |
| 689 | | cli_testcase(327, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Deadlock/QueenEventsTF_mch.eventb', '-cbc_deadlock_pred', 'n=15', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 690 | | cli_testcase(328, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Deadlock/QueenEventsTF_mch.eventb', '-cbc_deadlock_pred', 'n=32', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 691 | | cli_testcase(329, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 692 | | cli_testcase(330, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 693 | | cli_testcase(331, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 694 | | cli_testcase(332, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_1_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check' ,'-p', 'CLPFD', 'TRUE' % TO DO: investigate why we now need CLPFD or SMT |
| 695 | | ], ''). |
| 696 | | cli_testcase(333, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_2_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'CLPFD', 'FALSE'], ''). |
| 697 | | cli_testcase(334, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_2_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'CLPFD', 'TRUE'], ''). |
| 698 | | cli_testcase(335, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m0_mch_deadlock.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 699 | | cli_testcase(336, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m0_mch_deadlock.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 700 | | cli_testcase(337, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m0_mch.eventb', '-cbc_deadlock', '-strict'], ''). |
| 701 | | cli_testcase(338, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m1_mch.eventb', '-cbc_deadlock', '-strict'], ''). |
| 702 | | cli_testcase(339, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m2_mch.eventb', |
| 703 | | '-cbc_deadlock', '-strict', |
| 704 | | '-expcterr', 'enumeration_warning'], 'CBC Deadlock check with enumeration warning'). |
| 705 | | cli_testcase(340, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m3_mch.eventb', |
| 706 | | '-cbc_deadlock', '-strict', |
| 707 | | '-expcterr', 'enumeration_warning'], 'CBC Deadlock check with enumeration warning'). |
| 708 | | cli_testcase(341, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/search/m_1b_mch.eventb', '-cbc_deadlock', '-strict'], ''). |
| 709 | | cli_testcase(342, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_1.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 710 | | cli_testcase(343, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_2.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 711 | | cli_testcase(344, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_3.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 712 | | cli_testcase(345, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/siemens_mch_0.eventb', '-cbc_deadlock', '-strict'], ''). |
| 713 | | cli_testcase(346, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/scheduler.eventb', '-cbc_deadlock', '-strict'], ''). |
| 714 | | cli_testcase(347, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/earley_2.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 715 | | cli_testcase(348, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/mondex_m2.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 716 | | cli_testcase(349, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/cxcc0.eventb', '-cbc_deadlock', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-expcterr', 'cbc_deadlock_check', '-v'], 'cxcc0 cbc_deadlock and exercise verbose mode'). |
| 717 | | cli_testcase(350, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/cxcc0.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'USE_RECORD_CONSTRUCTION', 'FALSE'], ''). |
| 718 | | cli_testcase(351, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/FMCH02.eventb', '-p', 'DEFAULT_SETSIZE', '1', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). |
| 719 | | cli_testcase(352, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_mch_WithInit.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'SMT', 'TRUE'], ''). |
| 720 | | cli_testcase(353, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'SMT', 'TRUE'], ''). |
| 721 | | cli_testcase(354, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v2.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'SMT', 'TRUE'], ''). |
| 722 | | cli_testcase(355, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v3.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'SMT', 'TRUE'], ''). |
| 723 | | cli_testcase(356, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v4.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'SMT', 'TRUE'], ''). |
| 724 | | cli_testcase(357, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v5.eventb', '-cbc_deadlock', '-strict', '-p', 'DEFAULT_SETSIZE', '1'], ''). |
| 725 | | cli_testcase(358, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v5.eventb', '-cbc_deadlock', '-strict', '-p', 'DEFAULT_SETSIZE', '2', '-expcterr', 'cbc_deadlock_check', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'FALSE'], ''). |
| 726 | | cli_testcase(359, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v5.eventb', '-cbc_deadlock', '-strict', '-p', 'DEFAULT_SETSIZE', '2', '-expcterr', 'cbc_deadlock_check', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE'], ''). |
| 727 | | cli_testcase(360, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v6.eventb', '-cbc_deadlock', '-strict', '-p', 'DEFAULT_SETSIZE', '1', '-p', 'SMT', 'TRUE'], ''). |
| 728 | | cli_testcase(361, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v6.eventb', '-cbc_deadlock', '-strict', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SMT', 'TRUE'], ''). |
| 729 | | cli_testcase(362, [cbc_deadlock,smt_test], ['../prob_examples/public_examples/B/LTL/Turcanu/machineEco_mch4.eventb', '-cbc_deadlock', '-p', 'SMT', 'TRUE', '-strict', '-expcterr', 'cbc_deadlock_check'], 'Deadlock CBC Test with SMT pref'). |
| 730 | | cli_testcase(363, [cbc_deadlock], ['../prob_examples/public_examples/B/Mathematical/GraphIso/HardGraph.mch', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check_time_out', '-p', 'TIME_OUT', '30', '-p', 'MAX_INITIALISATIONS', '0', '-strict'], 'Test that time-out triggered within CBC Deadlock check'). % this test is now a bit fragile: with faster machines the check can be completed rather quickly |
| 731 | | cli_testcase(364, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-cbc_deadlock', '-strict'], ''). |
| 732 | | cli_testcase(365, [puzzles_test,hash], ['../prob_examples/public_examples/B/Puzzles/StableMarriages.mch', '-t', '-strict', '-cc', '7', '15', '-mc', '100', '--hash64', 192740982584039033], ''). |
| 733 | | cli_testcase(366, [puzzles_test,hash], ['../prob_examples/public_examples/B/Puzzles/StableMarriagesLarger.mch', '-t', '-strict', '-cc', '7', '46', '-mc', '100', '--hash64', 706576926696257193 % used to be 13443197532344872 |
| 734 | | ], 'Stable Marriages'). |
| 735 | | cli_testcase(367, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/GolombRuler.mch', '-t', '-p', 'CLPFD', 'TRUE', '-strict'], ''). |
| 736 | | cli_testcase(368, [puzzles_test,hash], ['../prob_examples/public_examples/B/Puzzles/Tischordnung.mch', '-t', '-strict', '-cc', '3', '7', '-mc', '100', '--hash64', 168992916868770688], ''). |
| 737 | | cli_testcase(369, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Wegenetz.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). |
| 738 | | cli_testcase(370, [puzzles_test], ['../prob_examples/public_examples/B/Demo/RussianPostalPuzzle.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). |
| 739 | | cli_testcase(371, [puzzles_test], ['../prob_examples/public_examples/B/Demo/TrainTorchPuzzle.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). |
| 740 | | cli_testcase(372, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/BlocksWorldGeneric.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). |
| 741 | | cli_testcase(373, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Farmer.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). |
| 742 | | cli_testcase(374, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). |
| 743 | | cli_testcase(375, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/water.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). |
| 744 | | cli_testcase(376, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/EventBPrologPackages/Puzzles/CopyPastAsEvent_mch.eventb', '-t', '-strict'], ''). |
| 745 | | cli_testcase(377, [puzzles_test], ['../prob_examples/public_examples/EventBPrologPackages/Puzzles/Sudoku_ctx.eventb', '-t', '-strict'], ''). |
| 746 | | cli_testcase(378, [puzzles_test,queens,codespeed], ['-p', 'CLPFD', 'TRUE', '-p', 'MAX_OPERATIONS', 5000, |
| 747 | | '../prob_examples/public_examples/EventBPrologPackages/Puzzles/NQueensAsEvent_mch.eventb', '-t', '-strict'], 'NQueens as events'). |
| 748 | | cli_testcase(379, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/PexSolve.mch', '-t', '-strict'], ''). |
| 749 | | cli_testcase(380, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/KnightsTour.mch', '-t', '-strict'], ''). |
| 750 | | cli_testcase(381, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/KnightsTour_v2.mch', '-t', '-strict'], ''). |
| 751 | | cli_testcase(382, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SudokuAsConstant.mch', '-t', '-strict'], ''). |
| 752 | | cli_testcase(383, [puzzles_test,cbc,codespeed], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SudokuHexAsConstant.mch', '-t', '-properties', '-sptxt', '../prob_examples/public_examples/B/Puzzles/SudokuHexAsConstant_sptxt.txt', '-strict'], 'Sudoku Hex Puzzle'). |
| 753 | | cli_testcase(384, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SudokuAsConstantNoSolution.mch', '-init', '-strict', '-expcterr', 'setup_constants_fails'], ''). |
| 754 | | cli_testcase(385, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/LatinSquaresBig.mch', '-t', '-strict'], ''). |
| 755 | | cli_testcase(386, [puzzles_test,queens,codespeed], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/NQueens50.mch', '-t', '-properties', '-strict'], ''). |
| 756 | | cli_testcase(387, [puzzles_test,cbc,codespeed,clpfd_tables], ['-p', 'CLPFD', 'TRUE', '-p', 'MAX_INITIALISATIONS', 19, |
| 757 | | '../prob_examples/public_examples/B/Puzzles/TwoQueensSevenKnights.mch', '-t', '-assertions', '-strict'], 'TwoQueensSevenKnights'). |
| 758 | | cli_testcase(388, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SendMoreMoney.mch', '-t', '-strict'], 'SendMoreMoney'). |
| 759 | | cli_testcase(389, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/KissPassion.mch', '-t', '-strict'], 'KissPassion'). |
| 760 | | cli_testcase(390, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/CopySavePasteTools.mch', '-t', '-strict'], ''). |
| 761 | | cli_testcase(391, [puzzles_test,cbc_tests], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/NoNeighboursProblem.mch', '-cbc_sequence', 'SolAbove', '-strict'], 'Neighbour differ by more than one puzzle'). |
| 762 | | cli_testcase(392, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SubsetSum.mch', '-t', '-strict'], ''). |
| 763 | | cli_testcase(393, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SubsetSum2.mch', '-t', '-strict'], ''). |
| 764 | | cli_testcase(394, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha.mch', '-t', '-mc', '100', '-p', 'MAX_INITIALISATIONS', '100', '-check_complete', '-cc', '13', '18'], 'Agatha puzzle'). |
| 765 | | cli_testcase(395, [puzzles_test,codespeed,symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/SET_Game/SET_GAM_Sym_NoSet20_mch.eventb', '-mc', '1000', '-p', 'SYMMETRY_MODE', 'hash', '-p', 'TIME_OUT', '7000', '-p', 'CLPFD', 'TRUE', '-df', '-goal', 'n=18', '-p', 'MAX_OPERATIONS', '20', '-strict', '-expcterr', 'goal_found'], 'SET Game Test'). |
| 766 | | cli_testcase(396, [time_out_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/DTP_k2_n35_c175_s1.mch', '-strict', '-init', '-expcterr', 'setup_constants_fails', '-expcterr', 'time_out', '-p', 'CLPFD', 'FALSE'], 'Without CLPFD, this test times out. 1191 is a copy of this test using CLPFD'). |
| 767 | | cli_testcase(397, [cbc,smt_test], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc', 'all', '-strict', '-p', 'SMT', 'TRUE'], ''). |
| 768 | | cli_testcase(398, [cbc,smt_test], ['../prob_examples/public_examples/B/CBC/NATURAL_Add.mch', '-cbc', 'all', '-strict', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE'], ''). |
| 769 | | cli_testcase(399, [cbc], ['../prob_examples/public_examples/B/Demo/Lift.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], ''). |
| 770 | | cli_testcase(400, [cbc], ['../prob_examples/public_examples/B/Tutorial/DoubleCounter.mch', '-cbc', 'Double', '-strict', '-expcterr', 'cbc', '-p', 'CLPFD', 'TRUE'], ''). |
| 771 | | cli_testcase(401, [cbc], ['../prob_examples/public_examples/B/Tutorial/DoubleCounter.mch', '-cbc', 'Double', '-strict', '-expcterr', 'cbc', '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', '150'], ''). |
| 772 | | cli_testcase(402, [cbc], ['../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet.mch', |
| 773 | | '../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet_simplified.mch', |
| 774 | | '-cbc', 'all', '-strict', '-expcterr', 'cbc'], 'CBC mesiSet simplified'). |
| 775 | | cli_testcase(403, [cbc], ['../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet.mch', '-cbc', 'write', '-strict', '-expcterr', 'cbc'], 'CBC mesiSet'). |
| 776 | | cli_testcase(404, [cbc], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], ''). |
| 777 | | cli_testcase(405, [cbc], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc', 'Delete', '-strict', '-expcterr', 'cbc'], ''). |
| 778 | | cli_testcase(406, [cbc], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc', 'Run', '-strict'], ''). |
| 779 | | cli_testcase(407, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch.eventb', '-cbc', 'all', '-strict'], ''). |
| 780 | | cli_testcase(408, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc', 'bridge', '-strict'], ''). |
| 781 | | cli_testcase(409, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc', 'approach', '-strict', '-p', 'SMT', 'TRUE'], ''). |
| 782 | | cli_testcase(410, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc', 'exit', '-strict'], ''). |
| 783 | | cli_testcase(411, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc', 'bridge', '-strict', '-expcterr', 'cbc'], ''). |
| 784 | | cli_testcase(412, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc', 'approach', '-strict', '-p', 'SMT', 'TRUE'], ''). |
| 785 | | cli_testcase(413, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc', 'exit', '-strict'], ''). |
| 786 | | cli_testcase(414, [cbc,smt_test,codespeed], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v5.eventb', '-cbc', 'all', '-p', 'DEFAULT_SETSIZE', '4', '-p', 'SMT', 'TRUE', '-strict'], 'BPEL2B_PurchaseOrder cbc check'). |
| 787 | | cli_testcase(415, [cbc,smt_test,codespeed], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v6.eventb', '-cbc', 'all', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SMT', 'TRUE', '-strict'], 'BPEL2B_PurchaseOrder cbc check'). |
| 788 | | cli_testcase(416, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BPEL2B_PurchaseOrder/Model_Machine_4_NoDeadlock_v6.eventb', '-cbc', 'all', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SMT', 'TRUE', '-strict'], ''). |
| 789 | | cli_testcase(417, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Tests/Ticket167.eventb', |
| 790 | | '-cbc', 'inc', '-strict', |
| 791 | | '-expcterr', 'enumeration_warning'], 'CBC check with enumeration warning'). |
| 792 | | cli_testcase(418, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'redeal', '-strict', '-expcterr', 'cbc'], ''). |
| 793 | | cli_testcase(419, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'HasFlush', '-strict', '-expcterr', 'cbc'], ''). |
| 794 | | cli_testcase(420, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'hasFourOfAKind', '-strict', '-expcterr', 'cbc'], ''). |
| 795 | | cli_testcase(421, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'HasStraight', '-strict', '-expcterr', 'cbc'], ''). |
| 796 | | cli_testcase(422, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'AddACredit', '-cbc', 'deal', '-strict', '-cbc', 'selectme', '-cbc', 'invselectme'], ''). |
| 797 | | cli_testcase(423, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-cbc', 'hasFullHouse', '-strict', '-expcterr', 'cbc'], ''). |
| 798 | | cli_testcase(424, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], ''). |
| 799 | | cli_testcase(425, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-cbc', 'all', '-strict'], ''). |
| 800 | | cli_testcase(426, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb', '-cbc', 'all', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE'], ''). |
| 801 | | cli_testcase(427, [kodkod], ['-kodkod_comparision', '2', '../prob_examples/public_examples/B/Kodkod/expressions/functions.mch', '-strict'], ''). |
| 802 | | cli_testcase(428, [kodkod], ['-p', 'CLPFD', 'true', '-kodkod_comparision', '2', '../prob_examples/public_examples/B/Kodkod/expressions/triples.mch', '-strict'], ''). |
| 803 | | cli_testcase(429, [kodkod], ['-kodkod_comparision', '3', '../prob_examples/public_examples/B/Kodkod/expressions/relations.mch', '-strict'], ''). |
| 804 | | cli_testcase(430, [kodkod], ['-kodkod_comparision', '0', '../prob_examples/public_examples/B/Kodkod/expressions/sequences.mch', '-strict'], ''). |
| 805 | | cli_testcase(431, [kodkod], ['-kodkod_comparision', '1', '../prob_examples/public_examples/B/Kodkod/NoNeighboursProblem.mch', '-strict'], ''). |
| 806 | | cli_testcase(432, [kodkod], ['-p','MAX_INITIALISATIONS',50,'-kodkod_comparision', '0', '../prob_examples/public_examples/B/Kodkod/WhoKilledAgatha.mch', '-strict'], ''). |
| 807 | | cli_testcase(433, [kodkod], ['-pacheck', '../prob_examples/public_examples/B/predicate_analysis/basic.mch', '-strict'], ''). |
| 808 | | cli_testcase(434, [kodkod], ['-pacheck', '../prob_examples/public_examples/B/predicate_analysis/function_cards.mch', '-strict'], ''). |
| 809 | | cli_testcase(435, [kodkod], ['-pacheck', '../prob_examples/public_examples/B/predicate_analysis/setext_dombug.mch', '-strict'], ''). |
| 810 | | cli_testcase(436, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/general4.csp', '-assertions', '-strict'], ''). |
| 811 | | cli_testcase(437, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/TestPrimedBecomeSuch.mch', '-t', '-strict', '-expcterr', virtual_time_out], 'Test for $0 usage in become such substitutions.'). |
| 812 | | cli_testcase(438, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/basin_olderog_bank.csp', '-assertions', '-strict'], ''). |
| 813 | | cli_testcase(439, [b_test,strings], ['../prob_examples/public_examples/B/FeatureChecks/EmptyString.mch', '-t', '-strict', '-assertions'], 'Check that we allow the empty string.'). |
| 814 | | |
| 815 | | cli_testcase(440, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-goal', 'c=10', '-check_goal', '-p', 'MAXINT', '100'], 'Check that animate executes exactly 10 operations after INITIALISATION.'). |
| 816 | | cli_testcase(441, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch','-animate', '10', '-strict', '-goal', 'c=8', '-check_goal', '-p', 'MAXINT', '100'], 'Without -init we exacte SETUP_CONSTANTS, INITIALISATION and 8 operations.'). |
| 817 | | cli_testcase(442, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-goal', 'c=11', '-check_goal', '-p', 'MAXINT', '100', '-expcterr', 'check_goal'], 'Check that -check_goal fails if GOAL false.'). |
| 818 | | cli_testcase(443, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch','-animate', '10', '-strict', '-p', 'MAXINT', '100', '-det_check'], 'Check that all animation steps are deterministic.'). |
| 819 | | cli_testcase(444, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter_NonDet.mch','-animate', '4', '-strict', '-p', 'MAXINT', '100', '-det_check', '-expcterr', 'det_check'], 'Check that all -det_check detects non-deterministic steps.'). |
| 820 | | cli_testcase(445, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-goal', 'c=10 & c>1 & c<mx', '-check_goal', '-p', 'MAXINT', '100'], 'Check that -check_goal can also deal with conjuncts.'). |
| 821 | | cli_testcase(446, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '30', '-strict', '-goal', 'c=20', '-check_goal', '-p', 'MAXINT', '20', '-expcterr', 'animate'], 'Check that error raised if we cannot animate all steps -animate (but that we stay in the final state).'). |
| 822 | | cli_testcase(447, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate_all', '-animate_stats', '-strict', '-goal', 'c=20', '-check_goal', '-p', 'MAXINT', '20'], 'Check that no error raised if we cannot animate all steps -animate_all (and that we stay in the final state).'). |
| 823 | | |
| 824 | | cli_testcase(448, [tickets], ['../prob_examples/public_examples/B/Tickets/Hansen1/Bi_func.mch', '-mc', '1000', '-t', '-check_complete', '-cc', '3', '11'], 'Check issue with existential quantifier inside set comprehension.'). |
| 825 | | cli_testcase(449, [tickets], ['../prob_examples/public_examples/B/Tickets/Burdy1/TestOrApplyFun.mch', '-mc', '1000', '-t', '-check_complete', '-cc', '5', '10'], 'Check issue with undefined function application in context of disjunct.'). |
| 826 | | cli_testcase(450, [tickets], ['../prob_examples/public_examples/B/Tickets/Plagge1/KnightKnaves2.mch', '-init', '-strict'], 'Check that no time-out occurs in compiled mode'). |
| 827 | | |
| 828 | | cli_testcase(451, [b_test,animate,history], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-p', 'MAXINT', '100', '-his', '../prob_examples/public_examples/B/Simple/UpCounter_his.txt'], 'Check that history properly written.'). |
| 829 | | cli_testcase(452, [b_test,animate,history], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-p', 'MAXINT', '100', '-his', '../prob_examples/public_examples/B/Simple/UpCounter_his.txt','-his_option', 'show_states'], 'Check that history option -his_option show_states works.'). |
| 830 | | cli_testcase(453, [b_test,animate,history], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-p', 'MAXINT', '100', '-his', '../prob_examples/public_examples/B/Simple/UpCounter_his.txt','-his_option', 'show_states','-his_option', 'show_init'], 'Check that history option -his_option show_states & show_init works.'). |
| 831 | | cli_testcase(454, [b_test,animate,history], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-p', 'MAXINT', '100', '-his', '../prob_examples/public_examples/B/Simple/UpCounter_his.txt','-his_option', 'show_init'], 'Check that history option -his_option show_init works.'). |
| 832 | | cli_testcase(455, [b_test,animate,sptxt], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-animate', '10', '-strict', '-p', 'MAXINT', '100', '-sptxt', '../prob_examples/public_examples/B/Simple/UpCounter_sptxt.txt'], 'Check that history option -sptxt works.'). |
| 833 | | |
| 834 | | cli_testcase(456, [puzzles_test,queens], ['../prob_examples/public_examples/B/Puzzles/Queens/QueensAllSolutions.mch', '-t', '-strict', '-check_complete', '-mc', 100, '-check_complete', '-cc', '94', '185'], 'A version of N-Queens where all solutions are computed and we try to find N.'). |
| 835 | | |
| 836 | | cli_testcase(457, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLaws.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on functions.'). |
| 837 | | cli_testcase(458, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLawsWithLambda.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on functions, including lambda abstractions.'). |
| 838 | | cli_testcase(459, [b_test,history], ['../prob_examples/public_examples/B/Daniel/rel_fnc.mch', '-t', '-strict', '-p', 'CLPFD', 'TRUE','-his', '../prob_examples/public_examples/B/xxdoesnotexist/rel_fnc_his.txt','-expcterr','open_file','-expcterr','history'], 'Check that we generate an error if hist file destination does not exist.'). |
| 839 | | cli_testcase(460, [b_test,sptxt], ['../prob_examples/public_examples/B/Daniel/rel_fnc.mch', '-t', '-strict', '-p', 'CLPFD', 'TRUE','-sptxt', '../prob_examples/public_examples/B/xxdoesnotexist/rel_fnc_his.txt','-expcterr','open_file','-expcterr','sptxt'], 'Check that we generate an error if sptxt file destination does not exist.'). |
| 840 | | cli_testcase(461, [b_test,history], ['../prob_examples/public_examples/B/Daniel/rel_fnc.mch', '-t', '-strict', '-p', 'CLPFD', 'TRUE','-his', '../prob_examples/public_examples/B/Daniel/rel_fnc_his.txt','-his_option', 'show_states','-his_option', 'show_init', '-p','SHOW_EVENTB_ANY_VALUES','TRUE'], 'A small machine to check that rel/fnc work as expected; here we check it in conjunction with -his option.'). |
| 841 | | cli_testcase(462, [b_test,history], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-mc', '100', '-goal', 'c=10','-strict', '-p', 'MAXINT', '100', '-his', '../prob_examples/public_examples/B/Simple/UpCounter_his.txt','-his_option', 'show_states','-his_option', 'show_init','-expcterr','goal_found'], 'Check that history option works together with model checking.'). |
| 842 | | cli_testcase(463, [cbc_deadlock,history], ['../prob_examples/public_examples/B/CBC/SimpleDeadlock1.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check','-his', '../prob_examples/public_examples/B/CBC/SimpleDeadlock1_his.txt','-his_option', 'show_states'], 'Check that -his works together with cbc_deadlock'). |
| 843 | | cli_testcase(464, [cbc,history], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc', 'Delete', '-strict', '-expcterr', 'cbc', '-his', '../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr_his.txt','-his_option', 'show_states', '-p', 'DEFAULT_SETSIZE', 6, '-p', 'TIME_OUT', 500], 'Check that -his works with cbc invariant checking.'). % set DEFAULT_SETSIZE on 28th Aug 2014 to check that partition in Invariant detected |
| 844 | | cli_testcase(465, [b_test,animate], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-animate', '5', '-strict', '-p', 'MAXINT', '100', '-load_state', '../prob_examples/public_examples/B/Simple/UpCounter_saved10.P', '-goal', 'c=15', '-check_goal'], 'Check that animate works after load_state.'). |
| 845 | | cli_testcase(466, [b_test,animate,while], ['../prob_examples/public_examples/B/PerformanceTests/WhileLoopBench.mch', '-animate', '22', '-strict', '-p', 'TIME_OUT', 28000, '-his', '../prob_examples/public_examples/B/PerformanceTests/WhileLoopBench_his.txt', '-his_option' , 'show_states'], 'Check animate with operation with while loop.'). |
| 846 | | cli_testcase(467, [b_test,history], ['../prob_examples/public_examples/B/FeatureChecks/IFTHENELSE.mch', '-t', '-strict','-his', '../prob_examples/public_examples/B/FeatureChecks/IFTHENELSE_his.txt','-his_option', 'show_states'], 'Check simple if-then-else works correctly, and check -his option writes operation arguments into file.'). |
| 847 | | cli_testcase(468, [b_test,history,sptxt], ['../prob_examples/public_examples/B/Puzzles/Farmer.mch', '-mc', '1000', '-bf','-strict', '-nodead', '-expcterr', 'goal_found','-his', '../prob_examples/public_examples/B/Puzzles/Farmer_his.txt','-sptxt','../prob_examples/public_examples/B/Puzzles/Farmer_sptxt.txt'], 'Check that -his and -sptxt work when used together'). |
| 848 | | cli_testcase(469, [b_test,sptxt], ['../prob_examples/public_examples/B/PerformanceTests/LargeSets/LargeExplicitSet.mch', '-animate', '7', '-strict', '-p', 'TIME_OUT', 5000, |
| 849 | | '-nodead','-sptxt','../prob_examples/public_examples/B/PerformanceTests/LargeSets/LargeExplicitSet_sptxt.txt'], 'Check that -sptxt expands large sets.'). % introduced a time-out on 18th of May 2014 to avoid time-out during closure expansion; cause commit on May 12 to b_enumerate.pl; reduced TIME_OUT again on 19th of May [completely removing time-out seems to still cause issues]; another slowdown was caused by commit 13d3b41ff8e1f15cea7437b3530c883c4e3bda6b on Sep 20th 2013 (improve union of avl_set with large intervals) |
| 850 | | cli_testcase(470, [b_test,sptxt,history], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas.eventb', '-t', '-strict', '-noass','-his', '../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas_his.txt','-his_option','show_states','-sptxt','../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas_sptxt.txt'], 'Check -his and sptxt on a larger Event-B model.'). |
| 851 | | |
| 852 | | cli_testcase(471, [b_test,sptxt,history], ['../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.mch', '-t', '-strict', '-his', '../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_his.txt','-sptxt','../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_sptxt.txt'], 'Check -his and -sptxt on a larger classical B model.'). |
| 853 | | cli_testcase(472, [b_test,sptxt,history], ['../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRRR.ref', '-t', '-strict', '-his', '../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRRR_his.txt','-his_option','show_states','-sptxt','../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRRR_sptxt.txt'], 'Check -his and -sptxt on a classical B refinement.'). |
| 854 | | cli_testcase(473, [b_test,sptxt,history,records], ['../prob_examples/public_examples/B/NewSyntax/SET_Game_Rec.mch', '-t', '-strict', '-his', '../prob_examples/public_examples/B/NewSyntax/SET_Game_Rec_his.txt','-his_option','show_states','-sptxt','../prob_examples/public_examples/B/NewSyntax/SET_Game_Rec_sptxt.txt'], 'Check -his and -sptxt for classical B records.'). |
| 855 | | cli_testcase(474, [b_test,sptxt,history,dot], ['../prob_examples/public_examples/B/ExpressionViewer/TotFunAnalyseTest.mch', '-ma', 1, 4, 0, '-dot_output', '../prob_examples/public_examples/B/ExpressionViewer/dot_output/', '-dot_all'], 'Check -dot_output, -dot_all works.'). |
| 856 | | cli_testcase(475, [laws,repl], ['../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS2.mch', '-t', '-mc', '100000', '-cs', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '60000'], 'Check that REPL unit tests work'). |
| 857 | | cli_testcase(476, [tickets,dot], ['../prob_examples/public_examples/B/Tickets/Mejia1/TestInit_mch.eventb', '-t', '-mc', '1000', '-cc', 4, 13, '-strict', '-p', 'CLPFD', 'TRUE', '-dot', 'state_space', '../prob_examples/public_examples/B/Tickets/Mejia1/TestInit_statespace.dot', '-p', 'DOT_PROP', 'TRUE', '-pref_group', dot_colors, classic, '-p','DOT_PEN_WIDTH',1], 'Check that -dot state_space output works and that no warning generated for existential quantifier on disjunction in Event-B mode'). |
| 858 | | cli_testcase(477, [cbc,smt_test], ['-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-strict', '../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha.mch', '-cbc_assertions'], 'Check CBC static assertion checking.'). |
| 859 | | cli_testcase(478, [cbc,smt_test], ['-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha_wrongassert.mch','-strict', '-cbc_assertions','-expcterr',cbc_assertions], 'Check CBC static assertion checking with counter example.'). |
| 860 | | cli_testcase(479, [b_test,dot], ['-p', 'CLPFD', 'TRUE', '-mc', '100', '-p', 'MAX_INITIALISATIONS', 7, '-bf', '../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha.mch','-dot', 'state_space', '../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha_statespace.dot','-strict', '-p', 'DOT_COLOR_ARC', steelblue, '-p', 'DOT_COLOR_NODE', olivedrab2, '-p', 'DOT_PEN_WIDTH', 2], 'Check Dot output with proper newline.'). |
| 861 | | cli_testcase(480, [b_test,dot], ['-p', 'CLPFD', 'TRUE', '-p', 'DOT_LOOPS', 'FALSE', |
| 862 | | '-p', 'DOT_ROOT', 'FALSE', '-p', 'MAX_INITIALISATIONS', 5, |
| 863 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch','-mc', 4 ,'-bf' ,'-dot', 'state_space', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_statespace.dot','-strict', '-pref_group', dot_colors, classic, '-p','DOT_PEN_WIDTH',1, '-expcterr', 'model_check_incomplete'], 'Check Dot output with proper newline.'). |
| 864 | | cli_testcase(481, [b_test,let], ['../prob_examples/public_examples/B/FeatureChecks/LET_multiple_variables.mch', '-t', '-strict', '-expcterr','type_error', '-expcterr', 'load_main_file'], 'Check illegal LET with multiple variables.'). % added '-expcterr','type_error' : we now detect the error in the type checker |
| 865 | | cli_testcase(482, [b_test,let], ['../prob_examples/public_examples/B/FeatureChecks/LET_multiple_variables.mch', '-mc', 100, '-expcterr','type_error', '-expcterr', 'load_main_file'], 'Check that LET with non-equation predicate does not work.'). % error now detected during type check, not during model checking |
| 866 | | cli_testcase(483, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/ref_benchmarks/abp_chapter5_roscoe_DLK_DIV_bench.csp', '-assertions', '-strict'], 'Check performance of Deadlock & DIV checks'). |
| 867 | | cli_testcase(484, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/NastyFDRDemos/LargeSpecRefineCheck.csp', '-assertions', '-strict'], 'Check performance with Large Spec and small Impl'). |
| 868 | | cli_testcase(485, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/simple/DeadlockTimeout.csp', '-assertions', '-strict'], 'Check that deadlock checker works with timeout generated tau transitions'). |
| 869 | | cli_testcase(486, [csp_test,csp_bench,refinement], ['../prob_examples/public_examples/CSP/simple/ParallelIntChoice.csp', '-assertions', '-strict'], 'Check that deadlock checker works with internal choice generated tau transitions'). |
| 870 | | cli_testcase(487, [csp_test,refinement], ['../prob_examples/public_examples/CSP/simple/DivChecks3.csp', '-assertions', '-strict'], 'Check that ProB deals with Divergence correctly'). |
| 871 | | cli_testcase(488, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/simple/ParallelIntChoice.csp', '-assertions', '-strict', '-p', 'CSP_STRIP_SOURCE_LOC', 'TRUE'], 'Check that stripping of source location works.'). |
| 872 | | cli_testcase(489, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/ref_benchmarks/section7-1.csp', '-assertions', '-strict'], 'Check more CSP assertions from Roscoe book usc'). |
| 873 | | cli_testcase(490, [csp_test,refinement], ['../prob_examples/public_examples/CSP/simple/exception_operator.csp', '-assertions', '-strict'], 'Check that new exception operator works'). |
| 874 | | cli_testcase(491, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/ref_benchmarks/section7-2.csp', '-assertions', '-strict'], 'Check more CSP assertions from Roscoe book usc, here with exception operator'). |
| 875 | | cli_testcase(492, [csp_test],['../prob_examples/public_examples/CSP/evans/traffic_spec.csp', '-assertions', '-strict'], 'Checking CSP assertions.'). |
| 876 | | cli_testcase(493, [tickets], ['../prob_examples/public_examples/B/Tickets/Mejia2/ticket_simplified.mch', '-t', '-mc',100,'-assertions', '-check_complete', '-cc', '3', '4'], 'Check cartesian product ticket'). |
| 877 | | cli_testcase(494, [laws,case], ['../prob_examples/public_examples/B/Laws/SubstitutionLaws.mch', '-mc', '100', '-cs', '-t', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Check basic properties of B substitutions.'). |
| 878 | | |
| 879 | | cli_testcase(495, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/SubstitutionSeqCompAssertErrCheck.mch', '-mc', '100', '-nodead', '-strict','-expcterr', 'assert_error'], 'Check that ProB finds error in Substitution assertion'). |
| 880 | | cli_testcase(496, [laws,card], ['../prob_examples/public_examples/B/Laws/ExplicitComputationsCLPFD.mch', '-assertions', '-mc', '100000', '-nodead', '-cs', '-strict', '-p', 'TIME_OUT', '7000'], 'Many explicit computations which check that all operators work as expected on various concrete data.'). |
| 881 | | cli_testcase(497, [b_test], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-pp', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch', '-strict'], 'Check that pretty printing works'). |
| 882 | | cli_testcase(498, [b_test], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_prettyprinted.mch', '-pp', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch', '-strict'], 'Check that pretty printing works'). |
| 883 | | cli_testcase(499, [b_test], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-ppf', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch', '-strict'], 'Check that pretty printing works'). |
| 884 | | cli_testcase(500, [b_test], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_prettyprintedf.mch', '-ppf', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch', '-strict'], 'Check that pretty printing works'). |
| 885 | | cli_testcase(501, [b_test], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '25696', '-p', 'COMPRESSION', 'TRUE', '-strict', '-p', 'MAX_INITIALISATIONS', 5], 'Check that compression works'). |
| 886 | | cli_testcase(502, [laws], ['../prob_examples/public_examples/B/Abrial_BBook/BBook_Page80.mch', '-init', '-assertions', '-strict'], 'Check example from B-Book'). |
| 887 | | cli_testcase(503, [laws], ['../prob_examples/public_examples/B/Abrial_BBook/BBook_Page83.mch', '-init', '-assertions', '-strict'], 'Check example from B-Book'). |
| 888 | | cli_testcase(504, [laws], ['../prob_examples/public_examples/B/Abrial_BBook/MembershipProperty4_Page96.mch', '-init', '-expcterr', 'setup_constants_fails', '-p', 'CLPFD', 'TRUE', '-strict'], 'Check rule from B-Book'). |
| 889 | | cli_testcase(505, [laws], ['../prob_examples/public_examples/B/Abrial_BBook/MembershipProperty5_Page96.mch', '-init', '-p', 'CLPFD', 'TRUE', '-strict'], 'Check that ProB finds counter example to erroneous rule from B-Book'). |
| 890 | | cli_testcase(506, [laws], ['../prob_examples/public_examples/B/Abrial_BBook/MembershipProperty6_Page96.mch', '-init', '-p', 'CLPFD', 'TRUE', '-strict'], 'Check that ProB finds counter example to erroneous rule from B-Book'). |
| 891 | | cli_testcase(507, [laws], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetCompr.mch', '-mc', '1000', '-nodead', '-cs', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). |
| 892 | | cli_testcase(508, [laws], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetComprCLPFD.mch', '-mc', '1000', '-nodead', '-cs', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). |
| 893 | | cli_testcase(509, [laws,strings], ['../prob_examples/public_examples/B/Laws/StringLaws.mch', '-t', '-mc', '500', '-nogoal', '-nodead', '-strict'], 'Some Laws about the STRING datatype'). |
| 894 | | cli_testcase(510, [laws], ['../prob_examples/public_examples/B/Laws/RelLaws.mch', '-init','-ppf', '../prob_examples/public_examples/B/Laws/RelLaws_internal.mch', '-strict'], 'Check that Pretty Printing works on a file with many operators'). |
| 895 | | cli_testcase(511, [csp_test,csp_det], ['../prob_examples/public_examples/CSP/other/Ivo/Deterministic1.csp', '-assertions', '-strict'], 'Check more CSP deterministic assertions'). |
| 896 | | cli_testcase(512, [csp_test,csp_det], ['../prob_examples/public_examples/CSP/other/Ivo/Deterministic2_v2.csp', '-assertions', '-strict'], 'Check more CSP deterministic assertions'). |
| 897 | | cli_testcase(513, [csp_test,csp_det,refinement], ['../prob_examples/public_examples/CSP/other/Ivo/WaterBoiler.csp', '-assertions', '-strict'], 'Check CSP assertions from WaterBoiler.csp example.'). |
| 898 | | cli_testcase(514, [tickets,dot], ['../prob_examples/public_examples/B/Mathematical/Voting/NoCondorcetWinnerKodkod.mch', '-t', '-strict', '-assertions','-dot_output', '../prob_examples/public_examples/B/Mathematical/Voting/dot_output/', '-dot_all'], 'Check that we have no problem with the existential quantifier; check dot output for assertion with perm.'). |
| 899 | | cli_testcase(515, [b_test,dot], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', '-mc', '100', '-cc', '36', '156', '-p', 'DEFAULT_SETSIZE', '3', '-df', '-strict','-dot', 'signature_merge','../prob_examples/public_examples/B/Demo/scheduler_spmdot.dot','-dot', dfa_merge, '../prob_examples/public_examples/B/Demo/scheduler_spddot.dot', '-dot','state_space', '../prob_examples/public_examples/B/Demo/scheduler_spdot.dot', '-pref_group', dot_colors, classic, '-p','DOT_PEN_WIDTH',1], 'Test reduced state space dot output.'). |
| 900 | | cli_testcase(516, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/Contrived/PartiallyEnumeratedSet.mch', '-mc', '100', '-cc', '3', '16', '-p', 'SYMMETRY_MODE', 'hash', '-strict'], 'Check that we detect unused enumerated set elements as symmetrical'). |
| 901 | | cli_testcase(517, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/Contrived/PartiallyEnumeratedSet.mch', '-mc', '100', '-cc', '3', '16', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], 'Check that we detect unused enumerated set elements as symmetrical'). |
| 902 | | cli_testcase(518, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/monitor2.mch', '-mc', '100', '-cc', '15', '92', '-p', 'SYMMETRY_MODE', 'hash', '-strict'], 'Check that we detect unused enumerated set elements as symmetrical'). |
| 903 | | cli_testcase(519, [symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/monitor2.mch', '-mc', '100', '-cc', '81', '529', '-p', 'SYMMETRY_MODE', 'off', '-strict'], 'Check original without symmetry'). |
| 904 | | cli_testcase(520, [tickets,csp_test], ['../prob_examples/public_examples/CSP/Tickets/Shi/hanoi7.csp', '-mc', '100', '-t', '-strict', '-expcterr', 'model_check_incomplete'], 'Check that exception does not occur (Ticket)'). |
| 905 | | cli_testcase(521, [tickets,csp_test], ['../prob_examples/public_examples/CSP/Tickets/Shi/hanoi4.csp', '-assertions', '-strict'], 'Check that exception does not occur (Ticket)'). |
| 906 | | cli_testcase(522, [tickets,csp_test], ['../prob_examples/public_examples/CSP/Tickets/ErrManagerLoop/PrintRoom.csp', '-mc', 100, '-strict','-expcterr', 'general_error_occurred', '-expcterr', check_channel_output_value], 'Check that channel output error detected and no infinite loop in printing error'). |
| 907 | | cli_testcase(523, [b_test,infinite,union], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteClosures4.mch', '-strict','-assertions'], 'Check that infininite function represented by union is detected and can be applied; also test setting MAXINT using 2**31-1'). |
| 908 | | cli_testcase(524, [tickets], ['../prob_examples/public_examples/B/Tickets/Beauger1/PredProblem.mch', '-t', '-strict'], 'Check that we can use relational composition ; with pred.'). |
| 909 | | cli_testcase(525, [b_test,infinite,finite], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteParityFunction.mch', '-t', '-strict', '-assertions'], 'Some more tests with infinite functions.'). |
| 910 | | cli_testcase(526, [b_test,infinite], ['../prob_examples/public_examples/EventBPrologPackages/Tests/FiniteInfiniteFunctions_ctx.eventb', '-assertions', '-strict'], 'Some more tests with infinite functions and the finite check in Event-B.'). |
| 911 | | cli_testcase(527, [b_test,infinite], ['../prob_examples/public_examples/B/PerformanceTests/InfinitePartialSqrtFunction.mch', '-t', '-strict'], 'Check that we can deal with a partial infinite function.'). |
| 912 | | cli_testcase(528, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/UsesLibraryMath.mch', '-t', '-strict', '-assertions'], 'Check that external functions work.'). |
| 913 | | cli_testcase(529, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/PrologFun.mch', '-assertions', '-strict'], 'Check that external functions PROLOG_FUN work.'). |
| 914 | | cli_testcase(530, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/PrintExternal.mch', '-t', '-strict'], 'Check that external printing functions work.'). |
| 915 | | cli_testcase(531, [b_test,external,strings], ['../prob_examples/public_examples/B/ExternalFunctions/LibraryStrings.mch', '-assertions', '-strict'], 'Check that external String functions work.'). |
| 916 | | cli_testcase(532, [symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/mondex_m1_c1_2.eventb', '-mc', 1000, '-p','SYMMETRY_MODE', hash, '-p','MAXINT',20, '-p','CLPFD', 'TRUE','-cc', 269, 4079, '-strict', '-expcterr', 'model_check_incomplete'], 'Check that symmetry reduction and detection of unused constants also works if we have too many disequality axioms.'). |
| 917 | | cli_testcase(533, [b_test,infinite], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteLanguageConcatenation.mch', '-mc', 1000, '-nodead','-assertions', '-check_complete', '-cc', '3', '2'], 'Check that this function is detected as infinite and not expanded.'). |
| 918 | | cli_testcase(534, [tickets], ['../prob_examples/public_examples/B/Tickets/Hansen3/TestingCircDef2.mch', '-mc', 1000, '-nodead','-assertions', '-check_complete', '-cc', '3', '2'], 'Check that the erroneous circular definition problem is gone.'). |
| 919 | | cli_testcase(535, [parser,tickets], ['-init', '-strict', '-evalt', '1+1=3', '-expcterr', 'eval_string'], 'Test that parser for eval strings works and that erroneous result caught.'). |
| 920 | | cli_testcase(536, [parser,tickets,infinite], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteParityFunction.mch', '-init', '-strict', '-evalt', 'not(finite({x|x>2}))','-evalt', 'not(finite(NATURAL))', '-evalf', 'finite({x|x>2})', '-evalt', 'finite(NAT1)', '-evalt', 'NATURAL /: FIN1(INTEGER)'], 'Test that parser for eval strings works.'). |
| 921 | | cli_testcase(537, [tickets,strings], [ '-init', '-strict', '-p','MAXINT',10, |
| 922 | | '-evalt', 'INTEGER/<:{1,2,3,7,9,10}', |
| 923 | | '-evalt', 'NATURAL/<:{1,2,3,7,9,10}', |
| 924 | | '-evalt', 'NATURAL1/<:{1,2,3,7,9,10}', |
| 925 | | '-evalt', 'NATURAL1/<:{0,1,2,3,4}', |
| 926 | | '-evalt', 'NATURAL1/<<:{1,2,3,7,9,10}', |
| 927 | | '-evalt', 'NATURAL1/<<:1..100', |
| 928 | | '-evalt', 'NATURAL1/<<:{x|x<100}', |
| 929 | | '-evalt', 'NATURAL1/<<:{x|x>0}', |
| 930 | | '-evalt', 'NATURAL1/<<:{x|x>=2}', |
| 931 | | '-evalf', 'NATURAL1/<<:{x|x>=0}', |
| 932 | | '-evalt', 'NATURAL/<<:{x|x>=0}', |
| 933 | | '-evalt', 'NATURAL1/<<:0..MAXINT', |
| 934 | | '-evalt', 'NATURAL1/<:0..MAXINT', |
| 935 | | '-evalt', 'NATURAL/<:0..MAXINT', |
| 936 | | '-evalf', 'NATURAL<:0..MAXINT', |
| 937 | | '-evalt', 'INTEGER/<:MININT..MAXINT', |
| 938 | | '-evalt', 'STRING/<<:{"a"}', |
| 939 | | '-evalt', 'STRING/<:{"a"}', |
| 940 | | '-evalf', 'STRING<:{"a"}', |
| 941 | | '-evalf', 'STRING<<:{"a"}', |
| 942 | | '-evalf', 'STRING/<:STRING', |
| 943 | | '-evalt', 'STRING/<<:STRING', |
| 944 | | '-evalt', 'BOOL /<<: {TRUE,FALSE}', |
| 945 | | '-evalf', 'BOOL /<: {TRUE,FALSE}', |
| 946 | | '-evalt', 'BOOL /<: {TRUE}' |
| 947 | | %, '-expcterr', 'eval_string_enum_warning' |
| 948 | | ], 'Test subset works without enum warnings.'). % used to be: 'Test that eval_string catches expansion errors.'). |
| 949 | | cli_testcase(538, [tickets], [ '-init', '-strict', '-p','MAXINT',10, '-evalt', '1..10 <: NATURAL1'], 'Test that these predicates do not cause enumeration warnings.'). |
| 950 | | cli_testcase(539, [b_test,kodkod], ['../prob_examples/public_examples/B/Kodkod/CrewAllocationConstantsLarge.mch', '-t', '-strict', '-p','TIME_OUT',3000, '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-properties', '-assertions'], 'Check that Kodkod translator works and that solution is ok (via -assertions). Skipped on Windows because of Memory restrictions.'). |
| 951 | | cli_testcase(540, [cbc,cbc_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter.mch', '-cbc_tests', 5 ,'count=MAX-1', '../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter_results.xml', '-cbc_cover', 'Increase', '-cbc_cover', 'Reset', '-cbc_cover', 'Halfway', '-p', 'CLPFD', 'TRUE', '-strict'], 'Check that CBC test-case generation works.'). |
| 952 | | cli_testcase(541, [csp_test,ltl], ['../prob_examples/public_examples/CSP/Tickets/WilliamsLTL/SimpleLTL.csp', '-ltlformulat', 'G([a] => F(e(a)))', '-strict'],'Check LTL formula in File.'). |
| 953 | | cli_testcase(542, [csp_test,ltl], ['../prob_examples/public_examples/CSP/Tickets/WilliamsLTL/SimpleLTL.csp', '-ltlformulat', 'not (GF e(a) => GF [a]) => F [b]', '-strict'],'Check LTL formula in File.'). |
| 954 | | cli_testcase(543, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/VendingMachine.csp', '-ltlformulat', 'G([coin] => F (e(coffee) & e(tea)))', '-strict'],'Check LTL formula in File.'). |
| 955 | | cli_testcase(544, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/VendingMachine.csp', '-ltlformulat', 'GF(e(coin))', '-strict'],'Check LTL formula in File.'). |
| 956 | | cli_testcase(545, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/dot_tuples_ltl_simple.csp', '-ltlformulat', 'G([d] => F(e(ch.a)))', '-strict'],'Check LTL formula in File.'). |
| 957 | | cli_testcase(546, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/dot_tuples_ltl_simple.csp', '-ltlassertions', '-strict'],'Check LTL formulas in File.'). |
| 958 | | cli_testcase(547, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/Simple_LTL_Tupels.csp', '-ltlassertions', '-strict'],'Check LTL formulas in File.'). |
| 959 | | cli_testcase(548, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/Simple_LTL_Tupels.csp', '-ltlformulat', 'GF([tau] => not e(c.a.10.10))', '-strict'],'Check LTL formula in File.'). |
| 960 | | cli_testcase(549, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/Simple_LTL_Tupels.csp', '-ltlformulat', '[e] U [c.a.1.10]', '-strict'],'Check LTL formula in File.'). |
| 961 | | cli_testcase(550, [b_test,recursion,external], ['../prob_examples/public_examples/B/ExternalFunctions/SortSet.mch', '-assertions', '-strict', '-p', 'CLPFD', 'TRUE'], 'Check that recursive sorting function works.'). |
| 962 | | cli_testcase(551, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/TestingCardinality.csp', '-assertions', '-strict', '-expcterr', virtual_time_out], ''). |
| 963 | | cli_testcase(552, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/DotTupleTestCase.csp', '-assertions', '-strict'], ''). |
| 964 | | cli_testcase(553, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/RecursiveSeqLenFunction.mch', '-t', '-strict', '-p', 'SYMBOLIC', 'FALSE'], 'Test that recursive functions work in non-symbolic mode.'). |
| 965 | | cli_testcase(554, [b_test,recursion,infinite,external], ['../prob_examples/public_examples/B/RecursiveFunctions/Factorial.mch', '-t', '-strict', '-p', 'SYMBOLIC', 'FALSE', '-assertions'], 'Test that other recursive function works.'). |
| 966 | | cli_testcase(555, [b_test,recursion,external,choose,sigma,union], ['../prob_examples/public_examples/B/RecursiveFunctions/RecursiveSigmaCHOOSEv1.mch', '-t', '-strict', '-p', 'SYMBOLIC', 'FALSE', '-assertions'], 'Test that union of explicit set and recursive lambda function works.'). |
| 967 | | cli_testcase(556, [parser,tickets], ['../prob_examples/public_examples/B/Tickets/DefinitionCallSwallow/PerserDefBug.mch', '-strict', '-mc', '1', '-expcterr', 'model_check_incomplete'], 'Regression test for Definitions Bug in Parser'). |
| 968 | | cli_testcase(557, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/Tests/NestedDef.mch', '-init', '-assertions','-strict', '-p', 'SYMBOLIC', 'FALSE'], 'Test that we do not accidentally treat nested definion of variable with same name as abstract constant.'). |
| 969 | | cli_testcase(558, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/Tests/RecursiveIntegerEquation.mch', '-init', '-assertions', '-p', 'SYMBOLIC', 'FALSE', '-mc', 100, '-nodead', '-check_complete', '-cc', '3', '3'], 'Test that we do not accidentally treat equation over non-relation type.'). |
| 970 | | cli_testcase(559, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/Tests/RecursiveEnumEquation.mch', '-init', '-assertions','-strict', '-p', 'SYMBOLIC', 'FALSE', '-mc', 100, '-nodead', '-check_complete', '-cc', '3', '2'], 'Test that we do not accidentally treat equation over non-relation type.'). |
| 971 | | cli_testcase(560, [b_test,csp_test], ['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-mc', '1000', '-strict', '-p', 'MAX_INITIALISATIONS', 15, '-check_complete', '-cc', '337', '1320'], 'Test that the dining philosophers without guidance by CSP have no deadlock'). |
| 972 | | cli_testcase(561, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/Dining/Dining.csp', '-mc', '1000', '-strict', '-expecterr', 'deadlock'], 'Test that the dining philosophers with guidance by CSP have a deadlock'). |
| 973 | | cli_testcase(562, [b_test,cbc_tests], ['../prob_examples/public_examples/EventBPrologPackages/Pitesti/BankAccount_mch.eventb', '-test_description', '../prob_examples/public_examples/EventBPrologPackages/Pitesti/test_description.xml', '-strict'], 'Simple constraint based test case generation'). |
| 974 | | cli_testcase(563, [b_test,mcm_tests], ['../prob_examples/public_examples/B/Daniel/TestM.mch', '-mcm_tests', '20', '1000', 'state = End', '../prob_examples/public_examples/B/Daniel/TestM_testcases.xml', '-strict'],'State based test generation'). |
| 975 | | cli_testcase(564, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/Tickets/Treharne1/Test_corrected.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/Tickets/Treharne1/Test-ctrl.csp', '-mc', '1000', '-strict', '-cc', 5, 6], 'Test that BOOL synchronises with CSP booleans'). |
| 976 | | |
| 977 | | cli_testcase(565, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/comsets.fuzz', '-t', '-strict'],'ProZ test'). |
| 978 | | cli_testcase(566, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/distributed_concatenation.fuzz', '-t', '-strict'],'ProZ test'). |
| 979 | | cli_testcase(567, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/compaction.fuzz', '-t', '-strict'],'ProZ test'). |
| 980 | | cli_testcase(568, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/zrm_refcard_ops.fuzz', '-t', '-strict'],'ProZ test'). |
| 981 | | cli_testcase(569, [b_test,ltl], ['../prob_examples/public_examples/B/SymmetryReduction/Fraikin/Library.mch','-p','IGNORE_HASH_COLLISIONS', |
| 982 | | 'TRUE','-p','FORGET_STATE_SPACE','FALSE','-p','SYMMETRY_MODE','hash', '-expcterr', 'model_check_incomplete','-mc','9999', |
| 983 | | '-ltlformulat','G( e(Reserve(m1,b1)) => not({b1:dom(reservation) & m1 : ran(reservation(b1))}) )', '-strict'],'Check enabled e() with multiple parameters'). |
| 984 | | cli_testcase(571, [b_test, let], ['../prob_examples/public_examples/B/Daniel/CommonSubLetBug.mch','-mc', '100', '-nodead', '-strict'], 'Regression test regarding let predicate and common subexpression elimination'). |
| 985 | | cli_testcase(572, [b_test,ltl],['../prob_examples/public_examples/B/LTL/DerrickSmith/Abstract.mch', '-ltlassertions', '-strict'],'Check ltl assertions from DEFINITIONS'). |
| 986 | | cli_testcase(573, [b_test,ltl],['../prob_examples/public_examples/B/LTL/Mikrowelle.mch', '-ltlassertions', '-strict'],'Check ltl assertions from DEFINITIONS'). |
| 987 | | cli_testcase(574, [b_test,ltl],['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-ltlassertions', '-expcterr', ltl, '-strict'],'Check ltl assertions from DEFINITIONS in Dining.mch'). |
| 988 | | cli_testcase(575, [csp_test,ltl,pragmas],['../prob_examples/public_examples/CSPB/Dining/Dining.csp', '-ltlassertions', '-strict'],'Check ltl assertions from Pragmas in Dining.csp'). |
| 989 | | cli_testcase(576, [b_test,ltl,cspb],['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/Dining/Dining.csp', '-ltlassertions', '-strict'],'Check ltl assertions from both Dining models in Csp and B.'). |
| 990 | | cli_testcase(577, [b_test,ltl],['../prob_examples/public_examples/B/LTL/DerrickSmith/Abstract.mch', '-ltlformulat', 'G([AOp2] => F(sink))', '-strict'],'Check ltl formula'). |
| 991 | | cli_testcase(578, [b_test,ltl],['../prob_examples/public_examples/B/LTL/DerrickSmith/Abstract.mch', '-ltlformulat', 'G([AOp2] => F(deadlock))', '-strict'],'Check ltl formula'). |
| 992 | | cli_testcase(579, [csp_test],['../prob_examples/public_examples/CSP/mydemos/ReplicatedSharing.csp', '-mc', '100000', '-t', '-check_complete', '-cc', '78', '302'],'Model check and trace replicated sharing processes.'). |
| 993 | | cli_testcase(580, [csp_test],['../prob_examples/public_examples/CSP/mydemos/SimpleReplicatedLinkedParallel.csp', '-mc', '100000', '-t', '-strict'],'Model check and trace replicated linked parallel processes.'). |
| 994 | | cli_testcase(581, [csp_test],['../prob_examples/public_examples/CSP/mydemos/SeqTests.csp', '-mc', '100000', '-nodead', '-t', '-strict'], 'Testing CSP sequences.'). |
| 995 | | cli_testcase(582, [csp_test],['../prob_examples/public_examples/CSP/other/Ivo/Sequences.csp', '-mc', '100000', '-t', '-strict'], 'Testing CSP sequence structures.'). |
| 996 | | cli_testcase(583, [b_test,tla],['../prob_examples/public_examples/TLA/GraphIso/GraphIso.tla', '-t', '-strict', '-p','TIME_OUT',7000], 'Testing TLA2B translation and loading.'). % increased time-out for commit 884a6ece23363e6d120cc9fdb3f72da9f6348f15: TO DO Investigate |
| 997 | | cli_testcase(584, [b_test,tla],['../prob_examples/public_examples/TLA/ErrorTests/GraphIso.tla', '-init', '-strict' |
| 998 | | %'-expcterr', tla2b_parser, '-expcterr', load_main_file % TLA2B no longer generates .mch file ! |
| 999 | | ],'Check that TLA2B does not overwrite pre-existing machine file'). |
| 1000 | | cli_testcase(585, [b_test],['-strict', |
| 1001 | | '-evalt_file', '../prob_examples/public_examples/Eval/SendMoreMoney.eval', '-p', 'CLPFD', 'TRUE'],'Check that we can evaluate expr/pred from file without loading another machine'). |
| 1002 | | cli_testcase(586, [b_test,tla],['../prob_examples/public_examples/TLA/Login/Login_Deadlock.tla', '-init', '-strict', |
| 1003 | | '-mc', 100, '-p', 'SYMMETRY_MODE', hash, '-expcterr', deadlock],'Check that config file found and model checking TLA works'). |
| 1004 | | cli_testcase(587, [csp_test],['../prob_examples/public_examples/CSP/other/Ivo/SeqsAndSetsTest.csp', '-t', '-strict'], 'Testing the CSP-M builtin functions seq(-) and set(-).'). |
| 1005 | | cli_testcase(588, [b_test,pragmas],['../prob_examples/public_examples/B/Pragmas/SymbolicPragmas.mch', '-init', |
| 1006 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 1007 | | '-assertions', '-strict'], 'Test that symbolic annotation pragma works.'). |
| 1008 | | cli_testcase(589,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/InputOutputChannelValues.csp', '-mc', '10000', '-t', '-strict'], 'Testing complicated CSP-M datatypes.'). |
| 1009 | | cli_testcase(590,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/CurryAgents.csp', '-mc', '10000', '-t', '-strict'], 'Testing Curry Agents in CSP-M models.'). |
| 1010 | | cli_testcase(591,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/replicates.csp', '-mc', '10000', '-t', '-strict'], 'Testing replicate processes.'). |
| 1011 | | cli_testcase(592,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/replicates2.csp', '-mc', '10000', '-t', '-strict'], 'Testing replicate processes.'). |
| 1012 | | cli_testcase(593, [b_test,cruise,operation_reuse,hash], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '25696', '--hash64', 753243318772366897, |
| 1013 | | '-strict', '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'MAX_INITIALISATIONS', 5], 'Test Operation Reuse'). % 17.9.2021: adapted hash from 203058745203935766 for sorted order of variables |
| 1014 | | cli_testcase(594, [b_test], [ '-init', '-strict', |
| 1015 | | '-evalt_rc', '!x.(x:1..10=>x<11)', '-evalf_rc', '!y.(y:1..10 => y<10)'], 'Test that universally quantified predicates work in eval_string.'). |
| 1016 | | cli_testcase(595, [b_test],['-strict', |
| 1017 | | '-eval_rule_file', '../prob_examples/public_examples/Eval/KnightsKnaves.eval', '-p', 'CLPFD', 'TRUE'],'Check that we can evaluate expr/pred from file with universal quantification'). |
| 1018 | | cli_testcase(596, [b_test,laws],['../prob_examples/public_examples/B/Laws/TautologiesPL.mch', '-p', 'CLPFD', 'TRUE', '-mc',100, '-nodead', '-cc',17,16, '-strict', '-p', 'MAX_INITIALISATIONS', 15],'Check a list of tautologies'). |
| 1019 | | cli_testcase(597,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/DotDatatypes.csp', '-mc', '10000', '-t', '-strict'], 'Testing complex datatypes.'). |
| 1020 | | cli_testcase(598,[tickets], ['../prob_examples/public_examples/B/Tickets/DefMchSameName/DefMchSameName.mch', '-ma', 7, 0 , 0, '-strict'], 'Testing that -main_assertions work properly.'). |
| 1021 | | cli_testcase(599,[tickets], ['../prob_examples/public_examples/B/Tickets/858/ubahn_mch4.eventb', '-init', '-expcterr', setup_constants_inconsistent , '-strict'], 'Testing that no call_residue.'). |
| 1022 | | cli_testcase(600,[tickets,symmetry_test], ['../prob_examples/public_examples/B/Tickets/1043/SymTest.mch', '-mc', 300, '-cc', 3, 31 , '-p', 'SYMMETRY_MODE', hash, '-strict'], 'Testing that symmetry detected for enumerated set elements which are not used.'). % used to be -cc 3 44 but now INITIALISATION arguments are derived from target state |
| 1023 | | cli_testcase(601,[tickets,symmetry_test], ['../prob_examples/public_examples/B/Tickets/1043/SymTest.mch', '-mc', 300, '-cc', 3, 31 , '-p', 'SYMMETRY_MODE', nauty, '-strict'], 'Testing that symmetry detected for enumerated set elements which are not used.'). % used to be -cc 3 44 but now INITIALISATION arguments are derived from target state |
| 1024 | | cli_testcase(602,[tickets,symmetry_test], ['../prob_examples/public_examples/B/Tickets/1043/SymTest.mch', '-mc', 300, '-cc', 197, 238 , '-p', 'SYMMETRY_MODE', flood, '-strict'], 'Testing that symmetry detected for enumerated set elements which are not used.'). |
| 1025 | | cli_testcase(603,[b_test], ['../prob_examples/public_examples/B/Tester/DefinitionMultiInclude/Main.mch', '-init', '-aa', 3, 0,0, '-strict'], 'Test same DEFINITION file include twice in different contexts.'). |
| 1026 | | cli_testcase(604, [csp_test,ltl],['../prob_examples/public_examples/CSP/mydemos/demo/Peterson_v2.csp', '-ltlformulat', 'G(not [critical.2])', '-strict', '-expcterr' ,ltl ],'Check ltl formula is reported as false'). |
| 1027 | | cli_testcase(605, [b_test], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-init', '-strict', '-eval', '(A <=> (waiting={})) & A', %'-p', 'BOOL_AS_PREDICATE', 'FALSE', |
| 1028 | | '-expcterr' ,parse_machine_predicate_error], 'Test that BOOL as predicate can be disabled.'). |
| 1029 | | % BOOL_AS_PREDICATE is no longer supported: |
| 1030 | | %cli_testcase(606, [b_test], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-init', '-strict', '-evalt', '(A <=> (waiting={})) & A', '-evalf', '(B <=> (waiting={})) & (B <=> not(waiting={}))', '-evalt', '!x.(x:1..10 => (A <=> x>z)) & z:0..11 & not(A)', '-p', 'BOOL_AS_PREDICATE', 'TRUE'], 'Test that BOOL as predicate works.'). |
| 1031 | | %cli_testcase(607, [b_test,sat],['-strict', |
| 1032 | | % '-evalt_file', '../prob_examples/public_examples/Eval/SAT_uf20-02_pred.eval', '-p', 'CLPFD', 'TRUE', '-p', 'BOOL_AS_PREDICATE', 'TRUE'],'Test that BOOL as predicate works.'). |
| 1033 | | cli_testcase(608,[tickets], ['../prob_examples/public_examples/B/Tickets/ConcatDisjUnion/SimpleGrammar.mch', '-init', '-mc', 100 , '-nodead', '-cc', 4, 3, '-strict'], 'Testing that concat does not generate wrong solutions.'). |
| 1034 | | cli_testcase(609,[tickets,b_test], ['../prob_examples/public_examples/B/Compilers/SyracuseGrammar.mch', '-init', '-mc', 100 , '-expcterr', deadlock, '-strict', '-p', 'CLPFD', 'FALSE'], 'Testing that concat works efficiently enough.'). |
| 1035 | | cli_testcase(610,[tickets,b_test], ['../prob_examples/public_examples/B/Compilers/SyracuseGrammar.mch', '-init', '-mc', 100 , '-expcterr', deadlock, '-strict', '-p', 'CLPFD', 'TRUE'], 'Testing that concat works efficiently enough.'). |
| 1036 | | cli_testcase(611,[b_test,infinite], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteRelationImage.mch', '-init', '-assertions', '-properties', '-strict', '-p', 'CLPFD', 'TRUE'], 'Testing that image for infinite relation works.'). |
| 1037 | | cli_testcase(612, [b_test,recursion,external,quantified,union], ['../prob_examples/public_examples/B/Compilers/NFA.mch', '-t', '-mc', 100, '-cc', 6, 12, '-assertions','-strict'], 'Test recursive function with recursive call inside UNION.'). |
| 1038 | | cli_testcase(613, [b_test,pragmas],['../prob_examples/public_examples/B/Pragmas/AssertionPragmas.mch', '-init', '-pp', '../prob_examples/public_examples/B/Pragmas/AssertionPragmas_internal.mch', '-strict'], 'Test that labels recognised.'). |
| 1039 | | cli_testcase(614, [b_test,recursion,infinite,quantified,refinement],['../prob_examples/public_examples/B/Compilers/NFA_det.ref', '-init', '-refchk', '../prob_examples/public_examples/B/Compilers/NFA_nondet_refine_spec.P', '-cc', 10, 22, '-strict'], 'Test trace refinement checking and ABSTRACT_CONSTANT reuse in NFA_det.'). |
| 1040 | | cli_testcase(615,[b_test,ltl], ['../prob_examples/public_examples/B/LTL/Tests/LTL_1State.mch', '../prob_examples/public_examples/B/LTL/Tests/LTL_2States.mch', '-init', '-ltlassertions', '-strict'], 'Testing LTL formulas on simple statespaces.'). |
| 1041 | | cli_testcase(616, [b_test],['../prob_examples/public_examples/B/Tester/Partition.mch', '-init', '-assertions','-pp','../prob_examples/public_examples/B/Tester/Partition_internal.mch', '-strict'], 'Test that partition properly solved and printed.'). |
| 1042 | | cli_testcase(617, [parser,b_test,tickets],['../prob_examples/public_examples/B/Tickets/RefLoadLoop/NFA_det.ref', '-expcterr', 'load_main_file', '-expcterr', invalid_machine_reference, '-expcterr', b_load_machine, '-strict'], 'Test that parser does not loop.'). |
| 1043 | | cli_testcase(618,[b_test,ltl], ['../prob_examples/public_examples/B/LTL/Tests/LTL_4States.mch', '-init', '-ltlassertions', '-strict'], 'Testing LTL formulas on simple statespaces.'). |
| 1044 | | cli_testcase(619,[b_test,ctl], ['../prob_examples/public_examples/B/LTL/Tests/CTL_SetMove_2States.mch', '-init', |
| 1045 | | '-ctlformulat', 'AG(EX{xx=bb})', '-ctlformula', 'AGEFEX[Move]true', '-ctlformula', 'AGEFEX[Set(aa)]{xx=aa}', |
| 1046 | | '-ctlformulat', 'not(EF EX[Set(aa)]{xx=bb})', |
| 1047 | | '-ctlformulat', 'EF EG {xx=bb}', |
| 1048 | | '-ctlformulat', '{xx=bb} => EG {xx=bb}', |
| 1049 | | '-ctlformulat', '{xx=bb} => not AF {xx=aa}', |
| 1050 | | '-ctlformulat', '{xx=bb} => AF {not(xx=aa)}', |
| 1051 | | '-strict'], 'Testing CTL formulas on simple statespaces.'). |
| 1052 | | cli_testcase(620,[b_test,ctl], ['../prob_examples/public_examples/B/LTL/Tests/CTL_SetMove_2States.mch', '-init', '-ctlformulat', '(EF EX[Set(aa)]{xx=bb})', '-expcterr', ctl,'-strict'], 'Testing CTL formulas on simple statespaces.'). |
| 1053 | | cli_testcase(621,[b_test,ctl], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-init', |
| 1054 | | '-ctlformulat', 'AG ( EX[swap]true => {active /= {}})', |
| 1055 | | '-ctlformulat', 'AG ( (EX[new]true) or (EX[del]true) or (EX[swap]true) )', |
| 1056 | | '-ctlformulat', 'AF {card(waiting)>0}', |
| 1057 | | '-ctlformulat', 'AG( {card(active)>0} => EG e(swap))', |
| 1058 | | '-strict'], 'Testing CTL formulas on simple statespaces.'). |
| 1059 | | cli_testcase(622,[b_test,ctl], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-init','-ctlformulat', 'AG ( (EX[new]true) or (EX[del]true) )', '-expcterr', ctl,'-strict'], 'Testing CTL formulas on simple statespaces.'). |
| 1060 | | cli_testcase(623,[tickets,infinite,closure1], ['../prob_examples/public_examples/B/PerformanceTests/Closure1_Computations.mch', '-init', '-assertions','-strict'], 'Check that closure1 works well for large or infinite sets.'). |
| 1061 | | cli_testcase(624,[csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/AIDCPRB_small.csp', '-mc', '10000', '-t', '-strict'], 'Testing complex datatypes.'). |
| 1062 | | cli_testcase(625, [b_test,tla,choose],['../prob_examples/public_examples/TLA/Tests/ChooseTest.tla', '-mc', 100, '-check_complete', '-cc', '3', '3'], 'Testing TLA2B translation and loading.'). |
| 1063 | | cli_testcase(626, [b_test],['../prob_examples/public_examples/B/PerformanceTests/TestFD_Domain_Narrowing.mch', '-t', '-p', 'CLPFD', 'TRUE', '-strict'], 'Test CLPFD on enumerated sets.'). |
| 1064 | | cli_testcase(627, [cbc,smt_test,cbc_tests], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc_sequence', 'new;new;del;ready', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE'], 'Check cbc_sequence'). |
| 1065 | | cli_testcase(628, [cbc,smt_test,cbc_tests], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc_sequence', 'new;new;del;del;del', '-strict', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE', '-expcterr', cbc_sequence_no_solution_found], 'Check cbc_sequence'). |
| 1066 | | cli_testcase(629, [tickets,wd], ['../prob_examples/public_examples/B/Tickets/Burdy1/TestOrApplyFunErr.mch', '-mc', '1000', '-expcterr', well_definedness_error, '-strict'], 'Check issue with undefined function application in context of disjunct.'). |
| 1067 | | cli_testcase(630, [tickets], ['../prob_examples/public_examples/B/Tickets/PROBCORE-45/NotIntervalSol.mch', '-init', '-p', 'MAX_INITIALISATIONS', 30, '-mc', '1000', '-expcterr', 'model_check_incomplete', '-nodead', '-assertions', '-cbc_assertions', '-strict'], 'Check problem with not subset for intervals.'). |
| 1068 | | cli_testcase(631, [tickets], ['../prob_examples/public_examples/B/Tickets/PROBCORE-45/NotIntervalSol.mch', '-init', '-p', 'MAX_INITIALISATIONS', 30, '-p', 'CLPFD', 'TRUE', '-mc', '1000', '-expcterr', 'model_check_incomplete', '-nodead', '-assertions', '-cbc_assertions', '-strict'], 'Check problem with not subset for intervals.'). |
| 1069 | | cli_testcase(632, [cbc,smt_test], ['-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-strict', '-p', 'DEFAULT_SETSIZE', 2, '../prob_examples/public_examples/B/CBC/data_structure1_ctx_theorem_error.eventb', '-cbc_assertions', '-expcterr',cbc_assertions, '-p', 'PROOF_INFO', 'TRUE'], 'Check CBC static assertion checking.'). |
| 1070 | | cli_testcase(633, [tickets], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestR_label_reuse.eventb', '-mc', 1000, '-noass', '-strict', '-expcterr', 'invariant_violation', '-p', 'PROOF_INFO', 'TRUE'], 'Test that PROOF_INFO not confused by two invariants with same name (inv3).'). |
| 1071 | | cli_testcase(634, [b_test,kodkod,dot,closure1], ['../prob_examples/public_examples/B/Kodkod/Loop.mch', '-strict', '-mc', 20, '-nodead', '-bf', '-p', 'MAX_INITIALISATIONS', 8, '-p', 'CLPFD', 'TRUE', '-cc', 15, 14, '-dot', 'state_space', '../prob_examples/public_examples/B/Kodkod/Loop_statespace.dot'], 'Test performance on example where ProB used to be very slow'). %% HAD TO INCREASE MAX_INITIALISATION to 15 from 8 since adding in_domain_wf to element_of_closure1_wf; TO DO: FIX |
| 1072 | | cli_testcase(635, [b_test,kodkod], ['../prob_examples/public_examples/B/Kodkod/Loop.mch', '-strict', '-mc', 20, '-nodead', '-bf', '-p', 'MAX_INITIALISATIONS', 8, '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-cc', 15, 14], 'Test performance on Loop example with Kodkod'). |
| 1073 | | cli_testcase(636, [b_test], ['../prob_examples/public_examples/EventBPrologPackages/ConfigChooser/PetChooser_mch.eventb', '-strict', '-mc', 300, '-p', 'CLPFD', 'TRUE', '-cc', 41, 236], 'Test performance on example where ProB used to be very slow'). |
| 1074 | | cli_testcase(637, [b_test,kodkod,strings,closure1], ['../prob_examples/public_examples/B/Kodkod/LoopAsStrings.mch', '-strict', '-mc', 20, '-nodead', '-bf', '-p', 'MAX_INITIALISATIONS', 8, '-p', 'CLPFD', 'TRUE', '-cc', 15, 14], 'Test performance on example where ProB used to be very slow'). %% HAD TO INCREASE MAX_INITIALISATION to 15 from 8 since adding in_domain_wf to element_of_closure1_wf; TO DO: FIX |
| 1075 | | cli_testcase(638, [b_test,recursion,external], ['../prob_examples/public_examples/B/Tickets/TransitiveClosure/ComputeTClos_mch.eventb', '-t', '-strict', '-p', 'SYMBOLIC', 'FALSE', '-assertions'], 'Test that recursive function works in Event-B.'). |
| 1076 | | cli_testcase(639, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsPow.mch', '-mc', '500', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'FALSE', '-expcterr', 'model_check_incomplete'], 'Laws about sets of sets'). |
| 1077 | | cli_testcase(640, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsPow.mch', '-mc', '500', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Laws about sets of sets'). |
| 1078 | | cli_testcase(641, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsPow.mch', '-mc', '500', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SYMBOLIC', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Laws about sets of sets'). |
| 1079 | | cli_testcase(642, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsPowPow.mch', '-mc', '250', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Laws about sets of sets'). |
| 1080 | | cli_testcase(643, [laws,card], ['../prob_examples/public_examples/EventBPrologPackages/Deploy/s1_mch1_switches_mch.eventb', '-mc', '250', '-p', 'DEFAULT_SETSIZE', 2, '-strict', '-p', 'CLPFD', 'TRUE', '-cc', 10, 30], 'Check that deferred set is set to at least 3'). |
| 1081 | | cli_testcase(644, [laws,card], ['../prob_examples/public_examples/EventBPrologPackages/Laws/TestPartitionDeferredSetCardMch_mch.eventb', '-mc', '250', '-nodead', '-p', 'DEFAULT_SETSIZE', 2, '-strict', '-p', 'CLPFD', 'TRUE', '-cc', 5, 6], 'Check that deferred set is set to at least 6'). |
| 1082 | | %cli_testcase(645, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/WrongComparisonInInvariant.mch', '-plugin', 'units', '-expecterr', 'well_definedness_error', '-strict', '-mc', 5], ''). |
| 1083 | | cli_testcase(646, [b_test,cache], ['../prob_examples/public_examples/B/Puzzles/CrewAllocationConstants.mch', '-t', '-strict', '-p','TIME_OUT',3000, '-cache', 'cache_does_not_exist/', '-expecterr', cache], 'Check that -cache option works on simple example.'). |
| 1084 | | cli_testcase(647, [b_test,cache], ['../prob_examples/public_examples/B/Puzzles/CrewAllocationConstants.mch', '-t', '-strict', '-p','TIME_OUT',3000, '-cache', '../prob_examples/public_examples/cache/'], 'Check that -cache option works on simple example.'). |
| 1085 | | cli_testcase(648, [b_test,cache], ['../prob_examples/public_examples/B/Puzzles/CrewAllocationConstants.mch', '-t', '-strict', '-p','TIME_OUT',3000, '-cache', '../prob_examples/public_examples/cache/'], 'Check that -cache option works on simple example (2nd time).'). |
| 1086 | | cli_testcase(649, [tickets,infinite], ['../prob_examples/public_examples/B/Tickets/PROB-83/Time.mch', '-t', '-strict'], 'Check infinite function works. (PROB-83)'). |
| 1087 | | cli_testcase(650, [tickets,cbc,override], ['../prob_examples/public_examples/B/Tickets/Berkani1/CartesianProductOverrideAssertion.mch', '-cbc_assertions', '-strict', '-expcterr',cbc_assertions], 'Check that counter example for Cartesian product found.'). |
| 1088 | | cli_testcase(651, [tickets,override], ['../prob_examples/public_examples/B/Tickets/Berkani1/CartesianProductOverride.mch', '-init', '-strict', '-p', 'CLPFD', 'TRUE', '-properties', '-assertions'], 'Check that counter example for Cartesian product found.'). |
| 1089 | | cli_testcase(652, [tickets,infinite,recursion], ['../prob_examples/public_examples/B/Compilers/TuringMachine_Goedelisation.mch', '-mc', 300, '-p', 'CLPFD', 'TRUE', '-expecterr', deadlock, '-strict', '-cc', 245, 244], 'Check machine with several complicated infinite & recursive functions.'). |
| 1090 | | cli_testcase(653, [tickets], ['../prob_examples/public_examples/B/Tickets/Mejia5/essai_fncs.mch', '-t', '-strict'], 'Check ticket (with NAT >+> NAT)'). |
| 1091 | | cli_testcase(654, [laws], ['../prob_examples/public_examples/B/Laws/SetRelLaws_NatBool.mch', '-mc', '750', '-nodead', '-cs', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Various laws about relations.'). |
| 1092 | | cli_testcase(655, [typechecker_test,tickets], ['-mc','1000','../prob_examples/public_examples/B/Tickets/PROB-46/Validate.mch','-expecterr',type_error ,'-expecterr', load_main_file, '-expecterr', b_read_write_info, '-strict'], 'Check type-error: Operation calls another operation of the same machine.'). % ADDED '-expecterr', btypechecker --> TO DO: ensure that we do not raise internal errors here !! <-------------- |
| 1093 | | cli_testcase(656, [b_test], ['../prob_examples/public_examples/B/Mathematical/PostCorrespondence_Turing_MC.mch', '-mc', '750', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expecterr', goal_found], 'A non-trivial machine.'). |
| 1094 | | %cli_testcase(657, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SimpleCorrectUsage.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SimpleCorrectUsage_internal.mch'], ''). |
| 1095 | | cli_testcase(658, [cbc,cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Deploy/s4_mch9_schedule_mch.eventb', '-cbc_deadlock', '-p', 'SMT', 'TRUE', '-strict', '-p', 'CLPFD', 'TRUE', '-p','DEFAULT_SETSIZE',1], 'Check no typing error.'). |
| 1096 | | cli_testcase(659, [cbc,cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Deploy/s4_mch9_schedule_mch.eventb', '-cbc', 'all', '-p', 'SMT', 'TRUE', '-strict', '-p', 'CLPFD', 'TRUE', '-p','DEFAULT_SETSIZE',1], ''). |
| 1097 | | cli_testcase(660, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/TestLibraryIO.mch', '-t', '-strict', '-p', 'CLPFD', 'TRUE'], 'Test IO Library'). |
| 1098 | | %cli_testcase(661, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/MultiplicationConversion.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/MultiplicationConversion_internal.mch'], ''). |
| 1099 | | %cli_testcase(662, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/KnownExponent.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/KnownExponent_internal.mch'], ''). |
| 1100 | | cli_testcase(664, [ltl], ['../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter.mch', '-ltllimit', '50', '-ltlformula', 'G({1=1}=>X{2=2})', '-strict', |
| 1101 | | '-p', 'use_safety_ltl_model_checker', false, |
| 1102 | | '-expcterr', ltl_incomplete, '-expcterr', state_space], 'check that no error reported for incomplete model check'). |
| 1103 | | %cli_testcase(665, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/Car.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/Car_internal.mch'], ''). |
| 1104 | | %cli_testcase(666, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/TrafficLight.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/TrafficLight_internal.mch'], ''). |
| 1105 | | %cli_testcase(667, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/System.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/System_internal.mch'], ''). |
| 1106 | | cli_testcase(668, [ltl,csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/BobAlice.csp', '-ltlassertions', '-strict'],'Check LTL formulas in File.'). |
| 1107 | | %cli_testcase(669, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/IncorrectUnitDefinition.mch', '-plugin', 'units', '-strict', '-expecterr', 'incorrect_unit_definition'], ''). |
| 1108 | | %cli_testcase(670, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/BoolAndString.mch', '-plugin', 'units', '-strict','-mc', 5], 'Bool and String are not annotated / used by the unit plugin. Just check that there is no error.'). |
| 1109 | | %cli_testcase(672, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/WrongOperation.mch', '-plugin', 'units', '-strict', '-expecterr', 'well_definedness_error', '-mc', 5], ''). |
| 1110 | | %cli_testcase(673, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IrregularConversions.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IrregularConversions_internal.mch'], ''). |
| 1111 | | %cli_testcase(675, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IfTypeAndClash.mch','-plugin','units','-expecterr','well_definedness_error','-strict','-pp','../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IfTypeAndClash_internal.mch'], ''). |
| 1112 | | %cli_testcase(676, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/UserDefinedAlias.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/UserDefinedAlias_internal.mch'], ''). |
| 1113 | | %cli_testcase(677, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_internal.mch'], ''). |
| 1114 | | %cli_testcase(678, [plugin_units,imp,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_i.imp', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_i_internal.mch'], ''). |
| 1115 | | %cli_testcase(679, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel0.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel0_internal.mch'], ''). |
| 1116 | | %cli_testcase(680, [plugin_units,imp,pragmas,refinement], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel_i.imp', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel_i_internal.mch'], |
| 1117 | | %'also checks that invariants copied to refinement machine'). |
| 1118 | | %cli_testcase(681, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IntegerOperations.mch', '-plugin', 'units', '-strict', '-expecterr', 'well_definedness_error', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IntegerOperations_internal.mch','-p', 'plugin(units,fixpoint_halt_on_error)','false'], ''). |
| 1119 | | cli_testcase(682, [ltl,csp_test], ['../prob_examples/public_examples/CSP/slicing/peterson_modelcheck.csp', '-ltlassertions', '-strict'],'Check LTL formulas in File.'). |
| 1120 | | %cli_testcase(683, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/AdditionConversion.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/AdditionConversion_internal.mch'], ''). |
| 1121 | | cli_testcase(684, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/AIDCPRB.csp', '-mc', '10000', '-nodead', '-check_complete', '-cc', '8650', '20089'],'Model checking test for fixed bug number 3675.'). |
| 1122 | | cli_testcase(685, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/SafetyPRB.csp', '-mc', '150000', '-nodead', '-cc', '74528', '297023'],'Model checking test for fixed bug number 3675.'). |
| 1123 | | %cli_testcase(686, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SequenceOperations.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SequenceOperations_internal.mch'], ''). |
| 1124 | | cli_testcase(687, [b_test,csp_test,cspb,strings], ['../prob_examples/public_examples/CSPB/FeatureTests/StringMachine.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/FeatureTests/StringMachine.csp', '-mc', '1000', '-strict', '-expecterr', 'deadlock'], 'Test that the machine with guidance by CSP have a deadlock'). |
| 1125 | | %cli_testcase(688, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/SomeUnitErrors.mch', '-plugin', 'units', '-strict', '-expecterr', 'well_definedness_error'], ''). |
| 1126 | | cli_testcase(689, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Advance/Safety_Metro_23_08_2012/GCDoor_M2_mch.eventb', '-cbc', all, '-strict'], 'Test that proof info works well and no invariant checked'). |
| 1127 | | cli_testcase(690, [cbc,refinement], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/M1_err_mch.eventb', '-cbc', all, '-strict', '-expecterr', cbc, '-expecterr', 'event_refinement', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE'], 'Test that error detected'). |
| 1128 | | cli_testcase(691, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestInvPreserv_M2_ko_mch.eventb', '-mc', 100, '-strict', '-expecterr', 'invariant_violation', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', 1], 'Test that error detected'). |
| 1129 | | cli_testcase(692, [eventb_test,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestInvPreserv_M2_ko_mch.eventb', '-mc', 100, '-nodead', '-strict', '-expecterr', 'event_error:setX:action_not_executable', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE'], 'Test that error detected'). |
| 1130 | | cli_testcase(693, [eventb_test,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestInvPreserv_M2_ko_rename.eventb', '-mc', 100, '-strict', '-expecterr', 'invariant_violation', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', 1], 'Test that error detected'). |
| 1131 | | cli_testcase(694, [eventb_test,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestInvPreserv_M2_ko_rename.eventb', '-mc', 100, '-nodead', '-strict', '-expecterr', 'event_error:setX3:action_not_executable', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE'], 'Test that error detected'). |
| 1132 | | %cli_testcase(695, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnits.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnits_internal.mch'], ''). |
| 1133 | | %cli_testcase(696, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnitsUnsat.mch', '-plugin', 'units', '-strict','-expecterr', 'well_definedness_error', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnitsUnsat_internal.mch'], ''). |
| 1134 | | cli_testcase(697, [tickets,external], ['../prob_examples/public_examples/B/Tickets/Burlando1/machine_test_PRINTF.mch', '-t', '-strict'], 'Test PRINTF'). |
| 1135 | | cli_testcase(698, [b_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SudokuAsConstant.mch', '-t','-strict', '-p', 'TRACE_INFO', 'TRUE'], 'Check TRACE_INFO flag'). |
| 1136 | | cli_testcase(699, [cbc,cbc_deadlock,exists], ['../prob_examples/public_examples/B/CBC/ExistsDeadlockTests.mch', '-cbc_deadlock', '-p', 'TRACE_INFO', 'TRUE','-expcterr', 'cbc_deadlock_check', '-strict'], 'Check that guard simplification works correctly'). |
| 1137 | | %cli_testcase(700, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m0.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m0_internal.mch'], ''). |
| 1138 | | %cli_testcase(701, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m1.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m1_internal.mch'], ''). |
| 1139 | | cli_testcase(702, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/SetLaws.tla', '-mc', 1000, '-nodead', '-strict', '-expcterr', 'model_check_incomplete'], 'Testing TLA2B translation laws.'). |
| 1140 | | cli_testcase(703, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/NatLaws.tla', '-mc', 1000, '-nodead', '-strict', '-expcterr', 'model_check_incomplete'], 'Testing TLA2B translation laws.'). |
| 1141 | | %cli_testcase(704, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m0.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m0_internal.mch'], ''). |
| 1142 | | %cli_testcase(705, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m1.mch','-expcterr',bmachine_static_checks, '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m1_internal.mch'], ''). |
| 1143 | | %cli_testcase(706, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m2.mch','-expcterr',bmachine_static_checks, '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m2_internal.mch'], ''). |
| 1144 | | %cli_testcase(707, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m3.mch','-expcterr',bmachine_static_checks, '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m3_internal.mch'], ''). |
| 1145 | | cli_testcase(708, [laws],['../prob_examples/public_examples/B/Kodkod/LawsArithmeticCsts.mch', '-init', '-expcterr', 'setup_constants_fails','-strict', '-p', 'CLPFD', 'TRUE'], 'Testing setting up constants finds no counter-example to mathematical laws.'). |
| 1146 | | cli_testcase(709, [laws,kodkod],['../prob_examples/public_examples/B/Kodkod/LawsArithmeticCsts.mch', '-init', '-expcterr', 'setup_constants_fails','-strict', '-p', 'CLPFD', 'FALSE', '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod','-p', 'TIME_OUT', '9000', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE'], 'Testing setting up constants finds no counter-example to mathematical laws.'). |
| 1147 | | cli_testcase(710, [laws],['../prob_examples/public_examples/B/Kodkod/LawsSetsCsts.mch', '-init', '-expcterr', 'setup_constants_fails', '-p', 'CLPFD', 'TRUE', '-strict', '-p', 'TIME_OUT', 3500], 'Testing setting up constants finds no counter-example to mathematical laws.'). |
| 1148 | | cli_testcase(711, [laws,kodkod],['../prob_examples/public_examples/B/Kodkod/LawsRelCsts.mch', '-init', '-expcterr', 'setup_constants_fails','-strict', '-p', 'CLPFD', 'FALSE', '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE'], 'Testing setting up constants finds no counter-example to mathematical laws.'). |
| 1149 | | cli_testcase(712, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/AppendBuiltInFunctionTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the built-in operator ^ raises expected error.'). |
| 1150 | | cli_testcase(713, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/ConcatBuiltInFunctionTypeError1.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the concat(<...>) built-in function raises expected error.'). |
| 1151 | | cli_testcase(714, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/ConcatBuiltInFunctionTypeError2.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the concat(<...>) built-in function raises expected error.'). |
| 1152 | | cli_testcase(715, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/ExpandingInfiniteSequenceError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing of raising error by expanding infinite sequences.'). |
| 1153 | | cli_testcase(716, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/HeadBuiltInFunctionTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the head(-) built-in function raises expected error.'). |
| 1154 | | cli_testcase(717, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/IsElemListTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'general_error_occurred'], 'Testing if the elem(-,-) built-in function raises expected error.'). |
| 1155 | | cli_testcase(718, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/LengthBuiltInFunctionInfiniteSeqError.csp', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock', '-strict'], 'Testing if the length(-) built-in function raises expected error by calling it with infinite sequence.'). |
| 1156 | | cli_testcase(719, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/LengthBuiltInFunctionTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the length(-) built-in function raises expected error.'). |
| 1157 | | cli_testcase(720, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/NullBuiltInFunctionTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the null(-) built-in function raises expected error.'). |
| 1158 | | cli_testcase(721, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/SeqBuiltInFunctionTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the seq(-) built-in function raises expected error.'). |
| 1159 | | cli_testcase(722, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/SetBuiltInFunctionTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the set(-) built-in function raises expected error.'). |
| 1160 | | cli_testcase(723, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sequences/TailBuiltInFunctionTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sequences', '-expcterr', 'deadlock'], 'Testing if the tail(-) built-in function raises expected error.'). |
| 1161 | | cli_testcase(724, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/ReplicatedInternalChoiceEmptySetError.csp', '-strict', '-mc', 10,'-expcterr', 'cspm_trans', '-expcterr', 'deadlock'], 'Testing of error raising by defining a replicated internal choice process over an empty set.'). |
| 1162 | | cli_testcase(725, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/EmptySetTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing if the empty(-) built-in function raises expected error.'). |
| 1163 | | cli_testcase(726, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ReplicatedOperatorsOverEmptyPatternSets.csp', '-strict', '-mc', 10], 'Testing replicated operators over over empty pattern sets (||| x:{}@ P, ; x:<>@P, || x:{} @[a] P and [|a|] x:{} @P).'). |
| 1164 | | cli_testcase(727, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/EmptySetInReplicatedLinkedParallelError.csp', '-strict', '-mc', 10,'-expcterr', 'haskell_csp', '-expcterr', 'csp_sequences', '-expcterr', 'general_error_occurred'], 'Testing of error raising by defining a replicated linked parallel process over an empty set.'). |
| 1165 | | cli_testcase(728, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/InterleavingSpecialCase.csp', '-strict', '-mc', 10, '-expcterr', 'deadlock'], 'Testing a special case of the |||-operator (STOP ||| STOP).'). |
| 1166 | | cli_testcase(729, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/UndefinedConstructError.csp', '-strict', '-mc', 10, '-expcterr', 'general_error_occurred', '-expcterr', 'full_normalise_csp_process'], 'Testing for raising undefined constructor error.'). |
| 1167 | | cli_testcase(730, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/TooManyOutputValuesOnChannelError.csp', '-strict', '-mc', 10, '-expcterr', 'enumerate_action', '-expcterr', 'general_error_occurred'], 'Testing for raising an error, when there are too many output values on channel.'). |
| 1168 | | cli_testcase(731, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/NotABooleanValueErrorIfThenElse.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for raising an error, when there is no boolean value expression in the if-then-else-condition.'). |
| 1169 | | cli_testcase(732, [laws,kodkod],['../prob_examples/public_examples/B/Kodkod/LawsSetsCsts.mch', '-init', '-expcterr', 'setup_constants_fails','-strict', '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE'], 'Testing setting up constants finds no counter-example to mathematical laws.'). |
| 1170 | | cli_testcase(733, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/TestVariableProbing.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/TestVariableProbing.csp', '-t', '-strict'], 'Test probing of B variables'). |
| 1171 | | cli_testcase(734, [laws,kodkod], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetCompr.mch', '-init', '-cs', '-p', 'KODKOD','TRUE', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). |
| 1172 | | cli_testcase(735, [laws,kodkod], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetComprCLPFD.mch', '-init', '-cs', '-p', 'KODKOD','TRUE', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). |
| 1173 | | cli_testcase(736, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/EventB/m_partner_behaviour.eventb', '-csp-guide', '../prob_examples/public_examples/CSPB/EventB/m_partner_behaviour.csp', '-t', '-strict'], 'Test Event-B+CSP + discharged calc'). % Warning: Event-B model has error (modification of variable EndStateVar not allowed in receive_Request) |
| 1174 | | cli_testcase(737, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/LibraryFiles.mch', '-init', '-assertions','-strict'], 'Check that external functions work.'). |
| 1175 | | cli_testcase(738, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/freetypes.fuzz', '-mc', '1000', '-nodead', '-strict'],'ProZ test for freetypes'). |
| 1176 | | cli_testcase(739, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/ChannelOutputValuesError.csp', '-strict', '-mc', 10, '-expcterr', 'evaluate_channel_outputs', '-expcterr', 'deadlock'], 'Testing raising an error when no channel tuple is given as prefix event.'). |
| 1177 | | cli_testcase(740, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/TypeErrorInChannelOutput.csp', '-strict', '-mc', 10, '-expcterr', 'check_channel_output_value', '-expcterr', 'general_error_occurred'], 'Testing raising of channel output error.'). |
| 1178 | | cli_testcase(741, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/ChannelNotDeclaredError.csp', '-strict', '-mc', 10, '-expcterr', 'evaluate_channel_outputs', '-expcterr', 'general_error_occurred', '-expcterr', 'enumerate_action'], 'Testing raising of channel not declared errors.'). |
| 1179 | | cli_testcase(742, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/ListProjectionError1.csp', '-strict', '-mc', 10, '-expcterr', 'list_projection','-expcterr', 'general_error_occurred'], 'Testing for list projection errors inside local definitions (let-within clauses).'). |
| 1180 | | cli_testcase(743, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/ListProjectionError2.csp', '-strict', '-mc', 10, '-expcterr', 'list_projection','-expcterr', 'deadlock'], 'Testing for list projection errors inside local definitions (let-within clauses).'). |
| 1181 | | cli_testcase(744, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/ListProjectionError3.csp', '-strict', '-mc', 10, '-expcterr', 'list_projection','-expcterr', 'deadlock'], 'Testing for list projection errors inside local definitions (let-within clauses).'). |
| 1182 | | cli_testcase(745, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/TupleProjectionError1.csp', '-strict', '-mc', 10, '-expcterr', 'csp_tuples','-expcterr', 'deadlock'], 'Testing for tuple projection errors inside local definitions (let-within clauses).'). |
| 1183 | | cli_testcase(746, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/TupleProjectionError2.csp', '-strict', '-mc', 10, '-expcterr', 'csp_tuples','-expcterr', 'deadlock'], 'Testing for tuple projection errors inside local definitions (let-within clauses).'). |
| 1184 | | cli_testcase(747, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/NaTupleProjectionError1.csp', '-strict', '-mc', 10, '-expcterr', 'csp_tuples','-expcterr', 'deadlock'], 'Testing for not-associative tuple projection errors inside local definitions (let-within clauses).'). |
| 1185 | | cli_testcase(748, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/NaTupleProjectionError2.csp', '-strict', '-mc', 10, '-expcterr', 'csp_tuples','-expcterr', 'deadlock'], 'Testing for not-associative tuple projection errors inside local definitions (let-within clauses).'). |
| 1186 | | cli_testcase(749, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/CardinalityOfInfiniteSetError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing if the card(-) built-in function raises expected error by calling it with infinite set.'). |
| 1187 | | cli_testcase(750, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/CardinalityTypeError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing if the card(-) built-in function raises expected type error by calling it with expression, which is not a set.'). |
| 1188 | | cli_testcase(751, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/InterEmptySetError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing if the Inter(-) built-in function raises expected error by calling it with an empty set.'). |
| 1189 | | cli_testcase(752, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/ExpandClosureSetError.csp', '-strict', '-mc', 10,'-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing for errors by expanding closure set elements (error occurs if the element is not a channel name e.g. just constructor).'). |
| 1190 | | cli_testcase(753, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/ExpandingSymbolicSetError1.csp', '-strict', '-mc', 10,'-expcterr', 'expand_symbolic_set', '-expcterr', 'deadlock'], 'Testing for errors by expanding symbolic sets.'). |
| 1191 | | cli_testcase(754, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/Peterson_v2.csp', '-mc', 1000, '-strict', '-p', 'COMPRESSION', 'TRUE', '-cc', 215, 429, '-statistics'], 'Test compression with CSP'). |
| 1192 | | cli_testcase(755, [csp_test], ['../prob_examples/public_examples/CSPB/TestVariableProbing.csp', '-MAIN', 'OTHER', '-mc', 100, '-cc', 4, 4, '-strict'], 'Test setting main process'). |
| 1193 | | cli_testcase(756, [xtl], ['../prob_examples/public_examples/XTL/Promela/promela_int.P', '-t', '-mc', 100, |
| 1194 | | '-cc', 23, 29, '-strict'], 'Test Promela XTL interpreter'). |
| 1195 | | cli_testcase(757, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/TestingForParseAndLoadErrors.csp', '-strict', '-expcterr', 'haskell_csp'], 'Testing the error clauses of the pasrse and load predicates in the haskell_csp module.'). |
| 1196 | | cli_testcase(758, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Farmer.csp', '-strict', '-get_csp_assertions_as_string'], 'Testing getting Csp assertions from file.'). |
| 1197 | | cli_testcase(759, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/EnumerateInfiniteChannelInputError1.csp', '-strict', '-mc', 10, '-expcterr', 'enumerate_channel_input_value', '-expcterr', 'general_error_occurred'], 'Testing enumerating infinite channel input error.'). |
| 1198 | | cli_testcase(760, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/EnumerateIllegalTypeOfChannelError.csp', '-strict', '-mc', 10, '-expcterr', 'enumerate_channel_input_value', '-expcterr', 'general_error_occurred'], 'Testing enumerating infinite channel input error.'). |
| 1199 | | cli_testcase(761, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/EnumerateInfiniteChannelInputError2.csp', '-strict', '-mc', 10, '-expcterr', 'enumerate_channel_input_value', '-expcterr', 'general_error_occurred'], 'Testing for raising enumerating infinite channel type error for sequences.'). |
| 1200 | | cli_testcase(762, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/ChannelInputSetEnumerationResultError.csp', '-strict', '-mc', 10, '-expcterr', 'set_enumeration_tuple_result', '-expcterr', 'deadlock'], 'Testing for raising type error on channel input.'). |
| 1201 | | cli_testcase(763, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/ChannelTooFewValuesOnChannelError.csp', '-strict', '-mc', 10, '-expcterr', 'enumerate_action', '-expcterr', 'general_error_occurred'], 'Testing for raising type error in channel input.'). |
| 1202 | | cli_testcase(764, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/InterleavedIfThenElseBlocks.csp', '-strict', '-mc', 1000], 'Testing interleaved if-then-else blocks.'). |
| 1203 | | cli_testcase(767, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/BAC9_ZC/pas_as_env_inv_ld.mch','-strict', '-t', '-p', |
| 1204 | | 'CLPFD', 'TRUE', '-aa', 27, 0, 0, '-p', 'MAX_OPERATIONS', 1, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE', '-sptxt', '../prob_examples/examples/B/Siemens/BAC9_ZC/pas_as_env_inv_ld_sptxt.txt'], 'Siemens Data Validation Test.'). |
| 1205 | | cli_testcase(777, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/AdaptedBModelPropCheck/acs_as_env_ctx_aiguille.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 49, 2, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0, '-strict'], 'Siemens Data Validation Test.'). |
| 1206 | | cli_testcase(778, [private,data_validation,siemens,codespeed], ['../prob_examples/examples/B/Siemens/AdaptedBModelPropCheck/acs_as_env_cfg_ipart.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 144, 4, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1207 | | cli_testcase(779, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/AdaptedBModelPropCheck/acs_as_env_cfg_ipart.mch','-strict', '-p','CLPFD', 'TRUE', '-ma', 95, 2, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test (main assertions).'). |
| 1208 | | cli_testcase(780, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/cbtc_mes_as_env_inv_easitf_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 127, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1209 | | cli_testcase(781, [private,data_validation,siemens,codespeed], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/cbtc_mes_as_env_inv_easitf_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-ma', 22, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test (main assertions).'). |
| 1210 | | cli_testcase(782, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/cbtc_mes_as_env_inv_etors_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 142, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1211 | | cli_testcase(783, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/cbtc_mes_as_env_inv_stors_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 147, 1, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1212 | | cli_testcase(784, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_mes_as_env_inv_etors_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 125, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1213 | | cli_testcase(785, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_etors_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 188, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1214 | | cli_testcase(786, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_etors_dist_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 184, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1215 | | cli_testcase(787, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_mesitf_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 182, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1216 | | cli_testcase(788, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_pasitf_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 176, 1, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1217 | | cli_testcase(789, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_se_dj_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 174, 2, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1218 | | cli_testcase(790, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_ss_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 192, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1219 | | cli_testcase(791, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_stors_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 192, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1220 | | cli_testcase(792, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/Canarsie_PAR1_PAL/par1_pans_as_env_inv_tcs_bs.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 183, 8, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0, '-p', 'DATA_VALIDATION', 'TRUE'], 'Siemens Data Validation Test.'). % added DATA_VALIDATION to prevent merging of assertions, otherwise we get 179 TRUE + 8 FALSE |
| 1221 | | cli_testcase(793, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_inv_etorf.mch','-strict', '-p','CLPFD', 'TRUE', '-init', '-expcterr', 'setup_constants_inconsistent', |
| 1222 | | '-opterr','setup_constants_fails', % setup can fail when value too large to be stored and no partial_setup_constants is done |
| 1223 | | '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1224 | | cli_testcase(794, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_inv_etorf.mch','-strict', '-p','CLPFD', 'TRUE', '-init', '-expcterr', 'setup_constants_inconsistent', |
| 1225 | | '-opterr','setup_constants_fails', % setup can fail when value too large to be stored and no partial_setup_constants is done |
| 1226 | | '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1227 | | cli_testcase(795, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/cmnb_heure_cst_gen.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 7, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1228 | | cli_testcase(796, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_ctx_trainstop.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 6, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1229 | | cli_testcase(797, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_inv_quai.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 50, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). % changed -aa 51 to 50 due to partition detection in Sept. 2014 |
| 1230 | | cli_testcase(798, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_inv_zaum.mch','-strict', '-p','CLPFD', 'TRUE', '-aa', 40, 0, 0, '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1231 | | cli_testcase(799, [private,data_validation,siemens,closure1], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_inv_cv_sui_v2.mch','-strict', '-p','CLPFD', 'TRUE','-aa', 61, 2, 0, % was '-aa', 62, 1, 0, for pas_as_env_inv_cv_sui.mch with prior closure(.) definition |
| 1232 | | '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 25000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). |
| 1233 | | cli_testcase(800, [private,smt_test,bosch,codespeed], ['../prob_examples/examples/RodinModels/Bosch/CrCtl_0.5.0_v9/CrCtl_Comb2_Final_mch.eventb', '-cbc_deadlock_pred', 'Counter=10 & P_CrCtl_Mode=STANDBY', '-p', 'SMT', 'TRUE', |
| 1234 | | '-p', 'CLPFD', 'TRUE', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAXINT', 2, '-p', 'DEFAULT_SETSIZE', 1, '-strict', '-expcterr', cbc_deadlock_check, '-p', 'MAX_INITIALISATIONS', 0],'Bosch CBC Test.'). |
| 1235 | | cli_testcase(801, [private,smt_test,bosch], ['../prob_examples/examples/RodinModels/Bosch/CrCtl_0.5.0_v8/CrCtl_Comb2_Final_mch.eventb', '-cbc_deadlock_pred', 'Counter=10', '-p', 'SMT', 'TRUE', |
| 1236 | | '-p', 'CLPFD', 'TRUE', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAXINT', 2, '-p', 'DEFAULT_SETSIZE', 1, '-strict', '-expcterr', cbc_deadlock_check, '-p', 'MAX_INITIALISATIONS', 0],'Bosch CBC Test.'). |
| 1237 | | cli_testcase(802, [private,smt_test,bosch], ['../prob_examples/examples/RodinModels/Bosch/CrCtl_0.5.0_v7/CrCtl_Comb2_Final_mch.eventb', '-cbc_deadlock_pred', 'Counter=10', '-p', 'SMT', 'TRUE', |
| 1238 | | '-p', 'CLPFD', 'TRUE', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAXINT', 2, '-p', 'DEFAULT_SETSIZE', 1, '-strict', '-expcterr', cbc_deadlock_check, '-p', 'MAX_INITIALISATIONS', 0],'Bosch CBC Test.'). |
| 1239 | | cli_testcase(803, [private,smt_test,bosch,codespeed], ['../prob_examples/examples/RodinModels/Bosch/CrCtl_0.5.0_v6/CrCtl_Comb2_Final_mch.eventb', '-cbc_deadlock_pred', 'Counter=10', '-p', 'SMT', 'TRUE', |
| 1240 | | '-p', 'CLPFD', 'TRUE', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAXINT', 2, '-p', 'DEFAULT_SETSIZE', 1, '-strict', '-expcterr', cbc_deadlock_check, '-p', 'MAX_INITIALISATIONS', 0],'Bosch CBC Test.'). |
| 1241 | | cli_testcase(804, [private,smt_test,bosch], ['../prob_examples/examples/RodinModels/Bosch/CrCtl_0.5.0_v5/CrCtl_Comb2_Final_mch.eventb', '-cbc_deadlock_pred', 'Counter=10', '-p', 'SMT', 'TRUE', |
| 1242 | | '-p', 'CLPFD', 'TRUE', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAXINT', 2, '-p', 'DEFAULT_SETSIZE', 1, '-strict', '-expcterr', cbc_deadlock_check, '-p', 'MAX_INITIALISATIONS', 0],'Bosch CBC Test.'). |
| 1243 | | cli_testcase(805, [private,smt_test,bosch], ['../prob_examples/examples/RodinModels/Bosch/CrCtl_0.5.0_v5/CrCtl_Comb2_Final_mch.eventb', '-cbc_deadlock', '-p', 'SMT', 'TRUE', |
| 1244 | | '-p', 'CLPFD', 'TRUE', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAXINT', 2, '-p', 'DEFAULT_SETSIZE', 1, '-strict', '-expcterr', cbc_deadlock_check, '-p', 'MAX_INITIALISATIONS', 0],'Bosch CBC Test.'). |
| 1245 | | cli_testcase(806, [private,smt_test,bosch], ['../prob_examples/examples/RodinModels/Bosch/CrCtl_0.5.0_v4/CrCtl_Comb2_Final_mch.eventb', '-cbc_deadlock_pred', 'Counter=10', '-p', 'SMT', 'TRUE', |
| 1246 | | '-p', 'CLPFD', 'TRUE', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAXINT', 2, '-p', 'DEFAULT_SETSIZE', 1, '-strict', '-expcterr', cbc_deadlock_check, '-p', 'MAX_INITIALISATIONS', 0],'Bosch CBC Test.'). |
| 1247 | | cli_testcase(807, [tickets,csp_test], ['../prob_examples/public_examples/CSP/Tickets/Shi/milnerSched5.csp', '-assertions', '-strict'], 'Check that exception does not occur (Ticket PROB-43)'). |
| 1248 | | cli_testcase(808, [b_test,dot], ['../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.mch', '-t', '-strict', '-dot', 'state_as_graph', '../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_state_graph.dot'], 'Check State Graph Generation'). |
| 1249 | | cli_testcase(809, [private,data_validation], ['../prob_examples/public_examples/B/Tickets/LargeMachTypeErr/LargeValueOk.mch', '-assertions', '-strict'], 'Check loading large data'). |
| 1250 | | cli_testcase(810, [private,typechecker_test], ['../prob_examples/public_examples/B/Tickets/LargeMachTypeErr/sequenceur_values.mch', '-expcterr', type_error, '-expcterr', load_main_file, '-strict'], 'Check large number of errors'). |
| 1251 | | cli_testcase(811, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/ChannelNameUsedAsValueError.csp', '-strict', '-mc', 10, '-expcterr', 'valid_value', '-expcterr', 'general_error_occurred','-expcterr', 'check_channel_output_value'], 'Testing for raising channel name used as value error.'). |
| 1252 | | cli_testcase(812, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/IllegalDataValueError.csp', '-strict', '-mc', 10, % '-expcterr', 'valid_value', % after fixing issue 304 cf test 2301 we no longer raise valid_value error for sets |
| 1253 | | '-expcterr', 'general_error_occurred','-expcterr', 'check_channel_output_value'], 'Testing for raising illegal data value error.'). |
| 1254 | | cli_testcase(813, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/MismatchNumberOfArgumentsForChannelSynchrError.csp', '-strict', '-mc', 10, '-expcterr', 'unify_tuple_args', '-expcterr', 'deadlock'], 'Testing for raising mismatch number of arguments error.'). |
| 1255 | | cli_testcase(814, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality1.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing for type errors in equality.'). |
| 1256 | | cli_testcase(815, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality2.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing for type errors in equality.'). |
| 1257 | | cli_testcase(816, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality3.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing for type errors in equality.'). |
| 1258 | | cli_testcase(817, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality4.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing for type errors in equality.'). |
| 1259 | | cli_testcase(818, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality5.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1260 | | cli_testcase(819, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality6.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1261 | | cli_testcase(820, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality7.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1262 | | cli_testcase(821, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality8.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1263 | | cli_testcase(822, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality9.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1264 | | cli_testcase(823, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality10.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1265 | | cli_testcase(824, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality11.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1266 | | cli_testcase(825, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality12.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1267 | | cli_testcase(826, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality1.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1268 | | cli_testcase(827, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality2.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing for type errors in equality.'). |
| 1269 | | cli_testcase(828, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality3.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing for type errors in equality.'). |
| 1270 | | cli_testcase(829, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality4.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing for type errors in equality.'). |
| 1271 | | cli_testcase(830, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality5.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1272 | | cli_testcase(831, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality6.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1273 | | cli_testcase(832, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality7.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1274 | | cli_testcase(833, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality8.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1275 | | cli_testcase(834, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality9.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1276 | | cli_testcase(835, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality10.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1277 | | cli_testcase(836, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality11.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1278 | | cli_testcase(837, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality12.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for type errors in equality.'). |
| 1279 | | cli_testcase(838, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingComprehensionSetGuards.csp', '-strict', '-mc', 10000], 'Testing set comprehension guards.'). |
| 1280 | | cli_testcase(839, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDataTypeDefBody.csp', '-strict', '-mc', 10], 'Testing expanding symbolic sets.'). |
| 1281 | | cli_testcase(840, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/ChannelNameUsedForLocalVariableError.csp', '-strict', '-expcterr', 'csp_sets'], 'Testing for raising channel name used as local variable error.'). |
| 1282 | | cli_testcase(841, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/PatternListTooLongForChannelError.csp', '-strict', '-mc', 10, '-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing raising pattern list too long error.'). |
| 1283 | | cli_testcase(842, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/TooManyValuesInRenamePatternError.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'general_error_occurred'], 'Testing raising too many values in rename pattern error.'). |
| 1284 | | cli_testcase(843, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/TypeErrorForChannelInputVariable.csp', '-strict', '-mc', 10, '-expcterr', 'enumerate_datatype_el', '-expcterr', 'deadlock'], 'Testing raising type error for channel input variable exception.'). |
| 1285 | | cli_testcase(844, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Farmer.csp', '-strict', '-get_csp_enumerated_assertions_as_string'], 'Testing getting enumerated assertions from file.'). |
| 1286 | | cli_testcase(845, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Farmer.csp', '-strict', '-prologOut', '../prob_examples/public_examples/CSP/other/Ivo/Farmer_temp.pl'], 'Testing translating CSP-M file to specific prolog file.'). |
| 1287 | | cli_testcase(846, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/IsMemberSetCouldNotEvaluateError.csp', '-strict', '-mc', 10, '-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing for raising could not evaluate error for the member(-,-) built-in function.'). |
| 1288 | | cli_testcase(847, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/NotASingletonSetError.csp', '-strict', '-mc', 10, '-expcterr', 'singleSetElement', '-expcterr', 'deadlock'], 'Testing for raising not a singleton set error.'). |
| 1289 | | cli_testcase(848, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality13.csp', '-strict', '-mc', 10000], 'Testing for type errors in equality.'). |
| 1290 | | cli_testcase(849, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality13.csp', '-strict', '-mc', 10000], 'Testing for type errors in disequality.'). |
| 1291 | | cli_testcase(850, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/NotABooleanExpressionError.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for raising not a boolean expression error.'). |
| 1292 | | cli_testcase(851, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/subtype_ex.csp', '-strict', '-mc', 1000,'-expcterr', 'deadlock' ,'-df'], 'Testing complex subtype expressions.'). |
| 1293 | | cli_testcase(852, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/subtype_nametype_ex.csp', '-strict', '-mc', 2500,'-expcterr', 'deadlock'], 'Testing complex subtype expressions.'). |
| 1294 | | cli_testcase(853, [private,csp_test], ['../prob_examples/examples/CSP/Winter/miniAlvey.csp', '-strict', '-t', '-c'], 'Testing complex CSP spec.'). |
| 1295 | | cli_testcase(854, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/NoMatchingCaseForFunctionCallError.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'cspm_trans', '-expcterr', 'deadlock'], 'Testing for no matching case for function call error.'). |
| 1296 | | cli_testcase(855, [b_test,cache], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/RussianPostalPuzzle.mch', '-mc', '1000', '-cc', '81', '177', '-p', 'DEFAULT_SETSIZE', '2', '-nogoal', '-strict', '-cache', '../prob_examples/public_examples/cache/'], 'Check that no error in reuse of cached operations'). |
| 1297 | | cli_testcase(856, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInEquality14.csp', '-strict', '-mc', 10000], 'Testing for type errors in equality.'). |
| 1298 | | cli_testcase(857, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/TypeErrorInNonEquality14.csp', '-strict', '-mc', 10000], 'Testing for type errors in disequality.'). |
| 1299 | | cli_testcase(858, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Farmer.csp', '-strict', '-mc', 1000, '-expcterr', 'deadlock', '-save', '../prob_examples/public_examples/CSP/other/Ivo/Farmer_state.txt'], 'Testing saving XSB Specification state.'). |
| 1300 | | cli_testcase(859, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/NotEnoughArgumentsOnChannelError.csp', '-strict', '-mc', 20, '-bf', '-expcterr', 'l_enumerate_channel_input_value', '-expcterr', 'deadlock'], 'Testing for raising not enough arguments on channel error.'). |
| 1301 | | cli_testcase(860, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingIsMemberBuiltInFunction.csp', '-mc', '100000', '-nodead', '-strict', '-assertions'], 'Testing member(-,-) builtin function.'). |
| 1302 | | cli_testcase(861, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/UnknownExpandChannelPatternExpressionError.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for raising unknown expand channel pattern expression error (possible when expanding sharing, synchronisation-sets/closures).'). |
| 1303 | | cli_testcase(862, [error_checks,csp_test,refinement], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/UnsupportedRefinementOperatorError.csp', '-strict', '-assertions', '-expcterr', 'unsupported_refinement_operator', '-expcterr', 'check_assertions', '-expcterr', 'checkAssertion'], 'Testing for raising unsupproted refinement operator error (e.g. [R=).'). |
| 1304 | | cli_testcase(863, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/NonAtomicArgumentError.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', deadlock, '-bf'], 'Testing for raising Non-atomic argument error.'). |
| 1305 | | %cli_testcase(864, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures.csp', '-strict', '-csp_add_unicode','../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_unicode.csp'], 'Testing the unicode features of the CSPM tool.'). |
| 1306 | | %cli_testcase(865, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_unicode_saved.csp', '-strict', '-csp_remove_unicode', '../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_no_unicode.csp'], 'Testing the unicode features of the CSPM tool.'). |
| 1307 | | cli_testcase(866, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/CouldNotExpandInfiniteDatatypeBody.csp', '-strict', '-mc', 10, '-expcterr', 'csp_sets', '-expcterr', 'deadlock'], 'Testing for raising could not expand infinite datatype body error.'). |
| 1308 | | cli_testcase(867, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDatatypeBodies.csp', '-strict', '-mc', 10], 'Testing expanding datatype bodies with complicated datat structures.'). |
| 1309 | | cli_testcase(868, [parser,tickets,ltl], ['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-ltlformulat', 'G {taken= {} ', '-strict', '-expcterr', 'ltl'], 'Testing that LTL parser does not loop. (PARSERLIB-11)'). |
| 1310 | | cli_testcase(869, [parser,tickets,ctl], ['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-ctlformula', 'AG {taken= {} ', '-strict', '-expcterr', 'ctl'], 'Testing that CTL parser does not loop. (PARSERLIB-11)'). |
| 1311 | | cli_testcase(870, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/Renaming.csp', '-strict', '-mc', 10], 'Testing for raising could not expand infinite datatype body error.'). |
| 1312 | | cli_testcase(871, [tickets], ['../prob_examples/public_examples/EventBPrologPackages/openETCS/ATB/Model_ctx.eventb', '-init', '-strict', '-properties'], 'Check that no time-out occurs; check C <: S21*S22 <=> C : S21 <-> S22 rule in check_subset_of0'). |
| 1313 | | %cli_testcase(872, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/WrongOperationTopParameter.mch', '-plugin', 'units', '-strict', '-expecterr', well_definedness_error, '-mc', 5], ''). |
| 1314 | | %cli_testcase(873, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/WrongConversionMultiplication.mch', '-plugin', 'units', '-strict', '-expecterr', well_definedness_error, '-mc', 5], ''). |
| 1315 | | %cli_testcase(874, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/WrongConversionAddition.mch', '-plugin', 'units', '-strict', '-expecterr', well_definedness_error, '-mc', 5], ''). |
| 1316 | | cli_testcase(875, [tickets,error_checks], ['-eval', 'g = {x|->y | x=y+1 }', '-expecterr', type_expression_error], 'Check that a type error instead of an internal failure is reported when an expression is used where an identifier is expected (Ticket PROB-213).'). |
| 1317 | | cli_testcase(876, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/mbuff.csp', '-assertions', '-strict'], 'Checking CSP assertions.'). |
| 1318 | | cli_testcase(877, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/crossing.csp', '-assertions', '-strict'], 'Checking CSP assertions.'). |
| 1319 | | cli_testcase(878, [csp_test], ['-csp_eval', '(seq(set(<1,2,3>))==<1,2,3>) and (set(seq({1,2,3}))=={1,2,3})', '-strict'], 'Checking CSP expressions without loading a specific model first.'). |
| 1320 | | cli_testcase(879, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/crossing.csp', '-csp_eval', 'diff(NonTock,{|enter,leave|}) == {error,gate.down,gate.go_down,gate.go_up,gate.up,sensor.in,sensor.out}', '-strict'], 'Checking CSP expressions.'). |
| 1321 | | cli_testcase(880, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/crossing.csp', '-csp_eval', 'diff(NonTock,{|enter,leave|}', '-expcterr', 'parsing_csp_expression', '-strict'], 'Checking raising parse error while evaluating syntactically non correct CSP expressions.'). |
| 1322 | | %cli_testcase(881, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Choice.mch', '-plugin', 'units', '-strict','-expecterr', 'well_definedness_error','-pp','../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Choice_internal.mch'], ''). |
| 1323 | | cli_testcase(882,[private,data_validation],['../prob_examples/examples/B/Alstom/Ticket_Oct11_2012/Rule_DB_SIGAREA_0024.mch','-strict', '-t', '-assertions'], 'Issue related to cut in b_try_check_boolean_expression_lwf.'). |
| 1324 | | cli_testcase(883, [csp_test], ['../prob_examples/public_examples/CSP/ucsexamples/chapter14/maxpro.csp', '-assertions', '-strict'], 'Checking CSP assertions from file'). |
| 1325 | | cli_testcase(884, [b_test,proz], ['../prob_examples/public_examples/Z/Woodcock/InnerMember.fuzz', '-t', '-mc', 100, |
| 1326 | | '-expcterr', 'bmachine_static_checks', '-strict'], 'Checking Z model and check warning for TRUE/FALSE clash generated'). % added -expcterr 23/2/2021 |
| 1327 | | cli_testcase(885, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/TryingToApplyUndefinedFunctionError.csp', '-strict', '-mc', 10, '-expcterr', 'evaluate_agent_call_parameters', '-expcterr', 'cspm_trans', '-expcterr', 'deadlock'], 'Testing for raising trying to apply undefined process/function error.'). |
| 1328 | | cli_testcase(886, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/CouldNotUnifyLambdaArgsError.csp', '-strict', '-mc', 10, '-expcterr', 'cspm_trans', '-expcterr', 'deadlock'], 'Testing for raising of could not unify lambda args error.'). |
| 1329 | | cli_testcase(887, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/CallingNonAtomicFunctionArgumentError.csp', '-strict', '-mc', 10, '-expcterr', 'haskell_csp', '-expcterr', 'deadlock'], 'Testing for raising of trying to call non-atomic function error.'). |
| 1330 | | cli_testcase(888, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp_analyzer/UnsupportedAppendPatternError.csp', '-expcterr', 'compile_head_para', '-strict'], 'Testing for raising of unsupported append pattern error.'). |
| 1331 | | cli_testcase(889, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingComplexChannelTypes.csp', '-assertions', '-strict'], 'Testing outputing channel values of complex types.'). |
| 1332 | | cli_testcase(890, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp_analyzer/IllegalASTCSPProcessInIllegalPositionError.csp', '-expcterr', 'haskell_csp_analyzer', '-strict'], 'Testing for raising of unsupported append pattern error.'). |
| 1333 | | cli_testcase(891, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/PatternMatchingAppendPatternsAsChannelInputValues.csp', '-mc', 1000, '-nodead', '-assertions', '-strict'], 'Testing for pattern matching append patterns as input values.'). |
| 1334 | | cli_testcase(892, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/CheckingPossibleInputVariablesOnChannel.csp', '-assertions', '-strict'], 'Testing for possible input patterns on channels.'). |
| 1335 | | cli_testcase(893,[private,cbc_tests],['../prob_examples/examples/B/L4MicroKernel/L4API/API.mch','-strict', '-cbc_sequence', 'TimeoutIPC','-p', 'DEFAULT_SETSIZE', 3], 'Check that no errors produced by cbc_sequence (Ticket PROB-215).'). |
| 1336 | | cli_testcase(894,[tickets,enabling],['-enabling_analysis_csv','../prob_examples/public_examples/B/Daniel/minienabling_analysis.csv','../prob_examples/public_examples/B/Daniel/minienabling.mch'], 'Check CSV output of a simple enabling analysis (Ticket PROB-215).'). |
| 1337 | | cli_testcase(895, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/SafetyPRB.csp', '-assertions', '-strict'],'Assertions check of processes with complex events.'). |
| 1338 | | cli_testcase(896, [kodkod], ['-p','KODKOD','TRUE', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE','-eval','card(10..x) = 0 & x : 0..100 & (x<10 => x+x>5)', '-strict'],'The translation to Kodkod should not fail because a helper variable has no possible values (Ticket PROB-218)'). |
| 1339 | | cli_testcase(897, [kodkod], ['-p','KODKOD','TRUE','-p', 'KODKOD_RAISE_WARNINGS', 'TRUE','-eval','S<:1..10 & S/={}', '-strict'],'Checking the information about the integer range of the elements of an empty set (Ticket PROB-220)'). |
| 1340 | | cli_testcase(898, [b_test], ['-evalt', 'x \\/ 2..n = 0..(n+10) & x /\\ 2..n = {} & x <: 0..n+20 & n=10000', '-strict'],'Checking set partition inside eval'). |
| 1341 | | cli_testcase(899, [kodkod], ['-p','KODKOD','TRUE','-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', '-mc',1000,'../prob_examples/public_examples/B/Tickets/PROB-217/kodkod_overflow.mch', '-nodead', '-strict'],'The output of the predicate analysis alone does not prevent integer overflows - (Ticket PROB-217)'). |
| 1342 | | cli_testcase(900, [csp_test,refinement], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'Q(3) [F= Q3', '-csp_assertion', 'Q3 [F= Q(3)', '-csp_assertion', 'Q(4) [T= Q(1,3)', '-csp_assertion', 'Q(1,3) [F= Q(4)', '-strict'], 'Checking various refinement assertions of processes with arguments.'). |
| 1343 | | cli_testcase(901, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'Q(10) :[deadlock free [FD]]', '-expcterr', 'model_check_fails', '-strict'], 'Deadlock checking of a process called with argument.'). |
| 1344 | | cli_testcase(902, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'Q2(9) :[livelock free]', '-cc', 13, 12, '-strict'], 'Livelock checking of a process called with argument.'). |
| 1345 | | cli_testcase(903, [csp_test, csp_det], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'Q2(9) :[deterministic [FD]]', '-expcterr', 'model_check_fails','-strict'], 'Determinism checking of a process called with argument (must fail).'). |
| 1346 | | cli_testcase(904, [csp_test, csp_det], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'a.1 -> a.2 -> STOP :[deadlock free [FD]]', '-expcterr', 'model_check_fails', '-strict'], 'Deadlock checking of a process called with argument.'). |
| 1347 | | cli_testcase(905, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'a.1 -> a.2 -> STOP [T= a.1 -> STOP', '-strict'], ''). |
| 1348 | | cli_testcase(906, [csp_test,refinement], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'a.1 -> a.2 -> STOP [F= a.1 -> STOP', '-expcterr', 'refinement_check_fails', '-strict'], ''). |
| 1349 | | cli_testcase(907, [csp_test,refinement], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'a.1 -> a.2 -> STOP [F= a.1 -> b.1 -> STOP', '-expcterr', 'parsing_csp_declaration', '-strict'], 'Checking expecting error to occur.'). |
| 1350 | | cli_testcase(908, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'a.1 -> a.2 -> STOP [F= a.1 -> a.1.1 -> STOP', '-expcterr', 'checkAssertion', '-expcterr', 'enumerate_action', '-strict'], ''). |
| 1351 | | cli_testcase(909, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/ProcessesWithArguments.csp', '-csp_assertion', 'Q(4) [] Q(2) [FD= Q(2,2) [] Q(1,1)', '-strict'], ''). |
| 1352 | | cli_testcase(910, [analysis_test, kodkod], ['-pacheck','../prob_examples/public_examples/B/predicate_analysis/sets.mch', '-strict'], 'Test cases for the predicate analysis: rules about sets'). |
| 1353 | | cli_testcase(911, [analysis_test,sigma, kodkod], ['-pacheck','../prob_examples/public_examples/B/predicate_analysis/arithmetic.mch', '-strict'], 'Test cases for the predicate analysis: some arithmetic (mainly SIGMA)'). |
| 1354 | | cli_testcase(912, [kodkod,cbc], ['../prob_examples/public_examples/B/Kodkod/TestCBCAssertionCheck.mch', '-cbc_assertions', '-strict', '-p','SOLVER_FOR_PROPERTIES', 'kodkod', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', '-expcterr',cbc_assertions], 'Check that Kodkod CBC Checking works.'). |
| 1355 | | cli_testcase(913, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDataTypeDefBody.csp', '-csp_eval', 'D1 == {A,B.0,B.1,B.2,B.3,C.0.0,C.0.1,C.0.2,C.0.3,C.1.0,C.1.1,C.1.2,C.1.3,C.2.0,C.2.1,C.2.2,C.2.3,C.3.0,C.3.1,C.3.2,C.3.3}', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1356 | | cli_testcase(914, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDataTypeDefBody.csp', '-csp_eval', '{|c.C|} =={c.(C.0.0),c.(C.0.1),c.(C.0.2),c.(C.0.3),c.(C.1.0),c.(C.1.1),c.(C.1.2),c.(C.1.3),c.(C.2.0),c.(C.2.1),c.(C.2.2),c.(C.2.3),c.(C.3.0),c.(C.3.1),c.(C.3.2),c.(C.3.3)}', '-strict'], 'Evaluating CSP-M expressions'). |
| 1357 | | cli_testcase(915, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDataTypeDefBody.csp', '-csp_eval', '{1..3} == {1,2,3}', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1358 | | cli_testcase(916, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', '-csp_eval', 'Events', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1359 | | cli_testcase(917, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', '-csp_eval', '{|a|}', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1360 | | cli_testcase(918, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', '-csp_eval', '{1..}','-strict','-expcterr',expand_symbolic_set], 'Testing raising of infinite set error.'). |
| 1361 | | cli_testcase(919, [b_test, csp_test,cspb], ['../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/Airports.mch', '-csp-guide', '../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/AirportsCtrl.csp', '-assertions', '-cc', 859, 3533, '-strict'], 'Checking CSP-M assertions for CSP-M || B models.'). |
| 1362 | | cli_testcase(920, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDataTypeDefBody.csp', '-csp_eval', |
| 1363 | | '{x | x <- D1, (B.1) != x} == {A,B.0,B.2,B.3,C.0.0,C.0.1,C.0.2,C.0.3,C.1.0,C.1.1,C.1.2,C.1.3,C.2.0,C.2.1,C.2.2,C.2.3,C.3.0,C.3.1,C.3.2,C.3.3}', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1364 | | cli_testcase(921, [error_checks, csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_sets/EmptySetNotAllowedForInterError.csp', '-mc', 10,'-expcterr', 'is_member_set2', '-expcterr', 'general_error_occurred', '-strict', '-expcterr', virtual_time_out], 'Testing raising of empty set not allowed for Inter(-) error.'). |
| 1365 | | cli_testcase(922, [csp_test], ['-csp_eval', 'if member(1,{1..10}) then true else false', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1366 | | cli_testcase(923, [error_checks], ['-mc', 1000, '../prob_examples/public_examples/B/Tickets/PROB-226/parallel_subst.mch', '-expcterr', 'type_error', '-expcterr', 'load_main_file', '-strict'], 'Parallel assignments to the same variable should be forbidden. (Ticket PROB-226)'). |
| 1367 | | cli_testcase(924, [error_checks], ['-mc', 1000, '../prob_examples/public_examples/B/ErrorMachines/UnknownPromotedOp.mch', '-expcterr', 'type_error', '-expcterr', 'load_main_file', '-strict'], 'Type-checker error when promoting an operation that does not exist.'). |
| 1368 | | cli_testcase(925, [error_checks], ['-mc', 1000, '../prob_examples/public_examples/B/ErrorMachines/IncludeSeenOnlyOnce.mch', '-expcterr', 'type_error', '-expcterr', 'load_main_file', '-strict'], 'Expecting error when including a machine twice that is used as a seen/used machine.'). |
| 1369 | | cli_testcase(926, [csp_test,ltl], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', '-ltlformulat', 'GF [a]', '-expcterr', 'ltl', '-strict'],'Checking for raising number of arguments not correct error.'). |
| 1370 | | cli_testcase(927, [typechecker_test], ['-eval', 'a-b=c & a=0', '-strict'], 'Type-checking a minus when the type of the arguments is determinded later (an integer).'). |
| 1371 | | cli_testcase(928, [typechecker_test], ['-eval', 'a-b=c & a={0}', '-strict'], 'Type-checking a minus when the type of the arguments is determinded later (a set).'). |
| 1372 | | cli_testcase(929, [csp_test,ltl], ['../prob_examples/public_examples/CSP/ErrorModels/ltl/ExtraArgumentsInCSPLTLPatternError.csp', '-ltlassertions', '-expcterr', 'enumerate_action', '-expcterr', 'ltl', '-strict'],'Checking for raising number of arguments not correct error.'). |
| 1373 | | cli_testcase(930, [csp_test,ltl], ['../prob_examples/public_examples/CSP/ErrorModels/ltl/MissingElementsInCSPPatternError.csp', '-ltlassertions', '-expcterr', 'ltl', '-strict'],'Checking for raising number of arguments not correct error.'). |
| 1374 | | cli_testcase(931, [csp_test], ['../prob_examples/public_examples/CSP/ucsexamples/chapter20/phone.csp', '-csp_eval', 'Phones', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1375 | | cli_testcase(932, [typechecker_test,error_checks], ['-eval', 'a-b=c & a=TRUE', '-expcterr', 'type_expression_error', '-strict'], 'Type-checking a minus when the type of the arguments is determinded later (type error).'). |
| 1376 | | cli_testcase(933, [typechecker_test,error_checks], ['-eval', 'a*b=c & a=TRUE', '-expcterr', 'type_expression_error', '-strict'], 'Type-checking * when the type of the arguments is determinded later (type error).'). |
| 1377 | | cli_testcase(934, [typechecker_test], ['-eval', '[a,c:=1,3](a<b&b<c)', '-strict'], 'Type-checking a substitution on a predicate'). |
| 1378 | | cli_testcase(935, [typechecker_test,error_checks], ['-eval', '[a,c:=1,3,5](a<b&b<c)', '-expcterr', 'type_expression_error', '-strict'], 'Type-checking a substitution on a predicate (type error)'). |
| 1379 | | cli_testcase(936, [b_test, csp_test,ltl,cspb], ['../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/Airports.mch', '-csp-guide', '../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/AirportsCtrl.csp', |
| 1380 | | %'-p', 'csp_event_visible_to_user', 'false', % used to be csp_event probcli option |
| 1381 | | '-ltlformulat', 'G not [link.AMS.AMS]', '-strict'], 'Checking ltl formulas for CSP-M || B models.'). |
| 1382 | | cli_testcase(937, [b_test, csp_test,ltl,cspb], ['../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/Airports.mch', '-csp-guide', '../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/AirportsCtrl.csp', '-ltlformulat', 'G not [link(AMS,AMS)]', '-strict'], 'Checking ltl formulas for CSP-M || B models.'). |
| 1383 | | cli_testcase(938, [error_checks,refinement], ['-mc', 1000, '-expcterr', 'type_error', '-expcterr', 'load_main_file', '-strict', '../prob_examples/public_examples/B/ErrorMachines/MachineWithParametersErr1.ref'], 'Check for error: Wrong number of parameters in refinement.'). |
| 1384 | | cli_testcase(939, [error_checks,refinement], ['-mc', 1000, '-expcterr', 'type_error', '-expcterr', 'load_main_file', '-strict', '../prob_examples/public_examples/B/ErrorMachines/MachineWithParametersErr2.ref'], 'Check for error: Wrong parameters in refinement.'). |
| 1385 | | cli_testcase(940, [cbc], ['-cbc', all, '-p','CLPFD', 'TRUE', '-strict', '../prob_examples/public_examples/B/Tickets/Treharne1/House_Tracker16.mch'], 'Check that we quickly see that there is no counterexample.'). |
| 1386 | | cli_testcase(941, [cbc], ['-cbc', all, '-p','CLPFD', 'TRUE', '-strict', '../prob_examples/public_examples/B/CBC/ReservationLivre.mch', '-expcterr',cbc], 'Check that we find counterexample with larger scope.'). |
| 1387 | | %cli_testcase(942, [plugin_units,wd,case,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Case.mch', '-plugin', 'units', '-strict', '-expcterr', 'well_definedness_error', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Case_internal.mch','-p','plugin(units,fixpoint_halt_on_error)','false'], ''). |
| 1388 | | cli_testcase(943, [parser,typechecker_test,pragmas], ['../prob_examples/public_examples/B/Pragmas/UnrecognisedPragma.mch','-strict','-expcterr',load_main_file,'-expcterrpos',parse_error, 7, 5],'Check Pragma error message (with SNAPSHOT parser from 12/3/2019 we no longer get parse errors)'). |
| 1389 | | cli_testcase(944, [dot], ['-evalt','r:1..3-->>1..3 & r(1)/=1 & r(1)/=2 & r(2)/=2', '-evaldot', '../prob_examples/public_examples/Eval/evalout.dot','-strict'],''). |
| 1390 | | cli_testcase(945, [eventb_test, theories], ['-t', '-strict', '../prob_examples/public_examples/EventBPrologPackages/Theory/TestBoolOps_mch.eventb'], 'Check BoolOps Theory.'). |
| 1391 | | cli_testcase(946, [cbc,smt_test,refinement], ['../prob_examples/public_examples/B/Tickets/CBC_Refinement/M2_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', all, '-strict', '-expcterr', 'cbc', '-p', 'SMT', 'TRUE'], 'Check counter-example found in SMT mode'). |
| 1392 | | cli_testcase(947, [cbc,smt_test,refinement], ['../prob_examples/public_examples/B/Tickets/CBC_Refinement/M2_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'RemAuth', '-strict', '-expcterr', 'cbc', '-p', 'SMT', 'TRUE'], 'Check counter-example found in SMT mode'). |
| 1393 | | cli_testcase(948, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/WaterBoiler.csp', '-csp_eval', 'member(fill.3,{|fill|}) == true', '-strict'], 'Evaluating CSP-M expressions.'). |
| 1394 | | cli_testcase(949, [tickets], ['-assertions', '-strict', '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsOK.mch', |
| 1395 | | '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsOK_For_AtelierB.mch'], 'Check that we prj1/prj2 work correctly.'). |
| 1396 | | cli_testcase(950, [tickets,wd], ['-assertions', '-strict', '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsKO1.mch', '-expcterr', 'well_definedness_error', '-expcterr', 'check_assertions', '-p', 'TRY_FIND_ABORT', 'TRUE'], 'Check that we prj1/prj2 detect wd errors.'). |
| 1397 | | cli_testcase(951, [tickets,wd], ['-assertions', '-strict', '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsKO2.mch', '-expcterr', 'well_definedness_error', '-expcterr', 'check_assertions', '-p', 'TRY_FIND_ABORT', 'TRUE'], 'Check that we prj1/prj2 detect wd errors.'). |
| 1398 | | cli_testcase(952, [tickets,wd], ['-assertions', '-strict', '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsKO3.mch', '-expcterr', 'well_definedness_error', '-expcterr', 'check_assertions', '-p', 'TRY_FIND_ABORT', 'TRUE'], 'Check that we prj1/prj2 detect wd errors.'). |
| 1399 | | cli_testcase(953, [tickets,wd], ['-assertions', '-strict', '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsKO4.mch', '-expcterr', 'well_definedness_error', '-expcterr', 'check_assertions', '-p', 'TRY_FIND_ABORT', 'TRUE'], 'Check that we prj1/prj2 detect wd errors.'). |
| 1400 | | cli_testcase(954, [eventb_test, theories], ['-t','-strict','../prob_examples/public_examples/EventBPrologPackages/Theory/DumbDataTheoryModel.eventb'],'Check model that uses user defined datatypes via the Theory Plugin.'). |
| 1401 | | cli_testcase(955, [eventb_test, theories], ['-mc',100,'-strict','../prob_examples/public_examples/EventBPrologPackages/Theory/NonTrivialTypeParameters.eventb'],'Theory Plugin: Datatypes whose type parameters are not only type expressions'). |
| 1402 | | cli_testcase(956, [eventb_test,card], ['-mc',1000,'-strict','../prob_examples/public_examples/EventBPrologPackages/Puzzles/Hanoi_mch_3s_6d.eventb', '-noass', '-cc', 731, 2186, '-p', 'CLPFD', 'TRUE'],'Check that constraint solver not perplexed by use of card() for last'). |
| 1403 | | %cli_testcase(957, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/DifferentUnitNotations.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/DifferentUnitNotations_internal.mch'], ''). |
| 1404 | | cli_testcase(958, [eventb_test], ['-t', '-p', 'CLPFD', 'FALSE', '-p', 'PROOF_INFO', 'FALSE' , '-p', 'TIME_OUT', '100', '-expcterr', 'time_out_for_invariant', |
| 1405 | | '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/ComplicatedProvenInvariant2_v2.eventb'],'Check that Time Out occurs without Proof Info usage. (CLPFD disabled because it causes an overflow on the 32 bit testbots'). |
| 1406 | | cli_testcase(959, [eventb_test], ['-mc',100, '-t', '-p', 'TIME_OUT', '200', '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/ComplicatedProvenInvariant2_v2.eventb', '-expcterr', 'model_check_incomplete'],'Check that Proof Info works'). |
| 1407 | | cli_testcase(960, [eventb_test], ['-mc',0, '-p', 'PROOF_INFO', 'FALSE' , '-p', 'TIME_OUT', '200', '-expcterr', 'time_out_for_assertions', '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/ComplicatedProvenInvariant_INITCheck_mch.eventb', '-expcterr', 'model_check_incomplete'],'Check that Proof Info works also for INITIALISATION'). |
| 1408 | | cli_testcase(961, [eventb_test], ['-mc',100, '-p', 'PROOF_INFO', 'TRUE' , '-p', 'TIME_OUT', '200', '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/ComplicatedProvenInvariant_INITCheck_mch.eventb', '-expcterr', 'model_check_incomplete'],'Check that Proof Info works also for INITIALISATION'). |
| 1409 | | cli_testcase(962, [eventb_test], ['-mc',100, '-p', 'PROOF_INFO', 'TRUE' , '-p', 'TIME_OUT', '200', '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/ComplicatedProvenDynamicTheorem_mch.eventb', '-expcterr', 'model_check_incomplete'],'Check that Proof Info works also for dynamic theorems'). |
| 1410 | | |
| 1411 | | cli_testcase(963, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/WaterBoiler.csp', '-ltlformulat', '[open] => ((X [fill._]) or (X [close])) ', '-strict'],'Check LTL formula in File.'). |
| 1412 | | cli_testcase(964, [eventb_test,wd], ['-mc',100, '-p', 'PROOF_INFO', 'TRUE' , '-expcterr', well_definedness_error, '-expcterr', invariant_violation, '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestProofDirected_WD_Inv_mch.eventb'],'Check that Proof Info works well in conjunction with ill-defined invariants'). |
| 1413 | | cli_testcase(965, [eventb_test,wd], ['-mc',100, '-p', 'PROOF_INFO', 'TRUE' , '-expcterr', well_definedness_error, '-expcterr', assertion_violation, |
| 1414 | | %'-expcterr', checking_assertions, % was actually a warning generated by translate_events_in_current_scope_to_warnings |
| 1415 | | '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestProofDirected_WD_Thm_mch.eventb'],'Check that Proof Info works well in conjunction with ill-defined theorems'). |
| 1416 | | cli_testcase(966, [eventb_test], ['-mc',100, '-noass', '-nodead', '-p', 'PROOF_INFO', 'FALSE' , '-expcterr', invariant_violation, '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestProofDirected_WD_Thm_mch.eventb'],'Check that Proof Info works well in conjunction with ill-defined theorems and -noass checking'). |
| 1417 | | cli_testcase(967, [eventb_test], ['-mc',100, '-noass', '-nodead', |
| 1418 | | '-p', 'PROOF_INFO', 'TRUE' , |
| 1419 | | %'-expcterr', invariant_violation, % the proof of the invariant relies on the theorem, which is proven but has wd-problem |
| 1420 | | '-expcterr', 'model_check_incomplete', |
| 1421 | | '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestProofDirected_WD_Thm_mch.eventb'],'Check that Proof Info works well in conjunction with ill-defined theorems and -noass checking'). |
| 1422 | | cli_testcase(968, [eventb_test], ['-mc',100, '-noass', '-nodead', '-p', 'PROOF_INFO', 'TRUE' , '-expcterr', 'model_check_incomplete', '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestProofDirected_FalseThm_mch.eventb'],'Check that Proof Info works well in conjunction with ill-defined theorems and -noass checking'). |
| 1423 | | cli_testcase(969, [b_test,recursion,external], ['-assertions', '-strict','../prob_examples/public_examples/B/Tickets/Bracknell1/C0.mch'],'Check that no recursion detected'). |
| 1424 | | cli_testcase(970, [b_test,recursion,external], ['-init', '-strict','../prob_examples/public_examples/B/Tickets/Bracknell1/C0_ctx.eventb'],'Check that no recursion detected'). |
| 1425 | | cli_testcase(971, [b_test], ['../prob_examples/public_examples/B/Tester/Prj1NATURAL.mch', '-t', '-mc', '1000', '-strict'], 'Check that prj1(NATURAL,...) not expanded'). |
| 1426 | | cli_testcase(972, [cbc], ['../prob_examples/public_examples/B/CBC/plavis_MemoryLoad_SP_14_TestComp_v2.mch', |
| 1427 | | '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 3, '-p', 'MININT', -1, '-init', '-strict'], |
| 1428 | | 'Check that partitioning into components and seq enum works'). % changed to _v2 model with extra constraint on 6/1/2021 |
| 1429 | | cli_testcase(973, [cbc], ['../prob_examples/public_examples/B/CBC/ComponentPartitioningTest.mch', '-p', 'CLPFD', 'TRUE', '-init', '-strict'], 'Check that partitioning into components works'). |
| 1430 | | cli_testcase(974, [cbc], ['../prob_examples/public_examples/B/CBC/PartitionConstraintAssertionCheck.mch', '-p', 'CLPFD', 'TRUE', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], |
| 1431 | | 'Check that partitioning into components works'). |
| 1432 | | cli_testcase(975, [por], ['../prob_examples/public_examples/B/Ivo/PruningActionsTest1.mch', '-mc', '1000000', '-p', 'por', ample_sets, '-expcterr', invariant_violation, '-strict'], 'POR test.'). |
| 1433 | | cli_testcase(976, [por], ['../prob_examples/public_examples/B/Ivo/PruningActionsTest2.mch', '-mc', '1000000', '-p', 'por', ample_sets, '-expcterr', deadlock, '-strict'], 'POR test (deadlock and invariant violation).'). |
| 1434 | | cli_testcase(977, [por], ['../prob_examples/public_examples/B/Ivo/BridgeTransitions.mch', '-mc', '1000000', '-cc', 55, '_', '-check_complete_operation_coverage', '-p', 'por', ample_sets, '-min_max_coverage', '../prob_examples/public_examples/B/Ivo/BridgeTransitions_por.cov', '-strict'], 'POR test (no state space reductions).'). |
| 1435 | | cli_testcase(978, [por], ['../prob_examples/public_examples/B/Ivo/CycleDetections.mch', '-mc', '1000000', '-p', 'por', ample_sets, '-expcterr', invariant_violation, '-strict'], 'POR test.'). |
| 1436 | | % commit 484a10c2cdd8cc4b13f1be8f30e8eac7be5a30c3 from 23 Oct 2013 broke 979-982; CSE optimization should recover performance |
| 1437 | | cli_testcase(979, [while,private,data_validation], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.mch', '-animate_all', '-strict', '-cc', 113, 112, '-p', 'TIME_OUT', 35000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.his','-expcterr', invariant_violation], 'Rule Test 4 of Alstom compilation project'). % increased time-out from 15000; added -p CLPFD FALSE |
| 1438 | | cli_testcase(980, [while,private,data_validation,codespeed], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori.mch', '-animate_all', '-strict', '-cc', 40, 39, '-p', 'TIME_OUT', 35000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori.his'], 'Rule Test 5 of Alstom compilation project'). % increased time-out from 15000; added -p CLPFD FALSE |
| 1439 | | cli_testcase(981, [private,data_validation,codespeed], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori.mch', '-animate_all', '-strict', '-cc', 97, 96, '-p', 'TIME_OUT', 28000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori.his'], 'Rule Test 1 of Alstom compilation project'). % increased time-out from 15000; added -p CLPFD FALSE |
| 1440 | | cli_testcase(982, [private,data_validation,alstom], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_1_ori.mch', '-animate_all', '-strict', '-cc', 48, 47, '-p', 'TIME_OUT', 55000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_1_ori.his','-expcterr', invariant_violation], 'Rule Test 3 of Alstom compilation project'). % increased time-out from 45000; added -p CLPFD FALSE |
| 1441 | | cli_testcase(983, [private,data_validation,alstom], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_ESA_TRIGGER_0009_ori.mch', '-strict', '-cc', 112, 111, '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-t'], 'Rule Test 2 of Alstom compilation project'). |
| 1442 | | cli_testcase(984, [private,symmetry_test], ['../prob_examples/examples/B/BossaAcadie/scheduler.mch', '-strict', '-cc', 145, 1935, '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-mc', 9000, '-p', 'MAX_OPERATIONS', 20, '-p', 'SYMMETRY_MODE', hash, '-expcterr', 'model_check_incomplete'], 'Bossa example'). % was 1936 transitions; now 1935 with INITIALISATION arguments derived from target state |
| 1443 | | cli_testcase(985, [cbc], ['../prob_examples/public_examples/B/Mathematical/GraphIso/HardGraph_Nr5.mch', '-strict', '-cc', 3, 3, '-p', 'TIME_OUT', 5000, '-mc', 20, '-p', 'MAX_OPERATIONS', 4, '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Hard graph; isomorphism detected means no deadlock'). |
| 1444 | | cli_testcase(986, [eventb_test], ['-t','-mc',800,'-strict','../prob_examples/public_examples/EventBPrologPackages/Puzzles/MRushHour_new.eventb','-expcterr', invariant_violation],'Check that new Proof Info works with wd in guards/actions accepted'). |
| 1445 | | cli_testcase(987, [por], ['../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2.eventb', '-mc', '1000000', '-noass', '-nogoal', '-p', 'por', ample_sets, '-strict'], 'Testing if coverages of the constants and values of the generated reduced state space are matching with the coverages of the constants and values of the full state space.'). |
| 1446 | | cli_testcase(988, [csp_test,dot], ['../prob_examples/public_examples/CSP/simple/Copy.csp', '-df', '-mc', '1000', '-cc', '14', '24', '-strict','-dot','signature_merge','../prob_examples/public_examples/CSP/simple/Copy_spmdot.dot','-dot', 'dfa_merge','../prob_examples/public_examples/CSP/simple/Copy_spddot.dot', '-pref_group', dot_colors, classic, '-p','DOT_PEN_WIDTH',1], 'Test reduced state space dot output for CSP. (DF search to avoid different dot graphs due to order of exploration)'). |
| 1447 | | cli_testcase(989, [eventb_test], ['-assertions','-strict','../prob_examples/public_examples/EventBPrologPackages/PerformanceTests/LargeConstants_ctx.eventb','-pp', '../prob_examples/public_examples/EventBPrologPackages/PerformanceTests/LargeConstants_ctx_internal.mch'],'Check that set comprehensions converted properly'). |
| 1448 | | cli_testcase(990, [b_test,smt_test], ['-evalt', 'ran(%v0.(v0: 0..30001 | v0)) = 0..30001', '-p', 'SMT', 'TRUE', '-strict'],'Checking non-regresson against issue reported by Medeiros Jr on 28.1.2013'). |
| 1449 | | cli_testcase(991, [tickets,csp_test], ['../prob_examples/public_examples/CSP/Tickets/RecursiveInclude/Procs.csp', '-mc', 100000, '-t', '-strict'], 'Testing of recursive and local (by means of no absolute path files must be given in order to include a CSP model to another CSP model) including for CSP models.'). |
| 1450 | | cli_testcase(992, [b_test], ['-evalt', '{x| x = x mod 33 & x = x mod 44} = 0..32', '-p', 'CLPFD', 'TRUE', '-strict'],'Ensure mod constraint propagation works'). |
| 1451 | | cli_testcase(993, [csp_test], ['../prob_examples/examples/CSP/Kharmeh_PhD/4-isa-system-evaluation.csp', '-mc', 2000, '-cc', 264, 430, '-strict'],'Non trivial test case'). % changed from -cc 265 431 after adding more normalisation rules |
| 1452 | | cli_testcase(994, [b_test,case], ['../prob_examples/public_examples/B/FeatureChecks/CaseStmt.mch', '-t', '-mc', 200, '-cc', 4, 13, '-strict'],'Check case statement with else'). |
| 1453 | | cli_testcase(995, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLawsWithLambda.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'MEMO', 'TRUE', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Laws this time with MEMO and CLPFD'). |
| 1454 | | cli_testcase(996, [b_test,smt_test], ['-evalt', '{x|x/2 : 20..30} = 40..61', '-evalt', '{x|x/20 : 22..23} = 440..479', '-evalt', 'ran(%v0.(v0: 0..20000 | [v0 mod 2/1,v0 mod 4/2,v0 mod 8/4,v0 mod 16/8,v0 mod 32/16,v0 mod 64/32,v0 mod 128/64])) = 1..7 --> 0..1', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-strict'],'Ensure division constraint propagation works'). |
| 1455 | | cli_testcase(997, [csp_test,refusal_trace_refinement,refinement], ['../prob_examples/public_examples/CSP/RefusalBasedRefinement/RefusalBasedRefinement_simple.csp', '-assertions', '-strict'],'Simple test case for refusal based refinement checking (CSP).'). |
| 1456 | | cli_testcase(998, [csp_test,refusal_trace_refinement,refinement], ['../prob_examples/public_examples/CSP/RefusalBasedRefinement/RefTestRoscoeBook.csp', '-assertions', '-strict'],'Test case for refusal based refinement checking (CSP) from Roscoe\'s book. Note: Difference in the results delivered by FDR and ProB of the commented out assertion "P2 [R= P1".'). |
| 1457 | | cli_testcase(999, [eventb_test], ['../prob_examples/public_examples/B/Tickets/197/robot_ctx02_ctx.eventb', '-init', '-properties', '-p', 'DEFAULT_SETSIZE', 2, '-strict'],'Check WD Axiom loading'). |
| 1458 | | cli_testcase(1000, [b_test,union,card], ['-evalt', 'x \\/ y \\/ z <: 1011..1013 & card(x) > card(y) & card(y)>card(z)', '-evalt', '{x,y,z|x \\/ y \\/ z <: 21011..21012 & card(x) > card(y) & card(y)>card(z)} = {(({21011,21012}|->{21011})|->{}),(({21011,21012}|->{21012})|->{})}', '-p', 'CLPFD', 'TRUE', '-strict'], 'Ensure that domains propagated to union arguments.'). |
| 1459 | | cli_testcase(1001, [b_test,union,card], ['-evalt', '{x|x <| [1,2,3] = [1,2] & card(x)=2} = {{1,2}}', |
| 1460 | | '-evalt', 'x <| s = [1,2,3] \\/ {29|->29} & x <: 1..1000 & s = %i.(i:1..300|i)', |
| 1461 | | '-evalt', 's |> x = [1,2,3] \\/ {29|->29} & x <: 1..1000 & s = %i.(i:1..300|i)', |
| 1462 | | '-evalt', '{x| [1,4,3]|>x = [1,4] & card(x)=2}={{1,4}}', |
| 1463 | | '-evalf', 's |> x = [1,2,3] \\/ {29|->29} & x <: 2..3000 & s = %i.(i:1..900|i) ', |
| 1464 | | '-evalt', '{x|#s.(x <| s = [1,2,3] \\/ {29|->29} & x <: 1..30 & s = %i.(i:1..300|i))} = {{1,2,3,29}}', |
| 1465 | | '-evalt', '{z,x|[1,2,z] |>> x = [1,2] & z:12..13 & x<:11..12}={(12|->{11,12}),(12|->{12})}', |
| 1466 | | '-evalt', 'x <<| [11,12,13,14,z] = [11,12,13,14] & z:12..13 ', |
| 1467 | | '-evalt', 'x <| [111,222,333,444,555] = [111,222,333,444]', |
| 1468 | | '-evalt', 'x <<| [111,222,333,444,555] = [111,222,333,444]', |
| 1469 | | '-evalt', '[111,222,333,444,555] |>x = [111,222,333,444]', |
| 1470 | | '-evalt', '[111,222,333,444,555] |>>x = [111,222,333,444]', |
| 1471 | | '-evalt', '{x|{x} <<| [111,222,333,444,555,666] = [111,222,333,444,555]} = {6}', |
| 1472 | | '-evalt', '{x| [111,222,333,444,555,666] |>> {x} = [111,222,333,444,555]} = {666}', |
| 1473 | | '-evalt', '{x| {x} <| [111,222,333,444,555,666] = {5|->555}} = {5}', |
| 1474 | | '-evalt', '{x| [111,222,333,444,555,666] |> {x} = {5|->555}} = {555}', |
| 1475 | | '-evalt', '{x| [111,222,333,444,555,555] |> {x} = {5|->555,6|->555}} = {555}', |
| 1476 | | '-p', 'CLPFD', 'TRUE', '-strict'], 'Ensure that domain/range restriction properly treated.'). |
| 1477 | | cli_testcase(1002, [cbc,private], ['-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 127, '-p', 'MININT', -128, |
| 1478 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bank-Extraer_SP_29.prob', |
| 1479 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_22.prob', |
| 1480 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_11.prob', |
| 1481 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_12.prob' |
| 1482 | | %,'-expcterr', 'eval_string_enum_warning' |
| 1483 | | ], 'SetLog tests now succeeding tests'). |
| 1484 | | cli_testcase(1003, [cbc,private], ['-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 127, '-p', 'MININT', -128, |
| 1485 | | %sc |
| 1486 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCAddCat_SP_4.prob', |
| 1487 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCAddCat_SP_22.prob', |
| 1488 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCSetLevel_DNF_3.prob', |
| 1489 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCSetSC_DNF_3.prob', |
| 1490 | | %bank |
| 1491 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bank-CerrarCaja_SP_12.prob', |
| 1492 | | %banco G |
| 1493 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_18.prob', |
| 1494 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_2.prob', |
| 1495 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_24.prob', |
| 1496 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_25.prob', |
| 1497 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_4.prob', |
| 1498 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_5.prob', |
| 1499 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_8.prob', |
| 1500 | | %qsee |
| 1501 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_10.prob', |
| 1502 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_9.prob', |
| 1503 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpAux_SP_6.prob', |
| 1504 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpAux_SP_8.prob', |
| 1505 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_3.prob', |
| 1506 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_6.prob', |
| 1507 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_8.prob', |
| 1508 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitScientificData_SP_16.prob', |
| 1509 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitScientificData_SP_24.prob', |
| 1510 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitScientificData_SP_8.prob', |
| 1511 | | %plavis ; two more missing |
| 1512 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_45.prob', |
| 1513 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_52.prob', |
| 1514 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-MemoryLoad_SP_55.prob', |
| 1515 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-RetrieveEData_SP_23.prob', |
| 1516 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_13.prob', |
| 1517 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_24.prob', |
| 1518 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_3.prob', |
| 1519 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_31.prob', |
| 1520 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_38.prob', |
| 1521 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_39.prob', |
| 1522 | | % iae |
| 1523 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_103.prob', |
| 1524 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_146.prob', |
| 1525 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_148.prob', |
| 1526 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_149.prob', |
| 1527 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_18.prob', |
| 1528 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_56.prob', |
| 1529 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_58.prob', |
| 1530 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_59.prob', |
| 1531 | | % sensors |
| 1532 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sensors-KeepMaxReading_SP_5.prob' |
| 1533 | | %,'-expcterr', 'eval_string_enum_warning' |
| 1534 | | ], 'SetLog tests some originally succeeding tests'). |
| 1535 | | cli_testcase(1004, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CCounterErr_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 1536 | | cli_testcase(1005, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CCounter_mch.eventb', '-cbc_refinement'], ''). |
| 1537 | | cli_testcase(1006, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CEnterLeave_mch.eventb', '-cbc_refinement'], ''). |
| 1538 | | cli_testcase(1007, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CEnterLeaveErr1_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 1539 | | cli_testcase(1008, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CEnterLeave_Rename_mch.eventb', '-cbc_refinement'], ''). |
| 1540 | | cli_testcase(1009, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CMergeErr_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement, '-p', 'CLPFD', 'TRUE'], ''). |
| 1541 | | cli_testcase(1010, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CMerge_mch.eventb', '-cbc_refinement'], ''). |
| 1542 | | cli_testcase(1011, [cbc_refinement,refinement], ['./distribution_examples/Refinement/ServerR.ref', '-cbc_refinement'], ''). |
| 1543 | | cli_testcase(1012, [cbc_refinement,refinement], ['./distribution_examples/Refinement/ServerR_wrong.ref', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 1544 | | cli_testcase(1013, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/ConcreteVars/MI.imp', '-cbc_refinement'], 'CBC refinement check on implementation'). |
| 1545 | | cli_testcase(1014, [b_test], ['../prob_examples/public_examples/B/Mathematical/FibMemo.mch', '-mc', 120, '-p', 'CLPFD', 'TRUE', '-strict', '-expcterr', 'deadlock', '-cc', 100, 99], 'Test that no CLPFD overflow occurs'). % no warning is generated for clpfd overflows at the moment; so the test is not really that useful |
| 1546 | | cli_testcase(1015, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Copy/ReturnEqualI.imp', '-cbc_refinement'], ''). |
| 1547 | | cli_testcase(1016, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Division/DivisionImplOk.imp', '-cbc_refinement'], ''). |
| 1548 | | cli_testcase(1017, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Division/DivisionImplWrongCondition.imp', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 1549 | | cli_testcase(1018, [b_test,refinement], ['../prob_examples/public_examples/B/RefinementChecking/Schedular/Schedular1.mch', '-refchk', '../prob_examples/public_examples/B/RefinementChecking/Schedular/Schedular0_refine_spec.P', '-expcterr', 'refinement_check_fails', '-strict'], 'Checking for expected refinement error. Example taken from the paper: Automatic Refinement Checking for B.'). |
| 1550 | | cli_testcase(1019, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/Implementations/FTP/FileTransfer1.ref', '-cbc_refinement'], ''). |
| 1551 | | cli_testcase(1020, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/Implementations/FTP/FileTransfer2.ref', '-cbc_refinement'], ''). |
| 1552 | | cli_testcase(1021, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Mul/MulImp.imp', '-cbc_refinement'], ''). |
| 1553 | | cli_testcase(1022, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Mul/MulImpErr.imp', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 1554 | | cli_testcase(1023, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Power/AExpBImpl.imp', '-cbc_refinement'], ''). |
| 1555 | | cli_testcase(1024, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Simple10/Simple10Imp.imp', '-cbc_refinement'], ''). |
| 1556 | | cli_testcase(1025, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Simple10/Simple10ImpErr.imp', '-cbc_refinement', '-expcterr', cbc_refinement, '-p', 'CLPFD', 'TRUE'], ''). |
| 1557 | | cli_testcase(1026, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Simple10/Simple10ImpErr2.imp', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 1558 | | cli_testcase(1027, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/RefinementChecking/ServerR.ref', '-cbc_refinement'], ''). |
| 1559 | | cli_testcase(1028, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/RefinementChecking/ServerR_wrong.ref', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 1560 | | cli_testcase(1029, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/RefinementChecking/SwapR.ref', '-cbc_refinement'], ''). |
| 1561 | | cli_testcase(1030, [b_test,infinite,sequences, theories], ['../prob_examples/public_examples/B/FunctionalProgramming/SequenceTheory.mch', '-t', '-assertions'], 'Check infinite functions and sets'). |
| 1562 | | cli_testcase(1031, [b_test,card], ['../prob_examples/public_examples/B/FeatureChecks/DeferredSetAndConstants.mch', '-init', |
| 1563 | | '-evalt', 'ID3=3 & ID1:ID2 & ID0:ID2 & (xx=ID5 => not(xx=ID6)) & (xx=ID6 => not(xx=ID5))'],'Check that name clashes between deferred set ids and other ids handled gracefully'). |
| 1564 | | cli_testcase(1032, [csp_test,refusal_trace_refinement,refinement], ['../prob_examples/public_examples/CSP/RefusalBasedRefinement/RefusalBasedRefinement_DIV.csp', '-assertions', '-strict'],'Simple test case for refusals-divergence based refinement checking (CSP).'). |
| 1565 | | cli_testcase(1033, [dot], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-bf', '-mc', 1000, '-strict', '-dotexpr', transition_diagram, 'card(active)', |
| 1566 | | '../prob_examples/public_examples/B/Benchmarks/scheduler_transition_diagram.dot', |
| 1567 | | '-p', 'DOT_LOOPS', 'FALSE' % added 7/11/2023 |
| 1568 | | ],'Check Transition Diagram for Expression.'). |
| 1569 | | cli_testcase(1034, [tickets], ['../prob_examples/public_examples/B/Tickets/leuschel4/SetBecomeElementOf.mch', '-t'], 'check no error with ::'). |
| 1570 | | cli_testcase(1035, [tickets], ['../prob_examples/public_examples/B/Tester/SubstSetInTests.mch', '-t', '-p', 'CLPFD' ,'TRUE', '-p', 'SYMBOLIC', 'TRUE'], 'check no error with ::'). |
| 1571 | | cli_testcase(1036, [tickets,smt_test], ['../prob_examples/public_examples/B/PerformanceTests/LargeRelationSetTests.mch', '-t', '-p', 'CLPFD' ,'TRUE', '-p', 'SMT', 'TRUE', '-p', 'SYMBOLIC', 'TRUE'], 'check no residue in symbolic mode due to lambda_res projected away'). |
| 1572 | | cli_testcase(1037, [b_test], ['-evalt', '{x|x**4 = 160000}={-20,20}', '-evalt', '{x|x**3 = -125000} = {-50}', '-evalt', 'x**4 = y & y=160000', '-evalt', '{x,y|x**4 = y & y:140000..160004}={(-20|->160000),(20|->160000)}', '-p', 'CLPFD', 'TRUE', '-strict'], 'Ensure exponentation constraint propagation.'). |
| 1573 | | cli_testcase(1038, [b_test], ['-evalt', 'x mod 100000 >= 99999', |
| 1574 | | '-evalf', 'x mod 100000 > 99999', |
| 1575 | | '-evalt', '(x+2) mod 100000 >= 99999', |
| 1576 | | '-evalt', '(x-2) mod 100000 >= 99999 & x>2', |
| 1577 | | '-evalt', '{x,y|x mod y = x & y : 10..11 & x>0 & x+3>y}={(8|->10),(9|->10),(9|->11),(10|->11)}', |
| 1578 | | '-evalt', 'x:NATURAL & x mod 10000 = 9999', |
| 1579 | | '-evalt', 'x:NATURAL & x mod 10000 = 998', |
| 1580 | | '-evalf', 'x:NATURAL & x mod 10000 = 10000', |
| 1581 | | '-evalf', 'x:NATURAL & x mod 10000 = 10001', |
| 1582 | | '-evalt', '{X|X:1..20 & X**8 = 256} = {2}', |
| 1583 | | '-evalt', '{X|X:1..20 & X**9 = 256} = {}', |
| 1584 | | '-evalt', '{X,Y,Z|X:1..20 & Y : 8..9 & Z : 255..513 & X**Y = Z} = {(2,8,256),(2,9,512)}', |
| 1585 | | '-evalt', '{X,Y,Z|X:1..20 & Y : 8..9 & Z : 1..513 & X**Y = Z} = {((1|->8)|->1),((1|->9)|->1),((2|->8)|->256),((2|->9)|->512)}', |
| 1586 | | '-p', 'CLPFD', 'TRUE', '-strict' |
| 1587 | | %, '-expcterr', eval_string_enum_warning |
| 1588 | | ], 'Ensure modulo constraint propagation.'). |
| 1589 | | cli_testcase(1039, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/MaxDevelopment/MaxImp.imp', '-cbc_refinement'], ''). |
| 1590 | | cli_testcase(1040, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/MaxDevelopment/MaxImpVector.imp', '-cbc_refinement'], ''). |
| 1591 | | cli_testcase(1041, [cbc_refinement,wd,refinement], ['../prob_examples/public_examples/B/Implementations/MaxDevelopment/MaxR.ref', '-cbc_refinement', '-expcterr', 'well_definedness_error'], 'Max is applied to an empty set here - wd error in constraint solver'). |
| 1592 | | cli_testcase(1042, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/Implementations/MaxDevelopment/MaxR2.ref', '-cbc_refinement'], ''). |
| 1593 | | cli_testcase(1043, [pge], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', '-mc', '1000000', '-bf', '-p', pge, full, |
| 1594 | | '-get_coverage_information', '../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.cov', |
| 1595 | | '-strict'], |
| 1596 | | 'Testing for identical coverage information after the PGE optimization.'). |
| 1597 | | cli_testcase(1044, [pge], ['../prob_examples/public_examples/B/EventB/EventB_Projekt/lift_solution.mch', '-mc', '1000000', '-bf', '-p', pge, full, '-p', timeout_cbc_analysis, 60000, '-get_coverage_information', '../prob_examples/public_examples/B/EventB/EventB_Projekt/lift_solution_Coverage_pge.txt', '-strict'], 'Testing for identical coverage information after the PGE optimization.'). |
| 1598 | | cli_testcase(1045, [pge_fast,private], ['../prob_examples/examples/RodinModels/Deploy/Bosch/CruiseControl/CrsCtl_m4.eventb', '-mc', '1000000', '-bf', '-p', pge, full, '-get_coverage_information', '../prob_examples/examples/RodinModels/Deploy/Bosch/CruiseControl/CrsCtl_m4_Coverage_pge.txt', '-strict', '-expecterr', 'model_check_incomplete'], 'Testing for identical coverage information after the PGE optimization.'). |
| 1599 | | cli_testcase(1046, [por], ['../prob_examples/public_examples/B/Ivo/PruningActionsTest2.mch', '-mc', '1000000', '-noinv', '-p', 'por', ample_sets, '-expcterr', deadlock, '-strict'], 'POR test (deadlock).'). |
| 1600 | | cli_testcase(1047, [por], ['../prob_examples/public_examples/B/Ivo/ActivatingDepAction.mch', '-mc', '1000000', '-nodead', '-p', 'por', ample_sets, '-expcterr', invariant_violation, '-strict'], 'POR test (invariant violation).'). |
| 1601 | | cli_testcase(1048, [eventb_test], ['../prob_examples/public_examples/B/Tickets/Georghe1/seq_m_mch_concrete_constants.eventb', '-mc', '100', '-expecterr', 'deadlock', '-expecterr', 'event_error:append:action_not_executable'], 'Can now also be initialized with ProB and enumeration_warning exception detection.'). |
| 1602 | | cli_testcase(1049, [eventb_test], ['../prob_examples/public_examples/B/Tickets/Georghe1/seq_m_mch_abstract_constants.eventb', '-mc', '100', '-expecterr', 'deadlock', '-expecterr', 'event_error:append:action_not_executable'], 'Same as 1048, no with abstract constants - should not time out'). |
| 1603 | | cli_testcase(1050, [eventb_test,cbc,private], ['../prob_examples/examples/EventBPrologPackages/Advance_WP2/SubstationMeter_2603_2013.eventb', '-cbc', 'all', '-strict'], 'Test that proof info correctly used; machine fully proven.'). |
| 1604 | | cli_testcase(1051, [laws], ['../prob_examples/public_examples/B/Laws/FinitenessLaws.mch', '-init', '-assertions', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'TRUE'], 'Various laws about finitness of sets.'). |
| 1605 | | cli_testcase(1052, [eventb_test,cbc,private], ['../prob_examples/examples/EventBPrologPackages/Advance_WP2/SubstationMeter_finite_mch.eventb', '-strict', '-mc', 50, '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test multi-level animation.'). |
| 1606 | | % generates many "Keeping comprehension-set symbolic" messages due to assignment in confirm event: |
| 1607 | | % quoted := quoted |>> {a|->c|->d|->e|a : NAT & (c : NAT1 & (d : NAT1 & (e : NAT & a = prj1(INTEGER,INTEGER)(prj1(INTEGER*INTEGER,INTEGER)(prj1((INTEGER*INTEGER)*INTEGER,INTEGER)(quoted(reqid)))))))} |
| 1608 | | cli_testcase(1054, [b_test, let], ['../prob_examples/public_examples/B/FeatureChecks/NestedAnys.mch', '-t', '-mc', 100, '-cc', 6, 7], 'Check LET extraction'). |
| 1609 | | cli_testcase(1055, [csp_test,refinement], ['../prob_examples/public_examples/CSP/ucsexamples/chapter04/abp.csp','-assertions','-strict'], 'Checking CSP-M assertions.'). |
| 1610 | | cli_testcase(1056, [csp_test,refusal_trace_refinement,refinement], ['../prob_examples/public_examples/CSP/other/Williams/vg.csp','-assertions','-strict'], 'Checking CSP-M assertions of refusal trace refinements.'). |
| 1611 | | cli_testcase(1057, [tickets], ['../prob_examples/public_examples/B/Tickets/LoopPartition/bug.eventb', '-init','-expecterr', 'setup_constants_fails'], 'Check that partition(SET,{A},{B},{A,B}) does not lead to a loop in find_inequal_global_set_identifiers'). |
| 1612 | | cli_testcase(1058, [csp_test,refusal_trace_refinement,refinement], ['../prob_examples/public_examples/CSP/Tickets/WilliamsCSP/protocol_short.csp','-assertions','-t','-strict'], 'Expanding partial constructors inside of closures (see declaration: Network_Data_Fwd = {| CData |} in file).'). |
| 1613 | | cli_testcase(1059, [b_test,card], ['-evalt', '{X,F|bool(X /\\ {1} = {} & X \\/ {1} = 1..50000)=F & F:{TRUE,FALSE} & F=bool({1} <: {2,1})} = { (2..50000,TRUE) }', |
| 1614 | | '-evalt', '{X,F|bool(X /\\ {1} = {} & X \\/ {1} = 1..50000)=F & F:{TRUE,FALSE} & F=bool({1} <: {2,1})} <<: { (2..50000,TRUE), ({},TRUE) }', |
| 1615 | | '-evalt', 'card(%(X,F).(bool(X /\\ {1} = {} & X \\/ {1} = 1..50000)=F & F:{TRUE,FALSE} & F=bool({1} <: {2,1})|F))=1', |
| 1616 | | '-evalt', '{X| X /\\ {1} = {} & X \\/ {1} = 1..20} = {2..20}'], 'Check partition detection inside expressions'). |
| 1617 | | cli_testcase(1060, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/PartitionDetection.mch', '-t'], 'Check partition detection inside substitutions'). |
| 1618 | | cli_testcase(1061, [b_test], ['-evalt', '#f.(f : 1..11 --> 1..10 & dom(f~) = 1..10)', '-evalt', '#f.(f:1..49 -->> 1..49)', '-evalf', '#f.(f:1..19 -->> 1..20)', |
| 1619 | | '-evalt', '#f.(f : 1..10 --> 1..10 & ran(f) = 1..10)'],'Check that range/domain/-->> scale properly'). |
| 1620 | | cli_testcase(1062, [b_test,infinite], ['-evalt', '#(i,f).(i = %x.(x:INTEGER|x+1) & f = (i;i;i;i;i;i;i;i) & 2008 = f(2000))', '-evalt', '#(i,f).(i = %x.(x:INTEGER|x*x) & f = (i;i) & f[{1,2,4,8,101}]={1,2**4,4**4,8**4,104060401})', |
| 1621 | | '-evalt', '#(i,m,f).(i = %x.(x:INTEGER|x+1) & m = %y.(y:NATURAL|y*y) & f = (i;m;i) & 1+2001**2 = f(2000))', |
| 1622 | | '-evalt', 'i = %(x,y).(x:INTEGER&y:INTEGER|x+y) & m = %y.(y:NATURAL|y*y) & f = (i;m) & 2500 = f(20,30)', |
| 1623 | | '-evalt', 'i = %(x,y).(x:INTEGER&y:INTEGER|x+y) & m = %y.(y:NATURAL1|bool(y>100)) & f = (i;m) & TRUE = f(20,90)', |
| 1624 | | '-evalt', 'poly = %(x,y,z).(x:INTEGER&y:INTEGER&z:INTEGER|x*x+y*y+z*z) & dec = %v.(v:NATURAL1|v-1) & f = (poly ; dec) & f(1,2,3)=13', |
| 1625 | | '-evalt', 'max0 = %x.(x<:INTEGER|max(x)-1) & inc = %v.(v:INTEGER|v+1) & m = (max0;inc) & m(1..100 \\/ {4321})=4321', |
| 1626 | | '-evalt', 'max0 = %x.(x<:INTEGER|max(x)-2) & inc = %v.(v:INTEGER|v+1) & is=%s.(s<:INTEGER|inc[s]) & m = (is;max0;inc) & m(1..100 \\/ {4321})=4321' |
| 1627 | | ],'Check that relational composition of infinite function works'). |
| 1628 | | cli_testcase(1063, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/FeatureTests/ThmInGuard_mch.eventb', '-mc', 100, '-strict', '-expcterr', 'model_check_incomplete'], 'Test that theorem in guards can be loaded.'). |
| 1629 | | cli_testcase(1064, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/FeatureTests/EventWithSlash_mch.eventb', '-mc', 100, '-expcterr', invariant_violation, '-strict'], 'Test that slash in Event Name does not cause problems.'). |
| 1630 | | |
| 1631 | | cli_testcase(1065, [b_test], ['-evalt', '{X,Y,Z,V,W,A,B,C} = {1,2,3,4,5,6,7,8} & X>Y & Y>Z & Z>V & V>W & W>A & A>B & B>C', |
| 1632 | | '-evalf', '{X,Y,Z,V,W,A,B,C} = {1,2,3,4,5,7,8} & X>Y & Y>Z & Z>V & V>W & W>A & A>B & B>C'], 'Test that constraint propagation for set extension works'). |
| 1633 | | |
| 1634 | | cli_testcase(1066, [b_test], ['../prob_examples/public_examples/B/Mathematical/GCD.mch', '-init', |
| 1635 | | '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 128, |
| 1636 | | '-evalt', 'half(201)=100', |
| 1637 | | '-evalnwd', 'gcd({10,15})', % this one is not well defined |
| 1638 | | '-evalt', 'gcdc({1000,750})=250'], 'Check that expression values enumerated'). % gcd({10,15}) requires enumeration of result value |
| 1639 | | |
| 1640 | | cli_testcase(1067, [cbc,cbc_tests], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc_sequence', 'new;del', '-cbc_sequence', 'new;ready', '-cbc_sequence', 'new;ready,swap'], 'Check that constraints can be solved'). |
| 1641 | | cli_testcase(1068, [cbc,cbc_tests], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc_sequence', 'new;del;del', '-expcterr', cbc_sequence_no_solution_found], 'Check that constraints cannot be solved'). |
| 1642 | | cli_testcase(1069, [cbc,cbc_tests], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc_tests', 3, '1=1', '../prob_examples/public_examples/B/Benchmarks/scheduler_cbc_tests.xml'], 'Check that full coverage can be achieved'). |
| 1643 | | cli_testcase(1070, [cbc,cbc_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/InvolvedSequences.mch', '-cbc_sequence', 'BookFlight;BookHotel;BookReturnFlight', '-cbc_sequence', 'BookFlight;BookReturnFlight;BookHotel;BookHotel'], 'Check that constraints can be solved'). |
| 1644 | | cli_testcase(1071, [cbc,cbc_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/InvolvedSequences2.mch', '-cbc_sequence', 'Op1;Op2;Op3;Target3', '-p', 'CLPFD', 'TRUE'], 'Check that constraints can be solved'). |
| 1645 | | cli_testcase(1072, [cbc,cbc_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/InvolvedSequences2.mch', '-cbc_tests', 2, '1=1', '../prob_examples/public_examples/B/TestCaseGeneration/InvolvedSequences2_cbc_tests.xml', '-p', 'CLPFD', 'TRUE', '-expcterr', 'cbc_tests'], 'Check that coverage cannot be achieved'). |
| 1646 | | cli_testcase(1073, [cbc,cbc_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/InvolvedSequences2.mch', '-cbc_tests', 4, '1=1', '../prob_examples/public_examples/B/TestCaseGeneration/InvolvedSequences2_cbc_tests.xml', '-p', 'CLPFD', 'TRUE'], 'Check that full coverage can be achieved'). |
| 1647 | | cli_testcase(1074, [cbc,tla,smt_test,cbc_tests], ['../prob_examples/public_examples/TLA/SumAndProduct/Merz/SumAndProductTransition.tla', '-cbc_sequence', 'Step2;Step3;Step4', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE' ], 'Check cbc sequence on TLA example'). |
| 1648 | | cli_testcase(1075, [b_test], ['../prob_examples/public_examples/B/PerformanceTests/SetLogInefficiencies4.mch', '-init', '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 128, '-assertions'], 'Check that ProB deals well with certain examples which Setlog cannot deal with'). |
| 1649 | | cli_testcase(1076, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/VariableCaptureComprSet.mch', '-cbc' ,'all', '-expcterr', 'cbc', '-assertions', '-p', 'CLPFD', 'TRUE', '-mc', 100, '-expcterr', 'invariant_violation'], 'Check that variable capture problems do not confuse ProB'). |
| 1650 | | |
| 1651 | | cli_testcase(1077, [b_test,closure1,card], ['-evalt', '{y|#(r,r2).({x,y|x<y} = r & r2 = (r;r) & 20|->y : r2 & y|->25 : r2)} = (22..23)', |
| 1652 | | '-evalf', '{y|#(r,r2).({x,y|x<y} = r & r2 = (r;r) & 20|->y : r2 & y|->25 : r2)} = (22..24)', |
| 1653 | | '-evalt', 'f = %x.(x:NATURAL|x+x) & f2 = (f;f) & i = f2[1..n] & card(i)=n & min(i)=4 & max(i)=4*n & n=5000', |
| 1654 | | '-evalt', 'f = %x.(x:NATURAL|x+x) & f2 = (f;f) & f4 = (f2;f2) & i = f4[1..n] & card(i)=n & min(i)=16 & max(i)=16*n & n=2000', |
| 1655 | | '-evalt', 'f = %x.(x:NATURAL|x+x) & f2 = (f;f) & r1 = {x,y|x:1..n & y:{x,x+1}} & comp = {x,z|#y.(x|->y:r1 & y|->z:f2)} & comp2 = (r1 ; f2) & comp=comp2 & n=1000 & card(comp2) = 2*n & max(ran(comp2))=4*(n+1)', |
| 1656 | | '-evalt', 'half = {x,y|y+y=x} & card(half[1024 .. xx] \\/ (closure1(half) ; half)[1024 .. xx])=10 & xx=1024', |
| 1657 | | '-p', 'SYMBOLIC', 'TRUE', '-p', 'CLPFD', 'TRUE' |
| 1658 | | , '-p', 'TIME_OUT', 7000 % TEMPORARILY INCREASE TIME OUT: TO DO investigate why r1 = {x,y|x:1..n & y:{x,x+1}} & comp = {x,z|#y.(x|->y:r1 & z=y+y+y+y)} & n=1000 & max(ran(comp))=4*(n+1) is much slower since frozen_dif_aux checks for int_plus4 |
| 1659 | | ], 'Test that symbolic relational composition works'). |
| 1660 | | cli_testcase(1078, [private,data_validation], ['../prob_examples/examples/B/Systerel/PerformanceIssue_Apr13/TOP3_CONC_def7_obs_original.mch', '-init' ,'-aa', 0,1,0, '-p', 'SYMBOLIC', 'TRUE'], 'Check that performance issue related to symbolic relational composition solved'). |
| 1661 | | cli_testcase(1079, [cbc,smt_test], ['../prob_examples/public_examples/TLA/SumAndProduct/Merz/SumAndProductCst.mch', '-assertions', '-init', '-det_check', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE' , '-p' ,'TIME_OUT', 12000], 'Check solving on example with nested set comprehensions'). |
| 1662 | | cli_testcase(1080, [b_test,closure1], ['../prob_examples/public_examples/B/Laws/RelClosureLaws.mch', '-init' ,'-assertions', '-p', 'CLPFD', 'TRUE'], 'Check various assertions about relational composition and closure1'). |
| 1663 | | cli_testcase(1081, [b_test,closure1], ['../prob_examples/public_examples/B/Laws/RelClosureLaws.mch', '-t', '-p', 'CLPFD', 'TRUE', '-mc', 20, '-nogoal', '-nodead', '-expcterr', 'model_check_incomplete'], 'Check various assertions about relational composition and closure1'). |
| 1664 | | cli_testcase(1082, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/TUBerlin/Interleaving.csp','-assertions','-strict'], 'Checking CSP-M assertions.'). |
| 1665 | | cli_testcase(1083, [tickets,data_validation], ['-evalt', 'adii = %ii.(ii : INTEGER +-> {FALSE,TRUE}|(ii |>> {FALSE})) & afq = {y,z|z : BOOL & (y : {(0|->1)}[{m}] & z = FALSE)} & afs = adii(afq)', '-p', 'SYMBOLIC', 'TRUE', |
| 1666 | | '-p', 'MEMO', 'TRUE' %, '-expcterr' , eval_string_enum_warning |
| 1667 | | ],'ensure no avl_set(empty) is generated anymore'). |
| 1668 | | cli_testcase(1084, [cbc,card], ['-evalt', 'r:INTEGER<->INTEGER & dom(r)=2..20', |
| 1669 | | '-evalt', 'r:INTEGER<->BOOL & dom(r)=2..50', |
| 1670 | | '-evalt', 'r:INTEGER<->INTEGER & ran(r)=2..50', |
| 1671 | | %'-evalt', 'r:INTEGER<->INTEGER & ran(r)=2..16 & card(r)>=15', |
| 1672 | | %'-evalt', 'r:INTEGER<->INTEGER & dom(r)=2..16 & card(r)>=15', |
| 1673 | | '-evalt', 'r:INTEGER<->INTEGER & dom(r)=10002..10016', |
| 1674 | | '-evalt', 'r:INTEGER<->INTEGER & ran(r)=10002..10016', |
| 1675 | | '-evalt', 'card({r|r:INTEGER<->INTEGER & dom(r)=61..64 & card(r)=4 & ran(r) = 55..56})=14', |
| 1676 | | '-evalt', 'card({r|r:INTEGER<->INTEGER & dom(r)=9961..9964 & card(r)=4 & ran(r) = 2155..2158})=24', |
| 1677 | | '-evalt', 'card({r|r:INTEGER<->INTEGER & dom(r)=61..64 & card(r)=4 & ran(r) = 155..159})=0', |
| 1678 | | '-p', 'CLPFD', 'TRUE' %, '-expcterr', eval_string_enum_warning |
| 1679 | | ],'ensure proper constraint-solving for domain/range'). |
| 1680 | | cli_testcase(1085, [b_test], ['../prob_examples/public_examples/EventBPrologPackages/Advance/DoorLockSystem/LOCKSR2_mch.eventb', '-mc', 100, '-cc', 24, 32, '-vacuity_check', '-expcterr', vacuity_check, '-strict'], 'Checking vacuity_check command'). |
| 1681 | | cli_testcase(1086, [csp_test, cbc], ['../prob_examples/public_examples/CSP/clpfd_tests/SetComprehensionCBC.csp','-p', 'CLPFD', 'TRUE', '-assertions','-strict', '-p', 'TIME_OUT', 5000], % increase timeout for windows |
| 1682 | | 'Checking CSP-M assertions (CBC test case).'). % was skipped in 2013 188167bc320f854a4634146299c3f19278047c8e |
| 1683 | | cli_testcase(1087, [b_test,infinite], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteIntersection.mch', '-p', 'CLPFD', 'TRUE', '-init', '-assertions'], 'Check we can take intersection with infinite sets'). |
| 1684 | | cli_testcase(1088, [cbc,smt_test], ['../prob_examples/public_examples/B/Benchmarks/phonebook7.mch','-p', 'CLPFD', 'TRUE', |
| 1685 | | '-p', 'TIME_OUT', 5000, % increased time-out after change of pfun enumeration priority; TO DO: fix |
| 1686 | | '-p', 'SMT', 'TRUE', % added SMT option after adding wait flag for propagate_result_to_input in domain_wf in bsets_clp |
| 1687 | | '-cbc', 'all','-strict'], 'Check that we do not time-out (due to delaying normalisation of variables).'). |
| 1688 | | cli_testcase(1089, [b_test], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteIntersection2.mch', '-p', 'CLPFD', 'TRUE', '-p', 'SYMBOLIC', 'FALSE','-init', '-assertions'], 'Check ProB now detects even/odd automatically as symbolic'). |
| 1689 | | cli_testcase(1090, [b_test,infinite,sigma,union], [ |
| 1690 | | '-evalt', 'f = {x,y,z| x*x + y*y = z*z} & {y|(3,4,y):f} = {-5,5}', |
| 1691 | | '-evalt', 's = {x,y,z| z:seq(NATURAL) & x^y=z} & {v|([1111,2222,3333,4444],[99999,8888],v):s} = {[1111,2222,3333,4444,99999,8888]}', |
| 1692 | | '-evalt', 's = {x,y| x<:POW(NATURAL) & union(x)=y & SIGMA(z).(z:y|z)>1000} & s({{890},{},{1,199}}) = res & SIGMA(v).(v:res|v)=1090', |
| 1693 | | '-p', 'CLPFD', 'TRUE'],'ensure ProB detects certain relations as infinite automatically'). |
| 1694 | | cli_testcase(1091, [csp_test, csp_det,refinement], ['../prob_examples/public_examples/CSP/Tickets/Ivo/AgentCurry.csp', '-assertions','-strict'], 'Checking CSP-M assertions (agent curry calls).'). |
| 1695 | | cli_testcase(1092, [csp_test, csp_det,refinement], ['../prob_examples/public_examples/CSP/ucsexamples/chapter06/commsec.csp', '-assertions','-strict'], 'Checking CSP-M assertions (agent curry calls).'). |
| 1696 | | cli_testcase(1093, [b_test,infinite,override,sigma,union,card], [ |
| 1697 | | '-evalt', 'f = %x.(x:NATURAL|x+x) & g = f <+ {0|->1} & g(0)=res0 & g(111)=res1', |
| 1698 | | '-evalt', 'f = {x,y|x:NATURAL & y=x+x or y=x*x} & g = f <+ {0|->111,222|->1024} & union({res|g[{222}] =res})=rr222 & union({res|g[{1000}] =res}) = rr1000 & card(rr222)=1 & card(rr1000)=2 & SIGMA(z).(z:rr1000|z)=1002000', |
| 1699 | | '-evalt', 'r1 = {x,y|x*x<y & (x+1)*(x+1)>y} & r2 = %z.(z>20|z) & r12 = r1 <+ r2 & (21,x21):r12 & {x10|10|->x10 : r12}=r10 & SIGMA(v).(v:r10|v)+x21=2231', |
| 1700 | | '-evalt', 'r1 = {x,y|x*x<y & (x+1)*(x+1)>y} & r2 = %z.(z>20|z) & r21 = r2 <+ r1 & {x|21|->x : r21}=x21 & x21 = ((21*21)+1)..((22*22)-1)', |
| 1701 | | '-p', 'CLPFD', 'TRUE'],'ensure symbolic treatment of override'). |
| 1702 | | cli_testcase(1094, [tickets, proz], ['../prob_examples/public_examples/Z/Tickets/Thompson1/System.fuzz', '-init', '-eval', 'map={}','-strict'], 'Checking CSP-M assertions (agent curry calls).'). |
| 1703 | | cli_testcase(1095, [b_test,cbc], ['../prob_examples/public_examples/B/BZTT/GSM_revue.mch', '-t', '-mc', 3000, '-cc', 1850, 53594, '-cbc_deadlock', '-strict', '-p', 'CLPFD', 'TRUE'], 'Checking old BZTT example.'). |
| 1704 | | cli_testcase(1096, [b_test,cbc,smt_test], ['../prob_examples/public_examples/B/BZTT/GSM_revue.mch', '-cbc', all, '-cbc_deadlock', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE'], 'Checking old BZTT example.'). |
| 1705 | | cli_testcase(1097, [tickets,eventb_test], ['../prob_examples/public_examples/B/Tickets/PROB-292/MTool1__04.eventb', '-mc', 100, '-expcterr', invariant_violation, '-p', 'PROOF_INFO', 'TRUE'], 'Check that proof info not confused by event extending itself (PROB-292)'). |
| 1706 | | cli_testcase(1098, [tickets,tla], ['../prob_examples/public_examples/B/Tickets/Hansen4/Test.mch', '-state_trace', '../prob_examples/public_examples/B/Tickets/Hansen4/Test.tla.trace'], 'Check that state_trace works with constants'). |
| 1707 | | cli_testcase(1099, [b_test,card,infinite], [ '-p', 'TIME_OUT', 1500, |
| 1708 | | '-evalt', 'f = /*@symbolic*/ {x,y|x:0..2**32 & x mod 2 =0 & y=x*x} & f(x) = 10000', |
| 1709 | | '-evalt', 'f = /*@symbolic*/ {x,y|x:0..2**132 & x mod 2 =0 & y=x*x} & f(x) = 10000', |
| 1710 | | '-evalt', 'f = /*@symbolic*/ {x,y|x:0..2**25 & x mod 2 =0 & y=x*x} & {r|f(r) = 10000}=res & card(res)=1 & #vv.(vv:res &vv=100)', |
| 1711 | | '-p', 'CLPFD', 'TRUE'],'ensure detection of large set comprehensions'). % TO DO: see if we can it to work again without symbolic |
| 1712 | | cli_testcase(1100, [b_test,card], [ |
| 1713 | | '-evalt', 'r = {(111,2222),(333,4444)} & s = (2000..2001)*{v|v>3000} & x : (r||s)', |
| 1714 | | '-evalt', 'card(((1..100)*(50..60) || (2..30)*(20..22))) = 95700', |
| 1715 | | '-evalt', 'card(((1..100)*(50..60) || (2..30)*(23..22)))=0', |
| 1716 | | '-evalt', '(((1..10)*(50..60) || (2..30)*(23..24)))~ = (((50..60)*(1..10) || (23..24)*(2..30)))', |
| 1717 | | '-evalt', 'card(((1..1000)*(50..60) || (2..30)*(20..22))) = 957000', |
| 1718 | | '-evalt', 'card(((1..n)*(50..60) || (2..30)*(20..22))) = 957*n & n=10', |
| 1719 | | '-p', 'CLPFD', 'TRUE' %, '-expcterr', 'eval_string_enum_warning' |
| 1720 | | ],'ensure symbolic treatment of parallel product works'). |
| 1721 | | |
| 1722 | | cli_testcase(1101, [private,data_validation,infinite,union],[ |
| 1723 | | '../prob_examples/examples/B/Systerel/C578.EML.014/360_002.mch', |
| 1724 | | '../prob_examples/examples/B/Systerel/C578.EML.014/380_002.mch', |
| 1725 | | '../prob_examples/examples/B/Systerel/C578.EML.014/612_001.mch', |
| 1726 | | '../prob_examples/examples/B/Systerel/C578.EML.014/019_100_corrected.mch', |
| 1727 | | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_TVD_8.mch', |
| 1728 | | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_CBTC_TER_1.mch', |
| 1729 | | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_ZMA_PRUD_1.mch', |
| 1730 | | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_ZMA_PRUD_7.mch', |
| 1731 | | '-p', 'TIME_OUT', '11000', '-p', 'SYMBOLIC', 'TRUE', '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', '0', '-p', 'CLPFD', 'TRUE', '-p', 'MEMO', 'TRUE', '-init', '-assertions', |
| 1732 | | '-p', 'TRACE_INFO', 'FALSE', % changed to FALSE to reduce output |
| 1733 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-strict'], |
| 1734 | | 'check data validation tasks with infinite sets'). |
| 1735 | | cli_testcase(1102, [private,data_validation,infinite],[ |
| 1736 | | '../prob_examples/examples/B/Systerel/C578.EML.014/019_100.mch', |
| 1737 | | '-p', 'TIME_OUT', '9000', '-p', 'SYMBOLIC', 'TRUE', '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', '0', '-p', 'CLPFD', 'TRUE', '-p', 'MEMO', 'TRUE', '-init', '-aa', 12,1,0,'-p', 'TRACE_INFO', 'TRUE', '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-strict'], |
| 1738 | | 'check data validation tasks with infinite sets'). |
| 1739 | | cli_testcase(1103, [private,data_validation,infinite],[ |
| 1740 | | '../prob_examples/examples/B/Systerel/C578.EML.014/435_002.mch', |
| 1741 | | '-p', 'TIME_OUT', '9000', '-p', 'SYMBOLIC', 'TRUE', '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', '0', '-p', 'CLPFD', 'TRUE', '-p', 'MEMO', 'TRUE', '-init', '-aa', 0,1,0,'-p', 'TRACE_INFO', 'TRUE', '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-strict'], |
| 1742 | | 'check data validation tasks with infinite sets'). |
| 1743 | | cli_testcase(1104, [b_test, let,quantified,union,card], [ |
| 1744 | | '-evalt', 'INTER(x , y,z ).(x=1..y & y=5&z=2|x) = {1,2,3,4,5}', |
| 1745 | | '-evalt', 'UNION(x , y,z ).(x=1..y & y=5&z=2|x) = {1,2,3,4,5}', |
| 1746 | | '-evalt', 'UNION(x , y ).(x=1..y & y=20|x)=1..20', |
| 1747 | | '-evalt', 'UNION(beu).(beu=1|{2}) = {2}', |
| 1748 | | '-evalt', 'UNION(xx).(xx<:55..60|xx) = 55..60', |
| 1749 | | '-evalt', 'UNION(x , y ).(x=1..y & y=20&v<10|x)=r & v=20 & r={}', |
| 1750 | | '-evalt', 'UNION(x , y ).(x=1..y & y=20&v<10|x)=r & v=5 & r=1..20', |
| 1751 | | '-evalt', 'UNION(x).(x=1 & x>2|{1}) = {}', |
| 1752 | | '-evalf', 'card(UNION(x).(x=1 & x>2|{1}))>0', |
| 1753 | | '-evalt', 'UNION(x).(x=1 & (x>2 or x<3)|{x}) = {1}', |
| 1754 | | '-evalt', 'UNION(x,y).(x=1 & (x>2 or x<y) & y:0..3|{x|->y}) = {(1|->2),(1|->3)}', |
| 1755 | | '-evalt', 'UNION(x,y).(x=y & y=x+1 & x:1..100|{x|->y}) = {}', |
| 1756 | | '-evalt', 'UNION(x,y).(x=1 & y:1..2|{x+y}) = {2,3}', |
| 1757 | | '-evalt', 'INTER(x,y).(x=1 & y:1..2|{x+y}) = {}', |
| 1758 | | '-evalt', 'INTER(x,y).(x=1 & y:1..2|{x+y,x+y+1})={3}', |
| 1759 | | '-evalt', 'INTER(x,y,z).(x=1000 & z=x+1000 & y:1..2|{x+y+z,x+y+z+1}) = {3002}', |
| 1760 | | '-evalf', '!(x,y).(x=1 & y:(x+1)..(x+19) => y+y<30)', |
| 1761 | | '-evalt', '!(x,y).(x=1 & y:(x+1)..(x+19) => y+y<42)', |
| 1762 | | '-evalt', '!x.(x=100 & x>200 => x>999)', |
| 1763 | | '-evalt', '!x.(x=100 & x>50 => x>99)', |
| 1764 | | '-evalf', '!x.(x=100 & x>50 => x>100)', |
| 1765 | | '-evalt', '!(x,y,z,v).(x=10 & y=20 & z=x+y & v:x..z => v:NATURAL1)', |
| 1766 | | '-evalt', 'f = {1|->2} & !e.(2:dom(f) & e=f(2) => e>100)', |
| 1767 | | '-evalf', 'f = {1|->2} & !e.(1:dom(f) & e=f(1) => e>100)', |
| 1768 | | '-evalf', 'f = {1|->2} & !e.(e=f(1) => e>100)', |
| 1769 | | '-evalt', 'f = {1|->200} & !e.(e=f(1) => e>199)' |
| 1770 | | ],'ensure UNION/INTER can be dealt with by typechecker, + LET introduction works correctly...'). |
| 1771 | | cli_testcase(1105,[private, data_validation,alstom,codespeed],[ |
| 1772 | | '../prob_examples/examples/B/Alstom/sgd_Jun11/vital_gradient_v3/vital_gradient_optimized.mch', |
| 1773 | | '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '35000', '-t'], |
| 1774 | | 'check that trace can be replayed'). |
| 1775 | | cli_testcase(1106, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/PrimitiveRecursiveFunctions.mch', |
| 1776 | | '../prob_examples/public_examples/B/RecursiveFunctions/SumTLA.mch', |
| 1777 | | '../prob_examples/public_examples/B/RecursiveFunctions/TransitiveClosureFunction.mch', |
| 1778 | | '../prob_examples/public_examples/B/RecursiveFunctions/TransitiveClosureFunctionIFTE.mch', |
| 1779 | | '-assertions', '-strict', '-p', 'SYMBOLIC', 'FALSE'], 'Test that other recursive functions work.'). |
| 1780 | | cli_testcase(1107, [ltl,csp_test,refinement], ['../prob_examples/public_examples/CSP/RefusalBasedRefinement/RefusalBasedRefinement_simple.csp', '-ltlassertions', '-strict'],'Check LTL formulas with the \'Av(-)\'-operator from File.'). |
| 1781 | | cli_testcase(1108, [b_test,sigma,card,forall], ['-p', 'CLPFD', 'TRUE', |
| 1782 | | '-evalt', 'bool(!(x,y).(x:1..400000 & y:1..x => x>=y)) /= bool(!(x,y).(x:1..400000 & y:1..x => x>y))', |
| 1783 | | '-evalt', 'bool(!x.(x:POW(1..100) & card(x)>1 => SIGMA(y).(y:x|y)>3)) = bool(!x.(x:POW(1..100) & card(x)>1 => SIGMA(y).(y:x|y)<200))', |
| 1784 | | % we wrap into bool to avoid top-level rewriting of ! |
| 1785 | | '-evalt', '!(x,y).(x:1..400000 & y:1..x => x>=y)', |
| 1786 | | '-evalf', '!(x,y).(x:1..400000 & y:1..x => x>y)', |
| 1787 | | '-evalf', '!x.(x:POW(1..100) & card(x)>1 => SIGMA(y).(y:x|y)>3)', |
| 1788 | | '-evalf', '!x.(x:POW(1..100) & card(x)>1 => SIGMA(y).(y:x|y)<200)', |
| 1789 | | '-strict'], 'Check that forall can now deal with large domains'). |
| 1790 | | cli_testcase(1109, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/BV16_DEFINITION.mch', '-strict', '-init', '-p', 'SYMBOLIC', 'TRUE', '-p', 'CLPFD', 'TRUE', |
| 1791 | | '-evalf', '!(vec).( vec : BIT_VECTOR => size (vec)<=16)', |
| 1792 | | '-evalt', 'bool(!(vec).( vec : BIT_VECTOR => size (vec)<=16))=bool(!(vec).( vec : BIT_VECTOR => size (vec)<=2))' |
| 1793 | | %,'-expcterr', 'eval_string_enum_warning' |
| 1794 | | ], 'Check that ProB now detects this quantification to be false'). % previously it was not detected due to limited enumeration |
| 1795 | | cli_testcase(1110, [ltl], ['../prob_examples/public_examples/B/Ivo/PruningActionsTest2.mch', '-ltlassertions', '-strict'], 'Checking independency of actions by means of LTL Formulas.'). |
| 1796 | | cli_testcase(1111, [tickets,quantified,union],['../prob_examples/public_examples/B/PerformanceTests/UNION_PerfTest.mch', |
| 1797 | | '-p', 'SYMBOLIC', 'TRUE', '-assertions' ,'-p' ,'CLPFD', 'TRUE', |
| 1798 | | '-p', 'TIME_OUT', 1000], 'Ensure symbolic ran closure can be expanded efficiently'). |
| 1799 | | cli_testcase(1112, [tickets,alstom],['../prob_examples/examples/B/Alstom/cbtc/params_cbtc.mch', |
| 1800 | | '-init' ,'-p' ,'IGNORE_PRJ_TYPES', 'TRUE', '-p', 'TIME_OUT', '3500'], 'Ensure symbolic ran closure can be expanded efficiently'). |
| 1801 | | cli_testcase(1113, [b_test,card], ['-p', 'CLPFD', 'TRUE', |
| 1802 | | '-evalt', 'card({x|#y.(y:111..112 & x = {{y*y}})}) = 2', |
| 1803 | | '-evalt', 'card({x|#y.(y:111..112 & x = {{{{{y*y}}}}})}) = 2', |
| 1804 | | '-evalt', 'card({x|#y.(y:POW(BOOL) & card(y)=1 & x = ({(y,TRUE)},TRUE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE))}) =2', |
| 1805 | | '-evalt', '{x|#y.(y:POW(BOOL) & card(y)=1 & x = {(y,TRUE,FALSE,TRUE)})} = {{((({FALSE}|->TRUE)|->FALSE)|->TRUE)},{((({TRUE}|->TRUE)|->FALSE)|->TRUE)}}', |
| 1806 | | '-evalt', '{x,y|#z.(z:{1024,2048,4096} & x=z+z & y={{z*z}})} = {(2048|->{{1048576}}),(4096|->{{4194304}}),(8192|->{{16777216}})}', |
| 1807 | | '-evalt', '{x|#z.(z:1..2**20 & x=z & x+z<100)} = 1..49', |
| 1808 | | '-strict'], 'Check closures with top-level existential quantifiers'). |
| 1809 | | cli_testcase(1114, [tickets,csp_test],['../prob_examples/public_examples/B/Tickets/315/ANN_Neuron.csp', |
| 1810 | | '-t' , '-mc', 200, '-check_complete', '-cc', 26, 42], 'Ensure ticket remains fixed'). |
| 1811 | | cli_testcase(1115, [tickets,eventb_test],['../prob_examples/public_examples/EventBPrologPackages/Ticket_ThmGuard/M2_mch.eventb', |
| 1812 | | '-t' , '-mc', 200, '-check_complete'], 'Ensure theorem in guards work'). |
| 1813 | | cli_testcase(1116, [dot,eventb_test,dot],['../prob_examples/public_examples/EventBPrologPackages/Tests/UnicodeIds_mch.eventb', |
| 1814 | | '-mc', 200, '-nodead', '-check_complete', '-dot', 'state_space', '../prob_examples/public_examples/EventBPrologPackages/Tests/UnicodeIds_spdot.dot'], 'Ensure Unicode characters work in Dot export'). |
| 1815 | | cli_testcase(1117, [tickets],['../prob_examples/public_examples/B/Tickets/Srivastava1/Total_M1.mch', |
| 1816 | | '-t' , '-strict'], 'Ensure that expensive arg in relations check not computed'). |
| 1817 | | cli_testcase(1118, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ClosureTest.eventb','-assertions','-strict','-cc',2,1], 'Check if the closure definition works'). |
| 1818 | | cli_testcase(1119, [csp_test,cspb], ['-expecterr','deadlock','../prob_examples/public_examples/CSPB/Tickets/Bauer/machine.mch','-csp-guide','../prob_examples/public_examples/CSPB/Tickets/Bauer/machine.csp','-mc',1000,'-his','../prob_examples/public_examples/CSPB/Tickets/Bauer/machine_his.txt','-his_option','show_states','-strict'], 'Check if the closure definition works'). |
| 1819 | | cli_testcase(1120, [tickets,csp_test],['../prob_examples/public_examples/CSP/ErrorModels/haskell_csp/TypeErrorInChannelInput.csp', '-mc', 10, '-expcterr', 'check_channel_output_value', '-expcterr', 'general_error_occurred'], 'Checking for raising type error in channel input.'). |
| 1820 | | cli_testcase(1121, [tickets,csp_test],['../prob_examples/public_examples/CSP/other/Ivo/ComplexDataTypes.csp', '-t'], 'Checking complex input/output values for channel.'). |
| 1821 | | |
| 1822 | | cli_testcase(1122, [private,data_validation,exists], ['../prob_examples/examples/B/Systerel/C578/2013/machines_14082013/410_002.mch', '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE'], 'Check that WD issue inside negate exists solved'). |
| 1823 | | cli_testcase(1123, [tickets,exists], ['../prob_examples/public_examples/B/ErrorMachines/IllegalFunCalls/FunCall_Exists_correct.mch', '-init' ,'-assertions'], 'Check that WD issue inside negate exists solved'). |
| 1824 | | cli_testcase(1124, [tickets,wd,exists], ['../prob_examples/public_examples/B/ErrorMachines/IllegalFunCalls/FunCall_Exists_error.mch', '-init' ,'-assertions', '-expcterr', 'well_definedness_error', '-expcterr', check_assertions], 'Check that WD issue inside negate exists solved'). |
| 1825 | | cli_testcase(1125, [b_test,data_validation,infinite,override], ['-p', 'SYMBOLIC', 'TRUE', |
| 1826 | | '-evalt', 'r=INTEGER*{3333} & s= {(1,1)} & ov = r <+ s & r1 = ov(1) & r2 = ov(2) & r3 = ov[1..3] & r3={r1}\\/{r2} & r1000=ov(1000) & r1000>3332'], |
| 1827 | | 'Test that override works symbolically'). |
| 1828 | | cli_testcase(1126, [private,data_validation,infinite,override], ['../prob_examples/examples/B/Systerel/C578/2013/machines_14082013/PB_00611_005.mch', |
| 1829 | | '../prob_examples/examples/B/Systerel/C578/2013/machines_14082013/PS_00611_006.mch', |
| 1830 | | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE'], 'Check symbolic override issues solved'). |
| 1831 | | cli_testcase(1127, [tickets], ['../prob_examples/public_examples/B/Tickets/PROB-306/OperationCallBug.mch', '-strict', '-init', |
| 1832 | | '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check type checker for wrong number of arguments in operation call'). |
| 1833 | | cli_testcase(1128, [tickets], ['../prob_examples/public_examples/B/Tickets/PROB-306/OperationCallBug2.mch', '-strict', '-init', |
| 1834 | | '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check type checker for wrong number of results in operation call'). |
| 1835 | | cli_testcase(1130, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_03092013/error/0050_001.mch', |
| 1836 | | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'TIME_OUT', 3500], 'Check bug remains solved (unification in b_compute_expression2)'). |
| 1837 | | cli_testcase(1131, [private,data_validation],[ |
| 1838 | | '../prob_examples/examples/B/Systerel/C578/2013/machines_06092013/C_02_001.mch', |
| 1839 | | '-p', 'TIME_OUT', '11000', '-p', 'SYMBOLIC', 'TRUE', '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', '0', '-p', 'CLPFD', 'TRUE', '-p', 'MEMO', 'TRUE', '-init', '-assertions', '-p', 'TRACE_INFO', 'FALSE', '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-strict'], |
| 1840 | | 'check memory consumption ok'). |
| 1841 | | cli_testcase(1132,[csp_test], ['../prob_examples/public_examples/CSP/CSPOZ/CurriedNATupleFunNested.csp', '-assertions', '-strict'], 'Nested NA-Tuples.'). |
| 1842 | | |
| 1843 | | cli_testcase(1133, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/basin_olderog_bank.csp', '-mc', 1000, '-cc', 129, 673, '-strict'], ''). |
| 1844 | | cli_testcase(1134, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/AgentErrorsLetWithIn.csp', '-mc', 10, '-nodead', '-expcterr', 'general_error_occurred', '-expcterr', 'singleSetElement', '-strict'], 'Testing raising of singleSetElement error.'). |
| 1845 | | cli_testcase(1135, [csp_test], ['../prob_examples/public_examples/CSP/CSPOZ/CurriedNATupleFunNested.csp', '-assertions', '-t', '-strict'], 'Testing curry functions.'). |
| 1846 | | cli_testcase(1136, [csp_test], ['../prob_examples/public_examples/CSP/evans/KeyNETv2.csp', '-mc', '1000', '-nodead', '-cc', 24, 23, '-assertions', '-strict'], ''). |
| 1847 | | cli_testcase(1137, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/DIV.csp', '-mc', '10', '-cc', 2, 3, '-strict'], 'Testing normalising of DIV |~| DIV.'). |
| 1848 | | cli_testcase(1138, [por], ['../prob_examples/public_examples/B/Ivo/SleepSetsStudyCase.mch', '-mc', 1000, '-noinv', '-expcterr', 'deadlock', '-cc',7,7, '-p', por, 'ample_sets', '-strict'], 'Model checking with partial order reduction.'). |
| 1849 | | cli_testcase(1139, [por,ltl], ['../prob_examples/public_examples/B/Ivo/SleepSetsStudyCase.mch', '-ltlformulat', 'F {x=1 & y=1}', '-cc',10,12, '-p', por, ample_sets,'-strict'], 'LTL Model checking with partial order reduction.'). |
| 1850 | | cli_testcase(1140, [por], ['../prob_examples/public_examples/B/Ivo/SleepSetsStudyCase.mch', '-mc', 1000, '-nodead', '-cc',11,17, '-p', por, 'ample_sets', '-strict'], 'Model checking with partial order reduction (no state space reductions).'). |
| 1851 | | cli_testcase(1141, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/BPEL2B/Model_Machine_4_NoDeadlock_v2.eventb', '-mc', 10000, '-noinv', '-p', por, 'ample_sets', '-expcterr', deadlock,'-strict'], 'Model checking with partial order reduction (deadlock check).'). |
| 1852 | | cli_testcase(1142, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/BPEL2B/Model_Machine_4_NoDeadlock_v3.eventb', '-mc', 10000, '-noinv', '-p', por, 'ample_sets', '-expcterr', deadlock,'-strict'], 'Model checking with partial order reduction (deadlock check).'). |
| 1853 | | cli_testcase(1143, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/BPEL2B/Model_Machine_4_NoDeadlock_v4.eventb', '-mc', 10000, '-noinv', '-p', por, 'ample_sets', '-expcterr', deadlock,'-strict'], 'Model checking with partial order reduction (deadlock check).'). |
| 1854 | | cli_testcase(1144, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/BPEL2B/Model_Machine_4_NoDeadlock_v5.eventb', '-mc', 10000, '-check_complete_operation_coverage', '-p', por, 'ample_sets', '-min_max_coverage', '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/BPEL2B/Model_Machine_4_NoDeadlock_v5_Coverage_POR.txt', '-strict', '-expcterr', 'model_check_incomplete'], 'Model checking with partial order reduction (min...max coverage check).'). |
| 1855 | | cli_testcase(1145, [b_test], ['-p', 'CLPFD', 'TRUE', |
| 1856 | | '-evalt', '{} <: (1..100000000 \\/ {-1})'], |
| 1857 | | 'Check that we do not compute <: if first arg {}'). |
| 1858 | | cli_testcase(1146, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_06092013/T_032_002.mch', |
| 1859 | | '-init' ,'-aa', 0,1,0, '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'TIME_OUT', 11500, '-p', 'CLPFD', 'TRUE', |
| 1860 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check test eq_emtpy_set bug remains solved'). % increased time-out from 7500 |
| 1861 | | cli_testcase(1147, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/em_abs.mch', '-mc', 10000, '-p', por, 'ample_sets', '-min_max_coverage', '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/em_abs_Coverage_POR.txt', '-strict'], 'Model checking with partial order reduction (min...max coverage check). Peterson\'s algorithm'). |
| 1862 | | cli_testcase(1148, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/peterson_R.ref', '-mc', 10000, '-p', por, 'ample_sets', '-check_complete_operation_coverage', '-min_max_coverage', '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/peterson_R_Coverage_POR.txt', '-strict'], 'Model checking with partial order reduction (min...max coverage check). Peterson\'s algorithm'). |
| 1863 | | cli_testcase(1149, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/syspeterson.mch', '-mc', 10000, '-p', por, 'ample_sets', '-expcterr', invariant_violation, '-strict'], 'Model checking with partial order reduction (invariant violation is expected). Peterson\'s algorithm'). |
| 1864 | | cli_testcase(1150, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/BoolOpsTest1.eventb', '-mc', 10, '-nodead', '-check_complete', '-cc', '5', '9'], 'Checking the BoolOps theory'). |
| 1865 | | cli_testcase(1151, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListTest1.eventb', '-mc', 100, '-nodead', '-check_complete', '-cc', '86', '236'], 'Checking the List theory'). |
| 1866 | | cli_testcase(1152, [eventb_test, theories,symmetry_test], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ClosureTest1.eventb', '-p', 'SYMMETRY_MODE', nauty, '-p', 'MAX_OPERATIONS', 100, '-mc', 1000, '-nodead', '-check_complete', '-cc', '756', '4371'], 'Checking the closure theory'). |
| 1867 | | cli_testcase(1153, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/SumProductTest1.eventb', '-mc', 100, '-nodead', '-check_complete', '-cc', '86', '85'], 'Checking the SUM and PRODUCT theory'). |
| 1868 | | cli_testcase(1154, [b_test,union], ['-p', 'CLPFD', 'TRUE', |
| 1869 | | '-evalt', 'x : 1..1000040 \\/ {10000061} & x mod 2 = 0', |
| 1870 | | '-evalt', 'x : 1..10000040 \\/ {10000061} & x mod 2 = 0', |
| 1871 | | '-evalt', 'x : 1..10000040 \\/ {10000061}' |
| 1872 | | % does not work yet: ,'-evalt', ' x : {-33} \/ {0} \/ 1..10000040 \/ {10000061} \/ {-22}' |
| 1873 | | ], 'Check union of AVL with large interval does not expand interval'). |
| 1874 | | cli_testcase(1155, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/BinaryTreeTest1.eventb', '-mc', 100, '-nodead', '-strict', '-expcterr', 'model_check_incomplete'], 'Checking the BinaryTree theory'). |
| 1875 | | cli_testcase(1156, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/SeqTest1.eventb', '-mc', 2000, '-nodead', '-strict'], 'Checking the Seq theory'). |
| 1876 | | cli_testcase(1157, [private,data_validation,infinite,override],[ |
| 1877 | | '../prob_examples/examples/B/Systerel/C578.EML.014/670_002.mch', |
| 1878 | | '-p', 'TIME_OUT', '15000', '-p', 'SYMBOLIC', 'TRUE', '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', '0', '-p', 'CLPFD', 'TRUE', '-p', 'MEMO', 'TRUE', '-init', '-assertions', '-p', 'TRACE_INFO', 'FALSE', '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-strict'], |
| 1879 | | 'check override computed explicitly for A*B*C <+ {...} for reasonable sizes'). % increased TIME_OUT from 11000 |
| 1880 | | cli_testcase(1158, [b_test], ['-p', 'SYMBOLIC', 'TRUE','-p', 'CLPFD', 'TRUE', |
| 1881 | | '-evalt', '95|->93 : dom({x,y,z| x>z & y<z})', |
| 1882 | | '-evalf', '94|->93 : dom({x,y,z| x>z & y<z})' ], |
| 1883 | | 'check symbolic treatment of domain'). |
| 1884 | | cli_testcase(1159, [b_test,card], ['-p', 'CLPFD', 'TRUE', |
| 1885 | | '-evalt', '{S1|S1 <: {"d","f","3","14","play"} & {"d"} /<<: S1 & card(S1):4..5} = {{"14","3","f","play"}}' ], |
| 1886 | | 'simple CBC check from old paper'). |
| 1887 | | cli_testcase(1160, [b_test,infinite], ['-p', 'SYMBOLIC', 'TRUE','-p', 'CLPFD', 'TRUE', |
| 1888 | | '-evalt', 'f = %i.(i:1..100|i*i) & f[NATURAL1] = x & max(x)=10000', |
| 1889 | | '-evalt', 'f = %i.(i:1..100|i*i) & f[{v|v<=20}] = x & max(x)=400', |
| 1890 | | '-evalt', 'f = %i.(i:0..100|i*i) & f[NATURAL1] = x & min(x)=1'], |
| 1891 | | 'test that we can take image of infinite set'). |
| 1892 | | cli_testcase(1161, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/07_001.mch', |
| 1893 | | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'TIME_OUT', 39500, |
| 1894 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check performance'). % increased time-out from 9500 (16th July 2014) |
| 1895 | | cli_testcase(1162, [private,data_validation], [%'../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/02_001_adapted.mch', % moved to test 1376 |
| 1896 | | '../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/30_001_adapted.mch', |
| 1897 | | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', 35000, |
| 1898 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check performance'). |
| 1899 | | cli_testcase(1163, [b_test], ['-p', 'CLPFD', 'TRUE', |
| 1900 | | '-evalf', '0..x <: 1..100000 & x>0', |
| 1901 | | '-evalt', '0..101001 <: 0..x & x <1001000', |
| 1902 | | '-evalt', '1..2**65 <: 1..2**66', |
| 1903 | | '-evalf', '1..2**67 <: 1..2**66', |
| 1904 | | '-evalt', '1..2**65 <: x..2**66 & x:0..10', |
| 1905 | | '-evalf', '1..2**65 <: x..2**66 & x:2..100000', |
| 1906 | | '-evalf', 'x:180..200 & y: 3000..4000 & x+y=z & x..z <: x..w & w<3500 & w<z', |
| 1907 | | '-evalt', 'x:180..200 & y: 3000..4000 & x+y=z & x..z <: x..w & w<3500 & w<=z', |
| 1908 | | |
| 1909 | | '-evalf', '0..x <<: 1..100000 & x>0', |
| 1910 | | '-evalt', '0..101001 <<: 0..x & x <1001000', |
| 1911 | | '-evalt', '1..2**65 <<: 1..2**66', |
| 1912 | | '-evalf', '1..2**66 <<: 1..2**66', |
| 1913 | | '-evalt', '2..2**66 <<: 1..2**66', |
| 1914 | | '-evalt', '-10000..x <<: 1..2 & x>-(2**20)', |
| 1915 | | '-evalf', 'x:180..200 & y: 3000..4000 & x+y=z & x..z <<: x..w & w<3500 & w<=z', |
| 1916 | | |
| 1917 | | '-evalt', '{x|1..x /<: 1..10000 & x<10003} = {10001,10002}', |
| 1918 | | '-evalt', '1000..x /<: 1..y & y..1010 /<: y..1009 & x..1010 /<: x..1009 & y>0', |
| 1919 | | |
| 1920 | | '-evalt', '1..2**65 /<<: 1..2**65', |
| 1921 | | '-evalf', '1..2**65 /<<: 1..2**66', |
| 1922 | | '-evalf', '2..2**66 /<<: 1..2**66', |
| 1923 | | '-evalf', 'x..y /<<: 1001..1002 & x:100..200 & y:0..10', |
| 1924 | | '-evalt', '{x,y|x..y /<<: 1001..1002 & x:100..200 & y:0..100}={(100,100)}', |
| 1925 | | '-evalt', '{x,y|x..y /<<: 1001..1002 & x:1001..1030 & y<1004} = {(1001|->1002),(1001|->1003),(1002|->1003),(1003|->1003)}', |
| 1926 | | '-evalt', '{x,y|x..y /<<: 1001..1002 & x:1001..1030 & y<1005} = {(1001|->1002),(1001|->1003),(1001|->1004),(1002|->1003),(1002|->1004),(1003|->1003),(1003|->1004),(1004|->1004)}', |
| 1927 | | '-evalt', '10..y /<<: 200..x & x>100 & y:1..5', |
| 1928 | | '-evalt', '{x,y|10000..x /<<: 10000..y & y>10000 & y<150000 & x<10005} = {(10001|->10001),(10002|->10001),(10002|->10002),(10003|->10001),(10003|->10002),(10003|->10003),(10004|->10001),(10004|->10002),(10004|->10003),(10004|->10004)}' |
| 1929 | | |
| 1930 | | ], 'Check interval treatment in subset'). |
| 1931 | | cli_testcase(1164, [csp_test], ['../prob_examples/public_examples/CSP/BPMN/intervention.csp', '-mc', '10', '-nodead', '-strict', '-expcterr', 'model_check_incomplete'], 'Testing the CSPM-Tool for parsing very long CSP expressions.'). |
| 1932 | | cli_testcase(1165, [b_test,sequences,strings], ['-p', 'CLPFD', 'TRUE', %'-expcterr', eval_string_enum_warning, |
| 1933 | | '-evalt', 'mdp = 5 * 43 & (yy: mdp + 1 .. ( mdp + 43 ) & yy: dom(memp)) & memp:seq(STRING)', |
| 1934 | | '-evalt', '16: dom(memp) & memp:seq(STRING)', |
| 1935 | | '-evalt', 'memp:seq(STRING) & 16: dom(memp)', |
| 1936 | | '-evalt', 'memp:seq(STRING) & mdp = 5 * 43 & (yy: mdp + 1 .. ( mdp + 43 ) & yy: dom(memp))', |
| 1937 | | '-evalt', '{x} /\\ 0..2000 = {} & x>0' |
| 1938 | | ], 'Check constraint propagation of in domain + in sequence + interval intersection'). |
| 1939 | | cli_testcase(1166, [b_test], ['-p', 'CLPFD', 'TRUE', |
| 1940 | | '-evalt', 'x /\\ 1000..2000 = {1001}', |
| 1941 | | '-evalt', 'x /\\ 1000..2000 = {y}', |
| 1942 | | '-evalt', '1000..2000 /\\ x = {y}', |
| 1943 | | '-evalt', '{x} /\\ 10000..999999 = r & r={y}', |
| 1944 | | '-evalt', '{x} /\\ 10000..999999 = {y}', |
| 1945 | | '-evalt', '10000..x = {y}', |
| 1946 | | '-evalf', '10000..20000000 = {y}', |
| 1947 | | '-evalf', '{x|x>2} = {y}', |
| 1948 | | '-evalt', 'x:0..999999 & y:0..99999 & {x} /\\ 10000..999999 = {y}', |
| 1949 | | '-evalt', '{x} /\\ {y} /= {} & x:1000..2000 & y>=0', |
| 1950 | | '-evalt', '{x} /\\ {y} /= {} & x:1000000..20000000 & y>=0', |
| 1951 | | '-evalt', 'a..b = {x} & x:100..1002', |
| 1952 | | '-evalt', '{a,b,x|a..b = {x} & x:1000..1002} = {((1000|->1000)|->1000),((1001|->1001)|->1001),((1002|->1002)|->1002)}', |
| 1953 | | |
| 1954 | | '-evalt', '{x|x>0} = NATURAL1', |
| 1955 | | '-evalf', '{x|x>0} = NATURAL', |
| 1956 | | '-evalt', '{x|x>0} /= NATURAL', |
| 1957 | | '-evalt', '{x|x<110} /= NATURAL', |
| 1958 | | '-evalt', '{x|x>0} <: NATURAL1', |
| 1959 | | '-evalf', '{x|x>=0} <: NATURAL1', |
| 1960 | | '-evalt', '{x|x>0} <: INTEGER', |
| 1961 | | '-evalt', '{x|x>0} <: {x|x>-1}', |
| 1962 | | '-evalt', '{x|x>0} <: {x|x>0}', |
| 1963 | | '-evalf', '{x|x>0} <: {x|x>1}', |
| 1964 | | '-evalf', 'NATURAL1 <: 0..10000', |
| 1965 | | '-evalt', '{x|x>1} <<: {x|x>0}', |
| 1966 | | '-evalf', '{x|x>0} <<: {x|x>0}', |
| 1967 | | '-evalf', '{x|x>0} <<: NATURAL1', |
| 1968 | | '-evalt', '{x|x>0} <<: NATURAL', |
| 1969 | | '-evalt', '{x|x>0} <<: INTEGER', |
| 1970 | | '-evalf', '{x|x>0} <<: {x|x>2}', |
| 1971 | | '-evalt', '{x|x>0} <<: {x|x>-200}', |
| 1972 | | '-evalf', 'NATURAL1 <<: 0..10000', |
| 1973 | | '-evalf', '{x|x<20000} <<: 0..10000', |
| 1974 | | '-evalf', '{x|x>0} /<: NATURAL1', |
| 1975 | | '-evalt', '{x|x>=0} /<: NATURAL1', |
| 1976 | | '-evalf', '{x|x>0} /<: INTEGER', |
| 1977 | | '-evalf', '{x|x>0} /<: {x|x>-1}', |
| 1978 | | '-evalf', '{x|x>0} /<: {x|x>0}', |
| 1979 | | '-evalt', '{x|x>0} /<: {x|x>1}', |
| 1980 | | '-evalt', 'NATURAL1 /<: 0..10000', |
| 1981 | | '-evalt', '{x|x>=0} /<<: NATURAL', |
| 1982 | | '-evalt', '{x|x>=0} /<<: NATURAL1', |
| 1983 | | '-evalf', '{x|x>=0} /<<: INTEGER', |
| 1984 | | '-evalt', 'NATURAL /<<: NATURAL1', |
| 1985 | | '-evalf', '1..100 /<<: NATURAL1', |
| 1986 | | '-evalt', '0..100 /<<: NATURAL1', |
| 1987 | | '-evalt', '{x|x<20000} /<<: 0..10000', |
| 1988 | | '-evalt', 'NATURAL1 /<<: 0..10000', |
| 1989 | | |
| 1990 | | '-evalf', '0..B <: 1..B & B:1..1000000', |
| 1991 | | '-evalf', '0..x <: 1..1000 & x>0', |
| 1992 | | '-evalf', '0..B <<: 1..B & B:1..1000000', |
| 1993 | | '-evalf', '0..x <<: 1..1000 & x>0', |
| 1994 | | '-evalt', '{x,y} /<<: NATURAL1 & x:2..3 & y:0..5', |
| 1995 | | '-evalf', '{x,y} /<<: NATURAL1 & x:2..3 & y:1..5', |
| 1996 | | '-evalt', '{x,y} <<: NATURAL1 & x:2..3 & y:4..5', |
| 1997 | | '-evalf', '{x,y} <<: NATURAL1 & x:-22..-3 & y:-4..0', |
| 1998 | | '-evalt', '%(x,y).( x:1..4 & y : {-1, 0, 1} | x + y)[INTEGER*INTEGER] /\\ {x|x<=3} = 0..3', |
| 1999 | | '-evalt', '{x,z|x:1..z & x:z..3} = {(1|->1),(2|->2),(3|->3)}' % just a check about interval propagation |
| 2000 | | %, |
| 2001 | | %'-evalt', 'x /\\ y /= {} & x<:1..10000 & y<:10000..20000', |
| 2002 | | %'-evalt', 'x /\\ y /= {} & x = {y|y : 1..n & y mod 2 = 0} & y = {v|v:1..n & v mod 17 = 0} & n = 10000', |
| 2003 | | %'-evalt', '{x|NATURAL1 /\\ 0..x /= {} & x< 20} = 1..19' |
| 2004 | | ], 'Check constraint propagation of intersection with intervals'). |
| 2005 | | cli_testcase(1167, [laws,union], ['../prob_examples/public_examples/EventBPrologPackages/Laws/generalized_union_inter_ctx.eventb', '-mc', 1250, '-nodead', '-p', 'DEFAULT_SETSIZE', 3, '-p', 'MAX_INITIALISATIONS', 100, '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-cbc_assertions'], 'Check laws about generalized union/inter'). |
| 2006 | | cli_testcase(1168, [b_test,smt_test], ['-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', |
| 2007 | | '-evalt', '{y,f|f = %x.(x:1..10|x+y) & f(5)=1005} = {(1000|->[1001,1002,1003,1004,1005,1006,1007,1008,1009,1010])}' |
| 2008 | | ], 'Check constraint propagation for partially known functions'). |
| 2009 | | cli_testcase(1169, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', |
| 2010 | | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions', |
| 2011 | | '../prob_examples/public_examples/B/CBC/RULE_r967_1.mch', '-expcterr', 'cbc_assertions' |
| 2012 | | ], 'Check ProB finds counter example for rule'). |
| 2013 | | cli_testcase(1170, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', |
| 2014 | | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2015 | | '-expcterr', 'cbc_assertions_enumeration_warning', |
| 2016 | | '../prob_examples/public_examples/B/CBC/RULE_InSetLeavesXY_32_1.mch', |
| 2017 | | '../prob_examples/public_examples/B/CBC/RULE_r967_preuve_backward.mch' |
| 2018 | | ], 'Check ProB finds counter example for rule'). |
| 2019 | | cli_testcase(1171, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', |
| 2020 | | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2021 | | '-expcterr', 'cbc_assertions_enumeration_warning', |
| 2022 | | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_ShouldGenerateEnumWarning2.mch' |
| 2023 | | ], 'Check ProB finds no counter example for rule and no proof'). |
| 2024 | | cli_testcase(1172, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', |
| 2025 | | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2026 | | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_NoEnumWarning1.mch' |
| 2027 | | ], 'Check ProB finds no counter example for rule and no proof'). |
| 2028 | | |
| 2029 | | cli_testcase(1173, [b_test,cbc], ['-p', 'CLPFD', 'FALSE', |
| 2030 | | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2031 | | '-expcterr', 'cbc_assertions_enumeration_warning', |
| 2032 | | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_ShouldGenerateEnumWarning1.mch' |
| 2033 | | ], 'Check ProB finds no counter example for rule and no proof'). |
| 2034 | | cli_testcase(1174, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', |
| 2035 | | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2036 | | '-expcterr', 'cbc_assertions_enumeration_warning', |
| 2037 | | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_ShouldGenerateEnumWarning1.mch' |
| 2038 | | ], 'Check ProB finds no counter example for rule and no proof'). |
| 2039 | | cli_testcase(1175, [b_test,card], ['-p', 'CLPFD', 'TRUE', |
| 2040 | | '-evalf', 'n: INTEGER & {n} = r & r={n1} & (n1/=n)', |
| 2041 | | '-evalf', 'n: POW(INTEGER) & {n} = r & r={n1} & (n1/=n)', |
| 2042 | | '-evalf', 'n: BOOL & {n} = r & r={n1} & (n1/=n)', |
| 2043 | | '-evalf', 'n>0 & {n} ={n1} & (n1/=n)', |
| 2044 | | '-evalf', 'f:POW(NATURAL) & f2 = f \\/ {p2} & p1:f & p1/:f2 & p1/=p2', |
| 2045 | | '-evalf', 'f:POW(NATURAL) & f2 = f \\/ {p2} & p1:f & p1/:f2', |
| 2046 | | '-evalf', 'p1:dom(f) & f2 = {p2} <<| f & p1 /: dom(f2) & p1/=p2 & f:NATURAL <->NATURAL', |
| 2047 | | '-evalt', 'p1:dom(f) & f2 = {p2} <<| f & p1 /: dom(f2) & p1=p2 & f:NATURAL <->NATURAL', |
| 2048 | | '-evalf', 'x /= y & s={x,y,z} & x/=z & y/=z & x:NATURAL1 & card(s)<3', |
| 2049 | | '-evalf', 'x:s & y:s & z:s & x /= y & x/=z & y/=z & x:NATURAL1 & card(s)<3', |
| 2050 | | '-evalf', 'x /= y & x/=z & y/=z & s={x,y,z} & card(s)<3 & s<:STRING', |
| 2051 | | '-evalf', 'f:NATURAL +-> INTEGER & f2 = f <+ {p2|->1} & p1:dom(f) & p1/:dom(f2) & p1/=p2', |
| 2052 | | '-evalt', 'x /= "a" & (x /= "a" => y>1000000) & (y>1000000 => x = "b") & y<2000000', |
| 2053 | | '-evalt', 'x /= "a" & (x /= "a" => y>100000 & y<200000) & (y>100000 => x = "b")', |
| 2054 | | '-evalt', 'x /= "a" & ("a" /= x => y>100000 & y<200000) & (y>100000 => x = "b")', |
| 2055 | | '-evalt', 'x /= 33 & (x /= 33 => y>1000000) & (y>1000000 => x = 2133) & y<2000000', |
| 2056 | | '-evalt', 'x /= 1 & (1 /= x => y>100000 & y<200000) & (y>100000 => x = 2)', |
| 2057 | | '-evalf', 'x /= 1 & (1 /= x => y>100000 & y<200000) & (y>100000 => x = 1)' |
| 2058 | | ], 'Check that a few inconsistencies can be detected without enumeration'). |
| 2059 | | cli_testcase(1176, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/em_abs.mch', '-mc', 10000, '-noinv', '-p', por, 'ample_sets', '-strict'], 'Model checking with partial order reduction (Without Coverage). Peterson\'s algorithm'). |
| 2060 | | cli_testcase(1177, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/em_abs.mch', '-mc', 10000, '-check_complete_operation_coverage', '-p', por, 'ample_sets', '-strict'], 'Model checking with partial order reduction (Operations Coverage Check). Peterson\'s algorithm'). |
| 2061 | | cli_testcase(1178, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/peterson_R.ref', '-mc', 10000, '-check_complete_operation_coverage', '-p', por, 'ample_sets', '-strict'], 'Model checking with partial order reduction (min...max coverage check). Peterson\'s algorithm'). |
| 2062 | | cli_testcase(1179, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/syspeterson.mch', '-noinv', '-mc', 10000, '-p', por, 'ample_sets', '-strict'], 'Model checking with partial order reduction (min...max coverage check). Peterson\'s algorithm'). |
| 2063 | | cli_testcase(1180, [b_test,card], ['-p', 'CLPFD', 'TRUE', |
| 2064 | | '-evalt', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..4} = 1..4', |
| 2065 | | '-evalt', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..40} = 1..40', |
| 2066 | | '-evalf', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..40} = 1..4', |
| 2067 | | '-evalf', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..40} /= 1..40', |
| 2068 | | '-evalt', '{x|#y.(y>x) & x:1..100} /= {}', |
| 2069 | | '-evalf', '{x|#y.(y>x) & x:1..100} = {}', |
| 2070 | | '-evalt', 'card({x|#y.(y>x) & x:1..100}) = 100', |
| 2071 | | '-evalt', 'card({x,y| x>=60000 & x<=64999 & x mod 2 =1 & y=x+x}) = 2500', |
| 2072 | | '-evalt', 'card({x,y| x>=60000 & x<=64999 & x mod 2 =1 & y=x+x}) = 2500', |
| 2073 | | '-evalt', 'x = (1 .. 100000) - {4} & card(x) = 99999', |
| 2074 | | '-evalt', '{x| x:1..100 & {y|y:x..x+10} = {z|z>=x & z<x+11 & #v.(v>x)}} = 1..100', |
| 2075 | | '-evalt', '[0,0,0,0,0,0,0,0,0,1]:{x|x:seq(0..1) & 1:ran(x)}', |
| 2076 | | '-evalf', '[0,0,0,0,0,0,0,0,0,0]:{x|x:seq(0..1) & 1:ran(x)}', |
| 2077 | | '-evalt', '[0,0,1,1,0,1,0]:{x|x:seq(0..1) & card(x)>5}', |
| 2078 | | '-evalt', '{x| x:1..10 or x:{2**20,2**21} or x = 2**27} = {1,2,3,4,5,6,7,8,9,10,1048576,2097152,134217728}' |
| 2079 | | ],'Check enum warnings properly dealt with'). |
| 2080 | | cli_testcase(1181, [b_test,card,sequences], ['-p', 'CLPFD', 'TRUE', '-expcterr', 'eval_string', |
| 2081 | | '-evalf', '{x|x:seq(0..1) & card(x)>5 & card(x)-50 /= 50} /= {x|x:seq(0..1) & card(x)>5 & card(x) /= 20}' |
| 2082 | | ],'Check enum warnings generated'). |
| 2083 | | cli_testcase(1182, [tickets], ['../prob_examples/public_examples/B/Tickets/Hansen6/PerfectNumber_v2.mch', '-t'], 'Check proper working of ProB for perfect number set comprehension'). |
| 2084 | | cli_testcase(1183, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/POWER2.mch', '-init', '-strict', '-aa', '18', '0', '1'], 'Variation of test 274; check that enum warning generated'). |
| 2085 | | cli_testcase(1184, [eventb_test,cbc], ['../prob_examples/examples/EventBPrologPackages/Advance_WP2/SubstationMeter_2703_2013.eventb', '-strict', '-mc', 1000, '-p', 'CLPFD', 'TRUE', '-expcterr', virtual_time_out, '-expcterr', 'model_check_incomplete'], 'Test multi-level animation (like 1052 but without finite restriction on events).'). |
| 2086 | | cli_testcase(1185, [laws], ['../prob_examples/public_examples/EventBPrologPackages/Laws/LawsEventBSpecific.eventb', '-t', '-mc', '1000', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'same as 290 (but no virtual time-out with CLPFD)'). |
| 2087 | | cli_testcase(1186, [laws], ['../prob_examples/public_examples/EventBPrologPackages/Laws/finiteTest_ctx.eventb', |
| 2088 | | '-mc', '1000', '-p', 'MAX_INITIALISATIONS', 30, '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'TRUE', '-cbc_assertions', '-assertions', '-p', 'PROOF_INFO', 'FALSE'], 'some checks with the finite operator'). |
| 2089 | | cli_testcase(1187, [b_test,sequences,card], ['-evalt', 'x:seq({1}) & 55:dom(x)', '-evalf', 'x:seq({1}) & 55:dom(x) & card(x)=10', '-evalt', |
| 2090 | | 'x:seq({1}) & 5:dom(x) & card(x)>6', '-p', 'DISPROVER_MODE', 'TRUE', % required to enable special card treatment |
| 2091 | | '-p', 'CLPFD', 'FALSE', '-strict' |
| 2092 | | %, '-expcterr', eval_string_enum_warning |
| 2093 | | ], 'Ensure proper enumeration of sequences (CLPFD=FALSE).'). |
| 2094 | | cli_testcase(1188, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/Argv.mch', '-mc', '1000', '-nodead', '-strict', '-argv', 'one two three', '-cc', 5, 12 ], 'check the ARGV external function'). |
| 2095 | | cli_testcase(1189, [b_test,tickets,closure1], ['../prob_examples/public_examples/B/Tickets/Hansen7/ClosureTest2.mch', '-init', '-properties'], 'Check closure1 enumeration issue resolved'). |
| 2096 | | cli_testcase(1190, [b_test], ['../prob_examples/public_examples/B/Implementations/ReverseArray.mch', '-init', '-mc', 1000, '-p', 'MAX_INITIALISATIONS', 100 ], 'Check simple example with WHILE loop'). |
| 2097 | | cli_testcase(1191, [time_out_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/DTP_k2_n35_c175_s1.mch', '-strict', '-init', '-expcterr', 'setup_constants_fails'], 'Copy of 396 using CLPFD. This time, no time_out occurs.'). |
| 2098 | | cli_testcase(1192, [eventb_test,records], ['../prob_examples/public_examples/EventBPrologPackages/Records/SampleThreeRecordMachine_mch.eventb', '-t', '-strict', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-t', '-cc', 4, 6], 'Check that record detection works with nested records'). |
| 2099 | | cli_testcase(1193, [eventb_test,records], ['../prob_examples/public_examples/EventBPrologPackages/Records/IntBoolMachine_mch.eventb', '-t', '-strict', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-t', '-expcterr', virtual_time_out, |
| 2100 | | '-evalt', 'make_BIBIRec((TRUE,55),(FALSE,66)) = ((TRUE,55),(FALSE,66))'], 'Check that record detection works with nested records'). |
| 2101 | | cli_testcase(1194, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon1_prob_simplified_v3.eventb', |
| 2102 | | % '../prob_examples/public_examples/EventBPrologPackages/platoon/platoon1_prob_simplified.eventb', % fixed power_of WD error |
| 2103 | | '-t', '-strict', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAX_OPERATIONS', 20, '-p', 'MAX_INITIALISATIONS', 40, |
| 2104 | | '-expcterr', virtual_time_out, |
| 2105 | | '-evalt', 'sqrt(0)=0', |
| 2106 | | '-evalt', 'sqrt(10)=3', |
| 2107 | | '-evalt', 'sqrt(10000)=100', |
| 2108 | | '-evalt', 'dist(make(10|->20) |-> make(10|->20)) = 0', |
| 2109 | | '-evalt', 'dist(make(10|->20) |-> make(10|->30)) = 10', |
| 2110 | | '-evalt', 'dist(make(10|->20) |-> make(0|->20)) = 10', % WD error with platoon1_prob_simplified.eventb |
| 2111 | | '-evalt', 'dist(make(0|->20) |-> make(10|->20)) = 10', |
| 2112 | | '-evalt', 'dist(make(10|->20) |-> make(20|->20)) = 10', |
| 2113 | | '-evalt', 'dist(make(10|->10) |-> make(20|->20)) = 14', |
| 2114 | | '-evalt', 'dist(make(10|->10) |-> make(10010|->10010)) = 14142', |
| 2115 | | '-evalt', 'xcoord(make(1024,2048)) = 1024', |
| 2116 | | '-evalt', 'ycoord(make(1024,2048)) = 2048' |
| 2117 | | ], 'Check that record detection + symbolic treatment work'). |
| 2118 | | cli_testcase(1195, [performance_tests,b_test,codespeed], ['../prob_examples/public_examples/B/Mathematical/GraphIso/CheckLargeGraphIsomorphismAsConstants_v2.mch', |
| 2119 | | '-t', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '5000'], |
| 2120 | | 'Test constraint solving for larger graph'). |
| 2121 | | cli_testcase(1196, [b_test], ['../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.mch', '-t', '-strict', |
| 2122 | | '-csvhist', 'card(session) |-> card(session_response) |-> card(user_hotel_bookings) |-> user_rental_bookings', |
| 2123 | | '../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.csv'], |
| 2124 | | 'Test evaluating expression over history and saving to CSV file'). |
| 2125 | | cli_testcase(1197, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Tests/PartitionTest_ctx.eventb', '-init', '-assertions', '-strict'], 'Test partition border cases'). |
| 2126 | | cli_testcase(1198, [b_test,infinite,total_function], [ |
| 2127 | | '-evalt', '(NATURAL * NATURAL)* {1024} : (NATURAL*NATURAL) --> NATURAL', |
| 2128 | | '-evalt', 'NATURAL * {0} : NATURAL --> NATURAL', |
| 2129 | | '-evalt', 'NATURAL * {0} : NATURAL +-> NATURAL', |
| 2130 | | '-evalt', 'NATURAL1 * {0} : NATURAL +-> NATURAL', |
| 2131 | | '-evalt', 'NATURAL1 * {0} : INTEGER +-> NATURAL', |
| 2132 | | '-evalf', 'NATURAL * {0} : NATURAL --> NATURAL1', |
| 2133 | | '-evalf', 'NATURAL * {0} : NATURAL +-> NATURAL1', |
| 2134 | | '-evalf', 'NATURAL1 * {0} : NATURAL --> NATURAL', |
| 2135 | | '-evalf', 'NATURAL * {0} : NATURAL1 --> NATURAL' |
| 2136 | | ], 'Test cartesian product with singleton set recognised as total function'). |
| 2137 | | cli_testcase(1199, [eventb_test,tickets,infinite, theories], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_Symbolic/C_Cart_ctx.eventb', |
| 2138 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_Symbolic/C_bijNAT_ctx.eventb', |
| 2139 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_Symbolic/C_symbolic_ctx.eventb', |
| 2140 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/ConstraintSolving_Demo_ctx.eventb', |
| 2141 | | '-init','-assertions', '-strict'], 'Checking that various infinite functions can be defined and checked'). |
| 2142 | | cli_testcase(1200, [b_test], ['../prob_examples/public_examples/B/Mathematical/MaxClique.mch', |
| 2143 | | '-init','-assertions', '-strict'], 'Checking constraint solving capabilities'). |
| 2144 | | cli_testcase(1201, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/SeqTest2_ctx.eventb', '-init', '-assertions', '-strict'], 'Test Theory Plugin support'). |
| 2145 | | cli_testcase(1202, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_ModularExp/ExpModFunctionCtxt_ctx.eventb', |
| 2146 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_ModularExp/ModularExponenation.mch', '-init', '-assertions', '-strict'], 'Test Recursive Function support'). |
| 2147 | | cli_testcase(1203, [b_test,queens], ['../prob_examples/public_examples/B/Puzzles/PeaceableQueens/JustQueens_8_8.mch', '-init', '-strict'], 'A constraint solving example'). |
| 2148 | | cli_testcase(1204, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/NaturalTest.eventb', '-mc', 10, '-nodead', '-cc', 8, 7, '-strict'], 'Checking the operators of the inductive theory of natural numbers'). |
| 2149 | | cli_testcase(1205, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/RecOpTypeTest.eventb', '-assertions', '-strict'], 'Checking a reference to a theory\'s type parameter in a recursive operator definition'). |
| 2150 | | cli_testcase(1206, [tickets], ['../prob_examples/public_examples/B/Tickets/PROB-320/Hierarchical_temp.mch', '-t', |
| 2151 | | '-mc', 1000, '-noinv', '-bf', |
| 2152 | | '-expcterr', 'precondition_error'], 'Check precondition error raised and error message generation works. (Ticket PROB-320)'). |
| 2153 | | cli_testcase(1207, [tickets], ['-p', 'TIME_OUT', 7000, '-p', 'CLPFD', 'TRUE', |
| 2154 | | '-evalf', '61*(x*x)+1 = y*y & x:1..1500000 & y>0'], 'Check that no instantiation error or other problem occurs'). |
| 2155 | | cli_testcase(1208, [typechecker_test,unit], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/including.mch', '-strict'], 'Typechecker test when including other machines'). |
| 2156 | | cli_testcase(1209, [typechecker_test,unit], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/definitions.mch', '-strict'], 'Typechecker test when using definitions'). |
| 2157 | | cli_testcase(1210, [typechecker_test,unit,parser,refinement], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/refi.ref', '-strict'], 'Typechecker test when using refinement'). |
| 2158 | | cli_testcase(1211, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/Ivo/ListPattern.csp', '-t', '-strict'], 'Testing compiling of list patterns given as function parameters.'). |
| 2159 | | cli_testcase(1212, [csp_test], ['../prob_examples/public_examples/CSP/ucsexamples/chapter15/cache.csp', '-assertions', '-strict'], 'Testing compiling of list patterns given as function parameters.'). |
| 2160 | | cli_testcase(1213, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/EulerWay.mch', '-init'], 'Test that this puzzle can be solved quickly; used to take very long; solved in svn commit r12434'). |
| 2161 | | cli_testcase(1214, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/OverridingBuiltinFunctions.csp', '-assertions', '-strict'], 'Testing if we can override built-in functions.'). |
| 2162 | | cli_testcase(1215, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/OverridingBuiltinFunctionsLets.csp', '-assertions', '-strict'], 'Testing if we can override built-in functions.'). |
| 2163 | | cli_testcase(1216, [b_test,cbc,union,card], [ |
| 2164 | | '-evalt', 'z:10001..10002 & {x,y} \\/ t = {z}', |
| 2165 | | '-evalt', 'z:10001..10002 & {x} \\/ {y} = {z}', |
| 2166 | | '-evalf', 'z:10001..10002 & {x,y} \\/ t = {z} & y<10001', |
| 2167 | | '-evalf', 'z:10001..10002 & {x,y} \\/ t = {z} & t<:9000..10000 & t/= {}', |
| 2168 | | '-evalf', 'z:10001..10002 & {x,y} \\/ t = {z} & t:POW1(9000..10000)', |
| 2169 | | '-evalt', 'z:10001..10002 & {x} \\/ {y,v} = {z}', |
| 2170 | | '-evalt', 'z:10001..10002 & {x,v} \\/ {y} = {z}', |
| 2171 | | '-evalt', 'z:10001..10002 & {x,v} \\/ t = {z} & {a} \\/ {b} = t', |
| 2172 | | '-evalt', 'union({{x},{y},{z}}) = {3333}', % works by ast_cleanup translating to union |
| 2173 | | '-evalt', 'union({{x}}) = {3333}', % ditto |
| 2174 | | '-evalt', 'union({{x},{y},{z},{w}}) = {v} & v:200001..300001 & w:300001..400001', % ditto |
| 2175 | | '-evalt', 'union({S,V,W}) = 1..10 & S/\\V = {} & S/\\W ={} & V /\\ W = {} & card(S) < card(V) & card(V) < card(W)' % ditto + partition detection |
| 2176 | | % TO DO: z:10001..10002 & {x,w} \\/ {y,v} = {z} |
| 2177 | | ], 'Testing propagation in union from result to arguments.'). |
| 2178 | | cli_testcase(1217, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Disprover/ProofTests/TestPrj_Nat_ctx.eventb', '-cbc_assertions', |
| 2179 | | '-p', 'PROOF_INFO', 'FALSE', '-strict'], 'Testing if prj1|->prj2 theorems can be proven'). |
| 2180 | | cli_testcase(1218, [b_test,sequences], [ |
| 2181 | | '-evalf', 'p:perm(5..20) & p(10)=21' |
| 2182 | | ], 'Testing propagation for permutation sequence.'). |
| 2183 | | cli_testcase(1219, [puzzles_test,queens], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/NQueens40_perm.mch', '-init', '-properties', '-strict'], ''). |
| 2184 | | cli_testcase(1220, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/AssertionsLet.csp', '-csp_assertion', 'c?x -> c.x -> STOP [T= c?x:{1..3} -> c.x -> STOP', '-assertions', '-cc', 38, 41, '-strict'], ''). |
| 2185 | | cli_testcase(1221, [ltl], ['../prob_examples/public_examples/CSP/Tickets/PROB-319/toy3.csp', '-ltllimit', 10000, '-ltlfile','../prob_examples/public_examples/CSP/Tickets/PROB-319/toyprop3c.ltl','-expcterr', ltl_counterexample, '-strict'], 'Regression test for ticket PROB-319: Unable to find a counter-example in the SCC'). |
| 2186 | | cli_testcase(1222, [private,cbc], ['-p', 'CLPFD', 'TRUE', '../prob_examples/examples/B/ClearSy/alloc_large.mch', '-init', '-p', 'TIME_OUT', '18500'], |
| 2187 | | 'Test that ProB finds isomorphism for large graph'). % increased time out from 9500 |
| 2188 | | cli_testcase(1223, [b_test,card], [ |
| 2189 | | '-evalf', 'z:11..10002 & z2:10003..520004 & z3: -1000..10 & z4:-22222..-2000 &a: {z,z2} & a:{z3,z4}', |
| 2190 | | '-evalt', 'z:11..10002 & z2:10003..520004 & z3: -1000..11 & z4:-22222..-2000 &a: {z2,z} & a:{z3,z4}', |
| 2191 | | '-evalf', 'x <: 1..7 & y <: 1..7 & (x<:y <=> y<:x) & x/\\y = {3} & x\\/y = 1..7 & card(x) = card(y)+1', |
| 2192 | | '-evalt', 'y:1..1000001 & f:100001..100005 --> 1..9000 & x:dom(f) & x:2..100003 & (x>5000 => y:100001..100002)', |
| 2193 | | '-evalf', 'f: 1..10 --> 100..200 & x:dom(f~) & x>200', |
| 2194 | | '-evalf', 'f: 10..200 --> 1..200000 & x|->y : f & (x>200 or x<10)', |
| 2195 | | '-evalf', 'f: (BOOL*BOOL) --> 100..200000 & b|->x : f & (x>200000 or x<100)', |
| 2196 | | '-evalf', 'f: 10001..10110 --> NATURAL & !x.(x:dom(f) => f(x):dom(f)) & g:20010..20020 --> BOOL & !x.(x:dom(f) => f(x):dom(g))', |
| 2197 | | '-evalt', 'f : 1001..2001 --> 1900..3333 & x|->y : f & y<x', |
| 2198 | | '-evalf', 'f : 1001..2001 --> 1900..3333 & x|->y : f & y+101<x', |
| 2199 | | '-evalf', 'x:1..400 & y:1..400 & f: 2..390 --> 391..399 & x|->y :f & y|->x :f', |
| 2200 | | '-evalt', 'r: 1001..1005 <-> 1000..1099 & x|->y : r & v|->w : r & x+y = v+w+103 & card(r) = 3', |
| 2201 | | '-evalt', 'card({r,x,y,v,w|r: 1001..1005 <-> 1000..1099 & x|->y : r & v|->w : r & x+y = v+w+103 & card(r) = 2}) = 1', |
| 2202 | | '-evalt', '{r,x,y,v,w|r: 1001..1005 <-> 1000..1099 & x|->y : r & v|->w : r & x+y = v+w+103 & card(r) = 2} = {(((({(1001|->1000),(1005|->1099)}|->1005)|->1099)|->1001)|->1000)}', |
| 2203 | | '-evalt', 'card({r,x,y,v,w|r: 1001..1005 <-> 1000..1099 & x|->y : r & v|->w : r & x+y = v+w+103 & card(r) = 3}) = 498', |
| 2204 | | '-evalt', 'card({r,x,y,v,w|r: 1001..1005 +-> 1000..1099 & x|->y : r & v|->w : r & x+y = v+w+103 & card(r) = 3}) = 300', |
| 2205 | | '-evalt', 's = {(1,rec(a:1)), (2,rec(a:2))} & (1,rec(a:x)) : s', |
| 2206 | | '-evalt', 'a = {rec(x:1,y:22),rec(x:2,y:44)} & {v,w|rec(x:v,y:w):a} = {(1,22),(2,44)}', |
| 2207 | | '-evalt', 'a = {rec(x:(1,33),y:22),rec(x:(2,34),y:44),rec(x:(3,34),y:45)} & {v1,w|rec(x:(v1,34),y:w):a} = {(2|->44),(3|->45)}', |
| 2208 | | '-evalf', 'a = {rec(x:(1,33),y:22),rec(x:(2,34),y:44),rec(x:(3,34),y:45)} & rec(x:(v1,v2),y:w):a & v1+v2+w <56', |
| 2209 | | '-evalt', 'a = {rec(x:(1,33),y:22),rec(x:(2,34),y:44),rec(x:(3,34),y:45)} & rec(x:(v1,v2),y:w):a & v1+v2+w <57', |
| 2210 | | '-evalt', 'ran({vv,ww,x|x=rec(x:ww,y:vv) & vv:1..n & ww:33..34})=r1 & n=50 & rec(x:a,y:b):r1 & rec(x:a+1,y:b):r1 & b>a', |
| 2211 | | '-evalt', 'a = {rec(x:(1,33),y:22,z:TRUE),rec(x:(2,34),y:44,z:TRUE),rec(x:(3,34),y:45,z:TRUE)} & rec(x:(v1,v2),y:w,z:bb):a & v1+v2+w <57', |
| 2212 | | '-evalf', 'a = {rec(x:(1,33),y:22,z:FALSE),rec(x:(2,34),y:44,z:TRUE),rec(x:(3,34),y:45,z:TRUE)} & rec(x:(v1,v2),y:w,z:TRUE):a & v1+v2+w <57' |
| 2213 | | ], 'Testing propagation for membership.'). |
| 2214 | | cli_testcase(1224, [typechecker_test,tickets], ['-init','../prob_examples/public_examples/EventBPrologPackages/Tickets/PROB-323/PROB-323.eventb','-strict'], 'This machine should not throw a type error.'). |
| 2215 | | cli_testcase(1225, [eventb_test,laws, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListLaws_ctx.eventb', |
| 2216 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/PairLaws_ctx.eventb', |
| 2217 | | '-assertions','-strict'], 'Various checks for sets involving freetypes (Lists Theory)'). |
| 2218 | | cli_testcase(1226, [b_test,finite], [ |
| 2219 | | '-evalu', 's=({x|x mod 2 = 0 & x>200}) & s:FIN(s)' |
| 2220 | | , '-expcterr', eval_string_enum_warning |
| 2221 | | ], 'Check that finite warning produced'). |
| 2222 | | cli_testcase(1227, [eventb_test,laws, proz,theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListLawsMC_mch.eventb','-mc',500, '-bf', '-strict', |
| 2223 | | '-expcterr', 'virtual_time_out', '-expcterr', 'model_check_incomplete'], 'Various checks for sets involving freetypes (Lists Theory)'). |
| 2224 | | cli_testcase(1228, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/MammarLaleau_Failures_ReadDoors_inv8_selected.mch', '-cbc_assertions', |
| 2225 | | '-p', 'PROOF_INFO', 'FALSE', '-strict'], 'Check no enum warning occurs when using bool with integer inside'). |
| 2226 | | cli_testcase(1229, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/PROB-322/ExpressionTest.eventb','-init','-strict'], 'Checking usage of typeof-Operator'). |
| 2227 | | cli_testcase(1230, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/MammarLaleau_Cylinders_LockGearCylinder_inv4_selected.mch', |
| 2228 | | %'../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/MammarLaleau_Doors_Make_GearExtended_inv2_all.mch', |
| 2229 | | '-cbc_assertions', |
| 2230 | | '-p', 'PROOF_INFO', 'FALSE' ,'-p', 'DISPROVER_MODE', 'TRUE', '-strict'], 'Check no time-out occurs'). |
| 2231 | | cli_testcase(1231, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/TestingFairness.mch', '-ltlassertions', '-strict'], 'Test fairness implementation.'). |
| 2232 | | cli_testcase(1232, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/MutualExclusion.mch', '-ltlassertions', '-strict'], 'Test fairness implementation.'). |
| 2233 | | cli_testcase(1233, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/WeakFairnessTest.mch', '-ltlassertions', '-strict'], 'Test fairness implementation.'). |
| 2234 | | cli_testcase(1234, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/phils.csp', '-ltlassertions', '-strict'], 'Test fairness implementation.'). |
| 2235 | | cli_testcase(1235, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/FairnessUnderscoreArgs.csp', '-ltlassertions', '-strict'], 'Test fairness.'). |
| 2236 | | cli_testcase(1236, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs.mch', '-ltlformula', 'SF(C) => GF {addr=4 or addr =5}', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2237 | | cli_testcase(1237, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs.mch', '-ltlformula', 'SF(E) => GF {addr=4 or addr =5}', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2238 | | cli_testcase(1238, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs.mch', '-ltlformula', 'SF(D) => GF {addr=4 or addr =5}', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2239 | | cli_testcase(1239, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs.mch', '-ltlformula', 'SF(C) & SF(E) => GF {addr=4 or addr =5}', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2240 | | cli_testcase(1240, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs.mch', '-ltlformula', '(SF(C) & SF(E)) or (SF(F) & SF(E)) => GF {addr = 4 or addr = 5}', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2241 | | cli_testcase(1241, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs.mch', '-ltlformula', '(SF(C) & SF(E)) or (SF(F) & SF(E)) => GF {addr = 4 or addr = 5}', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2242 | | cli_testcase(1242, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/rabp_scc_issue.csp', '-ltlassertions', '-strict'], 'Test fairness.'). |
| 2243 | | cli_testcase(1243, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/rabp_scc_issue.csp', '-ltlformula', 'SEF => G ([left.0] => F [right.0])', '-strict'], 'Test general fairness.'). |
| 2244 | | cli_testcase(1244, [b_test, ltl], ['../prob_examples/public_examples/B/LTL/Fairness/TestingFairness.mch', |
| 2245 | | '-ltlformulat', true, '-ltlformulat', 'G{1=1}', |
| 2246 | | '-ctlformulat', 'AG{1=1}', '-ctlformulaf', 'EF{1=2}', |
| 2247 | | %'-ltlformulaf', false, % does not work ! |
| 2248 | | '-ltlformulaf', 'G{1=2}', '-strict'], 'Testing the trivial LTL formula true + other trivial ones.'). |
| 2249 | | cli_testcase(1245, [b_test, ltl], ['../prob_examples/public_examples/B/LTL/Fairness/TestingFairness.mch', '-ltlformulat', false, '-expcterr', 'ltl', '-strict'], 'Testing the trivial LTL formula false.'). |
| 2250 | | cli_testcase(1246, [cbc], [ |
| 2251 | | '-evalf', 'x/0 = 1 & x:1..20', |
| 2252 | | '-evalf', 'x:-2..2 & 10/x =1', |
| 2253 | | '-evalt', 'x:-2..2 & 10/x = 5', |
| 2254 | | '-p', 'DISPROVER_MODE', 'TRUE'], 'Testing no WD error generated in disprover mode.'). |
| 2255 | | cli_testcase(1247, [cbc], [ |
| 2256 | | '-evalt', 'i>200 & (i mod 37 = 7)', |
| 2257 | | '-evalt', 'i>200 & (i mod 37 = 1)', |
| 2258 | | '-evalt', 'i>20 & (i mod 2 = 0)', |
| 2259 | | '-evalf', 'i>200 & (i mod 37 = 7) & i < 229', |
| 2260 | | '-evalt', '{i|i>200 & (i mod 50 = 10) & i<1000} = {210,260,310,360,410,460,510,560,610,660,710,760,810,860,910,960}', |
| 2261 | | '-evalt', '{i|i>200 & (i mod 50 = 10) & i<1000 & i mod 100 /= 10} = {260,360,460,560,660,760,860,960}', |
| 2262 | | '-evalt', 'x > 0 & x mod 30 =0 & x mod 19 = 0', |
| 2263 | | '-evalt', 'x > 0 & x mod 50 =0 & x mod 61 = 0 & x mod 23 = 0', |
| 2264 | | '-evalf', 'x > 0 & x mod 50 =0 & x mod 61 = 0 & x mod 23 = 0 & x<70150' |
| 2265 | | ], 'Testing improved constraint propagation for modulo.'). |
| 2266 | | cli_testcase(1248, [tickets], ['../prob_examples/public_examples/B/Tickets/Disprover_InstantiationError/GraphColour_PO.mch', '-init', '-p', 'TIME_OUT', 300, '-p', 'DISPROVER_MODE', 'TRUE', |
| 2267 | | '-expcterr', setup_constants_fails, '-opterr', time_out, '-strict'], 'Check that no instantiation error occurs'). % time_out may not occur on fast machines |
| 2268 | | cli_testcase(1249, [cbc,slot], ['../prob_examples/public_examples/B/PerformanceTests/SlotToolSolver_Inconsistency.mch', |
| 2269 | | '-init', '-p', 'TIME_OUT', 2500, '-expcterr', setup_constants_fails, |
| 2270 | | '-opterr', 'setup_constants_inconsistent', '-strict' |
| 2271 | | %,'-expcterr', det_value_not_stored_for_constant % changed from warning to message 18/02/2018 |
| 2272 | | ], 'Check that inconsistency detected quickly'). |
| 2273 | | cli_testcase(1250, [cbc], [ |
| 2274 | | '-evalf', 'f:0..100 --> POW(1..100) & f(20) = {99} & !x.(x:dom(f) => !y.(y:f(x) => y /= 99))', |
| 2275 | | '-evalt', 'f:0..100 --> POW(1..100) & f(20) = {98} & !x.(x:dom(f) => !y.(y:f(x) => y /= 99))', |
| 2276 | | '-evalf', 'f:0..100 --> POW(1..100) & f(20) = {99} & !x.(x:dom(f) => !y.(y:f(x) & y>20 => y /= 99))' |
| 2277 | | ], 'Check universal quantification inconsistency detected'). |
| 2278 | | cli_testcase(1251, [cbc,chr], ['../prob_examples/examples/RodinModels/Pacemaker/PO_M4_AATR_Decrease_Interval_inv2_INV.mch', '-init', '-p', 'TIME_OUT', 500, '-p', 'DISPROVER_MODE', 'TRUE', '-expcterr', setup_constants_fails, '-strict'], 'Check that inconsistency detected quickly (with CHR)'). |
| 2279 | | cli_testcase(1252, [cbc,wd], ['../prob_examples/examples/RodinModels/Pacemaker/PO_M4_AATR_Decrease_Interval_inv2_INV.mch', '-init', '-p', 'TIME_OUT', 300, '-p', 'DISPROVER_MODE', 'FALSE', '-expcterr', setup_constants_fails, |
| 2280 | | '-opterr', 'setup_constants_unknown', |
| 2281 | | '-opterr', time_out, |
| 2282 | | '-opterr', virtual_time_out, |
| 2283 | | '-expcterr', well_definedness_error, '-strict'], 'Check that division by zero detected.'). |
| 2284 | | cli_testcase(1253, [tickets,union], ['../prob_examples/public_examples/B/Tickets/LambdaUnionEnumWarning/Seq1UnionFunction.mch', |
| 2285 | | '-init', '-assertions', '-strict'], 'Check that symbolic function not expanded in rel. composition'). |
| 2286 | | cli_testcase(1254, [cbc, tickets, chr], ['-p', 'CHR', 'TRUE', |
| 2287 | | '-evalf', 'x> a & x: 33..a', |
| 2288 | | '-evalt', 'x>=a & x>=33 & x<=a', |
| 2289 | | '-evalf', 'x>a & x>=33 & x<=a' |
| 2290 | | ], 'Check CHR detects inconsistencies'). |
| 2291 | | cli_testcase(1255, [cbc], ['-p', 'DISPROVER_MODE', 'TRUE', |
| 2292 | | '-evalf', 'z>0 & z mod z = 100 & x:{1,2,3} & not(x>0)'], 'Check no enum warning'). |
| 2293 | | cli_testcase(1256, [tickets,card], [ |
| 2294 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Cansell_RingLead/ring_ctx.eventb', |
| 2295 | | '-init'], 'Check no infinite loop when computing minimum cardinality'). |
| 2296 | | cli_testcase(1257, [b_test,csp_test,ltl,fairness,cspb],['../prob_examples/public_examples/CSPB/Williams/ME.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/Williams/ME.csp', '-ltlassertions', '-strict'],'Check ltl assertions with imposed fairness constraints in (ME.mch|| ME.csp).'). |
| 2297 | | cli_testcase(1258, [eventb_test,ltl],['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent/fact_m_v3_mch.eventb', '-ltlformulat', 'F ([found0])', '-strict'],'Check an ltl formula on an Event-B model.'). |
| 2298 | | cli_testcase(1259, [b_test,csp_test,ltl,fairness,cspb],['../prob_examples/public_examples/CSPB/Williams/pris.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/Williams/pris.csp', '-ltlformulat', 'SF(In.p1) & SF(In.p2) & SF(In.p3) => F[Done]', '-strict'],'Check an LTL formula with imposed fairness constraints in (pris.mch|| pris.csp).'). |
| 2299 | | cli_testcase(1260, [b_test,proz],['../prob_examples/public_examples/B/NewSyntax/FreetypeIntList.mch', |
| 2300 | | '../prob_examples/public_examples/B/NewSyntax/FreeTypeAndRecursion.mch', |
| 2301 | | '-p','MAXINT',10,'-t','-strict'], |
| 2302 | | 'Check rudimental freetype functionally'). |
| 2303 | | cli_testcase(1261, [cbc], [ |
| 2304 | | '-evalt', '(x:{y|y:NATURAL & y mod 100 = 1} <=> v=0) & v=0 & x>1' |
| 2305 | | ], 'Test reification of closures'). |
| 2306 | | cli_testcase(1262, [b_test,union],['../prob_examples/public_examples/B/Tickets/Hansen8/EnumerateFunctionTests.mch','-mc', 1000, '-cc', 4,10,'-strict'],'Check union with full relations does not time out'). |
| 2307 | | cli_testcase(1263, [b_test,tickets,card],['../prob_examples/public_examples/EventBPrologPackages/Tickets/CardTruthBody/DPLL_Backtrack_mch_not_symbolic.eventb', '-t', '-mc', 100, '-strict'],'Check function unit_resolve detected as symbolic without symbolic annotation'). |
| 2308 | | cli_testcase(1264, [b_test,infinite], ['../prob_examples/public_examples/B/Mathematical/FormaleSprachen.mch', |
| 2309 | | '-init','-assertions', '-strict'], 'Checking various operations work on infinite sets (e.g., complement set).'). |
| 2310 | | cli_testcase(1265, [tickets,card], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/MinCardInference/RegularGrammar_Ex1_ctx.eventb', '-init', |
| 2311 | | '-evalt', 'card(Symbols)=4', |
| 2312 | | '-evalt', 'card(NonTerminals)=2', |
| 2313 | | '-evalt', 'card(Terminals)=2'], 'Check that minimum cardinality inference works'). |
| 2314 | | cli_testcase(1266, [b_test],['../prob_examples/public_examples/B/Tickets/Hansen9/SimpleCSGGrammar2_SlowCLPFD.mch','-t','-strict','-p','CLPFD','TRUE'],'Check no time-out'). |
| 2315 | | cli_testcase(1267, [cbc,sequences], [ |
| 2316 | | '-evalt', '{n|[11,22,3,4,5,6,7] /|\\ n = [11,22]} = {2}' |
| 2317 | | , '-evalt', '{l|[2222]^l /|\\ 7 = l} = {[2222,2222,2222,2222,2222,2222,2222]}' |
| 2318 | | , '-evalt', '{x,n|[1111,x,33,44] /|\\ n = [1111,2222] & n:0..4} = {(2222,2)}' |
| 2319 | | , '-evalt', '{x,y,n|[1111,x,3333,4444,y,y] /|\\ n = [1111,2222,3333,4444,5555] & n:0..6} = {((2222|->5555)|->5)}' |
| 2320 | | %,'-evalt', '{n,x,y|[11,22,3,4,5,6,7] /|\ n = [x,y]} = {((2|->11)|->22)}' % does not work yet TO DO |
| 2321 | | ], |
| 2322 | | 'test sequence constraint solving'). |
| 2323 | | cli_testcase(1268, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/Factorial_TLAStyle.mch', '-init', '-assertions', '-strict', '-p', 'SYMBOLIC', 'FALSE'], 'Test that other recursive function works also with TLA style if-then-else.'). |
| 2324 | | cli_testcase(1269, [tickets,card], [ |
| 2325 | | '-evalt', 'm={{1,2},{1,3}} & {k1,k2|k1:m & 1:k1 & k2:m & 1:k2 & k1/=k2} =r & card(r)=2', |
| 2326 | | '-evalt', 'm={{1,2},{1,3},{2,3}} & {k1,k2|k1:m & 1:k1 & k2:m & 1:k2 & k1/=k2} =r & card(r)=2', |
| 2327 | | '-evalt', 'm={{1,2},{1,3}} & {k1,k2|k1:m & 1:k1 & k2:m-{k1} & 1:k2} =r & card(r)=2', |
| 2328 | | '-evalt', 'm={{1,2},{1,3},{2,3}} & {k1,k2|k1:m & 1:k1 & k2:m-{k1} & 1:k2} =r & card(r)=2' |
| 2329 | | ], 'ensure bug in not_equal_object for sets remains fixed'). |
| 2330 | | cli_testcase(1270, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsPow2.mch', '-mc', '200', '-bf', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'More laws about sets of sets'). |
| 2331 | | cli_testcase(1271, [b_test],['../prob_examples/public_examples/B/Tickets/Hansen10/PrettyPrintBug.mch','-mc', 200, '-t', '-his', '../prob_examples/public_examples/B/Tickets/Hansen10/PrettyPrintBug_his.txt','-strict'],'Check no time-out'). |
| 2332 | | cli_testcase(1272, [cbc,card], [ |
| 2333 | | '-evalf', 'card({x|x:1..10 & x*x<i}) = 0 & i>1', |
| 2334 | | '-evalt', 'card({x|x>1 & x<2**e & x mod 2 = 0}) = 0', |
| 2335 | | '-evalt', 'card({b|b:1..8 & b mod n = 1})=c & n:2..4', |
| 2336 | | '-evalt', 'f: 1..n --> 0..1000 & f(1)=0 & card({i|i:1..n & f(i)>0}) = n/2 & n=100', |
| 2337 | | '-evalt', 'n=20 & f:1..n --> BOOL & card({x|x:1..n & f(x)=TRUE})=n/2 & !y.(y:1..(n-1) => ( f(y)=TRUE => f(y+1)=TRUE))', |
| 2338 | | '-evalt', 'n=100 & f:1..n --> BOOL & card({x|x:dom(f) & f(x)=TRUE})=50' |
| 2339 | | ], 'ensure proper reification of card'). |
| 2340 | | cli_testcase(1273, [cbc,card], [ |
| 2341 | | '-evalf', '{10,22} <: {x|x>10 & x mod 2 = 0}', |
| 2342 | | '-evalt', '{100,22} <: {x|x>10 & x mod 2 = 0}', |
| 2343 | | '-evalf', '{11,22} <: {x|x>10 & x mod 2 = 0}', |
| 2344 | | '-evalt', 'card({S|S <<: 12..15 & (12:S => 15:S & 14 /:S) & (13:S <=> 12:S) & S/={}})=4', |
| 2345 | | '-evalt', 'card({S|S <<: 12..14 & (12:S => 15:S & 14 /:S) & (13:S <=> 12:S) & S/={}}) =1', |
| 2346 | | '-evalt', 'card({S|S <<: 12..19 & (12:S => 15:S & 14 /:S) & (13:S <=> 12:S) & S/={}})=79', |
| 2347 | | '-evalt', 'card({S|S <<: 11..18 & (12:S => 15:S & 14 /:S) & (15:S <=> 12:S) & S/={}})=95', |
| 2348 | | '-evalt', 'card({S|S <: 11..18 & (12:S => 15:S & 14 /:S) & (15:S <=> 12:S) & S/={}})=95', |
| 2349 | | '-evalt', 'card({S|S <: 12..15 & (12:S => 15:S) & 14 /:S }) = 6', |
| 2350 | | '-evalt', 'card({S|S <<: 12..15 & (12:S => 15:S) & 14 /:S }) = 6', |
| 2351 | | '-evalt', '({S|S <: 12..15 & (12:S => 15:S) & 14 /:S }) = {{},{12,15},{13},{12,13,15},{13,15},{15}}' |
| 2352 | | ], 'ensure no expansion in subset and proper computation of all solutions'). |
| 2353 | | cli_testcase(1274, [tickets],['../prob_examples/public_examples/B/Tickets/Hansen11/RecNatFunLoop.mch', '-init', '-assertions', '-strict', '-vv'],'Check no infinite recursion'). |
| 2354 | | cli_testcase(1275, [tickets,typechecker_test,let],['../prob_examples/public_examples/B/ErrorMachines/TestScopeLHSAssignmentLET.mch', '-init', '-strict', '-expcterr', type_error, '-expcterr', load_main_file],'LET introduces a duplicate variable'). |
| 2355 | | cli_testcase(1276, [tickets,cbc],['../prob_examples/public_examples/B/Compilers/LLParsing.mch', '-t', '-strict'],'Check no enumeration warning due to existential quantifiers'). |
| 2356 | | cli_testcase(1277, [tickets,typechecker_test],['../prob_examples/public_examples/B/Tickets/PROB-333/InvalidAssignmentBecomesSuch.mch', '-init', '-strict', '-expcterr', type_error, '-expcterr', load_main_file],'A becomes such assignment is not allowed to write to an read-only identifier'). |
| 2357 | | cli_testcase(1278, [tickets,typechecker_test],['../prob_examples/public_examples/B/Tickets/PROB-333/InvalidAssignmentElementOf.mch', '-init', '-strict', '-expcterr', type_error, '-expcterr', load_main_file],'An element of assignment is not allowed to write to an read-only identifier'). |
| 2358 | | cli_testcase(1279, [tickets,typechecker_test],['../prob_examples/public_examples/B/Tickets/PROB-333/InvalidAssignmentOpCall.mch', '-init', '-strict', '-expcterr', type_error, '-expcterr', load_main_file],'An operation call assignment is not allowed to write to an read-only identifier'). |
| 2359 | | cli_testcase(1280, [tickets,typechecker_test],['../prob_examples/public_examples/B/Tickets/PROB-333/InvalidAssignmentToAnyVar.mch', '-init', '-strict', '-expcterr', type_error, '-expcterr', load_main_file],'Assignment to variables introduced by ANY are not allowed'). |
| 2360 | | cli_testcase(1281, [tickets,typechecker_test,let],['../prob_examples/public_examples/B/Tickets/PROB-333/InvalidAssignmentToLetVar.mch', '-init', '-strict', '-expcterr', type_error, '-expcterr', load_main_file],'Assignment to variables introduced by LET are not allowed'). |
| 2361 | | cli_testcase(1282, [tickets,let,card],['../prob_examples/public_examples/B/Tickets/PROB-333/M1.mch' |
| 2362 | | , '-init', '-strict', '-assertions' |
| 2363 | | , '-evalt', '#(b).(b:NAT)' |
| 2364 | | , '-evalt', '#(a).(a:NAT)' |
| 2365 | | , '-evalt', '!(a).(a:ID => card(ID-{a}) = 1)' |
| 2366 | | , '-evalt', '!(ab).(ab:ID => card(ID-{ab}) = 1)' |
| 2367 | | , '-evalt', ' #aa.(not(myTRUE))' |
| 2368 | | , '-evalt', '{aa|myTRUE} = {aa}' |
| 2369 | | , '-expcterrpos', definition_variable_capture, 6, 10 |
| 2370 | | , '-expcterrpos', definition_variable_capture, 7, 5 |
| 2371 | | , '-expcterrpos', definition_variable_capture, 1, 10 |
| 2372 | | , '-expcterrpos', definition_variable_capture, 1, 4 % from -evalt's above |
| 2373 | | ],'Assignment to variables introduced by LET are not allowed'). |
| 2374 | | cli_testcase(1283, [b_test,wd], ['../prob_examples/public_examples/B/ErrorMachines/NestedFunUpdate_Error.mch', '-nodead', '-mc', 10, '-strict', |
| 2375 | | '-expcterr', 'well_definedness_error'], 'Ensure we find error in assignment.'). |
| 2376 | | cli_testcase(1284, [eventb_test,tickets], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/SlowLambdaFunctions/TestParIf2_v2_mch.eventb', |
| 2377 | | '-p', 'MAX_OPERATIONS', 40, |
| 2378 | | '-p', 'TIME_OUT', 1000, |
| 2379 | | '-mc', 1000, '-expcterr', 'model_check_incomplete', '-cc', 193, 4369, |
| 2380 | | '-strict'], 'Ensure performance acceptable for nested function applications.'). |
| 2381 | | cli_testcase(1285, [cbc], ['../prob_examples/public_examples/B/Tickets/PartialFunCBCPerformance/Prove_simpler_ctx.eventb', |
| 2382 | | '../prob_examples/public_examples/B/Tickets/PartialFunCBCPerformance/ProveCommutativityAxioms_ctx.eventb', |
| 2383 | | '-p', 'TIME_OUT', 1000, '-p', 'MAX_INITIALISATIONS', 90, |
| 2384 | | '-init', '-mc', 1000, '-nodead', '-strict' |
| 2385 | | ], 'Ensure we find solution to initalisation.'). |
| 2386 | | cli_testcase(1286, [eventb_test,choose, theories],['../prob_examples/public_examples/EventBPrologPackages/Theory/TestHilbert.eventb','-assertions','-strict'], 'Test if the tagged CHOOSE operator in a theory works.'). |
| 2387 | | cli_testcase(1287, [eventb_test, theories],['../prob_examples/public_examples/EventBPrologPackages/Theory/RecursiveSetFunctions_ctx.eventb','-assertions', '-init', '-strict', |
| 2388 | | '-evalt', 'sumset(1..1000) = 500500'], 'Test that recursive functions with COND work and that we can use Theory operators in evalt.'). |
| 2389 | | cli_testcase(1288, [tickets,smt_test,chr,siemens],['../prob_examples/examples/B/Siemens/RuleValidation/v7_4_trad_pour_m_leuschel-2012-05-04/OrderXY_78_1.mch', |
| 2390 | | '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'TIME_OUT', 100, |
| 2391 | | '-expcterr', cbc_assertions_time_out, |
| 2392 | | '-cbc_assertions','-strict'], 'Test Siemens Proof Rule.'). |
| 2393 | | cli_testcase(1289, [tickets,records],['../prob_examples/public_examples/B/Tickets/Hansen12/RecordCallResidue.mch', '-init', '-assertions', '-strict'],'Check no call residue for records.'). |
| 2394 | | cli_testcase(1290, [tickets],['../prob_examples/public_examples/B/Tickets/Hansen13/VirtualTimeout.mch', '-init', '-mc', 100, '-strict', '-expcterr', 'model_check_incomplete','-expcterr', 'time_out_for_invariant'],'Check incomplete model checking detected.'). |
| 2395 | | cli_testcase(1291, [tickets,infinite,override],['../prob_examples/public_examples/B/Tickets/Hansen13/OverrideSymbolicTest.mch', '-t', '-strict'],'Check override substitution works symbolically.'). |
| 2396 | | cli_testcase(1292, [b_test,case],['../prob_examples/examples/B/Satpathy/Teletext104/Teletext104_deterministic.mch', '-t', '-strict'],'Check this relatively large machine works.'). |
| 2397 | | cli_testcase(1293, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test1.tla', '-mc', 100, '-strict'], 'TLC regression test: equality.'). |
| 2398 | | cli_testcase(1294, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test2.tla', '-mc', 100, '-strict'], 'TLC regression test: functions.'). |
| 2399 | | %cli_testcase(1295, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test3.tla', '-mc', 100, '-strict'], 'TLC regression test: function application.'). virtual timeout PROB-367 |
| 2400 | | cli_testcase(1296, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test4.tla', '-mc', 100, '-strict'], 'TLC regression test: sets.'). |
| 2401 | | cli_testcase(1297, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test5.tla', '-mc', 100, '-strict'], 'TLC regression test: Cartesian Product.'). |
| 2402 | | cli_testcase(1298, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test6.tla', '-mc', 100, '-strict'], 'TLC regression test: Propositional Logic.'). |
| 2403 | | cli_testcase(1299, [b_test,tla,choose],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test7.tla', |
| 2404 | | '-expcterrpos', 'bmachine_static_checks', 34, 9, % forall rhs does not use ids |
| 2405 | | '-mc', 100, '-strict'], 'TLC regression test: Choose operator.'). |
| 2406 | | cli_testcase(1300, [cbc], [ |
| 2407 | | '-evalf', '[1,2,3,3,3,4] : seq({1, 2, 3}) - seq({1, 2})', |
| 2408 | | '-evalt', '[1,2,3,3,3,4] /: seq({1, 2, 3}) - seq({1, 2})', |
| 2409 | | '-evalf', '[1,2,2,2,2,1] : seq({1, 2, 3}) - seq({1, 2})', |
| 2410 | | '-evalt', '[1,2,2,2,2,1] /: seq({1, 2, 3}) - seq({1, 2})', |
| 2411 | | '-evalt', '[1,2,3,3,3,2] : seq({1, 2, 3}) - seq({1, 2})', |
| 2412 | | '-evalf', '[1,2,3,3,3,2] /: seq({1, 2, 3}) - seq({1, 2})', |
| 2413 | | '-evalt', '[1,2,2,2,2,1,v] : seq({1, 2, 3}) - seq({1, 2}) & v>1', |
| 2414 | | '-evalt', '{x | x : NATURAL - {x|x>10}} = 0..10', |
| 2415 | | '-evalt', '{x | x : NATURAL - NATURAL1} = 0..0', |
| 2416 | | '-evalt', 'x /: NATURAL - {x|x>10} & x>0 & x<100', |
| 2417 | | '-evalt', '11..99 = {x|x /: NATURAL - {x|x>10} & x>0 & x<100}', |
| 2418 | | '-evalt', 'x : NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', |
| 2419 | | '-evalt', 'x /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', |
| 2420 | | '-evalt', '-11 /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', |
| 2421 | | '-evalt', '1024 : NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', |
| 2422 | | '-evalf', '1024 /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', |
| 2423 | | '-evalt', '1025 /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', |
| 2424 | | '-evalf', '1025 : NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', |
| 2425 | | '-evalt', '[1,2] : seq({1, 2, 3}) /\\ seq({0, 1, 2})', |
| 2426 | | '-evalt', '[1,2,3] /: seq({1, 2, 3}) /\\ seq({0, 1, 2})', |
| 2427 | | '-evalt', '[1,2,3,4] /: seq({1, 2, 3}) /\\ seq({0, 1, 2})', |
| 2428 | | '-evalt', '[1,2,2,2,1,2] : seq({1, 2, 3}) /\\ seq({0, 1, 2})', |
| 2429 | | '-evalt', 'seq({1, 2, 3}) /\\ seq({0, 1, 2}) = sq & [1,2,2,2,1] : sq', |
| 2430 | | '-evalt', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2] : sq', |
| 2431 | | '-evalf', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2] /: sq', |
| 2432 | | '-evalt', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2,0] /: sq', |
| 2433 | | '-evalf', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2,0] : sq', |
| 2434 | | '-evalt', '{200,201,301,400} - {x|x>0 & x mod 100 = 0} = {201,301}', |
| 2435 | | '-evalt', '{200,201,301,400} /\\ {x|x>0 & x mod 100 = 0} = {200,400}', |
| 2436 | | '-evalt', '500 : ( {x|x>0 & x mod 100 = 0} - {200,400})', |
| 2437 | | '-evalt', '400 /: ( {x|x>0 & x mod 100 = 0} - {200,400})', |
| 2438 | | '-evalf', '400 : ( {x|x>0 & x mod 100 = 0} - {200,400})', |
| 2439 | | '-evalt', 'abs = id(NATURAL) \\/ %x.(x<0|-x) & abs(2001)=2001 & abs(-2002)=2002', % added 23.3.2015 |
| 2440 | | '-evalt', 'f = id(NATURAL) /\\ %x.(x<100|-x) & f={0|->0}', % added 23.3.2015 |
| 2441 | | '-evalt', 'abs = %x.(x<0|-x) \\/ id(NATURAL) & abs(2001)=2001 & abs(-2002)=2002', % added 23.3.2015 |
| 2442 | | '-evalt', '0: NATURAL - {1} - {2}', % added 14.5.2018 |
| 2443 | | '-evalt', '3: NATURAL - {1} - {2}', % added 14.5.2018 |
| 2444 | | '-evalf', '1: NATURAL - {1} - {2}', % added 14.5.2018 |
| 2445 | | '-evalf', '2: NATURAL - {1} - {2}', % added 14.5.2018 |
| 2446 | | '-evalt', '33: NATURAL - {1} - {2}', % added 14.5.2018 |
| 2447 | | '-evalf', '0: NATURAL1 - {11} - {22}', % added 14.5.2018 |
| 2448 | | '-evalf', '11: NATURAL1 - {11} - {22}', % added 14.5.2018 |
| 2449 | | '-evalf', '22: NATURAL1 - {11} - {22}', % added 14.5.2018 |
| 2450 | | '-evalt', '1: NATURAL1 - {11} - {22}', % added 14.5.2018 |
| 2451 | | '-evalt', '23: NATURAL1 - {11} - {22}', % added 14.5.2018 |
| 2452 | | '-evalf', '{} = NATURAL1 - {11} - {22}' % added 14.5.2018 |
| 2453 | | ], 'ensure symbolic treatment of set difference and intersection membership'). |
| 2454 | | cli_testcase(1301, [tickets,infinite,strings,card], [ |
| 2455 | | '-evalt', 'NATURAL1 /: {NATURAL,INTEGER,NATURAL,1..2,{}}', |
| 2456 | | '-evalf', 'NATURAL1 : {NATURAL,INTEGER,NATURAL,1..2,{}}', |
| 2457 | | '-evalt', 'NATURAL1 : {NATURAL,INTEGER,NATURAL1,1..2,{}}', |
| 2458 | | '-evalt', '1..2 : {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', |
| 2459 | | '-evalt', '{} : {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', |
| 2460 | | '-evalt', '{NATURAL} <: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', |
| 2461 | | '-evalt', '{NATURAL} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', |
| 2462 | | '-evalt', '{NATURAL,{},INTEGER} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', |
| 2463 | | '-evalt', '{NATURAL,{},INTEGER,{1,2}} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', |
| 2464 | | '-evalf', '{NATURAL,{},INTEGER,{1,3}} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', |
| 2465 | | '-evalt', '7=card({NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}})', |
| 2466 | | '-evalt', '5=card({NATURAL1,INTEGER,NATURAL1,1..2,{},1..3,{1,2}})', |
| 2467 | | '-evalt', '{NATURAL1,INTEGER,x} = r & {}:r', |
| 2468 | | '-evalt', '{STRING,{},{"hallo"}} = s & card(s)=3 & {}:s & STRING:s', |
| 2469 | | '-evalt', 'r = { {1..2},{NATURAL}, {INTEGER}, {{}}, {NATURAL1}, {NATURAL1,NATURAL} } & {x} : r & x=NATURAL', |
| 2470 | | '-evalt', 'r = { {1..2},{NATURAL}, {INTEGER}, {{}}, {NATURAL1}, {NATURAL1,NATURAL} } & {x,y} : r & x=NATURAL & y=NATURAL1', |
| 2471 | | '-evalf', 'r = { {1..2},{NATURAL}, {INTEGER}, {{}}, {NATURAL1}, {NATURAL1,INTEGER} } & {x,y} : r & x=NATURAL & y=NATURAL1', |
| 2472 | | '-evalt', '{x|x>10 & x*x = 100} : {NATURAL,{},1..3,{2},INTEGER}', |
| 2473 | | '-evalt', '{x|x>4 & x*x = 100} : {NATURAL,{},1..3,{10},INTEGER}', |
| 2474 | | '-evalt', '{3,2,1} : {NATURAL1,{},1..3,{2},INTEGER}' |
| 2475 | | ], 'test putting infinite global sets into AVL sets'). |
| 2476 | | cli_testcase(1302,[private,data_validation,alstom,while],['../prob_examples/examples/B/Alstom/Ticket_July2_2014/Rule_TMS_Signal_0107.mch','-strict', '-t', '-pref_group', integer, int32, '-p', 'TIME_OUT', 15000 ], 'Ticket related to variables only read in while loop'). |
| 2477 | | cli_testcase(1303,[private,data_validation,alstom,while],['../prob_examples/examples/B/Alstom/Ticket_July2_2014/Rule_DB_SIGAREA_0030.mch','-strict', '-t', '-pref_group', integer, int32, '-p', 'TIME_OUT', 15000, |
| 2478 | | '-mc', 100, '-bf', |
| 2479 | | '-expcterr', 'invariant_violation' , '-expcterr', bmachine_static_checks, '-expcterrpos', type_error, 719, 48], 'Ticket related to local variables modified in while loop which are also constants of another machine (length)'). |
| 2480 | | cli_testcase(1304, [eventb_test,laws, proz, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListLawsMC_inf_mch.eventb','-t', '-strict', |
| 2481 | | '-expcterr', 'virtual_time_out'], 'Various checks for sets involving freetypes (Lists Theory; PROB-325) that no wd-error occurs'). |
| 2482 | | cli_testcase(1305, [cbc], ['../prob_examples/public_examples/B/Puzzles/Euler_Project/Euler_Problem_009.mch', '-init', '-strict', '-p', 'CLPFD', 'TRUE', '-properties'], 'Test that this puzzle now solved also when encoded as machine'). |
| 2483 | | cli_testcase(1306, [b_test],['../prob_examples/public_examples/B/Tickets/Hansen15/PostCorrespondence_MC.mch','-mc', 50, '-t', '-strict', '-p', 'TIME_OUT', 3500, '-expcterr', 'model_check_incomplete'],'Check no call residue'). |
| 2484 | | cli_testcase(1307,[private,b_test,alstom,data_validation],['../prob_examples/examples/B/Alstom/Ticket_July9_2014/Rule_TMS_Overlap_0062.mch','-strict', '-expcterr', type_error, '-expcterr', load_main_file], 'Ticket related to operation defined multiple times + raising of error messages'). |
| 2485 | | cli_testcase(1308, [b_test,kodkod,tickets], ['../prob_examples/public_examples/B/Tickets/PROB-331/HadamardMatrixRel_ForKodkod.mch', '-init', '-strict', '-p','TIME_OUT',3000, '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-p', 'KODKOD_ONLY_FULL', 'FALSE'], 'Check that Kodkod finds solution. (PROB-331)'). |
| 2486 | | cli_testcase(1309,[proz],['../prob_examples/public_examples/Z/Tickets/PROB-343/RecursiveDatatype.fuzz','-p','DEFAULT_SETSIZE','2','-p','TIME_OUT','1000','-mc',1000,'-nodead','-cc',4,3,'-strict'],'Z Freetypes: Checking simple recursive definition'). |
| 2487 | | cli_testcase(1310, [tickets], [ |
| 2488 | | '../prob_examples/public_examples/B/Tickets/PROB-335/RecordDetectionBugSimple.mch', % used to generate a virtual time-out (fixed July 13th 2014) |
| 2489 | | '../prob_examples/public_examples/B/Tickets/PROB-335/ExtremaFinding.mch', '-mc', 100, '-p', 'MAX_INITIALISATIONS', 20, '-nodead', |
| 2490 | | '-init', '-assertions', '-strict'], 'Check that Record Detection does not mess up. (PROB-335)'). |
| 2491 | | cli_testcase(1311, [cbc], ['-evalt', 'a : NATURAL & b : NATURAL & c : NATURAL & a < b & b < c & a**2 + b ** 2 = c ** 2 & a + b + c = 1000 & result=PI(x).(x:{a,b,c}|x)'], 'Test that Euler Puzzle 9 can be solved using Eval console'). |
| 2492 | | cli_testcase(1312, [cbc], ['../prob_examples/public_examples/B/Puzzles/Euler_Project/Euler_Problem_004.mch', '-init', '-strict', '-p', 'CLPFD', 'TRUE', '-properties', '-assertions','-p', 'TIME_OUT', 10000 ], 'Test that this puzzle can be solved'). % temporariliy set an increased time-out (Sept. 2014) TO DO: remove again !! |
| 2493 | | cli_testcase(1313, [tickets,infinite], |
| 2494 | | ['-evalt', 'x=prj1(INTEGER,INTEGER) & y=prj1(INTEGER,INTEGER) & x=y', |
| 2495 | | '-evalt', 'x=prj1(INTEGER,POW(NATURAL*INTEGER)) & y=prj1(INTEGER,POW(NATURAL*INTEGER)) & x=y', |
| 2496 | | '-evalt', 'prj1(NATURAL1,NATURAL1)(222,333)=222', |
| 2497 | | '-evalt', 'prj2(NATURAL1,NATURAL1)(222,333)=333', |
| 2498 | | '-evalt', 'dom(prj1(NATURAL,NATURAL1)) = NATURAL*NATURAL1', |
| 2499 | | '-evalt', 'dom(prj2(NATURAL1,NATURAL1)) = NATURAL1*NATURAL1' |
| 2500 | | ], 'Check that no infinite expansion occurs when comparing two prj1 functions + other prj1/prj2 tests (PROB-346)'). |
| 2501 | | cli_testcase(1314, [cbc,card], [ |
| 2502 | | '-evalt', ' s = [x,y,z] & rev(s) = {1|->v,v|->w,w|->v} & v>w', |
| 2503 | | '-evalt', '{s,x,y,z,v,w|s = [x,y,z] & rev(s) = {1|->v,v|->w,w|->v} & v>w} = {((((([2,3,3]|->2)|->3)|->3)|->3)|->2)}', |
| 2504 | | '-evalt', 'rev({x|->y}) = {v|->w} & w:NATURAL', |
| 2505 | | '-evalt', 'card({s,x,y,z,v,w|s = [x,y,z] & rev(s) = {1|->v,v|->w,w|->v} }) = 2', |
| 2506 | | '-evalt', '{s,x,y,z,v,w|s = [x,y,z] & rev(s) = {1|->v,v|->w,w|->v} } = {((((([2,3,2]|->2)|->3)|->2)|->2)|->3),((((([2,3,3]|->2)|->3)|->3)|->3)|->2)}', |
| 2507 | | '-evalt' , '{v,w,x,y,z|{1|->v,v|->w,w|->v} = [x,y,z]} = {((((2|->3)|->2)|->3)|->2),((((3|->2)|->3)|->3)|->2)}', |
| 2508 | | '-evalt' , '{v,w,x,y|{1|->v,v|->w,w|->v} = [x,y,x]} = {(((2|->3)|->2)|->3)}', |
| 2509 | | '-evalt', 'min({1+10,x}) = max({1+10,x})', |
| 2510 | | '-evalt', '{x|min({1+10,x}) = max({1+10,x})} = {11}' |
| 2511 | | ], 'Testing constraint propagation for reverse and unification with set extensions.'). |
| 2512 | | cli_testcase(1315, [cbc], [ |
| 2513 | | '-evalf', 'x:INTEGER & x>y & x=y', |
| 2514 | | '-evalf', 'x+1 > y+1 & x=y', |
| 2515 | | '-evalf', 'x+1 < y+1 & x=y', |
| 2516 | | % require CHR: '-evalf', 'x<y & y<z & x=z', or '-evalf', 'x+1 < y & x=y' |
| 2517 | | '-evalt', '!(x,y).(x:INTEGER & x>y => x/=y)' |
| 2518 | | ], 'Check simple inconsistencies with <, > detected now'). |
| 2519 | | cli_testcase(1316, [cbc], ['../prob_examples/public_examples/B/Puzzles/Euler_Project/Euler_Problem_067.mch', '-init', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions','-p', 'TIME_OUT', 5000 %increased time-out for cobra |
| 2520 | | ], 'Test challenging puzzle'). |
| 2521 | | cli_testcase(1317, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/Underscore_LTL.csp', '-ltlassertions', '-strict'], 'Checking underscore arguments in LTL formulas.'). |
| 2522 | | cli_testcase(1318, [b_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', '-mc', '100', '-cc', '36', '156', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'COMPRESSION' , 'TRUE'], 'Test COMPRESSION for spec using sets'). |
| 2523 | | cli_testcase(1319, [b_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', |
| 2524 | | '-mc', '100', '-bf', '-cc', '36', '156', '-p', 'DEFAULT_SETSIZE', '3', '-save_state', |
| 2525 | | '../prob_examples/public_examples/B/Demo/scheduler_bf_states.P'], 'Test -save_state works'). |
| 2526 | | cli_testcase(1320, [cbc], [ |
| 2527 | | '-evalt', 's = {y|y>2 & y mod 33 /= 1} & r={x|x:30..100 & x /:s} & r={34,67,100}'], 'check b_not_test_closure_enum works'). |
| 2528 | | cli_testcase(1321, [cbc,wd], [ |
| 2529 | | '-evalnwd', '{} : (1..(10/0) +-> {22})', |
| 2530 | | '-expcterr', well_definedness_error], 'check WD error detected for binary_in_definitely_true'). |
| 2531 | | cli_testcase(1322, [cbc,wd], [ |
| 2532 | | '-evalnwd', '{} : POW(1..(10/0))', |
| 2533 | | '-expcterr', well_definedness_error], 'check WD error detected for unary_in_definitely_true'). |
| 2534 | | cli_testcase(1323, [eventb_test,tickets,theories], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/testSUM_Theory_agg_op_ctx.eventb', |
| 2535 | | '-init', '-assertions', |
| 2536 | | '-strict'], 'Ensure no variable clash with agg_op1/2.'). |
| 2537 | | cli_testcase(1324, [b_test], [ |
| 2538 | | '-eval', 'a & b', % <-- error |
| 2539 | | '-evalt', 'a=5', |
| 2540 | | % '-p', 'BOOL_AS_PREDICATE', 'TRUE' % no longer exists, hence we now get an error: |
| 2541 | | '-expcterr' ,parse_machine_predicate_error |
| 2542 | | ], 'Extended formula syntax (is no longer supported).'). |
| 2543 | | cli_testcase(1325, [b_test,refinement,card], ['../prob_examples/public_examples/B/FeatureChecks/Refinement/RefDefSetAsEnumSet.mch', |
| 2544 | | '-init', '-assertions', |
| 2545 | | '-strict'], 'Ensure enumerated set declaration in refinement using all-diff with card detected.'). |
| 2546 | | cli_testcase(1326, [b_test,cse, cse_test, strings], ['-p', 'CSE', 'TRUE', '-p', 'TIME_OUT', 150, |
| 2547 | | '-evalf', 'x:1..500000 & y:1..500000 & (x+y)**2 = 4+(x+y)**2', |
| 2548 | | '-evalf', '(x*y*z) = (y*x*z)+10', |
| 2549 | | '-evalf', '(x*y*z) = (y*z*x)+10', |
| 2550 | | '-evalf', '(x*(z*y)) = ((y*x)*z)+10', |
| 2551 | | '-evalf', '(x*y*z*z*x) = (z*x*y*x*z)+10', |
| 2552 | | '-evalf', '(x*y*(z*z)*x) = (z*(x*y)*x*z)+10', |
| 2553 | | '-evalf', '(x\\/y\\/v\\/x) /= (v\\/x\\/y) & x<:BOOL', % CSE does not fully detect LHS and RHS identical (because of idempotence) |
| 2554 | | '-evalf', '(x\\/y\\/v\\/x) /= (v\\/x\\/x\\/y) & x<:BOOL', |
| 2555 | | '-evalf', '(x\\/y\\/v\\/x) /= (v\\/x\\/x\\/y) & x<:STRING', |
| 2556 | | '-evalf', '(x\\/y\\/v\\/x) <<: (v\\/x\\/x\\/y) & x<:STRING', |
| 2557 | | '-evalf', '(x\\/y\\/v\\/x) /<: (v\\/x\\/x\\/y) & x<:STRING', |
| 2558 | | '-evalt', '(x\\/y\\/v\\/x) <: (v\\/x\\/x\\/y) & x<:BOOL', |
| 2559 | | '-evalt', '(x\\/y\\/v\\/x) /<<: (v\\/x\\/x\\/y) & x<:BOOL', |
| 2560 | | '-evalt', '(x*y*(z*z)*x) = (z*(x*y)*x*z*x)-36 & x:0..2 & y:0..2 & z:0..3', |
| 2561 | | '-evalt', '#x.((x>10+10) & (x>10+10 => b=TRUE) & x:1..200)', |
| 2562 | | '-evalt', '{0|->1,4|->2}(x*2+x*2) > 1', |
| 2563 | | '-evalt', '{0|->x*x, 1|->(x*x)+1}(v) = 9 & v:0..1 & x:0..10', % had WD error v:0..10 |
| 2564 | | '-evalt', '{xx,yy| xx:1..100 & yy>xx & yy<110 & xx|->yy:{yy,xx|xx:20..22 & yy:{xx-2,xx-3}}} = {(17|->20),(18|->20),(18|->21),(19|->21),(19|->22),(20|->22)}', |
| 2565 | | '-evalt', '{xx,yy| xx:1..(90+5*2) & yy>xx & yy<100+(5*2) & xx|->yy:{yy,xx|xx:(10+5*2)..22 & yy:{xx-2,xx-3}}} = {(17|->20),(18|->20),(18|->21),(19|->21),(19|->22),(20|->22)}', |
| 2566 | | '-evalt', '{xx,yy| xx:1..(90+5*2) & yy>xx & yy<100+(5*2) & xx-2 > 15 & xx-2 < 18 & xx|->yy:{yy,xx|xx:(10+5*2)..22 & yy:{xx-2,xx-3}}} = {(18|->20),(18|->21),(19|->21),(19|->22)}' |
| 2567 | | ], 'Ensure CSE works'). |
| 2568 | | cli_testcase(1327, [tickets,cse], ['-p', 'CSE', 'TRUE', '-p', 'TIME_OUT', '150s', |
| 2569 | | '-expcterr', set_eclipse_preference |
| 2570 | | ], 'Ensure error in set preference discovered'). |
| 2571 | | cli_testcase(1328, [cbc_refinement,refinement], ['../prob_examples/examples/RodinModels/Seiter_RefinementChecking/auth_0_mch.eventb', '-cbc_refinement'], ''). |
| 2572 | | cli_testcase(1329, [cbc_refinement,refinement], ['../prob_examples/examples/RodinModels/Seiter_RefinementChecking/auth_1_mch.eventb', '-cbc_refinement'], ''). |
| 2573 | | cli_testcase(1330, [cbc_refinement,refinement], ['../prob_examples/examples/RodinModels/Seiter_RefinementChecking/auth_2_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement], ''). |
| 2574 | | cli_testcase(1331, [tickets, slot], ['../prob_examples/public_examples/B/Tickets/PROB-356/SlotSolver.mch', |
| 2575 | | '-init', '-p', 'TIME_OUT', '25000', '-eval', 'CHECK(ges, ger, 1)' |
| 2576 | | ], 'Ensure no access record errors (PROB-356)'). |
| 2577 | | cli_testcase(1332, [tickets, slot], ['../prob_examples/public_examples/B/Tickets/PROB-355/SlotSolver.mch', |
| 2578 | | '-init', '-p', 'TIME_OUT', '20000', '-eval', 's1 : COURSES & CHECK(s1, soz, 1)' |
| 2579 | | ], 'Ensure no infinite loop (PROB-355)'). |
| 2580 | | cli_testcase(1333, [cbc_deadlock,cache], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', |
| 2581 | | '-p', 'MAX_INITIALISATIONS', 5, '-cbc_deadlock', '-strict', '-mc', '100', '-cache', '../prob_examples/public_examples/cache/', '-expcterr', 'model_check_incomplete'], 'Check that test 315 works with cache'). % TO DO: is much slower than without cache |
| 2582 | | cli_testcase(1334, [b_test,cruise,cse_test,codespeed,hash], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-strict', '-model_check', '-p', 'CSE', 'TRUE', '--hash64', 753243318772366897, '-p', 'MAX_INITIALISATIONS', 5, '-cc', '1361', '25696'], 'Check CSE for Cruise Controller'). % the hash is only valid on 64-bit systems ( conditional skip added); % 17.9.2021: adapted hash from 203058745203935766 for sorted order of variables, adapted hash on 8.12.2015 for new variable order |
| 2583 | | cli_testcase(1335, [b_test,hash], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-strict', '-mc', '20', '--hash64', 1095242179479036905, '-expcterr', 'hash', '-expcterr', 'model_check_incomplete'], 'Check that --hash option works'). |
| 2584 | | cli_testcase(1336, [tickets,slot,codespeed], ['../prob_examples/public_examples/B/Tickets/SLOT-24_no_print/SlotSolver.mch', |
| 2585 | | '-init', '-evalt', 'CHECK(ges, ger, 1)', '-evalf', 'CHECK(rom, jap, 1)', '-main_assertions' |
| 2586 | | ], 'Ensure no access record errors (SLOT-24)'). |
| 2587 | | cli_testcase(1337, [parser,tickets], ['../prob_examples/public_examples/B/Tickets/PARSERLIB-32/TestDefOrder.mch', |
| 2588 | | '-mc', 100 |
| 2589 | | ], 'Ensure that definition order for predicate-definitions does not matter (PARSERLIB-32)'). |
| 2590 | | cli_testcase(1338, [private, tickets, recursion,slot, unsat_core], ['../prob_examples/examples/B/SlotTool/SlotTool_19092014/SlotSolver.mch', |
| 2591 | | '-init', '-assertions' |
| 2592 | | ], 'Ensure complicated unsat core computations keep on working (SLOT-24)'). |
| 2593 | | %cli_testcase(1339, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/GenericUsageOfSquare.mch', '-plugin', 'units', '-strict', '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/GenericUsageOfSquare_internal.mch'], 'Check that operations calls and definitions are parametrical regarding units'). |
| 2594 | | cli_testcase(1340, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs.mch', '-ltlformula', 'SF(C) & WF(D) => GF {addr=4 or addr =5}', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2595 | | cli_testcase(1341, [b_test,cbc,cbc_tests], ['../prob_examples/public_examples/B/Demo/Bakery0.mch', '-bf', '-mc', 100, '--all_paths', '../prob_examples/public_examples/B/Demo/Bakery0_all_paths.xml', '-strict'], 'XML all path export.'). |
| 2596 | | cli_testcase(1342, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/M_Events_with_Args.mch', '-ltlformula', 'SF(Evt) => F (not(e(Evt1)) & not(e(Evt2)))', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 2597 | | cli_testcase(1343, [csp_test,assertions], ['../prob_examples/public_examples/CSP/other/Ivo/AlsoPatterns.csp', '-assertions', '-strict'], 'Testing enumerating of also patterns on channel data types.'). |
| 2598 | | cli_testcase(1344, [csp_test,assertions], ['../prob_examples/public_examples/CSP/other/Ivo/AParallel.csp', '-assertions', '-strict'], 'Testing pattern matching for alphabetised parallel operators.'). |
| 2599 | | cli_testcase(1345, [csp_test,assertions], ['../prob_examples/public_examples/CSP/other/Ivo/AParallel1.csp', '-assertions', '-strict'], 'Testing pattern matching for alphabetised parallel operators.'). |
| 2600 | | cli_testcase(1346, [csp_test,assertions], ['../prob_examples/public_examples/CSP/other/Andreas_Hense/P2P/p2p_v3.csp', '-assertions', '-strict'], 'Testing assertions in the CSP specification (for this specification ProB performs better than FDR2).'). |
| 2601 | | cli_testcase(1347, [csp_test], ['../prob_examples/public_examples/CSP/other/Andreas_Hense/ATM/ATM_v5.csp', '-t', '-strict'], ''). |
| 2602 | | cli_testcase(1348, [csp_test,assertions,records], ['../prob_examples/public_examples/CSP/other/Ivo/EnumeratingDataTypes.csp', '-assertions', '-strict'], 'Enumerating partial data type records.'). |
| 2603 | | cli_testcase(1349, [b_test,ltl], ['../prob_examples/public_examples/B/Ivo/Threads.mch', '-ltlassertions', |
| 2604 | | '-ltlformula', 'GF deadlock(Step1_p1,Step1_p2)', |
| 2605 | | '-ltlformula', 'G deterministic(Step1_p1,Sync)', |
| 2606 | | '-ltlformula', 'G(e(Step1_p2) or controller(Step1_p1,Sync))', |
| 2607 | | '-strict'], 'Covering the new APs (deadlock(...),deterministic(...), and controller(...)) of the LTL interpreter.'). |
| 2608 | | cli_testcase(1350, [cbc,tickets,cbc_tests], ['../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_mch.eventb', '-cbc_sequence', 'aload_R07' ], 'Check cbc sequence on example with partially enumerated sets'). |
| 2609 | | cli_testcase(1351, [tickets,data_validation], ['../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_CLPFD_Overflow/Machine_Bug3.mch', '-init', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '3500', |
| 2610 | | '-expcterrpos', type_error, 716, 48, |
| 2611 | | '-expecterr', 'bmachine_construction', |
| 2612 | | '-expcterrpos', 'bmachine_static_checks', 716, 0 % added this 15.12.2015 as we now also generate warning for length |
| 2613 | | ], 'Check abs DEFINITION error message works (and VAR hides constant)'). |
| 2614 | | cli_testcase(1352, [tickets,while,data_validation], ['../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_CLPFD_Overflow/Machine_Bug3_renamed.mch', |
| 2615 | | '-t', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '3500' ], 'Check no error in compiling While loop'). |
| 2616 | | cli_testcase(1353, [b_test], [ |
| 2617 | | '-evalt', '{x|x>99988844111111222200 & x<99988844111111222300 & x mod 20 = 1} = res & 2000 /: res & 99988844111111222201 : res', |
| 2618 | | '-eval', '{x|x>99988844111111222200 & x<99988844111111222300 & x mod 20 = 1}' |
| 2619 | | , '-evalt', '{x|x>ll & x<99988844111111222300 & x mod 20 = 9} = res & (ll=99988844111111222200 or ll = 99988844111111222201) & 99988844111111222209 : res' |
| 2620 | | , '-evalt', '{x|x>ll & x<99988844111111222300 & x mod 20 = 2} = res & 2000 /: res & 99988844111111222202 : res & (ll=99988844111111222200 or ll = 99988844111111222201)' |
| 2621 | | ], 'Check CLPFD Overflow is caught'). |
| 2622 | | cli_testcase(1354, [ltl], ['../prob_examples/public_examples/B/Ivo/HDCP/HDCP0_mch_mch.eventb','-ltllimit', 10000,'-ltlfile','../prob_examples/public_examples/B/Ivo/HDCP/HDCP0.ltl', '-strict'], 'Regression test for checking LTL formulas.'). |
| 2623 | | cli_testcase(1355, [ltl], ['../prob_examples/public_examples/B/Ivo/HDCP/HDCP1_mch_mch.eventb','-ltllimit', 10000,'-ltlfile','../prob_examples/public_examples/B/Ivo/HDCP/HDCP1.ltl', '-strict'], 'Regression test for checking LTL formulas.'). |
| 2624 | | cli_testcase(1356, [cbc,cbc_tests], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-cbc_tests', 4, '1=1', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_cbc_tests.xml', '-expcterr', 'cbc_tests'], 'Check that full coverage cannot be achieved'). |
| 2625 | | cli_testcase(1357, [cbc,cbc_tests,enabling], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-cbc_tests', 5, '1=1', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_cbc_tests.xml', '-feasibility_analysis'], 'Check that full coverage can be achieved'). |
| 2626 | | cli_testcase(1358, [cbc,enabling], ['../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition.eventb', |
| 2627 | | '-p', 'TIME_OUT', 3000, |
| 2628 | | '-feasibility_analysis_csv', 1500, |
| 2629 | | '../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition_feasibility.csv'], 'Check feasibility analysis works'). |
| 2630 | | cli_testcase(1359, [cbc,tickets], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/SeqTest/SeqTest_ctx.eventb', '../prob_examples/public_examples/EventBPrologPackages/Tickets/SeqTest/SeqTest3_ctx.eventb', |
| 2631 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/SeqTest/SortRecFunction_ctx.eventb', |
| 2632 | | '-p', 'MAXINT', '3', '-t' ,'-assertions'], 'Check no enumeration warning'). |
| 2633 | | cli_testcase(1360, [cbc,enabling], ['../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck.mch', |
| 2634 | | '-opterr', 'clpfd_overflow', |
| 2635 | | '-feasibility_analysis_csv', 750,'../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck_feasibility.csv'], 'Check feasibility analysis works'). |
| 2636 | | cli_testcase(1361, [ctl,tickets], ['../prob_examples/public_examples/B/LTL/MammarFrappier/FlightSystem_corrected_3_3.mch', |
| 2637 | | '-expcterrpos', 'bmachine_static_checks', 65, 4, % forall rhs does not use ids |
| 2638 | | '-ctlformula', 'AG({Customers1|->Flights1 /: tickets} => EF({Customers1|->Flights1 : tickets}))', |
| 2639 | | '-ltllimit', 100, '-expcterr', 'ctl_incomplete', '-expcterr', 'state_space', |
| 2640 | | '-p', 'STRICT_RAISE_WARNINGS', 'TRUE'], 'Check that incomplete CTL model check detected'). |
| 2641 | | cli_testcase(1362, [ctl,tickets], ['../prob_examples/public_examples/B/LTL/MammarFrappier/FlightSystem_corrected_3_3.mch', |
| 2642 | | '-expcterrpos', 'bmachine_static_checks', 65, 4, % forall rhs does not use ids |
| 2643 | | '-ctlformulat', 'AG({Customers1|->Flights1 /: tickets} => EF({Customers1|->Flights1 : tickets}))', |
| 2644 | | '-p', 'STRICT_RAISE_WARNINGS', 'TRUE', '-cc', 2199, 15212], 'Check that CTL model check works without ltllimit'). |
| 2645 | | cli_testcase(1363, [ctl], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', |
| 2646 | | '-p', 'MAXINT', 20, |
| 2647 | | '-ctlformulaf', 'AG({c<mx})', '-his', '../prob_examples/public_examples/B/Simple/UpCounter_his.txt', '-his_option','show_states' |
| 2648 | | ], 'Check that CTL model check works without ltllimit'). |
| 2649 | | cli_testcase(1364, [ctl], ['../prob_examples/public_examples/B/Demo/scheduler.mch', |
| 2650 | | '-p', 'DEFAULT_SETSIZE', '3', |
| 2651 | | '-ctlformulaf', 'AG {active={} or ready = {} or waiting ={}}', '-bf', '-mc', 9999, '-his', '../prob_examples/public_examples/B/Demo/scheduler_his.txt', '-his_option','show_states' |
| 2652 | | ], 'Check that CTL model check generates correct counter example'). |
| 2653 | | cli_testcase(1365, [ctl], ['../prob_examples/public_examples/B/Demo/scheduler.mch', |
| 2654 | | '-ctlformulat', 'AG({card(ready)>1} => EF {card(active)>0})', |
| 2655 | | '-ctlformulat', 'AG EF {active = {}}', |
| 2656 | | '-ctlformulat', 'EG {active = {}}', |
| 2657 | | '-p', 'DEFAULT_SETSIZE', '3' |
| 2658 | | ], 'Check CTL formulas'). |
| 2659 | | cli_testcase(1366, [cbc, cbc_tests,bmc], ['../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2.mch', '-bmc', 50, '-his', '../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2_his.txt', '-his_option','show_states', |
| 2660 | | '-expcterr', 'invariant_violation'], 'Check BMC works'). |
| 2661 | | cli_testcase(1367, [cbc,tickets,bmc], ['../prob_examples/public_examples/B/Tickets/OpCallModifiesInfo/OpCallModifiesInfo.mch', '-bmc', 5, |
| 2662 | | '-expcterr', 'invariant_violation'], 'Check Modifies Info correct for operation calls'). |
| 2663 | | cli_testcase(1368, [cbc,tickets], ['../prob_examples/public_examples/B/Tickets/ComponentPartitioning/ManyPartialFunctions.mch', '-init', |
| 2664 | | '-p', 'DEFAULT_SETSIZE', 5], 'Check component partition works with equality inlining'). |
| 2665 | | cli_testcase(1369, [b_test,tla,tlc],['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-mc_with_tlc'], 'TLC regression test'). |
| 2666 | | cli_testcase(1370, [cbc,cbc_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/Aymerick/CBC_M_mch.eventb', '-cbc_tests', 4, '', '', '-expcterr', 'cbc_tests'], 'Check that full coverage cannot be achieved and no exceptions'). |
| 2667 | | cli_testcase(1371, [cbc,cbc_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/Aymerick/CBC_M_mch.eventb', '-cbc_tests', 4, '', '', '-cbc_cover_match', 'c'], 'Check that cbc_cover_match option works'). |
| 2668 | | cli_testcase(1372, [b_test], ['../prob_examples/public_examples/B/Mathematical/FormaleSprachen.mch', |
| 2669 | | '-p', 'SMT', 'TRUE', |
| 2670 | | '-init','-assertions', '-strict'], 'Test 1264 but with SMT mode.'). |
| 2671 | | cli_testcase(1373, [private,codespeed,data_validation], ['../prob_examples/examples/B/Alstom/vesg_Aug11/gradient_train_altitude.mch', |
| 2672 | | '-animate', 5, '-p', 'TIME_OUT', 300000000, '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-p', 'CLPFD', 'FALSE'], 'Test Alstom example'). |
| 2673 | | cli_testcase(1374, [tickets,card], [ |
| 2674 | | '-evalf', 'n:0..4 & m=6 & not(((((card((1 .. n <-> 5 .. m) \\/ {{0 |-> 0}}) = 1 + card(1 .. n <-> 5 .. m) & card((1 .. n +-> 5 .. m) \\/ {{0 |-> 0}}) = 1 + card(1 .. n +-> 5 .. m)) & card((1 .. n --> 5 .. m) \\/ {{0 |-> 0}}) = 1 + card(1 .. n --> 5 .. m)) & card((1 .. n >+> 5 .. m) \\/ {{0 |-> 0}}) = 1 + card(1 .. n >+> 5 .. m)) & card((1 .. n >-> 5 .. m) \\/ {{0 |-> 0}}) = 1 + card(1 .. n >-> 5 .. m)) & card((1 .. n -->> 5 .. m) \\/ {{0 |-> 0}}) = 1 + card(1 .. n -->> 5 .. m))'], |
| 2675 | | 'Test that no choice points due to add_element'). |
| 2676 | | cli_testcase(1375, [cbc, cbc_tests, tickets,bmc], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/VerySimpleCounterWrong.mch', '-bmc', 6, |
| 2677 | | '-expcterr', 'invariant_violation'], 'Check BMC works'). |
| 2678 | | cli_testcase(1376, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/02_001_adapted.mch', |
| 2679 | | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', 155000, |
| 2680 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check performance (previously part of 1162)'). |
| 2681 | | cli_testcase(1377, [private,data_validation,cse_test], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.mch', '-animate_all', '-strict', '-cc', 49, 48, '-p', 'TIME_OUT', 35000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, |
| 2682 | | '-p', 'MAX_OPERATIONS', 1, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.his', '-sptxt', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.sptxt', '-expcterr', invariant_violation, '-p', 'CSE', 'TRUE'], 'Rule Test 4 of Alstom compilation project with CSE'). % Signal_Overlap_SDDBs is non-deterministic: hence MAX_OPERATIONS 1 |
| 2683 | | cli_testcase(1378, [private,data_validation,cse_test], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori.mch', '-animate_all', '-strict', '-cc', 40, 39, '-p', 'TIME_OUT', 35000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori.his', '-p', 'CSE', 'TRUE'], 'Rule Test 5 of Alstom compilation project with CSE'). |
| 2684 | | cli_testcase(1379, [private,data_validation,cse_test], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori.mch', '-animate_all', '-strict', '-cc', 97, 96, '-p', 'TIME_OUT', 28000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori.his', '-p', 'CSE', 'TRUE'], 'Rule Test 1 of Alstom compilation project (test 981) with CSE'). |
| 2685 | | cli_testcase(1380, [private,data_validation,alstom,cse_test], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_ESA_TRIGGER_0009_ori.mch', '-strict', '-cc', 112, 111, '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-t', '-p', 'CSE', 'TRUE'], 'Rule Test 2 of Alstom compilation project with CSE'). |
| 2686 | | cli_testcase(1381, [tickets,cse_test], ['../prob_examples/public_examples/B/Tickets/CSE/BoolValue.mch', |
| 2687 | | '../prob_examples/public_examples/B/Tickets/CSE/ExplicitComputations_Reduced.mch', |
| 2688 | | '-init', '-p', 'CSE', 'TRUE'], 'Check sharing of predicates works'). |
| 2689 | | cli_testcase(1382, [cbc, disprover], ['../prob_examples/examples/B/Alstom/DisproverProject/prob13265_hyp_removed.mch', |
| 2690 | | '-cbc_assertions', '-p', 'MAX_INITIALISATIONS', 0], 'Check partitioning for cbc_assertions works'). |
| 2691 | | cli_testcase(1383, [tickets, external,data_validation], ['../prob_examples/examples/B/Alstom/Ticket_Dec08_2014/Segment_refAdhesionLevel_GER5.mch', |
| 2692 | | '-t', '-sptxt', '../prob_examples/examples/B/Alstom/Ticket_Dec08_2014/Segment_refAdhesionLevel_GER5_sptxt.txt'], 'Check join works in conjunction with perm with paritally instantiated lists'). |
| 2693 | | cli_testcase(1384, [cbc,sigma,card], [ |
| 2694 | | '-evalt', '{y|SIGMA(x).(x:1..10 & x mod 5 = 0|x+y) = 215} = {100}', |
| 2695 | | '-evalt', '{y|PI(x).(x:1..10 & x mod 5 = 0|x+y) = 66} = {-16,1}', |
| 2696 | | '-evalt', 'SIGMA(x).(x:{y} \\/ {z}|x) = 10 & y>z & z>0', |
| 2697 | | '-evalt', '{y,z|SIGMA(x).(x:{y} \\/ {z}|x+3) = 10 & y>z & z>0} = {(3,1)}', |
| 2698 | | '-evalt', 'SIGMA(i).(i:1..1000|i)=500500', |
| 2699 | | '-evalt', 'SIGMA(i).(i:0..1000|i)=500500', |
| 2700 | | '-evalt', 'SIGMA(i).(i:-2..1000|i)=500497', |
| 2701 | | '-evalt', 'SIGMA(i).(i:-3..1000|i)=500494', |
| 2702 | | '-evalt', 'SIGMA(i).(i:-2..-3|i)=0', |
| 2703 | | '-evalt', '{y,m|PI(x).(x:1..3|x+y) = m & m:25..100} = {(2,60)}', |
| 2704 | | '-evalt', 'x = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o] & SIGMA(i).(i:dom(x)|x(i))=124 & !j.(j:2..size(x) => x(j-1)<x(j)) & a>0', |
| 2705 | | '-evalf', 's:seq(NATURAL1) & size(s)=220 & SIGMA(i).(i:1..size(s)|s(i)) = 200', |
| 2706 | | '-evalf', 'x = SIGMA(i).(i:1..n|i) & x<0', |
| 2707 | | '-evalt', 'x = SIGMA(i).(i:1..n|i) & n>1 & x = 5050', |
| 2708 | | '-evalt', '{n|5050 = SIGMA(i).(i:1..n|i)} = {100}', |
| 2709 | | '-evalf', 'x = SIGMA(i).(i:1..n|i) & n>100 & x < 5151', |
| 2710 | | '-evalt', '{x,n|x = SIGMA(i).(i:-3..n|i) & n>1 & x < 5150 & x>5100} = {(5145,101)}', |
| 2711 | | '-evalf', 's = [x,10,y] & PI(i).(i:dom(s)|s(i)) = r & x>0 & y>0 & r<10', |
| 2712 | | '-evalt', 's<:11..15 & card(s)<3 & SIGMA(x).(x:s|x)=23' |
| 2713 | | ], 'Check constraint propagation of SIGMA / PI work better now'). |
| 2714 | | cli_testcase(1385, [cbc,sigma], ['../prob_examples/public_examples/B/Puzzles/Minesweeper.mch', |
| 2715 | | '../prob_examples/public_examples/B/Puzzles/Minesweeper_v2.mch', |
| 2716 | | %'../prob_examples/public_examples/B/Puzzles/Minesweeper_v3.mch', still time-out |
| 2717 | | '../prob_examples/public_examples/B/Puzzles/Minesweeper_v4.mch', |
| 2718 | | '-init', '-cbc_assertions'], 'Check this version with SIGMA can be solved efficiently'). |
| 2719 | | cli_testcase(1386, [cbc,atelierb], ['../prob_examples/examples/B/Alstom/DisproverProject/FalsePO1.mch', |
| 2720 | | '-cbc_assertions', '-expecterr', 'cbc_assertions', '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). |
| 2721 | | cli_testcase(1387, [cbc,atelierb,chr], ['../prob_examples/examples/B/Alstom/DisproverProject/TimeOutPO1.mch', |
| 2722 | | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2723 | | '-cbc_assertions', |
| 2724 | | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). |
| 2725 | | cli_testcase(1388, [cbc,atelierb,chr], ['../prob_examples/examples/B/Alstom/DisproverProject/TruePO1.mch', |
| 2726 | | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2727 | | '-cbc_assertions', |
| 2728 | | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). |
| 2729 | | cli_testcase(1389, [cbc,atelierb,chr], ['../prob_examples/examples/B/Alstom/DisproverProject/DeferredSetPO1.mch', |
| 2730 | | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2731 | | '-cbc_assertions', |
| 2732 | | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). |
| 2733 | | /* does not work yet: |
| 2734 | | cli_testcase(1382, [private, tickets, recursion,slot,cse, unsat_core], ['../prob_examples/examples/B/SlotTool/SlotTool_19092014/SlotSolver.mch', |
| 2735 | | '-init', '-assertions', '-p', 'CSE', 'TRUE' |
| 2736 | | ], 'Ensure complicated unsat core computations keep on working with CSE TRUE (SLOT-24)'). |
| 2737 | | */ |
| 2738 | | cli_testcase(1390, [tickets], [ |
| 2739 | | '-evalu', '({1}*INTEGER)=f & res = f[{1}] & res=MININT..MAXINT', '-expcterr', eval_string_enum_warning], |
| 2740 | | 'Check that we do not report this as true / false'). |
| 2741 | | cli_testcase(1391, [tickets,proz], ['../prob_examples/public_examples/Z/Daniel/Praxis/network2.fuzz', |
| 2742 | | '../prob_examples/public_examples/Z/Daniel/scheduler.fuzz', |
| 2743 | | '../prob_examples/public_examples/Z/Daniel/SudokuSETS9.fuzz', |
| 2744 | | '../prob_examples/public_examples/Z/Daniel/watergate.fuzz', |
| 2745 | | '-t'], |
| 2746 | | 'Ensure no pending co-routines for instantiation of freetype value (network2)'). |
| 2747 | | cli_testcase(1392, [cbc,sigma], [ |
| 2748 | | '-evalt', 'r = {s1,s2| SIGMA(i).(i:s1|i) = SIGMA(j).(j:s2|j)} & {x,y}|->{10}:r & {6}|->{x}:r', |
| 2749 | | '-evalt', 'r = {s1,s2| SIGMA(i).(i:s1|i) = SIGMA(j).(j:s2|j)} & {x,y|{x,y}|->{10}:r & {6}|->{x}:r} = {(6,4)}', |
| 2750 | | '-evalf', '{x,y}=s & {v,w,z}=r & s<:r & r<:11..14 & SIGMA(i).(i:s|i) > SIGMA(j).(j:r|j)' % already worked before |
| 2751 | | ], 'Check that we can find a solution : choice point enumerated before enumerating y'). |
| 2752 | | cli_testcase(1393, [tickets,slot,codespeed], ['../prob_examples/public_examples/B/Tickets/SLOT-PERFORMANCE3_no_print/WiWiSolver.mch', |
| 2753 | | '-init', % '-v', % generates non-ground closure warnings |
| 2754 | | '-evalt', '{x,s,y| x:MAJORS & s : 1..6 & y = bool(CHECK_P_WP_SEMESTER(x, s))} = {((bwl_bachelor|->1)|->TRUE),((bwl_bachelor|->2)|->TRUE),((bwl_bachelor|->3)|->FALSE),((bwl_bachelor|->4)|->FALSE),((bwl_bachelor|->5)|->FALSE),((bwl_bachelor|->6)|->TRUE),((bwl_master|->1)|->FALSE),((bwl_master|->2)|->FALSE),((bwl_master|->3)|->FALSE),((bwl_master|->4)|->TRUE),((bwl_master|->5)|->TRUE),((bwl_master|->6)|->TRUE),((vwl_bachelor|->1)|->TRUE),((vwl_bachelor|->2)|->TRUE),((vwl_bachelor|->3)|->FALSE),((vwl_bachelor|->4)|->FALSE),((vwl_bachelor|->5)|->TRUE),((vwl_bachelor|->6)|->TRUE),((vwl_master|->1)|->FALSE),((vwl_master|->2)|->TRUE),((vwl_master|->3)|->FALSE),((vwl_master|->4)|->TRUE),((vwl_master|->5)|->TRUE),((vwl_master|->6)|->TRUE),((wichem_bachelor|->1)|->TRUE),((wichem_bachelor|->2)|->TRUE),((wichem_bachelor|->3)|->TRUE),((wichem_bachelor|->4)|->TRUE),((wichem_bachelor|->5)|->FALSE),((wichem_bachelor|->6)|->FALSE),((wichem_master|->1)|->TRUE),((wichem_master|->2)|->FALSE),((wichem_master|->3)|->TRUE),((wichem_master|->4)|->TRUE),((wichem_master|->5)|->TRUE),((wichem_master|->6)|->TRUE)}' |
| 2755 | | ], 'Ensure no time-out due to total-function setup too late'). |
| 2756 | | cli_testcase(1394, [tickets,alstom,private,codespeed,union,data_validation], ['../prob_examples/examples/B/Alstom/ixl/lausanne.mch', '-t', |
| 2757 | | '-p', 'TIME_OUT', 5000], 'Ensure no time-out due to rel_compose calling union without WF'). |
| 2758 | | cli_testcase(1395, [cbc, symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/DefSetWithConstantsTest2.mch', '-init', |
| 2759 | | '-expecterr', 'setup_constants_fails', '-p', 'TIME_OUT', '9000'], 'Ensure static symmetry reduction works'). |
| 2760 | | cli_testcase(1396, [cbc, symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/DefSetWithConstantsTest3.mch', '-mc', 9999, '-nodead', |
| 2761 | | '-cc', 19, 18 ], 'Ensure static symmetry reduction works'). |
| 2762 | | cli_testcase(1397, [cbc, forall], ['../prob_examples/public_examples/B/Puzzles/HandshakeSimple_TotFun.mch', '-mc', 1000, '-nodead', '-assertions', '-expcterr', 'model_check_incomplete' ], 'Ensure forall quantifier also uses contrapositive'). |
| 2763 | | cli_testcase(1398, [cbc, symmetry_test,cbc_tests], ['../prob_examples/public_examples/B/SymmetryReduction/DefSetWithConstantsTest2.mch', '-cbc_sequence', '', |
| 2764 | | '-expecterr', 'cbc_sequence_no_solution_found'], 'Ensure static symmetry reduction works'). |
| 2765 | | |
| 2766 | | cli_testcase(1399, [cbc], [ |
| 2767 | | '-evalf', 'v0 = (x0 - x2) & v1 = (x1 - x2) & v2 = (x0 - x1) & v0 <= 1 & v0 >= 0 & v1 <= 1 & v1 >= 0 & not(x0 = x1) & not(v2 = 1) & not(v2 = -1) & v2+v1=v0' |
| 2768 | | ], 'Check that we can detect inconsistency without enum warning'). % requires propagate_zero in clpfd_interface; variation of toroidal queens 2 with v2+v1=v0 added for CLPFD |
| 2769 | | cli_testcase(1400, [cbc,disprover,chr], [ |
| 2770 | | '-evalf', 'v0 = (x0 - x2) & v1 = (x1 - x2) & v2 = (x0 - x1) & v0 <= 1 & v0 >= 0 & v1 <= 1 & v1 >= 0 & not(x0 = x1) & not(v2 = 1) & not(v2 = -1)', |
| 2771 | | '-evalf' , 'not(v2=1) & v0 = (x0 - x2) & v1+x2 = (x1) & v2+x1 = (x0) & v0:0..1 & v1:0..1 & not(x0 = x1) & not(v2 = -1)', |
| 2772 | | '-p', 'CHR', 'TRUE' |
| 2773 | | ], 'Check that we can detect inconsistency without enum warning'). % requires propagate_zero in clpfd_interface + IDL CHR rules; derived from toroidal queens 2 SMT benchmark |
| 2774 | | |
| 2775 | | cli_testcase(1401, [tickets,csp_test,cspb,sequences], ['../prob_examples/public_examples/CSPB/Tickets/PROB-369/BufferSpec2.fuzz', '-csp-guide', '../prob_examples/public_examples/CSPB/Tickets/PROB-369/BufferSpec2.csp', '-mc', '100', '-strict', '-t', |
| 2776 | | '-evalt', '-2 mod 3 = 1'], 'Check synchronisation with sequence type works and z minor mode set for modulo (PROB-368, PROB-369, PROB-371)'). |
| 2777 | | cli_testcase(1402, [cbc,atelierb,chr,disprover,private], ['../prob_examples/examples/B/Alstom/DisproverProject/TruePO1_Taut.mch', |
| 2778 | | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2779 | | '-cbc_assertions_tautology_proof', |
| 2780 | | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). |
| 2781 | | cli_testcase(1403, [cbc,smt,chr], [ |
| 2782 | | %'../prob_examples/public_examples/SMT/QF_IDL/queens_bench/n_queen/queen3-1.smt2', % Virtual Timeout |
| 2783 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/n_queen/queen8-1.smt2', |
| 2784 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/n_queen/queen10-1.smt2', |
| 2785 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/n_queen/queen20-1.smt2', |
| 2786 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/toroidal_bench/toroidal_queen2-1.smt2', |
| 2787 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/toroidal_bench/toroidal_queen3-1.smt2', |
| 2788 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/toroidal_bench/toroidal_queen5-1.smt2', |
| 2789 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/super_queen/super_queen10-1.smt2', |
| 2790 | | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/super_queen/super_queen20-1.smt2', |
| 2791 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER1-1-ninc.smt2', |
| 2792 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER1-2-ninc.smt2', |
| 2793 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER2-1-ninc.smt2', |
| 2794 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER2-2-ninc.smt2', |
| 2795 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER2-3-ninc.smt2', |
| 2796 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER3-1-ninc.smt2', |
| 2797 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER3-2-ninc.smt2', |
| 2798 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER3-3-ninc.smt2', |
| 2799 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER3-4-ninc.smt2', |
| 2800 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER4-1-ninc.smt2', |
| 2801 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER4-2-ninc.smt2', |
| 2802 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER5-2-ninc.smt2', |
| 2803 | | '../prob_examples/public_examples/SMT/QF_IDL/mathsat/fischer/FISCHER12-2-ninc.smt2', |
| 2804 | | '-p', 'CHR', 'TRUE', '-p', 'SMT', 'TRUE'], 'Test SMT interface and solving'). |
| 2805 | | % |
| 2806 | | |
| 2807 | | cli_testcase(1404, [ltl], ['../prob_examples/public_examples/EventBPrologPackages/ABZ_Landing_Gear/Ref4_ControllerHandle_mch.eventb', '-mc', 99999, '-cc' , 8629, 41811, |
| 2808 | | '-ltlformula', 'G (deterministic(con_stop_stimulate_extend_gear_valve,con_stimulate_extend_gear_valve,con_stop_stimulate_retract_gear_valve,con_stimulate_retract_gear_valve,con_stop_stimulate_close_door_valve,con_stimulate_close_door_valve,con_stop_stimulate_open_door_valve,con_stimulate_open_door_valve))' |
| 2809 | | ], 'Check LTL pattern deterministic'). |
| 2810 | | cli_testcase(1405, [dot], ['../prob_examples/public_examples/B/Simple/VerySimpleDFA.mch', '-bf', '-mc', 1000, '-strict', '-dotexpr', transition_diagram, 's', |
| 2811 | | '../prob_examples/public_examples/B/Simple/VerySimpleDFA_transition_diagram.dot', |
| 2812 | | '-p', 'DOT_LOOPS', 'FALSE' % added 7/11/2023 |
| 2813 | | ],'Check Transition Diagram for Expression.'). |
| 2814 | | cli_testcase(1406, [b_test,cbc,atelierb,disprover], ['-cbc_assertions_tautology_proof', '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'ALLOW_UNTYPED_IDENTIFIERS', 'TRUE', |
| 2815 | | '-expcterr', 'cbc_assertions_enumeration_warning', |
| 2816 | | '../prob_examples/examples/B/Alstom/DisproverProject/TypingIssues/prob17066_not_provable.mch' |
| 2817 | | ], 'Check ProB finds no counter example for rule and no proof'). |
| 2818 | | cli_testcase(1407, [b_test,cbc,atelierb,disprover], ['-cbc_assertions_tautology_proof', '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'ALLOW_UNTYPED_IDENTIFIERS', 'TRUE', |
| 2819 | | '../prob_examples/examples/B/Alstom/DisproverProject/TypingIssues/prob17066_provable.mch' |
| 2820 | | ], 'Check ProB finds no counter example for rule and no proof'). |
| 2821 | | |
| 2822 | | cli_testcase(1408, [cbc,sigma], [ |
| 2823 | | '-evalt', 'x+y+z+v=40 & x<y & y<z & z<v &x>0 & all = {x,y,z,v} & gen = {a1,a2,a3,r| a1\\/a2\\/a3=all & a1/\\a2={} & a2/\\a3={} & a1/\\a3={} & r=SIGMA(t1).(t1:a1|t1)-SIGMA(t2).(t2:a2|t2)} & 1..40 <: ran(gen)', % Stones Puzzle |
| 2824 | | '-evalt' , 'all = {1,2,4} & gen = {a1,a2,r| a1\\/a2=all & a1/\\a2={} & r=SIGMA(t1).(t1:a1|t1)+SIGMA(t2).(t2:a2|t2)}' |
| 2825 | | ], 'Check that partition propagates well (no enum warning)'). |
| 2826 | | |
| 2827 | | cli_testcase(1409, [cbc,disprover,private], [ |
| 2828 | | '../prob_examples/public_examples/ProofObligations/GearDoor1_mch.pl', |
| 2829 | | '../prob_examples/public_examples/ProofObligations/GearsDoorsHandle3_mch.pl', |
| 2830 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M2_mch.pl', |
| 2831 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M20_mch.pl', |
| 2832 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M3_mch.pl', |
| 2833 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M30_mch.pl', |
| 2834 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m1_true.pl', |
| 2835 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m2_mch.pl', |
| 2836 | | '-p', 'DOUBLE_EVALUATION', 'FALSE' |
| 2837 | | %,'../prob_examples/examples/ProofObligations/ABZ14_Mery/M4_mch.pl' |
| 2838 | | ],'Check Disprover can prove all POs'). |
| 2839 | | cli_testcase(1410, [cbc,disprover,private], [ |
| 2840 | | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_1_true.pl', |
| 2841 | | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_3_true.pl', |
| 2842 | | '-p', 'DOUBLE_EVALUATION', 'FALSE' |
| 2843 | | ],'Check Disprover can prove all POs; this test also checks register predicate works better'). |
| 2844 | | cli_testcase(1411, [cbc,disprover], [ |
| 2845 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest2_ctx.pl', |
| 2846 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest3_ctx.pl', |
| 2847 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest4_ctx.pl', |
| 2848 | | '-check_disprover_result', 0,0,2, |
| 2849 | | '-p', 'DOUBLE_EVALUATION', 'FALSE' |
| 2850 | | ],'Check Disprover cannot prove po'). |
| 2851 | | cli_testcase(1412, [cbc,random,sigma], [ |
| 2852 | | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', |
| 2853 | | '-evalt', 'x:1..20 --> 1..100 & SIGMA(v).(v:1..20|x(v)) = 20*50' |
| 2854 | | % without random we get x = [100,100,100,100,100,100,100,100,100,90,1,1,1,1,1,1,1,1,1,1] |
| 2855 | | % with it: e.g., x = [46,29,99,5,2,61,100,49,46,23,8,61,37,100,99,29,98,8,5,95] |
| 2856 | | ],'Check random enumeration'). |
| 2857 | | cli_testcase(1413, [cbc,chr,disprover], [ |
| 2858 | | '-p', 'CHR', 'TRUE', |
| 2859 | | '-evalf', 'xx>0 & xx+1 <= p & xx=p' |
| 2860 | | %'-evalf', 'xx>0 & xx+2 <= p & xx=p' % does not work yet |
| 2861 | | ],'Check CHR propagation'). |
| 2862 | | cli_testcase(1414, [b_test,cbc,atelierb,disprover,private], ['-cbc_assertions_tautology_proof', '-p', 'DISPROVER_MODE', 'TRUE', |
| 2863 | | '-p', 'CHR', 'TRUE', '-p', 'CSE', 'TRUE', |
| 2864 | | %'../prob_examples/examples/B/Alstom/DisproverProject/ProvableByPP/prob9313.mch', % does not work yet |
| 2865 | | '../prob_examples/examples/B/Alstom/DisproverProject/ProvableByPP/prob9313_1.mch' |
| 2866 | | ], 'Check ProB finds proof'). |
| 2867 | | cli_testcase(1415, [cbc,random], [ |
| 2868 | | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', |
| 2869 | | '../prob_examples/public_examples/B/FeatureChecks/RandomEnumeration.mch', |
| 2870 | | '-init', '-assertions' |
| 2871 | | ],'Check random enumeration'). |
| 2872 | | cli_testcase(1416, [b_test], ['../prob_examples/public_examples/B/ErrorMachines/ImplicationPriority.mch','-expcterr',bmachine_static_checks, '-init'], 'Test warning thrown for strange PROPERTIES clause.'). |
| 2873 | | cli_testcase(1417, [cbc,card], ['../prob_examples/public_examples/B/PerformanceTests/SetMultipleSolutions.mch', '-mc', 100, '-nodead'], 'Test no max-reached warning (improvement to cardinality_as_int1 which avoids unordered enumeration).'). |
| 2874 | | cli_testcase(1418, [cbc,sigma,card], [ |
| 2875 | | '-evalf', 'card(s)=5 & card(r)=3 & SIGMA(x).(x:r|x)=SIGMA(y).(y:s|y) & s<:0..16 & r<:s', |
| 2876 | | '-evalt', 'card(x)=10 & !y.(y:x & y<50 => y+1:x) & x<:1..50', |
| 2877 | | '-evalt', '{x|card(x)=10 & !y.(y:x & y<50 => y+1:x) & x<:1..50} = {41..50}', |
| 2878 | | '-evalt', '{x|card(x)=50 & !y.(y:x & y<50 => y+1:x) & x<:1..50} = {1..50}', |
| 2879 | | '-evalt', '{x|card(x)=150 & !y.(y:x & y<50 => y+1:x) & x<:1..50} = {}', |
| 2880 | | '-evalt', 'card(x)=10 & !(y,z).(y|->z:x & y<50 => y+1|->z:x) & x<:(1..50)*{TRUE}', |
| 2881 | | '-evalt', 'card(x)=10 & !(y).(y:x & y\'f1<50 => rec(f1:y\'f1+1):x) & x<:struct(f1:1..50)', |
| 2882 | | '-evalt', 'card(x)=10 & !(y,z).(y|->z:x & y<50 => y+1|->z:x) & x<:(1..50)*{"A","B"}' |
| 2883 | | % slow:'-evalt', 'card(x)=10 & !(y).(y:x & y\'f1<50 => rec(f1:y\'f1+1,f2:y\'f2):x) & x<:struct(f1:1..50,f2:BOOL)' |
| 2884 | | % also slow: card(x)=10 & !(y).(y:x & prj1(INTEGER,BOOL)(y)<50 => (prj1(INTEGER,BOOL)(y)+1,TRUE):x) & x<:(1..50)*BOOL |
| 2885 | | % fast: card(x)=10 & !(y).(y:x & prj1(INTEGER,BOOL)(y)<50 => (prj1(INTEGER,BOOL)(y)+1,prj2(INTEGER,BOOL)(y)):x) & x<:(1..50)*BOOL |
| 2886 | | % slow card(x)=4 & !(y).(y:x & y'f2<50 => rec(f2:y'f2+1,f1:y'f1):x) & x<:struct(f2:1..50,f1:BOOL) |
| 2887 | | % slow : card(x)=10 & !(y,z).(z|->y:x => ( y<50 => z|->y+1:x)) & x<:BOOL*(1..50) |
| 2888 | | ], 'Test this is solved quickly using new ordered_value check for card.'). |
| 2889 | | cli_testcase(1419, [cbc,card], [ '-p', 'SMT', 'TRUE', |
| 2890 | | '-evalt', 'card(x)=1 & !(y).(y:x & y\'f1<50 => rec(f1:y\'f1+1,f2:y\'f2):x) & x<:struct(f1:1..50,f2:BOOL)', |
| 2891 | | '-evalt', 'card(x)=10 & !(y).(y:x & y\'f1<50 => rec(f1:y\'f1+1,f2:y\'f2):x) & x<:struct(f1:1..50,f2:{TRUE})', |
| 2892 | | '-evalt', 'card(x)=1 & !(y).(y:x & prj1(INTEGER,BOOL)(y)<50 => (prj1(INTEGER,BOOL)(y)+1,TRUE):x) & x<:(1..50)*BOOL' |
| 2893 | | ], 'Test this is solved quickly using new ordered_value check for card & avoid bug in expand all quantifeir.'). |
| 2894 | | cli_testcase(1420, [tickets,sigma], [ |
| 2895 | | '-evalt', 'Z={((((1|->1)|->-59843)|->-57163)),((((2|->1)|->-57163)|->-56910))} & r=SIGMA(a,b,c,d).((a,b,c,d):Z|d-c)' |
| 2896 | | ], 'Test issue with Sigma/Pi for multiple variables'). |
| 2897 | | cli_testcase(1421, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/InfiniteAndFiniteCounterCorrect.mch', '-symbolic_model_check', 'ic3'], 'Contains Finite and Infinite Counter'). |
| 2898 | | cli_testcase(1422, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/InfiniteAndFiniteCounterWrong.mch', '-symbolic_model_check', 'ic3', '-expcterr', 'invariant_violation'], 'Contains Finite and Infinite Counter + Invariant Violation'). |
| 2899 | | cli_testcase(1423, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/InfiniteCounter.mch', '-symbolic_model_check', 'ic3'], 'Contains Infinite Counter'). |
| 2900 | | cli_testcase(1424, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/VerySimpleCounter.mch', '-symbolic_model_check', 'ic3'], 'Simple Counter'). |
| 2901 | | cli_testcase(1425, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/VerySimpleCounterWrong.mch', '-symbolic_model_check', 'ic3', '-expcterr', 'invariant_violation'], 'Simple Counter + Invariant Violation'). |
| 2902 | | cli_testcase(1426, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/VerySimpleCounterWrongLargeBranching.mch', '-symbolic_model_check', 'ic3', '-expcterr', 'invariant_violation'],'Simple Counter with large branching factor'). |
| 2903 | | cli_testcase(1427, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/InitTriesToAssignConstant.mch', '-t', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check that we detect when we assign a constant in the INITIALISATION'). |
| 2904 | | cli_testcase(1428, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Bakery0.mch', '-symbolic_model_check', 'ic3'], 'Bakery Model without Invariant Violation'). |
| 2905 | | cli_testcase(1429, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Bakery0Wrong.mch', '-symbolic_model_check', 'ic3', '-expcterr', 'invariant_violation'], 'Bakery Model with Invariant Violation'). |
| 2906 | | cli_testcase(1430, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsNatural.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets with Natural sets mixed'). |
| 2907 | | cli_testcase(1431, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2_VariablesEvenMoreLimited.mch', '-symbolic_model_check', 'ic3', '-expcterr', 'invariant_violation'], 'Invariant Violation, Variables limited to finite sets'). |
| 2908 | | cli_testcase(1432, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v3_VariablesLimited.mch', '-symbolic_model_check', 'ic3'], 'No Invariant Violation, Variables limited to finite sets'). |
| 2909 | | cli_testcase(1433, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2.mch', '-symbolic_model_check', 'ic3', '-expcterr', 'model_check_incomplete'], 'Negative Test: Currently the solvers are too weak for this test.'). |
| 2910 | | cli_testcase(1434, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v3.mch', '-symbolic_model_check', 'ic3', '-expcterr', 'model_check_incomplete'], 'Negative Test: Currently the solvers are too weak for this test.'). |
| 2911 | | cli_testcase(1435, [cbc, symmetry_test,card], ['../prob_examples/public_examples/B/CBC/GraphMining_RunningExample_Unsat.mch', '-init', '-expcterr', 'setup_constants_fails', |
| 2912 | | '-opterr', 'setup_constants_inconsistent'], 'Test odered set symmetry breaking works with card(S)>Nr constraint.'). |
| 2913 | | cli_testcase(1436, [cbc,disprover,private], [ |
| 2914 | | '../prob_examples/public_examples/ProofObligations/GearDoor1_mch.pl', |
| 2915 | | '../prob_examples/public_examples/ProofObligations/GearsDoorsHandle3_mch.pl', |
| 2916 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M2_mch.pl', |
| 2917 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M20_mch.pl', |
| 2918 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M3_mch.pl', |
| 2919 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M30_mch.pl', |
| 2920 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m1_true.pl', |
| 2921 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m2_mch.pl', |
| 2922 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m0_mch.pl', |
| 2923 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m1_mch.pl', |
| 2924 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m2_mch.pl', |
| 2925 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel1/LPN0_mch.pl', |
| 2926 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel1/LPN1_mch.pl', |
| 2927 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel1/LPN2_mch.pl', |
| 2928 | | '-p', 'DOUBLE_EVALUATION', 'TRUE' |
| 2929 | | %,'../prob_examples/examples/ProofObligations/ABZ14_Mery/M4_mch.pl' |
| 2930 | | ],'Test 1409 with double check'). |
| 2931 | | cli_testcase(1437, [cbc,disprover,private], [ |
| 2932 | | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_1_true.pl', |
| 2933 | | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_3_true.pl', |
| 2934 | | '-p', 'DOUBLE_EVALUATION', 'TRUE' |
| 2935 | | ],'Test 1410 with double check'). |
| 2936 | | cli_testcase(1438, [cbc,disprover], [ |
| 2937 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest2_ctx.pl', |
| 2938 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest3_ctx.pl', |
| 2939 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest4_ctx.pl', |
| 2940 | | '-check_disprover_result', 0,0,2, |
| 2941 | | '-p', 'DOUBLE_EVALUATION', 'TRUE' |
| 2942 | | ],'Test 1411 with double check'). |
| 2943 | | cli_testcase(1439, [cbc], ['../prob_examples/public_examples/B/Tickets/LambdaInverse/LambdaInverseBehaviour.mch', '-init', '-sptxt', '../prob_examples/public_examples/B/Tickets/LambdaInverse/LambdaInverseBehaviour.sptxt'], 'Test no lambda closure in result state.'). |
| 2944 | | cli_testcase(1440, [cbc,disprover], [ |
| 2945 | | '../prob_examples/public_examples/ProofObligations/InconsistenHyp_ctx.pl', |
| 2946 | | '-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'STRICT_RAISE_WARNINGS', 'TRUE', |
| 2947 | | '-expcterr', 'disprover_inconsistent_hypotheses' |
| 2948 | | ],'Test 1411 with double check'). |
| 2949 | | cli_testcase(1441, [disprover,s21], [ |
| 2950 | | '../prob_examples/public_examples/ProofObligations/S21/train_0_mch.pl', |
| 2951 | | '-timeout', 500, % sets disprover_timeout |
| 2952 | | '-opterr', 'disprover_inconsistent_hypotheses', % with larger time_out or faster machine we can find those |
| 2953 | | '-check_disprover_result', '>10',0,'<25' % on faster machine we can get 12,0,23 |
| 2954 | | % [inv6/WD,inv7/WD,inv8/WD,INITIALISATION/inv3/INV,INITIALISATION/inv5/INV,INITIALISATION/inv4/INV,INITIALISATION/inv6/INV,INITIALISATION/inv7/INV,INITIALISATION/inv8/INV,FRONT_MOVE_1/grd2/WD,FRONT_MOVE_1/act1/WD] |
| 2955 | | ],'S21 proof obligations'). |
| 2956 | | cli_testcase(1442, [disprover,s21], [ |
| 2957 | | '../prob_examples/public_examples/ProofObligations/S21/train_1_mch.pl', |
| 2958 | | '-check_disprover_result', '>15',0,'<28', % changed 8th January 2018 to 16,0,27, was 15,0,28, after improved propagation for function application; see test 1885; changed to >15,0,<28 for faster Gitlab Win64 runners |
| 2959 | | '-opterr', 'disprover_inconsistent_hypotheses' % with larger time_out or faster machine we can find those |
| 2960 | | ],'S21 proof obligations'). |
| 2961 | | cli_testcase(1443, [disprover,s21], [ |
| 2962 | | '../prob_examples/public_examples/ProofObligations/S21/train_2_mch.pl', |
| 2963 | | '-timeout', 500, % sets disprover_timeout |
| 2964 | | '-opterr', 'disprover_inconsistent_hypotheses', % with larger time_out or faster machine we can find those |
| 2965 | | '-check_disprover_result', '>=0',0,'=<6' |
| 2966 | | ],'S21 proof obligations'). |
| 2967 | | cli_testcase(1444, [disprover,s21], [ |
| 2968 | | '../prob_examples/public_examples/ProofObligations/S21/train_3_mch.pl', |
| 2969 | | '-check_disprover_result', 11,0,0, |
| 2970 | | '-expcterr', 'disprover_inconsistent_hypotheses' |
| 2971 | | ],'S21 proof obligations'). |
| 2972 | | cli_testcase(1445, [disprover,s21], [ |
| 2973 | | '../prob_examples/public_examples/ProofObligations/S21/train_4_mch.pl', |
| 2974 | | '-check_disprover_result', 1,0,0, |
| 2975 | | '-expcterr', 'disprover_inconsistent_hypotheses' |
| 2976 | | ],'S21 proof obligations'). |
| 2977 | | cli_testcase(1446, [disprover,s21], [ |
| 2978 | | '../prob_examples/public_examples/ProofObligations/S21/train_5_mch.pl', |
| 2979 | | '-check_disprover_result', 79,0,0, |
| 2980 | | '-expcterr', 'disprover_inconsistent_hypotheses' |
| 2981 | | ],'S21 proof obligations'). |
| 2982 | | cli_testcase(1447, [disprover,s21], [ |
| 2983 | | '../prob_examples/public_examples/ProofObligations/S21/train_ctx0_ctx.pl', |
| 2984 | | % '-check_disprover_result', 1,10,6, |
| 2985 | | '-check_disprover_result', 5,10,2, |
| 2986 | | % proven: [axm10/WD] |
| 2987 | | % disproven: [axm2/THM,axm3/THM,axm4/THM,axm5/THM,axm6/THM,axm7/THM,axm8/THM,axm11/THM,axm10/THM,axm9/THM] |
| 2988 | | '-timeout', 2000 % timeout per PO |
| 2989 | | ],'S21 proof obligations'). |
| 2990 | | cli_testcase(1448, [disprover,s21], [ |
| 2991 | | '../prob_examples/public_examples/ProofObligations/S21/train_ctx1_ctx.pl', |
| 2992 | | '-check_disprover_result', 1,0,2 |
| 2993 | | ],'S21 proof obligations, axm2/WD can be proven'). /* was skipped: PO 'axm2/WD' no longer provable due to change of cardinality3 block declaration; was fixed by merging kernel_cardinality */ |
| 2994 | | cli_testcase(1449, [disprover,s21], [ |
| 2995 | | '../prob_examples/public_examples/ProofObligations/S21/train_ctx2_ctx.pl', |
| 2996 | | '-check_disprover_result', 7,0,0, |
| 2997 | | '-expcterr', 'disprover_inconsistent_hypotheses' |
| 2998 | | ],'S21 proof obligations'). |
| 2999 | | cli_testcase(1450, [disprover,s21], [ |
| 3000 | | '../prob_examples/public_examples/ProofObligations/S21/train_ctx5_ctx.pl', |
| 3001 | | '-check_disprover_result', 0,0,0 |
| 3002 | | ],'S21 proof obligations'). |
| 3003 | | cli_testcase(1451, [cbc,atelierb,chr,unsat_core], ['../prob_examples/examples/B/Alstom/DisproverProject/TrueContradiction.mch', |
| 3004 | | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 3005 | | '-cbc_assertions', '-cbc_option', contradiction_check, '-cbc_option', tautology_check , '-cbc_option', unsat_core, |
| 3006 | | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt', |
| 3007 | | '-strict', '-expcterr', contradiction_in_hypotheses], 'Test Atelier-B Disprover interface'). |
| 3008 | | cli_testcase(1452, [disprover,exists], [ |
| 3009 | | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Cylinders_mch.pl', |
| 3010 | | '-timeout', 2500, % sets disprover_timeout |
| 3011 | | '-check_disprover_result', 37,0,0 |
| 3012 | | ],'ABZ Mammar Laleau - requires exists expansion'). |
| 3013 | | cli_testcase(1453, [disprover], [ |
| 3014 | | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Gears_mch.pl', |
| 3015 | | %'../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Doors_mch.pl', |
| 3016 | | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/GearsIntermediateStates_mch.pl', |
| 3017 | | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Failures_mch.pl' % requires good reification of partial_function test |
| 3018 | | ],'ABZ Mammar Laleau POs should all be proven, test closure reification'). |
| 3019 | | cli_testcase(1454, [disprover,cbc], ['-p','SMT','TRUE', |
| 3020 | | '-evalf', 'not(handler_ind : dom({FALSE |-> d,TRUE |-> c}) &{FALSE |-> a,TRUE |-> b} : BOOL +-> INTEGER) & handler_ind : BOOL & d:INTEGER', % other small test |
| 3021 | | '-evalf', 'not(handler_ind : dom({FALSE |-> d,TRUE |-> c}) &{FALSE |-> a,TRUE |-> b} : BOOL --> INTEGER) & handler_ind : BOOL & d:INTEGER', % other small test |
| 3022 | | '-evalf', 'not(f<+{po |-> {TRUE |-> currentTime + 12,FALSE |-> 16}(po)} : BOOL --> NATURAL) & f : BOOL --> NATURAL&po=TRUE & currentTime:NATURAL', % this checks not_total_function improvement |
| 3023 | | '-evalf', 'not(f <+ {po |-> {TRUE |-> currentTime + 12,FALSE |-> 16}(po)} : BOOL +-> NATURAL) & f : BOOL +-> NATURAL & currentTime>0', % this checks not_partial_function improvement |
| 3024 | | '-evalf', 'not(BOOL * {currentTime + 4} : BOOL --> NATURAL) & currentTime >0' % this checks not_subset improvement for not_total_function |
| 3025 | | ],'Check reification of x:NATURAL and choice point in not_total_function and not_partial_function'). |
| 3026 | | cli_testcase(1455, [cbc,atelierb,disprover], ['-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 3027 | | '-evalf', 'not(#(i0).(i0 : INTEGER & ((tdc <+ {i |-> TRUE}) <+ {i0 |-> TRUE} = {1,2,3} * {TRUE} & door_closing = TRUE => door_closed = FALSE))) & (door_closing = TRUE => (door_open = FALSE & door_closed = FALSE))' |
| 3028 | | ], 'Test splitting of existential quantifier'). |
| 3029 | | % some laws also checked in CHR+DISPROVER mode: |
| 3030 | | cli_testcase(1456, [laws,rel_fnc,cbc,disprover], ['../prob_examples/public_examples/B/Laws/ExplicitComputations.mch', '-t', '-mc', '100000', '-nodead', '-cs', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '9000', |
| 3031 | | '-p', 'DISPROVER_MODE', 'TRUE'], 'Many explicit computations which check that all operators work as expected on various concrete data (CLPFD+DISPROVER mode).'). |
| 3032 | | cli_testcase(1457, [laws,chr], ['../prob_examples/public_examples/B/Laws/BoolLaws.mch', '-mc', '100000', '-nodead', '-cs', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', |
| 3033 | | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE'], 'Various laws about BOOL datatype and boolean connectives.'). |
| 3034 | | cli_testcase(1458, [laws,chr], ['../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', '-mc', '100000', '-cs', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', |
| 3035 | | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE'], 'Various arithmetic laws.'). |
| 3036 | | cli_testcase(1459, [laws,chr], ['../prob_examples/public_examples/B/Laws/NatRangeLaws.mch', '-mc', '100000', '-cs', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', |
| 3037 | | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE'], 'Laws about intervals etc.'). |
| 3038 | | cli_testcase(1460, [laws,rel_fnc,chr], ['../prob_examples/public_examples/B/Laws/RelLaws.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', |
| 3039 | | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on relations.'). |
| 3040 | | cli_testcase(1461, [laws,chr], ['../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'FALSE', |
| 3041 | | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets'). |
| 3042 | | cli_testcase(1462, [cbc,atelierb,disprover], ['-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 3043 | | '-evalf', 'not(!(i0).(i0 : {1,2,3} => (three_door_open <+ {i |-> FALSE})(i0) = FALSE or three_door_closed(i0) = FALSE)) & three_door_open : {1,2,3} --> BOOL & three_door_closed : {1,2,3} --> BOOL & ( door_open = TRUE => three_door_open = {1,2,3} * {TRUE}) & ( door_closed = TRUE => three_door_closed = {1,2,3} * {TRUE}) & !(i).(i : {1,2,3} => three_door_open(i) = FALSE or three_door_closed(i) = FALSE) & (door_open = FALSE or door_closed = FALSE)', |
| 3044 | | '-evalf', 'not( (gears_rtr = TRUE <=> three_gears_rtr <+ {i |-> TRUE} = {1,2,3} * {TRUE} )) & ( gears_rtr = TRUE <=> three_gears_rtr = {1,2,3} * {TRUE}) & i : {1,2,3} & three_gears_ext(i) = FALSE & three_gears_rtr(i) = FALSE & (three_gears_rtr <+ {i |-> TRUE}) /= {1,2,3} * {TRUE} ' |
| 3045 | | ], 'Test improved treatment of function overwrite'). |
| 3046 | | cli_testcase(1463, [disprover], [ |
| 3047 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m6_mch.pl', |
| 3048 | | '-timeout', 600, % sets disprover_timeout |
| 3049 | | '-check_disprover_result', '>101',0,'<2' % on a fast machine we can get 103 true and 0 unknown, otherwise 102 and 1 |
| 3050 | | ],'Requires function overwrite + better sharing of negated preds'). |
| 3051 | | cli_testcase(1464, [cbc,cse, cse_test,sigma], [ '-p', 'CSE', 'TRUE', |
| 3052 | | '-evalf', 'x+y >100 & x+y <99', |
| 3053 | | '-evalt', '(x+y)+(x+y)=(x+y) & x:INTEGER', |
| 3054 | | '-evalt', '((x+y)+z)*(x+y)+((x+z)+y) + (x+z) = 0', |
| 3055 | | '-evalt', '!x.(x:NATURAL &x+z<10 => x+z<11) & z=2', |
| 3056 | | '-evalt', 'SIGMA(x).(x:NATURAL &x+z<4 | x+z)=5 & z=2', |
| 3057 | | '-evalt', 'PI(x).(x:NATURAL &x+z<4 | x+z)=6 & z=2', |
| 3058 | | '-evalt', '(z>1 => #x.(x:NATURAL &x+z<10 & x+z<11)) & z=2', |
| 3059 | | '-evalt', '%(x).(x:NATURAL1 &x+z<4 | x+z)=[3] & z=2', |
| 3060 | | '-evalt', '{x,r | x:NATURAL1 &x+z<4 & r= x+z}=[3] & z=2', |
| 3061 | | '-evalt', '{v|v+(x+x) : 0..10 & v:0..5 & v+(x+x) < 3}={0} & x+x : 0..4', |
| 3062 | | '-evalt', 'f:BOOL +-> 0..10 & (f/={} => f(TRUE)>5) & (FALSE:dom(f)=> f(TRUE)>5)', |
| 3063 | | '-evalt', 'f:BOOL +-> 0..10 & (f/={} => f(TRUE)>5) <=> b=TRUE & (FALSE:dom(f)=> f(TRUE)>5) <=> b=FALSE', |
| 3064 | | '-evalt', 'f:1..3+->1..3 & (x:dom(f) => #r.(r=f(x) & r>2 & r<10))<=>b=TRUE & x:3..4 & f={}', |
| 3065 | | '-evalt', 'f:BOOL +-> 0..10 & (f/={} => (f(TRUE)>5 <=> c=TRUE)) <=> b=TRUE & (FALSE:dom(f)=> (f(TRUE)>5<=>c=FALSE)) <=> b=FALSE & c=FALSE', |
| 3066 | | '-evalf', 'a: 1..6 --> {0,1,5} & b: 1..3 --> {30,210,21} & SIGMA(i).(i:1..0|a(i))+SIGMA(j).(j:1..3|b(i))=20 & r=b(i)' |
| 3067 | | ], 'Some simple CSE tests'). |
| 3068 | | |
| 3069 | | cli_testcase(1465,[cse, cse_test,private],['-p', 'CSE', 'TRUE', '-p', 'MAXINT', 127, '-p', 'MININT', -128, |
| 3070 | | |
| 3071 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-MemoryLoad_SP_55.prob', |
| 3072 | | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_6.prob' |
| 3073 | | % ,'-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_13.prob' %% does not work yet |
| 3074 | | ], 'Test from 1003'). |
| 3075 | | cli_testcase(1466,[cse,tickets], ['-p', 'CSE', 'TRUE', |
| 3076 | | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m3_act0_inv2_as_b.mch', |
| 3077 | | '-init' |
| 3078 | | ], 'Test WD issue does not prevent from finding solution'). |
| 3079 | | |
| 3080 | | cli_testcase(1467, [disprover,private], [ |
| 3081 | | '../prob_examples/examples/ProofObligations/Pacemaker_1_15March2011/M0_AOO_mch.pl', |
| 3082 | | '-check_disprover_result', 27,0,1 |
| 3083 | | ],'Pacemaker proof obligations'). |
| 3084 | | cli_testcase(1468, [por,enabling], ['../prob_examples/public_examples/B/Ivo/DepEnabling.mch', '-mc', '1000000', '-noinv', '-p', 'por', ample_sets, '-expcterr', deadlock, '-strict'], 'Testing whether the deadlock state is found when model checking with POR.'). |
| 3085 | | cli_testcase(1469, [por,enabling], ['../prob_examples/public_examples/B/Ivo/DepEnabling.mch', '-mc', '1000000', '-noinv', '-p', 'por', ample_sets, '-expcterr', deadlock, '-strict'], 'Testing whether the deadlock state is found when model checking with POR.'). |
| 3086 | | cli_testcase(1470, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/mbuff.csp', '-ltlformula', 'SF(snd_mess.t1.d1) & SF(mess.t1.d1) & SF(rcv_mess.t1.d1) & SF(right.t1.d1) => G ([left.t1.d1] => F [right.t1.d1])', '-check_complete', '-cc', '1406', '4063', '-strict'], 'Test fairness implementation.'). |
| 3087 | | cli_testcase(1471, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/mbuff.csp', '-ltlformula', 'SEF => G ([left.t1.d1] => F [right.t1.d1])', '-check_complete', '-cc', '1406', '4063', '-strict'], 'Test fairness implementation.'). |
| 3088 | | cli_testcase(1472, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/peterson.csp', '-ltlformula', 'WF(p2enter) & WF(p2critical) & WF(p2leave) & WF(p2resetflag2) & WF(p2set1turn) & WF(p1set2turn) & WF(p1gettrueflag2) & WF(p2gettrueflag2) & WF(p2gettrueflag1) & WF(p1get1turn) & WF(p2get2turn) & WF(p1enter) => G ([p1setflag1] => F [p1enter])', '-check_complete', '-cc', 57, 113, '-strict'], 'Test fairness implementation.'). |
| 3089 | | cli_testcase(1473, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/peterson.csp', '-ltlformula', 'WEF => G ([p1setflag1] => F [p1enter])', '-check_complete', '-cc', 57, 113, '-strict'], 'Test fairness implementation (skipped until next ProB parser release).'). |
| 3090 | | cli_testcase(1474, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/pris.csp', '-ltlformula', 'SF(in.A) & SF(in.B) & SF(in.C) => F[done]', '-cc', 48, 61, '-strict'], 'Test fairness implementation.'). |
| 3091 | | cli_testcase(1475, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/pris.csp', '-ltlformula', 'SEF => F[done]', '-cc', 48, 61, '-strict'], 'Test fairness implementation (skipped until next ProB parser release).'). |
| 3092 | | cli_testcase(1476, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/scheduler.csp', '-ltlformula', 'WF(ready.5) & WF(ready.4) & WF(ready.3) & WF(ready.2) & WF(leave.1) => G ([enter.1] => F [leave.1])', '-cc', 3194, 12046, '-strict'], 'Test fairness implementation.'). |
| 3093 | | cli_testcase(1477, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/scheduler.csp', '-ltlformula', 'WEF => G ([enter.1] => F [leave.1])', '-cc', 3194, 12046, '-strict'], 'Test fairness implementation (skipped until next ProB parser release).'). |
| 3094 | | cli_testcase(1478, [cbc,cse, cse_test,sigma], [ '-p', 'CSE', 'FALSE', '-p', 'SMT', 'TRUE', |
| 3095 | | '-evalf', 'a: 1..6 --> {0,1,5} & b: 1..3 --> {30,210,21} & SIGMA(i).(i:1..0|a(i))+SIGMA(j).(j:1..3|b(i))=20 & r=b(i)' |
| 3096 | | ], 'Test new FDSET collection for function application'). |
| 3097 | | cli_testcase(1479, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/scheduler.csp', '-ltlformula', 'SF(ready.5) & SF(ready.4) & SF(ready.3) & SF(ready.2) & SF(leave.1) => G ([enter.1] => F [leave.1])', '-strict'], 'Test fairness implementation (fix of the memory exhaustion issue).'). |
| 3098 | | cli_testcase(1480, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/scheduler.csp', '-ltlformula', 'SF(ready.5) & SF(ready.4) & SF(ready.3) & SF(ready.2) & SF(delete.1) => G ([new.1] => F [delete.1])', '-strict'], 'Test fairness implementation (fix of the memory exhaustion issue).'). |
| 3099 | | cli_testcase(1481, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/phils.csp', '-ltlformula', 'SF(sits._) => G ([sits.0] => F [eats.0])', '-expcterr', ltl, '-strict'], 'Testing fairness check to fail when using _ as argument in order to set a group of events (e.g. sits._) as fairness constraints.'). |
| 3100 | | cli_testcase(1482, [tickets,override], ['../prob_examples/public_examples/EventBPrologPackages/Tests/FunOverrideTest.mch', '-mc', 99, '-strict'], 'Test f(x) := E substitution deals with f being a relation.'). |
| 3101 | | cli_testcase(1483, [laws,sequences], ['../prob_examples/public_examples/B/Laws/SeqLaws.mch', '-mc', '500', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions'], 'Laws about sequences'). |
| 3102 | | cli_testcase(1484, [cbc,tickets], [ |
| 3103 | | '-evalt', 'res=x*x+4*x+14', |
| 3104 | | '-evalt', 'x*x+4*x+14=res' |
| 3105 | | ], 'Check no CLPFD overflow'). |
| 3106 | | cli_testcase(1485, [tickets], [ |
| 3107 | | '-evalt', 'x = -(x) & y={x,2} & z={x,3}', |
| 3108 | | '-evalt', 'x = -v & v=2+w & w=10 & y={x,2} & z={x,3}' |
| 3109 | | ], 'Check no error in predicate partitioning and equality replacement'). |
| 3110 | | cli_testcase(1486, [b_test,override], ['-t', '-strict', '../prob_examples/public_examples/B/FeatureChecks/OverrideRelationAssignment.mch'], 'Check function override assignment works for relation'). |
| 3111 | | cli_testcase(1487, [records,cbc], [ |
| 3112 | | '-evalf', 'r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', |
| 3113 | | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', |
| 3114 | | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2 & s:struct(f1:15..20,f2:1..100) & s=r' |
| 3115 | | ], 'A few REPL tests with records'). |
| 3116 | | cli_testcase(1488, [cbc], [ |
| 3117 | | '-evalf', 'A /= {} & A <<: {x} & x:INTEGER', % NotSubsetoOfSingleton |
| 3118 | | '-evalf', '{(x,y)} <: R & x /: dom(R) & R : INTEGER <-> INTEGER', % SingletonNotSubsetRel |
| 3119 | | '-evalf', 'X /\\ Y = Z & X = {} & Z /= {} & X<:INTEGER', % dinters(X,Y,Z) & X = {} & Z neq {} --> false |
| 3120 | | '-evalf', 'R:INTEGER<->INTEGER & A={} & Q= A <| R & dom(Q)=D & D /= {}', %DresEmpty2 % is_rel(R) & A = {} & dres(A,R,Q) & dom(Q,D) & D neq {} |
| 3121 | | '-evalf', 'R:INTEGER<->INTEGER & R /= {} & dom(R)=D & D <<: {X}', % DomNotSubsetOfSingleton % is_rel(R) & R neq {} & dom(R,D) & ssubset(D,{X}) |
| 3122 | | '-evalf', 'R:INTEGER<->INTEGER & R /= {} & dom(R)=D & A=D & A <| R=Q & R /\\ Q = {}', % DresCapEqual |
| 3123 | | '-evalf', 'R:INTEGER<->INTEGER & R /= {} & dom(R)=D & A=D & A <| R = {}', % DresEqual |
| 3124 | | '-evalf', 'R:INTEGER<->INTEGER & dom(R)=D & X /: D & dom({(X,Y),B}) = DS & D=DS & Y:INTEGER', % SingletonMappletNotInDom % is_rel(R) & dom(R,D) & X nin D & dom({[X,Y] / B},DS) & D = DS |
| 3125 | | % This does not work R:INTEGER<->INTEGER & dom(R)=D & X /: D & dom({(X,Y),B,B2}) = DS & D=DS & Y:INTEGER |
| 3126 | | '-p', 'CLPFD', 'TRUE' |
| 3127 | | ], 'Check that ProB can handle Setlog TTF filtering rules'). |
| 3128 | | cli_testcase(1489, [b_test,proz,private],['../prob_examples/examples/Z/Cristia/birthdayBook/zspec.fuzz', '-t', '-p', 'DEFAULT_SETSIZE', 3, '-strict'],'ProZ test (new Init/init schema detection)'). |
| 3129 | | cli_testcase(1490, [cbc_tests,cbc,proz,private],['../prob_examples/examples/Z/Cristia/birthdayBook/zspec.fuzz', |
| 3130 | | '-cbc_tests', 2 ,'', '', '-cbc_cover_all'],'Check that we can cover all events'). |
| 3131 | | cli_testcase(1491, [eventb_test,infinite,override], ['../prob_examples/public_examples/EventBPrologPackages/FeatureTests/InfiniteChanges_mch.eventb', '-t'], 'Test that we can override infinite functions.'). |
| 3132 | | cli_testcase(1492, [tickets,alstom,random,private], ['../prob_examples/examples/B/Alstom/ixl_Apr_2015/scheduler_i.mch', '-animate', 10, '-p', 'CLPFD', 'FALSE', |
| 3133 | | '-p', 'TIME_OUT', 12000, % increased time-out from 6000 for gitlab windows runner on Feb 9th 2020 |
| 3134 | | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE'], 'Test that random enumeration works without CLPFD.'). |
| 3135 | | cli_testcase(1493, [pge_fast], ['../prob_examples/public_examples/B/Ivo/SkippingComplexGuardsEvaluation_mch_mx5000.eventb', '-mc', 1000000, '-p', 'pge', full, '-get_coverage_information', '../prob_examples/public_examples/B/Ivo/SkippingComplexGuardsEvaluation_mch_mx5000_Coverage.txt', '-strict'], 'Pathological test case for the PGE optimisation: 0 guard evaluations should be skipped.'). |
| 3136 | | cli_testcase(1494, [pge_fast], ['../prob_examples/public_examples/B/Ivo/NoDisablings_mx5.eventb', '-mc', 1000000, '-p', 'pge', full, '-get_coverage_information', '../prob_examples/public_examples/B/Ivo/NoDisablings_mx5_Coverage.txt', '-strict'], 'Pathological test case for the PGE optimisation: fixed number of guard evaluations should be skipped.'). |
| 3137 | | cli_testcase(1495, [pge_fast,enabling], ['../prob_examples/public_examples/B/Ivo/PGE_Deadlock.mch', '-mc', 1000000, '-noinv', '-p', 'pge', full, '-expcterr', deadlock, '-strict'], 'Testing whether the deadlock state is discovered when -noinv is set (invariant should not be used for the enabling analysis when model checking just for deadlock freedom).'). |
| 3138 | | cli_testcase(1496, [pge_fast], ['../prob_examples/public_examples/B/Ivo/PGE_Deadlock.mch', '-mc', 1000000, '-p', 'pge', full, '-expcterr', invariant_violation, '-strict'], 'Testing whether the invariant violation is discovered.'). |
| 3139 | | cli_testcase(1497, [pge_fast], ['../prob_examples/public_examples/B/Ivo/PGE_Deadlock.mch', '-ltlformulaf', 'G not deadlock', '-p', pge, full, '-strict'], 'Testing whether the deadlock state is discovered when using PGE while LTL model checking.'). |
| 3140 | | cli_testcase(1498, [cbc,queens,card], [ |
| 3141 | | '-evalt', '{x| x:1..3 -->> 5..7 & x(2)=6} = {{(1|->5),(2|->6),(3|->7)},{(1|->7),(2|->6),(3|->5)}}', |
| 3142 | | '-evalt', '{x| x:1..3 -->> 5..7 & x(2)>x(3)} = {{(1|->7),(2|->6),(3|->5)},{(1|->5),(2|->7),(3|->6)},{(1|->6),(2|->7),(3|->5)}}', |
| 3143 | | '-evalt', '{x| x:1..3 -->> 5..8 & x(2)>x(3)}={}', |
| 3144 | | '-evalt', 'n = 50 & queens : 1..n -->> 1..n &!(q1,q2).(q1:1..n & q2:2..n & q2>q1 => queens(q1)+q2-q1 /= queens(q2) & queens(q1)-q2+q1 /= queens(q2))', |
| 3145 | | '-evalt', '{x| x:1..3 +->> 5..7 & x(2)=6} = {{(1|->5),(2|->6),(3|->7)},{(1|->7),(2|->6),(3|->5)}}', |
| 3146 | | '-evalt', '{x| x:1..3 +->> 5..7 & x(2)>x(3)} = {{(1|->7),(2|->6),(3|->5)},{(1|->5),(2|->7),(3|->6)},{(1|->6),(2|->7),(3|->5)}}', |
| 3147 | | '-evalt', '{x| x:1..3 +->> 5..8 & x(2)>x(3)}={}', |
| 3148 | | '-evalt', 'n = 50 & queens : 1..n +->> 1..n &!(q1,q2).(q1:1..n & q2:2..n & q2>q1 => queens(q1)+q2-q1 /= queens(q2) & queens(q1)-q2+q1 /= queens(q2))', |
| 3149 | | '-evalt', 'n = 50 & queens : 1..n >->> 1..n &!(q1,q2).(q1:1..n & q2:2..n & q2>q1 => queens(q1)+q2-q1 /= queens(q2) & queens(q1)-q2+q1 /= queens(q2))' % now added also total_bijection |
| 3150 | | ], 'Check -->> / +->> optimization works correctly (test new treatment to treat like >-> when domain card = range card; now also >->>)'). |
| 3151 | | cli_testcase(1499, [cbc,cse], ['../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet.mch', |
| 3152 | | '../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet_simplified.mch', |
| 3153 | | '-cbc', 'all', '-strict', '-expcterr', 'cbc', '-p', 'CSE', 'TRUE'], 'Test 402 with CSE enabled; nonvar types occur'). |
| 3154 | | cli_testcase(1500, [cse,hash], ['../prob_examples/public_examples/B/PerformanceTests/CommonSubexpressions/Sequence_CSE_Test2.mch', '-mc', '1002', '-nodead', '-bf', '-hash64', 667488836707065541, '-p', 'CSE', 'TRUE'], 'Test CSE with Sequence Substitutions'). % % 17.9.2021: adapted hash from 25104873554326101 for sorted order of variables |
| 3155 | | cli_testcase(1501, [cse,hash], ['../prob_examples/public_examples/B/PerformanceTests/CommonSubexpressions/WhileLoop_CSE_Test1.mch', '-mc', '500', '-nodead', '-bf', '-hash64', 137772507059734089, '-p', 'CSE', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test CSE with While Substitutions'). |
| 3156 | | cli_testcase(1502, [cse,hash], ['../prob_examples/public_examples/B/PerformanceTests/CommonSubexpressions/WhileLoop_CSE_Test2.mch', '-mc', '500', '-nodead', '-bf', '-hash64', 642472838688353119, '-p', 'CSE', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test CSE with While Substitutions'). |
| 3157 | | cli_testcase(1503, [cse,hash], ['../prob_examples/public_examples/B/PerformanceTests/CommonSubexpressions/WhileLoop_CSE_Test3.mch', '-mc', '500', '-nodead', '-bf', '-hash64', 642472838688353119, '-p', 'CSE', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test CSE with While Substitutions'). |
| 3158 | | cli_testcase(1504, [cse,hash], ['../prob_examples/public_examples/B/PerformanceTests/CommonSubexpressions/WhileLoop_CSE_Test5.mch', '-mc', '500', '-nodead', '-bf', '-hash64', 571377810868391599, '-p', 'CSE', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test CSE with While Substitutions'). |
| 3159 | | cli_testcase(1505, [smt_solver_integration], [ |
| 3160 | | '-evalt', ':z3-double-check x = 1', |
| 3161 | | '-evalf', ':z3-double-check x = 1 & x > 2' |
| 3162 | | %'-evalt', ':cvc4 x = 1', |
| 3163 | | %'-evalf', ':cvc4 x = 1 & x > 2' |
| 3164 | | ], 'some simple constraints that should be solved by cvc4 / z3'). |
| 3165 | | cli_testcase(1506, [smt_solver_integration], [ |
| 3166 | | '-evalt', ':z3-double-check r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', |
| 3167 | | '-evalf', ':z3-double-check r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', |
| 3168 | | '-evalt', ':z3-double-check r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2 & s:struct(f1:15..20,f2:1..100) & s=r', |
| 3169 | | '-evalt', ':z3-double-check v1:struct(lderb:{TRUE},mspue:{FALSE},fhhxr:{TRUE})', |
| 3170 | | '-evalt', ':z3-double-check Dom = struct(f1:-1..3)', |
| 3171 | | '-evalt', ':z3-double-check Dom = struct(f1:-1..3) & SS : POW(Dom)', |
| 3172 | | '-evalf', ':z3-double-check Dom = struct(r:1..3) & ff:Dom<->BOOL & gg:Dom<->BOOL & not(ff <<: gg => #xx.(xx:gg & xx/:ff))' |
| 3173 | | %'-evalt', ':cvc4 r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', |
| 3174 | | %'-evalf', ':cvc4 r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', |
| 3175 | | %'-evalt', ':cvc4 r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2 & s:struct(f1:15..20,f2:1..100) & s=r', |
| 3176 | | %'-evalt', ':cvc4 v1:struct(lderb:{TRUE},mspue:{FALSE},fhhxr:{TRUE})' |
| 3177 | | ], 'records support by smt solvers'). |
| 3178 | | %cli_testcase(1507, [smt_solver_integration], [ |
| 3179 | | % '-evalt', ':cvc4 test = \"asdfasdfasdF\"' |
| 3180 | | % ], 'string support by smt solvers'). |
| 3181 | | cli_testcase(1508, [smt_solver_integration], [ |
| 3182 | | '-evalf', ':z3-double-check x>0 & x+1 <= p & x=p', |
| 3183 | | '-evalf', ':z3-double-check x>0 & x+2 <= p & x=p', |
| 3184 | | '-evalf', ':z3 not(Pace_Int - sp >= 0) & (sp > 0 & sp < Pace_Int)' % taken from pacemaker disprover testcase; requires CHR probably to double check |
| 3185 | | %'-evalf', ':cvc x>0 & x+1 <= p & x=p', |
| 3186 | | %'-evalf', ':cvc x>0 & x+2 <= p & x=p', |
| 3187 | | %'-evalf', ':cvc not(Pace_Int - sp >= 0) & (sp > 0 & sp < Pace_Int)' % taken from pacemaker disprover testcase |
| 3188 | | ], 'check that smt solvers would be able to replace the chr code in some cases'). |
| 3189 | | cli_testcase(1509, [smt_solver_integration], [ |
| 3190 | | '-evalt', ':z3-double-check {x} <: {999}', |
| 3191 | | '-evalt', ':z3-double-check {x} <: {999,1000} & x > 999', |
| 3192 | | '-evalt', ':z3-double-check x = {1,2} /\\ {3,4}', |
| 3193 | | '-evalt', ':z3-double-check x={(1,2),(3,4),(4,5),(6,7),(8,9)} & y|->v : x & y|->w : x' |
| 3194 | | %'-evalt', ':cvc4 {x} <: {999}', |
| 3195 | | %'-evalt', ':cvc4 {x} <: {999,1000} & x > 999', |
| 3196 | | %'-evalt', ':cvc4 x={(1,2),(3,4),(4,5),(6,7),(8,9)} & y|->v : x & y|->w : x' |
| 3197 | | ], 'simple set constraints for smt solvers'). |
| 3198 | | cli_testcase(1510, [smt_solver_integration], [ |
| 3199 | | '-evalt', ':z3-double-check x : {1,2} --> NAT', |
| 3200 | | '-evalf', ':z3-double-check x : {1,2} --> NAT & x = {(1,1)}', |
| 3201 | | '-evalt', ':z3-double-check x : {1,2} --> NAT & x = {(1,1),(2,1)}' |
| 3202 | | ], 'functions for z3 (in theory supported by cvc4, but often unknown)'). |
| 3203 | | cli_testcase(1511, [smt_solver_integration], [ |
| 3204 | | '-evalf', ':z3-double-check s = min({1}) & s=2', |
| 3205 | | '-evalf', ':z3-double-check s = min({1,2}) & s>2' |
| 3206 | | %'-evalf', ':cvc s = min({1}) & s=2', |
| 3207 | | %'-evalf', ':cvc s = min({1,2}) & s>2' |
| 3208 | | ], 'check that smt solvers can falsify min / max'). |
| 3209 | | cli_testcase(1512, [cse, ltl], ['../prob_examples/public_examples/B/LTL/Fairness/TestingFairness.mch', |
| 3210 | | '-p', 'CSE', 'TRUE', '-p', 'CSE_SUBST', 'TRUE', |
| 3211 | | '-ltlformulat', true, '-ltlformulat', 'G{1=1}', |
| 3212 | | '-ctlformulat', 'AG{1=1}', '-ctlformulaf', 'EF{1=2}', |
| 3213 | | %'-ltlformulaf', false, % does not work ! |
| 3214 | | '-ltlformulaf', 'G{1=2}', '-strict'], 'Test 1244 with CSE_SUBST, checks top-level PRE detected inside lazy_let_subst.'). |
| 3215 | | cli_testcase(1513, [smt_solver_integration], [ |
| 3216 | | '-evalt', ':z3-double-check x=dom({(1,2)})', |
| 3217 | | '-evalt', ':z3-double-check x=ran({(1,2)})' |
| 3218 | | ], 'domain and range computation using z3'). |
| 3219 | | cli_testcase(1514, [cse,case],['../prob_examples/examples/B/Satpathy/Teletext104/Teletext104_deterministic.mch', '-t', |
| 3220 | | '-p', 'CSE', 'TRUE', '-p', 'CSE_SUBST', 'TRUE' |
| 3221 | | ],'Test 1292 with CSE_SUBST: Check this relatively large machine works.'). |
| 3222 | | cli_testcase(1515, [cse], [ |
| 3223 | | '-p', 'CSE', 'TRUE', '-p', 'CSE_SUBST', 'TRUE', |
| 3224 | | '-evalt', '(x>1 => 10/x>2) & #v.(v:10..20 & (x>2 => 10/x=v))' |
| 3225 | | ], 'check that no pending co-routines or wd problem'). |
| 3226 | | cli_testcase(1516, [smt_solver_integration], [ |
| 3227 | | '-evalf', ':z3-double-check x = {(1,5),(2,6),(3,7)} & i = x[{1,2}] & 7:i', |
| 3228 | | '-evalt', ':z3-double-check x = {(1,5),(2,6),(3,7)} & i = x[{1,2}]' |
| 3229 | | ], 'check that smt solvers can falsify image (at least z3 can)'). |
| 3230 | | cli_testcase(1517, [smt_solver_integration], [ |
| 3231 | | '-evalf', ':z3-double-check x = 1 .. 4 & z = x /\\ 5 ..3 & z /= {}', |
| 3232 | | %'-evalf', ':cvc x = 1 .. 4 & z = x /\\ 5 ..3 & z /= {}', |
| 3233 | | '-evalt', ':z3-double-check x = 1 .. 4 & z = x /\\ 5 .. 3' |
| 3234 | | %'-evalt', ':cvc x = 1 .. 4 & z = x /\\ 5 .. 3' removed for now |
| 3235 | | ], 'intervals for smt solvers'). |
| 3236 | | cli_testcase(1518, [cbc], [ |
| 3237 | | '-evalt', 'x = %i.(i:1..10|i+i) & x[{j}]={8}', |
| 3238 | | '-evalt', 'ran({x,j|x = {1|->2,2|->4, 4|->8, 5|->8} & x[{j}]={8}})=4..5', |
| 3239 | | '-evalt', 'ran({x,j|x = {1|->2,23|->4, 44|->8, 55|->8} & x[{j}]={8}})={44,55}', |
| 3240 | | '-evalt', 'x = %i.(i:1001..1100|i+i) & x[{j}]={2100}', |
| 3241 | | '-evalt', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,10}', |
| 3242 | | '-evalf', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,11}' |
| 3243 | | ], 'check that we propagate/instantiate for image'). |
| 3244 | | cli_testcase(1519, [b_test,external,records,strings], ['../prob_examples/public_examples/B/ExternalFunctions/LibraryStrings.mch', |
| 3245 | | '-evalt', '{rec(sa:"1.101"),rec(sa:"1.102")} =x & x<: (struct(sa : {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))', |
| 3246 | | '-evalf', '{rec(sa:"1.101"),rec(sa:"1.102.3")} =x & x<: (struct(sa : {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))' |
| 3247 | | ], 'Check that no infinite expansion occurs here.'). |
| 3248 | | cli_testcase(1520, [b_test,unicode,atelierb], |
| 3249 | | ['../prob_examples/public_examples/B/Tickets/UnicodeSupport/t1_2_atelierb.mch', '-t' |
| 3250 | | ],'Test Atelier-B unicode support.'). |
| 3251 | | cli_testcase(1521, [b_test,external,records,infinite], |
| 3252 | | ['../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/SymbolicSubArg.mch', |
| 3253 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', % test also passes without this |
| 3254 | | '-assertions' |
| 3255 | | ], 'Check that no infinite expansion occurs here.'). |
| 3256 | | cli_testcase(1522, [b_test,external,records,infinite], |
| 3257 | | ['../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/SymbolicSubArg.mch', |
| 3258 | | '../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/NonSymbolicSubArg.mch', |
| 3259 | | '../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/NonSymbolicSubArgDEF.mch', |
| 3260 | | '-assertions' |
| 3261 | | ], 'Like test 1521, but a few virtual time outs occur for NonSymbolic files.'). |
| 3262 | | cli_testcase(1523, [smt_solver_integration], [ |
| 3263 | | '-eval', ':z3-version', |
| 3264 | | '-evalt', ':z3-double-check x = %i.(i:1..10|i+i) & x[{j}]={8}', |
| 3265 | | '-evalt', ':z3-double-check x = %i.(i:1..10|i+i) & x[{5,j}]={16,10}', |
| 3266 | | '-evalf', ':z3-double-check x = %i.(i:1..10|i+i) & x[{5,j}]={16,11}' |
| 3267 | | ], 'parts of test 1518 using smt solvers'). |
| 3268 | | cli_testcase(1524, [tickets,records], [ |
| 3269 | | '../prob_examples/public_examples/B/Tickets/PROB-381/DuplicateFieldInRecord.mch', |
| 3270 | | '../prob_examples/public_examples/B/Tickets/PROB-381/DuplicateFieldInRecordType.mch', '-init', |
| 3271 | | '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check multiple use of record field detected. (Ticket PROB-381)'). |
| 3272 | | cli_testcase(1525, [cbc], [ |
| 3273 | | '-evalf', 'x:S & y:S & y/:T & S<:NATURAL & T=S' |
| 3274 | | ], 'ensure above is detected FALSE wo enum warning; requires better reification for FD equality'). |
| 3275 | | cli_testcase(1526, [cbc], [ |
| 3276 | | '-evalt', 'f = {(1|->2),(2|->3),(3|->4),(4|->5),(5|->6),(6|->7),(7|->8),(8|->9),(9|->10),(10|->8)} & x = f[x] & x /= {}', |
| 3277 | | '-evalt', 'f = %x.(x:1..9|x+1) \\/ {10|->8} & x = f[x] & x /= {}', |
| 3278 | | '-evalt', 'f = %x.(x:1..n|x+1) \\/ {n+1|->8} & x = f[x] & x /= {} & n=10' |
| 3279 | | ], 'ensure above solved without enum warning (better propagation for image)'). |
| 3280 | | cli_testcase(1527, [smt_solver_integration], [ |
| 3281 | | '-evalt', ':z3-double-check x:1..400 & y:1..400 & f: 280..290 --> 290..299 & x|->y :f & y|->x :f' |
| 3282 | | ], 'check that a model with a complicated representation can be translated back from z3 to prob'). |
| 3283 | | cli_testcase(1528, [cbc], [ |
| 3284 | | '-evalt', 'x = ["A","G","G"] & z = ["A","G","T","G","G"] & n = min({size(x),size(z)}) & m :1..n & xi: 1..m >-> 1..size(x) & zi: 1..m >-> 1..size(z) & !i.(i:1..m => x(xi(i)) = z(zi(i))) & !j.(j:1..(m-1) => xi(j)<xi(j+1) & zi(j)<zi(j+1)) & m>2 & sol1 = (xi;x) & sol2 = (zi;z)', |
| 3285 | | '-evalt', 'x = ["A","G","G"] & z = ["A","G","T","G","G"] & n = min({size(x),size(z)}) & m :1..n & xi: 1..m >-> 1..size(x) & zi: 1..m >-> 1..size(z) & !j.(j:1..(m-1) => xi(j)<xi(j+1) & zi(j)<zi(j+1)) & m>2 & (xi;x) = (zi;z)', |
| 3286 | | '-evalt', 'x = ["A","G","G","Z","G"] & z = ["A","G","T","G","G","T","G"] & n = min({size(x),size(z)}) & m :1..n & xi: 1..m >-> 1..size(x) & zi: 1..m >-> 1..size(z) & !j.(j:1..(m-1) => xi(j)<xi(j+1) & zi(j)<zi(j+1)) & m>3 & (xi;x) = (zi;z)', |
| 3287 | | '-evalf', 'x = ["A","G","G"] & z = ["A","G","T","G","G"] & n = min({size(x),size(z)}) & m :1..n & xi: 1..m >-> 1..size(x) & zi: 1..m >-> 1..size(z) & !i.(i:1..m => x(xi(i)) = z(zi(i))) & !j.(j:1..(m-1) => xi(j)<xi(j+1) & zi(j)<zi(j+1)) & m>3 & sol1 = (xi;x) & sol2 = (zi;z)' ], 'find longest common substring example'). |
| 3288 | | cli_testcase(1529, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', |
| 3289 | | '-csp_assertion', 'MAIN |= LTL: \"G ([b.blue.blue] => X [c.blue.blue])\"', |
| 3290 | | '-csp_assertion', 'MAIN |= LTL: \"G ([i.2] => X [j.3])\"', |
| 3291 | | '-csp_assertion', 'MAIN |= LTL: \"G ([a.red] => X e(b.red._))\"', |
| 3292 | | '-csp_assertion', 'MAIN |= CTL: \"EGAF e(a.red)\"' , '-strict' |
| 3293 | | ], 'Check LTL and CTL assertions (all are satisfied by the MAIN process).'). |
| 3294 | | cli_testcase(1530, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', |
| 3295 | | '-csp_assertion', 'MAIN |= LTL: \"G ([i.2] => X [j.4])\"', '-expcterr', model_check_fails, '-strict' |
| 3296 | | ], 'Check LTL assertion (check should fail).'). |
| 3297 | | cli_testcase(1531, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', |
| 3298 | | '-csp_assertion', 'MAIN |= CTL: \"AGAF e(a.red)\"', '-strict' |
| 3299 | | ], 'Check CTL assertion (check should not fail).'). |
| 3300 | | cli_testcase(1532, [cbc,hash], ['../prob_examples/public_examples/B/Tickets/FiveWayTraffic/FiveWay_new_mch.eventb', |
| 3301 | | '-mc', 1000, '-strict','-cc', '29', '65', '--hash64',591402958158885188 % used to be 971801032035978952 |
| 3302 | | ], 'Check no time-out for setup-constants (relational image for singleton set).'). |
| 3303 | | cli_testcase(1533, [cbc,disprover], [ |
| 3304 | | '../prob_examples/public_examples/B/Tickets/FiveWayTraffic/TwoWay_mch.pl', |
| 3305 | | '../prob_examples/public_examples/B/Tickets/FiveWayTraffic/Traffic_Context2_prob_ctx.pl' |
| 3306 | | %, '../prob_examples/public_examples/B/Tickets/FiveWayTraffic/FiveWay_new_prob_mch.pl' % requires higher-timeout |
| 3307 | | ],'Check Disprover can prove all POs'). |
| 3308 | | cli_testcase(1534, [cbc,union,card], [ |
| 3309 | | '-evalt', 'card({x,y| { x \\/ y } <: {{1} \\/ {2}}}) = 9' % { x \/ y } <: {{1} \/ {2}} from Grieskamp Zeta paper |
| 3310 | | ], 'check set comprehenion can be computed without enum warning (union constraint propagation)'). |
| 3311 | | cli_testcase(1535, [cbc,card], [ |
| 3312 | | '-evalt', '{x,y| x = {1,2} & x \\/ y = {1,2,3} & 1:y } = {({1,2}|->{1,3}),({1,2}|->{1,2,3})}' |
| 3313 | | ,'-evalt', 'card({x,y| x<:1..3 & y<:1..3 & ( x \\/ y) = (1..3) }) = 27' |
| 3314 | | ,'-evalt', 'card({x,y| { x \\/ y } <: {{1} \\/ {2} \\/ {3}} }) = 27' |
| 3315 | | ,'-evalt', '{x,y| x = {1,2} & x \\/ y = 1..5 & 1:y } = {({1,2}|->{1,2,3,4,5}),({1,2}|->{1,3,4,5})}' |
| 3316 | | ,'-evalt', '{x,y| x = {1,2} & x \\/ y = 1..5 } = {({1,2}|->{1,2,3,4,5}),({1,2}|->{1,3,4,5}),({1,2}|->{2,3,4,5}),({1,2}|->{3,4,5})}' |
| 3317 | | ,'-evalt', 'card({x,y| x \\/ y = 1..5 }) = 243' |
| 3318 | | ], 'Check kernel bug in add_element and copy_list_skeleton fixed'). |
| 3319 | | cli_testcase(1536, [cbc], [ |
| 3320 | | '-evalt', 'sqr = %x.(x>=0|x*x) & (sqr)[{xx}] = {2500}' |
| 3321 | | , '-evalt', 'sqr = %x.(x>=0&x<52|x*x) & (sqr)[{xx}] = {2500}' |
| 3322 | | , '-evalt', 'sqr = %x.(x>=0|x*x) & (sqr)[{xx,vv}] = {2500}' |
| 3323 | | ], 'check no enum warning (image propagation)'). |
| 3324 | | cli_testcase(1537, [tickets,laws], [ |
| 3325 | | '-evalf', 'x:0..5 & (-2) ** x = (8)' |
| 3326 | | , '-evalt', 'x:0..5 & (-2) ** x = -8' |
| 3327 | | , '-evalt', '{x|x>0 & (-2) ** x = -8} = {3}' |
| 3328 | | , '-evalf', 'x:0..3 & (-1) ** x = (-46)' |
| 3329 | | , '-evalf', 'x:-18..-11 & -1 ** x = -46' |
| 3330 | | , '-evalt', '{x|x:0..5 & (-1) ** x = -1} = {1,3,5}' |
| 3331 | | , '-evalt', '{x|x:0..5 & (-1) ** x = 1} = {0,2,4}' |
| 3332 | | , '-evalt', '{x|x:0..5 & (1) ** x = 1} = 0..5' |
| 3333 | | % , '-evalf', 'x=2 & x**y <1 & y>0' % check propagation |
| 3334 | | , '-evalf', 'x:INTEGER & x**1 /= x' % check propagation |
| 3335 | | , '-evalf', 'x:INTEGER & x**0 /= 1' % check propagation |
| 3336 | | , '-evalf', '1**x /= 1 & x>0' % check propagation |
| 3337 | | ], 'check no instantiation error when base is 1 or -1'). |
| 3338 | | cli_testcase(1538, [kodkod], [ '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 3339 | | '-evalt', ':kodkod 2+3=x' % check no warning because nothing for kodkod to solve |
| 3340 | | ,'-evalt', ':kodkod G = %x.(x:1..n|(x+1) mod n) & A\\/B = dom(G)\\/ran(G) & A/\\B={} & G[A]<:B & G[B]<:A & n=15 & 1:A' % bipartite graph detection |
| 3341 | | ], 'check no warning and :kodkod works'). |
| 3342 | | cli_testcase(1539, [laws,tla],['../prob_examples/public_examples/TLC/Laws/NegDivision.tla', '-mc', 1000, '-strict'], 'Test that the division semantics of TLA preserved.'). |
| 3343 | | cli_testcase(1540, [laws,proz,sequences],['../prob_examples/public_examples/Z/ZLive/IntegerTests.fuzz', |
| 3344 | | '../prob_examples/public_examples/Z/ZLive/SetTests.fuzz', |
| 3345 | | '../prob_examples/public_examples/Z/ZLive/SequenceTests.fuzz', |
| 3346 | | '../prob_examples/public_examples/Z/ZLive/RelationTests.fuzz', |
| 3347 | | '../prob_examples/public_examples/Z/ZLive/FreeTypeTests.fuzz', |
| 3348 | | '../prob_examples/public_examples/Z/ZLive/MiscTests.fuzz', |
| 3349 | | '../prob_examples/public_examples/Z/ZLive/LetTests.fuzz', |
| 3350 | | '-mc', 1000, '-nodead', '-strict'], 'Test Integer Z laws and that the division semantics of Z is preserved.'). |
| 3351 | | cli_testcase(1541, [cbc], [ |
| 3352 | | '-evalt', '2 : ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', |
| 3353 | | '-evalt', '-2 /: ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', |
| 3354 | | '-evalt', '1 /: ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', |
| 3355 | | '-evalt', '-10..1 /\\ ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)}) = {}', |
| 3356 | | '-evalt', '-10..10 /\\ ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)}) = 2..10', |
| 3357 | | '-evalf', '-2 : ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', |
| 3358 | | '-evalt', '2:ran({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 & z<10)})', |
| 3359 | | '-evalt', '22:ran({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1)})', |
| 3360 | | '-evalt', '1/:ran({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 )})', |
| 3361 | | '-evalt', '1 : dom({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', |
| 3362 | | '-evalt', '(TRUE,TRUE):dom({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 )})', |
| 3363 | | '-evalf', '(TRUE,FALSE):dom({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 )})' |
| 3364 | | ],'ensure proper symbolic treatment for domain/range'). |
| 3365 | | cli_testcase(1542, [cbc], [ |
| 3366 | | '-evalf', '{x|x>100 & x mod 102 = 2} = {}', |
| 3367 | | '-evalf', '%x.(x>100 & x mod 102 = 2|x*x) = {}', |
| 3368 | | '-evalt', '{x|x>100 & x mod 102 = 2} /\\ {x| x<100 & x mod 102 =2} = {}', |
| 3369 | | '-evalt', '%x.(x>100 & x mod 102 = 2|x*x) /= {}', |
| 3370 | | '-evalt', '{x|x>100 & x mod 102 = 2} /= {}', |
| 3371 | | '-evalt', '{x|x*x < i & x>2} ={} & i>2', |
| 3372 | | '-evalt', '{x|x*x < i & x>2} /= {} & i>9', |
| 3373 | | '-evalt', '{x|x<20} /= {}', |
| 3374 | | '-evalf', '{x|x<20} = {}' |
| 3375 | | ], 'symbolic treatment of closure emptiness'). |
| 3376 | | cli_testcase(1543, [b_test,tickets], |
| 3377 | | ['../prob_examples/public_examples/B/Tickets/Beauger2/bug_not_labels_corrected.mch', '-aa', 0,3,0, |
| 3378 | | '-ppf', '../prob_examples/public_examples/B/Tickets/Beauger2/bug_not_labels_corrected_ppf.mch' |
| 3379 | | ], 'Check that labels correctly assigned.'). |
| 3380 | | cli_testcase(1544, [b_test,trees],['../prob_examples/public_examples/B/Tester/TreeExample.mch', |
| 3381 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-assertions', '-init', '-strict'], 'Test that the Atelier-B tree operators supported.'). |
| 3382 | | cli_testcase(1545, [laws], ['../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 3383 | | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', |
| 3384 | | '-mc', '100000', '-cs', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', |
| 3385 | | '-p', 'NORMALIZE_AST', 'TRUE'], 'Various arithmetic laws with AST Normalization.'). |
| 3386 | | cli_testcase(1546, [cbc,trees,sequences], [ |
| 3387 | | '-evalt', '{si|si : dom((%u.(u : seq(INTEGER)|[1] ^ u) ; {[1] |-> 33,[1,2] |-> 55})) & si/=[]} = {[2]}', |
| 3388 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3389 | | '-evalt', 'arity({[]|->22,[1]|->33,[1,1]|->44,[1,2]|->55},[1])=2' |
| 3390 | | ], 'ensure proper constraint solving/propagation for sequence concatenation'). |
| 3391 | | cli_testcase(1547, [laws,trees,sequences], ['../prob_examples/public_examples/B/Laws/TreeLaws.mch', |
| 3392 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-mc', '100', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Laws about trees'). |
| 3393 | | cli_testcase(1548, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/Ivo/Tickets/Test2.mch', '-ltlformula', 'WEF => not (GF {addr=2} & GF [C])', '-expcterr', ltl, '-strict'], 'Test fairness implementation for finding the right counter example.'). |
| 3394 | | cli_testcase(1549, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/Ivo/Tickets/Test2.mch', '-ltlformula', 'SEF => not (GF {addr=2} & GF [C])', '-strict'], ''). |
| 3395 | | cli_testcase(1550, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3396 | | '-evalt', 'not((y > 0 & y * y > 20) <=> (y * y > 25 & y > 0))', |
| 3397 | | '-evalf', 'not((y > 0 & y * y > 20) <=> (y * y > 21 & y > 0))' |
| 3398 | | ], 'test constraint solving for <=>'). |
| 3399 | | cli_testcase(1551, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3400 | | '-evalt', '{b|[a,b,c](2)=333} =res & a : res & b:res' |
| 3401 | | ], 'test constraint solving and compilation of closures (apply sequence extension)'). |
| 3402 | | cli_testcase(1552, [cbc,trees], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3403 | | '-evalt', 'a = {(1, {([]|->2)} ), (2, const(1, [a(1)]))}', |
| 3404 | | '-evalt', 'a = {1 |-> {[] |-> 2}, 2 |-> (dom({pi,ff,p|((pi : seq(INTEGER) & ff : INTEGER) & p : seq(INTEGER)) & (p |-> ff : [a(1)](1) & pi = 1 -> p)}) \\/ {[] |-> 1})}', |
| 3405 | | '-evalt', 'a : 1..2 --> tree({1,2}) & a = {(2, bin(2)), (1, const(1, [a(2)]))}' |
| 3406 | | ], 'test constraint solving and compilation of closures (function application)'). |
| 3407 | | cli_testcase(1553, [csp_test], [ |
| 3408 | | '../prob_examples/public_examples/CSP/Tickets/Ivo/RenamedSymbol.csp', '-assertions', '-strict'], |
| 3409 | | ''). |
| 3410 | | cli_testcase(1554, [tickets,while],['../prob_examples/public_examples/B/Tickets/Hansen18_While/Loop.mch', |
| 3411 | | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopBy2.mch', |
| 3412 | | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopByDouble.mch', |
| 3413 | | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopByTwiceSeqComp.mch', |
| 3414 | | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopByClash.mch', |
| 3415 | | '-t', '-mc', 100, '-strict'], |
| 3416 | | 'Check compilation of operation calls inside while loop.'). |
| 3417 | | cli_testcase(1555, [tickets,cbc,slot,trees],[ |
| 3418 | | '../prob_examples/public_examples/B/Tickets/Schneider2_Trees/NewSolver_v2.mch', |
| 3419 | | '../prob_examples/public_examples/B/Tickets/Schneider2_Trees/NewSolver_v3.mch', |
| 3420 | | '-evalt', 'CHOOSE_MODULES("bk-phi-H-2013", solution)'], 'Test constraint solving with trees'). |
| 3421 | | cli_testcase(1556, [cbc],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3422 | | '../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_PowBool_ctx.eventb', |
| 3423 | | '../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_FiniteInt_ctx.eventb', |
| 3424 | | '-cbc_assertion', 'Gesetze:assoc1', '-cbc_assertion', 'Gesetze:assoc2', |
| 3425 | | '-cbc_assertion', 'Gesetze:comm1', '-cbc_assertion', 'Gesetze:comm2', |
| 3426 | | '-cbc_assertion', 'Gesetze:DeMorgan1', '-cbc_assertion', 'Gesetze:DeMorgan2', |
| 3427 | | '-p', 'PROOF_INFO', 'FALSE'], 'Test cbc assertion with label works'). |
| 3428 | | cli_testcase(1557, [laws],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3429 | | '../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_Bool_ctx.eventb', |
| 3430 | | '../prob_examples/public_examples/EventBPrologPackages/Laws/KuratowskiPairDefinition_Enum_ctx.eventb', |
| 3431 | | %'../prob_examples/public_examples/EventBPrologPackages/Laws/KuratowskiPairDefinition_Int_ctx.eventb', |
| 3432 | | %'../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_PowBool_ctx.eventb', % tales 24 seconds |
| 3433 | | '-cbc_assertions', '-p', 'PROOF_INFO', 'FALSE'], 'Test laws over sets using cbc'). |
| 3434 | | cli_testcase(1558, [cbc,card],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3435 | | '-evalt', 'f: 1..40 --> BOOL & card({x|x|->TRUE:((1..40)*BOOL) & x|->TRUE :f}) : 10..11', % did not work before |
| 3436 | | '-evalt', 'f: 1..40 --> BOOL & card({x|x:1..40 & x|->TRUE :f}) : 10..11' |
| 3437 | | ], 'Test reification of closure for cardinality'). |
| 3438 | | cli_testcase(1559, [cbc,tickets,card],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3439 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/EinsteinPuzzle/UnsatCore_einstein_ctx_v2.mch', '-init', |
| 3440 | | '-evalt', 't: Menschen >-> Getraenke & Daene |-> Tee : t', |
| 3441 | | '-evalt', 't: Menschen -->> Getraenke & Daene |-> Tee : t', |
| 3442 | | '-evalt', 't: Menschen --> Getraenke & Daene |-> Tee : t', |
| 3443 | | '-evalt', 't: Menschen >->> Getraenke & Daene |-> Tee : t' |
| 3444 | | ], 'Test reification of closure for cardinality'). |
| 3445 | | cli_testcase(1560, [cbc,card], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3446 | | '-evalf', 'n>=0 & n1>0 & {n1} \\/ {n} = r & r={n} & not(n1=n)', |
| 3447 | | '-evalf', '{n} /<: {n,n1} & n:INTEGER', |
| 3448 | | '-evalf', '0..B <: 1..B & B:1..1000000', |
| 3449 | | '-evalf', '0..x <: 1..1000 & x>0', |
| 3450 | | '-evalt', '{x|x>0} <: NATURAL1', |
| 3451 | | '-evalf', 'x:seq1(0..1) & x:seq1(2..3)', |
| 3452 | | '-evalt', 'a..b = {x} & x:100..1002', |
| 3453 | | '-evalt', 'x <: (1..100000000 \\/ {-1}) & x={}', |
| 3454 | | '-evalt', 'card(iseq1(1 .. 3) \\/ {{}}) = 16', |
| 3455 | | '-evalt', 'bool(!x.(x<:1..10 => card(x) <11))', |
| 3456 | | '-evalt', 'r:INTEGER<->INTEGER & dom(r)=1..4', |
| 3457 | | '-evalt', 'r:INTEGER<->INTEGER & ran(r)=2..20 & dom(r) = 1..10', |
| 3458 | | '-evalf', '{x|x>20} = {1,y,5,x,4}', |
| 3459 | | '-evalf', '{x|x>20} = y & 1:y', |
| 3460 | | '-evalt', '{x|x>20} = y & 21:y', |
| 3461 | | '-evalf', '2..b = {1,y,5,x,4}', |
| 3462 | | '-evalt', '{X| X /\\ {1} = {} & X \\/ {1} = 1..20} = {2..20}', |
| 3463 | | '-evalt', 'a..b = {x} & x:100..1002', |
| 3464 | | '-eval', '{x|[1,2,3,4,5,6] |>> {x} = [1,2,3,4,5]}', |
| 3465 | | '-eval', '{x|[33] |>> {x} = []}', |
| 3466 | | '-evalt', 'all = [S,E,N,D, M,O,R, Y] & {S,E,N,D, M,O,R, Y} <: 0..9 & S >0 & M >0 & card(ran(all)) = size(all) & S*1000 + E*100 + N*10 + D + M*1000 + O*100 + R*10 + E = M*10000 + O*1000 + N*100 + E*10 + Y' |
| 3467 | | ], 'test a few constraints from the ProB-TO-DO-List'). |
| 3468 | | cli_testcase(1561, [cbc], [ |
| 3469 | | '-evalf', 'not(#x.(x>100))', |
| 3470 | | '-evalt', '1..b = {1,y,5,x,4}', |
| 3471 | | '-evalt', 'a..b = {1,y,5,x,4}' |
| 3472 | | ], 'test a few constraints from the ProB-TO-DO-List (with enum warning)'). |
| 3473 | | cli_testcase(1562, [slot,trees,parser,card],[ |
| 3474 | | '../prob_examples/public_examples/B/Tickets/Schneider5_Trees/Solver.mch', |
| 3475 | | '-p', 'TIME_OUT', 35000, |
| 3476 | | '-evalt', '%(x).(x : dom(course_module_combinations) & card(course_module_combinations(x)) > 0|1)={("bk-phi-H-2013"|->1)}', |
| 3477 | | '-evalt', '%(x).(x : dom(course_module_combinations) & course_module_combinations(x) /= {} |1)={("bk-phi-H-2013"|->1)}' |
| 3478 | | % '-evalt', '%(x).(x : dom(course_module_combinations) & card(course_module_combinations(x)) > 1|1)={("bk-phi-H-2013"|->1)}' % still causes problem |
| 3479 | | ], 'Test no complicated set-unification with backtracking'). |
| 3480 | | cli_testcase(1563, [parser,tickets], [ |
| 3481 | | '../prob_examples/public_examples/B/Tickets/CommentsOneLine/OneLineComments.mch', '-t' |
| 3482 | | ], 'Test parser can deal with one line comments'). |
| 3483 | | cli_testcase(1564, [kodkod], [ '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 3484 | | '-evalf', 'x:0..3 & y:0..3 & (x*y)+7<0', |
| 3485 | | '-evalf', ':kodkod x:0..3 & y:0..3 & (x*y)+7<0' |
| 3486 | | ], 'Test Kodkod bug fixed'). |
| 3487 | | cli_testcase(1565, [fairness], [ |
| 3488 | | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs2.mch', '-ltlformula', 'SF(E) & WF(C) => F {addr = 4 or addr = 5}', '-expcterr', 'ltl', '-strict'], 'Test finding the right fairness loop.'). |
| 3489 | | cli_testcase(1566, [fairness], [ |
| 3490 | | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs2.mch', '-ltlformula', 'SF(C) & SF(E) & SF(G) => F {addr = 4 or addr = 5}', '-expcterr', 'ltl', '-strict'], 'Test finding the right fairness loop.'). |
| 3491 | | cli_testcase(1567, [fairness], [ |
| 3492 | | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs2.mch', '-ltlformula', 'SEF => F {addr = 4 or addr = 5}', '-strict'], 'Testing the fairness algorithm.'). |
| 3493 | | cli_testcase(1568, [fairness], [ |
| 3494 | | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs3.mch', '-ltlformula', 'SF(E) & SF(D) => F { addr = 8}', '-expcterr', 'ltl', '-strict'], 'Test finding the right fairness loop.'). |
| 3495 | | cli_testcase(1569, [fairness], [ |
| 3496 | | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs3.mch', '-ltlformula', 'SF(B) & SF(G) & SF(E) & SF(D) => F { addr = 8}', '-expcterr', 'ltl', '-strict'], 'Test finding the right fairness loop.'). |
| 3497 | | cli_testcase(1570, [fairness], [ |
| 3498 | | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs3.mch', '-ltlformula', 'WEF => F { addr = 8}', '-expcterr', 'ltl', '-strict'], 'Test finding the right fairness loop.'). |
| 3499 | | cli_testcase(1571, [fairness], [ |
| 3500 | | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs3.mch', '-ltlformula', 'SEF => F { addr = 8}', '-strict'], 'Testing the fairness checking algorithm.'). |
| 3501 | | cli_testcase(1572, [fairness], [ |
| 3502 | | '../prob_examples/public_examples/CSP/LTL/Fairness/bully.csp', '-csp_assertion', 'Network |= LTL: \"WEF => G ([fail.2] => F [coordinator.1.2])\"', '-expcterr', 'model_check_fails', '-strict'], 'Test finding the right fairness loop.'). |
| 3503 | | cli_testcase(1573, [fairness], [ |
| 3504 | | '../prob_examples/public_examples/CSP/LTL/Fairness/bully.csp', '-csp_assertion', 'Network |= LTL: \"SEF => G ([fail.2] => F [coordinator.1.2])\"', '-expcterr', 'model_check_fails', '-strict'], 'Test finding the right fairness loop.'). |
| 3505 | | cli_testcase(1574, [chr,card], ['-p', 'CHR', 'TRUE', '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3506 | | '-evalt', '{x,y,s|x..y <: 11..18 & card(x..y)=s & x=y} = {((11|->11)|->1),((12|->12)|->1),((13|->13)|->1),((14|->14)|->1),((15|->15)|->1),((16|->16)|->1),((17|->17)|->1),((18|->18)|->1)}', |
| 3507 | | '-evalt', '{x,y|x..y <: 11..18 & card(x..y)=5 & x<y} = {(11|->15),(12|->16),(13|->17),(14|->18)}' |
| 3508 | | ], 'Test CHR interval propagation'). |
| 3509 | | cli_testcase(1575, [external, b_test], [ |
| 3510 | | '../prob_examples/public_examples/B/ExternalFunctions/CSV_Reader.mch', |
| 3511 | | '../prob_examples/public_examples/B/ExternalFunctions/CSV/ChemicalElements.mch', '-t'], 'test CSV reader.'). |
| 3512 | | cli_testcase(1576, [chr], ['-p', 'CHR', 'TRUE', |
| 3513 | | '-evalt', 'x+y=100 & x>y', |
| 3514 | | '-evalt', 'x=100-y & x>y' |
| 3515 | | ], 'Test stronger CHR IDL propagation'). |
| 3516 | | cli_testcase(1577, [cbc,union,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3517 | | '-evalt', 'x = NATURAL1 \\/ -3..-1 & 11:x & -3:x & 0 /: x', |
| 3518 | | '-evalt', '-3..-1 \\/ NATURAL1 = x & 11:x & -3:x & 0 /: x', |
| 3519 | | '-evalt', 'x = NATURAL1 \\/ {-1} & 11:x & -1:x & 0 /: x', |
| 3520 | | '-evalt', 'x = NATURAL1 \\/ {-1,-3} & 11:x & -1:x & -3:x & 0 /: x', |
| 3521 | | '-evalt', 'x = {-1,-33} \\/ NATURAL1 & 11:x & -1:x & -33:x & 0 /: x' |
| 3522 | | ], 'Test better symbolic treatment of union'). |
| 3523 | | cli_testcase(1578, [cbc,bmc], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-bmc', 5, |
| 3524 | | '-expcterr', 'invariant_violation'], 'Check error found using bmc'). |
| 3525 | | cli_testcase(1579, [cbc,bmc,clpfd_tables], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v3.mch', '-bmc', 10, |
| 3526 | | '-expcterr', 'invariant_violation', '-p', 'TIME_OUT', 3500], 'Check error found using bmc'). % increased time-out for windows runner from default 2500, Feb 17th 2020 |
| 3527 | | cli_testcase(1580, [symbolic_model_checker], [ |
| 3528 | | '../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v1.mch', |
| 3529 | | %'../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', % fails with SICStus 4.5; fd_degree behaves differently |
| 3530 | | '-symbolic_model_check', 'bmc', |
| 3531 | | '-p', 'TRACE_INFO', 'TRUE', |
| 3532 | | '-expcterr', 'invariant_violation'], 'Check error found using BMC'). |
| 3533 | | cli_testcase(1582, [symbolic_model_checker], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-symbolic_model_check', 'ic3', |
| 3534 | | '-expcterr', 'invariant_violation'], 'Check error found using IC3'). |
| 3535 | | cli_testcase(1583, [symbolic_model_checker], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-symbolic_model_check', 'ctigar', |
| 3536 | | '-expcterr', 'invariant_violation'], 'Check error found using CTIGAR'). |
| 3537 | | cli_testcase(1584, [symbolic_model_checker], [ |
| 3538 | | '../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v1.mch', |
| 3539 | | % '../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', % fails with SICStus 4.5; see test 1580 |
| 3540 | | '-symbolic_model_check', 'bmc', |
| 3541 | | '-expcterr', 'invariant_violation'], 'Check error found using BMC'). |
| 3542 | | cli_testcase(1585, [symbolic_model_checker], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-symbolic_model_check', 'kinduction', |
| 3543 | | '-expcterr', 'invariant_violation'], 'Check error found using k-Induction'). |
| 3544 | | cli_testcase(1586, [cbc,wd,error_checks,union], ['-p', 'TRY_FIND_ABORT', 'TRUE', |
| 3545 | | '-evalnwd', 'r = {1|->2, 2|-> 1/0}(1)', |
| 3546 | | '-expcterr', 'well_definedness_error' |
| 3547 | | ], 'Test better symbolic treatment of union'). |
| 3548 | | cli_testcase(1587, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3549 | | '-evalt', 'x:0..127 & y:0..127 & x2=x & y2=y+1 & not(x2:0..127 & y2:0..127)', |
| 3550 | | '-evalt', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..20)', |
| 3551 | | '-evalf', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..21)' |
| 3552 | | ], 'Test inlining of id1=id2 equalities and subsequent detection of identical predicates'). |
| 3553 | | cli_testcase(1588, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3554 | | '-p', 'CLPFD', 'FALSE', |
| 3555 | | '-evalt', 'x:0..127 & y:0..127 & x2=x & y2=y+1 & not(x2:0..127 & y2:0..127)', |
| 3556 | | '-evalt', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..20)' |
| 3557 | | % '-evalf', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..21)' requires CLPFD |
| 3558 | | ], 'Test 1587 without CLPFD'). |
| 3559 | | cli_testcase(1589, [cbc,forall], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3560 | | '../prob_examples/public_examples/B/Tickets/ForallDomainExpansion/UnsatCore.mch', |
| 3561 | | '-init' |
| 3562 | | ],'Test that forall with domain is expanded'). |
| 3563 | | cli_testcase(1590, [cbc,bmc,forall], [ |
| 3564 | | '../prob_examples/public_examples/B/Tickets/ForallDomainExpansion/binarySearchFail_impl_prob_mch.eventb', |
| 3565 | | '-bmc', 10, '-expcterr', 'invariant_violation' |
| 3566 | | ],'Test that forall with domain is expanded and BMC finds problem'). |
| 3567 | | |
| 3568 | | cli_testcase(1591, [tla,tlc],['../prob_examples/public_examples/B/SymmetryReduction/Peterson.mch', '-mc_with_tlc'], 'TLC regression test'). |
| 3569 | | cli_testcase(1592, [tla,tlc],['../prob_examples/public_examples/B/SymmetryReduction/Peterson_err.mch', '-mc_with_tlc' |
| 3570 | | %, '-expcterr', 'invariant_violation' % currently there is no feedback to probcli about invariant violations found |
| 3571 | | ], 'TLC regression test'). |
| 3572 | | cli_testcase(1593, [puzzles_test],['../prob_examples/public_examples/B/Puzzles/Bridges.mch', '-init' |
| 3573 | | ], 'Bridges Puzzle'). |
| 3574 | | cli_testcase(1594, [cbc,sigma,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3575 | | '-evalt', 'SIGMA(x).(x:M|30) = 3000 & M<:1..100', |
| 3576 | | '-evalt', '{M|SIGMA(x).(x:M|30) = 300 & M<:1..10} = {1..10}', |
| 3577 | | '-evalt', '{M|SIGMA(x).(x:M|30) = 270 & M<:1..10}=res & card(res)=10', |
| 3578 | | % this is slow: {M|SIGMA(x).(x:M|30) = 570 & M<:1..20}=res & card(res)=20; 17 seconds |
| 3579 | | % this does not work: {M|SIGMA(x).(x:M|30) = 3000 & M<:1..100} |
| 3580 | | '-evalt', 'SIGMA(x).(x:M|cp(x)) = 3000 & M=1..100 & cp:M --> {0,15,30}', |
| 3581 | | '-evalt', 'M=1..20 & {cp|SIGMA(x).(x:M|cp(x)) = 570 & cp:M --> {0,30}}=res & card(res)=20', |
| 3582 | | '-evalt', 'M=1..100 & {cp|SIGMA(x).(x:M|cp(x)) = 3000 & cp:M --> {0,15,30}}=res & card(res)=1', |
| 3583 | | '-evalt', 'PI(x).(x:{-1} \\/ 1..20|x) = -2432902008176640000', |
| 3584 | | '-evalt', 'PI(x).(x:M|20) = 400 & M<:1..10', |
| 3585 | | '-evalf', 'SIGMA(x).(x:M|20) = 50 & M<:1..10', |
| 3586 | | '-evalf', 'PI(x).(x:M|20) = 500 & M<:1..10' |
| 3587 | | ], 'Test SIGMA and PI'). |
| 3588 | | cli_testcase(1595, [tickets,eventb_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3589 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/TheoremInGuards/TestM1_mch.eventb', |
| 3590 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/TheoremInGuards/VM_1_mch.eventb', |
| 3591 | | '-t', '-mc', 100 ], 'Test theorem in guards can use dropped abstract variables'). |
| 3592 | | cli_testcase(1596, [tickets,eventb_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3593 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/TheoremInGuards/TestM1_error_mch.eventb', |
| 3594 | | '-mc', 100, '-expcterr', 'event_error:teste:invalid_theorem_in_guard' |
| 3595 | | ], 'Test theorem in guards can use dropped abstract variables and error found'). |
| 3596 | | cli_testcase(1597, [tickets,tla,exists],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3597 | | '../prob_examples/public_examples/B/Tickets/ExistsEnumeration/MC_AlternatingBit_Internal.mch', |
| 3598 | | '-t', '-mc', 500 , '-expcterr', 'model_check_incomplete'], 'Test no problem with LoseAck action and existential quantifier'). |
| 3599 | | cli_testcase(1598, [tickets,tla,hash],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3600 | | '../prob_examples/public_examples/TLA/TLA_Distribution/FIFO/MCInnerFIFO.mch', '-scope', 'card(q)<=qLen', |
| 3601 | | '-p', 'MAX_INITIALISATIONS', 40, |
| 3602 | | '-mc', 6000, '-cc', 5810, 9661 , '--hash64', 66366088829346955 % used to be 523977694511884201 |
| 3603 | | ], 'Test SCOPE works correctly'). |
| 3604 | | cli_testcase(1599, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3605 | | '-expcterr', 'bmachine_static_checks', |
| 3606 | | '../prob_examples/public_examples/B/Tester/ExistentialGlobalSetIDTest.mch', '-mc', '1000', |
| 3607 | | '-evalt', '#(ID).( cc /: ID & dom({x,y|x=1 & y:ID}) = {})' |
| 3608 | | ], 'Check that local identifier ID does not confuse optimiser'). |
| 3609 | | cli_testcase(1600, [tickets,private,quantified,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3610 | | '../prob_examples/examples/B/Tickets/MemoryError_bugly.mch', '-init', '-assertions' |
| 3611 | | ], 'Check that UNION and dom(dom()) memory consumption issue solved'). |
| 3612 | | cli_testcase(1601, [b_test, imp, refinement,private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3613 | | '../prob_examples/examples/B/ClearSy/turbomeca/pld_i.imp', |
| 3614 | | '../prob_examples/examples/B/ClearSy/control/M1_i.imp', |
| 3615 | | '../prob_examples/examples/B/ClearSy/JCRE/opcodes_i.imp', '-t' |
| 3616 | | ], 'Check implementation machines'). |
| 3617 | | cli_testcase(1602, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3618 | | '../prob_examples/public_examples/B/SchneiderBook/Chapter17/Array.mch','-t' |
| 3619 | | ], 'Check Schneider example'). |
| 3620 | | cli_testcase(1603, [private,alstom,data_validation], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3621 | | '../prob_examples/examples/B/Alstom/exemple7.mch', |
| 3622 | | '../prob_examples/examples/B/Alstom/exemple7_occuper_zone.mch', |
| 3623 | | '-t' |
| 3624 | | ], 'Check Alstom machines'). |
| 3625 | | cli_testcase(1604, [eventb_test,private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3626 | | '../prob_examples/examples/RodinModels/PaulSimon/ca_m01_mch.eventb', |
| 3627 | | '-p', 'MAX_INITIALISATIONS', '30', '-p', 'MAX_OPERATIONS', '30', |
| 3628 | | '-p', 'DEFAULT_SETSIZE', '3', |
| 3629 | | '-t' |
| 3630 | | ], 'Check Paul Simon complicated EventB machine'). |
| 3631 | | cli_testcase(1605, [cbc, infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3632 | | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER --> {0}', |
| 3633 | | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> {0}', |
| 3634 | | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> {u}', |
| 3635 | | '-evalt', 'f = %x.(x:INTEGER|0) & {u|f : INTEGER +-> {u}} = {0}', |
| 3636 | | '-evalt', 'f = %x.(x:INTEGER|0) & {u|f : INTEGER --> {u}} = {0}', |
| 3637 | | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> NATURAL', |
| 3638 | | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER --> NATURAL', |
| 3639 | | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> 0..2', |
| 3640 | | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> 1..2', |
| 3641 | | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER --> 1..2', |
| 3642 | | '-evalt', 'f = %x.(x:INTEGER|1000) & f : INTEGER +-> 999..1002', |
| 3643 | | '-evalt', 'f = %x.(x:INTEGER|1000) & f : INTEGER --> 999..1002', |
| 3644 | | '-evalt', 'f = INTEGER*{1000} & f : INTEGER --> 999..1002', |
| 3645 | | '-evalt', 'f = %x.(x:INTEGER|1000) & f = INTEGER*{1000}', |
| 3646 | | '-evalf', 'f = %x.(x:INTEGER|1000) & f = INTEGER*{1001}', |
| 3647 | | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> NATURAL1', |
| 3648 | | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER -->> {0}', |
| 3649 | | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER -->> {0,1}', |
| 3650 | | '-evalt', 'f = %x.(x/=0|1000/x) & f : INTEGER +-> INTEGER & f(500)=2', |
| 3651 | | '-evalf', 'f = %x.(x/=0|1000/x) & f : INTEGER --> INTEGER', |
| 3652 | | '-evalt', '{x|x/=0} = INTEGER \\ {0}', |
| 3653 | | '-evalf', '{x|x/=0} = INTEGER \\ {1}', |
| 3654 | | '-evalf', '{x|x/=0} /= INTEGER \\ {0}', |
| 3655 | | '-evalt', '{x|x/=0} /= INTEGER \\ {1}', |
| 3656 | | '-evalf', '{x|x/=0} = INTEGER', |
| 3657 | | '-evalt', '{x|x/=0} /= INTEGER', |
| 3658 | | '-evalf', 'INTEGER={x|x/=0}', |
| 3659 | | '-evalt', 'INTEGER/={x|x/=0}', |
| 3660 | | '-evalt', '{b|INTEGER={x|x/=0} <=> b=TRUE}={FALSE}', |
| 3661 | | '-evalt', 'NATURAL/={x|x/=0}', |
| 3662 | | '-evalt', 'NATURAL1/={x|x/=0}', |
| 3663 | | '-evalt', '{x|x/=0} /= NATURAL1', |
| 3664 | | '-evalf', '{x|x/=0} = NATURAL', |
| 3665 | | '-evalt', '{x,y,z|x <: BOOL & y = x*x & y:{z}-->{z}} = {({FALSE}|->{(FALSE|->FALSE)}|->FALSE),({TRUE}|->{(TRUE|->TRUE)}|->TRUE)}', |
| 3666 | | '-evalt', 'card({x,y,z|x <: BOOL & y = x*x & y/:{z}-->{z}})=6', |
| 3667 | | '-evalt', 'dom({x1,x2,y|x1 <: BOOL & x2<:BOOL & y = (x1*x2)*{TRUE} & y:(BOOL*{TRUE})+->{FALSE}}) = {({}|->{}),({}|->{FALSE}),({}|->{FALSE,TRUE}),({}|->{TRUE}),({FALSE}|->{}),({FALSE,TRUE}|->{}),({TRUE}|->{})}' |
| 3668 | | ], 'Check that %x.(x:P|E) is detected as cartesian product closure for dom_range_for_specific_closure'). |
| 3669 | | cli_testcase(1606, [cbc,card], [ |
| 3670 | | '-evalt', 'n=10000000 & x : (1..n) \\ {5000000}', |
| 3671 | | '-evalt', 'x:(1000..a) \\ {b}', |
| 3672 | | '-evalt', 'x: 1000..b /\\ 1500..c', |
| 3673 | | '-evalt', 'x:1000..2000 & x /: b..2000', |
| 3674 | | '-evalt', 'x:(1000..2000) \\ (b..2000)', |
| 3675 | | '-evalt', 'x:(1000..a) \\ (b..a)', |
| 3676 | | '-evalt', '{x,y| x:200..205 & y : 101..190 & x /: y..y+100} = {(202|->101),(203|->101),(203|->102),(204|->101),(204|->102),(204|->103),(205|->101),(205|->102),(205|->103),(205|->104)}', |
| 3677 | | '-evalt', 'card({x,y| x:200..295 & y : 101..190 & x /: y..y+100})=4455' |
| 3678 | | ], 'Test symbolic treatment of set-difference membership'). |
| 3679 | | cli_testcase(1607, [tickets,forall], ['../prob_examples/public_examples/B/Tester/TestAnyChoice.mch', |
| 3680 | | '-t', '-strict'], 'Test that definition can be used at top-level of forall quantifier'). |
| 3681 | | cli_testcase(1608, [symmetry_test,proz,card], ['../prob_examples/public_examples/Z/Daniel/Derrick_ICFEM06.fuzz', '-strict', |
| 3682 | | '-mc', '10000', '-cc', '29', '149' ], 'Test min card inference works.'). |
| 3683 | | cli_testcase(1609, [cbc,tickets], [ '-p', 'MAXINT', 2147483648, |
| 3684 | | '-evalt', 'x : NAT1 +-> {1,2,3} & (n:NAT & 1..n = dom(x)) & x /= {}' |
| 3685 | | ], 'Test that pf does not expand NAT1'). |
| 3686 | | cli_testcase(1610, [cbc,card], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3687 | | '-evalt', 'f=[{1},{3},{6,2,4,8},{1,2,3}] & x:1..4 & y=f(x) & card(y)>3', |
| 3688 | | '-evalt', '{f,x,y|f=[{1},{3},{6,2,4,8},{1,2,3}] & x:1..4 & y=f(x) & card(y)>3} = {(([{1},{3},{2,4,6,8},{1,2,3}]|->3)|->{2,4,6,8})}' |
| 3689 | | ], 'Test cardinality restriction'). |
| 3690 | | cli_testcase(1611, [b_test,sequences,card], ['-evalt', 'x:seq({1}) & 55:dom(x)', '-evalf', 'x:seq({1}) & 55:dom(x) & card(x)=10', '-evalt', 'x:seq({1}) & 5:dom(x) & card(x)>6', '-p', 'CLPFD', 'TRUE', '-strict' |
| 3691 | | %, '-expcterr', eval_string_enum_warning |
| 3692 | | ], 'Ensure proper enumeration of sequences (CLPFD=TRUE).'). % variation of test 1187 |
| 3693 | | cli_testcase(1612, [eventb_test, theories], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-assertions', |
| 3694 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestConcat_ctx.eventb', |
| 3695 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestMySequences_ctx_ok.eventb', |
| 3696 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestMySequences_ctx_ok2.eventb'], 'Check Sequence Theory Mapping.'). |
| 3697 | | cli_testcase(1613, [eventb_test, theories], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3698 | | '-assertions', '-expecterr', 'check_assertions', |
| 3699 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestMySequences_ctx_err.eventb'], |
| 3700 | | 'Check Sequence Theory Mapping leads to error (due to wrong mapping).'). |
| 3701 | | cli_testcase(1614, [eventb_test, theories], [ '-assertions', |
| 3702 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/MySequences_ctx.eventb'], 'Check Sequence Theory in context.'). |
| 3703 | | cli_testcase(1615, [cbc, cbc_tests,bmc], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/CounterArticle.mch', '-bmc', 4, |
| 3704 | | '-expcterr', 'invariant_violation'], 'Check BMC works'). |
| 3705 | | cli_testcase(1616, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/CounterArticle64_ok.mch', '-symbolic_model_check', 'kinduction'], 'Check kinduction works for this example'). |
| 3706 | | cli_testcase(1617, [bmc,tickets], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3707 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/bmc_unsat_axioms/f_m0.eventb', |
| 3708 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/bmc_unsat_axioms/f_m1.eventb', |
| 3709 | | '-bmc', 10], 'Check no counter example reported'). |
| 3710 | | cli_testcase(1618, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3711 | | '../prob_examples/public_examples/B/Mathematical/ArgumentationAsSets.mch', |
| 3712 | | '../prob_examples/public_examples/EventBPrologPackages/Mathematical/Arguments_Example_ctx.eventb', |
| 3713 | | '-assertions'], 'Check Argumentation Theory example'). |
| 3714 | | cli_testcase(1619, [b_test, infinite,total_function], ['-evalt', 'x mod 100000 >= 99999', |
| 3715 | | '-evalt', 'x : NATURAL --> {1,2,3}', |
| 3716 | | '-evalt', 'x : NATURAL --> {1,2,3} & x(7) = 3', |
| 3717 | | '-evalf', 'x : NATURAL --> {1,2,3} & x(7) = 3 & x(7) = 2', |
| 3718 | | '-evalt', 'not(x : INTEGER --> {1,2})', |
| 3719 | | '-evalf', 'y/=x & {x,y} = {x|x > 2}' |
| 3720 | | ], 'Ensure symbolic treatment of (infinite) total functions.'). |
| 3721 | | cli_testcase(1620, [b_test,external,choose], ['../prob_examples/public_examples/B/ExternalFunctions/ChooseExternal.mch', '-assertions'], 'Test choose and MU operator.'). |
| 3722 | | cli_testcase(1621, [b_test,let], [ |
| 3723 | | '../prob_examples/public_examples/B/Tester/LetTest_IllegalCyclic.mch', |
| 3724 | | '../prob_examples/public_examples/B/Tester/LetTest_IllegalNondet.mch', |
| 3725 | | '../prob_examples/public_examples/B/Tester/LetTest_IllegalNotAllDefined.mch', |
| 3726 | | '../prob_examples/public_examples/B/Tester/LetTest_IllegalNotVarLHS.mch', |
| 3727 | | '../prob_examples/public_examples/B/Tester/LetTest_IllegalVar.mch', |
| 3728 | | '-expcterr','type_error', '-expcterr', 'load_main_file'], 'Check illegal LETs detected.'). |
| 3729 | | cli_testcase(1622, [b_test,recursion,infinite,let], ['../prob_examples/public_examples/B/FunctionalProgramming/Factorial_NewSyntax.mch', |
| 3730 | | '../prob_examples/public_examples/B/FunctionalProgramming/SeqNaturalFoldr_NewSyntax.mch', |
| 3731 | | '../prob_examples/public_examples/B/RecursiveFunctions/SortSet_NewSyntax.mch', |
| 3732 | | '-t', '-strict'], 'Test new IF-THEN-ELSE / LET Syntax for expressions.'). |
| 3733 | | cli_testcase(1623, [b_test], [ |
| 3734 | | '-evalf', 'z < first([z]) & 0<z', |
| 3735 | | '-evalf', 'z < first([z]) & z:INTEGER', |
| 3736 | | '-evalf', 'z < last([z]) & 0<z', |
| 3737 | | %'-evalf', 'z < first([z,z]) & 0<z', % currently requires DISPROVER_MODE |
| 3738 | | %'-evalf', 'z < first(v) & v=[z] & 0<z', |
| 3739 | | '-evalf', 'z > first([z]) & z>0' |
| 3740 | | ], 'Ensure ast_cleanup removes first/last.'). |
| 3741 | | cli_testcase(1624, [cbc,card], [ |
| 3742 | | '-evalt', 'x:1..n --> BOOL & card({y|y:1..n & y|->FALSE:x})=cf & cf:15..26 & card({y|y:1..n & y|->TRUE:x})=ct &ct:22..25 & ct+cf=n & x(n/2)=FALSE & x(n/4)=FALSE & n=40', |
| 3743 | | '-evalt', 'x:1..n --> BOOL & card({y|y:1..n & y|->FALSE:x})=cf & cf:15..26 & card({y|y:1..n & y|->TRUE:x})=ct &ct:22..25 & x(n/2)=FALSE & x(n/4)=FALSE & n=40', |
| 3744 | | '-evalt', 'x:1..n --> BOOL & card({y|y:1..n & y|->FALSE:x})=cf & cf:15..26 & card({y|y:1..n & y|->TRUE:x})=ct &ct:22..25 & ct+cf=n & x(n/2)=TRUE & x(n/4)=TRUE & n=40', |
| 3745 | | '-evalt', 'x:1..n --> BOOL & card({y|y:1..n & y|->FALSE:x})=cf & cf:5..16 & card({y|y:1..n & y|->TRUE:x})=ct &ct:27..29 & ct+cf=n & x(n/2)=FALSE & x(n/4)=FALSE & n=40 & x(3*n/4)=TRUE', |
| 3746 | | '-evalf', 'x:1..n --> BOOL & card({y|y:1..n & y|->FALSE:x})=cf & cf:15..19 & card({y|y:1..n & y|->TRUE:x})=ct &ct:15..20 & ct+cf=n & x(n/2)=FALSE & x(n/4)=FALSE & n=40', |
| 3747 | | % x:1..n --> BOOL & card({y|y:1..n & y|->FALSE:x})=cf & cf:15..19 & card({y|y:1..n & y|->TRUE:x})=ct &ct:15..20 & x(n/2)=FALSE & x(n/4)=FALSE & n=40 % this is not yet detected as failing quickly |
| 3748 | | '-evalt', 'x:1..n --> BOOL & card(x~[{FALSE}])=cf & cf:15..26 & card(x~[{TRUE}])=ct & ct:22..25 & x(n/2)=FALSE & x(n/4)=FALSE & ct+cf=n & n=40', |
| 3749 | | % '-evalt', 'x:1..n --> BOOL & card(x~[{FALSE}]):15..26 & card(x~[{TRUE}]):22..25 & x(n/2)=FALSE & x(n/4)=FALSE & n=40' does not work yet |
| 3750 | | '-evalt', 's=1..20 & x <: s & card(x)=cx & cx:3..4 & y <: s & card(y)=cy & cy:3..4 & x/\\y={} & cx+cy=7 & (9:x or 9:y) & (18:y or 10:x)', % this test does not really exercise reification yet |
| 3751 | | '-evalt', 's=1..20 & x: s-->BOOL & card({t|t:1..20 & t|->TRUE:x})=cx & cx:3..4 & y:s-->BOOL & card({t|t:1..20 & t|->TRUE:y})=cy & cy:3..4 & x~[{TRUE}]/\\y~[{TRUE}]={} & cx+cy=7 & (9|->TRUE:x or 9|->TRUE:y) & (18|->TRUE:y or 10|->TRUE:x)', % THIS ONE IS FASTER: reason t:1..20 TO DO: try and get rid of need for this !! |
| 3752 | | '-evalt', 's=1..n & x<:s & card(x):15..26 & n/2/:x & n/4/:x & n=40' % another test; not requiring reification |
| 3753 | | ], 'Test cardinality reification propagates through check_finite_card.'). |
| 3754 | | cli_testcase(1625, [cbc,card], [ |
| 3755 | | '-evalt', 'i=2..x & card(i):10..9122110 & x > 9121000'], 'Check card of interval propagates'). |
| 3756 | | cli_testcase(1626, [cbc,records,card], [ |
| 3757 | | '-evalt', '{v|v:0..5 & card({x,y|x|->y:{(2,2),(2,4)} & x+y>v}):2..3}=0..3', |
| 3758 | | '-evalt', '{c,v,z|card({x|rec(a:x):v & x:(z..(z+3))})=c & v={rec(a:2),rec(a:4)} & c>1} = {((2|->{rec(a:2),rec(a:4)})|->1),((2|->{rec(a:2),rec(a:4)})|->2)}' |
| 3759 | | ], 'A few card tests; test reification involving records'). |
| 3760 | | cli_testcase(1627, [cbc,card], [ |
| 3761 | | '-evalt', 's=1..20 & x: s-->BOOL & card({t|t|->TRUE:x})=cx & cx:3..4 & y:s-->BOOL & card({t|t|->TRUE:y})=cy & cy:3..4 & x~[{TRUE}]/\\y~[{TRUE}]={} & cx+cy=7 & (9|->TRUE:x or 9|->TRUE:y) & (18|->TRUE:y or 10|->TRUE:x)', % this counter part was much slower ! due to missing t:1..20 constraint; now solved |
| 3762 | | '-evalt', 'x:1..n --> BOOL & card({y|y|->FALSE:x}):15..26 & card({y|y|->TRUE:x}):12..25 & x(n/2)=FALSE & x(n/4)=FALSE & n=40', |
| 3763 | | '-evalt', 's=1..20 & x: s-->BOOL & card({t|t|->TRUE:x}):18..19', |
| 3764 | | '-evalt', 's=1..20 & x: s-->BOOL & card({t|t|->FALSE:x}):18..19', |
| 3765 | | '-evalt', 's=1..130 & x: s-->BOOL & card({t|t|->TRUE:x}):128..129', |
| 3766 | | '-evalt', 's=1..258 & x: s-->BOOL & card({t|t|->FALSE:x})=card({t|t|->TRUE:x})', |
| 3767 | | '-evalt', 's:1..n --> 1..n & card({x|x|->x:s})=n & n=50', |
| 3768 | | '-evalt', 'card({s,n|s:1..n --> 1..n & card({x|x|->x:s})=n & n=50})=1', % non-linear pattern |
| 3769 | | '-evalt', 's: 1..20 --> (BOOL*(1..20)) & card({x|x|->(TRUE|->x):s})=10 & card({x|x|->(FALSE|->x):s})=10', |
| 3770 | | '-evalt', 's: 1..20 --> (BOOL*(1..20)) & card({x|x|->(TRUE|->x):s})=10 & card({x|x|->(FALSE|->x+1):s})=10', % non-linear pattern with addition |
| 3771 | | '-evalt', 's: 1..20 --> (BOOL*(1..20)) & card({x|x|->(FALSE|->x):s})=10 & card({x|x|->(TRUE|->x-1):s})=10' % non-linear pattern with minus |
| 3772 | | ], 'Check card propagates without need for t:1..20 constraint'). |
| 3773 | | cli_testcase(1628, [cbc,tickets,card], [ |
| 3774 | | '-evalt', 'card({f|f : 1..20 --> POW(7..11) & !x.(x:1..20 => card(f(x)) = 4 & {7,8,9} <: f(x)) & !x.(x:1..10 => f(x) /= f(x+10)) & !x.(x:1..9 => f(10+x) /= f(1+x)) & 10: f(1) })=1', |
| 3775 | | % {f|f : 1..20 --> POW(7..11) & !x.(x:1..20 => card(f(x)) = 4 & {7,8,9} <: f(x)) & !x.(x:1..10 => f(x) /= f(x+10)) & !x.(x:1..9 => f(10+x) /= f(1+x)) & 10: f(1) & printf("~nf(1)=~w~n",f(1)) & !i.(i:2..20 => printf("f(i)=~w~n",(i,f(i)))) } |
| 3776 | | '-evalt', '1=card({f|f : 1..100 --> POW(7..11) & !x.(x:1..100 => card(f(x)) = 4 & {7,8,9} <: f(x)) & !x.(x:1..90 => f(x) /= f(x+10)) & !x.(x:1..9 => f(90+x) /= f(1+x)) & 10: f(1)})' |
| 3777 | | ], 'A variation of test 34; computing all solutions'). |
| 3778 | | cli_testcase(1629, [cbc,queens,card], |
| 3779 | | ['../prob_examples/public_examples/B/Tickets/CardReify1/MaxQueensNoCheck_v5.mch', |
| 3780 | | '-t', '-mc', 10], 'Check reification of card works with dom of total function'). |
| 3781 | | cli_testcase(1630, [cbc,card], [ |
| 3782 | | '-evalt', 'f:1..20 >->> 1..20 & card({i|i:1..20 & f~(i)=i})=4', %this also worked before |
| 3783 | | '-evalt', 'f:1..20 >->> 1..20 & card({i|i:ran(f) & f~(i)=i})=4' |
| 3784 | | ], 'Check reification of card with range'). |
| 3785 | | cli_testcase(1631, [cbc,card], ['../prob_examples/public_examples/B/Puzzles/Queens/NBishopsSets.mch', |
| 3786 | | '-p', 'TIME_OUT', 25000, % got slower between 1.9.0 and 1.9.1 (commit 943d37585be8eeac46c93705d51c2392fde0fda3) |
| 3787 | | % got slower again with e1c23513051449cc13b0767394959b4c485e306f ,but _v2 of model is faster |
| 3788 | | '-init'], 'See that ProB can solve this puzzle'). |
| 3789 | | cli_testcase(1632, [cbc,while], ['../prob_examples/public_examples/B/Tickets/Hansen23_WhilePerformance/WhileSlow_CartProduct.mch', '-t', |
| 3790 | | '-p', 'TIME_OUT', 15000 ], % increased time-out for jenkins |
| 3791 | | 'See that performance of while loop with IF with existential quantifier is ok'). |
| 3792 | | cli_testcase(1633, [kodkod], [ '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 3793 | | '-evalf', ':kodkod args<:{1,2,3,4} & x:args & x<2 & x/=1', |
| 3794 | | '-evalf', ':kodkod args<:{2,4,5,9,16,32} & x:args & x<4 & x/=2', % used to generate java.lang.IllegalArgumentException: too many atoms (32 <= 2^6) for too few powers of 2 (4< 6), |
| 3795 | | '-evalt', ':kodkod args<:{2,4,5,9,16,32} & x:args & x<4' % used to generate java.lang.IllegalArgumentException: too many atoms (32 <= 2^6) for too few powers of 2 (4< 6) |
| 3796 | | % '-evalf', ':kodkod args={1,2,3} & atts : args <-> args & dom(atts) = args & x = card(atts)&x < 2' %% TO DO: fix KODKOD |
| 3797 | | ], 'check kodkod integer ranges are correctly computed, prevent regression'). |
| 3798 | | cli_testcase(1634, [b_test,external], [ |
| 3799 | | '../prob_examples/public_examples/B/ExternalFunctions/MAXIMIZE_Test.mch', |
| 3800 | | '../prob_examples/public_examples/B/Puzzles/Queens/MaxQueensNoCheck_MAXIMIZE.mch', |
| 3801 | | '../prob_examples/public_examples/B/Mathematical/Argumentation/Example3_MAXIMIZE.mch', |
| 3802 | | '-assertions'], |
| 3803 | | 'Check MAXIMIZE external function'). |
| 3804 | | cli_testcase(1635, [private,tickets,codespeed,data_validation], ['../prob_examples/examples/B/Alstom/DataValidationProject/Tickets/Burdy3/Rule_DB_General_0006.mch', '-t', |
| 3805 | | %'-p','SHOW_EVENTB_ANY_VALUES','TRUE', '-p', 'MAX_OPERATIONS', 1000, |
| 3806 | | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-p', 'TIME_OUT', 5000, '-p','CLPFD', 'TRUE' |
| 3807 | | ], |
| 3808 | | 'Codespeed test; test that cartesian product / concat_sequence performance issue fixed'). % AlstomBurdy_Rule6_CLP |
| 3809 | | cli_testcase(1636, [b_test,tickets,wd,private,data_validation], [ |
| 3810 | | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour1/rule.mch', |
| 3811 | | '-expcterr', well_definedness_error, |
| 3812 | | '-mc', 10, '-nodead'], |
| 3813 | | 'Check WD error found'). |
| 3814 | | cli_testcase(1637, [b_test,tickets,private,data_validation], [ |
| 3815 | | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour2/fonction_totale.mch', |
| 3816 | | '-t', '-expcterr', setup_constants_inconsistent, |
| 3817 | | '-properties', '-expcterr', check_properties], |
| 3818 | | 'Check partial setup constants possible despite inconsistency'). |
| 3819 | | cli_testcase(1638, [b_test,tickets,private,data_validation], [ |
| 3820 | | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour2/fonction_totale_v2.mch', |
| 3821 | | '-animate_all', '-expcterr', setup_constants_fails, |
| 3822 | | '-opterr', 'setup_constants_inconsistent'], % we now also generate this msg when not all csts are found deterministically |
| 3823 | | 'Check inconsistent properties detected by animate_all'). |
| 3824 | | cli_testcase(1639, [b_test], ['-check_java_version'], 'Check check_java_version works'). |
| 3825 | | cli_testcase(1640, [tickets], ['-evalt', '{}/:STRING --> BOOL', |
| 3826 | | '-evalt', '{"ab"|->TRUE }/:STRING --> BOOL', |
| 3827 | | '-evalt', '{"ab"|->TRUE,"ab"|->FALSE }/:STRING --> BOOL', |
| 3828 | | '-evalt', 'not({TRUE|->"STRING2"} : BOOL >+>> STRING)', |
| 3829 | | '-evalt', 'not({TRUE|->"STRING2"} : BOOL +->> STRING)' |
| 3830 | | ], 'Check bug in not_total_function fixed'). |
| 3831 | | cli_testcase(1641, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLawsStrings.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on functions over infinite base domain.'). |
| 3832 | | cli_testcase(1642, [private,tickets,operation_reuse,data_validation], [ |
| 3833 | | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour3/rule1.mch', |
| 3834 | | '-t', '-p', 'OPERATION_REUSE', 'TRUE', |
| 3835 | | '-expcterr', invariant_violation], |
| 3836 | | 'Check operation reuse problem fixed'). |
| 3837 | | cli_testcase(1643, [b_test,operation_reuse], ['../prob_examples/public_examples/B/Benchmarks/CSM.mch', '-mc', '1000', '-strict', |
| 3838 | | '-p', 'OPERATION_REUSE', 'TRUE','-check_complete', '-cc', '341', '1229'], 'Test 13 with operation reuse'). |
| 3839 | | cli_testcase(1644, [b_test,operation_reuse,symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '150', '-cc', '145', '447', |
| 3840 | | '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'off', '-strict'], 'Test 73 with operation reuse'). |
| 3841 | | cli_testcase(1645, [b_test,operation_reuse,symmetry_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/DiningCryptographers.mch', '-mc', '100', '-cc', '65', '96', '-p', 'MAX_INITIALISATIONS', '100', '-p', 'OPERATION_REUSE', 'TRUE','-p', 'SYMMETRY_MODE', 'off', '-strict'], 'Test 106 with operation reuse'). |
| 3842 | | cli_testcase(1646, [cbc,operation_reuse,hash], ['../prob_examples/public_examples/B/Tickets/FiveWayTraffic/FiveWay_new_mch.eventb', |
| 3843 | | '-mc', 1000, '-strict','-p', 'OPERATION_REUSE', 'TRUE','-cc', '29', '65', |
| 3844 | | '--hash64', 591402958158885188 % used to be 971801032035978952 until 9 Sep 2021 after changes to state_packing |
| 3845 | | ], 'Test 1532 with operation reuse.'). |
| 3846 | | cli_testcase(1647, [b_test,csp_test,pge,cspb],['../prob_examples/public_examples/CSPB/Williams/ME.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/Williams/ME.csp', '-mc', 10000, '-p', 'pge', disabled, '-strict'],'Testing PGE optimisation for (ME.mch||ME.csp).'). |
| 3847 | | cli_testcase(1648, [b_test,csp_test,pge,cspb],['../prob_examples/public_examples/CSPB/Ivo/verysimple.mch', '-csp-guide', '../prob_examples/public_examples/CSPB/Ivo/verysimple.csp', '-mc', 10000, '-bf', '-p', 'pge', disabled, '-expcterr', deadlock, '-strict'],'Finding the deadlock because of the impossibility to execute the b operation (verysimple.mch||verysimple.csp).'). |
| 3848 | | cli_testcase(1649, [cbc,card], [ |
| 3849 | | '-evalf', 'occupies : Pigeons >-> Holes & Pigeons=1..100 & Holes=1..99', |
| 3850 | | '-evalt', 'occupies : Pigeons >-> Holes & Pigeons=2..100 & Holes=1..99', |
| 3851 | | '-evalt', 'id(NATURAL) : NATURAL >-> NATURAL', % also check infinite functions work |
| 3852 | | '-evalt', 'id(NATURAL1) : NATURAL1 >-> NATURAL1', % also check infinite functions work |
| 3853 | | '-evalt', 'id(NATURAL1) : NATURAL1 >-> NATURAL', |
| 3854 | | '-evalf', 'id(NATURAL1) : NATURAL >-> NATURAL', |
| 3855 | | '-evalf', 'id(NATURAL) : NATURAL1 >-> NATURAL', |
| 3856 | | '-evalf', 'id(NATURAL) : NATURAL >-> NATURAL1', |
| 3857 | | '-evalt', 'id(NATURAL1) /: NATURAL >-> NATURAL' |
| 3858 | | ], 'Ensure card. check for total_injection works'). |
| 3859 | | cli_testcase(1650, [parser,tickets], [ |
| 3860 | | '../prob_examples/public_examples/B/Tester/SyntaxErrors/MissingSemicolon.mch', |
| 3861 | | '-expcterrpos', parse_error, 13, 2, '-expcterr', 'load_main_file'], |
| 3862 | | 'Check parser correctly reports syntax error and position'). |
| 3863 | | cli_testcase(1651, [b_test,execute], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-execute_all', |
| 3864 | | '-animate_stats', '-strict', '-goal', 'c=20', '-p', 'MAXINT', '20'], 'Check -execute_all.'). |
| 3865 | | cli_testcase(1652, [parser,tickets], [ |
| 3866 | | '-eval', '2>1 & & 3>2', |
| 3867 | | '-expcterrpos', parse_machine_predicate_error, 1, 6 ], |
| 3868 | | 'Check parser correctly reports syntax error and position for eval'). |
| 3869 | | cli_testcase(1653, [b_test,tickets,hash], [ |
| 3870 | | '../prob_examples/public_examples/B/Tester/SelectMultipleTrueCases.mch', |
| 3871 | | '-t', '-mc', 100, '-nogoal', '-cc', 4, 10, '--hash64', 357695998652715541 ], |
| 3872 | | 'Select with multiple true branches dealt with'). |
| 3873 | | cli_testcase(1654, [parser,tickets], [ |
| 3874 | | '../prob_examples/public_examples/B/Tickets/PARSERLIB-44/BinPacking_UnicodeMinus.mch', |
| 3875 | | '-init' ], |
| 3876 | | 'Check parser correctly parses unicode minus used for --> (PARSERLIB-44)'). |
| 3877 | | cli_testcase(1655, [laws,records], ['../prob_examples/public_examples/B/NewSyntax/RecSetLaws.mch', '-mc', '1000', '-nogoal', '-nodead', '-cs', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-t', '-expcterr', 'model_check_incomplete'], 'Various laws about records.'). |
| 3878 | | cli_testcase(1656, [tickets,records,private], ['../prob_examples/examples/B/Tickets/record_projection_bugly.mch', '-assertions'], 'Check performance.'). |
| 3879 | | cli_testcase(1657, [eventb_test,tickets,private], [ |
| 3880 | | '../prob_examples/examples/EventBPrologPackages/Advance_WP2/v5_Aug2014/ex_mch.eventb', |
| 3881 | | '-t' ], |
| 3882 | | 'Check COMMS__ComputeLeastCostRoutes efficient (avoiding re-calculation of same assignment; see PROB-351)'). |
| 3883 | | cli_testcase(1658, [parser,tickets], [ |
| 3884 | | '../prob_examples/public_examples/B/Tickets/Hansen25_OpNamingWarning/Naming_VAR.mch', |
| 3885 | | '-expcterrpos', type_error, 5, 6 |
| 3886 | | ], |
| 3887 | | 'Check type checker reports id clash in VAR'). |
| 3888 | | cli_testcase(1659, [parser,tickets], [ |
| 3889 | | '-eval', ' 2 = TRUE', |
| 3890 | | '-expcterrpos', type_expression_error, 1, 7 ], |
| 3891 | | 'Check type checker correctly reports error and position in eval'). |
| 3892 | | cli_testcase(1660, [parser,tickets], [ |
| 3893 | | '../prob_examples/public_examples/B/Tickets/Hansen25_OpNamingWarning/ReadingUninitialisedVar.mch', '-animate', 10, |
| 3894 | | '-expcterrpos', reading_undefined_variable, 6, 12 , '-nodead' ], |
| 3895 | | 'Check interpreter reports unitialised var and that -nodead works for -animate'). |
| 3896 | | cli_testcase(1661, [eventb_test,tickets,private], [ |
| 3897 | | '../prob_examples/examples/EventBPrologPackages/Advance_WP2/v5_Aug2014/ex_mch.eventb', |
| 3898 | | '-mc', 10 , '-opterr', 'time_out_for_assertions', % not raised anymore 26.2.2021, see test 2087 |
| 3899 | | '-expcterr', 'model_check_incomplete'], |
| 3900 | | 'Check that virtual-time_out in assertion checking caught (or not raised)'). |
| 3901 | | cli_testcase(1662, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolation.mch', |
| 3902 | | '-csp-guide', '../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolation.csp', |
| 3903 | | '-mc', '1000', '-expcterr', assertion_violation, '-nodead'], 'Test that static assertion violation found'). |
| 3904 | | cli_testcase(1663, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamic.mch', |
| 3905 | | '-csp-guide', '../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamic.csp', |
| 3906 | | '-mc', '1000', '-expcterr', assertion_violation], 'Test that dynamic assertion violation found'). |
| 3907 | | cli_testcase(1664, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamic.mch', |
| 3908 | | '-csp-guide', '../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamicShort.csp', |
| 3909 | | '-mc', '1000', '-nodead'], 'Test that no dynamic assertion violation found'). |
| 3910 | | %cli_testcase(1665, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records.mch', |
| 3911 | | % '-plugin', 'units', '-strict', |
| 3912 | | % '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records_internal.mch'], |
| 3913 | | % 'Check that records are supported in unit plugin'). |
| 3914 | | cli_testcase(1666, [kodkod,tickets,random], [ |
| 3915 | | '../prob_examples/public_examples/B/Tickets/BendispostoTutoren/tuts_cando_only.mch', '-init', '-assertions', |
| 3916 | | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE' ], |
| 3917 | | 'Check that Randomise Enumeration order and Kodkod work together'). |
| 3918 | | cli_testcase(1667, [cbc,tickets,kodkod,random], [ |
| 3919 | | '../prob_examples/public_examples/B/Tickets/BendispostoTutoren/tuts_working.mch', '-init', '-assertions', |
| 3920 | | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE' ], |
| 3921 | | 'Check that Randomise Enumeration order and Kodkod work together'). |
| 3922 | | cli_testcase(1668, [cbc,random], [ |
| 3923 | | '../prob_examples/public_examples/B/Tickets/BendispostoTutoren/tuts_working.mch', '-init', '-assertions', |
| 3924 | | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-p', 'KODKOD', 'FALSE' ], |
| 3925 | | 'Check that Randomise Enumeration order and Kodkod work together'). |
| 3926 | | cli_testcase(1669, [tickets,cbc,card], ['-p', 'MAXINT', 3, |
| 3927 | | '-evalt', 'card(perm(NAT))=24', |
| 3928 | | '-evalt', 'perm(NAT) /= {}', |
| 3929 | | '-evalf', 'perm(NAT) = {}', |
| 3930 | | '-evalt', 'perm(NAT) ={[1,0,2,3],[1,0,3,2],[2,0,1,3],[2,0,3,1],[3,0,1,2],[3,0,2,1],[0,1,2,3],[0,1,3,2],[2,1,0,3],[2,1,3,0],[3,1,0,2],[3,1,2,0],[0,2,1,3],[0,2,3,1],[1,2,0,3],[1,2,3,0],[3,2,0,1],[3,2,1,0],[0,3,1,2],[0,3,2,1],[1,3,0,2],[1,3,2,0],[2,3,0,1],[2,3,1,0]}', |
| 3931 | | '-evalt', 'perm(NAT) = perm(0..MAXINT)', |
| 3932 | | '-evalt', 'perm(NAT1) = perm(1..MAXINT)', |
| 3933 | | '-evalt', 'card(perm(INT))=120', |
| 3934 | | '-evalt', 'card(iseq(NAT)) = 65' |
| 3935 | | ], |
| 3936 | | 'Check that perm(NAT)={} bug fixed'). |
| 3937 | | cli_testcase(1670, [b_test], ['-t', '-expcterr', trace_checking_fails, |
| 3938 | | '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/SETPREF.mch', '-p', 'MAXINT', '22', '-card', 'ID', '2'], 'check trace checking fails'). |
| 3939 | | cli_testcase(1671, [tickets, parser], ['-t', '--model-check', |
| 3940 | | '../prob_examples/public_examples/B/FeatureChecks/DollarSymbol/ValidMachines/AssignByPredicateWithDEFTransitive.mch', |
| 3941 | | '../prob_examples/public_examples/B/FeatureChecks/DollarSymbol/ValidMachines/AssignByPredicateWithDEF.mch'], |
| 3942 | | 'check $0 can be used within definitions (PARSERLIB-47)'). |
| 3943 | | cli_testcase(1672, [tickets, parser], [ |
| 3944 | | '../prob_examples/public_examples/B/FeatureChecks/DollarSymbol/ErrorMachines/DollarInInvariant.mch', |
| 3945 | | '-expcterrpos', type_error, 2, 21, '-expcterr', load_main_file], |
| 3946 | | 'check $0 cannot be used in invariant (PARSERLIB-47)'). |
| 3947 | | cli_testcase(1673, [tickets, parser], [ |
| 3948 | | '../prob_examples/public_examples/B/ErrorMachines/IllegalSeesIncludes/CyclicM1.mch', |
| 3949 | | '-expcterr', parse_error, '-expcterr', load_main_file], |
| 3950 | | 'check cyclic sees detected and does not lead to parser exception'). |
| 3951 | | cli_testcase(1674, [pragmas], ['-init', |
| 3952 | | '../prob_examples/public_examples/B/Pragmas/FilePragma.mch'], |
| 3953 | | 'check @file "Path" pragma works'). |
| 3954 | | cli_testcase(1675, [b_test,mcm_tests], ['../prob_examples/public_examples/B/TestCaseGeneration/MCM_Tests/SimpleTestModel.mch', '-mcm_tests', '20', '1000', '1=1', '../prob_examples/public_examples/B/TestCaseGeneration/MCM_Tests/SimpleTestModel_mcm_tests.xml', '-strict'],'State based test generation with non-deterministic initialisation'). |
| 3955 | | cli_testcase(1676, [b_test,mcm_tests,private], ['../prob_examples/examples/EventBPrologPackages/Soton/MCM_Tests/FENCEM7_mch.eventb', |
| 3956 | | '-mcm_tests', '10', '4000', '1=1', |
| 3957 | | '../prob_examples/examples/EventBPrologPackages/Soton/MCM_Tests/tests.xml', |
| 3958 | | '-mcm_cover', 'IssueLoad IssueStore ObserveLoadAfterStore', |
| 3959 | | '-p', 'INTERNAL_ARGUMENT_PREFIX', 'p', |
| 3960 | | '-strict'],'State based test generation with internal operation arguments'). |
| 3961 | | cli_testcase(1677, [tickets,while], [ |
| 3962 | | '../prob_examples/public_examples/B/Tickets/PROB-412/WhileVariantNotDecreased.mch', '-animate', 10, |
| 3963 | | '-expcterr', animate, '-expcterrpos', while_variant_error, 24, 16 ], |
| 3964 | | 'Check variant not decreasing error found and position ok (PROB-412)'). |
| 3965 | | cli_testcase(1678, [while,tickets], [ |
| 3966 | | '../prob_examples/public_examples/B/Tickets/Hansen24_WhileSeesBug/While.mch', |
| 3967 | | '../prob_examples/public_examples/B/Tickets/Hansen24_WhileSeesBug/Runner.mch', |
| 3968 | | '-t', '-mc', 1000 ], |
| 3969 | | 'Check bug with while loop compilation because of incorrect read/modifies info (not renamed) fixed'). |
| 3970 | | cli_testcase(1679, [b_test], [ |
| 3971 | | '../prob_examples/public_examples/B/Tester/ParityFunction.mch', |
| 3972 | | '../prob_examples/public_examples/B/Mathematical/Sieve_WithMin.mch', |
| 3973 | | '../prob_examples/public_examples/B/Benchmarks/Chapter13/Booksrr.ref', |
| 3974 | | '../prob_examples/public_examples/B/Benchmarks/Chapter_10/Safes.mch', |
| 3975 | | '-t'], |
| 3976 | | 'A few trace tests from the Tcl/Tk Regression Test suite'). |
| 3977 | | cli_testcase(1680, [b_test,private], [ |
| 3978 | | '../prob_examples/examples//B/Siemens/TestString.mch', |
| 3979 | | '-expcterr', 'virtual_time_out', |
| 3980 | | '-t'], |
| 3981 | | 'A few trace tests from the Tcl/Tk Regression Test suite'). |
| 3982 | | cli_testcase(1681, [b_test,private,exists], [ |
| 3983 | | '../prob_examples/examples/B/ClearSy/control/M1.ref', |
| 3984 | | %'../prob_examples/examples/B/ClearSy/control/M1_i.imp', % bmachine_static_checks: Operation result "status" has the same name as a variable or constant in operation "UTILS.nextState". |
| 3985 | | '-t'], |
| 3986 | | 'Check no exists body warning'). |
| 3987 | | cli_testcase(1682, [tickets,private,data_validation], [ |
| 3988 | | '../prob_examples/examples//B/Alstom/ssp/tms_ssp_0004.mch', |
| 3989 | | '-t'], |
| 3990 | | 'Check no time-out'). |
| 3991 | | cli_testcase(1683, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3992 | | '-evalt', '(A=TRUE) <=> (X:Y..Z) & Y:1..10 & Z:0..2 & X >12 & (A=FALSE => X:15..16)' |
| 3993 | | ], 'check interval reification'). |
| 3994 | | cli_testcase(1684, [cbc], [ '-p', 'CLPFD', 'FALSE', '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 3995 | | '-evalt', '(A=TRUE) <=> (X:Y..Z) & Y:1..10 & Z:0..2 & X >12 & (A=FALSE => X:15..16)' |
| 3996 | | ], 'check interval reification'). |
| 3997 | | cli_testcase(1685, [cbc], [ |
| 3998 | | '-evalt', 'NATURAL1 : x & (x = { {22}, {33}} or x={ NATURAL1 })', |
| 3999 | | '-evalf', 'NATURAL1 : x & x = { {22}, {33}}', |
| 4000 | | '-evalt', '{x|x>30 & x mod 3 =0} /\\ {x|x<50 & x mod 2 =0} = {36,42,48}' |
| 4001 | | ], 'a few checks'). |
| 4002 | | |
| 4003 | | cli_testcase(1686, [cbc,laws,finite], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4004 | | '-evalt', 'x:FIN(x) & x=POW(POW(1..9))', |
| 4005 | | '-evalf', 'x/:FIN(x) & x=POW(POW(1..9))', |
| 4006 | | '-evalt', 'x:FIN(x) & x=FIN(POW(1..10))', |
| 4007 | | '-evalt', 'x:FIN(x) & x=POW(POW(1..10))', |
| 4008 | | '-evalf', 'x/:FIN(x) & x=POW(POW(1..10))', |
| 4009 | | '-evalt', 'x:FIN(x) & x=POW(POW(POW(1..10)))', |
| 4010 | | '-evalf', 'x:FIN(x) & x=POW(POW(POW(NATURAL1)))', |
| 4011 | | '-evalt', 'x/:FIN(x) & x=POW(POW(POW(NATURAL1)))', |
| 4012 | | '-evalf', 'x:FIN(x) & x=FIN(POW(POW(NATURAL1)))', |
| 4013 | | '-evalt', 'x/:FIN(x) & x=FIN(POW(POW(NATURAL1)))', |
| 4014 | | '-evalf', 'x:FIN(x) & x=FIN(INTEGER)', |
| 4015 | | '-evalt', 'x/:FIN(x) & x=FIN(INTEGER)', |
| 4016 | | '-evalt', 'x/:FIN(x) & x=POW(INTEGER)', |
| 4017 | | '-evalf', 'x:FIN(x) & x = %x.(x:NATURAL1|1)', |
| 4018 | | '-evalt', 'x:FIN(x) & x = %x.(x:POW(POW(1..11))|1)', |
| 4019 | | % '-evalt', 'x/:FIN(x) & x = %x.(x:POW(POW(1..11))|1)', % computes x, time-out |
| 4020 | | '-evalt', 'x:FIN(x) & x = (3..2)*INTEGER', |
| 4021 | | '-evalt', 'x:FIN(x) & x = INTEGER*(3..2)', |
| 4022 | | '-evalf', 'x:FIN(x) & x = INTEGER*(2..3)', |
| 4023 | | '-evalt', 'x:FIN(x) & x = POW(POW(1..10))*(2..3)', |
| 4024 | | '-evalt', 'x:FIN(x) & x = POW(POW(1..11))*(2..3)', |
| 4025 | | '-evalt', 'x:FIN(x) & x = POW(POW(1..11))*{2,4}', |
| 4026 | | '-evalt', 'x:FIN(x) & x = POW(POW(1..11))*(4..3)', |
| 4027 | | '-evalt', 'x:FIN(x) & x = NATURAL1*(4..3)', |
| 4028 | | '-evalf', 'x:FIN(x) & x = NATURAL1*{2,4}', |
| 4029 | | '-evalf', 'x:FIN(x) & x = (1..2)*NATURAL1', |
| 4030 | | '-evalf', 'x:FIN(x) & x = INTEGER*NATURAL1', |
| 4031 | | '-evalt', 'x:FIN(x) & x=iseq(1..10)', |
| 4032 | | '-evalf', 'x:FIN(x) & x=iseq(NATURAL)', |
| 4033 | | '-evalt', 'x:FIN(x) & x=perm(POW(1..9))', |
| 4034 | | '-evalf', 'x:FIN(x) & x= {x|x : INTEGER & x < 3}', |
| 4035 | | '-evalt', 'x:FIN(x) & x=iseq(POW(POW(1..11)))', |
| 4036 | | '-evalt', 'x:FIN(x) & x=iseq1(POW(POW(1..11)))', |
| 4037 | | '-evalf', 'x:FIN(x) & x=seq(POW(POW(1..11)))', |
| 4038 | | '-evalf', 'x:FIN(x) & x=seq1(POW(POW(1..11)))', |
| 4039 | | '-evalt', 'x:FIN(x) & x=seq(4..3)', |
| 4040 | | '-evalt', 'x:FIN(x) & x=seq1(4..3)', |
| 4041 | | '-evalt', 'x:FIN(x) & x=id(POW(POW(1..11)))', |
| 4042 | | '-evalf', 'x:FIN(x) & x=perm(NATURAL)', |
| 4043 | | '-evalt', 'x:FIN(x) & x=perm(POW(POW(1..11)))', |
| 4044 | | '-evalf', 'x/:FIN(x) & x=perm(POW(POW(1..11)))', |
| 4045 | | '-evalt', '{z|z:seq(BOOL) & size(z)<=0} = {[]}' |
| 4046 | | ], 'a few checks about finite'). |
| 4047 | | cli_testcase(1687, [tickets,parser], [ |
| 4048 | | '../prob_examples/public_examples/B/Tickets/Hansen27_NestedMchErr/M1.mch', |
| 4049 | | '-expcterr', load_main_file, '-expcterrpos', parse_error, 2, 5 ], |
| 4050 | | 'Check error found and position ok'). |
| 4051 | | cli_testcase(1688, [cbc,laws,finite], [ '-p', 'DISPROVER_MODE', 'TRUE', |
| 4052 | | '-evalu', 'x/:FIN(x) & x=(POW(1..11) +-> POW(1..9))', |
| 4053 | | % '-eval', 'x:FIN(x) & x=perm(POW(1..9))', |
| 4054 | | '-expcterr', 'eval_string_enum_warning' |
| 4055 | | ], 'a few checks about finite; ideally we want -evalt'). % TO DO: fix this issue |
| 4056 | | cli_testcase(1689, [tickets,kodkod], [ |
| 4057 | | '-evalf', ':kodkod args={1,2,3} & atts : args <-> args & dom(atts) = args & x = card(atts)&x < 2', |
| 4058 | | '-opterr', 'kodkod_fail' |
| 4059 | | ], 'check card interval analysis bug fixed (PROB-411)'). |
| 4060 | | cli_testcase(1690, [tickets], [ |
| 4061 | | '../prob_examples/public_examples/B/Tickets/Hansen21_Sees/AllGroups.mch', |
| 4062 | | '-t', '-mc', 100, '-bf', |
| 4063 | | '-expcterr', 'invariant_violation' |
| 4064 | | ], 'check sees bug remains fixed'). |
| 4065 | | cli_testcase(1691, [tickets,records], [ |
| 4066 | | '../prob_examples/public_examples/B/Tickets/RecordPartiallyTyped/Knowledge_loop.mch', |
| 4067 | | '-init', |
| 4068 | | '-expcterrpos', 'type_expression_error', 17, 45 |
| 4069 | | ], 'check that record type bug fixed, no type generated: record([field(a,b)|any])'). |
| 4070 | | cli_testcase(1692, [tickets,quantified,union], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4071 | | '-evalt', 'UNION(i).(i:1..2|{i|->i}) ^ UNION(j).(j:1..3|{j|->j}) = [1,2,1,2,3]', |
| 4072 | | '-evalt', 'UNION(i).(i:1..2|{i|->i}) ^ {} = [1,2]', |
| 4073 | | '-evalf', 'UNION(i).(i:1..2|{i|->i}) ^ UNION(j).(j:1..3|{j|->j}) = [1,2,3,4,5]' |
| 4074 | | ], 'ensure both UNIONs are translated'). |
| 4075 | | cli_testcase(1693, [tickets,let], [ |
| 4076 | | '-eval', 'i = 20 & (LET i BE i= i+1 IN i END) =res', |
| 4077 | | '-expcterr', type_expression_error |
| 4078 | | ], 'ensure error in nested LET expression detected'). |
| 4079 | | cli_testcase(1694, [tickets,error_checks,let], [ |
| 4080 | | '-eval', '(LET i,j BE i=i+10 & j=i+20 IN i+j END)', |
| 4081 | | '-expcterr', type_expression_error, |
| 4082 | | '-expcterr', eval_string |
| 4083 | | ], 'ensure error in nested LET expression detected'). |
| 4084 | | cli_testcase(1695, [tickets,error_checks,let], [ |
| 4085 | | '-eval', '(LET i,j BE j=i+20 & i=10 IN i+j END)', |
| 4086 | | '-expcterr', type_expression_error, |
| 4087 | | '-expcterr', eval_string |
| 4088 | | ], 'ensure error in nested LET expression detected'). |
| 4089 | | cli_testcase(1696, [tickets,let], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4090 | | '-evalt', 'i=1 & r=LET i BE i=10 IN LET j BE j=i+20 IN i+j END END & r=40', |
| 4091 | | % '-evalt', 'k = 1..n & n:2..3 & (LET i,j BE i={10}\\/k & j= i \\/ i IN res=i \\/ j END)', |
| 4092 | | % '-evalt', '(LET i,j BE i=10 & j=i+20 IN i+j END) =40', |
| 4093 | | '-evalt', 'i = 100 & (LET i,j BE i={10} & j= 20 IN (LET j BE j=i \\/ i IN i \\/ j END) END) = {10}', |
| 4094 | | '-evalt', 'x=1 & y=2 & #(x,y).(x=30 & y=x+x & res=y+x) & res=90' |
| 4095 | | ], 'ensure nested LET predicate and expression work'). |
| 4096 | | cli_testcase(1697, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4097 | | '-evalt', '{y,n|{x|x:1..n} = {y}} = {1|->1}', |
| 4098 | | '-evalt', 'x:{y|y>0 & y mod 100 = 0} & x:{z|z<1000 & z mod 500 = 0}', |
| 4099 | | '-evalt', '{x|x:1..n} = {y}' |
| 4100 | | ], 'check improved set comprehension propagation'). |
| 4101 | | cli_testcase(1698, [cbc], [ |
| 4102 | | '-evalt', 'x:c1 & c1={y|y>0 & y mod 100 = 0} & x:c2 & c2= {z|z<1000 & z mod 500 = 0}', |
| 4103 | | % these now did not work before: |
| 4104 | | '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104}', |
| 4105 | | '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108}', |
| 4106 | | '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108} & n=110', |
| 4107 | | '-evalf', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108,113}' |
| 4108 | | % '-evalf', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108,112}' % TO DO: does not work yet |
| 4109 | | % '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & {102} <: p' % TO DO: nor this |
| 4110 | | ], 'check improved set comprehension propagation'). |
| 4111 | | cli_testcase(1699, [private,csp_test,cspb,hash], ['../prob_examples/examples/CSPB/Treharne/CSPB-SwanseaPlanModel/Interlocking.mch', |
| 4112 | | '-csp-guide', '../prob_examples/examples/CSPB/Treharne/CSPB-SwanseaPlanModel/Ctrl.csp', |
| 4113 | | '-mc', '40', '-bf', '-cc', 148, 687, '--hash64', 537894344680006343, % used to be 838177507379154842 until Sep 9th 2021 |
| 4114 | | '-expcterr', 'model_check_incomplete'], 'Test CSP||B model'). % % 17.9.2021: adapted hash from 268712975971443200 for sorted order of variable, before hash was 906866094249096570, but we changed order of machine inclusion |
| 4115 | | cli_testcase(1700, [private,csp_test,hash], ['../prob_examples/public_examples/B/Ivo/BenchmarksFairness/ProB/DPhil/dphil_ltl6.csp', |
| 4116 | | '-mc', '3000', '-bf', '-cc', 1764, 7125, '--hash64', 419761536083491376], 'Test Dining Philosophers state space (CSP normalisation)'). |
| 4117 | | cli_testcase(1701, [csp_test,cspb,hash], ['../prob_examples/public_examples/CSPB/Counter.mch', |
| 4118 | | '-csp-guide', '../prob_examples/public_examples/CSPB/Counter.csp', |
| 4119 | | '-mc', '40', '-bf', '-cc', 15, 15, '--hash64', 987057609118852348], 'Test CSP||B model'). |
| 4120 | | cli_testcase(1702,[cbc,enabling],[ |
| 4121 | | '-enabling_analysis_csv','../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_enabling_analysis.csv', |
| 4122 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', |
| 4123 | | '-p', 'TIME_OUT', 5000 |
| 4124 | | ], 'Check CSV output of Cruise Control'). |
| 4125 | | cli_testcase(1703,[cbc,enabling],[ |
| 4126 | | '-enabling_analysis_csv','../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2_enabling_analysis.csv', |
| 4127 | | '../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2.eventb', |
| 4128 | | '-p', 'TIME_OUT', 5000, |
| 4129 | | '-expcterr', well_definedness_error % added 28/5/2018, T2ReleaseBus -> Update, was previously not detected |
| 4130 | | ], 'Check CSV output of CAN Bus Control'). |
| 4131 | | cli_testcase(1704, [tickets], ['../prob_examples/public_examples/B/Tickets/Space InPath/phonebook7.mch', '-t', '-mc', '100', '-strict', '-expcterr', 'model_check_incomplete'], 'check space in path works'). |
| 4132 | | cli_testcase(1705, [tla,tlc], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/ExportClassicalB/TestLeftAsVar_mch.eventb', |
| 4133 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Tester/UseBKeywords.eventb', '-mc_with_tlc'], 'check TLC for Event-B model with classical B keywords'). |
| 4134 | | cli_testcase(1706, [b_test, infinite,total_function], [ |
| 4135 | | '-evalt', 'f : NATURAL --> STRING', |
| 4136 | | '-evalt', 'f : NATURAL --> POW(INTEGER)', |
| 4137 | | '-evalt', 'f : STRING --> {11,22,33} & f("abc")>22 & f("xyz") < 22', |
| 4138 | | '-evalt', 'f : STRING --> STRING & f("abc")="ABC" & f("xyz") = "XYZ"' |
| 4139 | | ], 'Ensure symbolic treatment of (infinite) total functions with complicated range types.'). |
| 4140 | | cli_testcase(1707, [b_test,cruise,operation_reuse,codespeed,hash], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '25696', '-strict', '--hash64', 753243318772366897, '-p', 'MAX_INITIALISATIONS', 5, |
| 4141 | | '-p', 'OPERATION_REUSE', 'TRUE', |
| 4142 | | '-check_op_cache_stats', 663, 296, 26, 25], 'Complete Model Check of Cruise Controller'). % 17.9.2021: adapted hash from 203058745203935766 for sorted order of variable |
| 4143 | | cli_testcase(1708, [private,tickets,operation_reuse,operation_reuse_full,data_validation], [ |
| 4144 | | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour3/rule1.mch', |
| 4145 | | '-t', '-p', 'OPERATION_REUSE', 'full', |
| 4146 | | '-p', 'TIME_OUT', '9000', % try and fix performance issue on Gitlab windows runner |
| 4147 | | '-expcterr', invariant_violation], |
| 4148 | | 'Check operation reuse problem fixed'). |
| 4149 | | cli_testcase(1709, [b_test,operation_reuse,operation_reuse_full], ['../prob_examples/public_examples/B/Benchmarks/CSM.mch', '-mc', '1000', '-strict', |
| 4150 | | '-p', 'OPERATION_REUSE', 'full','-check_complete', '-cc', '341', '1229'], 'Test 13 with operation reuse'). |
| 4151 | | cli_testcase(1710, [cbc], [ |
| 4152 | | '-evalt', 'x = {1|->2, 2|->3, 3|->4} & r={y|(y,3):x} & r={2}', |
| 4153 | | '-evalt', 'x = {1|->2, 2|->3, 3|->4, 22|->3} & r={y|(y,3):x} & r={2,22}', |
| 4154 | | '-evalt', 'x = {1|->2, 2|->3, 3|->4} & r={y|(y,5):x} & r={}' |
| 4155 | | ], 'Test new compilation of set membership.'). |
| 4156 | | cli_testcase(1711, [tickets], ['../prob_examples/public_examples/B/ErrorMachines/ParseErrors/DefinitionInQuantifier2.mch', |
| 4157 | | '-expcterrpos', type_error, 16, 18, |
| 4158 | | '-expcterrpos', bmachine_construction, 12, 1, '-expcterr', 'load_main_file' |
| 4159 | | ], 'Check illegal DEFINITION args detected'). |
| 4160 | | cli_testcase(1712, [b_test], ['../prob_examples/public_examples/B/Tester/DefGoal.mch', |
| 4161 | | '-execute_all', '-nogoal', '-check_goal' |
| 4162 | | ], 'Check -check_goal works with -execute_all'). |
| 4163 | | cli_testcase(1713, [b_test,external,hash], ['../prob_examples/public_examples/B/ExternalFunctions/TestLibraryMeta.mch', '-model-check', '-strict'], 'Check that external functions on state space work.'). |
| 4164 | | cli_testcase(1714, [cbc, clpfd_tables], [ |
| 4165 | | '-evalf', 'r = {x,y,z|x:{1,4,7,10,13,16,19,21,24,27,30,33,36,39,42,45,48}&y=x+1&z=y+1} & (x |-> y) |-> z : r & y : 10 .. 13 & z < 11', % takes Kodkod about 2 seconds to solve |
| 4166 | | '-evalt', 'r = {x,y,z|x:{1,4,7,10,13,16,19,21,24,27,30,33,36,39,42,45,48}&y=x+1&z=y+1} & (x |-> y) |-> z : r & y : 10 .. 13 & z > 11', % takes Kodkod about 2 seconds, z3 90 ms, ProB 10 ms |
| 4167 | | '-evalt', 'r = {x,y,z|x:{1,4,7,10,13,16,19,21,24,27,30,33,36,39,42,45,48}&y=x+1&z=y+1} & {x,y,z|(x |-> y) |-> z : r & y : 10 .. 13 & z >11} = {(10,11,12)}' |
| 4168 | | ], 'Test new clpfd_table module.'). % tests also pass with prior version of ProB |
| 4169 | | cli_testcase(1715, [tickets,codespeed,data_validation], [ |
| 4170 | | '../prob_examples/examples/B/Alstom/Boucles_Jul11/essai2_boucle1.mch', |
| 4171 | | '-t', '-strict', |
| 4172 | | '-expcterr', 'invariant_violation', |
| 4173 | | '-p', 'MAXINT', 10000000, '-p', 'MININT', -10000000, '-p', 'TIME_OUT', 14000], % increased from 8000 for windows jenkins jobs |
| 4174 | | 'Test performance (codespeed test Alstom_essai2_boucle1) + tests watched-literal function application'). |
| 4175 | | cli_testcase(1716, [tickets,slot,clpfd_tables], ['../prob_examples/public_examples/B/Tickets/SLOT-PERFORMANCE6_no_print/Solver_v2.mch', |
| 4176 | | '-p', 'TIME_OUT', 75000, % increased time-out for Gitlab Windows runner from 25000 on Feb 9th 2020 |
| 4177 | | '-init', % '-v', % generates non-ground closure warnings |
| 4178 | | '-evalt', 'CHECK({"BK-GER-H-2013"}, cmcc, choiceUnits, choiceGroups)', % this worked before |
| 4179 | | '-evalt', 'CHECK_wr({"BK-GES-H-2013"}, cmcc, choiceUnits, choiceGroups,{mod47,mod46, mod45, mod44, mod43},{au76,au77,au79,au80,au81},UNITS)', % this also worked before |
| 4180 | | '-evalt', 'CHECK_wr({"BK-GES-H-2013"}, cmcc, choiceUnits, choiceGroups,{mod47,mod46, mod45, mod44, mod43},{au76,au77,au79,au80,au81,au82,au83,au84},{unit182,unit183,unit184,unit185,unit186,unit187,unit188,unit189,unit190,unit191,unit192,unit193,unit194,unit234,unit267,unit268} )' % this did NOT work before |
| 4181 | | % '-evalt', 'CHECK({"BK-GES-H-2013"}, cmcc, choiceUnits, choiceGroups)' % does not yet work |
| 4182 | | ], 'Ensure no time-out and that new element/3 constraint for function application and table constraint work'). |
| 4183 | | cli_testcase(1717, [cbc,clpfd_tables], [ |
| 4184 | | '-evalf', 'f = {aa|->(1,aa), x|->(2,x+1), y|->(3,y+1)} & x:1..2 & aa:0..1 & y:4..5 & r = f(v) & v:3..4 & x+y<v', |
| 4185 | | '-evalf', 'f = {aa|->(1,aa), x|->(2,x+1), y|->(3,y+1)} & x:1..2 & aa:0..1 & y:3..5 & r = f(v) & v:2..4 & prj1(INTEGER,INTEGER)(r) /: 2..3', |
| 4186 | | '-evalt', 'f = {aa|->(1,aa), x|->(2,x+1), y|->(3,y+1)} & x:1..2 & aa:0..1 & y:3..5 & r = f(v) & v:2..4 & prj1(INTEGER,INTEGER)(r) =2', |
| 4187 | | '-evalf', 'f = {aa|->rec(p1:1,p2:aa), x|->rec(p1:2,p2:x+1), y|->rec(p1:3,p2:y+1)} & x:1..2 & aa:0..1 & y:3..5 & r = f(v) & v:2..4 & r\'p1 /: 2..3', |
| 4188 | | '-evalt', 'f = {aa|->rec(p1:1,p2:aa), x|->rec(p1:2,p2:x+1), y|->rec(p1:3,p2:y+1)} & x:1..2 & aa:0..1 & y:3..5 & r = f(v) & v:2..4 & r\'p1 =2' |
| 4189 | | ], 'Exercise new element/3 function application treatment'). |
| 4190 | | cli_testcase(1718, [cbc,cbc_tests], ['../prob_examples/public_examples/B/Demo/Lift_inf.mch', '-cbc_sequence', 'dec;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc;inc', '-strict', '-goal', 'curfloor=40', '-check_goal'], 'Check cbc_sequence for longer sequence'). |
| 4191 | | cli_testcase(1719, [smt_solver_integration], [ |
| 4192 | | '-p','SMT_SUPPORTED_INTERPRETER','TRUE', |
| 4193 | | '-evalt', 'x = 1', |
| 4194 | | '-evalf', 'x = 1 & x > 2', |
| 4195 | | '-evalf', 'x:INTEGER & x>y & y>x', |
| 4196 | | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', |
| 4197 | | '-evalf', 'r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', |
| 4198 | | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2 & s:struct(f1:15..20,f2:1..100) & s=r', |
| 4199 | | '-evalt', 'v1:struct(lderb:{TRUE},mspue:{FALSE},fhhxr:{TRUE})', |
| 4200 | | '-evalf', 'x>0 & x+2 <= p & x=p', |
| 4201 | | % '-evalf', 'not(Pace_Int - sp >= 0) & (sp > 0 & sp < Pace_Int)', % relies on timeout_constraint, only works with enable_time_out_for_constraints compile flag |
| 4202 | | '-evalt', '{x} <: {999}', |
| 4203 | | '-evalt', '{x} <: {999,1000} & x > 999', |
| 4204 | | '-evalt', 'x = {1,2} /\\ {3,4}', |
| 4205 | | '-evalt', 'x = {(1,2),(3,4),(4,5),(6,7),(8,9)} & y|->v : x & y|->w : x', |
| 4206 | | '-evalt', 'x : {1,2} --> NAT', |
| 4207 | | '-evalf', 'x : {1,2} --> NAT & x = {(1,1)}', |
| 4208 | | '-evalt', 'x : {1,2} --> NAT & x = {(1,1),(2,1)}', |
| 4209 | | '-evalf', 's = min({1}) & s=2', |
| 4210 | | '-evalf', 's = min({1,2}) & s>2', |
| 4211 | | '-evalt', 'x = %i.(i:1..10|i+i) & x[{j}]={8}', |
| 4212 | | '-evalt', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,10}', |
| 4213 | | '-evalf', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,11}', |
| 4214 | | '-evalt', 'x:1..10 & #y.(y:1..10 & y>x) & #y.(y:1..10 & y<x)' |
| 4215 | | ], 'some constraints that should be solved by the integrated ProB / SMT solver'). |
| 4216 | | cli_testcase(1720, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4217 | | '-evalt', '{x|x:1..n} = {y,y+1}', |
| 4218 | | '-evalt', '1..n = {y,y+1}', |
| 4219 | | '-evalt', '1..n = r & r={y,y+1}', |
| 4220 | | '-evalt', '{n,y|#r.(1001..n = r & r={y,y+1})} = {(1002,1001)}', |
| 4221 | | '-evalf', '1001..n = r & r={y,y+2}', |
| 4222 | | '-evalt', '1001..n = {y,y+2,y+1} & n<20000' % TO DO: get rid of necessity for n<20000 |
| 4223 | | ], 'test improved constraint propagation for in_interval and frozen_dif'). |
| 4224 | | cli_testcase(1721, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4225 | | '-evalf', 'X:INTEGER & X*Y /= X*Y2 & Y2=Y', |
| 4226 | | '-evalf', 'X:INTEGER & X+Y /= Y2+X & Y2=Y' |
| 4227 | | ], 'test improved clpfd_neq_expr'). |
| 4228 | | cli_testcase(1722, [cbc,cse], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CSE', 'TRUE', |
| 4229 | | '-evalf', 'not(#(x,y,z).((x+1)*y = 1000 & (x+1)*z=y & z=(x+1) ))', % already worked before |
| 4230 | | '-evalt', 'not(#(x,y,z).((x+1)*y = 1001 & (x+1)*z=y & z=(x+1) ))', % already worked before |
| 4231 | | '-evalt', 'not(#(X,Y,Z,Z1,Z2,Z3,Z4).(X:INTEGER & X*Y=Z1 & Z1*Z = Z2 & Z*X = Z3 & Z3*Y = Z4 & Z2 /= Z4))', |
| 4232 | | '-evalf', 'not(not(#(X,Y,Z,Z1,Z2,Z3,Z4).(X:INTEGER & X*Y=Z1 & Z1*Z = Z2 & Z*X = Z3 & Z3*Y = Z4 & Z2 /= Z4)))', |
| 4233 | | '-evalf', '#(X,Y,Z).(X:INTEGER & #(Z1,Z2,Z3,Z4).(X*Y=Z1 & Z1*Z = Z2 & Z*X = Z3 & Z3*Y = Z4 & Z2 /= Z4))' |
| 4234 | | ], 'test single usage identifier inlining'). |
| 4235 | | cli_testcase(1723, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4236 | | '-evalf', 'X:INTEGER & Y*X /= X*Y2 & Y2=Y', |
| 4237 | | '-evalf', 'X:INTEGER & X*Y*(Z+V) /= (V+Z)*X*Y', |
| 4238 | | '-evalf', 'X:INTEGER & X+Y+(Z*V) /= (V*Z)+X+Y', |
| 4239 | | '-evalt', 'not(#(X,Y,Z,Z1,Z2,Z3,Z4).(X:INTEGER & X*Y=Z1 & Z1*Z = Z2 & Z*X = Z3 & Z3*Y = Z4 & Z2 /= Z4))', |
| 4240 | | '-evalf', 'x:INTEGER & (x-(x+a*b)) /= (y-(b*a+x)) & y=x', % added later |
| 4241 | | '-evalf', 'x:INTEGER & (-(x+a*b)) /= (-(b*a+y)) & y=x' % added later |
| 4242 | | ], 'test improved commutativity detection in clpfd_neq_expr'). |
| 4243 | | cli_testcase(1724, [tickets], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4244 | | '-execute_all', '-check_goal', |
| 4245 | | '../prob_examples/public_examples/B/Tester/CheckGoal.mch'],'test check_goal with executed_all'). |
| 4246 | | cli_testcase(1725, [tickets, b_test], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4247 | | '-assertions', '-init', |
| 4248 | | '../prob_examples/public_examples/B/Tester/Visibility/M2_xx.mch'],'test visibility in assertions clause'). |
| 4249 | | cli_testcase(1726, [b_test,external,xml], ['../prob_examples/public_examples/B/ExternalFunctions/XML_Reader.mch', '-t', '-assertions', |
| 4250 | | '-evalt', 'READ_XML_FROM_STRING("<h3>hallo</h3>") = [rec(attributes:{},element:"h3",meta:{("xmlLineNumber"|->"1")},pId:0,recId:1), rec(attributes:{("text"|->"hallo")},element:"CText",meta:{("xmlLineNumber"|-> "1")},pId:1,recId:2)]', |
| 4251 | | '-strict'], 'Check that external function to read XML works.'). |
| 4252 | | cli_testcase(1727, [b_test,ltl,safety], ['../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', '-ltlformulaf', 'G not [bget]', '-p', 'use_safety_ltl_model_checker', true, '-strict'],'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). |
| 4253 | | cli_testcase(1728, [error_checks], [ '-strict', |
| 4254 | | '-expcterrpos', 'bmachine_static_checks', 10, 15, |
| 4255 | | '../prob_examples/public_examples/B/Tester/InitialisationChecks/IllegalOrderOfInits.mch'],'test detection of illegal initialisations'). |
| 4256 | | cli_testcase(1729, [error_checks], [ '-strict', |
| 4257 | | '-expcterrpos', 'bmachine_static_checks', 10, 25, |
| 4258 | | '../prob_examples/public_examples/B/Tester/InitialisationChecks/IllegalParallelInit.mch'],'test detection of illegal initialisations'). |
| 4259 | | cli_testcase(1730, [error_checks], [ '-strict', |
| 4260 | | '-expcterrpos', 'bmachine_static_checks', 14, 2, |
| 4261 | | '../prob_examples/public_examples/B/Tester/InitialisationChecks/IllegalChoiceOrderInit.mch'],'test detection of illegal initialisations'). |
| 4262 | | cli_testcase(1731, [cbc,infinite], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4263 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', |
| 4264 | | '-evalt', 'f=%x.(x:iseq(struct(a:STRING))|x) & f([rec(a:"a")])=[rec(a:"a")]', |
| 4265 | | '-evalt', 'f=%x.(x:iseq(struct(a:STRING,b:BOOL))|x) & f([rec(a:"a",b:TRUE)])=[rec(a:"a",b:xx)] & xx=TRUE', |
| 4266 | | '-evalt', 'f=%x.(x:iseq(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', |
| 4267 | | '-evalt', 'f=%x.(x:iseq1(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', |
| 4268 | | '-evalt', 'f=%x.(x:seq1(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', |
| 4269 | | '-evalt', 'f=%x.(x:seq(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', |
| 4270 | | '-evalt', 'f=%x.(x:iseq(struct(a:seq1(NATURAL),b:BOOL))|x) & f([rec(a:[222],b:TRUE)])=[rec(a:[222],b:xx)] & xx=TRUE', |
| 4271 | | '-evalf', 'f=%x.(x:iseq(struct(a:STRING))|x) & f([rec(a:"a")])=[rec(a:"b")]'], |
| 4272 | | 'test detection of infinite function without virtual time-outs'). |
| 4273 | | cli_testcase(1732, [tickets], [ |
| 4274 | | '../prob_examples/public_examples/B/Tickets/Hansen31_VirtualTimeout/VirtualTimeout.mch', '-mc', 1000, '-expcterr','model_check_incomplete','-expcterr','virtual_time_out'], 'Check that we detect that model-checking incomplete.'). |
| 4275 | | cli_testcase(1733, [tickets,execute], [ % '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4276 | | '../prob_examples/public_examples/B/Tickets/Hansen31_VirtualTimeout/VirtualTimeout.mch', '-execute', 1000, |
| 4277 | | '-animate_stats', |
| 4278 | | '-expcterr','virtual_time_out_execute'], 'Check that we detect that execute incomplete.'). |
| 4279 | | cli_testcase(1734, [tickets,animate], [ % '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4280 | | '../prob_examples/public_examples/B/Tickets/Hansen31_VirtualTimeout/VirtualTimeout.mch', '-animate', 5, |
| 4281 | | '-animate_stats', |
| 4282 | | '-expcterr','virtual_time_out'], 'Check that we detect that execute incomplete.'). |
| 4283 | | cli_testcase(1735, [cbc,cbc_tests], ['../prob_examples/public_examples/B/Tester/InitialisationChecks/InitCBCCheck.mch', '-cbc_sequence', 'Goal', '-strict'], 'Check cbc_sequence with non-det. INITIALISATION'). |
| 4284 | | cli_testcase(1736, [error_checks,b_test], ['../prob_examples/public_examples/B/Tester/InitialisationChecks/InitIF_Fails.mch', '-init', '-expcterrpos', initialisation_fails, 13,17, '-strict'], 'Check INITIALISATION error inside IF located'). |
| 4285 | | cli_testcase(1737, [cbc,b_test,quantified,union,card], ['../prob_examples/public_examples/B/PerformanceTests/UNION_CardGT.mch', '-t'], 'test_closure for lambda closures avoid interference between domain and range expression'). |
| 4286 | | cli_testcase(1738, [external,b_test,xml], ['../prob_examples/public_examples/B/ExternalFunctions/XML/utf8_data.mch', '-assertions'], 'test READ_XML with UTF-8 encoding'). |
| 4287 | | cli_testcase(1739, [cbc,private], ['../prob_examples/examples/B/Alloy/req2_v3_not_conj_check.mch', |
| 4288 | | '../prob_examples/examples/B/Alloy/req2_v3_not_conj_check2.mch', % version with larger CONTEXT set, more difficult |
| 4289 | | '-t', '-p', 'TIME_OUT', '9500'], 'test not conjunction treatment of kernel'). |
| 4290 | | cli_testcase(1740, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4291 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', |
| 4292 | | '-evalt', '#x.(x:1..10000 & x mod 22 = 11) or b=TRUE', |
| 4293 | | '-evalt', '(#x.(x:1..10000 & x mod 22 = 11) or b=TRUE) => b=FALSE', |
| 4294 | | '-evalt', '(#x.(x:1..10000 & x mod 22 = 22) or b=TRUE) => b=FALSE', |
| 4295 | | '-evalf', '(b=FALSE => (#x.(x:1..10000 & x mod 22 = 22) or b=TRUE)) & (b=TRUE => (#x.(x:1..10000 & x mod 22 = 22) or b=FALSE))' |
| 4296 | | ], |
| 4297 | | 'test reification of RHS of disjunction (or)'). |
| 4298 | | cli_testcase(1741, [ctl], ['../prob_examples/public_examples/B/Ivo/CTLIssue.mch', '-ctlformulat', 'AF {x=4}'], 'Testing bug-fix caused by an unnecessary cut.'). |
| 4299 | | cli_testcase(1742, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', |
| 4300 | | '-ltlformulat', 'GF e(a.red)', '-strict' |
| 4301 | | ], 'Test check should show that verysimple fulfills the LTL formula, which is equivalent to the CTL formula AGAF e(a.red).'). |
| 4302 | | cli_testcase(1743, [cbc,infinite,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4303 | | '-evalt', '{3} <| %x.(x:NATURAL|x+1) = {3|->4}', |
| 4304 | | '-evalf', '{3} <| %x.(x:NATURAL|x+1) = {a,b} & a/=b', |
| 4305 | | '-evalt', '2..4 = ran((1..3) <| %x.(x:NATURAL|x+1))', |
| 4306 | | '-evalt', '1..3 = dom(%x.(x:NATURAL|x+1)|>(2..4))', |
| 4307 | | '-evalt', '(1..9) <| pred = %x.(x:1..9|x-1)', |
| 4308 | | '-evalt', '(1..9) <| succ = %x.(x:1..9|x+1)', |
| 4309 | | '-evalt', '{n} <| succ = {15|->x} & n<20' |
| 4310 | | ], 'Test better symbolic treatment of union'). |
| 4311 | | cli_testcase(1744, [cbc,infinite,union], [ |
| 4312 | | '-evalt', '4|->b : {3} <<| %x.(x:NATURAL|x+1)', |
| 4313 | | '-evalf', '4|->b : (%x.(x:NATURAL|x+1) |>> (1..9))', |
| 4314 | | '-evalt', '14|->b : (%x.(x:NATURAL|x+1) |>> (1..9))', |
| 4315 | | '-evalt', '{b|14|->b : (%x.(x:NATURAL|x+1) |>> (1..9))} = {15}', |
| 4316 | | '-evalt', 'x = {-1,-33} \\/ NATURAL1 & 11:x & -1:x & -33:x & 0 /: x' |
| 4317 | | ], 'Test better symbolic treatment of union'). |
| 4318 | | cli_testcase(1745, [tickets,codespeed], [ |
| 4319 | | '../prob_examples/public_examples/B/Puzzles/EulerWay.mch', |
| 4320 | | %'../prob_examples/public_examples/B/Puzzles/EulerWayDisjunction.mch', % this does not work yet; disjoin_true change makes this version too slow |
| 4321 | | '-init', '-p', 'TIME_OUT', 9500 |
| 4322 | | ], |
| 4323 | | 'EulerWay Codespeed Test'). |
| 4324 | | cli_testcase(1746, [cbc], [ |
| 4325 | | '../prob_examples/public_examples/B/CBC/Feasibility_baloadR07.mch', |
| 4326 | | '-init' |
| 4327 | | ], |
| 4328 | | 'Check reification of existential quantifier with 27 cases not problematic'). |
| 4329 | | cli_testcase(1747, [codespeed], [ |
| 4330 | | '../prob_examples/public_examples/B/Demo/SortByPermutation_v2.mch', |
| 4331 | | '-t', '-p', 'TIME_OUT', 9500, '-p', 'CLPFD', 'FALSE'], |
| 4332 | | 'SortByPermutation_v2 Codespeed Test 55 wo CLPFD'). |
| 4333 | | cli_testcase(1748, [codespeed], [ |
| 4334 | | '../prob_examples/public_examples/B/PerformanceTests/ModelChecking/CountToMAXINT.mch', |
| 4335 | | '-mc', 500002, '-p', 'MAXINT', 500000, '-nodead'], |
| 4336 | | 'MC_CountToMAXINT_50000 Codespeed Test'). |
| 4337 | | cli_testcase(1749, [codespeed, symmetry_test,cse], ['../prob_examples/public_examples/EventBPrologPackages/SET_Game/SET_GAM_Sym_NoSet20_mch.eventb', '-mc', '1000', '-p', 'SYMMETRY_MODE', 'hash', '-p', 'TIME_OUT', '7000', '-p', 'CLPFD', 'TRUE', '-df', '-goal', 'n=18', '-p', 'MAX_OPERATIONS', '20', '-strict', '-expcterr', 'goal_found', '-p', 'CSE', 'TRUE'], 'Test 395 with CSE'). |
| 4338 | | cli_testcase(1750, [private,alstom,codespeed,data_validation], [ |
| 4339 | | '../prob_examples/examples/B/Alstom/axl3/axl3.mch', |
| 4340 | | '-t', '-p', 'CLPFD', 'TRUE'], |
| 4341 | | 'axl3 Codespeed Test'). |
| 4342 | | cli_testcase(1751, [private,alstom,codespeed,data_validation], [ |
| 4343 | | '../prob_examples/examples/B/Alstom/cbtc/actions_cbtc.mch', |
| 4344 | | '-t', '-p', 'CLPFD', 'TRUE'], |
| 4345 | | 'actions_cbtc Codespeed Test'). |
| 4346 | | cli_testcase(1752, [private,codespeed,private,data_validation], [ |
| 4347 | | '../prob_examples/examples/B/Alstom/DataValidationProject/Rule_TMS_Route_0006.mch', |
| 4348 | | '-p', 'MAXINT', 10000000, '-p', 'MININT', -10000000, '-p', 'TIME_OUT', '60000', |
| 4349 | | '-p', 'SHOW_EVENTB_ANY_VALUES', 'true', |
| 4350 | | '-mc', 1000, '-df', '-nodead', '-expcterr', 'invariant_violation', |
| 4351 | | '-p', 'CLPFD', 'FALSE'], |
| 4352 | | 'ClearSy_RuleTMS_R0006 Codespeed Test'). |
| 4353 | | cli_testcase(1753, [codespeed,private,data_validation,clpfd_tables], [ |
| 4354 | | '../prob_examples/examples/B/Alstom/DataValidationProject/Rule_TMS_Route_0006.mch', |
| 4355 | | '-p', 'MAXINT', 10000000, '-p', 'MININT', -10000000, |
| 4356 | | '-p', 'TIME_OUT', '80000', % sometimes breaks on windows test runner; requires 31 seconds on MacBookPro |
| 4357 | | % has become slower when switching to table/3 using method(aux) option |
| 4358 | | '-p', 'SHOW_EVENTB_ANY_VALUES', 'true', |
| 4359 | | '-mc', 1000, '-df', '-nodead', '-expcterr', 'invariant_violation', |
| 4360 | | '-p', 'CLPFD', 'TRUE'], |
| 4361 | | 'ClearSy_RuleTMS_R0006_CLPFD Codespeed Test'). |
| 4362 | | cli_testcase(1754, [cbc,sigma], [ |
| 4363 | | '../prob_examples/public_examples/B/CBC/Tests/TestSIGMA.mch', |
| 4364 | | '-init', '-assertions' |
| 4365 | | ], |
| 4366 | | 'Check reification of IF-THEN-ELSE in SIGMA + WD detection of total avl function'). |
| 4367 | | cli_testcase(1755, [tickets,quantified,union], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4368 | | '-evalt', 'UNION(x).(x:1..4|{x+y}) = 12..15', |
| 4369 | | '-evalf', 'UNION(x).(x:1..4|{x+y}) = 12..16', |
| 4370 | | '-evalt', '{y|UNION(x).(x:1..4|{x+y}) = 12..15} = {11}', |
| 4371 | | '-evalt', '{n|UNION(x).(x:1..10|{x}) = 1..n} = {10}', |
| 4372 | | '-evalt', 'UNION(x).(x:1..n|{x}) = 1..10', % used to generate warning |
| 4373 | | '-evalf', '{n|UNION(x).(x:1..n|{x}) = 1..0} = {0}', % used to generate virtual time-out |
| 4374 | | '-evalt', '{n|n:NATURAL & UNION(x).(x:1..n|{x}) = 1..0} = {0}', |
| 4375 | | '-evalt', '{n|n:-1..3 & UNION(x).(x:1..n|{x}) = 1..0} = {-1,0}' |
| 4376 | | ], 'ensure new UNION treatment with better propagation'). |
| 4377 | | cli_testcase(1756, [tickets,card], [ |
| 4378 | | '../prob_examples/public_examples/B/Tester/SetSetupTests/CardDefSetConstraint.mch', |
| 4379 | | '-init', '-assertions' |
| 4380 | | ], |
| 4381 | | 'Check deferred set size inference improved'). |
| 4382 | | cli_testcase(1757, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4383 | | '-evalt', '{x,y|IF x:0..3 THEN y=2 ELSE 1=0 END} = {(0|->2),(1|->2),(2|->2),(3|->2)}', |
| 4384 | | '-evalt', '{x,y|IF x/:0..3 THEN 1=0 ELSE y=2 END} = {(0|->2),(1|->2),(2|->2),(3|->2)}' |
| 4385 | | ], 'exercise => FALSE AST simplification'). |
| 4386 | | cli_testcase(1758, [b_test,ltl,safety], [ |
| 4387 | | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', |
| 4388 | | '-ltlformulaf', 'G not [bget]', |
| 4389 | | '-p', 'use_safety_ltl_model_checker', true, '-strict' |
| 4390 | | ], |
| 4391 | | 'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). |
| 4392 | | cli_testcase(1759, [b_test,ltl,safety], [ |
| 4393 | | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', |
| 4394 | | '-ltlformulaf', 'G not ({nsoda = 0} => X [sget])', |
| 4395 | | '-p', 'use_safety_ltl_model_checker', true, '-strict' |
| 4396 | | ], |
| 4397 | | 'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). |
| 4398 | | cli_testcase(1760, [b_test,ltl,safety], [ |
| 4399 | | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', |
| 4400 | | '-ltlformulaf', '{paid=FALSE} or ({nbeer=1} & {nsoda =1}) & (({nbeer = 0}) R (X [bget]))', |
| 4401 | | '-p', 'use_safety_ltl_model_checker', true, '-strict' |
| 4402 | | ],'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). |
| 4403 | | cli_testcase(1761, [b_test,ltl,safety], [ |
| 4404 | | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', |
| 4405 | | '-ltlassertions', '-p', 'use_safety_ltl_model_checker', true, '-strict' |
| 4406 | | ],'Checking that the safety LTL model checker succeeds on each assertions.'). |
| 4407 | | cli_testcase(1762, [b_test,ltl,safety], [ |
| 4408 | | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', |
| 4409 | | '-ltlformulaf', 'F [ret_coin] => {paid=TRUE}', '-p', 'use_safety_ltl_model_checker', true, '-strict' |
| 4410 | | ],'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). |
| 4411 | | cli_testcase(1763, [cbc,slot,tickets,wd, unsat_core,let], ['../prob_examples/public_examples/B/Tickets/SLOT-WD-ISSUE/Solver.mch', |
| 4412 | | '-assertions', |
| 4413 | | '-expcterrpos', definition_variable_capture, 270, 12, |
| 4414 | | '-evalt', 'UNSAT_CORE_SESSIONS({group3, group4}) = {session3,session4}' |
| 4415 | | ], 'Check that wd issue with let predicates solved (expressions not guarded)'). |
| 4416 | | cli_testcase(1764, [laws], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4417 | | '../prob_examples/public_examples/B/Laws/BoolLaws.mch', |
| 4418 | | '../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 4419 | | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', |
| 4420 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', |
| 4421 | | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', |
| 4422 | | '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'OPTIMIZE_AST', 'FALSE', '-opterr', 'model_check_incomplete'], 'Mathematical Laws with AST optimization disabled'). |
| 4423 | | cli_testcase(1765, [cbc,private], ['../prob_examples/examples/B/AWE_JASP/v7/JavaBC0.mch', |
| 4424 | | '-t', '-mc', '200', |
| 4425 | | '-nogoal', '-noass' |
| 4426 | | ], 'Check Java Bytecode interpreter'). |
| 4427 | | cli_testcase(1766, [private,case,forall], ['../prob_examples/public_examples/B/Tester/ForAllExpansionEnumWarning.mch', |
| 4428 | | '-init', '-aa', 0,0,1 |
| 4429 | | ], 'Check forall not expanded'). |
| 4430 | | cli_testcase(1767, [b_test,case], ['../prob_examples/public_examples/B/Tester/CaseStmt_v2.mch', '-t', '-strict'],'Check case statement with multiple values for same case'). |
| 4431 | | cli_testcase(1768, [b_test,case], ['../prob_examples/public_examples/B/Tester/CaseStmt_Illegal1.mch', '-init', |
| 4432 | | '-expcterrpos', type_error, 24, 10, '-expcterr', load_main_file, |
| 4433 | | '-strict'],'Check case statement with else'). |
| 4434 | | cli_testcase(1769, [tickets,kodkod,card], [ '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 4435 | | '-evalt', ':kodkod card({a,b|a:BOOL & b:1..k})=4 & k:0..2', |
| 4436 | | '-evalf', ':kodkod card({a,b|a:BOOL & b:1..k})=3 & k:0..10', |
| 4437 | | '-evalt', ':kodkod card({a,b,c})=1 & {a,b,c}<:BOOL', |
| 4438 | | '-evalt', ':kodkod card({a,b,c})=2 & {a,b,c}<:1..10 & a+b+c=20' |
| 4439 | | ], 'check card interval analysis succeeds (PROB-411)'). |
| 4440 | | cli_testcase(1770,[cbc,enabling],[ |
| 4441 | | '-enabling_analysis_csv','../prob_examples/public_examples/B/CBC/Enabling/ChoiceByPredicate_enabling_analysis.csv', |
| 4442 | | '../prob_examples/public_examples/B/CBC/Enabling/ChoiceByPredicate.mch', |
| 4443 | | '-p', 'TIME_OUT', 1000 |
| 4444 | | ], 'Check CSV enabling output for becomes_such'). |
| 4445 | | cli_testcase(1771,[cbc,enabling,case],[ |
| 4446 | | '-enabling_analysis_csv','../prob_examples/public_examples/B/CBC/Enabling/OpParameterTests_enabling_analysis.csv', |
| 4447 | | '../prob_examples/public_examples/B/CBC/Enabling/OpParameterTests.mch', |
| 4448 | | '-p', 'TIME_OUT', 6500 % enabling analysis takes 0.1 this |
| 4449 | | ], 'Check CSV enabling output for variety of substitutions'). |
| 4450 | | cli_testcase(1772, [por,ltl], ['../prob_examples/public_examples/B/Ivo/Threads51.mch', '-ltlformulat', 'GF {v1=n}', |
| 4451 | | '-p', por, ample_sets], 'Check LTL property with partial order reduction.'). |
| 4452 | | cli_testcase(1773, [por,ltl], ['../prob_examples/public_examples/B/Ivo/Threads51.mch', '-ltlformulat', 'G not {v1>n+1}', |
| 4453 | | '-p', use_safety_ltl_model_checker, true, '-p', por, ample_sets], 'Check LTL property with partial order reduction.'). |
| 4454 | | cli_testcase(1774, [por,ltl], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', |
| 4455 | | '-ltlformulat', 'G not deadlock', '-p', por, ample_sets, '-p', pge, full |
| 4456 | | ], 'Check LTL property with partial order reduction.'). |
| 4457 | | cli_testcase(1775, [por,ltl], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', |
| 4458 | | '-ltlformulat', 'G not deadlock', '-p', por, ample_sets, '-p', pge, full, |
| 4459 | | '-p', use_safety_ltl_model_checker, true |
| 4460 | | ], 'Check LTL property with partial order reduction.'). |
| 4461 | | cli_testcase(1776, [tickets,while], [ |
| 4462 | | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1.mch', |
| 4463 | | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1_Internal.mch', |
| 4464 | | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1_Internal_v2.mch', |
| 4465 | | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1_Internal_v3.mch', |
| 4466 | | '-t' |
| 4467 | | ], |
| 4468 | | 'Check compilation of while with op call and inner while works'). |
| 4469 | | cli_testcase(1777, [por], ['../prob_examples/public_examples/B/Ivo/PORTest_WriteDependencies.mch', '-model_check', '-noinv', '-p', por, ample_sets, |
| 4470 | | '-expcterr', deadlock], 'Check that no incorrect reduction is performed on the model.'). |
| 4471 | | cli_testcase(1778, [laws,random], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4472 | | '../prob_examples/public_examples/B/Laws/BoolLaws.mch', |
| 4473 | | '../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 4474 | | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', |
| 4475 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', |
| 4476 | | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', |
| 4477 | | '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict', '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-opterr', 'model_check_incomplete'], 'Mathematical Laws with random enumeration'). |
| 4478 | | cli_testcase(1779, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4479 | | '../prob_examples/public_examples/B/Tester/Constants6.mch', |
| 4480 | | '../prob_examples/public_examples/B/Tester/Constants7.mch', |
| 4481 | | '-property', 'minnr = 7 & mxnr =9 & pid(p1) = a & pid(p2)=b & pid(p3)=c & pnr(p1)=minnr & pnr(p3)=mxnr & root=a', |
| 4482 | | '-t' |
| 4483 | | ], |
| 4484 | | 'Check -property command works'). |
| 4485 | | cli_testcase(1780, [external,b_test,xml], ['../prob_examples/public_examples/B/ExternalFunctions/XML_Reader_Writer.mch', '-init', '-assertions'], 'test READ_XML and WRITE_XML'). |
| 4486 | | cli_testcase(1781, [b_test,preferences], ['../prob_examples/public_examples/B/ErrorMachines/SET_PREF_Illegal.mch', '-init', '-expcterr', pref_definitions], 'test we detect setting illegal preference'). |
| 4487 | | cli_testcase(1782, [b_test,preferences], ['../prob_examples/public_examples/B/FeatureChecks/LocalOperationCall.mch', |
| 4488 | | '../prob_examples/public_examples/B/FeatureChecks/LocalOperationCall2.mch', |
| 4489 | | '-t'], 'test calling local operations'). |
| 4490 | | cli_testcase(1783, [b_test,error_checks], ['../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/HygMacroTest.mch', '-init', '-expcterr', definition_variable_capture], 'test we detect variable capture problem'). |
| 4491 | | cli_testcase(1784, [b_test,error_checks,execute], ['../prob_examples/public_examples/B/FeatureChecks/ExecuteNonDetCsts.mch', '-init', '-det_constants', '-execute_all', '-expcterr', det_check], 'test we detect non-deterministic constant setup'). |
| 4492 | | cli_testcase(1785, [b_test,execute], ['../prob_examples/public_examples/B/FeatureChecks/ExecuteNonDetCsts.mch', '-execute_all', '-check_goal'], 'test execute + check goal'). |
| 4493 | | cli_testcase(1786, [b_test,error_checks], ['../prob_examples/public_examples/B/ErrorMachines/OpCalls/IllegalOpCall.mch', '-init', '-expcterrpos', bmachine_static_checks, 15,19], 'test error raised when operation call left hand side is not an identifier'). |
| 4494 | | cli_testcase(1787, [b_test], ['../prob_examples/public_examples/B/Tester/OpCalls/UseCopy.mch', '-t' |
| 4495 | | ], 'test output parameters can be read'). |
| 4496 | | cli_testcase(1788, [b_test], ['../prob_examples/public_examples/B/Implementations/Values/Sensor0_i.imp', |
| 4497 | | '../prob_examples/public_examples/B/Implementations/Values/DefSetsImp.imp', |
| 4498 | | '-t' |
| 4499 | | ], 'test VALUES clause'). |
| 4500 | | cli_testcase(1789, [b_test,external,records,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4501 | | '../prob_examples/public_examples/B/ExternalFunctions/LibraryStrings.mch', |
| 4502 | | '-evalt', '{rec(sa:"1.101"),rec(sa:"1.102")} =x & x<: (struct(sa : /*@symbolic*/ {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))', |
| 4503 | | '-evalf', '{rec(sa:"1.101"),rec(sa:"1.102.3")} =x & x<: (struct(sa : /*@symbolic*/ {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))' |
| 4504 | | ], 'Check that no infinite expansion occurs here.'). |
| 4505 | | cli_testcase(1790, [b_test,external,hash], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4506 | | '../prob_examples/public_examples/B/ExternalFunctions/TestLibraryHash.mch', '-assertions'], 'Check HASH and SHA_HASH'). |
| 4507 | | cli_testcase(1791, [b_test,external,rulesdsl], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4508 | | '../prob_examples/public_examples/Rules/CSV/Runner_CSV.rmch', '-execute_all', |
| 4509 | | '-goal', '(RULE_AW1="FAIL" & card(RULE_AW1_Counterexamples) = 6)', |
| 4510 | | '-check_goal'], 'Check Rules DSL example with CSV reading'). |
| 4511 | | cli_testcase(1792, [cbc,exists], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4512 | | '-evalt', 'y:7..30000000000 & not(#x.(x:1..10 & x:8..y))', |
| 4513 | | '-evalf', 'y:20..30000000000 & not(#x.(x:1..10 & x:8..y))', |
| 4514 | | '-evalf', 'y:7..30000000000 & not(#x.(x /: 1..y))', |
| 4515 | | '-evalf', 'y:7..30000000000 & not(#x.(not(x : 1..y)))', |
| 4516 | | '-evalt', 'x<:BOOL & x/={} & #y.(y /: x)' |
| 4517 | | ], 'check translation of exists into not equal empty_set'). |
| 4518 | | cli_testcase(1793,[cbc,enabling,private],['-enabling_analysis_csv','../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2_enabling.csv', |
| 4519 | | '../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2.mch'], 'Check CSV output of a simple enabling analysis (Ticket PROB-215).'). |
| 4520 | | cli_testcase(1794,[cbc,exists],['-t', '-cc', 5, 4, |
| 4521 | | '../prob_examples/public_examples/B/CBC/Constraint_with_exists.mch', |
| 4522 | | '../prob_examples/public_examples/B/CBC/Constraint_with_exists_v2.mch'], 'Check improved treatment of in_domain_subtraction and restriction.'). |
| 4523 | | cli_testcase(1795, [cbc,forall], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4524 | | '-evalf', 'yy:1..5 & !x.(x<:POW(INTEGER) => {yy}:x)', |
| 4525 | | '-evalt', '!x.(x:INTEGER => x<0 or x>y) & y:-1..10', |
| 4526 | | '-evalf', '!x.(x:INTEGER => x<0 or x>y) & y:1..10', |
| 4527 | | '-evalf', 'yy:1..5 & !x.(x<:POW(NATURAL) => {yy}:x)', |
| 4528 | | '-evalt', 'yy:-1..5 & !x.(x<:POW(NATURAL) => {yy}/:x)', |
| 4529 | | '-evalf', 'yy:1..5 & !x.(x<:POW(1..10) => {yy}:x)', |
| 4530 | | '-evalf', '!x.(x:NATURAL => x>y) & y:1..10', |
| 4531 | | '-evalt', '!x.(x:NATURAL => x>y) & y:-1..10', |
| 4532 | | '-evalf', '!x.(x:INTEGER => (x:NATURAL => x>y)) & y:1..10', |
| 4533 | | '-evalt', '!x.(x:INTEGER => (x:NATURAL => x>y)) & y:-1..10' |
| 4534 | | ], 'check improved treatment of forall'). |
| 4535 | | cli_testcase(1796,[eventb_test,wd],['-t', '-mc', 100, '-bf', |
| 4536 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/VariantWDError2_mch.eventb', |
| 4537 | | '-expcterr', well_definedness_error, |
| 4538 | | '-expcterr', 'event_error:inc:event_wd_error' ], 'Check detection of WD errors for variants.'). |
| 4539 | | cli_testcase(1797,[enabling,eventb_test,read_write],[ |
| 4540 | | '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_mch_finite.eventb', |
| 4541 | | '-t', |
| 4542 | | '-read_write_matrix_csv', '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_rw_matrix.csv' |
| 4543 | | ], 'Check read-write-matrix with witnesses correctly computed.'). |
| 4544 | | cli_testcase(1798, [laws,rel_fnc,wd], ['../prob_examples/public_examples/B/Laws/FunLawsWithLambda.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE-EVALUATION', 'TRUE', |
| 4545 | | '-p', 'TRY-FIND-ABORT', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test 458 with TRY_FIND_ABORT (and test using - instead of _).'). |
| 4546 | | cli_testcase(1799,[tickets,cbc,clpfd_tables],[ |
| 4547 | | '-evalf', 'deadline : BOOL --> 0..1 & (%d.(d : BOOL & deadline(d) > 0|deadline(d) - 1) /: BOOL <-> NATURAL)', |
| 4548 | | '-evalf', 'deadline : BOOL --> 0..2 & (%d.(d : BOOL & deadline(d) > 0|deadline(d) - 1) /: BOOL +-> NATURAL)', |
| 4549 | | '-evalt', 'deadline : BOOL --> 0..10 & (%d.(d : BOOL & deadline(d) >= 0|deadline(d) - 1) /: BOOL +-> NATURAL)', |
| 4550 | | '-evalf', 'deadline : BOOL --> 1..2 & (%d.(d : BOOL & deadline(d) > 1|deadline(d) - 2) /: BOOL <-> NATURAL)' |
| 4551 | | ], 'Check element/3 SICStus bug solved.'). |
| 4552 | | cli_testcase(1800,[tickets,disprover,cbc,clpfd_tables],[ |
| 4553 | | '../prob_examples/public_examples/EventBPrologPackages/Disprover/Tickets/LOCKR1_mch.pl', |
| 4554 | | '-expecterr', disprover_unsound, |
| 4555 | | %'-check_disprover_result', 0,1,10 % Update/inv6/INV is reported false : check that this is correct, the counter example seems indeed valid; there was probably a bug in an earlier version of Rodin |
| 4556 | | %'-check_disprover_result', 3,1,7 % when using the new WD prover we can prove 3 POs |
| 4557 | | %'-check_disprover_result', 5,1,5, % and now 4,5 POs |
| 4558 | | '-check_disprover_result', 8,1,2, % and now 8 POs |
| 4559 | | '-timeout', 800 % for Windows |
| 4560 | | ], 'Check element/3 SICStus bug solved.'). % we still have issue with CHR and element/3 |
| 4561 | | cli_testcase(1801, [tickets,eventb_test,records], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4562 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/InitialisationByPredicate/TestBecomeSuch.mch', |
| 4563 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/InitialisationByPredicate/TestBecomeSuch_mch.eventb', |
| 4564 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/InitialisationByPredicate/M0_v4_mch.eventb', % record detection |
| 4565 | | '-t' |
| 4566 | | ], 'Check that Event-B becomes_such works correctly, in particular with record detection.'). |
| 4567 | | cli_testcase(1802,[eventb_test,witnesses],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4568 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_mch.eventb', |
| 4569 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_finite_unproven_mch.eventb', |
| 4570 | | '-t', '-mc', 500, '-opterr', model_check_incomplete |
| 4571 | | ], 'Check witness for removed abstract variable.'). |
| 4572 | | cli_testcase(1803,[eventb_test,witnesses,cbc],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4573 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_finite_unproven_mch.eventb', |
| 4574 | | '-cbc', 'all' |
| 4575 | | ], 'Check cbc invariant with witnesses.'). |
| 4576 | | cli_testcase(1804,[eventb_test,witnesses],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4577 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_error_mch.eventb', |
| 4578 | | '-mc', 500, |
| 4579 | | '-expcterr', 'event_error:inc:action_not_executable' |
| 4580 | | ], 'Check witness error found.'). |
| 4581 | | cli_testcase(1805,[eventb_test,witnesses],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4582 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/Guard0_simerror_mch.eventb', |
| 4583 | | '-mc', 500, '-nodead', |
| 4584 | | '-expcterr', 'event_error:even_dec:simulation_error' |
| 4585 | | ], 'Check witness error found.'). |
| 4586 | | cli_testcase(1806,[eventb_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4587 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/VariantNegative_mch.eventb', |
| 4588 | | '-mc', 500, '-nodead', |
| 4589 | | '-expcterr', 'event_error:dec:variant_negative' |
| 4590 | | ], 'Check variant error found.'). |
| 4591 | | cli_testcase(1807,[eventb_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4592 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/VariantError_mch.eventb', |
| 4593 | | '-mc', 500, '-nodead', |
| 4594 | | '-expcterr', 'event_error:dec:invalid_variant' |
| 4595 | | ], 'Check variant error found.'). |
| 4596 | | cli_testcase(1808,[eventb_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4597 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/TheoremInGuardError_mch.eventb', |
| 4598 | | '-mc', 500, '-nodead', |
| 4599 | | '-expcterr', 'event_error:dec:invalid_theorem_in_guard' |
| 4600 | | ], 'Check variant error found.'). |
| 4601 | | cli_testcase(1809, [tickets,kodkod], [ '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 4602 | | '../prob_examples/public_examples/B/Tickets/Kodkod7_QueensBug/Queen_BoardVersion.mch', |
| 4603 | | '../prob_examples/public_examples/B/Tickets/Kodkod7_QueensBug/Queen_BoardVersion_v2.mch', |
| 4604 | | '../prob_examples/public_examples/B/Tickets/Kodkod7_QueensBug/Queen_BoardVersion_v3.mch', |
| 4605 | | '-init' |
| 4606 | | ], 'check Kodkod bug fixed'). |
| 4607 | | cli_testcase(1810, [b_test,unicode,atelierb], |
| 4608 | | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4609 | | '../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString.mch', '-assertions', |
| 4610 | | '-pp', '../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString_Internal.mch' |
| 4611 | | ],'Test unicode support.'). |
| 4612 | | cli_testcase(1811, [tickets,eventb_test,records], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4613 | | '../prob_examples/public_examples/B/FeatureChecks/SheBang.mch', '-t' |
| 4614 | | ], 'Test parser accepts she-bang line starting with #!.'). |
| 4615 | | cli_testcase(1812, [smt_solver_integration,private], [ |
| 4616 | | '../prob_examples/public_examples/ProofObligations/GearDoor1_mch.pl', |
| 4617 | | '../prob_examples/public_examples/ProofObligations/GearsDoorsHandle3_mch.pl', |
| 4618 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M2_mch.pl', |
| 4619 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M20_mch.pl', |
| 4620 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M3_mch.pl', |
| 4621 | | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M30_mch.pl', |
| 4622 | | %'../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m1_true.pl', |
| 4623 | | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE' |
| 4624 | | %,'../prob_examples/examples/ProofObligations/ABZ14_Mery/M4_mch.pl' |
| 4625 | | ],'Check Disprover can prove all POs (subset of 1409,1436 for z3)'). |
| 4626 | | cli_testcase(1813, [smt_solver_integration,private], [ |
| 4627 | | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_1_true.pl', |
| 4628 | | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE', |
| 4629 | | '-check_disprover_result', 7,0,0 |
| 4630 | | ],'Check Disprover can prove all POs; this test also checks register predicate works better'). |
| 4631 | | cli_testcase(1814, [smt_solver_integration,private], [ |
| 4632 | | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_3_true.pl', |
| 4633 | | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE', |
| 4634 | | '-check_disprover_result', 60,0,0 |
| 4635 | | ],'Check Disprover can prove all POs; this test also checks register predicate works better'). |
| 4636 | | cli_testcase(1815, [smt_solver_integration], [ |
| 4637 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest2_ctx.pl', |
| 4638 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest3_ctx.pl', |
| 4639 | | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest4_ctx.pl', |
| 4640 | | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE', |
| 4641 | | '-check_disprover_result', 0,0,2 |
| 4642 | | ],'Check Disprover cannot prove po'). |
| 4643 | | cli_testcase(1816, [b_test,external,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4644 | | '../prob_examples/public_examples/B/ExternalFunctions/SubStringFunctions.mch', '-assertions', |
| 4645 | | '-evalt', 'INT_TO_DEC_STRING(101,2)="1.01"', |
| 4646 | | '-evalt', 'INT_TO_DEC_STRING(101,-2)="10100"', |
| 4647 | | '-evalt', 'INT_TO_DEC_STRING(-1001,2)="-10.01"', |
| 4648 | | '-evalt', 'INT_TO_DEC_STRING(-101,-2)="-10100"', |
| 4649 | | '-evalt', 'INT_TO_DEC_STRING(-101,3)="-0.101"', |
| 4650 | | '-evalt', 'STRING_CONTAINS_STRING("aabb","ab")', |
| 4651 | | '-evalt', 'STRING_CONTAINS_STRING("aabb","")', |
| 4652 | | '-evalf', 'STRING_CONTAINS_STRING("aabbab","bbb")' |
| 4653 | | ], 'Check substring and decimal string conversion external functions.'). |
| 4654 | | cli_testcase(1817, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CLPFD', 'FALSE', |
| 4655 | | '-evalt', '{x|x>10 & x<20 & x mod 5=0} = {15}', |
| 4656 | | '-evalt', 'x>10 & x<20', |
| 4657 | | '-evalt', 'x>18 & y<1024 & x<20 & y>1020' % does not work yet |
| 4658 | | %'-evalt', 'x>18 & (y<1024 & (x<20 & y>1020))' % no longer works |
| 4659 | | ], 'Test detection of intervals when CLPFD disabled'). |
| 4660 | | cli_testcase(1818, [cbc,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CLPFD', 'FALSE', |
| 4661 | | '-evalt', 'UNION(x).(x:1..RANGE_LAMBDA|{x+1})=res & RANGE_LAMBDA:{10,11} & res = 2..11', |
| 4662 | | '-evalt', 'UNION(x).(x:1..12|{x+1})={2,3,4,5,6,7,8,9,10,11,12,13}', |
| 4663 | | '-evalt', 'UNION(x).(x:1..2|{x+y}) = 12..13', |
| 4664 | | '-evalt', '{y|UNION(x).(x:1..2|{x+y}) = 12..13} = {11}' |
| 4665 | | ], 'Test UNION translation for singleton set'). |
| 4666 | | cli_testcase(1819, [b_test,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4667 | | '-evalt', ' "ab c " = \'\'\'ab c \'\'\' ', % "ab c " = '''ab c ''' |
| 4668 | | '-evalf', ' "ab c" = \'\'\'abc\'\'\' ', |
| 4669 | | '-evalf', ' "abc" = " abc" ', |
| 4670 | | '-evalt', ' "ab\'c" = "ab\\\'c" ', % a \' inside "..." is now one character |
| 4671 | | '-evalt', ' "ab\\\'c" /= "ab\\\\\'c" ', % "ab\'c" /= "ab\\'c" |
| 4672 | | '-evalf', ' "ab\'c" = "ab\\\\\'c" ', |
| 4673 | | '-evalt', ' "ab\\x" = "ab\\\\x" ', |
| 4674 | | '-evalt', ' "ab\\\"c" = \'\'\'ab"c\'\'\' ', % "ab\"c" = '''ab"c''' |
| 4675 | | '-evalt', ' "ab\'c" = \'\'\'ab\'c\'\'\' ' % "ab'c" = '''ab'c''' |
| 4676 | | ], 'Test alternate STRING literal form with three apostrophes'). |
| 4677 | | cli_testcase(1820, [laws,unicode], ['../prob_examples/public_examples/B/Laws/UnicodeLaws.mch', '-init', '-assertions', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'TRUE', '-mc', 1000, '-nodead'], 'Various laws about Unicode symbols and their ASCII counterpart.'). |
| 4678 | | cli_testcase(1821, [cbc], ['../prob_examples/public_examples/B/TestCaseGeneration/BMC/CounterWrongInit.mch', '-cbc', 'INITIALISATION', '-strict', '-expcterr', 'cbc'], 'Check INITIALISATION counter-example found'). |
| 4679 | | cli_testcase(1822, [cbc], ['../prob_examples/public_examples/B/TestCaseGeneration/BMC/CounterWrongInit.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], 'Check INITIALISATION counter-example found'). |
| 4680 | | cli_testcase(1823, [cbc,bmc], ['../prob_examples/public_examples/B/TestCaseGeneration/BMC/CounterWrongInit.mch', '-bmc', '10', '-strict', '-expcterr', 'invariant_violation'], 'Check INITIALISATION counter-example found'). |
| 4681 | | cli_testcase(1824, [cbc], [ |
| 4682 | | '-evalt', '(not((3 = soda) <=> (soda > coins / coins & coins = coins)) & (coins : NATURAL & soda : NATURAL)) & coins /= 0 ', |
| 4683 | | '-evalt', '{x,y| y = x/x & x = y+y}= {(2,1)}', |
| 4684 | | '-evalt', '{x,y| y = x/x & x = y+y+100}= {(102,1)}' |
| 4685 | | ], 'Check propagation of division x/x'). |
| 4686 | | cli_testcase(1825, [cbc,wd], [ |
| 4687 | | '-evalnwd', 'r = x/x & r<10 & x<1 & x>-1', |
| 4688 | | '-expcterr', 'well_definedness_error' |
| 4689 | | ], 'Check propagation of division x/x does not prevent WD error detection'). |
| 4690 | | cli_testcase(1826, [rulesdsl], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4691 | | '../prob_examples/public_examples/Rules_Machines/SimpleRulesMachine.rmch', |
| 4692 | | '../prob_examples/public_examples/Rules_Machines/TestDependency.rmch', |
| 4693 | | '-t' |
| 4694 | | ], 'Check simple Rules machine'). |
| 4695 | | cli_testcase(1827, [cbc,wd,sequences], ['-p', 'STRING_AS_SEQUENCE', 'TRUE', |
| 4696 | | '-evalt', '"a" ^ x = "ab" ^ y & x^x = "bb"', |
| 4697 | | '-evalt', '{x,y|"a" ^ x = "ab" ^ y & x^x = "bb"} = {("b","")}', |
| 4698 | | '-evalt', '"a"^"b"^"c" = "abc"' |
| 4699 | | ], 'Check concat operator works on strings'). |
| 4700 | | cli_testcase(1828, [cbc,tickets,union,card], [ |
| 4701 | | '-evalt', '{x,s|union(s) = {} & x<:INTEGER & x:s} = { ({},{{}}) }', |
| 4702 | | '-evalt', 'union(s) = {} & x<:INTEGER & x:s', |
| 4703 | | '-evalt', 'union(s) = {} & x<:INTEGER & x:s & card(s)=1', |
| 4704 | | '-evalf', 'union(s) = {} & x<:INTEGER & x:s & card(s)=2', |
| 4705 | | '-evalf', 'union(s) = {} & x<:INTEGER & x:s & card(s)=3', |
| 4706 | | '-evalf', 'union(s) = {} & x<:INTEGER & x:s & card(s)>1', |
| 4707 | | '-evalf', 'union(s) = {} & s<:POW(1..2) & card(s)>1', |
| 4708 | | '-evalt', 'union(s) = {1} & s<:POW(1..2) & card(s)>1', |
| 4709 | | '-evalf', 'union(s) = {1} & s<:POW(1..2) & card(s)>2', |
| 4710 | | '-evalf', 'union(s) = {1} & s<:POW(1..2) & card(s)=3', |
| 4711 | | '-evalf', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)>2', |
| 4712 | | '-evalf', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)=3', |
| 4713 | | '-evalt', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)=2', |
| 4714 | | '-evalt', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)>1', |
| 4715 | | '-evalt', ' {s,x|x<:{2,3} & x:s & card(s)=2 & {2,3}:s & 2/: x} = {({{},{2,3}}|->{}),({{2,3},{3}}|->{3})}', |
| 4716 | | '-evalf', 'x<:{2,3} & s = {x} \\/ s2 & card(s)=3 & s2 = {{2,3},{2}} & 2:x' |
| 4717 | | ], 'Check card operator does not generate solutions with repeated entries'). |
| 4718 | | cli_testcase(1829, [cbc,forall], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4719 | | '-p', 'DEFAULT_SETSIZE', 5, |
| 4720 | | '../prob_examples/public_examples/EventBPrologPackages/GraphColouring/Coloring_40_wo_axm9.eventb', |
| 4721 | | '-p', 'TIME_OUT', '8000', % has gotten slower with SICStus 4.6; especially COLORING1 step |
| 4722 | | '-t' |
| 4723 | | ], 'Check forall improvements'). |
| 4724 | | cli_testcase(1830, [cbc,forall], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4725 | | '-evalt', '!y.(y>3 => !x.(x>2 => TRUE=TRUE))', |
| 4726 | | '-evalt', '!y.(y>3 => !x.(x>2 => 2>1))', |
| 4727 | | '-evalt', 'y:4..5 & !y.(y>3 => !x.(x>2 => 2>1))', |
| 4728 | | '-evalt', '{y|y:3..5 & !y.(y>3 => !x.(x>2 => 1<11))} = 3..5' |
| 4729 | | ], 'Check forall useless detection improvement'). |
| 4730 | | cli_testcase(1831, [tickets,while,rulesdsl], ['../prob_examples/public_examples/B/Tickets/Hansen34_compile2/FunctionWithWhileLoop.rmch', '-t' ], % increased time-out for jenkins |
| 4731 | | 'Check that compile issue solved when expanding Operation Calls with return parameters'). |
| 4732 | | cli_testcase(1832, [laws], ['../prob_examples/public_examples/B/Laws/BoolWithArithLaws.mch', '-mc', '100000', '-nodead', '-cs', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Various laws about BOOL datatype and boolean connectives; this times using arithmetic operators.'). |
| 4733 | | cli_testcase(1833, [laws], ['../prob_examples/public_examples/B/Laws/INTEGERSET_Laws.mch', '-mc', '100000', '-nodead', '-cs', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-assertions'], 'Various laws about BOOL datatype and boolean connectives; this times using arithmetic operators.'). |
| 4734 | | cli_testcase(1834, [performance_tests,b_test,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/EnumeratedSetDetection.mch', |
| 4735 | | '-t', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '1000'], |
| 4736 | | 'Test enumerated set detection'). |
| 4737 | | cli_testcase(1835, [tickets], ['../prob_examples/public_examples/B/Tester/NameClashes/scheduler0.mch', |
| 4738 | | '-p', 'STRICT_CLASH_CHECKING', 'TRUE', |
| 4739 | | '-init', '-expcterr', 'bmachine_static_checks'], |
| 4740 | | 'Test enumerated set detection (PROB-60)'). |
| 4741 | | cli_testcase(1836, [tickets], [ |
| 4742 | | '../prob_examples/public_examples/B/Tickets/DefinitionCapture/DefCaptureAtelierB.mch', |
| 4743 | | '../prob_examples/public_examples/B/Tickets/DefinitionCapture/DefCapture.mch', |
| 4744 | | '-opterr', 'bmachine_static_checks', % forall rhs does not use ids due to capture |
| 4745 | | '-init', '-expcterr', 'definition_variable_capture'], |
| 4746 | | 'Test detection of variable capture (PROB-71)'). |
| 4747 | | cli_testcase(1837, [tickets,enabling], [ |
| 4748 | | '../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect.mch', |
| 4749 | | '-feasibility_analysis_csv', 1000, '../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect_feasibility.csv'], |
| 4750 | | 'Test that operation call treated in enabling condition (PROB-379)'). |
| 4751 | | cli_testcase(1838, [cbc,card], [ |
| 4752 | | '-evalt', 'x \\/ y \\/ z = 1..10 & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x=1..8 & y={10}', |
| 4753 | | '-evalt', 'union({x,y,z}) = 1..10 & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & z=1..7 & y={8,10}', |
| 4754 | | '-evalt', 'x \\/ y \\/ z = BOOL & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={TRUE} & y={FALSE}', |
| 4755 | | '-evalt', 'x \\/ y \\/ z = {"a","b","c"} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={"a"} & y={"b"}', |
| 4756 | | '-evalt', 'x \\/ y \\/ z = {"a","b","c"} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={"a"} & y={"b"} & z=s', |
| 4757 | | '-evalf', 'x \\/ y \\/ z = {"a","b","c"} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={"a"} & y={"b"} & card(z)=2', |
| 4758 | | '-evalt', 'x \\/ y \\/ z = {{"a","b"},{"c"},{"d"}} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={{"c"}} & z={{"d"}}' |
| 4759 | | ], 'Testing partition propagation (all_but_one_set_known).'). |
| 4760 | | cli_testcase(1839, [cbc], [ |
| 4761 | | '-evalt', '{r,t|{x| bool(x>2)=t & x<5}=r & t=TRUE} = {({3,4}|->TRUE)}', |
| 4762 | | '-evalt', '{r,t|{x| bool(x<=2)=t & x<5}=r & t=FALSE} = {({3,4}|->FALSE)}' |
| 4763 | | ], 'Testing bool simplification in b_compiler.'). |
| 4764 | | cli_testcase(1840, [latex, b_test], [ |
| 4765 | | '../prob_examples/public_examples/Latex/tests/ProBLatex.mch', '-init', '-animate', 5, |
| 4766 | | '-latex', '../prob_examples/public_examples/Latex/tests/prob_latex_doc_raw.tex', |
| 4767 | | '../prob_examples/public_examples/Latex/tests/prob_latex_doc.tex' |
| 4768 | | ], 'Testing Latex mode.'). |
| 4769 | | |
| 4770 | | cli_testcase(1841, [cbc], [ |
| 4771 | | '../prob_examples/public_examples/B/Benchmarks/scheduler.mch', |
| 4772 | | '../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', |
| 4773 | | '-cbc_redundant_invariants', 0, '-strict'], 'Test searching for redundant invariants'). |
| 4774 | | cli_testcase(1842, [cbc], [ |
| 4775 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', |
| 4776 | | '-expcterr', cbc_redundant_invariants, |
| 4777 | | '-cbc_redundant_invariants', 0, '-strict'], 'Test searching for redundant invariants'). |
| 4778 | | cli_testcase(1843, [cbc], [ |
| 4779 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', |
| 4780 | | '-cbc_redundant_invariants', 6, '-strict'], 'Test searching for redundant invariants'). |
| 4781 | | cli_testcase(1844, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/SetOperators/TestPartition.mch', |
| 4782 | | '../prob_examples/public_examples/B/FeatureChecks/SetOperators/TestPartition3.mch', |
| 4783 | | '../prob_examples/public_examples/B/FeatureChecks/SetOperators/TestPartition2.mch', |
| 4784 | | '../prob_examples/public_examples/B/Mathematical/LeaderElectionRing.mch', |
| 4785 | | '-t', '-strict'], 'Test B partition and other tests from Tcl/Tk regression tests'). |
| 4786 | | cli_testcase(1845, [b_test,cruise], ['../prob_examples/examples/B/ClearSy/spec_Cruise/Cruise1.ref', |
| 4787 | | '-t', '-mc', 100, '-expcterr', 'model_check_incomplete', |
| 4788 | | '-strict'], 'Test Cruise refinement machine'). |
| 4789 | | cli_testcase(1846, [csp_test], ['../prob_examples/public_examples/CSP/other/Kleine/coz-example.csp', |
| 4790 | | '-cc', 12886, 38955, '-mc', 20000, '-strict'], 'Test OZ CSP translation and possible CSP process detection'). |
| 4791 | | cli_testcase(1847, [execute,b_test,wd], ['../prob_examples/public_examples/B/Tester/Execute/execute_wd_error.mch', |
| 4792 | | '-execute', 20, '-expcterr', 'execute', '-expcterr', 'well_definedness_error', |
| 4793 | | '-nodead', '-nogoal', '-strict', '-goal', 'i=10', '-check_goal'], 'Test WD error caught'). |
| 4794 | | cli_testcase(1848, [cbc,records,card], [ |
| 4795 | | '-evalt', '{rec(a:999,b:999,c:TRUE)}:POW({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:INTEGER,b:INTEGER,c:BOOL)})', |
| 4796 | | '-evalt', '{rec(a:999,b:999,c:TRUE),rec(a:1,b:2,c:FALSE)}:POW({r|r\'a : 1..2000 & r\'b : 1..20000 & r:struct(a:INTEGER,b:INTEGER,c:BOOL)})', |
| 4797 | | '-evalt', '{rec(a:999,b:999,c:TRUE)}:POW({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:NATURAL,b:NATURAL,c:{TRUE})})', |
| 4798 | | '-evalt', '{rec(a:999,b:999,c:FALSE)}/:POW({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:NATURAL,b:NATURAL,c:{TRUE})})', |
| 4799 | | '-evalf', '{rec(a:999,b:1001,c:TRUE)}:POW({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:NATURAL,b:NATURAL,c:{TRUE})})', |
| 4800 | | '-evalf', '{rec(a:999,b:0,c:TRUE)}:POW({r|r\'a : 1..1000 & r\'b : -1..1000 & r:struct(a:NATURAL,b:NATURAL1,c:{TRUE})})', |
| 4801 | | '-evalt', 'card({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:INTEGER,b:INTEGER,c:BOOL)}) = 2000000', |
| 4802 | | '-evalt', 'card({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:INTEGER,b:NATURAL,c:BOOL)}) = 2000000' |
| 4803 | | ], 'Testing struct comprehension set detection in ast cleanup.'). |
| 4804 | | cli_testcase(1849, [proz,records], [ |
| 4805 | | '../prob_examples/public_examples/Z/Ledru/RoZ_simple/model.fuzz', |
| 4806 | | '../prob_examples/public_examples/Z/Ledru/RoZ_simple/model_internal_simplified.mch', '-p', 'ALLOW_COMPLEX_LETS', 'TRUE', |
| 4807 | | '-t', '-mc', 10, '-strict', '-expcterr', 'model_check_incomplete'], 'Test Z models with complex records,... work'). |
| 4808 | | cli_testcase(1850, [proz,b_test], [ |
| 4809 | | '../prob_examples/public_examples/Z/Ledru/RoZ_simple/model.tex', |
| 4810 | | '../prob_examples/public_examples/Z/Testcases/comsets.tex', |
| 4811 | | '../prob_examples/public_examples/Z/Testcases/distributed_concatenation.tex', |
| 4812 | | '../prob_examples/public_examples/Z/Testcases/compaction.tex', |
| 4813 | | '../prob_examples/public_examples/Z/Testcases/zrm_refcard_ops.tex', |
| 4814 | | '-t', '-mc', 10, '-nodead', '-strict', '-opterr', 'model_check_incomplete'], 'Test loading .tex file works'). |
| 4815 | | cli_testcase(1851, [cbc], [ |
| 4816 | | '-evalt_file', '../prob_examples/public_examples/Eval/synthesis/synthesis_constraint_restricted_domains_smaller_library.eval' |
| 4817 | | ], 'Test solving a complicated synthesis constraint'). |
| 4818 | | cli_testcase(1852, [b_test,refinement], [ |
| 4819 | | '../prob_examples/public_examples/B/RefinementChecking/Simple/Spec1_with_new_op_err.ref', |
| 4820 | | '-init','-expcterr', 'type_error', '-expcterr', 'load_main_file', '-strict'], 'Test ALLOW_NEW_OPERATIONS_IN_REFINEMENT preference'). |
| 4821 | | cli_testcase(1853, [b_test,refinement], [ |
| 4822 | | '../prob_examples/public_examples/B/RefinementChecking/Simple/Spec1_with_new_op.ref', |
| 4823 | | '-t', '-mc', 10, '-strict'], 'Test ALLOW_NEW_OPERATIONS_IN_REFINEMENT preference'). |
| 4824 | | cli_testcase(1854, [cbc,records], [ |
| 4825 | | '-evalt', 'union(ran(f)) <: 2..3 & f = %x.(x:n..(n+1)|{x}) & n:1..1500000', |
| 4826 | | '-evalt', 'union(ran(f)) : POW(2..3) & f = %x.(x:n..(n+1)|{x}) & n:1..1500000' |
| 4827 | | ], 'Testing ast cleanup improvement.'). |
| 4828 | | cli_testcase(1855, [slot,tickets,private,xml, unsat_core], [ |
| 4829 | | '../prob_examples/examples/B/SlotTool/Ticket_11092017/Solver.mch', |
| 4830 | | '-init', |
| 4831 | | '-expcterrpos', definition_variable_capture, 279, 12, |
| 4832 | | '-eval', 'UNSAT_CORE_SESSIONS({group3, group4})', |
| 4833 | | '-evalt', 'UNSAT_CORE_SESSIONS({group3, group4})={session3,session4}', '-strict'], |
| 4834 | | 'Test instantiate to any issue solved'). |
| 4835 | | cli_testcase(1856, [b_test,external,closure1], [ |
| 4836 | | '../prob_examples/public_examples/B/ExternalFunctions/UGraphsFunctions.mch', |
| 4837 | | '-init', '-assertions'], 'Test CLOSURE1 and SCCS external functions'). |
| 4838 | | cli_testcase(1857, [tickets,b_test], [ |
| 4839 | | '../prob_examples/public_examples/B/Tickets/PROB-403/CONTEXT_JUST_SETS.mch', |
| 4840 | | '../prob_examples/public_examples/B/Tickets/PROB-403/CONTEXT2.mch', % does work now: constants are no longer up multiple times (but properties are still included multiple times) |
| 4841 | | '-t' ], |
| 4842 | | 'Check constants, sets, ... can be included multiple times without prefix (PROB-403)'). |
| 4843 | | cli_testcase(1858, [proz,records], [ |
| 4844 | | '../prob_examples/public_examples/Z/Ledru/RoZ_constraint/model.zed', |
| 4845 | | %'../prob_examples/public_examples/Z/Ledru/RoZ/model.tex', |
| 4846 | | '-t', '-mc', 10, '-strict', '-expcterr', 'model_check_incomplete'], 'Test Z models using new rec__ SYMBOLIC annotation and do_not_enumerate_binary_boolean_operator/wfx_no_enumeration'). |
| 4847 | | cli_testcase(1859, [b_test,external,strings,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4848 | | '../prob_examples/public_examples/B/ExternalFunctions/SubStringFunctions.mch', |
| 4849 | | '-evalnwd', 'STRING_TO_INT("1.1")', |
| 4850 | | '-expcterr', well_definedness_error |
| 4851 | | ], 'Check that error raised when converting float to int.'). |
| 4852 | | cli_testcase(1860, [b_test,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4853 | | '../prob_examples/public_examples/B/PerformanceTests/CardPropagation/DeferredSetSurjectionTest.mch', |
| 4854 | | '-init' |
| 4855 | | ], 'Check that cardinality of deferred set adjusted for surjections.'). |
| 4856 | | cli_testcase(1861, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4857 | | '-evalnwd', '[11,22,33] /|\\ 4', |
| 4858 | | '-expcterr', well_definedness_error |
| 4859 | | ], 'Check wd error for prefix sequence.'). |
| 4860 | | cli_testcase(1862, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4861 | | '-evalt', '{x,y|x:INTEGER & y=x+1} = r & r2 = r~ & res = r2[{22,23}] & SIGMA(xx).(xx:res|xx)=43', |
| 4862 | | '-evalt', '{x,y|x:INTEGER & y=x+1} = r & r2 = r~ & res = r2[{x}] & SIGMA(x).(x:res|x)=x-1 & x:{50,51}' |
| 4863 | | ], 'Check that relational inverse works on infinite set'). |
| 4864 | | cli_testcase(1863, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4865 | | '-p', 'TRY_FIND_ABORT', 'TRUE', |
| 4866 | | '-evalnwd', 'f : 1..2 +-> 3..4 & f(3) = 3', |
| 4867 | | '-expcterr', well_definedness_error |
| 4868 | | ], 'Check wd error for function application outside of domain.'). |
| 4869 | | cli_testcase(1864, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4870 | | '-p', 'TRY_FIND_ABORT', 'TRUE', |
| 4871 | | '-evalnwd', 'f : 1..2 --> 3..4 & f(3) = 3', % total function; hits another area of ProB source code |
| 4872 | | '-expcterr', well_definedness_error |
| 4873 | | ], 'Check wd error for function application outside of domain.'). |
| 4874 | | cli_testcase(1865, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4875 | | '-evalt', 'idc = {x,y|x:INTEGER & y:INTEGER & y=x} & res = idc[{550}] & res = {550}', |
| 4876 | | '-evalt', 'idc = {x,y|x:INTEGER & y:NATURAL & y=x} & res = idc[{550}] & res = {550}', |
| 4877 | | %'-evalt', 'idc = {x,y|x:NATURAL & y:NATURAL & y=x} & res = idc[{550}] & res = {550}', |
| 4878 | | '-evalt', 'idc = {x,y|x:INTEGER & y:NATURAL & y=x} & res = idc[{-550}] & res={}', |
| 4879 | | '-evalt', 'idc = {x,y|x:INTEGER & y:INTEGER & y=x} & dom(idc)=INTEGER' |
| 4880 | | ], 'Check that id closures can be manipulated'). |
| 4881 | | cli_testcase(1866, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4882 | | '-evalnwd', '22 mod -3', |
| 4883 | | '-expcterr', well_definedness_error |
| 4884 | | ], 'Check wd error for modulo negative number.'). |
| 4885 | | cli_testcase(1867, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4886 | | '-p', 'REMOVE_IMPLIED_CONSTRAINTS', 'TRUE', |
| 4887 | | '-evalt', 'n=1000 & f:1..n --> BOOL & f:1..n +-> BOOL & !x.(x:dom(f) => f(x) = bool(x>50)) & f: 1..n <-> BOOL & dom(f)=1..n' |
| 4888 | | ], 'Exercise REMOVE_IMPLIED_CONSTRAINTS'). |
| 4889 | | cli_testcase(1868, [while,private,xml], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4890 | | '../prob_examples/examples/B/Thales/Ticket_closure_body_enum/ENV_Model.prob', |
| 4891 | | %'../prob_examples/examples/B/Thales/Ticket_closure_body_enum/src/test/environment/ENV_Model.mch', |
| 4892 | | '-t' |
| 4893 | | ], 'Check that closure body enumeration in while issue fixed.'). |
| 4894 | | cli_testcase(1869, [b_test], |
| 4895 | | [%'../prob_examples/public_examples/B/Benchmarks/scheduler.mch', % does not work with non-det |
| 4896 | | '../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', |
| 4897 | | '-strict','-t', |
| 4898 | | '-p', 'MAX_OPERATIONS', 0], 'Check that trace replay works with MAX_OPERATIONS == 0'). |
| 4899 | | cli_testcase(1870, [b_test,while], |
| 4900 | | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4901 | | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', |
| 4902 | | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain2.mch', |
| 4903 | | '../prob_examples/public_examples/B/Tester/OpCalls/SwitchParameters2.mch', |
| 4904 | | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain_v2/GetTrain2.mch', |
| 4905 | | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain_v2/GetTrain2_LargeVariant.mch', |
| 4906 | | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain_v2/GetTrain3.mch', |
| 4907 | | '../prob_examples/public_examples/B/Tester/OpCalls/ReadOutput/OpCallR.ref', |
| 4908 | | '-strict','-t'], 'Check that OpCalls can be used to assign output with same result variable name'). |
| 4909 | | cli_testcase(1871, [b_test], |
| 4910 | | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4911 | | '../prob_examples/public_examples/B/Tester/OpCalls/ReadOutput/OpCallErrR.ref', '-mc', 10, '-nodead', |
| 4912 | | '-strict', '-expcterr', 'precondition_error' |
| 4913 | | ], 'Check that precondition_error on output variable previous value detected'). |
| 4914 | | cli_testcase(1872, [b_test,external,strings], [ |
| 4915 | | '../prob_examples/public_examples/B/ExternalFunctions/TestLibraryStrings.mch', |
| 4916 | | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', |
| 4917 | | '-evalt', 'STRINGIFY("abc\\nef") = "\\"abc\\\\nef\\""', |
| 4918 | | '-init', '-assertions'], 'Test STRING_TO_ENUM and STRINGIFY external functions and escaping'). |
| 4919 | | cli_testcase(1873, [b_test,external,rulesdsl], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4920 | | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', |
| 4921 | | '../prob_examples/public_examples/Rules/CSV/RulesChemistry.rmch', '-t'], |
| 4922 | | 'Check Rules DSL example with CSV reading'). |
| 4923 | | cli_testcase(1874, [b_test,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4924 | | '-evalt', '%x.(x:NATURAL|x) : NATURAL --> NATURAL', |
| 4925 | | '-evalf', '%x.(x:NATURAL|x) : INTEGER --> NATURAL', |
| 4926 | | '-evalf', '%x.(x:NATURAL|x) : NATURAL1 --> NATURAL', |
| 4927 | | '-evalf', '%x.(x:NATURAL1|x) : NATURAL --> NATURAL', |
| 4928 | | '-evalt', '%x.(x:NATURAL|x+1) : NATURAL --> NATURAL', |
| 4929 | | '-evalt', '%x.(x:NATURAL|x+1) : NATURAL --> NATURAL1', |
| 4930 | | '-evalf', '%x.(x:NATURAL|x-1) : NATURAL --> NATURAL', |
| 4931 | | '-evalt', '%(x,y).(x:NATURAL&y:NATURAL|x+y) : NATURAL*NATURAL --> NATURAL', |
| 4932 | | '-evalf', '%(x,y).(x:NATURAL&y:NATURAL|x+y) : NATURAL*NATURAL --> NATURAL1', |
| 4933 | | '-evalt', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) --> (2..200)', |
| 4934 | | '-evalt', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) --> (1..10000)', |
| 4935 | | '-evalf', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) --> (3..200)', |
| 4936 | | '-evalt', '%(x,y).(x:1..100 & y:1..100|x*y) : (1..100)*(1..100) --> (1..10000)', |
| 4937 | | '-evalf', '%(x,y).(x:1..100 & y:1..100|x*y) : (1..100)*(1..100) --> (2..10000)', |
| 4938 | | '-evalf', '%(x,y).(x:1..100 & y:1..101|x*y) : (1..100)*(1..101) --> (1..10000)', |
| 4939 | | % '-evalt', '%(x,y).(x:0..999 & y:0..999|(x*y) mod 1000) : (0..999)*(0..999) --> (0..999)', % slow due to expansion |
| 4940 | | '-evalt', '%(x,y).(x:0..9999 & y:0..9999|(x*y) mod 10000) : (0..9999)*(0..9999) --> (0..9999)', |
| 4941 | | % TO DO: |
| 4942 | | % {x|x:NATURAL*NATURAL & prj1(INTEGER,INTEGER)(x)=prj2(INTEGER,INTEGER)(x)} : NATURAL --> NATURAL % not detected as lambda, |
| 4943 | | '-evalt', '%(aa).(aa : INTEGER | [aa]) : INTEGER --> seq(INTEGER)', |
| 4944 | | %'-evalf', '%(aa).(aa : INTEGER | [aa]) : INTEGER --> seq(NATURAL)', % succeeds but has non-critical enum warning |
| 4945 | | '-evalt', '%(aa).(aa : NATURAL1 | [aa]) : NATURAL1 --> seq(NATURAL1)', |
| 4946 | | '-evalt', 'n=16 & cc = /*@symbolic*/ %ui.(ui:0..((2**n)-1) | ui/(2**8)) & cc:(0..((2**n)-1))--> 0..255', |
| 4947 | | '-evalf', 'n=16 & cc = /*@symbolic*/ %ui.(ui:0..((2**n)-1) | ui/(2**8)) & cc:(0..((2**n)-1))--> 0..254' |
| 4948 | | ], 'Check new symbolic total function range detection'). |
| 4949 | | cli_testcase(1875, [b_test,external], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4950 | | '../prob_examples/public_examples/B/ExternalFunctions/TestBitLibrary.mch', |
| 4951 | | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', |
| 4952 | | '-init', '-assertions' |
| 4953 | | ], 'Check new bitwise external functions BAND, BOR, BXOR,...'). |
| 4954 | | cli_testcase(1876, [error_checks,b_test], ['../prob_examples/public_examples/B/ErrorMachines/TypeErrorUnusedDefinition.mch', |
| 4955 | | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', |
| 4956 | | '-expcterrpos', definition_type_error, 9, 21, |
| 4957 | | '-expcterrpos', definition_type_error, 10, 35, |
| 4958 | | '-expcterrpos', definition_type_error, 10, 39 |
| 4959 | | ], 'Check type error in unused DEFINITION detected'). |
| 4960 | | cli_testcase(1877, [b_test,external,random], [ |
| 4961 | | '../prob_examples/public_examples/B/ExternalFunctions/TestLibraryRandom.mch', |
| 4962 | | '-mc', 100, '-assertions'], 'Test random_subset, random_permutation'). |
| 4963 | | cli_testcase(1878, [tickets,private], [ |
| 4964 | | '../prob_examples/examples/B/Alstom/Ticket_Nov28_2017/scheduler_pb.mch', '-t', |
| 4965 | | '-p', 'SYMBOLIC', 'TRUE', |
| 4966 | | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-check_goal', |
| 4967 | | '-evalt', 'x:in_cmd_signals', |
| 4968 | | '-evalt', 'in_cmd_signals : t_signal --> t_color', '-p', 'TIME_OUT', '7000' |
| 4969 | | ], 'Test symbolic override works as expected'). |
| 4970 | | cli_testcase(1879, [b_test,closure1,infinite,wd], ['../prob_examples/public_examples/B/Tickets/Hansen7/ClosureTest.mch', '-init', % '-expecterr', 'virtual_time_out', % reflexive closure now detected infinite |
| 4971 | | '-expcterr', 'setup_constants_fails', |
| 4972 | | '-opterr', 'setup_constants_inconsistent' % we now also generate this msg when not all csts are found deterministically |
| 4973 | | ], 'Check closure now infinite'). |
| 4974 | | cli_testcase(1880, [b_test,closure1], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4975 | | '-evalt', '22|->22 : closure({})', |
| 4976 | | '-evalf', '22|->21 : closure({})', |
| 4977 | | '-evalt', '22|->22 : iterate({},0)', |
| 4978 | | '-evalt', '11|->66 : closure({11|->22,22|->33,22|->44,33|->55,33|->66})', |
| 4979 | | '-evalt', '{100|->100,11|->66} <: closure({11|->22,22|->33,22|->44,33|->55,33|->66})', |
| 4980 | | '-evalt', 'closure1({11|->22,22|->33,22|->44,33|->55,33|->66}) <: closure({11|->22,22|->33,22|->44,33|->55,33|->66})', |
| 4981 | | '-evalf', '33|->22 : closure({11|->22,22|->33,22|->44,33|->55,33|->66})' |
| 4982 | | ], 'Check some reflexive closure predicates'). |
| 4983 | | cli_testcase(1881, [cbc,symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetTest1.mch', '-mc', '15', |
| 4984 | | '-nodead', |
| 4985 | | '-cc', '7', '6', '-strict' ], 'Check that static symmetry reduction works as expected'). |
| 4986 | | cli_testcase(1882, [b_test,closure1,forall], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4987 | | '-evalt', '!(x,y).(x:S & y:S => (x>y => x=y+2)) & S = {0,x} & x>0', |
| 4988 | | '-evalf', '!(x,y).(x:S & y:S => (x>y => x=y+2)) & S = {0,x,y} & x>y & y>0', |
| 4989 | | '-evalf', '!(x,y).(x:y & y<:1..2 => x>2)' |
| 4990 | | ], 'Test forall splitting'). |
| 4991 | | cli_testcase(1883, [b_test,closure1], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4992 | | '-evalf', 'x: 1..n --> 1..n & closure1(x)[{1}] = {} & n=25', |
| 4993 | | '-evalt', 'x: 1..n --> 1..n & closure1(x)[{1}] = 3..n & n=7' |
| 4994 | | ], 'Check image for closure1 improvements'). |
| 4995 | | cli_testcase(1884, [b_test,card], ['../prob_examples/public_examples/B/FeatureChecks/DeferredSetAndConstants2.mch', '-mc', '5', |
| 4996 | | '-nodead', |
| 4997 | | '-cc', '3', '2', '-strict'], 'Check that enumerated set / partition detection works'). |
| 4998 | | cli_testcase(1885, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 4999 | | '-p', 'TRY_FIND_ABORT', 'FALSE', |
| 5000 | | '-evalf', 'f = %x.(x:1..90|100+x) & f(v)+f(w)+f(y)+f(z) < 400', |
| 5001 | | '-evalf', 'f = %x.(x:1..90|rec(a:100+x,b:x)) & f(v)\'a+f(w)\'a+f(y)\'a+f(z)\'a < 400', |
| 5002 | | '-evalt', 'v={1|->rec(a:11,b:22), 2|->rec(a:22,b:33)}& r={x|v(x)\'b = x}' |
| 5003 | | ], 'Test improved propagation for function application, also in combination with record field reduction in b_compiler'). |
| 5004 | | cli_testcase(1886,[private, data_validation,alstom,codespeed],[ |
| 5005 | | '../prob_examples/examples/B/Alstom/sgd_Jun11/vital_gradient_v3/vital_gradient_optimized.mch', |
| 5006 | | '-p', 'DATA_VALIDATION', 'TRUE', % data_validation_mode preference |
| 5007 | | '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '35000', '-t'], |
| 5008 | | 'test 1105 in DATA_VALIDATION mode'). |
| 5009 | | cli_testcase(1887, [b_test,symmetry_test], [ |
| 5010 | | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest1.mch', |
| 5011 | | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest2.mch', |
| 5012 | | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest3.mch', |
| 5013 | | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest4.mch', |
| 5014 | | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest5.mch', |
| 5015 | | '-mc', '1000', '-nodead', '-nogoal', '-assertions', '-strict'], 'Check that partition symmetry reduction works'). |
| 5016 | | cli_testcase(1888, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5017 | | '-p', 'TRY_FIND_ABORT', 'FALSE', |
| 5018 | | '-evalnwd', 'v = %x.(x:1..20|x+x) & y<4 & z=v(y) & (y:{-1,2}) & y /= 2', |
| 5019 | | '-expcterr', well_definedness_error |
| 5020 | | ], 'Test improved propagation for function application does not prevent finding WD problem'). |
| 5021 | | cli_testcase(1889, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5022 | | '-p', 'TRY_FIND_ABORT', 'FALSE', |
| 5023 | | '-evalnwd', 'v = %x.(x:1..20|x+x) & {y,z|y<4 & z=v(y) & (y:{-1,2})} =res', |
| 5024 | | '-expcterr', well_definedness_error |
| 5025 | | ], 'Test improved propagation for function application does not prevent finding WD problem'). |
| 5026 | | cli_testcase(1890, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/07_001.mch', |
| 5027 | | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'TIME_OUT', 39500, |
| 5028 | | '-p', 'DETECT_LAMBDAS', 'TRUE', |
| 5029 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Test 1161 with lambda detection'). |
| 5030 | | cli_testcase(1891, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5031 | | '../prob_examples/public_examples/B/CBC/Tests/TestSequenceVariable.mch', |
| 5032 | | '-cbc', 'all', '-expcterr', cbc |
| 5033 | | ], 'Test cbc finds error with sequence type'). |
| 5034 | | cli_testcase(1892, [cbc,symmetry_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5035 | | '../prob_examples/public_examples/B/CBC/Tests/TestPartitionStaticSymReduction.mch', |
| 5036 | | '-cbc', 'all' |
| 5037 | | ], 'Test static symmetry reduction works with cbc'). |
| 5038 | | cli_testcase(1893, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5039 | | '-evalf', '{1,2}*(1..1000) = {}', |
| 5040 | | '-evalt', '{1,2}*(1..1000) /= {}', |
| 5041 | | '-evalf', '{1,2}*x = {} & x<:INTEGER & 22:x', |
| 5042 | | '-evalt', '{1,2}*x /= {} & x<:INTEGER & 22:x', |
| 5043 | | '-evalf', 'x*x = {} & x<:INTEGER & 22:x', |
| 5044 | | '-evalt', 'x*x /= {} & x<:INTEGER & 22:x' |
| 5045 | | ], 'Test improved detection of empty cartesian product closures'). |
| 5046 | | cli_testcase(1894, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5047 | | '../prob_examples/public_examples/B/CBC/RiverCrossing_BMC.mch', |
| 5048 | | '-init', '-assertions', '-model-check', '-nogoal', '-nodead' |
| 5049 | | ], 'Test constraints solved quickly'). |
| 5050 | | cli_testcase(1895, [b_test,let], [ |
| 5051 | | '-evalt', '40 = LET i,j BE i=10 & j=i+20 IN i+j END' |
| 5052 | | ], 'ensure error in nested LET expression detected'). |
| 5053 | | cli_testcase(1896, [proz,let], [ '../prob_examples/public_examples/Z/Daniel/tests/let.tex', '-t', |
| 5054 | | '-mc', 2000, '-cc', 1839, 4195 |
| 5055 | | ], 'ensure Zed LETs treated correctly'). |
| 5056 | | cli_testcase(1897, [cbc,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5057 | | '-evalt', 'card(%(x,y).(x:(1..10) --> BOOL&y:iseq(1..2)|1)) = 5120', |
| 5058 | | '-evalt', 'card(%(x,y).(x:(1..10) --> BOOL&y:(1..10) --> BOOL|1))>100', |
| 5059 | | '-evalt', 'card(%(x,y).(x:(1..10) --> BOOL&y:(1..10) +-> BOOL|1))>100', |
| 5060 | | '-evalt', 'card(%(x,y).(x:(1..10) -->> BOOL&y:(1..10) +->> BOOL|1))>100', |
| 5061 | | '-evalt', 'card(%(x,y).(x:(1..10) <-> BOOL&y:(1..10) >->> (2..11)|1))>100' |
| 5062 | | ], 'Test improved detection of cartesian product closures'). |
| 5063 | | cli_testcase(1898, [tickets,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5064 | | '-evalt', 'x = "a\\\\" & y="bcd"', |
| 5065 | | '-evalf', 'x = "a\\\\" & x="a"' |
| 5066 | | ], 'Test \\ at end of string (no pushback overflow)'). |
| 5067 | | cli_testcase(1899, [tickets,proz,private], [ '-p', 'MAX_OPERATIONS', 900, % TO DO: try and reduce the need for this high value |
| 5068 | | '../prob_examples/examples/Z/Patterns/forProB/ReturnHome ProZ v1.tex', |
| 5069 | | '-t', '-model-check'], |
| 5070 | | 'Ensure no timeouts'). |
| 5071 | | cli_testcase(1900, [tickets,proz,private], [ '-p', 'MAX_OPERATIONS', 1800, |
| 5072 | | '../prob_examples/examples/Z/Patterns/forProB/ReturnHome ProZ v2.tex', |
| 5073 | | '-t', '-model-check'], |
| 5074 | | 'Ensure no timeouts'). |
| 5075 | | cli_testcase(1901, [tickets, let], [ |
| 5076 | | '../prob_examples/public_examples/B/ErrorMachines/LET_Illegal.mch', |
| 5077 | | '-expcterrpos', type_error, 14, 35, '-expcterrpos', type_error, 14, 53, '-expcterr', load_main_file], |
| 5078 | | 'check illegal LET detected'). |
| 5079 | | cli_testcase(1902, [tickets,private,data_validation,let], [ |
| 5080 | | '../prob_examples/examples/B/Alstom/Ticket_LET_Mar26_2018/essai.mch', |
| 5081 | | '-expcterrpos', type_error, 25, 5, '-expcterr', load_main_file], |
| 5082 | | 'check illegal LET detected and no infinite loop in typechecker'). |
| 5083 | | cli_testcase(1903, [b_test,infinite,total_function], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5084 | | '-evalt', 'f = NATURAL1 * {22} & f: NATURAL1 --> NATURAL', |
| 5085 | | '-evalt', 'f = %x.(x:NATURAL1|x+1) & f: NATURAL1 --> NATURAL', |
| 5086 | | '-evalf', 'f = %x.(x:NATURAL|x+1) & f: NATURAL1 --> NATURAL', |
| 5087 | | '-evalt', 'f = /*@symbolic*/ {x|x:NATURAL1*INTEGER & prj2(INTEGER,INTEGER)(x)=prj1(INTEGER,INTEGER)(x)+1} & r = f(2)', |
| 5088 | | % '-evalt', 'f = /*@symbolic*/ {x|x:NATURAL1*INTEGER & prj2(INTEGER,INTEGER)(x)=prj1(INTEGER,INTEGER)(x)+1} & f: NATURAL1 --> NATURAL' % TODO |
| 5089 | | %'-evalf', 'f = NATURAL1 * {22,33} & f: NATURAL1 --> NATURAL' %% TO DO |
| 5090 | | '-evalt', ' %(x,z).(x:NATURAL & z:NATURAL|x+z) : (NATURAL*NATURAL)-->NATURAL', |
| 5091 | | '-evalt', ' %(x,z).(x:NATURAL & z:NATURAL|max({z,x,x/z,-x})) : (NATURAL*NATURAL)-->NATURAL' |
| 5092 | | %'-evalf', '%(x,z).(x:NATURAL & z:NATURAL|min({z,x,x/z,-x})) : (NATURAL*NATURAL)-->NATURAL' % raises enum warning; but finds counter example; see test 1956 |
| 5093 | | ], 'Test symbolic treatment of total function'). |
| 5094 | | cli_testcase(1904,[enabling,private,read_write],[ |
| 5095 | | '../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6.mch', |
| 5096 | | '-t', |
| 5097 | | '-read_write_matrix_csv', '../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6_rw_matrix.csv' |
| 5098 | | ], 'Check read-write-matrix with nested operation calls.'). |
| 5099 | | cli_testcase(1905, [b_test,infinite,total_function,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5100 | | '-p', 'CLPFD', 'FALSE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 5101 | | '-evalt', 'card({x|x > 2 & x mod 2 =0 & x<=10})=4', |
| 5102 | | '-evalt', '{x|x > 2 & x mod 2 =0 & x<=10} = {4,6,8,10}', |
| 5103 | | '-evalt', '{x|x > 2 & x mod 2 =0 & x<10} = {4,6,8}', |
| 5104 | | '-evalt', '{x|x >= 2 & x mod 2 =0 & x<10} = {2,4,6,8}', |
| 5105 | | '-evalt', '{x|x : NATURAL & x mod 2 = 0 & x <= 10} = {0,2,4,6,8,10}', |
| 5106 | | '-evalt', '{x|x : NATURAL1 & x mod 2 = 0 & x <= 10} = {2,4,6,8,10}' |
| 5107 | | ], 'Test improved integer enumeration in non-CLPFD mode'). |
| 5108 | | cli_testcase(1906, [b_test,while,private,records], |
| 5109 | | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5110 | | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', |
| 5111 | | '../prob_examples/examples/B/SupervisoryControl/obs1/DES_12_3_Prop4_H_Fig8b_PartitionV1.mch', |
| 5112 | | '-strict','-t'], 'Check that type checking definitions not confounded by parameter/variable A clash'). |
| 5113 | | cli_testcase(1907,[csp_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5114 | | '../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/AirportsCtrl.csp', |
| 5115 | | '-t', '-strict'], 'Testing example with src_span_operator.'). |
| 5116 | | cli_testcase(1908,[csp_test,private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5117 | | '../prob_examples/examples/B/ASTD/Library/Library_2_1.csp', |
| 5118 | | '-t', '-mc', 90, '-strict'], 'Test state space finite using new [] normalisation rule.'). |
| 5119 | | cli_testcase(1909, [ltl,xtl], ['../prob_examples/public_examples/XTL/BauerZiege.P', |
| 5120 | | '-ltlformulat', 'G not(deadlock)', |
| 5121 | | '-ltlformulaf', 'G not(e(move))', |
| 5122 | | '-ltlformulaf', 'G not({unsafe})'], 'Test XTL LTL example'). |
| 5123 | | cli_testcase(1910, [b_test,pragmas], [ |
| 5124 | | '../prob_examples/public_examples/B/Pragmas/package_pragma/a/aa/Machine_A.mch', |
| 5125 | | '-init'], 'Test package pragme with dot'). |
| 5126 | | cli_testcase(1911, [tickets,tla,wd], [ |
| 5127 | | '../prob_examples/public_examples/TLA/Thales/PingPong/scn_1_node.tla', |
| 5128 | | '../prob_examples/public_examples/TLA/Thales/PingPong_ASSERT/scn_1_node.tla', |
| 5129 | | '-t', '-mc', 40], 'Check no wd errors thrown'). |
| 5130 | | cli_testcase(1912, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5131 | | '-evalf', 'NATURAL \\{1} \\ {2} = NATURAL \\ {3} \\ {1}', |
| 5132 | | '-evalt', 'NATURAL \\{1} \\ {2} = NATURAL \\ {2} \\ {1}', |
| 5133 | | '-evalt', 'NATURAL \\{12} \\ {22} = NATURAL \\ {22} \\ {12}', |
| 5134 | | '-evalt', 'NATURAL1 \\{12} \\ {22} = NATURAL1 \\ {22} \\ {12}', |
| 5135 | | '-evalt', 'NATURAL \\{0} \\ {2} = NATURAL \\ {2} \\ {0}', |
| 5136 | | '-evalt', 'NATURAL \\{0} \\ {1} = NATURAL \\ {1} \\ {0}', |
| 5137 | | '-evalf', 'NATURAL \\{0} \\ {2} = NATURAL \\ {1} \\ {0}', |
| 5138 | | '-evalf', 'NATURAL \\{0} \\ {1} = NATURAL \\ {2} \\ {0}', |
| 5139 | | '-evalt', 'NATURAL1 \\{12} \\ {22} = NATURAL \\ {22} \\ {12} \\ {0}', |
| 5140 | | '-evalf', 'NATURAL1 \\{12} = NATURAL \\{12}', |
| 5141 | | '-evalf', '{x|x>22 & x<100} = {y|y>=k}', |
| 5142 | | '-evalt', '{x|x>22} = {y|y>=k}', |
| 5143 | | '-evalt', '{x|x>22} = {x|x>=k}', |
| 5144 | | '-evalt', '{x|x>22 & x<100} = {y|y>=k & y<m}', |
| 5145 | | '-evalt', '{x,y|x>22&y>100} = /*@symbolic*/ {y1,x1|x1>k & y1>m}', |
| 5146 | | '-evalf', 'NATURAL1 = NATURAL - {1}', |
| 5147 | | '-evalt', 'NATURAL1 = NATURAL - {0}', |
| 5148 | | '-evalt', 'NATURAL1 = NATURAL1 - {0}', |
| 5149 | | '-evalf', '{x|x>0 & x mod 22 = 0 & x < 1000} = NATURAL' |
| 5150 | | %'-evalf', '{x|x>0 & x mod 22 = 0 & x < 1000} = NATURAL \\{12}' % commented out for the moment; conflict with 1081 |
| 5151 | | ], 'ensure symbolic treatment of equality'). |
| 5152 | | cli_testcase(1913, [cbc], [ |
| 5153 | | '-evalf', '{x|x>0 & x mod 22 = 0} = NATURAL \\{12}', |
| 5154 | | '-evalf', '{x|x>0 & x mod 2 = 0} = {x|x>0 & x mod 3 = 0}', |
| 5155 | | '-evalt', '{x|x>0 & x /= 22} = {x|x>0 & (x = 22 => x>22)}', |
| 5156 | | '-evalf', 'NATURAL1 \\{12} = INTEGER \\{12}' |
| 5157 | | ], 'ensure symbolic treatment of equality'). |
| 5158 | | cli_testcase(1914, [cbc,sequences,sigma], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5159 | | '-evalt', 'x:iseq(50001..50002) & y:1..100005 & SIGMA(yy).(yy:1..size(x)|x(yy)) = y & y>50002', |
| 5160 | | '-evalt', 'x:iseq(50001..50002) & y:1..100005 & SIGMA(yy).(yy:dom(x)|x(yy)) = y & y>50002', |
| 5161 | | '-evalt', 'x:iseq(80001..80002) & y:1..100005 & SIGMA(yy).(yy:dom(x)|x(yy)) = y' |
| 5162 | | ], 'ensure earlier enumeration of iseq'). |
| 5163 | | cli_testcase(1915, [cbc,private,enabling,wd], ['../prob_examples/examples/B/Alstom/etcs/actions_scn_f6_372_bis.mch', |
| 5164 | | '-feasibility_analysis_csv', 1000, '../prob_examples/examples/B/Alstom/etcs/actions_feasibility.csv' |
| 5165 | | ], 'Check that feasibility can be shown without wd errors'). |
| 5166 | | cli_testcase(1916,[cbc],[ |
| 5167 | | '../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2.eventb', |
| 5168 | | '-cbc', 'T2ReleaseBus', '-expcterr', 'cbc' |
| 5169 | | ], 'Check invariant violation found despite use of unproven finite() in invariant'). |
| 5170 | | cli_testcase(1917, [b_test,card], ['-strict', '../prob_examples/public_examples/B/FeatureChecks/DeferredSetMaxCardWithUnion.mch', '-init' ,'-assertions'], 'check enumerated set detected despite use of subsidiary identifier'). |
| 5171 | | cli_testcase(1918, [refinement], ['../prob_examples/public_examples/B/EventB_AtelierB/SimpleCounter1.ref', |
| 5172 | | '-t', '-mc', 100, '-cc', 10, 28, |
| 5173 | | '-strict'], 'Test ref keyword for Atelier-B Event-B model'). |
| 5174 | | cli_testcase(1919, [external], ['../prob_examples/public_examples/B/ExternalFunctions/SORT_External.mch', |
| 5175 | | '-assertions', '-t'], 'test SORT and SQUASH external functions'). |
| 5176 | | cli_testcase(1920,[while, codespeed],[ |
| 5177 | | '../prob_examples/public_examples/B/PerformanceTests/While/LiftExec.mch','-strict', |
| 5178 | | '-init', '-property', 'LIM=500', '-p', 'TIME_OUT', 2500, |
| 5179 | | '-animate', 1, |
| 5180 | | '-goal', 'counter=LIM', '-check_goal' ], 'Performance of while loop'). |
| 5181 | | cli_testcase(1921,[wd, error_checks],[ |
| 5182 | | '../prob_examples/public_examples/B/ErrorMachines/WD_SetCompr_Error.mch', '-strict', |
| 5183 | | '-init', '-expcterr', well_definedness_error, |
| 5184 | | '-opterr', 'setup_constants_fails', % as of 17.3.2023 we have partial_setup_constants |
| 5185 | | '-opterr', setup_constants_unknown |
| 5186 | | ], 'Check error detected and no constants found'). |
| 5187 | | cli_testcase(1922,[wd, tickets],[ |
| 5188 | | '../prob_examples/public_examples/B/Tickets/VBF_DB_EnumWarning/Ticket.mch', '-strict', |
| 5189 | | '-init' |
| 5190 | | ], 'Check no enum warning raised due to large CLPFD interval but small fd_size'). |
| 5191 | | cli_testcase(1923, [tickets,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5192 | | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, |
| 5193 | | '-evalt', 'x <: INT - {0}', |
| 5194 | | '-evalf', '{0,1,2} <: INT - {0}', |
| 5195 | | '-evalt', '{-2147483647,1,2,2147483647} <: INT - {0}', |
| 5196 | | '-evalf', '{2147483648} <: INT - {0}' |
| 5197 | | ], 'ensure symbolic treatment of set difference'). |
| 5198 | | cli_testcase(1924,[tickets,while],[ |
| 5199 | | '../prob_examples/public_examples/B/Tester/OpCalls/ParaClash/Call1.mch', '-strict', |
| 5200 | | '-t' |
| 5201 | | ], 'Check no issue with compilation of operation calls with id clashes'). |
| 5202 | | cli_testcase(1925,[tickets,while],[ |
| 5203 | | '../prob_examples/public_examples/B/Tester/OpCalls/ParaClash/Call1_Clash.mch', '-strict', |
| 5204 | | '-expcterr', bmachine_static_checks, % Warnings about variable clashes |
| 5205 | | '-t' |
| 5206 | | ], 'Check no issue with compilation of operation calls with id clashes'). |
| 5207 | | cli_testcase(1926,[alloy],[ |
| 5208 | | '../prob_examples/public_examples/Alloy/SimpleTests/Join_Binary.als', |
| 5209 | | '../prob_examples/public_examples/Alloy/SimpleTests/Join_Complex.als', |
| 5210 | | '../prob_examples/public_examples/Alloy/SimpleTests/Quantifiers.als', |
| 5211 | | '../prob_examples/public_examples/Alloy/SimpleTests/Comprehension.als', |
| 5212 | | '../prob_examples/public_examples/Alloy/SimpleTests/CartesianProduct.als', |
| 5213 | | '../prob_examples/public_examples/Alloy/SimpleTests/Restrictions.als', |
| 5214 | | '../prob_examples/public_examples/Alloy/SimpleTests/EmptyAssert.als', |
| 5215 | | '../prob_examples/public_examples/Alloy/SimpleTests/EmptyPred.als', |
| 5216 | | %'../prob_examples/public_examples/Alloy/SimpleTests/TestUtilInteger.als', |
| 5217 | | '../prob_examples/public_examples/Alloy/SimpleTests/natural_no_alias.als', |
| 5218 | | '../prob_examples/public_examples/Alloy/SimpleTests/natural.als', |
| 5219 | | '../prob_examples/public_examples/Alloy/SimpleTests/Arithmetic.als', |
| 5220 | | '../prob_examples/public_examples/Alloy/SimpleTests/TestUtilBool.als', |
| 5221 | | '../prob_examples/public_examples/Alloy/SimpleTests/BinaryDifferentlyTyped.als', |
| 5222 | | '../prob_examples/public_examples/Alloy/SimpleTests/ambiguous_field_name.als', |
| 5223 | | '../prob_examples/public_examples/Alloy/Puzzles/harry-potter.als', |
| 5224 | | '../prob_examples/public_examples/Alloy/Puzzles/queens.als', |
| 5225 | | '../prob_examples/public_examples/Alloy/Puzzles/queens_with_pred.als', |
| 5226 | | '-strict', '-t', '-p', 'ALLOY_STRICT_INTEGERS', 'TRUE' |
| 5227 | | ], 'Check Alloy translation'). |
| 5228 | | cli_testcase(1927,[alloy,cbc,cbc_tests],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5229 | | '../prob_examples/public_examples/Alloy/alloy_models/toys/grandpa.als', |
| 5230 | | '../prob_examples/public_examples/Alloy/alloy_models/toys/grandpa.als', |
| 5231 | | '-cbc_sequence', run0, |
| 5232 | | '-expcterr', 'cbc_sequence_no_solution_found', |
| 5233 | | '-strict'], 'Test Alloy model and *no* solution for run0'). |
| 5234 | | cli_testcase(1928,[alloy,cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5235 | | '../prob_examples/public_examples/Alloy/SimpleTests/multiplicity_birthday_test.als', |
| 5236 | | '-t', '-mc', 100, '-cc', 3, 3, % 3 nodes: root, setup_constants, init |
| 5237 | | '-strict'], 'Test Alloy models have exactly one solution'). |
| 5238 | | cli_testcase(1929,[alloy,cbc,cbc_tests],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5239 | | '../prob_examples/public_examples/Alloy/laws/orderings.als', |
| 5240 | | '-cbc_sequence', run0, |
| 5241 | | '-strict'], 'Test Alloy model and solution for run0 found'). |
| 5242 | | cli_testcase(1930,[alloy,cbc,cbc_tests],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5243 | | '../prob_examples/public_examples/Alloy/alloy_models/systems/lists.als', |
| 5244 | | '-cbc_sequence', run0, |
| 5245 | | '-strict'], 'Test Alloy model and solution for run0 found'). |
| 5246 | | cli_testcase(1931,[b_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5247 | | '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/VariableListAsDEFINITION.mch', |
| 5248 | | '-init'], 'Try using DEFINITION as variable list'). |
| 5249 | | cli_testcase(1932,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5250 | | '../private_examples/Thales/Hansen_CSV_Loop/CSV_Input.rmch', |
| 5251 | | '-execute_all', '-animate_stats', '-p', 'CLPFD', 'TRUE'], 'Ensure complex set unification due to partial sequence skeleton is avoided'). |
| 5252 | | /* requires new parser: */ |
| 5253 | | cli_testcase(1933, [union,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5254 | | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, |
| 5255 | | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x,x+100}) & 100:r', |
| 5256 | | '-evalf', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x,x+100}) & -100:r', |
| 5257 | | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x+1}) & 1:r & 0/:r', |
| 5258 | | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x+2,x+3}) & 2:r & 1/:r', |
| 5259 | | '-evalt', 'r = /*@symbolic*/ {u|#x.(x : NATURAL & u : {x |-> x * x,x |-> x + x})} & 10|->20 : r', |
| 5260 | | '-evalt', '!y.(y:10..12 => #x.(x : NATURAL & y|->2*y : {x |-> x * x,x |-> x + x}))', |
| 5261 | | '-evalf', '!y.(y:10..12 => #x.(x : NATURAL & y|->3*y : {x |-> x * x,x |-> x + x}))', |
| 5262 | | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x|->x*x, x|->x+x}) & r[10..11]=x', |
| 5263 | | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x|->x*x, x|->x+x}) & r[10..11]={20,22,100,121}', |
| 5264 | | '-evalt', '{u,v|u=10|->v & #x.(x : NATURAL & u : {x |-> x * x,x |-> x + x})} = {((10|->20)|->20),((10|->100)|->100)}' |
| 5265 | | ], 'ensure symbolic treatment of UNION'). |
| 5266 | | cli_testcase(1934,[cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5267 | | '../prob_examples/public_examples/B/Tester/TestProjection.mch', |
| 5268 | | '-assertions'], 'Ensure projection onto static assertion filters out unrelated constant'). |
| 5269 | | cli_testcase(1935,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5270 | | '../private_examples/Thales/Hansen_EnumerationProblem/Runner_EnumerationProblem.rmch', |
| 5271 | | '-execute_all', '-animate_stats', |
| 5272 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5273 | | '-p', 'TRY_FIND_ABORT', 'TRUE', '-p', 'DATA_VALIDATION', 'TRUE', |
| 5274 | | '-silent', '-noinv'], 'Ensure no time-out in COMP_CSVRecords'). |
| 5275 | | cli_testcase(1936,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5276 | | '../private_examples/Thales/Hansen_EnumerationProblem/Runner_EnumerationProblem.rmch', |
| 5277 | | '-execute_all', '-animate_stats', |
| 5278 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5279 | | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'DATA_VALIDATION', 'TRUE', |
| 5280 | | '-silent', '-noinv'], 'Ensure no time-out in COMP_CSVRecords (TRY_FIND_ABORT=FALSE)'). |
| 5281 | | cli_testcase(1937, [b_test,pragmas], ['../prob_examples/public_examples/B/Pragmas/TestLabel.mch', '-pp', '../prob_examples/public_examples/B/Pragmas/TestLabel_pp.mch', '-strict'], 'Check that pretty printing label pragma works'). |
| 5282 | | cli_testcase(1938, [laws,strings,external], ['../prob_examples/public_examples/B/Laws/StringLiteralTests.mch', '-assertions', '-strict'], 'Some tests about the STRING literals'). |
| 5283 | | cli_testcase(1939, [union,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5284 | | '-p', 'MAXINT', 127, '-p', 'MININT', -128, |
| 5285 | | '-evalt', 'x = INTEGER \\ {1000} & !v.(v:x => v/=1000)', |
| 5286 | | '-evalf', 'x = INTEGER \\ {1000} & !v.(v:x => v>2000)', |
| 5287 | | '-evalt', 'x = INTEGER \\ {10} & x \\/ {11} = res & res=x' |
| 5288 | | ], 'Test for not-member closures'). |
| 5289 | | cli_testcase(1940, [tickets,pragmas], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5290 | | '-aa', 2, 0, 0, % check that label pragmas respected |
| 5291 | | '-properties', |
| 5292 | | '../prob_examples/public_examples/B/Tickets/Pragmas/LabelBoolPragmaDisappears.mch' |
| 5293 | | ], 'Test label pragma respected by assertions'). |
| 5294 | | cli_testcase(1941, [refinement,b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5295 | | '-init', |
| 5296 | | '-dot', invariant, '../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1_invariant.dot', |
| 5297 | | '-dot', machine_hierarchy, '../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1_hierarchy.dot', |
| 5298 | | '../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1.ref' |
| 5299 | | ], 'Test one invariant copied from abstract machine'). |
| 5300 | | cli_testcase(1942, [error_checks,private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5301 | | '../prob_examples/examples/B/Satpathy/SystemOnChip/Router.mch', '-t' |
| 5302 | | ], 'Check no bmachine_static_checks for disjunction in invariant'). |
| 5303 | | cli_testcase(1943, [b_test,external,regex], ['../prob_examples/public_examples/B/ExternalFunctions/TestLibraryRegexp.mch', '-assertions', '-force_no_silent'], 'Test Regular Expression Library'). |
| 5304 | | cli_testcase(1944,[eventb_test],[ |
| 5305 | | '../prob_examples/public_examples/EventBPrologPackages/TreeFileSysContPerm/FMCH02.eventb', |
| 5306 | | '-t', '-p', 'DEFAULT_SETSIZE', 2 |
| 5307 | | ], 'Check Event-B model with complicated properties (and axiomatized transitive closure)'). |
| 5308 | | cli_testcase(1945,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5309 | | '../private_examples/ClearSy/N_ITERa_avec_DV_sans_DV/rule_avec_DV.mch', |
| 5310 | | '-execute_all', '-animate_stats', |
| 5311 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5312 | | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'DATA_VALIDATION', 'TRUE', |
| 5313 | | % '-p', 'LIFT_EXISTS', 'TRUE', % should also work without this |
| 5314 | | '-execute_expect_steps', 44, |
| 5315 | | '-evalt', 'caval__rule__1__done=TRUE & caval__rule__1__ALL={({}|->TRUE)} & caval__rule__1__isKO=FALSE', |
| 5316 | | '-evalt', 'caval__rule__2__done=TRUE & caval__rule__2__dataverified={} & caval__rule__2__isKO=FALSE', |
| 5317 | | '-evalt', 'caval__rule__3__done=TRUE & caval__rule__3__dataverified={} & caval__rule__3__isKO=FALSE', |
| 5318 | | '-evalt', 'caval__rule__4__done=TRUE & card(caval__rule__4__ALL)=3 & caval__rule__4__isKO=TRUE', |
| 5319 | | '-evalt', 'caval__rule__5__done=TRUE & card(caval__rule__5__ALL)=5 & caval__rule__5__isKO=TRUE', |
| 5320 | | '-evalt', 'caval__rule__6__done=TRUE & caval__rule__6__dataverified={} & caval__rule__6__isKO=TRUE', |
| 5321 | | '-silent', '-noinv'], 'Ensure no problem with caval__rule__2__ALL set comprehension and lifting out of exists quantifier'). |
| 5322 | | cli_testcase(1946,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5323 | | '../private_examples/ClearSy/N_ITERa_avec_DV_sans_DV/rule_avec_DV.mch', |
| 5324 | | '-execute_all', '-animate_stats', |
| 5325 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5326 | | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'LIFT_EXISTS', 'TRUE', |
| 5327 | | '-execute_expect_steps', 44, |
| 5328 | | '-evalt', 'caval__rule__1__done=TRUE & caval__rule__1__ALL={({}|->TRUE)} & caval__rule__1__isKO=FALSE', |
| 5329 | | '-evalt', 'caval__rule__2__done=TRUE & caval__rule__2__dataverified={} & caval__rule__2__isKO=FALSE', |
| 5330 | | '-evalt', 'caval__rule__3__done=TRUE & caval__rule__3__dataverified={} & caval__rule__3__isKO=FALSE', |
| 5331 | | '-evalt', 'caval__rule__4__done=TRUE & card(caval__rule__4__ALL)=3 & caval__rule__4__isKO=TRUE', |
| 5332 | | '-evalt', 'caval__rule__5__done=TRUE & card(caval__rule__5__ALL)=5 & caval__rule__5__isKO=TRUE', |
| 5333 | | '-evalt', 'caval__rule__6__done=TRUE & caval__rule__6__dataverified={} & caval__rule__6__isKO=TRUE', |
| 5334 | | '-silent', '-noinv'], 'Ensure no problem with caval__rule__2__ALL set comprehension and lifting out of exists quantifier'). |
| 5335 | | cli_testcase(1947, [smt_solver_integration], [ |
| 5336 | | '../prob_examples/public_examples/B/Tickets/Z3/Aufgabe2.mch', '-init', %'-vv', |
| 5337 | | '-evalt', ':z3-double-check x:liefert', |
| 5338 | | '-evalt', ':z3-double-check x:bes', |
| 5339 | | '-evalt', ':z3-double-check x|->a3:liefert', |
| 5340 | | '-evalf', ':z3-double-check l2|->a3:liefert', |
| 5341 | | '-evalt', ':z3-double-check x:liefert[{l1}]', |
| 5342 | | '-evalt', ':z3-double-check x:liefert[{l1}] & k|->b : bes & x:b', |
| 5343 | | '-evalf', ':z3-double-check x:liefert[{l1}] & k|->b : bes & x:b & k /= k2 & x /= a1 & k /= k3' |
| 5344 | | ], 'some constraints that should be solved by z3; check ticket with ProB state'). |
| 5345 | | cli_testcase(1948, [infinite,tickets], [ |
| 5346 | | '../prob_examples/public_examples/B/Tickets/Hansen36_Lambda/TestBugly.mch', '-init', |
| 5347 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5348 | | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'TRACE_INFO', 'TRUE', |
| 5349 | | '-mc', 100, '-nodead' |
| 5350 | | ], 'check nested function calls cause no problem'). |
| 5351 | | cli_testcase(1949, [b_test], [ |
| 5352 | | '-evalt', '{x,res|IF x>2 THEN 22 ELSIF x<0 THEN 33 ELSE 44 END = res & x<3 & x>0} = {(1|->44),(2|->44)}' |
| 5353 | | ], 'test ELSIF for expressions'). |
| 5354 | | cli_testcase(1950,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5355 | | '../private_examples/ClearSy/Well_def_1.9.0_b5/Err/rule_SSO_SLOT_MSG_ID_SET_SSO/rule.mch', |
| 5356 | | '-execute_all', '-animate_stats', |
| 5357 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5358 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5359 | | '-p', 'COMPRESSION', 'TRUE', |
| 5360 | | '-execute_expect_steps', 6, |
| 5361 | | '-evalt', 'caval__rule__4__done=TRUE & caval__rule__4__isKO=TRUE', |
| 5362 | | '-ppf', '../private_examples/ClearSy/Well_def_1.9.0_b5/Err/rule_SSO_SLOT_MSG_ID_SET_SSO/rule_SSO_SLOT_bugly.mch', |
| 5363 | | '-p', 'BUGLY', 'TRUE', |
| 5364 | | '-silent' |
| 5365 | | ], 'Ensure wd-problem solved'). |
| 5366 | | cli_testcase(1951,[wd,tickets,private,data_validation],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5367 | | '../prob_examples/examples/B/ClearSy/Tickets/Well_def_1.9.0_b5/rule_bugly.mch', |
| 5368 | | '-execute_all', '-animate_stats', |
| 5369 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5370 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5371 | | '-p', 'COMPRESSION', 'TRUE', |
| 5372 | | '-silent'], 'Ensure wd-problem solved (BUGLY version of test 1950)'). |
| 5373 | | cli_testcase(1952,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5374 | | '../private_examples/ClearSy/ComparePv10Pv11/DebugPv10/rule_Test__RGP_71237__RI_091/rule.mch', |
| 5375 | | '../private_examples/ClearSy/ComparePv10Pv11/DebugPv11/rule_Test__RGP_71237__RI_091/rule.mch', |
| 5376 | | '-execute', 9, '-animate_stats', '-silent', |
| 5377 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 5378 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5379 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, |
| 5380 | | '-silent'], 'Ensure in_domain delay solved'). |
| 5381 | | cli_testcase(1953,[b_test,operation_calls_in_expr],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5382 | | '../prob_examples/public_examples/B/NewSyntax/CallOperationInExprSimple.mch', |
| 5383 | | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', |
| 5384 | | '-t', '-assertions', |
| 5385 | | '-evalt', 'Double(33)=66', |
| 5386 | | '-evalt', 'Double(Double(33))=132', |
| 5387 | | '-evalf', 'Double(3)=3', |
| 5388 | | '-evalt', 'Divisors(17)=2' |
| 5389 | | ], 'Test calling operations in expressions'). |
| 5390 | | cli_testcase(1954,[b_test,operation_calls_in_expr],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5391 | | '../prob_examples/public_examples/B/NewSyntax/CallOperationInExpr_Compile.mch', |
| 5392 | | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', |
| 5393 | | '-t' |
| 5394 | | ], 'Test calling operations in expressions with closure compilation'). |
| 5395 | | cli_testcase(1955,[b_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5396 | | '../prob_examples/public_examples/B/Tester/LogXML/WD_Error.mch', |
| 5397 | | '-execute_all', '-logxml', '../prob_examples/public_examples/B/Tester/LogXML/problog.xml', |
| 5398 | | '-expcterr', well_definedness_error |
| 5399 | | ], 'Test generation of locations in xml file'). |
| 5400 | | % file should contain start_line,end_line XML info; we cannot test with a diff, as time-stamp and prob version info is found in the logxml file ! |
| 5401 | | % xmllint --schema doc/logxml_xsd.xml ../prob_examples/public_examples/B/Tester/LogXML/problog.xml -noout |
| 5402 | | cli_testcase(1956, [b_test,infinite,total_function], [ |
| 5403 | | '-evalf', '%(x,z).(x:NATURAL & z:NATURAL1|min({z,x,x/z,-x})) : (NATURAL*NATURAL1)-->NATURAL' % raises enum warning; but finds counter example |
| 5404 | | ], 'Test symbolic treatment of total function'). |
| 5405 | | cli_testcase(1957,[private_source_not_available], % also covering operation_calls_in_expr |
| 5406 | | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5407 | | '../private_examples/Thales/Hansen_Compile/Main_StringToIPV4.mch', |
| 5408 | | '-execute', 4, '-animate_stats', '-silent', '-expcterr', deadlock, |
| 5409 | | '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, |
| 5410 | | '-silent'], 'Ensure compilation of operation_call_in_expr with op(.) identifiers in read info solved; contains while'). % ALLOW_OPERATION_CALLS_IN_EXPRESSIONS |
| 5411 | | cli_testcase(1958, [b_test,cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5412 | | '-evalt', '{x|1..x <: {1,2,3,5} & x>1} = 2..3', |
| 5413 | | '-evalt', 'card({x|1..x <: {1,2,3,5} & x>1}) = 2', |
| 5414 | | '-evalt', '{ss | ss <: 0..0 & ss /= {} & ss=0..max(ss)} = {{0}}', |
| 5415 | | '-evalt', '{ss | ss <: 0..2 & ss /= {} & ss=0..max(ss)} = {{0},{0,1},{0,1,2}}' |
| 5416 | | %'-evalt', '{x,y|x..y <: {10,12,13,15} & y>x} = 12..13', % requires CHR |
| 5417 | | ], 'Ensure improved treatment of interval subset'). |
| 5418 | | cli_testcase(1959, [b_test,cbc], [ |
| 5419 | | '-evalt', '/*@symbolic */ {z|z>3 & z mod 3 =0} <: {x|x>5 & x mod 3=0}', |
| 5420 | | '-evalf', '/*@symbolic */ {z|z>3 & z mod 3 =0} <: {x|x>6 & x mod 3=0}', |
| 5421 | | '-evalt', '/*@symbolic */ {z|z>3 & z mod 3 =0} <: {x|x>1}', |
| 5422 | | '-evalf', '{z|z:seq(BOOL) & 1|->TRUE:z} <: {z|z:seq(BOOL) & 1|->FALSE:z}', |
| 5423 | | '-evalt', '/*@symbolic */ {z,v|z:seq(BOOL) & 1|->TRUE:z & v>2} <: /*@symbolic */ {v,z|v:seq(BOOL) & 1|->TRUE:v & z>1}', |
| 5424 | | '-evalf', '/*@symbolic */ {z,v|z:seq(BOOL) & 1|->TRUE:z & v>2} <: /*@symbolic */ {v,z|v:seq(BOOL) & 1|->TRUE:v & z>3}', |
| 5425 | | '-evalt', '{z|z>3 & z mod 3 =0} <: NATURAL' |
| 5426 | | ], 'Ensure improved symbolic treatment of subset'). |
| 5427 | | cli_testcase(1960,[b_test,operation_calls_in_expr],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5428 | | '../prob_examples/public_examples/B/NewSyntax/OperationWithAssert.mch', |
| 5429 | | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', |
| 5430 | | '-assertions' |
| 5431 | | ], 'Test calling operations with assertions inside expressions'). |
| 5432 | | cli_testcase(1961,[refinement],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5433 | | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main1.ref', |
| 5434 | | '-mc', 1000 |
| 5435 | | ], 'Check that abstract events not copied to refinement machine, as they are refined.'). |
| 5436 | | cli_testcase(1962,[alloy,cbc,cbc_tests],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5437 | | '../prob_examples/public_examples/Alloy/laws/SetLaws_Scope2.als', |
| 5438 | | '-cbc_sequence', check0, |
| 5439 | | '-expcterr', 'cbc_sequence_no_solution_found', |
| 5440 | | '-strict'], 'Test Alloy laws and *no* solution for check0'). |
| 5441 | | cli_testcase(1963, [b_test,cruise,codespeed], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5442 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-bf', |
| 5443 | | '-cc', '1361', '1379', % was 1360, but now we store transitions for uncovered operations |
| 5444 | | '-strict', '-nodead', '-p', 'MAX_INITIALISATIONS', 5, |
| 5445 | | '-p', 'SAFETY_MODEL_CHECK', 'TRUE'], 'Complete Model Check of Cruise Controller with SAFETY_MODEL_CHECK'). |
| 5446 | | cli_testcase(1964, [refinement], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5447 | | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main1_v2.ref', |
| 5448 | | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main2_v2.ref', |
| 5449 | | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main2_v3.ref', |
| 5450 | | '-strict','-mc', '1000'], 'Check invariants copied correctly'). |
| 5451 | | cli_testcase(1965, [refinement], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5452 | | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main1_err.ref', |
| 5453 | | '-expcterr', 'invariant_violation', '-strict', |
| 5454 | | '-mc', '1000'], 'Check invariants copied correctly'). |
| 5455 | | cli_testcase(1966, [wd,exists,rulesdsl], [ |
| 5456 | | '../prob_examples/public_examples/B/Tickets/Hansen37_WD_Exists/WD_Exists.rmch', |
| 5457 | | '-expcterr', well_definedness_error, '-expcterr', animate, |
| 5458 | | '-animate', 3], 'Check WD error inside negated existential quantifier detected'). |
| 5459 | | cli_testcase(1967, [b_test,infinite,total_function,wd], [ |
| 5460 | | '-evalnwd', '%(x,z).(x:NATURAL & z:NATURAL|min({z,x,x/z,-x})) : (NATURAL*NATURAL)-->NATURAL', % raises enum warning; but finds counter example |
| 5461 | | '-expcterr', well_definedness_error, |
| 5462 | | '-opterr', eval_string_enum_warning |
| 5463 | | ], 'Test wd error found due to division by 0'). |
| 5464 | | cli_testcase(1968, [b_test,infinite,memoize], ['../prob_examples/public_examples/B/FunctionalProgramming/MemoizationTests.mch', '-assertions'], 'Check function memoization works'). |
| 5465 | | cli_testcase(1969, [b_test,operation_calls_in_expr], ['../prob_examples/public_examples/B/NewSyntax/ExpressionsWithOperations/TopologyOpExpr.mch', |
| 5466 | | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', |
| 5467 | | '-t', '-assertions'], 'Check local operations called in expressions'). |
| 5468 | | cli_testcase(1970, [laws,rel_fnc,wd,memoize], ['../prob_examples/public_examples/B/Laws/FunLawsWithLambdaMemo.mch', |
| 5469 | | '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE-EVALUATION', 'TRUE', |
| 5470 | | '-p', 'MEMOIZE_FUNCTIONS', 'TRUE', |
| 5471 | | '-expcterr', 'model_check_incomplete'], 'Test 458 with MEMOIZE_FUNCTIONS.'). |
| 5472 | | cli_testcase(1971, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5473 | | '-evalt_rc', '%x.(x:NATURAL|x) : NATURAL +-> NATURAL', |
| 5474 | | '-evalt_rc', '%x.(x:NATURAL1|x) : INTEGER +-> NATURAL1', |
| 5475 | | '-evalf_rc', '%x.(x:NATURAL|x) : NATURAL1 +-> NATURAL', |
| 5476 | | '-evalf_rc', '%x.(x:NATURAL|x) : NATURAL +-> NATURAL1', |
| 5477 | | '-evalt_rc', '%x.(x:NATURAL|x+1) : NATURAL +-> NATURAL', |
| 5478 | | '-evalt_rc', '%x.(x:NATURAL|x+1) : NATURAL +-> NATURAL1', |
| 5479 | | '-evalf_rc', '%x.(x:NATURAL|x-1) : NATURAL +-> NATURAL', |
| 5480 | | '-evalt_rc', 'f=%x.(x:NATURAL1|x-1) & f: NATURAL1 +-> NATURAL', |
| 5481 | | '-evalt_rc', 'f=%x.(x:NATURAL1|x-1) & f: NATURAL +-> NATURAL', |
| 5482 | | '-evalt_rc', 'f=%x.(x:NATURAL1|x-1) & f: INTEGER +-> NATURAL', |
| 5483 | | '-evalt_rc', '%(x,y).(x:NATURAL&y:NATURAL|x+y) : NATURAL*NATURAL +-> NATURAL', |
| 5484 | | '-evalf_rc', '%(x,y).(x:NATURAL&y:NATURAL|x+y) : NATURAL*NATURAL +-> NATURAL1', |
| 5485 | | '-evalt_rc', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) +-> (2..200)', |
| 5486 | | '-evalt_rc', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) +-> (1..10000)', |
| 5487 | | '-evalf_rc', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) +-> (3..200)', |
| 5488 | | '-evalt_rc', '%(x,y).(x:1..100 & y:1..100|x*y) : (1..100)*(1..100) +-> (1..10000)', |
| 5489 | | '-evalf_rc', '%(x,y).(x:1..100 & y:1..100|x*y) : (1..100)*(1..100) +-> (2..10000)', |
| 5490 | | '-evalf_rc', '%(x,y).(x:1..100 & y:1..101|x*y) : (1..100)*(1..101) +-> (1..10000)', |
| 5491 | | '-evalt_rc', '%(x,y).(x:0..9999 & y:0..9999|(x*y) mod 10000) : (0..9999)*(0..9999) +-> (0..9999)', |
| 5492 | | '-evalt_rc', '%(aa).(aa : INTEGER | [aa]) : INTEGER +-> seq(INTEGER)', |
| 5493 | | %'-evalf_rc', '%(aa).(aa : INTEGER | [aa]) : INTEGER +-> seq(NATURAL)', % succeeds but has non-critical enum warning |
| 5494 | | '-evalt_rc', '%(aa).(aa : NATURAL1 | [aa]) : NATURAL +-> seq(NATURAL1)' |
| 5495 | | ], 'Check new symbolic partial function range detection'). |
| 5496 | | cli_testcase(1972, [tickets,sequences], [ |
| 5497 | | '../prob_examples/public_examples/B/Tickets/ReversePendingCoroutine/TestSuffixWithReverse.mch', |
| 5498 | | '-mc', 100, '-nodead', '-assertions', '-cc', 5,4], 'Check no pending co-routine in reverse of sequence'). |
| 5499 | | cli_testcase(1973,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5500 | | '../private_examples/ClearSy/2019_June/string_tail/rule_nok.mch', |
| 5501 | | '-execute', 4, '-animate_stats', '-silent', '-expcterr', deadlock, |
| 5502 | | '-execute_expect_steps', 3, |
| 5503 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 5504 | | '-evalt', 'caval__rule__1__isKO=FALSE', |
| 5505 | | '-silent'], 'Ensure pending co-routing in reverse of sequence solved'). |
| 5506 | | cli_testcase(1974,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5507 | | '../private_examples/ClearSy/2019_June/performance/toto_ko.mch', |
| 5508 | | '-execute', 4, '-animate_stats', '-expcterr', deadlock, |
| 5509 | | '-execute_expect_steps', 3, |
| 5510 | | '-evalt', 'caval__rule__5__done=TRUE', |
| 5511 | | '-evalt', 'caval__rule__5__isKO=TRUE', |
| 5512 | | '-evalt', 'caval__rule__5__ALL = {({(1|->2|->3|->4|->2)}|->FALSE),({(1|->2|->3|->4|->3)}|->FALSE)}', |
| 5513 | | '-silent'], 'Ensure we do not wait for identifier in exists using used_ids_defined_by_equality optimisation'). |
| 5514 | | cli_testcase(1975, [b_test,exists], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-version', |
| 5515 | | '-evalt_rc', '{x | x=1 & #(OO,MM).(MM>x & OO:NATURAL1)} = {1}', |
| 5516 | | '-evalt_rc', '{x | x>1 & x<10 & #(OO,MM).(MM>x & OO:NATURAL1)} = 2..9', |
| 5517 | | '-evalt_rc', '{x | x=1 & #(OO,MM,VV).(MM>x & OO:NATURAL1 & VV>x)} = {1}', |
| 5518 | | '-evalt_rc', '{x | x:10..12 & #(OO,MM,VV).(MM>x & OO:NATURAL1 & MM<12 & VV>x)} = {10}' |
| 5519 | | ], 'Partitioning of exists works'). |
| 5520 | | cli_testcase(1976, [laws,rel_fnc,data_validation], ['../prob_examples/public_examples/B/Laws/ExplicitComputations.mch', '-t', '-mc', '100000', '-nodead', '-cs', '-strict', |
| 5521 | | '-p', 'CLPFD', 'TRUE', % currently fails with FALSE ! |
| 5522 | | '-p', 'TIME_OUT', '7000', |
| 5523 | | '-p', 'DATA_VALIDATION', 'TRUE'], 'Test 292 in DATA_VALIDATION mode.'). |
| 5524 | | cli_testcase(1977,[private_source_not_available],[ |
| 5525 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', % Note: generated virtual timeout, no longer does after override does not try to expand symbolic closures anymore |
| 5526 | | '../private_examples/ClearSy/2019_Aug/call_residue/rule_erreur.mch', |
| 5527 | | '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', % FALSE was necessary as of 3974491412f39ab8b6beea3d2a7c47e7c56315ae |
| 5528 | | '-execute_all', '-animate_stats', '-noinv', |
| 5529 | | '-execute_expect_steps', 23, |
| 5530 | | '-evalt', 'caval__ic___DFCT___COMPUTED__CLA_01218__Poste_enclenchement__done=TRUE', |
| 5531 | | '-evalt', 'caval__ic___DFCT___COMPUTED__ATR_42912__Numero_poste_organe__done=TRUE', |
| 5532 | | '-silent'], 'Ensure we have no call_residue internal error'). |
| 5533 | | cli_testcase(1978, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'OPTIMIZE_AST', 'FALSE', |
| 5534 | | '-evalf_rc', '2=3 & 1=1 <=> 4=5 & 2=2', |
| 5535 | | '-evalt_rc', '2**3**2 = 512', |
| 5536 | | '-evalt_rc', '10-5+4-3=6', |
| 5537 | | '-evalt_rc', '8 / 2 * 4 = 16', |
| 5538 | | '-evalt_rc', '8 / 4 / 2 = 1', |
| 5539 | | '-evalf_rc', '!x.(x=100 & x>50 => x>100)', |
| 5540 | | '-evalt_rc', '#x.(not(x:BOOL --> {1,2}))' |
| 5541 | | ], 'Test associativity of certain B operators'). |
| 5542 | | cli_testcase(1979, [error_checks,wd,sequences], [ |
| 5543 | | '-eval', 'x:perm(NATURAL)', |
| 5544 | | '-expcterr', infinite_sequence, '-expcterr', eval_string_enum_warning |
| 5545 | | ], 'Test error raised for x:perm(S) for infinite set S'). |
| 5546 | | cli_testcase(1980,[private_source_not_available],[ |
| 5547 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5548 | | '../private_examples/ClearSy/2019_Sep/rule_dummy/rule_dummy_acc.mch', |
| 5549 | | '-execute_all', '-animate_stats', '-noinv', |
| 5550 | | '-execute_expect_steps', 3, |
| 5551 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 5552 | | '-evalt', 'card(caval__rule__1__ALL)=4299' |
| 5553 | | ], 'Ensure that compilation of set_extension works properly'). |
| 5554 | | cli_testcase(1981,[private_source_not_available,regex],[ |
| 5555 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5556 | | '../private_examples/ClearSy/2019_Sep/non_ground_closure/rule.mch', |
| 5557 | | '-execute_all', '-animate_stats', '-noinv', |
| 5558 | | '-execute_expect_steps', 13, |
| 5559 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 5560 | | '-evalt', 'caval__rule__10__done=TRUE', |
| 5561 | | '-evalt', 'card(caval__rule__10__ALL)=254', |
| 5562 | | '-evalt', 'caval__rule__11__done=TRUE', |
| 5563 | | '-evalt', 'card(caval__rule__11__ALL)=254' |
| 5564 | | ], 'Ensure that no internal error due to non-ground closure'). |
| 5565 | | cli_testcase(1982, [eventb_test,private], ['../prob_examples/examples/EventBPrologPackages/Abrial/ess_simple/m0_mch.eventb', |
| 5566 | | '-expcterr', 'virtual_time_out', '-t'], |
| 5567 | | 'Test trace replay and execute by predicate for Event-B.'). |
| 5568 | | cli_testcase(1983,[private,regex],[ |
| 5569 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5570 | | '../prob_examples/examples/B/ClearSy/Caval/2019_Sep/memo_error/rule.mch', |
| 5571 | | '-execute', 5, '-animate_stats', '-noinv', |
| 5572 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 5573 | | '-evalt', 'caval__rule__2__done=TRUE', |
| 5574 | | '-evalt', 'caval__rule__3__done=TRUE', |
| 5575 | | '-evalt', 'caval__rule__3__ALL={({}|->{428}|->{}|->TRUE),({}|->{447}|->{}|->TRUE),({}|->{464}|->{}|->TRUE),({}|->{483}|->{}|->TRUE),({}|->{503}|->{}|->TRUE),({}|->{521}|->{}|->TRUE),({}|->{540}|->{}|->TRUE),({}|->{560}|->{}|->TRUE)}', |
| 5576 | | '-evalt', 'caval__rule__4__done=FALSE' |
| 5577 | | ], 'Ensure memoization expansion problem solved'). |
| 5578 | | cli_testcase(1984,[private_source_not_available],[ |
| 5579 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 5580 | | '../private_examples/ClearSy/2019_Sep/wd_issue/rule.mch', |
| 5581 | | '-execute_all', '-animate_stats', |
| 5582 | | '-execute_expect_steps', 3, |
| 5583 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 5584 | | '-evalt', 'caval__rule__1__ALL={({("WholeGuideway"|->"struct(segment: [struct(segment: struct(edge: 1, offset0: 0.00, offset1: 999.99), direction: UP), struct(segment: struct(edge: 2, offset0: 0.00, offset1: 199.99), direction: UP)])")}|->FALSE),({("WholeGuideway"|->"struct(segment: [struct(segment: struct(edge: 2, offset0: 0.00, offset1: 199.99), direction: DOWN), struct(segment: struct(edge: 1, offset0: 0.00, offset1: 999.99), direction: DOWN)])")}|->FALSE),({("WholeGuideway"|->"struct(segment: [struct(segment: struct(edge: 5, offset0: 0.00, offset1: 199.99), direction: DOWN)])")}|->FALSE),({("WholeGuideway"|->"struct(segment: [struct(segment: struct(edge: 5, offset0: 0.00, offset1: 199.99), direction: UP)])")}|->FALSE)}' |
| 5585 | | ], 'Ensure no spurious wd error due to enumeration of assertion_expression for function application'). |
| 5586 | | cli_testcase(1985, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'OPTIMIZE_AST', 'FALSE', |
| 5587 | | '-evalt_rc', 'hl : 1..10 +-> 0..11 & (DL=TRUE => (2..4) * {11} <: hl) & (6 |-> hl(4) : hl) & DL=TRUE', |
| 5588 | | '-evalt_rc', 'hl : 1..10 +-> 0..11 & (DL=TRUE => (2..4) * {11} <: hl) & (6 |-> hl(4) : hl)', |
| 5589 | | '-evalt_rc', 'hl : 1..10 +-> 0..11 & (DL=TRUE => (2..4) * {11} <: hl) & (6 |-> hl(4) : hl) & (DL=FALSE => (3..5) * {11} <: hl) & (6 |-> hl(4) : hl)', |
| 5590 | | '-evalt_rc', 'hl : 1..12 +-> 0..300 & (DL=TRUE => (2..4) * {100} <: hl) & (6 |-> hl(4) : hl) & (DL=FALSE => (3..5) * {11} <: hl) & (6 |-> hl(4) : hl)' |
| 5591 | | ], 'Ensure reified subset test instantiates solution'). |
| 5592 | | cli_testcase(1986, [b_test,cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5593 | | '-evalt_rc', '{b,x,y|({x|->y}: 1..2 +-> 3..4 <=> b=TRUE) & x:0..1 & y:2..3} = {(FALSE|->0|->2),(FALSE|->0|->3),(FALSE|->1|->2),(TRUE|->1|->3)}', |
| 5594 | | '-evalt_rc', '{b,x,y|({x|->y,x+1|->y+1}: 1..2 --> 3..4 <=> b=TRUE) & x:0..1 & y:2..3} = {(FALSE|->0|->2),(FALSE|->0|->3),(FALSE|->1|->2),(TRUE|->1|->3)}', |
| 5595 | | '-evalt_rc', '{b,x,y|({x|->y}: 1..2 +-> 3..4 <=> b=TRUE) & x:0..1 & y:2..3} = {(FALSE|->0|->2),(FALSE|->0|->3),(FALSE|->1|->2),(TRUE|->1|->3)}', |
| 5596 | | '-evalt_rc', '{b,x,y|({x|->y}: 1..2 +-> 3..4 <=> b=TRUE) & x:0..1 & y:2..3} = {(FALSE|->0|->2),(FALSE|->0|->3),(FALSE|->1|->2),(TRUE|->1|->3)}', |
| 5597 | | '-evalt_rc', '{b,x,y|({x|->y}: 1..3 +-> 3..4 <=> b=TRUE) & x:0..1 & y:2..3} = {(FALSE|->0|->2),(FALSE|->0|->3),(FALSE|->1|->2),(TRUE|->1|->3)}', |
| 5598 | | '-evalt_rc', '{b,x,y|({x|->y}: 1..3 --> 3..4 <=> b=TRUE) & x:0..1 & y:2..3} = {(FALSE|->0|->2),(FALSE|->0|->3),(FALSE|->1|->2),(FALSE|->1|->3)}' |
| 5599 | | ], 'Ensure reification of partial_function works'). |
| 5600 | | cli_testcase(1987, [alloy,cbc_tests], ['../prob_examples/public_examples/Alloy/SimpleTests/sequence_tests.als', '-cbc_sequence', 'run0;run1;run2'], 'Test translation of sequences from Alloy to B.'). |
| 5601 | | cli_testcase(1988, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/TestDoNotEnumerate.mch', '-t', '-assertions'], 'Test DO_NOT_ENUMERATE external function works.'). |
| 5602 | | cli_testcase(1989, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'OPTIMIZE_AST', 'FALSE', |
| 5603 | | '-evalt_rc', ' f = {1|->2,2|->x} & f /: 1..2 -->> 2..3 & x :2..3', |
| 5604 | | '-evalt_rc', '{x| #f.(f = {1|->2,2|->x} & f /: 1..2 -->> 2..3) & x :2..3} = {2}', |
| 5605 | | '-evalt_rc', ' f = {1|->2,x|->x} & f /: 1..2 -->> 2..3 & x :2..4', |
| 5606 | | '-evalt_rc', ' {x|#f.(f = {1|->2,x|->x} & f /: 1..2 -->> 2..3) & x :2..4} = 2..4', |
| 5607 | | '-evalt_rc', ' {x|#f.(f = {1|->2,x|->x+1} & f /: 1..2 -->> 2..3) & x :2..4} = 3..4', |
| 5608 | | '-evalt_rc', ' {x|#f.(f = {1|->2,x|->x+1} & f /: 1..2 -->> 2..4) & x :2..4} = 2..4', |
| 5609 | | '-evalt_rc', ' f = {1|->2,2|->x} & f /: 1..2 >-> 2..4 & x :2..3', |
| 5610 | | '-evalt_rc', ' {x|#f.(f = {1|->2,2|->x} & f /: 1..2 >-> 2..4) & x :2..3} = {2}', |
| 5611 | | '-evalt_rc', ' {x|#f.(f = {1|->3,2|->x} & f /: 1..2 >-> 2..4) & x :2..5} = {3,5}' |
| 5612 | | ], 'Ensure reified total_function test for not total surjection and injection works'). |
| 5613 | | cli_testcase(1990, [strings,external], [ |
| 5614 | | '-evalt_rc', 'size("abc")=3', |
| 5615 | | '-evalt_rc', 'conc(["a","b","c"])= "abc"', |
| 5616 | | '-evalt_rc', 'conc(["a","b","c"])= "a"^"b"^"c"', |
| 5617 | | '-evalt_rc', 'size(conc(["a","b","c"]))= 3', |
| 5618 | | '-evalt_rc', 'size(conc([ [1],[2],[3]]))= size(conc(["a","b","c"]))', |
| 5619 | | '-evalt_rc', 'conc([x,".",y]) = "file.txt"', |
| 5620 | | '-evalt_rc', '{x,y|conc([x,".",y]) = "file.txt"} = {("file","txt")}' |
| 5621 | | ], 'Test conc and size can be applied to STRING literals'). |
| 5622 | | cli_testcase(1991, [b_test,error_checks], |
| 5623 | | ['../prob_examples/public_examples/B/ErrorMachines/InconsistentPROPERTIES.mch', |
| 5624 | | '-p', 'ALLOW_INCOMPLETE_SETUP_CONSTANTS', 'FALSE', |
| 5625 | | '-execute_all', '-expcterr', 'setup_constants_inconsistent'], 'Test inconsistent PROPERTIES detected in execute.'). |
| 5626 | | cli_testcase(1992, [b_test,error_checks], |
| 5627 | | ['../prob_examples/public_examples/B/ErrorMachines/InconsistentPROPERTIES.mch', |
| 5628 | | '-p', 'ALLOW_INCOMPLETE_SETUP_CONSTANTS', 'TRUE', |
| 5629 | | '-execute_all', '-expcterr', 'setup_constants_inconsistent'], 'Test inconsistent PROPERTIES detected in execute with ALLOW_INCOMPLETE_SETUP_CONSTANTS.'). |
| 5630 | | cli_testcase(1993,[alloy],[ |
| 5631 | | '../prob_examples/public_examples/Alloy/SimpleTests/TestUtilInteger.als', |
| 5632 | | '-strict', '-t', '-p', 'ALLOY_STRICT_INTEGERS', 'FALSE' |
| 5633 | | ], 'Check Alloy translation without strict integers'). |
| 5634 | | cli_testcase(1994, [cbc,smt,chr], [ |
| 5635 | | '../prob_examples/public_examples/Eval/smtlib_trans_for_z3/z3_pow.smt2', |
| 5636 | | '../prob_examples/public_examples/Eval/smtlib_trans_for_z3/z3_knights_knaves.smt2', |
| 5637 | | '-p', 'SMTLIB_BOOL_ARRAYS_TO_SETS', 'TRUE', |
| 5638 | | '-p', 'SMTLIB_PREPROCESS', 'TRUE', |
| 5639 | | '-p', 'CHR', 'TRUE', '-p', 'SMT', 'TRUE'], 'Test SMT interface and solving'). |
| 5640 | | cli_testcase(1995, [b_test], [ |
| 5641 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5642 | | '-evalt_rc', '([1,2] ; %x.(x:NATURAL|x+2) ; %y.(y:NATURAL|bool(y>3)) ; {TRUE|->"true", FALSE |-> "false"})(2) = "true"', |
| 5643 | | '-evalt_rc', '([1,2] ; %x.(x:NATURAL|x+2) ; (%y.(y:NATURAL|bool(y>3)) ; {TRUE|->"true", FALSE |-> "false"}))(2) = "true"', |
| 5644 | | '-evalt_rc', '([1,2] ; %x.(x:NATURAL|x+2) ; %y.(y:NATURAL|bool(y>3)) ; {TRUE|->"true", FALSE |-> "false"})(1) = "false"', |
| 5645 | | '-evalt_rc', ' ([1,2] ; %x.(x:NATURAL|x+2) ; %y.(y:NATURAL|bool(y>3)))(2)=TRUE', |
| 5646 | | '-evalt_rc', '([1,2,3] ; %x.(x:NATURAL|x+2) ; %y.(y:NATURAL|y*2))(2) = 8' |
| 5647 | | ], 'Test relational composition ast cleanup rewrites'). |
| 5648 | | cli_testcase(1996, [laws,strings,external], ['stdlib/AssertionsForLibraries.mch', '-assertions', '-strict'], 'Assertions for external functions'). % for LibraryMath, LibraryStrings |
| 5649 | | |
| 5650 | | cli_testcase(1997, [private,data_validation], ['../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori.mch', '-animate_all', '-strict', '-cc', 97, 96, '-p', 'TIME_OUT', 28000, '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-his', '../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori.his', |
| 5651 | | '-p', 'DATA_VALIDATION', 'TRUE'], 'Rule Test 1 of Alstom compilation project (test 981) with DATA_VALIDATION'). |
| 5652 | | cli_testcase(1998, [private,data_validation,siemens,closure1], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_inv_cv_sui_v2.mch','-strict', |
| 5653 | | '-p','CLPFD', 'TRUE', |
| 5654 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5655 | | '-aa', 61, 2, 0, % was '-aa', 62, 1, 0, for pas_as_env_inv_cv_sui.mch with prior closure(.) definition |
| 5656 | | '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 25000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test 799 with DATA_VALIDATION.'). |
| 5657 | | cli_testcase(1999, [private,data_validation,siemens,closure1], ['../prob_examples/examples/B/Siemens/CBTC_Sol_Line4_SaoPaulo/pas_as_env_inv_cv_sui_v2.mch','-strict', |
| 5658 | | '-p','CLPFD', 'FALSE', |
| 5659 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5660 | | '-aa', 61, 2, 0, % was '-aa', 62, 1, 0, for pas_as_env_inv_cv_sui.mch with prior closure(.) definition |
| 5661 | | '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 25000, '-p', 'WARN_IF_DEFINITION_HIDES_VARIABLE', 'FALSE','-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test 799 with DATA_VALIDATION and CLPFD FALSE.'). |
| 5662 | | cli_testcase(2000, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/07_001.mch', |
| 5663 | | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'TIME_OUT', 9500, |
| 5664 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5665 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Test 1161/1890 with DATA_VALIDATION'). |
| 5666 | | cli_testcase(2001, [b_test,hash], [ |
| 5667 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', |
| 5668 | | '-machine_statistics', '-machine_files', |
| 5669 | | '-machine_hash', |
| 5670 | | '-machine_hash_check', '5f2171aad61098a8bff85cc09ea09f9ad8b72c8a', |
| 5671 | | % before avoiding duplicate removed_typing: 'db72de00b9638c148db966df68d234226261418e', |
| 5672 | | % before avoiding duplicate nodeid entries in info field for conjunct/1: 'ff47205b5011f1e35f75002b2d2fc115d3d9aff1', |
| 5673 | | % before flat conjunct term format (parser 2.9.31): 'aab862683ad0396cce6178d6a3fe024be7504866', |
| 5674 | | % before new parser pos infos: '749253625ce2e799e722ab57631d67859e7f0774', |
| 5675 | | % before removing if_elsif position infos: '5159c4e2368c5be7b393a588434b86dc8588fedb', |
| 5676 | | % before removing nodeid(none): '9644995ace8f8f24e2ac48d026503b1e4ed4520c', 3/3/2021 |
| 5677 | | % before fixing computation of reads info for SELECT: '0612a27195f445d314bdd5f7cc8de5ef91c91577', |
| 5678 | | % before adding meta about header positions: '841add099ffe2d4c2f049649586f0c4013417af0', |
| 5679 | | '-strict'], 'Test machine information commands'). |
| 5680 | | cli_testcase(2002,[private_source_not_available],[ |
| 5681 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 5682 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5683 | | '../private_examples/ClearSy/2020/01_Jan/regressions2/rule_Regle_Transverse_Variable_Q_DIR/rule.mch', |
| 5684 | | '-execute_all', '-silent', |
| 5685 | | '-execute_expect_steps', 6, |
| 5686 | | '-evalt', 'caval__rule__1__done=TRUE & caval__rule__2__done=TRUE & caval__rule__3__done=TRUE & caval__rule__4__done=TRUE', |
| 5687 | | '-evalt', 'card(caval__rule__1__ALL) = 1187 & card(caval__rule__4__ALL) = 180' |
| 5688 | | ], 'Ensure useless existentially quantified variable (value) does not perturb enumeration'). |
| 5689 | | cli_testcase(2003,[private_source_not_available],[ |
| 5690 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 5691 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5692 | | '../private_examples/ClearSy/2020/01_Jan/ticket_record_typing/ruleERR_missingdata.mch', |
| 5693 | | '-execute_all', |
| 5694 | | '-execute_expect_steps', 3, '-silent', |
| 5695 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 5696 | | '-evalt', 'caval__rule__1__ALL={({("FINAL_GEIF__id1"|->1|->"eq11"|->"eq11"|->1|->"aa")}|->FALSE),({("FINAL_GEIF__id1"|->1|->"eq21"|->"eq21"|->1|->"aa")}|->FALSE),({("FINAL_GEIF__id1"|->2|->"A_equ2__tst2"|->"A_equ2__tst2"|->2|->"aa")}|->FALSE),({("FINAL_GEIF__id2"|->3|->"A_equ2__tst1"|->"A_equ2__tst1"|->3|->"aa")}|->FALSE),({("FINAL_GEIF__id2"|->4|->"A_equ2__tst2"|->"A_equ2__tst1"|->4|->"aa")}|->FALSE)}' |
| 5697 | | ], 'Ensure problem with type checker and wrongly sorted record fields solved'). |
| 5698 | | cli_testcase(2004,[private_source_not_available],[ |
| 5699 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 5700 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5701 | | '../private_examples/ClearSy/2020/01_Jan/ticket_record_typing/ruleOK_noExpectedName.mch', |
| 5702 | | '-execute_all', '-execute_expect_steps', 3, |
| 5703 | | '-silent', |
| 5704 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 5705 | | '-evalt', 'caval__rule__1__ALL={({("FINAL_GEIF__id1"|->1|->"eq11"|->1|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id1"|->1|->"eq21"|->1|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id1"|->2|->"A_equ2__tst2"|->2|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id2"|->3|->"A_equ2__tst1"|->3|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id2"|->4|->"A_equ2__tst2"|->4|->"{1,2,3,4}")}|->FALSE)} ' |
| 5706 | | ], 'Variation of test 2003 with file which did not exhibit initial problem'). |
| 5707 | | cli_testcase(2005,[tickets,records],[ |
| 5708 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5709 | | '../prob_examples/public_examples/B/Tester/RecordInDefinitions.mch', |
| 5710 | | '-mc', '10', '-assertions' |
| 5711 | | ], 'Ensure problem with type checker and wrongly sorted record fields solved'). |
| 5712 | | cli_testcase(2006,[tickets],[ |
| 5713 | | '../prob_examples/public_examples/B/Tickets/Vu_Inclusion/BError_1.mch', |
| 5714 | | '-init' |
| 5715 | | ], 'Check no variable clash in machine inclusion'). |
| 5716 | | cli_testcase(2007,[private_source_not_available],[ |
| 5717 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 5718 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 5719 | | '../private_examples/ClearSy/2020/01_Jan/memory/Debug__2486__INF/rule_OPS_SDS_2486/rule.mch', |
| 5720 | | '../private_examples/ClearSy/2020/01_Jan/memory/Debug__2486__TO_STRING/rule_OPS_SDS_2486/rule.mch', |
| 5721 | | '-execute_all', '-silent', |
| 5722 | | '-evalt', 'caval__rule__1__done=TRUE & caval__rule__2__done=TRUE & caval__rule__3__done=TRUE' |
| 5723 | | ], 'Test infinite loop in instantiated_enough for filter_cannot_match in b_compiler solved'). |
| 5724 | | cli_testcase(2008, [cbc,wd,sequences,strings], ['-p', 'STRING_AS_SEQUENCE', 'TRUE', |
| 5725 | | '-evalt', 'rev("ab")="ba"', |
| 5726 | | '-evalt', '{"abc","aba","a",""} = a & {x|x:a & x=rev(x)} = {"","a","aba"}', |
| 5727 | | '-evalt', 'rev("a" ^ "b" ^ "c") = "cba"', |
| 5728 | | '-evalt', 'rev(conc(["a" , "b" , "c"])) = "cba"' |
| 5729 | | ], 'Check rev operator works on strings'). |
| 5730 | | cli_testcase(2009, [b_test,card,sequences], ['-p', 'CLPFD', 'TRUE', |
| 5731 | | '-evalt', '/*@symbolic */ {x|x:seq(0..1) & card(x)>5} /= /*@symbolic */ {x|x:seq(0..1) & card(x)>5 & card(x) /= 10}', |
| 5732 | | '-evalt', '/*@symbolic */ {x|x:seq(0..1) & card(x)>5} /= /*@symbolic */ {x|x:seq(0..1) & card(x)>6}', |
| 5733 | | '-evalt', '/*@symbolic */ {x|x:seq(0..1) & card(x)>5} /= /*@symbolic */ {x|x:seq(0..2) & card(x)>5}' |
| 5734 | | ],'Check symbolic treatment works'). % also works without /*@symbolic */ |
| 5735 | | cli_testcase(2010,[cbc],[ |
| 5736 | | '../prob_examples/public_examples/B/Mathematical/DominatingSets/TestSolverStrength_DomBV.mch', |
| 5737 | | '-init', '-p', 'TIME_OUT', 7500 % Linux Gitlab runners seem considerably slower than MacBook here |
| 5738 | | ], 'Check SOLVER_STRENGTH used for reification'). |
| 5739 | | cli_testcase(2011, [cbc,tickets], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5740 | | '-evalt', '{Knights,Knaves| Knights \\/ Knaves = All & Knights /\\ Knaves = {} & (1:Knights <=> (2:Knaves or 3:Knaves)) & (2:Knights <=> 1:Knights)}=Res & All=1..3 & Res = {({1,2}|->{3})}', |
| 5741 | | '-evalt', 'Knights \\/ Knaves = All & Knights /\\ Knaves = {} & (1:Knights <=> (2:Knaves or 3:Knaves)) & (2:Knights <=> 1:Knights)', |
| 5742 | | '-evalt', '{ck,Knights,Knaves| ck=card(Knights) & Knights \\/ Knaves = All & Knights /\\ Knaves = {} & (1:Knights <=> (2:Knaves or 3:Knaves)) & (2:Knights <=> 1:Knights)}=Res & All=1..3 & Res = {(2|->{1,2}|->{3})}' |
| 5743 | | ], 'Test would produce set lists with repeated entries'). |
| 5744 | | cli_testcase(2012,[cbc],[ |
| 5745 | | '../prob_examples/public_examples/B/PerformanceTests/Generated/Assertions/GenAssertions1000.mch', |
| 5746 | | '../prob_examples/public_examples/B/PerformanceTests/Generated/Assertions/GenPowAssertions1000.mch', |
| 5747 | | '-p', 'DOUBLE_EVALUATION', 'TRUE', |
| 5748 | | '-init', '-assertions' |
| 5749 | | ], 'Check generated assertions all solvable'). |
| 5750 | | cli_testcase(2013,[cbc],[ |
| 5751 | | '../prob_examples/public_examples/B/PerformanceTests/SAT_Tests/ReificationCompTests.mch', |
| 5752 | | '-t' |
| 5753 | | ], 'Check reification with function applications work'). |
| 5754 | | cli_testcase(2014, [private,data_validation,pragmas], ['../prob_examples/examples/B/Systerel/C578/2013/machines_06092013/T_032_002_pragmas.mch', |
| 5755 | | '-init' ,'-aa', 0,1,0, '-p', 'SYMBOLIC', 'FALSE', '-p', 'TIME_OUT', 7500, '-p', 'CLPFD', 'TRUE', |
| 5756 | | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Test 1146 with SYMBOLIC FALSE'). |
| 5757 | | cli_testcase(2015,[private_source_not_available],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 5758 | | '../private_examples/ClearSy/2020/02_Feb/well-def2/rule_OK.mch', |
| 5759 | | '-execute_all', '-silent', |
| 5760 | | '-evalt', 'caval__rule__1__done=TRUE & caval__rule__2__done=TRUE & caval__rule__3__done=TRUE & caval__rule__4__done=TRUE', |
| 5761 | | '-evalt', 'caval__rule__4__ALL = {({}|->36|->TRUE),({}|->114|->TRUE),({("DVP_OK_paquet_commutable.xls"|->"MSG_P_SI11_MA_SI11-SI21-S"|->"P_SI11_E1"|->444)}|->132|->FALSE)}' |
| 5762 | | ], 'Test idle waitflag not variable issue in exists solved'). |
| 5763 | | cli_testcase(2016, [codespeed], ['-version', '-cpp-version'], 'Just check startup time'). |
| 5764 | | cli_testcase(2017,[wd],[ |
| 5765 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/testPowerWD_ctx.eventb', |
| 5766 | | '-init', '-expcterr', well_definedness_error, '-expcterr', setup_constants_fails, |
| 5767 | | '-opterr', 'setup_constants_unknown' %% ?? or unknown ??? |
| 5768 | | ], 'Test WD error for power_of with negative base found'). |
| 5769 | | cli_testcase(2018,[wd,wd_prover],[ |
| 5770 | | '-evalt', ':wd x = 10/2', |
| 5771 | | '-evalf', ':wd x = 10/0', |
| 5772 | | '-evalt', ':wd a>0 & x>0 & x:1..10 & f:1..10-->INTEGER & f(x)=2 & x>1', |
| 5773 | | '-evalt', ':wd z:2..8 & f=%x.(x:2..10|x) & y=f(z)', |
| 5774 | | '-evalt', ':wd x:2..4 & f=%x.(x:1..8|x) & r=f(x)', |
| 5775 | | '-evalt', ':wd %x.(x:2..8 | %x.(x:2..8|10/3)(x)) = x', |
| 5776 | | '-evalt', ':wd %x.(x:2..8 | %x.(x:2..8|10/x)(x)) = x', |
| 5777 | | '-evalt', ':wd x:NATURAL1 & y:NATURAL1 & x mod y = x/y', |
| 5778 | | '-evalt', ':wd x:NAT1 & y:1..MAXINT & x mod y = x/y', |
| 5779 | | '-evalt', ':wd s:perm(1..10) & f=s(1)', |
| 5780 | | '-evalf', ':wd s:perm(1..10) & f=s(0)', |
| 5781 | | '-evalf', ':wd s:perm(1..10) & f=s(11)', |
| 5782 | | '-evalt', ':wd s:perm(1..10) & x:dom(s) & s2:perm(1..10) & s2(x)=res', |
| 5783 | | '-evalt', ':wd x:iseq(BOOL) & size(x) = 1', |
| 5784 | | '-evalt', ':wd x:POW(1..2) & card(x)=1', |
| 5785 | | '-evalt', ':wd x:FIN(NATURAL1) & card(x)=1', |
| 5786 | | '-evalt', ':wd card(iseq(BOOL))=r', |
| 5787 | | '-evalf', ':wd card(seq(BOOL))=r', |
| 5788 | | '-evalt', ':wd x:seq(NATURAL) & card(x)=2', |
| 5789 | | '-evalt', ':wd x:seq(NATURAL1) & size(x)=2', |
| 5790 | | '-evalt', ':wd size([1,2,x])=3', |
| 5791 | | '-evalt', ':wd x={} & card(x)=0 & 1:x', |
| 5792 | | '-evalt', ':wd size([1,2,4])=3', |
| 5793 | | '-evalt', ':wd first(x->[2])=1', |
| 5794 | | '-evalt', ':wd first(rev([1,2,3])) = 1', |
| 5795 | | '-evalt', ':wd y:iseq(1..2) & first(y^rev([1,2,3])) >1', |
| 5796 | | '-evalt', ':wd conc([[1] , [2]]) = res', |
| 5797 | | '-evalt', ':wd first([1,2,3])=res', |
| 5798 | | '-evalt', ':wd [1,2,3] /|\\ 2 = res', |
| 5799 | | '-evalt', ':wd f = aGraph*{[]} & g:aGraph & f(g)=[2] & aGraph<:BOOL', |
| 5800 | | '-evalt', ':wd f: BOOL +-> seq(INTEGER) & f = aGraph*{[]} & g:aGraph & f(g)=[2]', |
| 5801 | | '-evalt', ':wd x:NATURAL1 & y>=x & x mod y = x/y', |
| 5802 | | '-evalt', ':wd f : NATURAL1 --> INTEGER & x>2 & res=f(x)', |
| 5803 | | '-evalt', ':wd x/={} & inter(x)={1}', |
| 5804 | | '-evalt', ':wd f = %(p1,z1).(p1:A & z1:A|p1+z1) & A <: INTEGER & g: INTEGER +-> A & 1:dom(g) & res = f(g(1),g(1))', |
| 5805 | | '-evalt', ':wd SIGMA(x).(x:1..10|x) =res', |
| 5806 | | '-evalt', ':wd x:1..10 & f:1..10 --> BOOL & r=f(x)', |
| 5807 | | '-evalf', ':wd x:1..10 & f:2..10 --> BOOL & r=f(x)', |
| 5808 | | '-evalt', ':wd x=0 or res=10/x', |
| 5809 | | '-evalt', ':wd f : NATURAL1 --> NATURAL1 & x>2 & res=f( f(x) )', |
| 5810 | | '-evalt', ':wd f : NATURAL --> NATURAL1 & x>2 & res=f( f(x) )', |
| 5811 | | '-evalt', ':wd f : INTEGER --> NATURAL1 & x>2 & res=f( f(x) )', |
| 5812 | | '-evalf', ':wd f : NATURAL1 --> NATURAL & x>2 & res=f( f(x) )', |
| 5813 | | '-evalt', ':wd f: 1..10 --> BOOL & card(S <| f)=9 & card(f <+ {x|->TRUE})=10 & card(S2 <<| f)=0 & card(f|>{TRUE})=0', |
| 5814 | | '-evalt', ':wd f: 1..10 -->BOOL & res = (f <+ {11 |-> TRUE})(10)', |
| 5815 | | '-evalf', ':wd f: 1..10 -->BOOL & res = (f <+ {11 |-> TRUE})(0)', |
| 5816 | | '-evalt', ':wd f : 1..n --> BOOL & n=3 & f(3)=TRUE', |
| 5817 | | '-evalt', ':wd f : {1,3,5,7,9} --> {1,3,5,7,9} & f(5)=3', |
| 5818 | | '-evalt', ':wd f : {a,b} --> {1,3,5,7,9} & f(a)=3 & a:INTEGER', |
| 5819 | | '-evalt', ':wd teamr : 1..11 >-> 1..22 & pp:ran(teamr) & res=teamr~(pp)', |
| 5820 | | '-evalt', ':wd teamr : 1..11 >-> 1..22 & pp:ran(teamr) & res=teamr(teamr~(pp))', |
| 5821 | | '-evalt', ':wd card( { tr | tr: 1..NRTrains & tr : other}) = 1', |
| 5822 | | '-evalt', ':wd S <: NATURAL1 & f : S >+> S & pl : ran(f) & vps : S --> 0..mx & res=vps(pl)', |
| 5823 | | '-evalt', ':wd S <: NATURAL1 & f : S >+> S & pl : dom(f) & vps : S --> 0..mx & res=vps(pl)', |
| 5824 | | '-evalt', ':wd a:iseq(BOOL) & x:dom(a) & r=10/x', |
| 5825 | | '-evalt', ':wd a:INTEGER+->NATURAL1 & x:ran(a) & r=10/x', |
| 5826 | | '-evalf', ':wd a:INTEGER+->NATURAL1 & x:dom(a) & r=10/x', |
| 5827 | | '-evalf', ':wd a:INTEGER+->z..y & x:ran(a) & r=10/x', |
| 5828 | | '-evalf', ':wd a:INTEGER+->x..y & x:ran(a) & r=10/x', |
| 5829 | | '-evalt', ':wd S_ESPC <: NAT & aspect_pi : S_ESPC --> INT & S_ESPC = {PL02,PL04} & res = aspect_pi (PL02)', |
| 5830 | | '-evalt', ':wd a:1..10 & b:2..20 & f: (1..10)*(2..40) --> BOOL & f(a|->b)=TRUE', |
| 5831 | | '-evalt', ':wd a:1..10 & b:2..20 & f: (1..10) --> ((2..40) --> BOOL) & f(a)(b)=TRUE', |
| 5832 | | '-evalt', ':wd x:FIN(x) & x<:INTEGER & card(x)=10', |
| 5833 | | '-evalt', ':wd x:FIN(x) & x<:INTEGER & y <: x & card(y)=10', |
| 5834 | | '-evalt', ':wd x:FIN(x) & x<:INTEGER & y <<: x & card(y)=10', |
| 5835 | | '-evalt', ':wd f:NATURAL1 --> NATURAL1 & a:NATURAL1 & b:NATURAL & f(a)=c & f(b+1)=c', %% PP runs forever |
| 5836 | | '-evalt', ':wd f:NATURAL1 --> NATURAL1 & a:NATURAL1 & b:NATURAL & 10 / f(a) = 10 / a & 10 / f(b+1) = 10 / (b+1)', %% PP runs forever |
| 5837 | | '-evalt', ':wd f:NATURAL1 --> NATURAL1 & a:NATURAL1 & b:NATURAL & max({a,b,c})=c', |
| 5838 | | '-evalt', ':wd f:NATURAL1 --> NATURAL1 & a:NATURAL1 & b:NATURAL & c>a & max(a..c)=c', |
| 5839 | | '-evalt', ':wd g:a..c --> NATURAL1 & a:NATURAL1 & b:NATURAL & c>a & g(a)=g(c)', |
| 5840 | | '-evalt', ':wd a:NATURAL1 & b:NATURAL & c>a & s <: {a,b,c} & card(s)=3', |
| 5841 | | '-evalt', ':wd %x.(x:2..4 | %x.(x:4..8|10/x)(2*x)) = x', |
| 5842 | | '-evalf', ':wd %x.(x:2..4 | %x.(x:4..7|10/x)(2*x)) = x', |
| 5843 | | '-evalf', ':wd %x.(x:2..4 | %x.(x:5..8|10/x)(2*x)) = x', |
| 5844 | | '-evalt', ':wd x:1..10 & f:1..100 --> INT & f(9*x+10)=res', |
| 5845 | | '-evalt', ':wd x:1..10 & f:1..99 --> INT & f(9*x+9)=res', |
| 5846 | | '-evalf', ':wd x:1..10 & f:1..99 --> INT & f(9*x+10)=res', |
| 5847 | | '-evalt', ':wd x:10..109 & f:1..10 --> INT & f(x/10)=res', |
| 5848 | | '-evalf', ':wd x:9..109 & f:1..10 --> INT & f(x/10)=res', |
| 5849 | | '-evalf', ':wd x:10..110 & f:1..10 --> INT & f(x/10)=res', |
| 5850 | | '-evalt', ':wd a : 1 .. sz --> INTEGER & p : perm(dom(a)) & i : 1 .. sz - 1 & res= p(i)', |
| 5851 | | '-evalt', ':wd a : 1 .. sz --> INTEGER & sz=5 & p : perm(dom(a)) & i : 1 .. sz - 1 & res= p(i)', |
| 5852 | | '-evalt', ':wd ff: BOOL <-> BOOL & x:dom(ff) & fnc(ff)(x) = res', |
| 5853 | | '-evalt', ':wd y /=0 & res = x/-y', |
| 5854 | | '-evalt', ':wd x>0 & (y>=0 & z>=0 => (x**(y*z) = (x**y)**z))', |
| 5855 | | '-evalt', ':wd (y>=0 & z>=0 & x:INTEGER => (x**(y+z) = x**y * x**z)) ', |
| 5856 | | '-evalt', ':wd card(perm(1..10)) > 10 & card({x,y|x:1..22 & y=x}) = 22 & card({x,y|x<:1..10 & y=x}) = 1024', |
| 5857 | | '-evalf', ':wd card({x,y|x:INTEGER & y=x})> 0', |
| 5858 | | '-evalt', ':wd {n| #x.(x<:(BOOL*BOOL*BOOL) & card(x)=n)} = 0..8', |
| 5859 | | '-evalt', ':wd x<:INTEGER & {n| #x.(x<:(BOOL*BOOL*BOOL) & card(x)=n)} = 0..8', |
| 5860 | | '-evalf', ':wd x<:BOOL & {n| #x.(x<:(BOOL*INTEGER*BOOL) & card(x)=n)} = 0..8', |
| 5861 | | '-evalt', ':wd tail( %x.(x:1..10|TRUE) )=res', |
| 5862 | | '-evalf', ':wd tail( %x.(x:1..yy|TRUE) )=res', |
| 5863 | | '-evalt', ':wd card({rr|rr:BOOL<->BOOL & closure1(rr)=rr}) =res', |
| 5864 | | '-evalt', ':wd r={TRUE|->FALSE} & card({y,x|x|->y:r})=c', |
| 5865 | | '-evalt', ':wd card({rr|rr:BOOL+->BOOL & closure1(rr)=rr}) =res', |
| 5866 | | %'-evalt', ':wd f = {x,y|x<:1..10 & y=x} & res = f((1..2))', |
| 5867 | | %'-evalt', ':wd f = {x,y|x<:1..10 & y=x} & res = f({1,10})', |
| 5868 | | '-evalt', ':wd r=[1,11,111] & card({y,x|x|->y:r}) = s', |
| 5869 | | '-evalt', ':wd r = [1,11,11] & card(r~[{11}])=1', |
| 5870 | | '-evalt', ':wd r = pred & card(r[1..10])=10', |
| 5871 | | '-evalt', ':wd x={1|->11,3|->33,5|->55,7|->77,9|->99,100000|->0} & y:dom(x) & res= x(y)', |
| 5872 | | '-evalt', ':wd x={1|->rec(d:11),3|->rec(d:33),100000|->rec(d:0)} & y:dom(x) & res= x(y)', |
| 5873 | | '-evalt', ':wd f={1|->x, 3|->y} & 11=f(1)', |
| 5874 | | '-evalt', ':wd x:1..n-->BOOL & !i.(i:1..(n-2) => (x(i)=TRUE <=> (x(i+1)=FALSE & x(i+2)=FALSE)))', |
| 5875 | | '-evalt', ':wd s1 |-> s2 : {(1,2),(2,3),(3,5)} & [0,100,200,300,400,500,600,700](s1) = res', |
| 5876 | | '-evalt', ':wd s1 |-> s2 : {(1,2),(2,3),(3,5)}~ & [0,100,200,300,400,500,600,700](s2) = res', |
| 5877 | | '-evalt', ':wd s2 : ran({(1,2),(2,3),(3,5)}) & [0,100,200,300,400,500,600,700](s2) = res', |
| 5878 | | '-evalt', ':wd i5 = %x.(x>10|100+x) & 100:dom(i5) & res=i5(100)', |
| 5879 | | '-evalf', ':wd i5 = %x.(x>10|100+x) & 11:dom(i5) & res=i5(10)', |
| 5880 | | '-evalt', ':wd card(struct(f1:1..2,f2:1..2))=res', |
| 5881 | | '-evalf', ':wd card(struct(f1:1..2,f2:NATURAL))=res', |
| 5882 | | '-evalt', ':wd target = [2,1,1,2,1] & n=size(target) & i:1..n & target(i)=res', |
| 5883 | | '-evalf', ':wd target = [2,1,1,2,1] & n=size(target) & i:1..n & target(i+1)=res', |
| 5884 | | '-evalf', ':wd target = [2,1,1,2,1] & n=size(target) & i:0..n & target(i)=res', |
| 5885 | | '-evalt', ':wd Right:seq(BOOL) & (Right/=[] => tail(Right)=res)', |
| 5886 | | '-evalt', ':wd Right:seq(BOOL) & (Right<-FALSE)(1)=cur', |
| 5887 | | '-evalt', ':wd ds : (POW(INTEGER)*seq(BOOL)) --> POW(INTEGER) & res=ds(cur,[input])', |
| 5888 | | '-evalt', ':wd K : seq(BOOL) <-> seq(BOOL) & ix|->iy:K & res= ix^iy', |
| 5889 | | '-evalt', ':wd arr : 1 .. n --> BOOL & j : 1 .. n - 1 & i=j & i2=i+1 & arr(i2)=res', |
| 5890 | | '-evalf', ':wd f: BOOL --> 1..10 & g : 2..20 --> BOOL & bb:BOOL & (f;g)(bb)=res', |
| 5891 | | '-evalt', ':wd f: BOOL --> 1..10 & g : 0..20 --> BOOL & bb:BOOL & (f;g)(bb)=res', |
| 5892 | | '-evalt', ':wd f: BOOL --> 1..10 & g : 0..20 --> BOOL & bb:BOOL & fg = (f;g) & (fg)(bb)=res', |
| 5893 | | '-evalt', ':wd f: BOOL --> 1..10 & g : 0..20 --> 8..16 & bb:BOOL & g(((f;g))(bb))=res', |
| 5894 | | '-evalt', ':wd f: BOOL --> 1..10 & g : 0..20 --> 8..16 & bb:BOOL & fg = (f;g) & g((fg)(bb))=res', |
| 5895 | | '-evalt', ':wd max({1} \\/ (1..100 /\\ {x|x>2 & x<2}))=res', |
| 5896 | | '-evalf', ':wd max((1..100 /\\ {x|x>2 & x<2}))=res', |
| 5897 | | '-evalt', ':wd iv:seq(BOOL) & size(iv)>0 & res=first(iv)', |
| 5898 | | '-evalt', ':wd iv:seq(INT) & size(iv)>=1 & res=first(iv)', |
| 5899 | | '-evalt', ':wd iv:seq(NAT) & card(iv)>=1 & res=first(iv)', |
| 5900 | | '-evalf', ':wd iv:seq(INT) & size(iv)>=0 & res=first(iv)', |
| 5901 | | '-evalt', ':wd iv:seq(NATURAL1) & size(iv)>x & x>=1 & res=first(iv)', |
| 5902 | | % '-evalt', ':wd iv:seq(NATURAL1) & b:seq(BOOL) & size(iv)>size(b) & res=first(iv)', |
| 5903 | | '-evalt', ':wd iv:seq(NATURAL1) & b:seq(BOOL) & size(iv)>size(b) & size(b) > 0 & res=first(iv)', |
| 5904 | | '-evalt', ':wd iv:seq(NATURAL1) & b:seq(BOOL) & size(iv)>size(b) & card(b) > 0 & res=first(iv)', |
| 5905 | | '-evalt', ':wd iv:seq(NATURAL1) & b:seq(BOOL) & size(iv)>size(b) & b /= {} & res=first(iv)', |
| 5906 | | '-evalt', ':wd ff:seq(BOOL) & (ff/=<> => (first(ff) = last(rev(ff)) & last(ff) = first(rev(ff))))', |
| 5907 | | '-evalt', ':wd ff:seq(BOOL) & card(ff^ff) > card(rev(ff))', |
| 5908 | | '-evalt', ':wd ff:seq1(INT) & x=max(ran((ff)))', |
| 5909 | | '-evalt', ':wd ff:seq1(INT) & x=max(ran(rev(ff)))', |
| 5910 | | '-evalt', ':wd ff:seq1(INT) & x=max(ran(ff^ff))', |
| 5911 | | '-evalt', ':wd ff: 1..10 --> INT & m = max(ran(ff))', |
| 5912 | | '-evalf', ':wd ff: 1..10 +-> INT & m = max(ran(ff))', |
| 5913 | | '-evalt', ':wd ff:seq(BOOL) & xx:1..(size(ff)) => (( (ff/|\\xx)/\\(ff\\|/xx) ) = <> )', |
| 5914 | | '-evalt', ':wd ff:seq(BOOL) & xx:NAT1 & xx:1..(size(ff)) => (( (ff/|\\xx)/\\(ff\\|/xx) ) = <> )', |
| 5915 | | '-evalt', ':wd f:1..10 --> BOOL & x:NATURAL1 & x<11 & res=f(x)', |
| 5916 | | '-evalt', ':wd f:1..10 --> BOOL & x:NATURAL1 & x<=card(f) & res=f(x)', |
| 5917 | | '-evalt', ':wd f:1..10 --> BOOL & x:NAT1 & x<11 & res=f(x)', |
| 5918 | | '-evalt', ':wd f:1..10 --> BOOL & x:NAT1 & x<size(f) & res=f(x)', |
| 5919 | | '-evalt', ':wd f:1..10 --> BOOL & x:NAT1 & x<card(f) & res=f(x)', |
| 5920 | | '-evalt', ':wd min(NAT1)=1 & min(NAT)=0 & max(NAT)=maxint', |
| 5921 | | '-evalt', ':wd ff:seq1(BOOL) => (first(ff)=ff(1) & last(ff) = ff(size(ff)))', |
| 5922 | | '-evalt', ':wd s:seq(BOOL) & i:NATURAL1 & i<= size(s) & res=s(i)', |
| 5923 | | '-evalt', ':wd s:seq(BOOL) & j:NATURAL1 & i>j & i<= size(s) & res=s(i)', |
| 5924 | | '-evalt', ':wd (IF y>0 THEN [1] ELSE [2] END)^[3] = x', |
| 5925 | | '-evalt', ':wd (IF y>0 THEN [1] ELSE [2] END)^[3,4] = x', |
| 5926 | | '-evalt', ':wd first(IF y>0 THEN [1] ELSE [2] END) = x', |
| 5927 | | '-evalt', ':wd y:seq(INT) & r=tail(IF x<0 THEN [0] ELSE [x] END^y)', |
| 5928 | | '-evalt', ':wd yy:1..9 & xx<yy & r=1/(10-xx)', |
| 5929 | | '-evalt', ':wd yy:1..10 & xx<yy & r=1/(10-xx)', % requires to store < in hyps |
| 5930 | | '-evalt', ':wd yy:1..10 & yy>xx & r=1/(10-xx)', % ditto |
| 5931 | | '-evalf', ':wd yy:1..10 & xx<=yy & r=1/(10-xx)', |
| 5932 | | '-evalt', ':wd ts = [TRUE,FALSE,TRUE] & t={1,3,5} & i:1..card(t) & res=ts(i)', |
| 5933 | | '-evalt', ':wd ts = [TRUE,FALSE,TRUE] & t={1,3,5} & i:0..card(t)-1 & res=ts(i+1)', |
| 5934 | | '-evalt', ':wd d=1..n & a:d --> 1..100 & d /= {} & res=max(d)', |
| 5935 | | '-evalt', ':wd a:1..n --> 1..100 & 1..n /= {} & res=a(1)', |
| 5936 | | '-evalt', ':wd d=1..n & a:d --> 1..100 & d /= {} & res=a(1)', |
| 5937 | | '-evalt', ':wd d=1..n & a:d --> 1..100 & d /= {} & res=a(n)', |
| 5938 | | '-evalt', ':wd g : 1 .. n >-> NATURAL & k:1..n & j:k..n & n>k & j>=k & res = min(g[k..j])', |
| 5939 | | '-evalt', ':wd f : i..j --> BOOL & x:i..j & res=f(i)', |
| 5940 | | '-evalt', ':wd g : 1 .. n >-> NATURAL & k:1..n & j:k..n & res = min(g[k..j])', |
| 5941 | | '-evalt', ':wd j : k .. n & ll : k .. j & g : 1 .. n >-> NATURAL & k : 1 .. n & ll:NATURAL & res = g(ll)', |
| 5942 | | '-evalt', ':wd j:1..k & f:1..k --> BOOL & j/=k & res=f(j+1)', |
| 5943 | | '-evalt', ':wd j:1..k & f:1..k --> BOOL & j/=1 & res=f(j-1)', |
| 5944 | | '-evalt', ':wd f: 1..10 +-> BOOL & 1..9 <: dom(f) & res=f(1)', |
| 5945 | | '-evalt', ':wd f: 1..10 +-> BOOL & !x.(x:1..9 => x:dom(f)) & res=f(1)', |
| 5946 | | '-evalf', ':wd f: 1..10 +-> BOOL & !x.(x:1..9 => x:dom(f)) & 1..9 <: dom(f) &res=f(10)', |
| 5947 | | '-evalt', ':wd s:seq(BOOL) & size(s)=10 & xx:1..n & n<10 & res = (s /|\\ n)(xx)', |
| 5948 | | '-evalt', ':wd s:seq(BOOL) & size(s)=10 & xx:1..n & n<=10 & res = (s /|\\ n)(xx)', |
| 5949 | | '-evalf', ':wd s:seq(BOOL) & size(s)=10 & xx:1..n & n<=10 & res = (s /|\\ n)(xx+1)', |
| 5950 | | '-evalf', ':wd s:seq(BOOL) & size(s)=10 & xx:1..11 & n<=10 & res = (s /|\\ n)(xx)', |
| 5951 | | '-evalt', ':wd sze = 8 & MSG = 1 .. sze --> BIT & BIT = {0,1} & c:MSG & res = c(1)', |
| 5952 | | '-evalf', ':wd sze = 8 & MSG = 1 .. sze --> BIT & BIT = {0,1} & c:MSG & res = c(0)', |
| 5953 | | '-evalt', ':wd make = id(INTEGER * INTEGER) & coord = make~ & xcoord = (coord ; %(z_,z__).(z_ : INTEGER & z__ : INTEGER|z_)) & res = xcoord((1,2))', |
| 5954 | | '-evalt', ':wd make = id(NATURAL1 * NATURAL1) & coord = make~ & xcoord = (coord ; %(z_,z__).(z_ : INTEGER & z__ : INTEGER|z_)) & res = xcoord((1,2))', |
| 5955 | | '-evalf', ':wd make = id(NATURAL1 * NATURAL1) & coord = make~ & xcoord = (coord ; %(z_,z__).(z_ : INTEGER & z__ : INTEGER|z_)) & res = xcoord((1,0))', |
| 5956 | | '-evalf', ':wd j : k .. n & l: k..j & g : 1 .. n >-> NATURAL & res = g(l)', % l not guaranteed >= 1 |
| 5957 | | '-evalt', ':wd k>=1 & j : k .. n & l: k..j & g : 1 .. n >-> NATURAL & res = g(l)', |
| 5958 | | '-evalt', ':wd BVc=16 & BIdx = 1..BVc & s:BIdx --> BOOL & res=size(s)', |
| 5959 | | '-evalf', ':wd BVc>=0 & BIdx = 1..BVc & s:BIdx --> BOOL & res=first(s)', |
| 5960 | | '-evalt', ':wd BVc>0 & BIdx = 1..BVc & s:BIdx --> BOOL & res=first(s)', |
| 5961 | | '-evalt', ':wd BVc=16 & BIT={0,1} & BIdx = 1..BVc & bt:BIdx --> BIT & bit_not : BIT >->> BIT & res = bit_not(bt(1))', |
| 5962 | | '-evalt', ':wd BVc=16 & BIT={0,1} & BIdx = 1..BVc & BV16 = BIdx --> BIT & bt:BV16 & bit_not : BIT >->> BIT & res = bit_not(bt(1))', |
| 5963 | | '-evalt', ':wd U_MAX = (pow2__16) -1 & U_MIN = 0 & USHORT = U_MIN..U_MAX & v0 : USHORT & res = v0 mod 2', |
| 5964 | | '-evalt', ':wd U_MAX = pow2__8 - 1 & U_MIN = 0 & UCHAR = ( U_MIN .. U_MAX) & uchar_byte = % ( v0 ) . ( v0 : UCHAR | [v0 mod 2,v0/2]) & w1:UCHAR & res=uchar_byte(w1)', |
| 5965 | | '-evalt', ':wd x: iseq(BOOL) & TRUE:ran(x) & res = x~(TRUE)', |
| 5966 | | '-evalt', ':wd f : BOOL --> iseq(BOOL) & x=f(TRUE) & p1:dom(x) & res=x(p1)', |
| 5967 | | '-evalt', ':wd f : BOOL --> iseq(BOOL) & x:ran(f) & p1:dom(x) & res=x(p1)', |
| 5968 | | '-evalt', ':wd PFT = BOOL --> iseq(BOOL) & f : PFT & x:ran(f) & p1:dom(x) & res=x(p1)', |
| 5969 | | '-evalt', ':wd PFT = iseq(BOOL) --> BOOL & f : PFT & x:dom(f) & p1:dom(x) & res=x(p1)', |
| 5970 | | '-evalt', ':wd s : seq1(BOOL) & i=size(s) & res = s(i)', |
| 5971 | | '-evalt', ':wd s : seq1(BOOL) & i=size(s) & res = s /|\\ i', |
| 5972 | | '-evalt', ':wd s : seq1(BOOL) & i=size(s)/2 & res = s /|\\ (size(s)/2)', |
| 5973 | | % does not work yet: :wd s : seq1(BOOL) & i=size(s)/2 & res = s /|\ i |
| 5974 | | '-evalt', ':wd stackTypes : -4 .. MaxSize --> BOOL & MaxSize : 0 .. 9 & stackSz <= MaxSize & stackSz > 1 & shart = stackTypes(stackSz)', |
| 5975 | | % does not work yet: :wd stackTypes : -4 .. MaxSize-1 --> BOOL & MaxSize : 0 .. 9 & stackSz <= MaxSize & stackSz > 1 & shart = stackTypes(stackSz-1) |
| 5976 | | '-evalt', ':wd ZO=3 & ZQ=4 & adz = {ZO|->TRUE,ZQ|->FALSE} & r:dom(adz) & res=adz(r)', |
| 5977 | | '-evalt', ':wd ZO=3 & ZQ=4 & adz = {ZO|->TRUE,ZQ|->FALSE} & r:{3} & res=adz(r)', |
| 5978 | | '-evalt', ':wd ZO=3 & ZQ=4 & adz = {ZO|->TRUE,ZQ|->FALSE} & r:{ZO,ZQ} & res=adz(r)', |
| 5979 | | % :wd ZO=3 & ZQ=4 & adz = {3|->TRUE,4|->vv} & r:{3,4} & res=adz(r) % TODO |
| 5980 | | % :wd ZO=3 & ZQ=4 & adz = {ZO|->TRUE,ZQ|->FALSE} & r:{3,4} & res=adz(r) % TODO |
| 5981 | | '-evalt', ':wd CS : INTEGER +-> INTEGER & {3,4} <: dom(CS) & 5:dom(CS) & res=CS(3)', |
| 5982 | | '-evalt', ':wd CS : INTEGER +-> INTEGER & {3,x} <: dom(CS) & res=CS(x)', |
| 5983 | | '-evalt', ':wd CS : INTEGER +-> INTEGER & {y,x} <: dom(CS) & res=CS(x)', |
| 5984 | | '-evalt', ':wd CS : INTEGER +-> INTEGER & ds <: dom(CS) & x:ds & res=CS(x)', |
| 5985 | | '-evalt', ':wd CS : INTEGER +-> INTEGER & x = dom(CS) - other & 3:x & res=CS(3)', |
| 5986 | | '-evalt', ':wd CS : INTEGER +-> INTEGER & {3} = dom(CS) - other & res=CS(3)', |
| 5987 | | '-evalt', ':wd x:struct(f:BOOL --> STRING,g:POW(1..2)) & res= card(x\'g)', |
| 5988 | | '-evalt', ':wd x:TS & TS=struct(f:BOOL --> STRING,g:POW(1..2)) & res= card(x\'g)', |
| 5989 | | '-evalt', ':wd x:struct(f:BOOL --> STRING, g:BOOL) & res= x\'f(TRUE)', |
| 5990 | | '-evalt',':wd x:struct(f:BOOL --> STRING) & xf = x\'f & res= xf(TRUE)', |
| 5991 | | '-evalt', ':wd x:TS & TS=struct(f:BOOL --> STRING) & xf = x\'f & res= xf(TRUE)', |
| 5992 | | '-evalt', ':wd X = Y \\/ Z & Y /\\ Z = {} & Y<:1..10 & Z <:1..10 & Y /= {} & res=max(X)', |
| 5993 | | '-evalt', ':wd X = Y \\/ Z & Y /\\ Z = {} & Y<:1..10 & Z <:1..10 & 2:Y & res=max(X)', |
| 5994 | | '-evalt', ':wd v:NAT1 & {TRUE|->v,FALSE|->w/v}(bool(x>10)) = res', |
| 5995 | | '-evalt', ':wd V : N >-> NAT & da /= {} & V[da] /= {} & da <: 1..100 & res = V~(max(V[da]))', |
| 5996 | | '-evalf', ':wd V : N >-> NAT & da /= {} & da <: 1..100 & res = V~(max(V[da]))', % cannot prove not empty |
| 5997 | | '-evalt', ':wd f = %v1.(v1 : 0..512 & v1 <= SMAX|v1) \\/ %v1.(v1 : 0..512 & not(v1 <= SMAX)|v1 - 256) & f(0)=res', |
| 5998 | | '-evalt', ':wd A<:NAT & f:A*A --> INTEGER & g:BOOL-->A & res= f(g(x),g(y))', |
| 5999 | | '-evalt', ':wd N<:NAT & V : N >-> NAT & y:dom(V) & k = V(y) & m = (V~ ; a) & a : N +-> N & n : N >->> N & k |-> y : m & res = V~(k)', |
| 6000 | | '-evalt', ':wd SIG : ran(fst) >->> NAT & fst : BOOL --> NATURAL & res = SIG(fst(r))', |
| 6001 | | '-evalt', ':wd accel : 1 .. VEH --> MIN_A .. MAX_A & VEH >= 2 & v : 2 .. d_veh - 1 & d_veh : 1 .. VEH + 1 & res=accel(v-1)', |
| 6002 | | '-evalt', ':wd b : RwSmallDom --> BOOL & x:RwDom & RwSmallDom = MinRwAddress .. MaxRwAddress & RwDom = MinRwPointer .. MaxRwPointer & MinRwAddress = MinRwPointer & MaxRwAddress = 3 + MaxRwPointer & res =b(x)', |
| 6003 | | '-evalf', ':wd lightArcTo = {towinglight |-> 2475} \\/ {allroundlight |-> 3600} \\/ {sternlight |-> 2475} \\/ {sidelightPort |-> 3600} \\/ {sidelightStarboard |-> 1125} \\/ {mastheadlight |-> 1125} & towinglight:STRING & res = lightArcTo(towinglight)', |
| 6004 | | '-evalt', ':wd lightArcTo = {11 |-> 2475} \\/ {22 |-> 3600} \\/ {33 |-> 2475} \\/ {44 |-> 3600} \\/ {55 |-> 1125} \\/ {66 |-> 1125} & res = lightArcTo(55)', |
| 6005 | | '-evalt', ':wd cdoor=1..10 & cmd_doors : BOOL --> POW(cdoor) & carriage_ds : cdoor --> BOOL & cmd:dom(cmd_doors) & d : cmd_doors(cmd) & res = carriage_ds(d)', |
| 6006 | | '-evalf', ':wd res = 3 mod -2', |
| 6007 | | '-evalt', ':wd f: NAT +-> NAT & dom(f) /\\ {a} /= {} & res=f(a)', |
| 6008 | | '-evalt', ':wd f: NAT >+> NAT & {a} /\\ ran(f) /= {} & res=f~(a)', |
| 6009 | | '-evalf', ':wd f: BOOL <-> INTEGER & card({TRUE} <| f)=10', |
| 6010 | | '-evalt', ':wd f: NATURAL <-> 2..10 & card(1..10 <| f)=10', |
| 6011 | | '-evalt', ':wd f: BOOL <-> INTEGER & card(f |> {11})=10', |
| 6012 | | '-evalt', ':wd f: BOOL <-> NATURAL & card(f |> {11})=10', |
| 6013 | | '-evalt', ':wd f : BOOL <-> INTEGER & card(dom(f))=1', |
| 6014 | | '-evalt', ':wd f : 1..10 <-> INTEGER & card(dom(f))=1', |
| 6015 | | '-evalf', ':wd f : INTEGER <-> 1..10 & card(dom(f))=1', |
| 6016 | | '-evalt', ':wd f : INTEGER <-> 1..10 & card(ran(f))=1', |
| 6017 | | '-evalt', ':wd x : {f | f: 1..10 --> BOOL & f(1)=f(10)} & res=x(1)', |
| 6018 | | '-evalf', ':wd ff : NATURAL +-> BOOL & res=card(ff |> {FALSE})', |
| 6019 | | '-evalt', ':wd f: NATURAL <-> NATURAL & x<:1..10 & res = card((1..2) <| f |> x)', |
| 6020 | | '-evalt', ':wd T=BOOL & sq = {f|f : INTEGER +-> T & #n.(n >= 0 & f : 1 .. n --> T)} & 1:dom(s) & s:sq & res=s(1)', |
| 6021 | | '-evalt', ':wd T=BOOL & sq = {f|f : INTEGER +-> T & #n.(n >= 0 & f : 1 .. n --> T)} & s1 = sq - {{}} & 1:dom(s) & s:s1 & res=s(1)', |
| 6022 | | '-evalt', ':wd vehicle = 1 & accel : 1 .. VEHICLES --> BOOL & vehicle : 1 .. VEHICLES + 1 & VEHICLES : NAT1 & res = accel(vehicle)', |
| 6023 | | '-evalt', ':wd D=1..10 & f:D-->BOOL & g:D-->BOOL & h:{f,g} & res= h(2)', |
| 6024 | | '-evalt', ':wd i : BOOL --> dom(wtp) & wtp : NAT1 +-> BOOL & res = wtp(i(TRUE))', |
| 6025 | | '-evalt', ':wd i : BOOL --> (BOOL --> dom(wtp)) & wtp : NAT1 +-> BOOL & res = wtp(i(TRUE)(TRUE))', |
| 6026 | | '-evalt', ':wd MAtemp: BOOL +-> POW(INTEGER) & res = (({tr} <<| MAtemp) \\/ {tr |-> 1..2})(tr)', |
| 6027 | | '-evalt', ':wd MAtemp: BOOL +-> POW(INTEGER) & res = ((MAtemp) <+ {tr |-> 1..2})(tr)', |
| 6028 | | '-evalt', ':wd s = {1|->3} & res = s(card(s))', |
| 6029 | | '-evalt', ':wd D=1..10 & d1:D & res = rev({} /\\ {1 |-> d1})', |
| 6030 | | '-evalt', ':wd D=1..10 & d1:D & res = rev({1 |-> d1} /\\ [])', |
| 6031 | | '-evalf', ':wd D=1..10 & d1:D & res = rev({1 |-> 1, 1 |-> d1})', |
| 6032 | | '-evalt', ':wd D=1..10 & d1:D & res = rev({2 |-> d1, 1 |-> d1})', |
| 6033 | | '-evalf', ':wd q: 0..10 --> BOOL & a>0 & res=q(a mod 12)', |
| 6034 | | '-evalt', ':wd q: 0..10 --> BOOL & a>0 & res=q(a mod 11)', |
| 6035 | | '-evalt', ':wd q: 0..10 --> BOOL & a>0 & a<11 & res=q(a mod 101)', |
| 6036 | | '-evalt', ':wd n:NAT1 & q: 0..(n) --> BOOL & a>0 & res=q(a mod n)', |
| 6037 | | '-evalt', ':wd n:NAT1 & q: 0..(n-1) --> BOOL & a>0 & res=q(a mod n)', |
| 6038 | | '-evalt', ':wd wt : 1..w --> BOOL & wtp : NAT1 +-> BOOL & wt <: wtp & m:dom(wt) & res=wtp(m)', |
| 6039 | | '-evalt', ':wd wt : 1..w --> BOOL & wtp : NAT1 +-> BOOL & wt <: wtp & m>0 & m<w & w>1 & res=wtp(m)', |
| 6040 | | '-evalf', ':wd Trains <: NATURAL & isConnected : (trainKind~)[{13}] --> BOOL & tr : Trains & trainKind = {t1 |-> 11,t2 |-> 22} & trainKind : Trains --> TrainKind & res = isConnected(tr)', |
| 6041 | | '-evalt', ':wd Trains <: NATURAL & isConnected : (trainKind~)[{11}] --> BOOL & tr : Trains & trainKind = {t1 |-> 11,t2 |-> 22} & trainKind : Trains --> TrainKind & res = isConnected(tr)', |
| 6042 | | '-evalt', ':wd tpp = {1,2} & ppp : tpp & ers = {1|->2,2|->1}(ppp)', |
| 6043 | | '-evalf', ':wd a:NAT & tpp = {a,b} & a/=b & ppp : tpp & ers = {a|->1,a|->2}(ppp)', |
| 6044 | | '-evalt', ':wd a:NAT & tpp = {a,b} & a/=b & ppp : tpp & ers = {a|->b,b|->a}(ppp)', |
| 6045 | | '-evalt', ':wd f = %x.(x<10 |x-1) & res=f(1)', |
| 6046 | | '-evalf', ':wd f = %x.(x<10 |x-1) & res=f(10)', |
| 6047 | | '-evalt', ':wd f = %x.(x:NATURAL1 & x<10 |x-1) & res=f(1)', |
| 6048 | | '-evalt', ':wd f = %x.(x:NATURAL1 & x:{1,3,5,7,y} |x-1) & res=f(1)', |
| 6049 | | '-evalt', ':wd ic = struct(val:(1..2 --> BOOL)) & x:ic & res = x\'val(1)', |
| 6050 | | '-evalt', ':wd ic = struct(val:seq1(BOOL)) & x:ic & res = x\'val(1)', |
| 6051 | | '-evalt', ':wd ic = struct(val:seq1(BOOL)) & x:BOOL-->ic & res = x(TRUE)\'val(1)', |
| 6052 | | '-evalt', ':wd ic = struct(val:seq1(BOOL)) & x:BOOL+->ic & TRUE:dom(x) & res = x(TRUE)\'val(1)', |
| 6053 | | '-evalt', ':wd f = (%(x,y,z).(x:BOOL & y:1..2 & z:BOOL|1)) & res = f(TRUE,2,FALSE)', |
| 6054 | | '-evalt', ':wd f = %x.(x:1..100 & x:aa|x+1) & y:aa & y:2..5 & res=f(y)', |
| 6055 | | '-evalt', ':wd s = ["a","b"] & y:ran(s) & x: {s~(y)} & res = s(x)', |
| 6056 | | '-evalt', ':wd s = ["a","b"] & y:ran(s) & v:dom(s) & x: {v,s~(y)} & res = s(x)', |
| 6057 | | '-evalt', ':wd s = ["a","b"] & y:ran(s) & v:dom(s) & x: {v} \\/ {s~(y)} & res = s(x)', |
| 6058 | | '-evalt', ':wd s = ["a","b"] & r = ["x","y","z"] & x:dom(s) & res= r(x)', |
| 6059 | | '-evalf', ':wd s = ["a","b"] & r = ["x","y","z"] & x:dom(r) & res= s(x)', |
| 6060 | | '-evalt', ':wd s = ["a","b"] & r = ["a","b","c"] & x:ran(s) & res= r~(x)', |
| 6061 | | '-evalf', ':wd s = ["a","b"] & r = ["a","b","c"] & x:ran(r) & res= s~(x)', |
| 6062 | | '-evalt', ':wd s = {"a","b","c","d"} & r = ["a","b","c","d","e","f"] & x:s & res= r~(x)', |
| 6063 | | '-evalf', ':wd s = {"a","b","cc","d"} & r = ["a","b","c","d","e","f"] & x:s & res= r~(x)', |
| 6064 | | '-evalf', ':wd y<10 & res=%x.(x:NATURAL1|x-1)(y)', % test assertion_expression |
| 6065 | | '-evalt', ':wd y>1 & res=%x.(x:NATURAL1|x-1)(y)', |
| 6066 | | '-evalt', ':wd f : BOOL --> (NATURAL * (BOOL --> BOOL)) & g = prj2(INTEGER,(BOOL<->BOOL))(f(TRUE)) & res = g(x)', |
| 6067 | | '-evalt', ':wd f : BOOL --> ((BOOL --> BOOL)*NAT) & g = prj1((BOOL<->BOOL),INTEGER)(f(TRUE)) & res = g(x)', |
| 6068 | | '-evalt', ':wd f : BOOL --> ((BOOL --> BOOL)*NAT) & g = prj1((BOOL<->BOOL),NAT)(f(TRUE)) & res = g(x)', |
| 6069 | | '-evalt', ':wd f: BOOL +-> BOOL & g:BOOL +-> BOOL & dom(f) <: dom(g) & y:dom(f) & res=g(y)', |
| 6070 | | '-evalt', ':wd f: BOOL +-> BOOL & g:BOOL +-> BOOL & !x,y.(x|->y:f => x:dom(g)) & y:dom(f) & res=g(y)', |
| 6071 | | '-evalt', ':wd f: BOOL +-> BOOL & g:BOOL >+> BOOL & !x,y.(x|->y:f => x:ran(g)) & y:dom(f) & res=g~(y)', |
| 6072 | | '-evalt', ':wd TRACK : FIN(NATURAL1) & x: TRACK +-> NATURAL1 & card(x)<3', |
| 6073 | | '-evalt', ':wd TRACK : FIN(NATURAL1) & x: TRACK --> NATURAL1 & card(x)<3', |
| 6074 | | '-evalf', ':wd TRACK : FIN(NATURAL1) & x: TRACK <-> NATURAL1 & card(x)<3', |
| 6075 | | '-evalt', ':wd TRACK : FIN(NATURAL1) & x: TRACK <-> BOOL & card(x)<3', |
| 6076 | | '-evalt', ':wd TRACK : FIN(NATURAL1) & x: TRACK <->> BOOL & card(x)<3', |
| 6077 | | '-evalf', ':wd TRACK : FIN(NATURAL1) & x: NATURAL1 +-> TRACK & card(x)<3', |
| 6078 | | '-evalt', ':wd TRACK : FIN(NATURAL1) & x: NATURAL1 >-> TRACK & card(x)<3', |
| 6079 | | '-evalt', ':wd x>=0 & res= 10 / (2**x)', |
| 6080 | | '-evalf', ':wd x>=0 & res= 10 / (x**2)', |
| 6081 | | '-evalt', ':wd x>0 & res= 10 / (x**2)', |
| 6082 | | '-evalt', ':wd x/=0 & res= 10 / (x**2)', |
| 6083 | | '-evalt', ':wd x>=0 & res= 10 mod (2**x)', |
| 6084 | | '-evalt', ':wd a:0..2**8 & z:0..8 & res = (a/(2**z)) mod 2', |
| 6085 | | '-evalt', ':wd f = %(x,y).(x:NATURAL1 & y:NATURAL1 &x<y | x+y) & res = f(1,2)', |
| 6086 | | '-evalf', ':wd f = %(x,y).(x:NATURAL1 & y:NATURAL1 &x<y | x+y) & res = f(2,2)', |
| 6087 | | '-evalt', ':wd f = %(x,y,z).(x:NATURAL1 & y:NATURAL1 & z:NATURAL & x<y | x+y+z) & res = f(1,2,3)', |
| 6088 | | '-evalt', ':wd f=%x.(x:seq1({0,1})|x) & res = f([1,0])', |
| 6089 | | '-evalt', ':wd f=%(x,y).(x:POW(BOOL) & y:POW(BOOL) & card(x)=card(y)|x) & res = f({TRUE},{FALSE})', |
| 6090 | | '-evalt', ':wd f=%(x,y).(x:POW1(BOOL) & y:POW1(BOOL) & card(x)=card(y)|x) & res = f({TRUE},{FALSE})', |
| 6091 | | '-evalt', ':wd card({a,b|a:{1..2,1..3} & b:1..3}) = res', |
| 6092 | | '-evalt', ':wd card({a,b|a={1,2} & b:1..3}) = res', |
| 6093 | | '-evalf', ':wd card({x,y|x:{y,y+1} & y:{x,x-1} & x:INTEGER})=res', |
| 6094 | | '-evalf', ':wd card({y,x|x:{y,y+1} & y:{x,x-1} & x:INTEGER})=res', |
| 6095 | | '-evalt', ':wd card({y,x|x:{y,y+1} & y:1..2 & x:INTEGER})=res', |
| 6096 | | '-evalt', ':wd card({x,y|x:{y,y+1} & y:1..2 & x:INTEGER})=res', |
| 6097 | | '-evalt', ':wd card({v,w,x|x ={{1,v},{3,w}} & v:2..3 & w:2..3}) = res', |
| 6098 | | '-evalt', ':wd card({v,w,x,a,b|x ={{1,v},{3,w}} & a=x & b=x & v:2..3 & w:2..3}) = res', |
| 6099 | | '-evalt', ':wd card({x,y,z|z:{1,3} & x:1..z & {y}<:{x,x+1}})=8', |
| 6100 | | '-evalt', ':wd card({x,y,z|z:{1,3} & x:1..z & {y}<<:{x,x+1}})=8', |
| 6101 | | '-evalt', ':wd tt : BOOL --> FIN1(NATURAL) & res=max(tt(TRUE))', |
| 6102 | | '-evalt', ':wd t : BOOL --> A & A<:BOOL & f : A --> BOOL & loc:ran(t) & res = f(loc)', |
| 6103 | | '-evalt', ':wd t : BOOL --> FIN(A) & A<:BOOL & f : A --> BOOL & loc:ran(t) & pos: loc & res = f(pos)', |
| 6104 | | '-evalf', ':wd t : BOOL --> FIN(A) & A<:BOOL & B<:A & f : B --> BOOL & loc:ran(t) & pos: loc & res = f(pos)', |
| 6105 | | '-evalt', ':wd t : BOOL --> (A+->A) & A<:BOOL & f : (A*A) --> BOOL & loc:ran(t) & pos: loc & res = f(pos)', |
| 6106 | | '-evalf', ':wd t : BOOL --> (A+->A) & A<:BOOL & B<:A & f : (A*B) --> BOOL & loc:ran(t) & pos: loc & res = f(pos)', |
| 6107 | | '-evalt', ':wd t : BOOL --> (A+->B) & A<:BOOL & B<:A & f : (A*A) --> BOOL & loc:ran(t) & pos: loc & res = f(pos)', |
| 6108 | | '-evalt', ':wd f: BOOL --> FIN(NATURAL) & f: BOOL <-> POW1(INTEGER) & res = max(f(TRUE))', |
| 6109 | | '-evalt', ':wd f: BOOL --> FIN(NATURAL) & ran(f) <: POW1(INTEGER) & res = max(f(TRUE))', |
| 6110 | | '-evalt', ':wd f: FIN(NATURAL) >+>> BOOL & dom(f) <: POW1(INTEGER) & res = max(f~(TRUE))', |
| 6111 | | '-evalt', ':wd f: BOOL --> FIN(NATURAL) & !x.(x:ran(f)=> x/={}) & res = max(f(TRUE))', |
| 6112 | | '-evalt', ':wd f: BOOL --> POW(NATURAL) & !x.(x:ran(f)=> x/={} & x:FIN(x)) & res = max(f(TRUE))', |
| 6113 | | '-evalt', ':wd ll<:INTEGER & ll/={} & ll:FIN(ll) & ff=max(ll)', % added integer type |
| 6114 | | '-evalt', ':wd xx : dom(ff) \\/ {yy} & ff: BOOL +-> BOOL & res = (ff <+ {yy |-> TRUE})(xx)', |
| 6115 | | '-evalt', ':wd (xx : dom(ff) or xx: {yy}) & ff: BOOL +-> BOOL & res = (ff <+ {yy |-> TRUE})(xx)', |
| 6116 | | '-evalt', ':wd f: NATURAL +-> INTEGER & x|->y:f & f(x)=res', |
| 6117 | | '-evalt', ':wd a=[2,3,4] & res=first(front(a))', |
| 6118 | | '-evalt', ':wd a=[2,3,4] & res=front(tail(a))', |
| 6119 | | '-evalt', ':wd a=[2,3,4] & res=front(rev(tail(a)))', |
| 6120 | | '-evalt', ':wd a=[2,3,4] & res=front(front(rev(a)))', |
| 6121 | | '-evalt', ':wd a=[2,3,4] & res=front(front(rev(front(a))))', |
| 6122 | | '-evalt', ':wd aa = [2,3,4,5] & size(1..3 <| aa) = 3', |
| 6123 | | '-evalt', ':wd aa = [2,3,4,5] & b=[2,3] & size(dom(b) <| aa) = 2', |
| 6124 | | '-evalf', ':wd a = {1|->2, 2|->3} & b = {2|->4,3|->5} & gg:1..10+->1..10 & x:1..3 & res = ((a;b) <+ (ss <| gg)) (x)', |
| 6125 | | '-evalf', ':wd a = {1|->2, 2|->3, 3|->4} & b = {2|->4,3|->5} & gg:1..10+->1..10 & x:1..3 & res = ((a;b) <+ (ss <| gg)) (x)', |
| 6126 | | '-evalt', ':wd a = {1|->2, 2|->3} & b = {2|->4,3|->5} & gg:1..10+->1..10 & x:1..2 & res = ((a;b) <+ (ss <| gg)) (x)', |
| 6127 | | '-evalt', ':wd a = {1|->"a", 2|->"b"} & b = {"a"|->4,"b"|->5} & gg:1..10+->1..10 & x:1..2 & res = (a;b) (x)', |
| 6128 | | '-evalt', ':wd a = {"A"|->"a", "B"|->"b"} & b = {"a"|->4,"b"|->5} & gg:STRING+->1..10 & x:{"A","B"} & res = ((a;b) <+ (ss <| gg)) (x)', |
| 6129 | | '-evalt', ':wd f = %x.(x:1..10 & x mod 2 =0 | x/2) & y:1..10 & y mod 2 = 0 &res=f(y)', |
| 6130 | | '-evalt', ':wd f = %x.(x:1..10 & x mod 2 =0 | x/2) & res=f(4)', |
| 6131 | | '-evalf', ':wd x=card({x,y| x+y = 1})', |
| 6132 | | '-evalt', ':wd x=card({x,y| [x,y] : iseq({0,1,2})})', |
| 6133 | | '-evalt', ':wd x=card({x,y| rev([x,y]) : iseq({0,1,2})})', |
| 6134 | | '-evalt', ':wd x=card({x,y| x:seq(INT) & y:seq(INT) & rev(x ^ y) : iseq({0,1,2})})', |
| 6135 | | '-evalt', ':wd x=card({x,y| x \\/ y <: 1..5})', |
| 6136 | | '-evalt', ':wd x=card({x| x+2 = 10})', |
| 6137 | | '-evalt', ':wd x=card({x| x*2 : 1..10})', |
| 6138 | | '-evalt', ':wd x=card({x,y| {x+1,y+2} \\/ {3} <: 1..5})', |
| 6139 | | '-evalt', ':wd card({x| [0,0] <+ {x|->1} : 1..3 --> 0..1})=res', |
| 6140 | | '-evalt', ':wd f : BOOL \\ a --> BOOL & x /: a & res = f(x)', |
| 6141 | | '-evalf', ':wd f:INTEGER \\ (2..10) --> NAT & x<=2 & res=f(x)', |
| 6142 | | '-evalt', ':wd f:INTEGER \\ (2..10) --> NAT & x<2 & res=f(x)', |
| 6143 | | '-evalt', ':wd f:INTEGER \\ (2..10) --> NAT & x>10 & res=f(x)', |
| 6144 | | '-evalt', ':wd f:INTEGER \\ ELS --> NAT & ELS = (2..10) & x<2 & res=f(x)', |
| 6145 | | '-evalf', ':wd f = {x,r | x:BOOL & r > 2} & res = max(ran(f))', |
| 6146 | | '-evalt', ':wd f = %x.(x:BOOL | 10+12) & res = max(ran(f))', % check we do not loose typing info of dom(f)=BOOL |
| 6147 | | '-evalt', ':wd a:1..n --> 1..100 & a /= {} & res=a(1)', |
| 6148 | | '-evalt', ':wd a:1..n --> 1..100 & a /= {} & res=a(n)', |
| 6149 | | '-evalt', ':wd cf: BOOL <->BOOL & cf={} & x:dom(cf) & r=cf(x)', |
| 6150 | | %'-evalt', ':wd a/=FALSE & f = {TRUE|->11} & res =f(a)', |
| 6151 | | '-evalt', ':wd card(union({{1,2},{3,4}})) = r', |
| 6152 | | '-evalt', ':wd x:POW(1..3) & card(union({{1,2},{3,4} \\/ x})) = r', |
| 6153 | | '-evalt', ':wd real(1)=1.0', |
| 6154 | | '-evalt', ':wd 1=floor(1.0)', |
| 6155 | | '-evalt', ':wd 1=ceiling(1.0)', |
| 6156 | | '-evalt', ':wd 1.0/2.0 > 0.0', |
| 6157 | | '-evalt', ':wd SIGMA(x).(x:{1.0,2.0}|x/2.0) = 1.5', |
| 6158 | | '-evalt', ':wd PI(x).(x:{4.0,2.0}|x/2.0) = 2.0', |
| 6159 | | '-evalt', ':wd x<:POW(1..3) & card(union( x )) = r', |
| 6160 | | '-evalt', ':wd x<:POW(1..3) & card(union({{1,2},{3,4}} \\/ x)) = r', |
| 6161 | | '-evalt', ':wd x<:perm(1..3) & card(union( x )) = r', |
| 6162 | | '-evalt', ':wd x:NAT & y:NAT & y=prj2(INT,INT)((x,y))', |
| 6163 | | '-evalt', ':wd x<:INTEGER & card(inter({x,y,{1}})) = 1', |
| 6164 | | '-evalt', ':wd x<:POW(INTEGER) & card(inter({{1}}\\/x) ) = 1', |
| 6165 | | '-evalf', ':wd x<:POW(INTEGER) & card(inter({NATURAL}\\/x) ) = 1', |
| 6166 | | '-evalf', ':wd SIGMA(x).(x:NATURAL|x) =res', |
| 6167 | | '-evalt', ':wd PI(x).(x:1..100|x) =res', |
| 6168 | | '-evalf', ':wd PI(x).(x:NATURAL|x) =res', |
| 6169 | | '-prob-profile' |
| 6170 | | % '-evalt', ':wd BV>0 & BIdx = 1..BV & s:BIdx --> BOOL & res=first(s)' % needs fix in parser: resetdefinitions |
| 6171 | | ], 'Test new well-definedness analysis'). |
| 6172 | | cli_testcase(2019,[b_test],[ |
| 6173 | | '../prob_examples/public_examples/B/Tester/ASSERT_Disabled_Test.mch', |
| 6174 | | '-t' |
| 6175 | | ], 'Test ASSERT_CHECKING preference'). |
| 6176 | | cli_testcase(2020,[b_test],[ |
| 6177 | | '../prob_examples/public_examples/B/Tester/ASSERT_Enabled_Test.mch', |
| 6178 | | '-mc', 100, '-no-state-errors', '-nodead', |
| 6179 | | '-cc', 8, 10, |
| 6180 | | '-expcterr', assert_error % assert error is still registered, but model checking runs to the end |
| 6181 | | ], 'Test -no-state-errors model checking option'). |
| 6182 | | cli_testcase(2021,[cbc],[ |
| 6183 | | '-evalt', '{x} /\\ {y} /= {} & x:1000000..20000000 & y:0..2000000', |
| 6184 | | '-evalt', 'x:1000000..20000000 & y:0..2000000 & {x} /\\ {y} /= {}' % used to be very slow |
| 6185 | | ], 'Performance issue with intersection of two singleton sets, Check that non-empty set detected and x and y are unified'). |
| 6186 | | cli_testcase(2022, [disprover,infinite,total_function,wd], [ |
| 6187 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/WD/TestWD_Prover_ctx.pl', |
| 6188 | | '-check_disprover_result', 11,0,0, |
| 6189 | | '-timeout', 200 % timeout per PO |
| 6190 | | ],'WD proof obligations all discharged using new rule-based WD prover'). |
| 6191 | | cli_testcase(2023, [disprover,wd], [ |
| 6192 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/WD/BitFunctions_ctx.pl', |
| 6193 | | '-check_disprover_result', 4,0,0, |
| 6194 | | '-timeout', 200 % timeout per PO |
| 6195 | | ],'WD proof obligations all discharged using new rule-based WD prover (involving division)'). |
| 6196 | | cli_testcase(2024, [wd,wd_prover], [ |
| 6197 | | '../prob_examples/public_examples/B/Demo/SortByPermutation5.mch', |
| 6198 | | '-wd', 10, 10, '-timeout', 200 % timeout per PO |
| 6199 | | ],'Test all WD POs generated and discharged'). |
| 6200 | | cli_testcase(2025, [wd,wd_prover], [ |
| 6201 | | '../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 6202 | | '-wd', 69, 71, % changed from 67/69 on Jul 29th 2023 due to change in machine |
| 6203 | | '-timeout', 200, % timeout per PO |
| 6204 | | '-silent' %-expcterr', 'well_def_analyser' % warnings for 2 undischarged POs due to min/max in non-silent mode |
| 6205 | | ],'Test all WD POs generated and discharged'). |
| 6206 | | cli_testcase(2026, [wd,wd_prover], [ |
| 6207 | | '../prob_examples/public_examples/B/Mathematical/NFA_to_DFA_Unicode.mch', |
| 6208 | | '-wd', 16, 16, '-timeout', 200 % timeout per PO |
| 6209 | | ],'Test all WD POs generated and discharged'). |
| 6210 | | cli_testcase(2027, [wd,wd_prover], [ |
| 6211 | | '../prob_examples/public_examples/B/Mathematical/CardTrick.mch', |
| 6212 | | '-wd', 28, 28, '-timeout', 200 % timeout per PO |
| 6213 | | ],'Test all WD POs generated and discharged'). |
| 6214 | | cli_testcase(2028, [error_checks], [ |
| 6215 | | '../prob_examples/public_examples/B/Tester/Warnings/VarNotWritten.mch', |
| 6216 | | '-lint', |
| 6217 | | '-expcterrpos', bmachine_static_checks, 1, 8, |
| 6218 | | '-expcterrpos', check_all_variables_written, 3, 10 |
| 6219 | | ],'Test extended static checking (ESC) aka linting'). |
| 6220 | | cli_testcase(2029, [wd,wd_prover], [ |
| 6221 | | '../prob_examples/public_examples/B/Tester/WD_Tests/Substitutions/SeqComp1.ref', |
| 6222 | | '-wd', 1, 1, '-timeout', 200 % timeout per PO |
| 6223 | | ],'Test sequential composition correctly dealt withby WD'). |
| 6224 | | cli_testcase(2030, [wd,wd_prover,sequences], ['../prob_examples/public_examples/B/Benchmarks/SeqLaws.mch', |
| 6225 | | '-wd', 59, 59, '-timeout', 200 % timeout per PO |
| 6226 | | ], 'Test all WD POs generated and discharged'). |
| 6227 | | cli_testcase(2031, [enabling,read_write], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', |
| 6228 | | '-read_write_matrix_csv', '../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc_rw_matrix.csv', |
| 6229 | | '-strict'], |
| 6230 | | 'Check correct computation of read_write_matrix.'). |
| 6231 | | cli_testcase(2032, [b_test,records], ['../prob_examples/public_examples/B/FeatureChecks/AssignToRecordField.mch', |
| 6232 | | '-t' |
| 6233 | | ], 'Check that we can assign to the field of a record variable'). |
| 6234 | | cli_testcase(2033, [b_test,recursion,infinite], ['../prob_examples/public_examples/B/RecursiveFunctions/Tests/NFA_DFA_Explosion.mch', |
| 6235 | | '-mc', 100 |
| 6236 | | ], 'Check that we total function check works for recursive function'). |
| 6237 | | cli_testcase(2034,[wd],[ |
| 6238 | | '-evalt', 'BOOL <<->> {TRUE} = {{(FALSE|->TRUE),(TRUE|->TRUE)}}', |
| 6239 | | '-evalt', 'BOOL <->> {TRUE} = {{(FALSE|->TRUE)},{(FALSE|->TRUE),(TRUE|->TRUE)},{(TRUE|->TRUE)}}', |
| 6240 | | '-evalt', 'BOOL <<-> {TRUE} = {{(FALSE|->TRUE),(TRUE|->TRUE)}}', |
| 6241 | | '-evalt', '{TRUE} <<-> {BOOL} = {{(TRUE|->{FALSE,TRUE})}}', |
| 6242 | | '-evalt', 'card((1..2)<<->BOOL) = 9', |
| 6243 | | '-evalt', 'card((1..2)<<->>BOOL) = 7', |
| 6244 | | '-evalt', 'card((1..2)<->>BOOL) = 9', |
| 6245 | | '-evalt', 'card((1..5)<<->BOOL) = 3**5', |
| 6246 | | '-evalt', 'card((1..5)<<->>BOOL) = 241', |
| 6247 | | '-evalt', 'card((1..5)<->>BOOL) = 961', |
| 6248 | | '-evalt', 'card((1..5)<->>BOOL) = card(BOOL <<-> (1..5))', |
| 6249 | | '-evalt', 'card((1..8)<->>BOOL) = card(BOOL <<-> (1..8))', |
| 6250 | | '-evalt', 'card((1..20)<<->BOOL) = 3486784401', |
| 6251 | | '-evalt', 'card((1..20)<->>BOOL) = 1099509530625', |
| 6252 | | '-evalt', 'card(BOOL<<->(1..20)) = 1099509530625', |
| 6253 | | '-evalt', 'card((1..200)<<->{TRUE}) = 1' |
| 6254 | | ], 'Check that Event-B special relation operators are supported'). |
| 6255 | | cli_testcase(2035, [cbc,bmc], ['../prob_examples/public_examples/B/CBC/DeadlockTest.mch', '-bdc', 5, |
| 6256 | | '-expcterr', 'deadlock', |
| 6257 | | '-his', '../prob_examples/public_examples/B/CBC/DeadlockTest_his.txt', '-his_option','show_states' |
| 6258 | | ], 'Check new bounded deadlock checking command'). |
| 6259 | | cli_testcase(2036, [wd,wd_prover,sequences], ['../prob_examples/public_examples/B/ErrorMachines/FunLaws_wderror.mch', |
| 6260 | | '-wd', 84, 90, '-timeout', 200, % timeout per PO |
| 6261 | | '-silent' %-expcterr', 'well_def_analyser' % warnings for undischarged POs |
| 6262 | | ], 'Test no cycle and timeout'). |
| 6263 | | cli_testcase(2037,[sequences],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6264 | | '-evalt', 'cur = [1,2,3,4] & {pre,LHS | pre:seq(INTEGER) & LHS : {2,3,4} & cur = pre^[LHS]} = xx & [1,2,3]|->4:xx', |
| 6265 | | '-evalt', 'cur = [1,2,3,4] & {pre,LHS | pre:seq(INTEGER) & LHS : {2,3,4} & cur = pre<-LHS} = xx & [1,2,3]|->4:xx', |
| 6266 | | '-evalt', 'cur = [1,2,3,4] & {pre,RHS | pre:seq(INTEGER) & RHS : {1,3} & cur = RHS->pre} = xx & [2,3,4]|->1:xx', |
| 6267 | | '-evalt', 'cur = [1,2,3,4] & {pre,post,LHS | LHS : {2,3} & cur = pre^([LHS]^post)} = xx & ran(xx)={2,3}', |
| 6268 | | '-evalt', 'cur = [1,2,3,4] & {pre,post,LHS | LHS : {2,3} & cur = (pre^[LHS])^post} = xx & ran(xx)={2,3}' |
| 6269 | | ], 'Check improved treatment of insert_tail and insert_front'). |
| 6270 | | cli_testcase(2038,[sequences,json_trace_replay],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6271 | | '../prob_examples/public_examples/B/Mathematical/Info4/Kapitel3-CF/PDA/PDA_to_CFG.mch', |
| 6272 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Mathematical/Info4/Kapitel3-CF/PDA/PDA_to_CFG.prob2trace' |
| 6273 | | ], 'Check no enumeration warnings (insert_tail improvement)'). |
| 6274 | | cli_testcase(2039, [private_source_not_available], ['../private_examples/ClearSy/2020/03_Mar/wd_timeout/invalidRef_welldef.mch', |
| 6275 | | '-wd', 612, 1132, %; was 620/1140 before 89519d2dc27ac03d4a6233dbe9fc4b6c2dcf3b50, was 618/1148 was 711, and 714 before commit 5e3cb4b7 move assertions from LibraryFiles.mch to AssertionsForLibraryFiles.mch |
| 6276 | | '-silent' %-expcterr', 'well_def_analyser' % warnings for undischarged POs |
| 6277 | | ], 'Test performance on larger machine'). |
| 6278 | | cli_testcase(2040, [wd,wd_prover], ['../prob_examples/public_examples/EventBPrologPackages/EventB2Java/sort_m2_data400.mch', |
| 6279 | | '-wd', 39, 39, '-timeout', 200 % timeout per PO |
| 6280 | | ], 'Test machine with a lot of index computations'). |
| 6281 | | cli_testcase(2041, [wd,wd_prover], ['../prob_examples/public_examples/EventBPrologPackages/EventB2Java/sort_m2_data400_mch.eventb', |
| 6282 | | '-wd', 43, 43, '-timeout', 200 % timeout per PO |
| 6283 | | ], 'Test machine with a lot of index computations'). |
| 6284 | | cli_testcase(2042, [wd,wd_prover], ['../prob_examples/public_examples/EventBPrologPackages/Records/SampleThreeRecordsTranslated.mch', |
| 6285 | | '-wd', 46, 46, '-timeout', 200 % timeout per PO |
| 6286 | | ], 'Test machine with records and id usage'). |
| 6287 | | cli_testcase(2043, [wd,wd_prover], ['../prob_examples/public_examples/TLA/Consumer_Producer/buffer11_10_v3.mch', |
| 6288 | | '-wd', 5, 5, '-timeout', 200 % timeout per PO |
| 6289 | | ], 'Test machine with sequence manipulations'). |
| 6290 | | cli_testcase(2044, [wd,wd_prover], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6291 | | '../prob_examples/public_examples/B/Tester/NastySetComprehensions.mch', |
| 6292 | | '../prob_examples/public_examples/B/PerformanceTests/PartitionIntoComponentsTest2.mch', |
| 6293 | | '../prob_examples/public_examples/B/Puzzles/EulerOfficers6.mch', |
| 6294 | | '../prob_examples/public_examples/B/PerformanceTests/SAT_Tests/IceCream_kSAT.mch', |
| 6295 | | '../prob_examples/public_examples/TLC/GOAL/RushHour_TLC.mch', |
| 6296 | | '../prob_examples/public_examples/B/ABCD/TraceChecking/TravelAgency_TraceCheck.mch', |
| 6297 | | '../prob_examples/public_examples/B/Tickets/Valerio1/BIT_DEFINITION.mch', |
| 6298 | | '../prob_examples/public_examples/B/SymmetryReduction/Rubik_2by2_Sym.mch', |
| 6299 | | '../prob_examples/public_examples/B/Puzzles/PeaceableQueens/NineQueensAndKingBW.mch', |
| 6300 | | '../prob_examples/public_examples/B/TestCaseGeneration/Schleusen.mch', |
| 6301 | | '../prob_examples/public_examples/B/BZTT/TestBZTT2.mch', |
| 6302 | | '../prob_examples/public_examples/B/CBC/RiverCrossing_BMC.mch', |
| 6303 | | '../prob_examples/public_examples/B/EventB/rodin_train_4.mch', |
| 6304 | | '../prob_examples/public_examples/B/Mathematical/Voting/NoCondorcetWinnerKodkod.mch', |
| 6305 | | '../prob_examples/public_examples/B/Laws/FunLawsWithLambda.mch', |
| 6306 | | '../prob_examples/public_examples/B/PerformanceTests/SAT_Tests/ReificationCompTests.mch', |
| 6307 | | '../prob_examples/public_examples/B/EventB/ETH_Elevator/elevator10.mch', |
| 6308 | | '../prob_examples/public_examples/B/Benchmarks/SeqLaws.mch', |
| 6309 | | '../prob_examples/public_examples/B/Compilers/LLParsingStaged.mch', |
| 6310 | | '../prob_examples/public_examples/B/Puzzles/GardnerSwitchingPuzzle_v3.mch', |
| 6311 | | % now no longer fully proven due to remove_finite rule made more conservative |
| 6312 | | %'../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/mondex_m3.eventb', |
| 6313 | | '../prob_examples/public_examples/TLC/NoError/USB_4Endpoints.mch', |
| 6314 | | '../prob_examples/public_examples/EventBPrologPackages/ABZ_Landing_Gear_Journal/Ref3_ControllerSensors_mch_eventb.mch', |
| 6315 | | '../prob_examples/public_examples/EventBPrologPackages/Advance/Safety_Metro_23_08_2012/EmergencyDoors_M2_mch.eventb', |
| 6316 | | '../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_3_0_mch.eventb', |
| 6317 | | '-wd-check-all', '-global_time_out', 400 % time out per PO |
| 6318 | | ], 'Test machine with sequence manipulations'). |
| 6319 | | cli_testcase(2045, [b_test,kodkod], ['../prob_examples/public_examples/B/Kodkod/GraphMiningSimple.mch', '-strict', '-p','TIME_OUT',1000, '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', '-properties'], 'Check that Kodkod translator works for LET expressions.'). |
| 6320 | | cli_testcase(2046, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/ReplicatedLinkedParallel.csp', '-nodead', '-mc', 100, '-assertions'], 'Test order of replicated linked parallel processes'). |
| 6321 | | cli_testcase(2047,[wd,wd_prover],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6322 | | '-evalt', ':prove x:INTEGER & (x>y & y>z) => x>=z', |
| 6323 | | '-evalu', ':prove x:INTEGER & (x>y & z>y) => x>=z', |
| 6324 | | '-evalt', ':prove 2>1', |
| 6325 | | '-evalt', ':prove (x:STRING & x/=y) => y/=x', |
| 6326 | | '-evalt', ':prove x+1>=x', |
| 6327 | | '-evalt', ':prove x/=1+x', |
| 6328 | | '-evalt', ':prove x+2>x', |
| 6329 | | '-evalt', ':prove x>x-1', |
| 6330 | | '-evalt', ':prove (x:1..10 & f:1..11 --> BOOL => x:dom(f))', |
| 6331 | | '-evalu', ':prove (x<:STRING) => (x <<: x)', |
| 6332 | | '-evalt', ':prove (x<:STRING) => (x <: x)', |
| 6333 | | '-evalt', ':prove (x<:STRING) => (x /\\ y <: x)', |
| 6334 | | '-evalu', ':prove (x<:STRING) => (x \\/ y <: x)', |
| 6335 | | '-evalt', ':prove (x<:STRING) => (x <: x \\/ y)', |
| 6336 | | '-evalt', ':prove (x<:STRING & y={} ) => (x \\/ y <: x)', |
| 6337 | | '-evalt', ':prove (x<y => x:x..y)', |
| 6338 | | '-evalt', ':prove (x<=y => x:x..y)', |
| 6339 | | '-evalu', ':prove (x>y => x:x..y)', |
| 6340 | | '-evalt', ':prove (z:x..y => x:x..y)', |
| 6341 | | '-evalu', ':prove (z:y..y => x:x..y)', |
| 6342 | | '-evalt', ':prove (a>0 => 10+a>=10)', |
| 6343 | | %'-evalt', ':prove (a>0 & b=10 => b+a>=b)', % TO DO |
| 6344 | | '-evalt', ':prove (b>0 => a mod b <= b)', |
| 6345 | | %'-evalt', ':prove (b>0 => a mod b < b)', % TO DO |
| 6346 | | '-evalu', ':prove (x:1..n & n>1 => (x+1) mod n : 1..(n))', % mod could be 0 |
| 6347 | | '-evalt', ':prove (x:1..n & n>1 => (x+1) mod n : 0..(n))', |
| 6348 | | '-evalu', ':prove (x:1..n & n>1 => (x+1) mod n : 0..(n-2))', % interval could be empty |
| 6349 | | '-evalt', ':prove (x:1..n & n>1 => (x+1) mod n : 0..(n-1))', |
| 6350 | | '-evalt', ':prove x:INTEGER & x<y & y<z => x < z', |
| 6351 | | '-evalt', ':prove x:INTEGER & x<y & y<=z => x < z', % TO DO: x<=y & y<z => x < z |
| 6352 | | '-evalu', ':prove x:INTEGER & x<=y & y<=z => x < z', |
| 6353 | | '-evalt', ':prove (r : ran(V) & V: BOOL --> AType & AType = struct(attrs: STRING +-> STRING) ) => r\'attrs : (STRING) +-> (STRING)', |
| 6354 | | '-evalt', ':prove a:NATURAL1 +-> BOOL & a/={} & dom(a)=1..n => 1:dom(a)', |
| 6355 | | '-evalt', ':prove a:1..n --> BOOL & a/={} => 1:dom(a)', |
| 6356 | | '-evalt', ':prove a:1..n >-> BOOL & a/={} => 1:dom(a)', |
| 6357 | | '-evalu', ':prove a:1..n +-> BOOL & a/={} => 1:dom(a)', |
| 6358 | | '-evalt', ':prove (A: BOOL+->BOOL & dom(A)={TRUE} => A /= {})', |
| 6359 | | '-evalt', ':prove a:perm(BOOL) => 1:dom(a)', |
| 6360 | | '-evalt', ':prove a:perm(BOOL) => 2:dom(a)', |
| 6361 | | '-evalu', ':prove a:perm(BOOL) => 3:dom(a)', |
| 6362 | | '-evalu', ':prove a:perm(BOOL) => 0:dom(a)', |
| 6363 | | '-evalt', ':prove not(x=7) or not(x=3)', |
| 6364 | | '-evalt', ':prove x=TRUE => x /= FALSE', |
| 6365 | | '-evalt', ':prove x="TRUE" => x /= "FALSE"', |
| 6366 | | '-evalu', ':prove (x="T" or x="F")', |
| 6367 | | '-evalt', ':prove (x=TRUE or x=FALSE)', |
| 6368 | | '-evalt', ':prove i={2} => i/={1}', |
| 6369 | | '-evalt', ':prove i={2} => i/={1,3}', |
| 6370 | | '-evalt', ':prove i={2,4} => i/={1}', |
| 6371 | | '-evalu', ':prove i={2,4} => i/={4,2}', |
| 6372 | | '-evalu', ':prove i={2,4} => i/={4,z}', |
| 6373 | | '-evalu', ':prove {1,2}/={2,z1,z2,z3}', |
| 6374 | | '-evalt', ':prove {1,2,4} /= {1,2,5} & {1,2,4} /= {xx,yy}', |
| 6375 | | '-evalt', ':prove 1 < z => - z <= -2', |
| 6376 | | '-evalu', ':prove 1 < z => - z < -2', |
| 6377 | | '-evalt', ':prove z>2 => -3* z < -6', |
| 6378 | | '-evalt', ':prove z>=3 => -3* z <= -9', |
| 6379 | | '-evalu', ':prove z>=3 => -3* z <= -10', |
| 6380 | | '-evalt', ':prove z <= 1 => 3*z <= 4', |
| 6381 | | '-evalu', ':prove z <= 2 => 3*z <= 4', |
| 6382 | | '-evalu', ':prove z <= -1 => 3*z <= -4', |
| 6383 | | '-evalt', ':prove z <= -2 => 3*z <= -4', |
| 6384 | | '-evalt', ':prove z <= -2 => 3*z <= -5', |
| 6385 | | '-evalt', ':prove z <= -34 => 3*z <= -100', |
| 6386 | | '-evalu', ':prove z <= -33 => 3*z <= -100', |
| 6387 | | '-evalt', ':prove x>=6 => 11 <= 2*x', |
| 6388 | | '-evalt', ':prove x>=5 => 10 <= 2*x', |
| 6389 | | '-evalu', ':prove x>=5 => 11 <= 2*x', |
| 6390 | | '-evalt', ':prove x>=-5 => -11 <= 2*x', |
| 6391 | | '-evalt', ':prove z>=4 => (-3*z <= -10 & -3*z <= -12)', |
| 6392 | | '-evalu', ':prove z>=3 => -3*z <= -10', |
| 6393 | | '-evalt', ':prove x:INTEGER & -x>=-y => x <= y', |
| 6394 | | '-evalt', ':prove x:INTEGER & x>y => -x < -y', |
| 6395 | | '-evalt', ':prove not(- lo755 <= -1) or - lo755 <= 0', |
| 6396 | | '-evalt', ':prove li2 <= 4 & -li2 <= -4 => not(li2 <= 0)', |
| 6397 | | '-evalt', ':prove not(li2 <= 1) or (not(- li2 <= -1) or not(li2 <= 0))', |
| 6398 | | '-evalt', ':prove (not(li2 <= 1) or not(- li2 <= -1)) or not(li2 <= 0)', |
| 6399 | | '-evalt', ':prove ((x>0 => y>0) & x>0) => y>0', |
| 6400 | | '-evalt', ':prove f:BOOL<->BOOL & (x<:dom(f) or x<:dom(g)) => x <: dom(f\\/g)', |
| 6401 | | '-evalt', ':prove f:BOOL<->BOOL & (x:dom(f) or x:dom(g)) => x : dom(f\\/g)', |
| 6402 | | '-evalt', ':prove !(x,f).(f:INTEGER +-> INTEGER => x:dom(f <+ {x|->x}))', |
| 6403 | | '-evalt', ':prove !(x,y).(x<:INTEGER & x<:y & y<:x => y=x)', |
| 6404 | | '-evalt', ':prove f:BOOL --> 0..n & p>f(TRUE) => p>=1', |
| 6405 | | '-evalu', ':prove f:BOOL --> 0..n & p>f(TRUE) => p>=2', |
| 6406 | | '-evalt', ':prove f:BOOL --> 1..n & p>f(TRUE) => p>=2', |
| 6407 | | '-evalt', ':prove p>l1(niz) & p<=l2(niz) & l1:BOOL --> 1..TE & l2:BOOL-->1..TE & TE:NATURAL1 => ( p-1:1..TE )', |
| 6408 | | '-evalt', ':prove f:BOOL --> 0..10 & p<f(TRUE) => p<=9', |
| 6409 | | '-evalt', ':prove f:BOOL --> 0..10 & p<f(TRUE) => p+1<=10', |
| 6410 | | '-evalt', ':prove f:BOOL --> 0..n & p<f(TRUE) => p+1<=n', |
| 6411 | | '-evalt', ':prove f:BOOL --> m..n & p>f(TRUE) => p-1>=m', |
| 6412 | | '-evalt', ':prove x>y => x/: 1..y', |
| 6413 | | '-evalt', ':prove 10 <= n1 & 10 <= n2 => 20 <= n1+n2', |
| 6414 | | '-evalu', ':prove 1 <= n1 & 1 <= n2 => 3 <= n1+n2', |
| 6415 | | '-evalt', ':prove 1 <= n1 & 1 <= n2 => 2 <= n1+n2', |
| 6416 | | '-evalu', ':prove -2 <= n1 & -2 <= n2 => -3 <= n1+n2', |
| 6417 | | '-evalt', ':prove -1 <= n1 & -1 <= n2 => -3 <= n1+n2', |
| 6418 | | '-evalu', ':prove 5 >= n1 & 5 >= n2 => 9 >= n1+n2', |
| 6419 | | '-evalt', ':prove 10 >= n1 & 10 >= n2 => 20 >= n1+n2', |
| 6420 | | '-evalu', ':prove -1 >= n1 & -1 >= n2 => -3 >= n1+n2', |
| 6421 | | '-evalt', ':prove -1 >= n1 & -1 >= n2 => -2 >= n1+n2', |
| 6422 | | '-evalu', ':prove x<= y & z <= y => x+z <= 1*y', |
| 6423 | | '-evalt', ':prove x<= y & z <= y => x+z <= 2*y', |
| 6424 | | '-evalt', ':prove x:INTEGER & x<= y1 & z <= y2 => x+z <= y1+y2', |
| 6425 | | '-evalt', ':prove x:INTEGER & x<= y1 & z <= y2 => x+z <= y2+y1', |
| 6426 | | '-evalt', ':prove a:INTEGER & a>=b & c>=d => a+c >= b+d', |
| 6427 | | % :prove x:INTEGER & x<= y2 & z <= y1 => x+z <= y2+y1 % would require decompose_floor to be non-det |
| 6428 | | % :prove (x>y & y>z) => x/=z % TO DO |
| 6429 | | '-evalt', ':prove x=3 => not( x=3 => x=2)', |
| 6430 | | '-evalt', ':prove x=2 => x=2', |
| 6431 | | '-evalu', ':prove x=2 => x=3', |
| 6432 | | '-evalu', ':prove not(x=3 => x=2)', |
| 6433 | | '-evalt', ':prove (s2 = s \\/ {0} & s3 = s \\/ {0} & s4 = s2 \\/ {1} & s5 = s3 \\/ {1}) => s4 = s5', |
| 6434 | | '-evalt', ':prove a={1|->11,2|->22} & b={1|->33,4|->44} & ab= a><b => 1:dom(ab)', |
| 6435 | | '-evalu', ':prove a={1|->11,2|->22} & b={1|->33,4|->44} & ab= a><b => dom(ab) <: 2..4', |
| 6436 | | '-evalt', ':prove a={1|->11,2|->22} & b={1|->33,4|->44} & ab= a><b => dom(ab) <: 1..4', |
| 6437 | | '-evalt', ':prove f=%x.(x:1..10|x) & g=%y.(y:5..15|y+1) & fg=f><g & a:5..10 => a:dom(fg)', |
| 6438 | | '-evalt', ':prove f=%x.(x:1..10|x+xx) & g=%y.(y:5..15|y+yy) & fg=f><g & a:5..10 => a:dom(fg)', |
| 6439 | | '-evalu', ':prove f=%x.(x:1..10|x+xx) & g=%y.(y:5..zz|y+yy) & fg=f><g & a:5..10 & zz>=9 => a:dom(fg)', |
| 6440 | | '-evalt', ':prove f=%x.(x:1..10|x+xx) & g=%y.(y:5..zz|y+yy) & fg=f><g & a:5..10 & zz>=10 => a:dom(fg)', |
| 6441 | | '-evalt', ':prove {A,B,C} <: POW(INTEGER) & a:A+->B & b:A+->C => dom(a><b) <: A', |
| 6442 | | '-evalt', ':prove {A,B,C} <: POW(INTEGER) & a:A+->B & b:A+->C => a><b : A+->(INTEGER*INTEGER)', |
| 6443 | | '-evalt', ':prove f=%x.(x:INTEGER|{TRUE|->1,FALSE|->0}(bool(x>0))) => f(a):0..1', |
| 6444 | | '-evalt', ':prove f=%x.(x:INTEGER|IF (x>0) THEN 0 ELSE 1 END) => f(a):0..1', |
| 6445 | | '-evalt', ':prove f=%x.(x:INTEGER|IF (x>0) THEN -1 ELSE 1 END) => f(a):{-1,1}', |
| 6446 | | '-evalu', ':prove a=0 & f=%a.(a:0..3|a) & x:0..10 => x:dom(f)', |
| 6447 | | '-evalu', ':prove a:0..1 & f=%a.(a:2..3|a) => f(x) : 0..1', |
| 6448 | | '-evalt', ':prove a:0..1 & f=%b.(b:2..3|a) => f(x) : 0..1', |
| 6449 | | '-evalu', ':prove x:1..10 & y:1..11 => max({x,y}) : 1..10', |
| 6450 | | '-evalt', ':prove x:1..10 & y:1..10 => max({x,y}) : 1..10', |
| 6451 | | '-evalt', ':prove f = %x.(x:INTEGER|max({x,-x})) => f(y) >=0', |
| 6452 | | '-evalt', ':prove f = %x.(x:INTEGER|max({-x,x})) => f(y) >=0', |
| 6453 | | '-evalu', ':prove f:BOOL +-> BOOL & x|->TRUE /: (f) => f \\/ {x|->TRUE} : BOOL +-> BOOL', %% WRONG |
| 6454 | | % '-evalt', ':prove f:BOOL +-> BOOL & x /: dom(f) => f \\/ {x|->TRUE} : BOOL +-> BOOL', %% NOT yet proven |
| 6455 | | '-evalt', ':prove f:BOOL +-> BOOL & g <: f => f \\/ g : BOOL +-> BOOL', |
| 6456 | | '-evalt', ':prove f:BOOL +-> BOOL & g <: f => g \\/ f : BOOL +-> BOOL', |
| 6457 | | '-evalt', ':prove f:BOOL +-> BOOL & g <: f => f \\/ f : BOOL +-> BOOL', |
| 6458 | | '-evalt', ':prove f:BOOL +-> BOOL & g <: f => g \\/ g : BOOL +-> BOOL', |
| 6459 | | '-evalt', ':prove f:{FALSE} +-> BOOL => f \\/ {TRUE|->x} : BOOL +-> BOOL', |
| 6460 | | '-evalt', ':prove f:BOOL +-> BOOL & x /: dom(f) => f \\/ {x|->TRUE} : BOOL +-> BOOL', |
| 6461 | | '-evalt', ':prove f:BOOL +-> BOOL & x /: a & a=dom(f) => f \\/ {x|->TRUE} : BOOL +-> BOOL', |
| 6462 | | '-evalt', ':prove a /\\ b = {} & a<:BOOL => (a-c) /\\ b = {}', |
| 6463 | | '-evalt', ':prove a /\\ b = {} & a<:BOOL => (a-{x}) /\\ b = {}', |
| 6464 | | '-evalt', ':prove a /\\ b = {} & a<:BOOL & a2 = a -{x} => b /\\ a2 = {}', |
| 6465 | | '-evalt', ':prove a /\\ b = {} & a<:BOOL & a2 = a -{x} & b2=b => a2 /\\ b2 = {}', |
| 6466 | | '-evalt', ':prove a <: b & b<:BOOL & B2 = b \\/ {x} => a<:B2', |
| 6467 | | '-evalt', ':prove f:BOOL<->BOOL & f[a] <: b & b<:BOOL & B2 = b \\/ {x} => f[a]<:B2', |
| 6468 | | '-evalt', ':prove T2_readpriority : NATURAL & BUSwrite : NATURAL +-> INTEGER & 0 : dom(BUSwrite) & T2_readpriority:dom(BUSwrite) & BUSwrite2 = BUSwrite <+ {ppriority |-> pv} => (T2_readpriority:dom(BUSwrite2))', |
| 6469 | | '-evalt', ':prove NS=1..5 & BW:NS+->INTEGER & pmax=max(dom(BW)) => pmax>0', |
| 6470 | | '-evalt', ':prove NS=1..5 & BW:NS+->INTEGER & B=pmax & v=BW(pmax) & pmax=max(dom(BW)) => B>0', |
| 6471 | | '-evalt', ':prove A<:INT & f:A+->A => B <| f : A+->A', |
| 6472 | | '-evalt', ':prove A<:INT & f:A+->A => B <<| f : A+->A', |
| 6473 | | '-evalt', ':prove A<:INT & f:A+->A => f |> B : A+->A', |
| 6474 | | '-evalt', ':prove A<:INT & f:A+->A => f |>> B : A+->A', |
| 6475 | | '-evalt', ':prove A<:INT & f:A+->A => B <| f |> C : A+->A', |
| 6476 | | '-evalt', ':prove x:1..5 & y:1..10 => !z.(z:x..y => z>=1)', |
| 6477 | | '-evalt', ':prove x:1..5 & y:1..10 & z:0..3 => !z.(z:x..y => z>=1)', |
| 6478 | | '-evalt', ':prove x:1..5 & y:1..10 & z:2..3 => !z.(z:x..y => z>=1)', |
| 6479 | | '-evalu', ':prove x:1..5 & y:1..10 & z:2..3 => !z.(z:x..y => z>=2)', |
| 6480 | | '-evalt', ':prove c<: INTEGER & a <: b & b<: c => a <: b', |
| 6481 | | '-evalu', ':prove c<: INTEGER & a <: b & b<: c => c <: b', |
| 6482 | | % '-evalt', ':prove a:0..1 & f=%b.(b:2..3|b) => f(x) : 2..3', % TO DO: add b:2..3 to hyps |
| 6483 | | '-timeout', 200 % timeout per PO |
| 6484 | | ], 'Test WD prover directly'). |
| 6485 | | cli_testcase(2048,[cbc],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6486 | | '-evalt', 'dom(%(x,y,z).(x:BOOL & y:11..22 & z:BOOL|1)) = (X*A)*Z', |
| 6487 | | '-evalf', 'dom(%(x,y,z).(x:BOOL & y:11..22 & z:BOOL|1)) \\/ {(TRUE,33,TRUE)} = (X*A)*Z', |
| 6488 | | '-evalt', 'dom(%(x,y,z).(x:BOOL & y:11..22 & z:BOOL|1)) \\/ (BOOL*{33})*BOOL = (X*A)*Z', |
| 6489 | | '-evalt', 'dom(%(x,y,z).(x:BOOL & y:11..22 & z:BOOL|1)) \\/ (BOOL*{33})*{TRUE} /= (BOOL*(1..1000000))*BOOL', |
| 6490 | | '-evalt', 'dom(%(x,y,z).(x:BOOL & y:11..11 & z:BOOL|1)) \\/ (BOOL*{11})*{TRUE,FALSE} = (XX*AA)*XX', |
| 6491 | | '-evalt', 'dom(%(x,y,z).(x:BOOL & y:11..22 & z:BOOL|1)) \\/ {(TRUE,33,TRUE)} = (X*A)*X <=> (A /= {100} or X/={TRUE})', |
| 6492 | | '-evalt', 'avl = {1|->2, 1|->3} & avl = A*B', |
| 6493 | | '-evalt', 'avl = {(1|->2),(1|->33),(2|->2),(2|->33)} & avl = A*B', |
| 6494 | | '-evalt', 'avl = {(1|->2),(1|->33),(2|->2),(2|->33),(44|->2),(44|->33)} & avl = A*B', |
| 6495 | | '-evalf', 'avl = {1|->2, 2|->3} & avl = A*B', |
| 6496 | | '-evalf', 'avl = {1|->2, 1|->3, 2|->2} & avl = A*B', |
| 6497 | | '-evalf', 'avl = {(1|->2),(1|->33),(2|->2),(2|->33),(44|->2),(44|->33),(44|->44)} & avl = A*B', |
| 6498 | | '-evalf', 'avl = {(1|->2),(1|->33),(2|->2),(2|->33),(44|->2)} & avl = A*B', |
| 6499 | | '-evalf', 'avl = {(1|->2),(1|->33),(2|->2),(44|->2),(44|->33)} & avl = A*B', |
| 6500 | | '-evalf', 'avl = {(1|->2),(1|->33),(2|->33),(44|->2),(44|->33)} & avl = A*B', |
| 6501 | | '-p', 'DATA_VALIDATION', 'TRUE' |
| 6502 | | ], 'Test improved cartesian product equality'). |
| 6503 | | cli_testcase(2049,[kodkod],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 6504 | | '-evalt', ':kodkod A={1,2,44} & B={2,33} & avl = {1|->2, 1|->33, 2|->2, 2|->33, 44|->2, 44|->33} & avl = A*B', |
| 6505 | | '-evalt', ':kodkod A={1,2,44} & avl = {1|->2, 1|->33, 2|->2, 2|->33, 44|->2, 44|->33} & avl = A*B', |
| 6506 | | '-evalt', ':kodkod avl = {1|->2, 1|->33, 2|->2, 2|->33, 44|->2, 44|->33} & avl = A*B', |
| 6507 | | '-evalt', ':kodkod x = {1|->TRUE,2|->TRUE,5|->TRUE} & x=a*b', |
| 6508 | | '-evalf', ':kodkod x = BOOL*BOOL*{TRUE} \\/ {(TRUE,TRUE,FALSE)} & x=a*b', |
| 6509 | | '-evalt', ':kodkod x = BOOL*BOOL*BOOL & x=a*b' |
| 6510 | | ], 'Test corrected cartesian product kodkod propagation rule'). |
| 6511 | | cli_testcase(2050, [b_test,enabling], ['../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest.mch', |
| 6512 | | '-read_write_matrix_csv', '../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest_rw.csv' |
| 6513 | | ], 'Check that read write analysis works for becomes such'). |
| 6514 | | cli_testcase(2051, [b_test,enabling], ['../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest2.mch', |
| 6515 | | '-read_write_matrix_csv', '../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest2_rw.csv' |
| 6516 | | ], 'Check that read write analysis works for becomes such'). |
| 6517 | | cli_testcase(2052, [wd,wd_prover], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6518 | | '../prob_examples/examples/B/ClearSy/cbi/sydb.mch', |
| 6519 | | '-wd-check-all', '-timeout', 200 % timeout per PO |
| 6520 | | ], 'Test private machines can be proven 100%'). |
| 6521 | | cli_testcase(2053,[cbc],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6522 | | '-evalf', ':core (A=TRUE or B=TRUE) & (A=TRUE or C=FALSE) & (A=FALSE or B=FALSE) & (B=TRUE or C=FALSE) & (A=FALSE or B=FALSE) & (A=FALSE or B=TRUE) & (B=FALSE or C=TRUE)', |
| 6523 | | '-evalf', ':core x > 1 & x>2 & x>0 & x <10 & y > x & x > z & z > y & z <12 & y > 2', |
| 6524 | | '-evalf', ':core LET a BE a=x+10 IN y<a & y<100 & y>0 & y>a END', |
| 6525 | | '-evalf', ':core x>2 & y>2 & z>2 & y<2 & z<2 & x<2', |
| 6526 | | '-evalf', ':cores x>2 & y>2 & z>2 & y<2 & z<2 & x<2', |
| 6527 | | '-evalf', ':cores not(x<10 or x>=10 or z>0)', |
| 6528 | | '-evalf', ':cores not(x<10 or x>=10 or z>0 or x>9)', |
| 6529 | | '-evalf', ':min-core x>1 & x<y & y<z & z<2 & x<2', |
| 6530 | | '-evalf', ':min-core x>2 & y>2 & z>2 & y<2 & z<2 & x<v & v<2 & x+y+v /= 0', |
| 6531 | | '-evalf', ':core (x=TRUE => (y>1 & z>1)) & y<0 & (x=FALSE => (y>1 & z<1))' |
| 6532 | | % '-evalf', ':core x>0 & 10/(x*x) < 1 & x<4' % we need to clear WD error ! |
| 6533 | | % '-evalu', ':core x<: POW(BOOL) & x={} & card(res)>1 & res = inter(x) ' |
| 6534 | | ], 'Test unsat core computation'). |
| 6535 | | cli_testcase(2054,[cbc,tickets],[ '-p', 'NORMALIZE_AST', 'TRUE', '-p', 'OPTIMIZE_AST', 'TRUE', |
| 6536 | | '-evalt', '(# /* LET */ (v_1,v_0).( v_1=(8388608 + (P_4 * 2097152 + P_5)) & v_0=((IF P_9 = TRUE THEN 16 ELSE 0 END) + P_10) & (# /* LET */ (v_2).( v_2=bool(mux_I_87477 + v_1 * (3 * - 1) * 64 + P_6 + mux_I_87463 * P_8 + ((IF v_0 < 16 THEN v_0 ELSE v_0 - 32 END) * v_1 * 4 + 0) < 0) & 2 * dz + 1 = (IF not(mux_I_87448 = 0) & v_2 = TRUE THEN 1 ELSE 0 END) - (IF v_2 = TRUE THEN 1 ELSE 0 END))))) & mux_I_87463 <= 15 & 0 <= mux_I_87463 & mux_I_87477 <= 1073741823 & 1073741824 * - 1 <= mux_I_87477 & mux_I_87448 <= 4398046511103 & 0 <= mux_I_87448 & P_10 <= 15 & 0 <= P_10 & P_8 <= 58720268 & 0 <= P_8 & P_7 <= 15 & 0 <= P_7 & P_6 <= 3848290795520 & 0 <= P_6 & P_5 <= 3 & 0 <= P_5 & P_4 <= 3 & 0 <= P_4 & P_3 <= 1 * - 1 & 939524288 * - 1 <= P_3 & P_2 <= 43 & 0 <= P_2' |
| 6537 | | ], 'Test unsat normalize AST issue fixed'). |
| 6538 | | cli_testcase(2055,[smt_solver_integration],[ '-p', 'NORMALIZE_AST', 'TRUE', '-p', 'OPTIMIZE_AST', 'TRUE', |
| 6539 | | '-evalt', ':z3-double-check (# /* LET */ (v_1,v_0).( v_1=(8388608 + (P_4 * 2097152 + P_5)) & v_0=((IF P_9 = TRUE THEN 16 ELSE 0 END) + P_10) & (# /* LET */ (v_2).( v_2=bool(mux_I_87477 + v_1 * (3 * - 1) * 64 + P_6 + mux_I_87463 * P_8 + ((IF v_0 < 16 THEN v_0 ELSE v_0 - 32 END) * v_1 * 4 + 0) < 0) & 2 * dz + 1 = (IF not(mux_I_87448 = 0) & v_2 = TRUE THEN 1 ELSE 0 END) - (IF v_2 = TRUE THEN 1 ELSE 0 END))))) & mux_I_87463 <= 15 & 0 <= mux_I_87463 & mux_I_87477 <= 1073741823 & 1073741824 * - 1 <= mux_I_87477 & mux_I_87448 <= 4398046511103 & 0 <= mux_I_87448 & P_10 <= 15 & 0 <= P_10 & P_8 <= 58720268 & 0 <= P_8 & P_7 <= 15 & 0 <= P_7 & P_6 <= 3848290795520 & 0 <= P_6 & P_5 <= 3 & 0 <= P_5 & P_4 <= 3 & 0 <= P_4 & P_3 <= 1 * - 1 & 939524288 * - 1 <= P_3 & P_2 <= 43 & 0 <= P_2' |
| 6540 | | ], 'Test overflow issue in Z3 interface solved'). |
| 6541 | | cli_testcase(2056,[chr,tickets],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CHR', 'TRUE', |
| 6542 | | '-evalt', 'c1<c2 & x>=-5000 & c1+c2+x < -5000 & c1=-1 & c2=0' |
| 6543 | | ], 'Test bug in CHR/clpfd_check_geq_nr fixed'). |
| 6544 | | cli_testcase(2057, [external, reals], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6545 | | '../prob_examples/public_examples/B/NewSyntax/Reals/RealExternalFunctions.mch', |
| 6546 | | '-evalt', 'r = /*@symbolic*/ {f|f/=1.0} & 2.0 : r', |
| 6547 | | '-assertions' |
| 6548 | | ], 'Test new features on reals'). |
| 6549 | | cli_testcase(2058,[cse,tickets],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CSE', 'TRUE', |
| 6550 | | '-evalt', 'cc=0 & CUST=1..3 & tokens:CUST+->0..3 & not(cc:dom(tokens) & (tokens(cc)<3 => tokens<+{(cc,tokens(cc)+1)}:CUST+->0..3))' |
| 6551 | | ], 'Test bug in CSE and compiling of lazy_lookup with non-WD expression fixed'). |
| 6552 | | cli_testcase(2059,[cse,tickets],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CSE', 'TRUE', |
| 6553 | | '../prob_examples/public_examples/B/Laws/BoolLaws.mch', |
| 6554 | | '-evalt', 'bool(not(pt or qt))=bool(not(pt) & not(qt)) & bool(not(PP=TRUE or TRUE=TRUE))=bool(not(QQ=TRUE) & not(TRUE=TRUE))' |
| 6555 | | ], 'Test bug in CSE and double negation (and negated_cse info) fixed'). |
| 6556 | | cli_testcase(2060, [smt_solver_integration], [ |
| 6557 | | '../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', % for SETS NAME, Code = {c1,c2,c3,c4} |
| 6558 | | '-eval', ':z3-version', |
| 6559 | | '-evalt', ':z3-double-check a<:{11}*{TRUE} & x:a', |
| 6560 | | '-evalt', ':z3-double-check x = 2', |
| 6561 | | '-evalt', ':z3-double-check a<:-1..3 & -1:a', |
| 6562 | | '-evalf', ':z3-double-check a<:-1..3 & -2:a', |
| 6563 | | '-evalt', ':z3-double-check x:BOOL & x=y', |
| 6564 | | '-evalt', ':z3-double-check x:INTEGER & x=y', |
| 6565 | | '-evalt', ':z3-double-check a<:(1..3)*{22} & x:a', |
| 6566 | | %'-evalt', ':z3 a<:(1..n)*{22} & n:0..2 & x:a', |
| 6567 | | '-evalt', ':z3-double-check x ={1|->TRUE, 2|->FALSE} & y=x', % ISSUE SSIMT-2 |
| 6568 | | |
| 6569 | | % some :prove examples from test 2047 |
| 6570 | | '-evalt', ':z3 x:INTEGER & (x>y & y>z) => x>=z', |
| 6571 | | '-evalt', ':z3 !(x,y,z).(x:INTEGER & (x>=y & y>z) => x>z)', |
| 6572 | | '-evalt', ':z3 !(x,y,z).(x:INTEGER & (x>y & y>=z) => x>z)', |
| 6573 | | '-evalf', ':z3 !(x,y,z).(x:INTEGER & (x>=y & y>=z) => x>z)', |
| 6574 | | '-evalt', ':z3 !x.(x:INTEGER => x+1>=x)', |
| 6575 | | '-evalt', ':z3 !x.(x:INTEGER => x/=1+x)', |
| 6576 | | '-evalt', ':z3 !x.(x:INTEGER => x>x-1)', |
| 6577 | | %'-evalt', ':z3 !(x,f).(x:1..10 & f:1..11 --> BOOL => x:dom(f))', % UNKNOWN |
| 6578 | | '-evalt', ':z3 !(x,y).(x:INTEGER & x<y => x:x..y)', |
| 6579 | | '-evalt', ':z3 !(x,y).(x:INTEGER & x<=y => x:x..y)', |
| 6580 | | '-evalf', ':z3 !(x,y).(x:INTEGER & x>y => x:x..y)', |
| 6581 | | '-evalt', ':z3 !(x,y,z).(x:INTEGER & z:x..y => x:x..y)', |
| 6582 | | '-evalf', ':z3 !(x,y,z).(x:INTEGER & z:y..y => x:x..y)', |
| 6583 | | '-evalt', ':z3 !a.(a:INTEGER & a>0 => 10+a>=10)', |
| 6584 | | '-evalt', ':z3 !(a,b).(a:INTEGER & a>=0 & b>0 => a mod b <= b)', |
| 6585 | | '-evalf', ':z3 !(a,b).(a:INTEGER => a mod b <= b)', % this is not WD and false after adding WD conditions on the right-hand side of the implication |
| 6586 | | % :z3 !(x,n).(x:1..n & n>1 => (x+1) mod n : 1..(n)) % UNKNOWN |
| 6587 | | '-evalt', ':z3 !(x,y,z).(x:INTEGER & x<y & y<z => x < z)', |
| 6588 | | % :z3 !(a,n).(a:NATURAL1 +-> BOOL & a/={} & dom(a)=1..n => 1:dom(a)) % UNKNOWN |
| 6589 | | % :z3 !(x,f).(f:INTEGER +-> INTEGER => x:dom(f <+ {x|->x})) % UNKNOWN |
| 6590 | | % :z3 !(x,f).(f:1..10 --> INTEGER & x>1 & x<10 => x:dom(f)) % UNKNOWN |
| 6591 | | '-evalt', ':z3 !(x,y).(x<:INTEGER & x<:y & y<:x => y=x)', |
| 6592 | | |
| 6593 | | % examples using enumerated/deferred sets |
| 6594 | | '-evalt', ':z3-double-check res = {c1} \\/ ({c2} /\\ {c1})', |
| 6595 | | '-evalt', ':z3-double-check res = {c1} \\/ ({c2} \\ {c1})', |
| 6596 | | '-evalt', ':z3-double-check not(c1:res) & not(c2:res) & c3:res', |
| 6597 | | |
| 6598 | | '-evalt', ':z3-double-check x =[2,3] & y=x~ & d = {v|#(w).(w:{3} & (w,v):y)}', |
| 6599 | | '-evalt', ':z3-double-check x =[2,3] & y=x~ & d = y[{3,4}]', |
| 6600 | | '-evalt', ':z3 x =[2,3] & d = x~[{3,4}]', |
| 6601 | | |
| 6602 | | '-evalt', ':z3-double-check x ={1|->TRUE, 2|->FALSE} & y=x~', |
| 6603 | | '-evalt', ':z3-double-check x ={1|->TRUE, 2|->FALSE} & y= {TRUE|->FALSE}', |
| 6604 | | '-evalt', ':z3-double-check x = %i.(i:1..10|i+i) & x[{5,j}]={16,10}', |
| 6605 | | '-evalt', ':z3 dom({1|->1}/\\{2|->3}) = {}', |
| 6606 | | |
| 6607 | | % clash checks Code = {c1,c2,c3,c4}, db,active,activec={} |
| 6608 | | '-evalf', ':z3-double-check dom(db) /= active', |
| 6609 | | '-evalt', ':z3-double-check #active.(dom(db) /= active)', |
| 6610 | | '-evalt', ':z3-double-check #db.(db /= active)', |
| 6611 | | '-evalf', ':z3-double-check #(c1,c2).(c1:Name & c2:Code & db={c1|->c2})', |
| 6612 | | '-evalt', ':z3-double-check #(c1,c2,db).(c1:Name & c2:Code & db={c2|->c1})', |
| 6613 | | '-evalt', ':z3-double-check #(c1,c2).(c1:Name & c2:Code & (c1:active <=> c2:activec))', |
| 6614 | | '-evalt', ':z3 !(c1,c2).(c1:db & c2:db => c1=c2)', % db is empty, was unsupported LEQ_SYM |
| 6615 | | % precomputation |
| 6616 | | '-evalt', ':z3-double-check x : POW({1,2,y}) & z:x & z>2', |
| 6617 | | '-evalt', ':z3-double-check {1|->2,e}~ = r', |
| 6618 | | '-evalf', ':z3-double-check id0 : INTEGER & 85 > 3 mod id0 => 1=2', |
| 6619 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6620 | | ], 'some simple constraints that should be solved by cvc4 / z3'). |
| 6621 | | cli_testcase(2061, [cbc,atelierb,chr,disprover,private], [ |
| 6622 | | '../prob_examples/examples/B/Alstom/DisproverProject/ProvableByPP/prob2023.mch', |
| 6623 | | '-p', 'CHR', 'TRUE', '-p', 'SMT', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', |
| 6624 | | '-cbc_assertions_tautology_proof', |
| 6625 | | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], |
| 6626 | | 'Test Atelier-B Disprover interface and non-critical enum warning ignored'). |
| 6627 | | cli_testcase(2062, [kodkod,tickets], [ |
| 6628 | | '-evalt', ':kodkod b = {x | x>2 & x<3}', |
| 6629 | | '-evalf', ':kodkod x>2 & x<3', |
| 6630 | | '-evalt', ':kodkod (f3={a,c,e|a:NATURAL & c:NATURAL1 & e:{x|x=1 & x=2} & a=1 & c=2})', |
| 6631 | | '-evalt', ':kodkod (f1={a,e|a:INTEGER & e:{TRUE} & a=1}) & (f2={a,c,e|a:INTEGER & e:{TRUE} & a=1 & c:NATURAL1 & e:{FALSE}}) & (f3={a,c,e|a:NATURAL & c:NATURAL1 & e:{x|x=1 & x=2} & a=1}) & (f4={a,c,e|a:NATURAL & c:NATURAL1 & e:INTEGER & a=-1}) & (f5={a,b|a>2 & a<1 & b=a}) & (f6=%x.(x>10 & x<20|100)) & (f7={a,b|a:NATURAL1 & b=a & a<=20}) & (i1={a,c,e|a:INTEGER & e:{TRUE} & a=1 & c:NATURAL1}) & (i2={a,c,e|a:INTEGER & e:{TRUE} & a=1 & c>4000}) & (i3={a,b,c|a:NATURAL1 & b<0 & c>10}) & (i4={a,b|a>=200 & b=a*a}) & (i5=%x.(x>10|100+x)) & (i6={x,y,z|z=x+y & x>100 & y:{200,201}}) & i4/:FIN(i4)' % not all predicates are translated |
| 6632 | | ], 'check no inconsistency detected at top-level (Ticket KODKOD-4)'). |
| 6633 | | cli_testcase(2063, [smt_solver_integration,tickets], [ |
| 6634 | | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSet5.mch', |
| 6635 | | '-p', 'TIME_OUT', '30000', |
| 6636 | | '-evalt', ':z3-double-check (ID=P1\\/P2) & (P1/\\P2={}) & (aa/=bb) & ({aa,bb,xx}<:ID) & (card(ID)=5) & (aa:P1) & (bb:P2) & (xx:P2) & (xx/=bb) & (card(P1)=1) & not((aa:P1) & (bb:P2) & (xx:P2) & (xx=bb) & (card(P1)=1))' |
| 6637 | | % seems to run into time-out sometimes |
| 6638 | | ], 'check model translation works and as const bug fixed (Ticket SSIMT-8)'). |
| 6639 | | cli_testcase(2064, [cbc,tickets,sigma], [ |
| 6640 | | '-evalf', 'PI(x).(x:{0,y}|x)=2', % was reporting solution y=2 |
| 6641 | | '-evalt', 'PI(x).(x:{1,y}|x)=2', |
| 6642 | | '-evalf', 'SIGMA(x).(x:{1,y}|x)=2', |
| 6643 | | '-evalt', 'SIGMA(x).(x:{1,y}|x)=3', |
| 6644 | | '-evalt', 'SIGMA(x).(x:{0,y}|x)=22', |
| 6645 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6646 | | ], 'check issue with PI and 0 accumulator fixed'). |
| 6647 | | cli_testcase(2065, [external,reals,sigma], [ |
| 6648 | | '-evalt', 'PI(x).(x:{1.0,y}|x)=2.0', |
| 6649 | | '-evalt', 'SIGMA(x).(x:{1.0,2.0}|x) = 3.0', |
| 6650 | | '-evalf', 'SIGMA(x).(x:{1.0,2.0}|x) = 2.0', |
| 6651 | | '-evalt', 'PI(x).(x:{1.0,2.0}|x) = 2.0', |
| 6652 | | '-evalt', 'SIGMA(x).(x:{1.0,2.0}|x+x) = 6.0', |
| 6653 | | '-evalt', 'PI(x).(x:{1.0,2.0}|x+x) = 8.0', |
| 6654 | | '-evalt', 'SIGMA(x).(x:1..100|real(x)) = 5050.0', |
| 6655 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6656 | | ], 'check SIGMA and PI work with reals'). |
| 6657 | | cli_testcase(2066, [cbc,infinite], [ |
| 6658 | | '-evalt', 'f = /*@symbolic */ %x.(x:NATURAL|x mod 2) & res = f \\ f & r2 = f /\\ f', |
| 6659 | | '-evalt', 'f = /*@symbolic */ %x.(x:NATURAL|x mod 2) & res = f \\ f & res={}', |
| 6660 | | '-evalt', 'f = /*@symbolic */ %x.(x:NATURAL|x mod 2) & r2 = f /\\ f & r2 = f', |
| 6661 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6662 | | ], 'check symbolic treatment of intersection and set subtraction / difference'). |
| 6663 | | cli_testcase(2067,[b_test,operation_calls_in_expr],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6664 | | '../prob_examples/public_examples/B/NewSyntax/CallOperationInExprMultipleReturns.mch', |
| 6665 | | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', |
| 6666 | | '-assertions', |
| 6667 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6668 | | ], 'Test calling operations in expressions with multiple return args'). |
| 6669 | | cli_testcase(2068, [sequences,infinite,exists], [ |
| 6670 | | '-evalt', 'SB = {x|#n.(x:1..n >-> BOOL)} & [TRUE,FALSE] : SB & [] : SB', |
| 6671 | | '-evalt', 'SB = {x|#n.(x:1..n --> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] : SB & [] : SB', |
| 6672 | | '-evalt', 'SB = {x|#n.(n:NATURAL1 & x:1..n --> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] : SB & [] /: SB', |
| 6673 | | '-evalt', 'SB = {x|#n.(n>0 & x:1..n --> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] : SB & [] /: SB', |
| 6674 | | '-evalt', 'SB = {x|#n.(n>=1 & x:1..n --> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] : SB & [] /: SB', |
| 6675 | | '-evalt', 'SB = {x|#n.(0<n & x:1..n --> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] : SB & [] /: SB', |
| 6676 | | '-evalt', 'SB = {x|#n.(n:NATURAL & x:1..n --> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] : SB & [] : SB', |
| 6677 | | '-evalt', 'SB = {x|#n.(n:NATURAL1 & x:1..n >-> NATURAL)} & [11,22] : SB & [22,22] /: SB & [] /: SB', |
| 6678 | | '-evalt', 'SB = {x|#n.(x:1..n >->> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] /: SB & perm(BOOL) = SB', |
| 6679 | | '-evalt', 'SB = {x|#n.(n:NATURAL1 & x:1..n >->> BOOL)} & [TRUE,FALSE] : SB & [TRUE,TRUE] /: SB & perm(BOOL) = SB', |
| 6680 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6681 | | ], 'check detection of sequence operator written using exists'). |
| 6682 | | cli_testcase(2069, [cbc,infinite], [ |
| 6683 | | '-evalt', 'bs = (NATURAL*{TRUE}) & bs2 = bs <+ {0|->FALSE} & bf = 0..3 <| bs2', |
| 6684 | | '-evalt', 'bs = (NATURAL*{TRUE}) & bs2 = bs <+ {2|->FALSE} & bf = 1..3 <| bs2 & bf = [TRUE,FALSE,TRUE]', |
| 6685 | | '-evalt', 'bs = (NATURAL*{TRUE}) & bs2 = bs <+ {0|->FALSE} & bs3 = bs <+ {3|->FALSE} & bf = 0..4 <| bs2', |
| 6686 | | '-evalt', 'bs = (NATURAL*{TRUE}) & bs2 = bs <+ {0|->FALSE} & bf = {x|x>3} <<| bs2', |
| 6687 | | '-evalt', 'bs = (NATURAL*{TRUE}) & bs2 = bs <+ {0|->FALSE} & bf = {x|x>3} <<| bs2 & bf = {(0|->FALSE),(1|->TRUE),(2|->TRUE),(3|->TRUE)}', |
| 6688 | | '-evalt', 'bs = (NATURAL*{TRUE}) & bf = bs |>> {TRUE}', |
| 6689 | | '-evalt', 'bs = (NATURAL*{TRUE}) & bf = bs |>> {TRUE} & bf={}', |
| 6690 | | '-evalt', 'f = /*@symbolic */ {x,y,z|x+y=z & x>y & x:NATURAL & y:NATURAL} & r=(0..2)*(0..1) <| f', |
| 6691 | | '-evalt', 'f = /*@symbolic */ {x,y,z|x+y=z & x>y & x:NATURAL & y:NATURAL} & r=(0..2)*(0..1) <| f & r = {(1|->0|->1),(2|->0|->2),(2|->1|->3)}', |
| 6692 | | '-evalt', 'f = /*@symbolic */ {x,y,z,r|x+y+z=r & x:NATURAL & y:NATURAL & z:NATURAL} & r= f |> {3}', |
| 6693 | | '-evalt', 'f = /*@symbolic */ {x,y,z,r|x+y+z=r & x:NATURAL & y:NATURAL & z:NATURAL} & r= f |> {0,1} & r = {(0|->0|->0|->0),(0|->0|->1|->1),(0|->1|->0|->1),(1|->0|->0|->1)}', |
| 6694 | | '-evalt', ' f = /*@symbolic */ {x,y,z,r|x+y+z=r & x:NATURAL & y:NATURAL & z:NATURAL} & BB={0,1} & ff = (BB*BB*BB) <| f ', |
| 6695 | | '-evalt', ' f = /*@symbolic */ {x,y,z,r|x+y+z=r & x:NATURAL & y:NATURAL & z:NATURAL} & BB={0,1} & ff = (BB*BB*BB) <| f & ff = {(0|->0|->0|->0),(0|->0|->1|->1),(0|->1|->0|->1),(0|->1|->1|->2),(1|->0|->0|->1),(1|->0|->1|->2),(1|->1|->0|->2),(1|->1|->1|->3)}', |
| 6696 | | '-evalt', 'f = /*@symbolic */ {x,y,z,r|x+y+z=r & x:NATURAL & y:NATURAL & z:NATURAL} & BB={1} & ff = (BB*BB*BB) <| f & ff = {1|->1|->1|->3}', |
| 6697 | | '-evalt', 'f = /*@symbolic */ {x,y,z,r|x+y+z:{r,r+1} & x:NATURAL & y:NATURAL & z:NATURAL} & BB={1} & ff = (BB*BB*BB) <| f & ff = {(1|->1|->1|->2),(1|->1|->1|->3)}', |
| 6698 | | % TO DO: bs = (NATURAL*{TRUE}) & bs2 = bs <+ {0|->FALSE} & bf = bs2 |> {FALSE} |
| 6699 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6700 | | ], 'check symbolic treatment for domain restriction for closures'). |
| 6701 | | cli_testcase(2070, [cbc,clpfd_tables], [ |
| 6702 | | '-evalt', '3 : {r,r+1}', |
| 6703 | | '-evalt', 'card({r|3 : {r,r+1}}) /= 3', |
| 6704 | | '-evalt', '{r|3 : {r,r+1}} = {2,3}', |
| 6705 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6706 | | ], 'check that element/3 constraint also enumerates before enumeration warnings are generated'). |
| 6707 | | cli_testcase(2071, [cbc,cbc_tests], [ |
| 6708 | | '../prob_examples/examples/B/Altran/SafetyLogic_Anime_m3_mch.eventb', |
| 6709 | | '-cbc_tests', 5, 'trainKind(tr1):{Ertms}', '../prob_examples/examples/B/Altran/test_2071_cbc.xml', |
| 6710 | | '-cbc_cover', 'trainEntring', '-force_no_silent' |
| 6711 | | ], 'check that test-case generation works for Altran example'). |
| 6712 | | cli_testcase(2072, [cbc,cbc_tests], [ |
| 6713 | | '../prob_examples/examples/B/Altran/SafetyLogic_Anime_m3_mch.eventb', |
| 6714 | | '-cbc_tests', 3, '{Ertms}=ran(trainKind)', '../prob_examples/examples/B/Altran/test_2072_cbc.xml', |
| 6715 | | '-cbc_cover', 'trainEntring', |
| 6716 | | '-expcterr', 'cbc_tests', '-force_no_silent' |
| 6717 | | ], 'check that no instantation or other error; coverage cannot be achieved here'). |
| 6718 | | cli_testcase(2073, [cbc,infinite], [ |
| 6719 | | %'-evalt', 'f = %x.(x:NATURAL|x+1) & g = f <+ {0|->0} & g : INTEGER +-> INTEGER', % NOW UNKOWN |
| 6720 | | %'-evalt', 'g = /*@symbolic*/ {x,rr|x |-> rr : {(0|->0)} or (x /: {0} & (x : NATURAL & rr = x + 1))} & g:NATURAL +-> NATURAL', % NOW UNKOWN |
| 6721 | | '-evalf', 'g = /*@symbolic*/ {x,rr|x |-> rr : {(0|->0)} or (x /: {0} & (x : NATURAL & rr = x + 1))} & g:NATURAL1 +-> NATURAL', |
| 6722 | | '-evalf', 'g = /*@symbolic*/ {x,rr|x |-> rr : {(0|->0)} or (x /: {0} & (x : NATURAL & rr = x + 1))} & g:NATURAL +-> NATURAL1', |
| 6723 | | '-evalf', 'g = /*@symbolic*/ {x,rr|x |-> rr : {(1|->1)} or (x /: {0} & (x : NATURAL & rr = x + 1))} & g:NATURAL +-> NATURAL1', |
| 6724 | | %'-evalt', 'g = /*@symbolic*/ {x,rr|x |-> rr : {(1|->1)} or (x /: {1} & (x : NATURAL & rr = x + 1))} & g:NATURAL +-> NATURAL1', % NOW UNKNOWN, requires CHR |
| 6725 | | '-evalf', 'f = /*@symbolic */ {x,y|x:NATURAL & (x>=100 => y=100) & (x<100 => y=x)} & f:NATURAL +-> NATURAL1', |
| 6726 | | %'-evalt', 'f = /*@symbolic */ {x,y|x:NATURAL & (x>=100 => y=100) & (x<100 => y=x+1)} & f:NATURAL +-> NATURAL1', % NOW UNKOWN |
| 6727 | | %'-evalt', 'f = /*@symbolic */ {x,y|x:NATURAL & (x>=100 => y=100) & (x<100 => y=x)} & f:NATURAL +-> NATURAL', |
| 6728 | | '-evalt', 'f = /*@symbolic */ {x,y|x:NATURAL & y = IF (x>=100) THEN 100 ELSE x END} & f:NATURAL +-> NATURAL', |
| 6729 | | '-evalf', 'NATURAL*{1,3} = f & f: NATURAL +-> NATURAL', |
| 6730 | | '-evalt', 'NATURAL*{1} = f & f: NATURAL +-> NATURAL1', |
| 6731 | | '-evalt', 'f = %x.(x:1..10|10) \\/ %x.(x>10|11) & f: NATURAL1 +-> 10..11' |
| 6732 | | % does not work: f = /*@symbolic */ {x,y|x:NATURAL & (x>=100 => y=100) & (x<100 => y=x+1)} & f:NATURAL +-> 1..100 |
| 6733 | | % because this does not work: {x,y|y /: (1 .. 10) & (x : NATURAL & (x >= 10 => y = 10) & (x < 10 => y = x + 1))} = {} |
| 6734 | | % this does work: {x,y|y /: (1 .. 10) & (x : NATURAL & y=IF x >= 10 THEN 10 ELSE x + 1 END)} = {} |
| 6735 | | %'-p', 'STRICT_RAISE_ENUM_WARNINGS', 'FALSE' % TODO: TRUE by avoiding expansions of symbolic closures ? |
| 6736 | | ], 'check symbolic treatment for partial function check'). |
| 6737 | | cli_testcase(2074, [cbc,infinite,exists], [ |
| 6738 | | '-evalt', 'g = /*@symbolic*/ {x,rr|x |-> rr : {(1|->1)} or (x /: {1} & (x : NATURAL & rr = x + 1))} & dom(g)=dd & dd=NATURAL', |
| 6739 | | '-evalf', 'g = /*@symbolic*/ {x,rr|x |-> rr : {(1|->1)} or (x /: {1} & (x : NATURAL & rr = x + 1))} & dom(g)=dd & dd=NATURAL1', |
| 6740 | | '-evalt', 'f = /*@symbolic*/ %x.(x:NATURAL|x+1) & g = f <+ {1|->1} & dom(g)=dd & dd=NATURAL', |
| 6741 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6742 | | ], 'check symbolic treatment for domain with optimized exists construction'). |
| 6743 | | cli_testcase(2075, [cbc,infinite], [ |
| 6744 | | '-evalf', 'f = %x.(x:NATURAL|x+1) <+ {0|->0} & f:NATURAL --> NATURAL1', |
| 6745 | | '-evalt', 'f = %x.(x:1..10|0) \\/ %x.(x>10|x) & f: NATURAL1 --> NATURAL', |
| 6746 | | '-evalf', 'f = %x.(x:1..10|0) \\/ %x.(x>=10|x) & f: NATURAL1 --> NATURAL', |
| 6747 | | '-evalt', 'f = %x.(x:1..10|10) \\/ %x.(x>=10|x) & f: NATURAL1 --> NATURAL', |
| 6748 | | '-evalt', 'f = %x.(x:1..10|10) \\/ %x.(x>=10|x) & f: NATURAL1 --> NATURAL1', |
| 6749 | | '-evalt', 'f = %x.(x:1..10|10) \\/ %x.(x>=10|x) & f: NATURAL1 --> GT9 & GT9 = {x|x>9}', |
| 6750 | | '-evalt', 'f = %x.(x:1..10|10) \\/ %x.(x>10|11) & f: NATURAL1 --> 10..11', |
| 6751 | | '-evalt', 'f = %x.(x:NATURAL|x) <+ {0|->1} & f:NATURAL --> NATURAL1', |
| 6752 | | '-evalt', 'f = %x.(x:1..10|{10}) \\/ %x.(x>10|{x,10}) & f: NATURAL1 --> POW(NATURAL1)', |
| 6753 | | '-evalt', 'f= /*@symbolic*/ {domid,ranid|domid |-> ranid : {(1|->TRUE)} or (domid /: {1} & (ranid = FALSE & domid : NATURAL))} & f:NATURAL --> BOOL', % example from Kraibi/Modele00_r1_prob_mch |
| 6754 | | %'-evalt', 'f = %x.(x:NATURAL|x+1) <+ {0|->0} & f:NATURAL --> NATURAL' |
| 6755 | | % f = %x.(x<=10|11) \/ %x.(x>=10|x+1) & f: INTEGER --> NATURAL |
| 6756 | | % f = %x.(x:1..10|0) \/ %x.(x>10|x+1) & f: NATURAL1 --> NATURAL |
| 6757 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6758 | | ], 'check symbolic treatment of total function'). |
| 6759 | | cli_testcase(2076, [alloy], [ |
| 6760 | | '../prob_examples/public_examples/Alloy/SimpleTests/overflow/milicevic.als', |
| 6761 | | '-strict', '-mc', 10, '-nodead', '-cc', 2, 1 |
| 6762 | | ], 'Check util/boolean supported and no overflow detected'). |
| 6763 | | cli_testcase(2077, [b_test,json_trace_replay,visb], [ |
| 6764 | | '../prob_examples/public_examples/B/VisB/Train/SimpleTrainTrack.mch', |
| 6765 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/VisB/Train/SimpleTrainTrack.prob2trace', |
| 6766 | | '-visb', '../prob_examples/public_examples/B/VisB/Train/Track.json', |
| 6767 | | '../prob_examples/public_examples/B/VisB/Train/Track_Trace.html'], 'Check JSON replay and VisB HTML generation'). |
| 6768 | | cli_testcase(2078, [infinite], [ |
| 6769 | | '-evalt', 'f = %x.(x:INTEGER|x+1) & r = %y.(y:1..n|n+1) & res = ((r;f);f) & n=10000', |
| 6770 | | '-evalt', 'f = %i.(i:1..3000|x+i) & a = %x.(x:INTEGER|x+1) & res = (f;a) & x:0..20 & res(1)=11' |
| 6771 | | ], 'Check symbolic relational composition'). |
| 6772 | | cli_testcase(2079, [ltsmin_test], ['../prob_examples/public_examples/B/Ivo/SleepSetsStudyCase.mch', '-mc-with-lts-seq', '-noinv', '-expcterr', 'ltsmin_counter_example_found', %'deadlock', '-cc',7,7, |
| 6773 | | '-strict'], 'A variation of deadlock test 1138 for LTSmin.'). |
| 6774 | | cli_testcase(2080, [ltsmin_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', |
| 6775 | | '-mc-with-lts-seq', '-noinv', '-expcterr', 'ltsmin_counter_example_found', %'deadlock', |
| 6776 | | '-strict'], 'A variation of deadlock test 203 for LTSmin.'). |
| 6777 | | cli_testcase(2081, [ltsmin_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M3_mch.eventb', |
| 6778 | | '-mc-with-lts-seq', '-noinv', '-expcterr', 'ltsmin_counter_example_found', %'deadlock', |
| 6779 | | '-strict'], 'A variation of deadlock test 203 for LTSmin.'). |
| 6780 | | cli_testcase(2082, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', |
| 6781 | | '-model-check', '-noinv', '-expcterr', 'deadlock', |
| 6782 | | '-p', 'COMPRESSION', 'TRUE', |
| 6783 | | '-strict'], 'A variation of deadlock test 203 with COMPRESSION.'). |
| 6784 | | cli_testcase(2083, [ltsmin_test], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', |
| 6785 | | '-mc-with-lts-seq', '-nodead', '-strict'], |
| 6786 | | 'Test 1043 with LTSMin.'). |
| 6787 | | cli_testcase(2084, [ltsmin_test], [ |
| 6788 | | '../prob_examples/public_examples/B/Benchmarks/CSM.mch', % '-check_complete','-cc', '341', '1229' |
| 6789 | | '../prob_examples/public_examples/B/Benchmarks/scheduler.mch', % '-check_complete', '-cc', '36', '121' |
| 6790 | | '-mc-with-lts-seq', '-nodead', '-strict'], |
| 6791 | | 'Test 13, 14 with LTSMin.'). |
| 6792 | | cli_testcase(2085, [bench,operation_reuse,operation_reuse_full], ['../prob_examples/public_examples/B/Benchmarks/CSM.mch', '-mc', '1000', '-strict', |
| 6793 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'OPERATION_REUSE', full, |
| 6794 | | '-check_complete', '-cc', '341', '1229'], 'Test 13 (CSM) with compression and reuse'). |
| 6795 | | cli_testcase(2086, [infinite], [ |
| 6796 | | '-evalf', 'f = %t.(t : NATURAL|t + 100) & f /: NATURAL +-> NATURAL', |
| 6797 | | '-evalt', 'f = %t.(t : NATURAL|t + 100) & f : NATURAL +-> NATURAL', |
| 6798 | | '-evalt', 'f = %t.(t : NATURAL|t + 100) & f /: NATURAL1 +-> NATURAL', |
| 6799 | | '-evalt', 'f = %t.(t : NATURAL|t - 1) & f /: NATURAL +-> NATURAL', |
| 6800 | | '-evalt', 'f = /*@symbolic */ %p.(p:BOOL|(%t.(t:NATURAL|t+100))) & f: BOOL --> (NATURAL +-> NATURAL)' |
| 6801 | | ], 'Check symbolic treatment of not partial function test'). |
| 6802 | | cli_testcase(2087, [infinite], [ |
| 6803 | | '-evalf', 'f = %t.(t : NATURAL|t + 100) & f /: NATURAL --> NATURAL', |
| 6804 | | '-evalt', 'f = %t.(t : NATURAL|t + 100) & f : NATURAL --> NATURAL1', |
| 6805 | | '-evalt', 'f = %t.(t : NATURAL|t + 100) & f /: NATURAL1 --> NATURAL', |
| 6806 | | '-evalt', 'f = %t.(t : NATURAL1|t + 100) & f /: NATURAL --> NATURAL', |
| 6807 | | '-evalt', 'f = %t.(t : NATURAL|t - 1) & f /: NATURAL --> NATURAL', |
| 6808 | | '-evalt', 'f = /*@symbolic */ %p.(p:BOOL|(%t.(t:NATURAL|t+100))) & f: BOOL --> (NATURAL --> NATURAL)' |
| 6809 | | ], 'Check symbolic treatment of not total function test'). |
| 6810 | | cli_testcase(2088, [infinite], [ |
| 6811 | | '-evalf', 'n:NATURAL & n..(n+1) /<: NATURAL', |
| 6812 | | '-evalt', 'n:NATURAL & n..(n+1) /<: NATURAL1', |
| 6813 | | '-evalf', 'n:NATURAL & n..(n+1) /<: {x|x>=0}', |
| 6814 | | '-evalf', 'n>100 & n..(n+1) /<: {x|x>=100}', |
| 6815 | | '-evalt', 'n:NATURAL & n..(n+1) /<: {x|x<10}', |
| 6816 | | '-evalt', 'n:NATURAL & n..(n) /<: {x|x<10}', |
| 6817 | | '-evalf', 'n<10 & n..(n) /<: {x|x<10}', |
| 6818 | | '-evalt', 'n<10 & n..(n+1) /<: {x|x<10}', |
| 6819 | | '-evalf', 'n<9 & n..(n+1) /<: {x|x<10}', |
| 6820 | | '-evalf', 'n..(n+1) /<: {x|x:INTEGER}', |
| 6821 | | '-evalt', 'f = /*@symbolic */ %p.(p:BOOL|(%t.(t:NATURAL|t..(t+100)))) & f: BOOL --> (NATURAL --> POW(NATURAL))' |
| 6822 | | ], 'Check symbolic treatment of not subset for intervals'). |
| 6823 | | cli_testcase(2089, [infinite], [ |
| 6824 | | '-evalf', 'f = %t.(t : NATURAL|t - 1) & f : NATURAL -->> NATURAL1', |
| 6825 | | '-evalt', 'f = %t.(t : NATURAL|t - 1) & f /: NATURAL -->> NATURAL1', |
| 6826 | | '-evalf', 'f = %t.(t : NATURAL|t - 1) & f : NATURAL +->> NATURAL1', |
| 6827 | | '-evalf', 'f = %t.(t : NATURAL|t + 2) & f : NATURAL -->> NATURAL1', |
| 6828 | | '-evalt', 'f = %t.(t : NATURAL|t - 1) & f /: NATURAL +->> NATURAL1', |
| 6829 | | '-evalt', 'f = %t.(t : NATURAL|t - 1) & f /: NATURAL -->> NATURAL1', |
| 6830 | | % still unknown: f = %t.(t : NATURAL|t + 1) & f /: NATURAL +->> NATURAL1 because z_ : NATURAL1 & not(#t.(t : NATURAL & z_ = t + 1)) is unknown |
| 6831 | | '-evalf', '/*@symbolic */ {x|#y.(y:NATURAL & x=y-2)} <: NATURAL', |
| 6832 | | '-evalt', '/*@symbolic */ {x|#y.(y:NATURAL & x=y+2)} <: NATURAL', |
| 6833 | | '-evalf', 'NATURAL <: /*@symbolic */ {x|#y.(y:NATURAL & x=y-2)} ', |
| 6834 | | '-evalf', 'NATURAL <: /*@symbolic */ {x|#y.(y:NATURAL & x=y+2)} ', |
| 6835 | | '-evalt', 'NATURAL1 /<: /*@symbolic */ {x|#y.(y:NATURAL & x=y+2)}', |
| 6836 | | '-evalf', '/*@symbolic */ {x|#y.(y:NATURAL & x=y+2)} /<: NATURAL', |
| 6837 | | '-evalt', '/*@symbolic */ {x|#y.(y:NATURAL & x=y-2)} /<: NATURAL', |
| 6838 | | '-evalt', 'z:NATURAL1 & not(#y.(y:NATURAL & z=y+2))', |
| 6839 | | '-evalf', 'f = /*@symbolic */ %p.(p:BOOL|(%t.(t:NATURAL|t+100))) & f: BOOL --> (NATURAL -->> NATURAL)' |
| 6840 | | ], 'Check symbolic treatment of total surjection and not subset'). |
| 6841 | | cli_testcase(2090, [tla,json_trace_replay], ['../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/Einstein_v2.tla', |
| 6842 | | '-trace_replay', 'json', '../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/Einstein_v2.prob2trace', |
| 6843 | | % '-t', |
| 6844 | | '-mc', 5, '-nodead'], 'check TLA model can be solved and FALSE action loaded (requires tla2bast 1.1.4)'). |
| 6845 | | cli_testcase(2091, [cbc], [ |
| 6846 | | '-evalt', 'memp : seq(STRING) & memp /= [] & dom(memp) <<: 1 .. 20', |
| 6847 | | '-evalt', 'memp : seq(STRING) & memp /= [] & dom(memp) <<: 1 .. 200', |
| 6848 | | '-evalt', 'memp : seq(STRING) & memp /= [] & dom(memp) <<: 1 .. 2000', |
| 6849 | | '-evalt', 'memp : seq(STRING) & memp /= [] & dom(memp) <<: 1 .. 20 & dom(memp) /= {}', |
| 6850 | | '-evalt', 'memp : seq(STRING) & memp /= [] & dom(memp) <: 1 .. 20 & dom(memp) /= {}', |
| 6851 | | '-evalt', 'memp : seq(STRING) & memp /= [] & dom(memp) <<: 1 .. 43', |
| 6852 | | '-evalt', 'memp : seq(STRING) & (1 .. 43 /\\ dom(memp)) /= {} & dom(memp) <<: 1 .. 43', |
| 6853 | | '-evalt', 'memp : seq(STRING) & mdp >=0 & mdp < 1 & memp /= {} & (mdp + 1 .. mdp + 43 /\\ dom(memp)) /= {} & dom(memp) <<: mdp + 1 .. mdp + 43' |
| 6854 | | ], 'Check strict subset issues solved'). % related to test 1003 (plavis-TransData_SP_13.prob) |
| 6855 | | cli_testcase(2092, [cbc], [ |
| 6856 | | '-evalf', 'n:NATURAL1 & not(1001:NATURAL)', |
| 6857 | | '-evalf', 'n:NATURAL1 & not(1001:NATURAL1)', |
| 6858 | | '-evalf', 'n:NATURAL & not(1001:NATURAL1)', |
| 6859 | | '-evalf', 'n<100 & not(1001:NATURAL1)', |
| 6860 | | %'-evalf', 'n:NATURAL1 & x:2..3 & not(x:NATURAL1)', % TODO: still unknown |
| 6861 | | '-evalf', 'n>100 & not(1001:NATURAL1)', |
| 6862 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 6863 | | ], 'Check no enumeration warning issues leading to UNKNOWN'). |
| 6864 | | cli_testcase(2093, [cbc,bmc,tla], |
| 6865 | | ['../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/Einstein.tla', |
| 6866 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6867 | | '-bmc', 1, '-expcterr', 'invariant_violation', |
| 6868 | | '-sptxt', '../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/prob_bmc_counterexample_test2093.mch'], 'check TLA model can be solved with bmc'). |
| 6869 | | cli_testcase(2094, [cbc,tla], |
| 6870 | | ['../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/Einstein.tla', |
| 6871 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6872 | | '-cbc', 'all', '-expcterr', 'cbc', |
| 6873 | | '-sptxt', '../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/prob_cbc_counterexample_test2094.mch'], 'check TLA model can be solved with bmc'). |
| 6874 | | cli_testcase(2095,[alloy,cbc,cbc_tests],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6875 | | '../prob_examples/public_examples/Alloy/Puzzles/einsteins_puzzle.als', |
| 6876 | | '-cbc_sequence', run0, |
| 6877 | | '-strict'], 'Test Alloy model and solution for run0 found'). |
| 6878 | | cli_testcase(2096, [smt_solver_integration], [ |
| 6879 | | '-p', 'TIME_OUT', '30000', |
| 6880 | | '-evalt', ':z3-double-check s=id(1..100)', |
| 6881 | | '-evalt', ':z3-double-check s=union({{1,2,3},{4,5,6},{1,2,10}})', |
| 6882 | | '-evalf', ':z3-double-check s=union({{1,2,3},{4,5,6},{1,2,10}}) & s={}', |
| 6883 | | '-evalt', ':z3-double-check s=inter({{1,2,3},{4,5,6},{1,2,10}})', |
| 6884 | | '-evalt', ':z3-double-check s=inter({{1,2,3},{1,2,6},{1,2,10}})', |
| 6885 | | '-evalt', ':z3-double-check a=[1,2,3,4,5]~', |
| 6886 | | '-evalt', ':z3-double-check x = %i.(i:1..10|i+i) & x[{j}]=a', |
| 6887 | | '-evalt', ':z3-double-check x = %i.(i:1..10|i+i) & x[{j}]={8}', |
| 6888 | | '-evalt', ':z3-double-check f=%x.(x:INTEGER|x*x*x) & f(f(x))=y & y=512', |
| 6889 | | '-evalt', ':z3-double-check a : FIN((1..3) * (1..3)) & a/={} & (2,2):a', |
| 6890 | | '-evalt', ':z3-double-check a : FIN((1..3) * INT)', |
| 6891 | | '-evalt', ':z3-double-check x:POW1(1..10) & y = x*x', |
| 6892 | | '-evalf', ':z3-double-check x:POW1(1..10) & {} = x*x' |
| 6893 | | ], 'check new z3 translation with lambdas'). |
| 6894 | | cli_testcase(2097,[cbc,bmc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6895 | | '../prob_examples/public_examples/TLA/Benchmarks/Queens/NQueens.mch', |
| 6896 | | '-bmc', 1, '-expecterr', 'invariant_violation', |
| 6897 | | '-strict'], 'Test invariant violation after INITIALISATION found'). |
| 6898 | | cli_testcase(2098, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6899 | | '-evalt', 'q : 1 .. 16 --> 1 .. 16 & card(ran(q))=16', |
| 6900 | | '-evalt', 'q : 1 .. 16 --> 1 .. 16 & card(ran(q))=card(dom(q))', |
| 6901 | | %'-evalt', 'q : 1 .. 16 --> 1 .. 16 & card({R|R:INTEGER & #D.(D:dom(q) & R=q(D))})=card(dom(q))', % only works in Disprover mode |
| 6902 | | %'-evalt', 'q : 1 .. 16 --> 1 .. 16 & card({R|R:INTEGER & #D.(D|->R:q)})=card(dom(q))', |
| 6903 | | '-evalt', 'f=%x.(x:1..1000|x+1) & 1000=card(ran(f))', |
| 6904 | | '-evalt', 'f=%x.(x:1..n|x+1) & res=card(ran(f))& n:{1000,1001} & res=1001' |
| 6905 | | ], 'Test improved card of range treatment'). |
| 6906 | | cli_testcase(2099, [laws,bmc], [ |
| 6907 | | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', |
| 6908 | | '-bmc', 7 %'-opterr', 'clpfd_overflow' % after changing get_assign_expr_priority_wf we no longer have an overflow |
| 6909 | | ], 'BMC: Various arithmetic laws with power; see clpfd overflow caught or not generated.'). |
| 6910 | | cli_testcase(2100, [laws,bmc], [ |
| 6911 | | '../prob_examples/public_examples/B/Laws/BoolLaws.mch', |
| 6912 | | '../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 6913 | | '-bmc', 6], 'BMC: Various bool and arithmetic laws.'). |
| 6914 | | cli_testcase(2101, [laws,bmc], [ |
| 6915 | | '../prob_examples/public_examples/B/Laws/NatRangeLaws.mch', |
| 6916 | | '-bmc', 4], 'BMC: Various intervals laws.'). |
| 6917 | | cli_testcase(2102, [laws,bmc], [ |
| 6918 | | '../prob_examples/public_examples/B/Laws/RelLaws.mch', |
| 6919 | | '-bmc', 1], 'BMC: Various bool and arithmetic laws.'). % TO DO: examine timeouts for larger values of bmc |
| 6920 | | cli_testcase(2103, [laws,bmc,tickets], [ |
| 6921 | | '../prob_examples/public_examples/B/Tickets/BMC_CallResidue/SetLaws_reduced2.mch', |
| 6922 | | '-bmc', 4], 'BMC: check no pending co-routines due to POW (power_set use of findall).'). |
| 6923 | | cli_testcase(2104, [laws,bmc], [ |
| 6924 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', |
| 6925 | | '-bmc', 3], 'BMC: Various set laws.'). % used to generate call_residue for b_not_test_conjunction/7 due to time-out |
| 6926 | | cli_testcase(2105, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'TIME_OUT', '10000', |
| 6927 | | '-evalt', ':cdclt-double-check x=1 or x=2', |
| 6928 | | '-evalf', ':cdclt-double-check x=1 & x=2', |
| 6929 | | '-evalt', ':cdclt-double-check {S,E,N,D, M,O,R, Y} <: 0..9 & S >0 & M >0 & card({S,E,N,D, M,O,R, Y}) = 8 & S*1000 + E*100 + N*10 + D + M*1000 + O*100 + R*10 + E = M*10000 + O*1000 + N*100 + E*10 + Y', |
| 6930 | | '-evalt', ':cdclt-double-check sqrt>0 & sqrt*sqrt <= i & (sqrt+1)*(sqrt+1)>i & i = 10000000', |
| 6931 | | '-evalt', ':cdclt-double-check n = 8 & queens : 1..n >-> 1..n & !(q1,q2).(q1:1..n & q2:2..n & q2>q1 => queens(q1)+(q2-q1) /= queens(q2) & queens(q1)+(q1-q2) /= queens(q2))', |
| 6932 | | '-evalt', ':cdclt-double-check DOM = 1..9 & SUBSQ = { {1,2,3}, {4,5,6}, {7,8,9} } & Board : DOM --> (DOM --> DOM) & !y.(y:DOM => !(x1,x2).(x1:DOM & x1<x2 & x2:DOM => Board(x1)(y) /= Board(x2)(y) & Board(y)(x1) /= Board(y)(x2))) & !(s1,s2).(s1:SUBSQ & s2:SUBSQ => !(x1,y1,x2,y2).( (x1:s1 & x2:s1 & x1>=x2 & (x1=x2 => y1>y2) & y1:s2 & y2:s2 & (x1,y1) /= (x2,y2)) => Board(x1)(y1) /= Board(x2)(y2))) & Board(1)(1)=7 & Board(1)(2)=8 & Board(1)(3)=1 & Board(1)(4)=6 & Board(1)(6)=2 & Board(1)(7)=9 & Board(1)(9) = 5 & Board(2)(1)=9 & Board(2)(3)=2 & Board(2)(4)=7 & Board(2)(5)=1 & Board(3)(3)=6 & Board(3)(4)=8 & Board(3)(8)=1 & Board(3)(9)=2 & Board(4)(1)=2 & Board(4)(4)=3 & Board(4)(7)=8 & Board(4)(8)=5 & Board(4)(9)=1 & Board(5)(2)=7 & Board(5)(3)=3 & Board(5)(4)=5 & Board(5)(9)=4 & Board(6)(3)=8 & Board(6)(6)=9 & Board(6)(7)=3 & Board(6)(8)=6 & Board(7)(1)=1 & Board(7)(2)=9 & Board(7)(6)=7 & Board(7)(8)=8 & Board(8)(1)=8 & Board(8)(2)=6 & Board(8)(3)=7 & Board(8)(6)=3 & Board(8)(7)=4 & Board(8)(9)=9 & Board(9)(3)=5 & Board(9)(7)=1', |
| 6933 | | '-evalt', ':cdclt-double-check DOM = {1,2,3,4,5,6,7,8,9} & Board : DOM --> (DOM --> DOM) & (Board : INTEGER +-> ((INTEGER<->INTEGER)) & 1 : dom(Board) & 1 : dom(Board(1)) & Board(1) : INTEGER +-> INTEGER & Board(1)(1) = 7)', |
| 6934 | | '-evalt', ':cdclt-double-check DOM = {1,2,3,4,5,6,7,8,9} & Board(1)(1) = 7', |
| 6935 | | '-evalt', ':cdclt-double-check {K,P} <: 1..9 & {I,S,A,O,N} <: 0..9 & (1000*K+100*I+10*S+S) * (1000*K+100*I+10*S+S) = 1000000*P+100000*A+10000*S+1000*S+100*I+10*O+N & card({K, I, S, P, A, O, N}) = 7', |
| 6936 | | '-evalt', ':cdclt-double-check (A=TRUE <=> (B=FALSE or C=FALSE)) & (B=TRUE <=> A=TRUE)', |
| 6937 | | '-evalf', ':cdclt-double-check (A=TRUE <=> (B=FALSE or C=FALSE)) & (B=TRUE <=> A=TRUE) & B=FALSE', |
| 6938 | | '-evalt', ':cdclt-double-check cube = %x.(x:INTEGER|x*x*x) & ([1,2,3,4,5] ; cube) = list & cube[1..10] = image & cube(y) = 15625', |
| 6939 | | '-evalt', ':cdclt-double-check DOM = {1,2,3,4,5,6,7,8,9} & (Board : INTEGER +-> ((INTEGER<->INTEGER)) & 1 : dom(Board) & 1 : dom(Board(1)) & Board(1) : INTEGER +-> INTEGER & Board(1)(1) = 7)', |
| 6940 | | % the following constraints have been found by the Prolog fuzzer |
| 6941 | | '-evalt', ':cdclt-double-check {"a"} : FIN({"a"}) or 279936 < - (0 + (-32 - min({54,-27,2}))) + ((-23 + max({12,-51,30}) / 113) - 9) <=> {"n","6","o","e"} - {"7","s"} /= {"Cev"}', |
| 6942 | | '-evalf', ':cdclt-double-check -54 .. 4 <<: {-19470,-19144,-19076,-17773,-11298,-9821,-8847,-8790,-8609,-8232,-508,245,416,1018,5075,6575,10043,18046,19308} <=> (not(-35 - - (- 28 * MAXINT) >= max({59,41,61,-4,-13,50,28,58,-17,58,54,-54,54,5,-20,-23,34,-8,-25,-16,-47,-42,-34,33,18,-49,-5,-7,-10,32,-35,-40,17,-25,10,-29,-15,23,-23,7,10})) <=> 0 /= -12187)', |
| 6943 | | '-evalt', ':cdclt-double-check btrue => -21 .. -11 <<: {13761} & -32 .. -11 /<: {-11745,-5153,-16613,-17839,-3598,-11064,-15654,-1151,-14874,-13025,8362,-3180,12111,5227,-1287,18256,5858,18146,8052,-2114,18763,9259,-18295,2081,16790,9462,8630,11820,-11320,-15826,-12584,16862,6,-441,-6442,13118,-1346,-11977} => (btrue => - 1 * - (0 * (1 - min({41,49,28,-36,-61,-13,31,41,1,44,-10,-29,-39,-35,17,46,-57,-61,-56,16,16,27,-15,-34,-59}) / 4)) < MAXINT)', |
| 6944 | | '-evalt', ':cdclt-double-check btrue => -32 .. -11 /<: {-11745,-5153} => (btrue => - 1 * - (0 * (1 - min({41,49}) / 4)) < MAXINT)', |
| 6945 | | '-evalt', ':cdclt-double-check btrue => -21 .. -11 <<: {13761} & -32 .. -11 /<: {-11745,-5153} => (btrue => - 1 * - (0 * (1 - min({41,49}) / 4)) < MAXINT)', |
| 6946 | | '-evalt', ':cdclt-double-check {-19910,-18746,-16773,-15446,-14701,-12806,-11000,-9666,-8702,-6212,6573,9274,11522,11745,12209,17151,17624,18421,18593,19723} - {-19961,-19856,-18755,-18112,-17873,-15773,-13681,-12937,-11171,-10677,-7082,-7061,-4992,-4435,-3456,-3261,-2223,-1579,315,609,971,1484,2294,2495,3596,5065,5194,5609,5813,6792,6798,6920,7107,7195,7404,7990,9187,9517,11009,13260,14137,14147,15716,18611,19110,19337,19513} <<: {-4672,-17796,-4395,-14514,-4171,-13133,18369,-10632,7894,-15167,9678,9553,14831,6214,-6487,3093,-19899,-16914,306,-5209,-19188,-19968,4718,6866,-18040,947,-18538,5729,18888,-5761,-6479,-6113,1143,5424,7706,16860,-8906,-8415} => (-50 .. 10 = {-15424,1561,3745,-2865,-2186,-8876,-15970,-10344,1889,2751,-14364,-19299,-8441,-2199,10931,-1527,-557,-8985,-1152,-11802,6361,13242,11952,16544} => {-19444,-18905,-13816,-9049,-8343,-7466,-6334,-4630,-4492,-4139,-3813,-2461,921,1467,2179,2359,3401,3891,4620,7103,7156,9120,9807,10217,13043,15032,15064,15710,15848,19094,19884} /\\ {12048,11231,1868,417,9577,-13582,2563,12378,14444,2407,-6123,-6200,-12295,-15450,-11725,-6065,-4717,-7484} <: {9763,-5634,-7807,15930,16096,9294,9872,6155,-7741,16455,13929,8926,-10738,479,10765} <=> 79 mod 101 >= max({}))', |
| 6947 | | '-evalf', ':cdclt-double-check not(({FALSE,TRUE} : FIN({FALSE,TRUE})) <=> (-(-(45) / 13) >= MAXINT <=> TRUE /: {FALSE,TRUE} <=> (inter({{TRUE,TRUE,TRUE,TRUE,FALSE,TRUE,FALSE,TRUE,TRUE,TRUE,FALSE}}) : FIN(inter({{TRUE,TRUE,TRUE,TRUE,FALSE,TRUE,FALSE,TRUE,TRUE,TRUE,FALSE}}))) or union({{TRUE,FALSE,FALSE,TRUE,FALSE,FALSE,TRUE,TRUE,FALSE}}) : FIN(union({{TRUE,FALSE,FALSE,TRUE,FALSE,FALSE,TRUE,TRUE,FALSE}}))))', |
| 6948 | | '-evalt', ':cdclt-double-check ({FALSE,TRUE} <<: {FALSE,TRUE} or {} <<: {"+n9r]I<","00ML","5nAgN<]2-6pF[tSEcB^","7!J<4*","8iL];D&Z:ni!s3*}(}k_}_?-w;",">GlCdZ:","?Nn!bHODO1wL;","C78H","G:n2D^L4","O_ijw=8Ji~7oK?ZF","O_vdN.ikYTh","S{}K2m","WF{3>i8E3","n9*Lq^do","_Mu04s,9DAXNc~&","e>kKr","gOmYLo7","jca","oJ","v2&!aeJLwl","y;f+]","9"}) & (not({} <<: {"+n9rI","00ML","5nAgN2-6pFtSEcB^","7!J4","8iLDZni!s3_?-w;",">GlCdZ:","?Nn!bHODO1wL","C78H","G:n2DL4","O_ijw=8Ji7oK?ZF","O_vdN.ikYTh","SK2m","WF3>i8E3","n9*Lq^do","_Mu04s,9DAXNc","ekKr","gOmYLo7","jca","oJ","v2&!aeJLwl","y;f+","9"}) or not({FALSE,TRUE} <<: {FALSE,TRUE})) & (({} <<: {FALSE,TRUE} & (not(TRUE : {FALSE,TRUE}) or not(0 > min({-62,-49,-45,-43,-41,-31,-29,-24,-17,-5,-2,5,11,12,14,28,37,43,46,56,61,62})) or not({FALSE,TRUE} \\/ {FALSE,TRUE} <<: {FALSE,TRUE}))) or (TRUE : {FALSE,TRUE} & 0 > min({-62,-49,-45,-43,-41,-31,-29,-24,-17,-5,-2,5,11,12,14,28,37,43,46,56,61,62}) & {FALSE,TRUE} \\/ {FALSE,TRUE} <<: {FALSE,TRUE} & not({} <<: {FALSE,TRUE})) or not({} <<: {-18838,-17452,-17385,-17368,-16258,-14024,-13647,-11800,-10149,-9457,-8517,-6852,-6530,-3702,-3635,-3275,-1683,-983,1569,5914,6252,7434,11539,15004,16490,16542,17084,17672,19117,19164})) & ({} <<: {-18838,-17452,-17385,-17368,-16258,-14024,-13647,-11800,-10149,-9457,-8517,-6852,-6530,-3702,-3635,-3275,-1683,-983,1569,5914,6252,7434,11539,15004,16490,16542,17084,17672,19117,19164} or ((not({} <<: {FALSE,TRUE}) or (TRUE : {FALSE,TRUE} & 0 > min({-62,-49,-45,-43,-41,-31,-29,-24,-17,-5,-2,5,11,12,14,28,37,43,46,56,61,62}) & {FALSE,TRUE} \\/ {FALSE,TRUE} <<: {FALSE,TRUE})) & (not(TRUE : {FALSE,TRUE}) or not(0 > min({-62,-49,-45,-43,-41,-31,-29,-24,-17,-5,-2,5,11,12,14,28,37,43,46,56,61,62})) or {} <<: {FALSE,TRUE})))', |
| 6949 | | '-evalf', ':cdclt-double-check min({-9,62,62,52,10,56,-40,-21,-41,-10,55,36,-49,51,32,38,13,-25,57,30,2,-2,44,31,-2,52,34,-46,-37,-34,27,2,38,-12,12,13,11,10,-25,43,-3,-15,32,44,-29,11,-60,-25}) /= -5382 & -9 .. 26 /<<: {-19996,-19637,-17345,-16440,-16151,-14331,-14216,-13851,-13702,-13513,-13120,-12762,-12362,-11205,-10452,-9575,-8455,-7689,-6723,-6420,-4168,-4084,-2567,126,1166,2415,3104,5409,5412,7177,7411,9946,10042,12934,13241,13475,13619,13840,14144,14347,14970,15179,15440,15963,17294,17661,18921,19903} <=> (5 ** 6 * (66 mod 69)) / 42 > ((125 mod 19) / 121) * (MAXINT * max({}))', |
| 6950 | | '-evalt', ':cdclt-double-check not(- MININT /= 1363 <=> ({TRUE,FALSE,FALSE,FALSE,FALSE,FALSE,TRUE,FALSE,TRUE,TRUE,FALSE,TRUE,FALSE,TRUE} <<: {FALSE,TRUE,TRUE,TRUE,TRUE,FALSE,TRUE,TRUE,TRUE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE,TRUE,TRUE,TRUE,TRUE,TRUE,FALSE,TRUE,FALSE,TRUE,TRUE,FALSE,TRUE,FALSE} & (1 ** 15 > (max({-49,-56,-18,61,50,-64,20,55,-51,-14,-37,49,5,59,40,59,-19,26,39,33,43}) / 111) * (31 * (113 mod 16)) <=> ([FALSE,FALSE,TRUE,FALSE,TRUE] \\|/ -54 = [TRUE,FALSE,FALSE,FALSE,FALSE,TRUE,TRUE,FALSE,FALSE,FALSE,TRUE,TRUE,TRUE,TRUE,FALSE,TRUE,FALSE,TRUE,TRUE,FALSE,FALSE,TRUE,FALSE,FALSE,FALSE]) or {FALSE,FALSE,TRUE,FALSE,TRUE,TRUE,TRUE,TRUE,TRUE,FALSE,FALSE,FALSE,TRUE} /<: {FALSE,TRUE,TRUE,TRUE})))', |
| 6951 | | '-evalt', ':cdclt-double-check ({13863,-2724,15542,-18887,11221,-11891,-17574,-2849,-13338,19123,-9651,-5848,-12601,15297,4528,-5524,-4136,-5229,-16157,-12619,-8161,-1247,-16962,10733,-2138,16616,-14300,-4637,-19621,4539,-15785,-248,-10087,-15335,-10899,-2532,13760,11564,-12141,-11280,3565,-14514,19104,3527} - {-811,-12966,17308,-9349,2149,9738,-318,14025,-18399,-17958,15260,-19451,-15085,9909,15837,-16231,4087,6545} /<<: {-6211,7604,19023,-8033,14009,5059,9369,-18930,-13755,-14150,8712,-11423,-1960,18652,-9294,19555,4807,5600,-17247,-16758,2745,12564,-6405,-10912,13623,-4015,-5184,19632,-1836,15510,4486,-18481,-4349,5837,1862,-13487,7275,-17300,-5584,-876,-10597,13971,-19380,-9716,-14414} or ({-19777,-19020,-17674,-17355,-16229,-15507,-14186,-9887,-7089,-4810,-4582,-4364,149,5703,8016,8955,9972,10690,11129,13218,15561,16863,18620} \\/ {} <: {-16699,-14540,-8802,-8022,-6474,-5385,-3859,-3146,-2872,-2219,-650,-258,470,2074,2387,2999,4265,7137,9264,15016,15222,15771,16836,17115,17840,18226,18317,18571,19862} & not({FALSE} /<<: {}))) <=> 8 .. 26 /<<: {-9274,-5298,-13637,9226,-1388,-2737,11191,-4811,-18395,13977,-19670,-12926,-7852,5226,13179,-14651,16848,-8312,9455,7659,1725,-2596,-8742,-13336,-17732,-18768,16309,13978,10408,6762,-909,15051,-7266,-82,-6845,-16879,14941,15517,-15212,-14214,-12398,7673}', |
| 6952 | | '-evalf', ':cdclt-double-check not(({13863,-2724,15542,-18887,11221,-11891,-17574,-2849,-13338,19123,-9651,-5848,-12601,15297,4528,-5524,-4136,-5229,-16157,-12619,-8161,-1247,-16962,10733,-2138,16616,-14300,-4637,-19621,4539,-15785,-248,-10087,-15335,-10899,-2532,13760,11564,-12141,-11280,3565,-14514,19104,3527} - {-811,-12966,17308,-9349,2149,9738,-318,14025,-18399,-17958,15260,-19451,-15085,9909,15837,-16231,4087,6545} /<<: {-6211,7604,19023,-8033,14009,5059,9369,-18930,-13755,-14150,8712,-11423,-1960,18652,-9294,19555,4807,5600,-17247,-16758,2745,12564,-6405,-10912,13623,-4015,-5184,19632,-1836,15510,4486,-18481,-4349,5837,1862,-13487,7275,-17300,-5584,-876,-10597,13971,-19380,-9716,-14414} or ({-19777,-19020,-17674,-17355,-16229,-15507,-14186,-9887,-7089,-4810,-4582,-4364,149,5703,8016,8955,9972,10690,11129,13218,15561,16863,18620} \\/ {} <: {-16699,-14540,-8802,-8022,-6474,-5385,-3859,-3146,-2872,-2219,-650,-258,470,2074,2387,2999,4265,7137,9264,15016,15222,15771,16836,17115,17840,18226,18317,18571,19862} & not({FALSE} /<<: {}))) <=> 8 .. 26 /<<: {-9274,-5298,-13637,9226,-1388,-2737,11191,-4811,-18395,13977,-19670,-12926,-7852,5226,13179,-14651,16848,-8312,9455,7659,1725,-2596,-8742,-13336,-17732,-18768,16309,13978,10408,6762,-909,15051,-7266,-82,-6845,-16879,14941,15517,-15212,-14214,-12398,7673})', |
| 6953 | | '-evalt', ':cdclt-double-check id0 : seq(INTEGER) & {id1,id2,id3|id1 : POW(INTEGER) & id2 : POW(REAL) & id3 : STRING & (-1 >= 0 & 56.289243046663664 /: FLOAT)} : FIN({id1,id2,id3|id1 : POW(INTEGER) & id2 : POW(REAL) & id3 : STRING & (-1 >= 0 & 56.289243046663664 /: FLOAT)}) & first(MAXINT -> id0) > PI(id1,id2,id3).(id1 : POW(INTEGER) & id2 : POW(REAL) & id3 : STRING & (-1 >= 0 & 56.289243046663664 /: FLOAT)|MAXINT ** -1)', |
| 6954 | | '-evalt', ':cdclt-double-check id0 : seq(INTEGER) & {id1,id2,id3|id1 : POW(INTEGER) & id2 : POW(REAL) & id3 : STRING & (MININT >= 0 & 56.289243046663664 /: FLOAT)} : FIN({id1,id2,id3|id1 : POW(INTEGER) & id2 : POW(REAL) & id3 : STRING & (MININT >= 0 & 56.289243046663664 /: FLOAT)}) & first(MAXINT -> id0) > PI(id1,id2,id3).(id1 : POW(INTEGER) & id2 : POW(REAL) & id3 : STRING & (MININT >= 0 & 56.289243046663664 /: FLOAT)|MAXINT ** MININT)', |
| 6955 | | '-evalt', ':cdclt-double-check not(conc([[FALSE,TRUE]]) : seq(BOOL) & aecwp : seq(BOOL) & [[FALSE,TRUE]] : seq(seq(BOOL)) & conc([[FALSE,TRUE]]) ^ aecwp = [FALSE,TRUE]) & aecwp = [TRUE]', |
| 6956 | | '-evalt', ':cdclt-double-check conc([[FALSE,TRUE]]) : seq(BOOL) & aecwp : seq(BOOL) & [[FALSE,TRUE]] : seq(seq(BOOL)) & conc([[FALSE,TRUE]]) ^ aecwp = [FALSE,TRUE]', |
| 6957 | | '-evalt', ':cdclt x * y =10 & !z.(z:1..10 => z:1..x & z:1..10)', |
| 6958 | | '-evalt', ':cdclt-double-check (pred : FIN(pred) => MININT >= 0) & (((id3 < 0.0 => 54.41823282691894 = real(floor(54.41823282691894))) & (id3 = 0.0 => 0.0 <= 54.41823282691894))) & real(IF pred : FIN(pred) THEN MININT ** MININT ELSE card(NAT) END) <= (40.23865881169138 + id3) - (id3 - 28.807142597628857)' |
| 6959 | | % enumeration warning |
| 6960 | | %'-evalt', ':cdclt-double-check {id0,id1,id2,id3|id0 : INTEGER & id1 : REAL * BOOL & id2 : BOOL & id3 : POW(STRING) & (MININT >= 0 & id4 < 70.20556312165694)} : FIN({id0,id1,id2,id3|id0 : INTEGER & id1 : REAL * BOOL & id2 : BOOL & id3 : POW(STRING) & (MININT >= 0 & id4 < 70.20556312165694)}) & - id6 /= 0 & PI(id0,id1,id2,id3).(id0 : INTEGER & id1 : REAL * BOOL & id2 : BOOL & id3 : POW(STRING) & (MININT >= 0 & id4 < 70.20556312165694)|MININT ** MININT) < prj2((INTEGER<->STRING),INTEGER)(id5) / - id6', |
| 6961 | | %'-evalt', ':cdclt-double-check - id1 /= 0 & {id2,id3,id4,id5|id2 : INTEGER & id3 : POW(INTEGER * POW(BOOL)) * BOOL & id4 : POW(INTEGER * POW(INTEGER * (POW(POW(INTEGER * REAL)) * REAL))) * POW(INTEGER) & id5 : BOOL & (MININT > 0 & id2 >= 0 & 46.49107043099957 : {})} : FIN({id2,id3,id4,id5|id2 : INTEGER & id3 : POW(INTEGER * POW(BOOL)) * BOOL & id4 : POW(INTEGER * POW(INTEGER * (POW(POW(INTEGER * REAL)) * REAL))) * POW(INTEGER) & id5 : BOOL & (MININT > 0 & id2 >= 0 & 46.49107043099957 : {})}) & prj1(INTEGER,REAL)(id0) / - id1 /= SIGMA(id2,id3,id4,id5).(id2 : INTEGER & id3 : POW(INTEGER * POW(BOOL)) * BOOL & id4 : POW(INTEGER * POW(INTEGER * (POW(POW(INTEGER * REAL)) * REAL))) * POW(INTEGER) & id5 : BOOL & (MININT > 0 & id2 >= 0 & 46.49107043099957 : {})|id2 mod MININT)', |
| 6962 | | %'-evalt', ':cdclt-double-check {id0|id0 : INTEGER & MININT > 0} : FIN({id0|id0 : INTEGER & MININT > 0}) & prj2(STRING,INTEGER)(id1) /= 0 & PI(id0).(id0 : INTEGER & MININT > 0|66 mod MININT) < - id0 / prj2(STRING,INTEGER)(id1)', |
| 6963 | | %'-evalt', ':cdclt-double-check prj1(INTEGER,INTEGER)(id1) > 0 & (first(id0) >= 0 & (id0 : seq1(INTEGER) & {id2,id3|id2 : POW(INTEGER * REAL) & id3 : REAL & (MININT > 0 & MININT >= 0 & id4 /: INT)} : FIN({id2,id3|id2 : POW(INTEGER * REAL) & id3 : REAL & (MININT > 0 & MININT >= 0 & id4 /: INT)}))) & first(id0) mod prj1(INTEGER,INTEGER)(id1) >= PI(id2,id3).(id2 : POW(INTEGER * REAL) & id3 : REAL & (MININT > 0 & MININT >= 0 & id4 /: INT)|MININT mod MININT)', |
| 6964 | | %'-evalt', ':cdclt-double-check not(conc([[FALSE,TRUE]]) : seq(BOOL) & aecwp : seq(BOOL) & [[FALSE,TRUE]] : seq(seq(BOOL)) & conc([[FALSE,TRUE]]) ^ aecwp = [FALSE,TRUE])', |
| 6965 | | %'-evalt', ':cdclt-double-check not([FALSE,TRUE] : seq(BOOL) & [FALSE,TRUE] ^ aecwp = [FALSE,TRUE])' |
| 6966 | | ], 'Some arbitrary constraints that should be solved by CDCL(T).'). |
| 6967 | | cli_testcase(2106, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6968 | | '-evalt', 'pubkey = 1000000993* 1000001011 & x>999000000 & y>x & x mod 2 = 1 & y mod 2 = 1 & pubkey = x*y', % from Z3 tutorial |
| 6969 | | '-evalt', 'pubkey = 1000000993* 1000001001 & x>1000000720 & y>x & pubkey = x*y', % very fast with CLP(FD), z3 already 2.6 secs |
| 6970 | | '-evalt', 'h*3600 + m*60 + s = tot & m:0..60 & s:0..60 & h2*3600 + m2*60 + s2 = tot & m2:0..60 & s2:0..60 & tot:1..10000 & (h,m,s) /= (h2,m2,s2)' % from article Functional synthesis for linear arithmetic and sets |
| 6971 | | ], 'Constraints involving large numbers'). |
| 6972 | | cli_testcase(2107,[b_test,tickets],[ |
| 6973 | | '../prob_examples/public_examples/B/Tickets/VirtualTimeoutConstants.mch', |
| 6974 | | '-model-check', '-pref_group', 'model_check', 'unlimited', '-expcterr', 'model_check_incomplete', |
| 6975 | | '-expcterr', 'virtual_time_out'], 'Test virtual time out detected for disable_timeout'). |
| 6976 | | cli_testcase(2108,[b_test,tickets],[ |
| 6977 | | '../prob_examples/public_examples/B/Tickets/VirtualTimeoutConstants.mch', |
| 6978 | | '-model-check', '-pref_group', 'model_check', 'disable_max', '-expcterr', 'model_check_incomplete', |
| 6979 | | '-expcterr', 'virtual_time_out'], 'Test virtual time out detected also with time_out'). |
| 6980 | | cli_testcase(2109, [tickets], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6981 | | '-evalt', 'ff = [1,2,3,4,5,6,7,8,9,10,11] & x:0..1 & b=TRUE <=> dom(ff) <: 1..10**x', |
| 6982 | | '-evalt', 'ff = [1,2,3,4,5,6,7,8,9,10,11] & x:0..1 & b=TRUE <=> ff: 1..10**x --> INTEGER', |
| 6983 | | '-evalt', 'ff = [1,2,3,4,5,6,7,8,9,10,11] & {x,b|x:0..1 & b=TRUE <=> ff: 1..10**x --> INTEGER} = {(0|->FALSE),(1|->FALSE)}', |
| 6984 | | '-evalt', 'ff = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16] & {x,b|x:0..5 & b=TRUE <=> ff: 1..2**x --> INTEGER} = res & 4|->TRUE : res' |
| 6985 | | ], 'Check reification of subset/total function works (and does not instantiate/commit)'). |
| 6986 | | cli_testcase(2110, [tickets], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6987 | | '../prob_examples/public_examples/B/PerformanceTests/LargeSets/SeqCheck.mch', |
| 6988 | | '-mc', 100, '-cc', 10, 136], 'Check state space for test 31'). |
| 6989 | | cli_testcase(2111, [tickets], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 6990 | | '-p', 'SMT', 'TRUE', |
| 6991 | | '-evalf', 'x:INTEGER & x<y & y<x', |
| 6992 | | '-evalf', 'x:INTEGER & x<y & y<=x', |
| 6993 | | '-evalf', 'x:INTEGER & x<=y & y<x', |
| 6994 | | '-evalt', 'x:INT & x<=y & y<=x', |
| 6995 | | '-evalf', 'x:POW(INTEGER) & x<<:y & y<<:x', |
| 6996 | | '-evalf', 'x:POW(INTEGER) & x<<:y & y<:x', |
| 6997 | | '-evalf', 'x:POW(INTEGER) & x<:y & y<<:x', |
| 6998 | | '-evalt', 'x:POW(INT) & x<:y & y<:x' |
| 6999 | | ], 'Check inconsistency detection when registering predicates (without CHR)'). |
| 7000 | | cli_testcase(2112, [b_test,cache], [ |
| 7001 | | '../prob_examples/public_examples/B/PerformanceTests/Cache/PrimeNumbers.mch', |
| 7002 | | '../prob_examples/public_examples/B/PerformanceTests/Cache/PrimeNumbersSum.mch', |
| 7003 | | '-p', 'CACHE_OPERATIONS', 'FALSE', |
| 7004 | | '-mc', '10000', '-nodead', |
| 7005 | | '-show_cache', % test this feature |
| 7006 | | '-cache', '../prob_examples/public_examples/cache/'], 'Check that -cache option works with new preference and with subsidiary machine with multiple constant solutions.'). |
| 7007 | | cli_testcase(2113, [cbc], [ |
| 7008 | | '-evalt', 'y:NATURAL & (y<400 => #x.(y:10..x & x:1..100)) ', |
| 7009 | | '-evalt', 'y:NATURAL & (not(y<400) or #x.(y:10..x & x:1..100)) ' |
| 7010 | | ], 'Test enumeration of implication when RHS not reified'). |
| 7011 | | cli_testcase(2114, [tickets, wd], [ |
| 7012 | | '-p', 'TRY_FIND_ABORT', 'TRUE', |
| 7013 | | '-evalnwd', '{}(x) : {}(x) .. 5 & x:1..100 ', |
| 7014 | | '-expcterr', 'well_definedness_error' |
| 7015 | | ], 'Test we do not add unbounded FD variable for enumeration'). |
| 7016 | | cli_testcase(2115, [ltl,safety], ['../prob_examples/public_examples/B/LTL/Tests/LargeSCC.mch', '-ltllimit', '50', '-ltlformulaf', 'G({xx<10})', '-strict' |
| 7017 | | %'-p', 'use_safety_ltl_model_checker', false, |
| 7018 | | ], 'check that safety model check works even without ltl2ba for simple G {...} formula'). |
| 7019 | | cli_testcase(2116, [infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7020 | | '-evalt', '{x|x>100} /= {x|x mod 2 =0 & x>0}', |
| 7021 | | '-evalf', ' /*@symbolic*/ {x|x:1..2**20 & x mod 3 =1} /= {x|x:1..2**20 & x mod 3 =1}', |
| 7022 | | '-evalf', ' /*@symbolic*/ {x|x:1..2**25 & x mod 3 =1} /= {x|x:1..2**25 & x mod 3 =1}' |
| 7023 | | ], 'Test we do not expand second arg to not equal when first is closure'). % useful with DOUBLE_EVALUATION in Evaluation View |
| 7024 | | cli_testcase(2117, [smt_solver_integration], [ |
| 7025 | | '-evalt', ':z3-double-check a=prj1(INTEGER,INTEGER)((1,2))', |
| 7026 | | '-evalt', ':z3-double-check 1=prj1(INTEGER,INTEGER)((1,2))', |
| 7027 | | '-evalf', ':z3-double-check 2=prj1(INTEGER,INTEGER)((1,2))', |
| 7028 | | '-evalt', ':z3-double-check a=prj2(INTEGER,INTEGER)((1,2))', |
| 7029 | | '-evalt', ':z3-double-check 2=prj2(INTEGER,INTEGER)((1,2))', |
| 7030 | | '-evalf', ':z3-double-check 1=prj2(INTEGER,INTEGER)((1,2))', |
| 7031 | | '-evalt', ':z3-double-check a = (1..3)*(1..3) & b : a & c = prj1(INTEGER,INTEGER)(b)', |
| 7032 | | '-evalt', ':z3-double-check a = (1..3)*POW(1..3) & b : a & c = prj1(INTEGER,POW(INTEGER))(b)', |
| 7033 | | '-evalt', ':z3-double-check a = (1..3)*POW1(1..3) & b : a & c = prj1(INTEGER,POW(INTEGER))(b)' |
| 7034 | | ], 'check couple projection functions for z3'). |
| 7035 | | cli_testcase(2118, [smt_solver_integration], [ |
| 7036 | | '-evalt', ':z3-double-check a={1}<<|{(1,2),(2,3)}', |
| 7037 | | '-evalf', ':z3-double-check {}={4}<<|{(1,2),(2,3)}', |
| 7038 | | '-evalt', ':z3-double-check {(2,3)}={1}<<|{(1,2),(2,3)}', |
| 7039 | | '-evalt', ':z3-double-check a={1}<|{(1,2),(2,3)}', |
| 7040 | | '-evalt', ':z3-double-check {}={3}<|{(1,2),(2,3)}', |
| 7041 | | '-evalf', ':z3-double-check {}={1}<|{(1,2),(2,3)}', |
| 7042 | | '-evalt', ':z3-double-check a={(1,2),(2,3)}|>{1}', |
| 7043 | | '-evalf', ':z3-double-check {(1,2),(2,3)}={(1,2),(2,3)}|>{1}', |
| 7044 | | '-evalt', ':z3-double-check a={(1,2),(2,3)}|>{3}', |
| 7045 | | '-evalt', ':z3-double-check a={(1,2),(2,3)}|>>{3}', |
| 7046 | | '-evalt', ':z3-double-check a={(1,2),(2,3)}|>>{1}', |
| 7047 | | '-evalf', ':z3-double-check {}={(1,2),(2,3)}|>>{1}' |
| 7048 | | ], 'check domain and range subtraction and restriction for z3'). |
| 7049 | | cli_testcase(2119, [smt_solver_integration], [ |
| 7050 | | '../prob_examples/examples/B/Other/BMaude/Mutex3.mch', '-init', |
| 7051 | | '-evalt', ':z3-double-check a = pc <+ {2 |-> wait}', |
| 7052 | | '-evalf', ':z3-double-check pc(1) = noncrit & pc(2) = noncrit & (pc(2) = noncrit & pc1 = pc <+ {2 |-> wait} & y1 = y & n1 = n) & not(pc1(1) = noncrit)' |
| 7053 | | ], 'check z3 model translation for couple of enumerated set type and capitalised enumerated set'). |
| 7054 | | cli_testcase(2120, [smt_solver_integration], [ |
| 7055 | | '../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/Train_1_beebook_tlc.mch', '-init', |
| 7056 | | '-evalt', ':z3-double-check nxt = {(R1|->{(A|->B),(B|->C),(L|->A)}),(R2|->{(A|->B),(B|->D),(D|->E),(E|->F),(F|->G),(L|->A)}),(R3|->{(A|->B),(B|->D),(D|->K),(J|->N),(K|->J),(L|->A)}),(R4|->{(F|->G),(H|->I),(I|->K),(K|->F),(M|->H)}),(R5|->{(H|->I),(I|->J),(J|->N),(M|->H)}),(R6|->{(A|->L),(B|->A),(C|->B)}),(R7|->{(A|->L),(B|->A),(D|->B),(E|->D),(F|->E),(G|->F)}),(R8|->{(A|->L),(B|->A),(D|->B),(J|->K),(K|->D),(N|->J)}),(R9|->{(F|->K),(G|->F),(H|->M),(I|->H),(K|->I)}),(R10|->{(H|->M),(I|->H),(J|->I),(N|->J)})}' |
| 7057 | | ], 'check z3 model translation for nested couples'). |
| 7058 | | cli_testcase(2121, [smt_solver_integration], [ |
| 7059 | | '-evalt', ':z3-double-check x:INTEGER & y:INTEGER & (y /= 0 => ( -x/y = -(x/y) & x/-y = -(x/y) & (x>=0 & y>0 => (x mod y = x - y * ( x / y )))))', |
| 7060 | | '-evalt', ':z3-double-check x:INTEGER & y:INTEGER & (y /= 0 => ( -x/y = -(x/y) & x/-y = -(x/y) & (x>=0 & y>0 => (x mod y = x - y * ( x / y ))))) & x/= 1', |
| 7061 | | '-evalt', ':z3-double-check x:INTEGER & y:INTEGER & (y /= 0 => ( -x/y = -(x/y) & x/-y = -(x/y) & (x>=0 & y>0 => (x mod y = x - y * ( x / y ))))) & x/= 1 & x /=-1', |
| 7062 | | '-evalt', ':z3-double-check x:INTEGER & y:INTEGER & (y /= 0 => ( -x/y = -(x/y) & x/-y = -(x/y) & (x>=0 & y>0 => (x mod y = x - y * ( x / y ))))) & x/= 1 & x /=-1 & y /= 0', |
| 7063 | | '-evalf', ':z3 x:-3..3 & y:-3..3 & not( -x/y = -(x/y) )', |
| 7064 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & y/=0 & not( -x/y = -(x/y) )', |
| 7065 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not (x>y or x<=y)', |
| 7066 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not ( (x<=y <=> min({x,y}) = x) )', |
| 7067 | | '-evalt', ':z3-double-check a={x|x:-10..10 & (x/2 = 4 or x/2 = -4)}', |
| 7068 | | '-evalt', ':z3-double-check a={x|x:-10..10 & x/2 = 4}', |
| 7069 | | '-evalt', ':z3-double-check a={x|x:0..10 & (x mod 2 = 0 or x mod 2 = 0)}', |
| 7070 | | '-evalt', ':z3-double-check a={x|x:1..10 & x < 5 & x mod 2 = 0}', |
| 7071 | | '-evalt', ':z3-double-check a={x|x:1..10 & x < 5 & x mod 2 = 1}', |
| 7072 | | '-evalt', ':z3-double-check a={x|x:1..10 & x mod 2 = 0}', |
| 7073 | | '-evalt', ':z3-double-check a={x|x:1..10 & x mod 2 = 1}', |
| 7074 | | '-evalt', ':z3-double-check a={x|x:1..100 & x mod 2 = 0}', |
| 7075 | | '-evalt', ':z3-double-check a={x|x:1..100 & x mod 3 = 1}' |
| 7076 | | ], 'check integer division in z3'). |
| 7077 | | cli_testcase(2122, [smt_solver_integration], [ |
| 7078 | | '-p', 'TIME_OUT', '30000', |
| 7079 | | '-eval', ':z3-version', |
| 7080 | | '-evalf', ':z3-double-check not({1} = dom({(1,2)}))', %% this was a bug in z3 version 4.8.10 and earlier when using pull_nested_quantifiers |
| 7081 | | '-evalt', ':z3-double-check {1} = dom({(1,2)})', %% with lambda expressions that use an existential quantifier at the top-level |
| 7082 | | '-evalf', ':z3-double-check not({2} = ran({(1,2)}))', %% (note that we don't use pull_nested_quantifiers anymore; slow for large constraints) |
| 7083 | | '-evalt', ':z3-double-check {2} = ran({(1,2)})', %% |
| 7084 | | '-evalf', ':z3-double-check not({1,2,3,4} = dom({(1,2),(2,2),(3,3),(4,4)}))', |
| 7085 | | '-evalt', ':z3-double-check {1,2,3,4} = dom({(1,2),(2,2),(3,3),(4,4)})', |
| 7086 | | '-evalt', ':z3-double-check not({1,2} = dom({(1,2),(2,2),(3,3),(4,4)}))', |
| 7087 | | '-evalf', ':z3-double-check not({2,3,4} = ran({(1,2),(2,2),(3,3),(4,4)}))', |
| 7088 | | '-evalt', ':z3-double-check {2,3,4} = ran({(1,2),(2,2),(3,3),(4,4)})', |
| 7089 | | '-evalt', ':z3-double-check not({2,3} = ran({(1,2),(2,2),(3,3),(4,4)}))', |
| 7090 | | %'-evalf', ':z3-double-check hh:1..3<->1..3 & not (iterate(hh,1)=(hh))', % unsupported: wait for Z3 to support lambda inside recursive functions again |
| 7091 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x*y = y*x)', |
| 7092 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not(x*(y+z) = x*y + x*z)', |
| 7093 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x+y = y+x)', |
| 7094 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x*1 = x)', |
| 7095 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(1*x = x)', |
| 7096 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x*0 = 0)', |
| 7097 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(0*x = 0)', |
| 7098 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not((x+y)+z = x + (y+z))', |
| 7099 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not((x*y)*z = x*(y*z))', |
| 7100 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(2*x = x+x)', |
| 7101 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x**2 = x*x)', |
| 7102 | | '-evalt', ':z3-double-check x:-3..3 & y:-3..3 & (x>=0 => 1**x = 1)', |
| 7103 | | '-evalt', ':z3-double-check x:-3..3 & y:-3..3 & (x>=0 => (((x / 2)*2 = x) <=> (x mod 2 = 0)))', |
| 7104 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x>y or x<=y)', |
| 7105 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x>y or x=y or x<y)', |
| 7106 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x>=y or x<y)', |
| 7107 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x>=y or x<=y)', |
| 7108 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & (x>y & x<=y)', |
| 7109 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & (x<y & y<x)', |
| 7110 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x-x = 0 )', |
| 7111 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x=y <=> x-y = 0)', |
| 7112 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x>y <=> x >= y+1)', |
| 7113 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x<y <=> x <= y-1)', |
| 7114 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x<y or y<x) <=> x/=y)', |
| 7115 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x<y & y<=z) => x<z)', |
| 7116 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x<y & y<z) => x<z)', |
| 7117 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x<=y & y<z) => x<z)', |
| 7118 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x<=y & y<=z) => x<=z)', |
| 7119 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x<=y & y<=x) => x=y)', |
| 7120 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x=y <=> y=x)', |
| 7121 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x/=y <=> y/=x)', |
| 7122 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x<y <=> y>x)', |
| 7123 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x>y <=> y<x)', |
| 7124 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x<=y <=> y>=x)', |
| 7125 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x>=y <=> y<=x)', |
| 7126 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(not(x<y) <=> x>=y)', |
| 7127 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(not(x<=y) <=> x>y)', |
| 7128 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x=y or x=z) => (y=x or z=x))', |
| 7129 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x=y or x=z) <=> (y=x or z=x))', |
| 7130 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not((x=y <=> x=z) => (y=z or x/=y))', |
| 7131 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not ( (x-y-x+y = 0) )', |
| 7132 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not ( x*x >= 0 )', |
| 7133 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not ( (x*x = 0 <=> x=0) )', |
| 7134 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not ( x*x = -x * -x )', |
| 7135 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not (x<=y <=> min({x,y}) = x)', |
| 7136 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not (x<=y <=> max({x,y}) = y)', |
| 7137 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not (x<y <=> max({x,y}) /= x)', |
| 7138 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not (x<y <=> min({x,y}) /= y)', |
| 7139 | | '-evalt', ':z3-double-check x:-3..3 & y:-3..3 & (x>=0 & y>0 => ((x/y) * y = x - x mod y))', |
| 7140 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(succ(x) = x+1)', |
| 7141 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(pred(x) = x-1)', |
| 7142 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x < succ(x))', |
| 7143 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x > pred(x))', |
| 7144 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(pred(succ(x)) = x)', |
| 7145 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x+succ(y) = succ(x+y))', |
| 7146 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x*succ(y) = x+x*y)', |
| 7147 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not (x**1 = x)', |
| 7148 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(#x.(x:INTEGER & {x} \\/ {1,2} = {1,2} ) )', |
| 7149 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not( min({x}) = x )', |
| 7150 | | '-evalt', ':z3-double-check x:-3..3 & y:-3..3 & (x <= y => min({x,y}) = x )', |
| 7151 | | '-evalt', ':z3-double-check x:-3..3 & y:-3..3 & (y <= x => min({x,y}) = y )', |
| 7152 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not( x:y..z <=> (y<=x & x<=z))', |
| 7153 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not( x:y..z <=> (y<=x & x<=z & y<=z))', |
| 7154 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & y /= 0 & not ( -x/y = -(x/y) )', |
| 7155 | | '-evalf', ':z3-double-check (2=3 & 1=1 <=> 4=5 & 2=2)', |
| 7156 | | '-evalf', ':z3-double-check SS : POW(-1..3) & not (SS = {z|z:INTEGER & #x.(x:SS & z=x*1)})', % Unknown with Z3 4.11.2 but can be solved with 4.12.0 |
| 7157 | | '-evalf', ':z3-double-check SS : POW(-1..3) & VV : POW(-1..3) & not ( SS <<: VV or SS /<<: VV )', |
| 7158 | | '-evalf', ':z3-double-check SS : POW(-1..3) & VV : POW(-1..3) & not ( (VV <<: SS & SS <: TT) => (VV <<: TT))', |
| 7159 | | '-evalt', ':z3-double-check #t1.(t1:INTEGER & (#t2.(!(t8,rr).(t8 |-> rr : t2 => t1 >= t8 ) & ran(t2) = {1,3} )))', |
| 7160 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & a={a,b,c,d|a|->b : ff & c|->d : gg} & ff/={} & gg/={}', |
| 7161 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & dom((ff ; (gg~))) <: dom(ff)', |
| 7162 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & dom((ff ; (gg~))) <: dom(ff) & ff /= {}', |
| 7163 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & dom((ff ; (gg~))) <: dom(ff) & ff /= {} & gg /= {}', |
| 7164 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & a = ff><gg', |
| 7165 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & a = ff><gg & ff /= {}', |
| 7166 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & a = ff><gg & ff /= {} & gg /= {}', |
| 7167 | | %'-evalf', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & not(dom(ff><gg) = dom(ff)/\\dom(gg))', % Unknown with Z3 4.11.2 but can be solved with 4.12.0 |
| 7168 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & a=(ff||gg)', |
| 7169 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & a=(ff||gg) & ff/={}', |
| 7170 | | '-evalt', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & a=(ff||gg) & ff/={} & gg/={}', |
| 7171 | | %'-evalt', ':z3 {x|x>2 & x / 22 > 10} = x & (x={} <=> B=TRUE)', % double check with ProB not possible due to enumeration warnings; enumeration warning when translating SMT-LIB model to B |
| 7172 | | '-evalf', ':z3-double-check x<:BOOL & x <: y & not(POW(x) <: POW(y))', |
| 7173 | | %'-evalt', ':z3-double-check x<:BOOL & x <: y & not(POW(x) <<: POW(y))', % unknown since Z3 4.12.2 |
| 7174 | | %'-evalf', ':z3-double-check x<:BOOL & x <<: y & not(POW(x) <<: POW(y))', % Z3 answers unknown |
| 7175 | | %'-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not(z>=0 => (x*y)**z = x**z * y**z)', % Z3 answers unknown |
| 7176 | | %'-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not(y>=0 & z>=0 => (x**(y+z) = x**y * x**z))', % Z3 answers unknown |
| 7177 | | %'-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not(y>=0 & z>=0 => (x**(y*z) = (x**y)**z))', % Z3 answers unknown |
| 7178 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(#x.(x:INTEGER & {x} \\/ {1,2} = {1,2} ) )', |
| 7179 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not( min({x}) = x )', |
| 7180 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(x <= y => min({x,y}) = x )', |
| 7181 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & not(y <= x => min({x,y}) = y )', |
| 7182 | | %'-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not( min({x}\\/{y,z}) = min({min({x}), min({y,z})}) )', % Z3 answers unknown |
| 7183 | | %'-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not( min({y,z} \\/ {x}) = min({min({y,z}),x}) )', % Z3 answers unknown |
| 7184 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not( x:y..z <=> (y<=x & x<=z))', |
| 7185 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & z:-3..3 & not( x:y..z <=> (y<=x & x<=z & y<=z))', |
| 7186 | | '-evalf', ':z3-double-check x:-3..3 & y:-3..3 & y /= 0 & not ( -x/y = -(x/y) )', |
| 7187 | | '-evalf', ':z3-double-check (2=3 & 1=1 <=> 4=5 & 2=2)', |
| 7188 | | '-evalf', ':z3-double-check S : {{},{0}} & not (S = ran(%x.(x:S|x*1)))', |
| 7189 | | '-evalf', ':z3-double-check S : POW(-1..3) & not (S = ran(%x.(x:S|x*1)))', |
| 7190 | | '-evalf', ':z3-double-check S : POW(-1..3) & not (S = {z|z:INTEGER & #x.(x:S & z=x*1)})', |
| 7191 | | '-evalf', ':z3-double-check S : POW(-1..3) & VV : POW(-1..3) & not ( S <<: VV or S /<<: VV )', |
| 7192 | | '-evalf', ':z3-double-check S : POW(-1..3) & VV : POW(-1..3) & not ( (VV <<: S & S <: TT) => (VV <<: TT))', |
| 7193 | | '-evalf', ':z3-double-check S : POW(-1..3) & VV : POW(-1..3) & not (S /\\ VV = {} <=> S <: (-1..3) - VV)', |
| 7194 | | '-evalf', ':z3-double-check S : POW(-1..3) & VV : POW(-1..3) & not((S=VV & S /= {}) => (max(S) = max(VV) & min(S)=min(VV)))', |
| 7195 | | %'-evalf', ':z3-double-check S : POW(-1..3) & VV : POW(-1..3) & not((S <: VV & S/= {}) => (max(S) <= max(VV) & min(S) >= min(VV)))', % sometimes unknown |
| 7196 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & not( a<:b <=> POW(a) <: POW(b) )', |
| 7197 | | %'-evalf', ':z3-double-check a<:1..3 & b<:1..3 & not( a<<:b <=> POW(a) <<: POW(b))', % Z3 answers unknown |
| 7198 | | %'-evalf', ':z3-double-check a<:1..3 & b<:1..3 & not( POW(a) /<: POW1(b) & FIN(a) /<: FIN1(b))', % Z3 answers unknown |
| 7199 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( (a={} or b={}) => (a*b)={} & (a*b) <: (c*d) )', |
| 7200 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( (a={} or b={} & f : a <-> b) => f: c <-> d ))', |
| 7201 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( (a={} or b={} & f : a +-> b) => f: c +-> d ))', |
| 7202 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( (a={} or b={} & f : a >+> b) => f: c >+> d ))', |
| 7203 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( a <: c & b<:d => (a*b) <: c*d))', |
| 7204 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a <: c & b<:d & f : a <-> b => f: c <-> d )', |
| 7205 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a <: c & b<:d & f : a +-> b => f: c +-> d )', |
| 7206 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a <: c & b<:d & f : a >+> b => f: c >+> d )', |
| 7207 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( b<:d & f : a --> b => f: a --> d )', |
| 7208 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( b<:d & f : a >-> b => f: a >-> d )', |
| 7209 | | '-evalf', ':z3-double-check a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a<:c & f : a +->> b => f: c +->> b )', |
| 7210 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not((s1=s2 <=> s2=s1))', |
| 7211 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1=s2 or s1 /= s2 )', |
| 7212 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1=s2 & s2=s3 => s1 = s3 )', |
| 7213 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1=s2 & s2/=s3 => s1 /= s3 )', |
| 7214 | | %'-evalf', ':z3-double-check s1:STRING & s2:STRING & not(s1=s2 <=> card({s1,s2}) = 1)', % Z3 answers unknown |
| 7215 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1=s2 <=> {s1,s2} = {s1} )', |
| 7216 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not({s1,s2,s3} = {s3} \\/ {s2} \\/ {s1} )', |
| 7217 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not({x| x=s1 or x=s2} = {s2,s1} )', |
| 7218 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1 : dom( { s2 |-> s2, s3|->s3, s1 |->s1} ) )', |
| 7219 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not((s1/=s2 => s1 /: dom( { s2 |-> s2} ) ) )', |
| 7220 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1 /: {s1,s2,s3} - {s2,s1} )', |
| 7221 | | '-evalf', ':z3-double-check S={"a","b"} & s1:S & s2:S & s3:S & not(card({s1,s2,s3} - {s2,s1}) < 2)', |
| 7222 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1:STRING <=> 1=1 )', |
| 7223 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1/:STRING <=> 1=2 )', |
| 7224 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( s1=s2 <=> {s1} \\/ {s2} = {s1})', |
| 7225 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( {s1,s2} \\/ {s3} = {s1,s2,s3})', |
| 7226 | | '-evalf', ':z3-double-check s1:STRING & s2:STRING & not( {s2} \\/ {s1,s2,s3} = {s1,s2,s3} )', |
| 7227 | | '-evalf', ':z3-double-check S={"a","b"} & s1:S & s2:S & s3:S & not( s1 /= s3 => ({s1,s2} /\\ {s3,s2} = {s2}))', |
| 7228 | | '-evalf', ':z3-double-check S={"a","b"} & s1:S & s2:S & s3:S & not( #x.(x:STRING & {x} \\/ {s1,s2} = {s1,s2} & x:{s1,s2,s3}))', |
| 7229 | | '-evalf', ':z3-double-check S={"a","b"} & s1:S & s2:S & s3:S & not( #x.(x:STRING & {x} \\/ {s1,s2} = {s1,s2} ) )', |
| 7230 | | '-evalf', ':z3-double-check SS<:POW(BOOL) & not( SS \\/ (TT /\\ VV) = (SS \\/ TT) /\\ (SS \\/ VV))', |
| 7231 | | '-evalf', ':z3-double-check x<:BOOL & not(POW(x) = POW1(x) \\/ {{}})', |
| 7232 | | %'-evalt', ':z3-double-check x/={{1,19}} & x/={{1,7},{2,-1},{2,-3}} & x/={} & x/={{}} & x/={{0,1},{0,-9},{0,-1}} & x/={{4,2},{2,-1},{3,-4},{5,10},{9,-3},{3,7}}', % model translation became unknown with Z3 version 4.12.3 |
| 7233 | | '-evalf', ':z3-double-check rx:BOOL <-> BOOL & not(( id(BOOL) ; rx) = rx)', |
| 7234 | | '-evalt', ':z3-double-check a : STRING +-> STRING', |
| 7235 | | '-evalt', ':z3-double-check a : STRING +-> STRING & a /= {}', |
| 7236 | | '-evalt', ':z3-double-check a : STRING +-> STRING & a = {"a"|->"b"}', |
| 7237 | | % z3 answers unknown for the following constraints |
| 7238 | | %'-evalf', ':z3-double-check not(#t1.(t1:INTEGER & (#t2.(!(t8,rr).(t8 |-> rr : t2 => t1 >= t8 ) & ran(t2) = {1,3} ))))', |
| 7239 | | %'-evalf', ':z3-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & not (ff <<: gg => (card(ff) < card(gg)))', |
| 7240 | | %'-evalf', ':z3-double-check SS : POW(-1..3) & VV : POW(-1..3) & not (SS <<: VV => (card(SS) < card(VV)))', |
| 7241 | | %'-evalf', ':z3-double-check SS : POW(-1..3) & VV : POW(-1..3) & not (SS <: VV => (card(SS) <= card(VV)))' |
| 7242 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 7243 | | ], 'check some laws for z3'). |
| 7244 | | cli_testcase(2123, [b_test], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7245 | | '../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', |
| 7246 | | % clash checks Code = {c1,c2,c3,c4}, db,active,activec={} |
| 7247 | | '-evalf', 'dom(db) /= active', % z3 reports Unknwon ! |
| 7248 | | '-evalt', '#active.(dom(db) /= active)', |
| 7249 | | '-evalt', '#db.(db /= active)', |
| 7250 | | '-evalf', '#(c1,c2).(c1:Name & c2:Code & db={c1|->c2})', |
| 7251 | | '-evalt', '#(c1,c2,db).(c1:Name & c2:Code & db={c2|->c1})', |
| 7252 | | '-evalt', '#(c1,c2).(c1:Name & c2:Code & (c1:active <=> c2:activec))' |
| 7253 | | ], 'check REPL deals well with clashes of quantified variables'). |
| 7254 | | cli_testcase(2124, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7255 | | '-evalt', 'card({x | x:{1,3} or x:{4,9}}) = 4', |
| 7256 | | '-evalt', 'card({x | x:{1,3} or x:{3,9}}) = 3' |
| 7257 | | ], 'check clpfd_reify_inlist works with enumeration'). |
| 7258 | | cli_testcase(2125, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7259 | | '-evalf', '#(x,y,z,v,xz).(x:BOOL & x/=y & v/=z & x=v & (x=z <=> xz=TRUE) & (xz=FALSE => x=TRUE) & (xz=FALSE => x=FALSE))', |
| 7260 | | '-evalt', '#(x,y,z,v,xz).(x:BOOL & x/=y & v/=z & x=v & (x=z <=> xz=TRUE) & (xz=FALSE => x=TRUE) & (xz=TRUE => x=FALSE))', |
| 7261 | | '-evalt', '{x,y|x=TRUE => y=TRUE} = {(FALSE,TRUE),(FALSE,FALSE),(TRUE,TRUE)}' |
| 7262 | | ], 'check let detection for implication not applied'). |
| 7263 | | cli_testcase(2126, [cbc], [ |
| 7264 | | '-evalf', 'x>2 & x:3..10 & x mod 3 = 1 & x mod 3 = 2', |
| 7265 | | '-evalt', 'x>2 & x:3..10 & x mod 3 = 1 & x mod 3 /= 2' |
| 7266 | | ], 'check modulo propagation terminates'). |
| 7267 | | cli_testcase(2127, [csp_test,ltl], ['../prob_examples/public_examples/CSP/Tickets/WilliamsLTL/SimpleLTL.csp', |
| 7268 | | '-ltlformulat', 'globally([a] implies finally(e(a)))', |
| 7269 | | '-ltlformulat', 'not (globally finally e(a) implies GF [a]) implies finally [b]','-strict'], |
| 7270 | | 'Check LTL using new textual forms; variations of tests 541, 542. Requires parser 2.9.28'). |
| 7271 | | cli_testcase(2128, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/TestDoNotEnumerateAnalysis.mch', |
| 7272 | | '../prob_examples/public_examples/B/ExternalFunctions/TestDoNotEnumerateAnalysis2.mch', |
| 7273 | | '-t', '-assertions'], 'Test DO_NOT_ENUMERATE analysis; like test 1988 but automatic annotation.'). |
| 7274 | | cli_testcase(2129, [cbc,external], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/Train_1_beebook_tlc.mch', |
| 7275 | | '-evalt', 'tf : domain --> ROUTES & tf <: rtbl & OCC1 <: domain & tf[OCC1] = frm1 & A : OCC1 & A|->R5 /: tf', |
| 7276 | | '-evalt', 'tf : domain --> ROUTES & tf <: rtbl & OCC1 <: domain & tf[OCC1] <: frm1 & A : OCC1 & A|->R5 /: tf', % delayed enumeration for frm1 |
| 7277 | | '-evalt', 'rsrtbl1 : resbl1 --> resrt1 & rsrtbl1 <: rtbl & OCC1 <: resbl1 & rsrtbl1[OCC1] = frm1 & LBT1 <: OCC1 & R5 /: resrt - ran(rsrtbl1) & (A : LBT1 & (OCC2 = OCC1 - {A} & rsrtbl2 = {A} <<| rsrtbl1)) & R5 /: resrt - ran(rsrtbl2)', |
| 7278 | | '-evalt', 'rsrtbl1 : resbl1 --> resrt1 & rsrtbl1 <: rtbl & OCC1 <: resbl1 & rsrtbl1[OCC1] <: frm1 & LBT1 <: OCC1 & R5 /: resrt - ran(rsrtbl1) & (A : LBT1 & (OCC2 = OCC1 - {A} & rsrtbl2 = {A} <<| rsrtbl1)) & R5 /: resrt - ran(rsrtbl2)', % delayed enumeration for frm1 |
| 7279 | | '-evalt', 'not((rsrtbl1 : resbl1 --> resrt1 & rsrtbl1 <: rtbl & OCC1 <: resbl1 & rsrtbl1[OCC1] <: frm1 & LBT1 <: OCC1 & R5 /: resrt - ran(rsrtbl1) & (A : LBT1 & (OCC2 = OCC1 - {A} & rsrtbl2 = {A} <<| rsrtbl1))) => R5 : resrt - ran(rsrtbl2))' % with implication |
| 7280 | | ], 'Test DO_NOT_ENUMERATE analysis; infer also delayed enumeration for certain variables.'). |
| 7281 | | cli_testcase(2130, [cbc,sigma], [ |
| 7282 | | '-evalt', 'SIGMA(x).(x=y+z|x)=3 & z<0 & z>-10', |
| 7283 | | '-evalt', 'SIGMA(x).({x}<:{0,y}|x)=22', % normally rewritten to member by ast_cleanup |
| 7284 | | '-evalf', 'PI(x).({x}<:{0,y}|x)=2', |
| 7285 | | '-p', 'OPTIMIZE_AST', 'FALSE', |
| 7286 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 7287 | | ], 'check detection of equality and subset in PI/SIGMA'). |
| 7288 | | cli_testcase(2131, [laws], [ |
| 7289 | | '-p', 'TIME_OUT', 7000, |
| 7290 | | '-evalf', 'VV={1,3} & not(#(c,f).(c:0..3 & f:1..c >->> VV & 1<c))', |
| 7291 | | |
| 7292 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ((dom(ff\\/gg) = dom(ff) \\/ dom(gg)) )', |
| 7293 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( ran(ff\\/gg) = ran(ff) \\/ ran(gg) )', |
| 7294 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( dom(ff/\\gg) <: dom(ff) /\\ dom(gg) )', |
| 7295 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( ran(ff/\\gg) <: ran(ff) /\\ ran(gg) )', |
| 7296 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( (ff \\/ gg)~ = ff~ \\/ gg~ )', |
| 7297 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( dom((ff ; (gg~))) <: dom(ff) )', |
| 7298 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (ff : setX --> setY <=> (ff: setX +-> setY & dom(ff) = setX))', |
| 7299 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (ff <: ff \\/ gg & gg <: ff \\/ gg )', |
| 7300 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (ff /\\ gg <: ff & ff /\\ gg <: gg)', |
| 7301 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( {xx | xx: ff & xx:gg} = ff /\\ gg)', |
| 7302 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( {xx | xx: ff & not(xx:gg)} = ff \\ gg)', |
| 7303 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (!xx.(xx:ff & xx:gg => xx: ff /\\ gg))', |
| 7304 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (!xx.(xx:ff & not(xx:gg) => (xx: ff \\ gg & xx /: gg)))', |
| 7305 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (#xx.(xx:ff & xx/:gg) => not(ff \\/ gg = gg) & not(ff \\ gg = {}))', |
| 7306 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( ff <<: gg or ff /<<: gg )', |
| 7307 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( ff : POW(gg) or ff /: POW(gg) )', |
| 7308 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( (ff <: gg & ff /<<: gg) => ff = gg)', |
| 7309 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( (ff <<: gg ) => (ff /= gg & card(gg)>0))', |
| 7310 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( ff <<: gg => #xx.(xx:gg & xx/:ff))', |
| 7311 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( ff <: gg <=> !x.(x:ff => x:gg) )', |
| 7312 | | '-evalf', 'ff:1..1<->BOOL & gg:1..2<->BOOL & not (ff <<: gg => (card(ff) < card(gg)))', |
| 7313 | | %% '-evalf', 'ff:1..1<->BOOL & gg:1..2<->BOOL & not (card(ff \\/ gg) <= (card(ff) + card(gg)))', % TIME_OUT |
| 7314 | | %% probably due to CLPFD propagation; this ff={} & gg:1..1<->BOOL & (card(ff \/ gg) > card(gg)) has issue as well |
| 7315 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (ff /\\ gg = {} <=> ff <: ((1..3)*BOOL) - gg)', |
| 7316 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( (ff<+gg) = (gg \\/ (dom(gg)<<|ff)) )', |
| 7317 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not ( ff<+{} = ff & {}<+ff = ff & ff<+ff = ff)', |
| 7318 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (ff~ = {yy,xx|xx:dom(ff)&yy:ran(ff)&({xx|->yy}<:ff)})', |
| 7319 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (id(ff) = {xx,yy|xx:ff&yy:ff&xx=yy})', |
| 7320 | | '-evalf', 'ff:1..2<->BOOL & gg:1..2<->BOOL & not (prj1(ff,gg) = ({xx,yy,zz|xx:(ff)&yy:(gg)&zz=xx}) )', |
| 7321 | | '-evalf', 'ff:1..2<->BOOL & gg:1..2<->BOOL & not (prj2(ff,gg) = ({xx,yy,zz|xx:(ff)&yy:(gg)&zz=yy}) )', |
| 7322 | | '-evalf', 'hh:1..3<->1..3 & not (iterate(hh,1)=(hh))', |
| 7323 | | '-evalf', 'ff:1..3<->BOOL & gg:1..3<->BOOL & not (dom(ff><gg) = dom(ff)/\\dom(gg)) // Crashes Z3', |
| 7324 | | '-evalf', 'ff:1..2<->BOOL & gg:1..2<->BOOL & not (card((ff><gg)) <= card(ff)*card(gg))', |
| 7325 | | '-evalf', 'ff:1..2<->BOOL & gg:1..2<->BOOL & not ( dom((ff||gg)) = dom(ff)*dom(gg)) // Crashes Z3', |
| 7326 | | '-evalf', 'xx:0..3 & zz:0..3 & not( xx: xx..xx+1 )', |
| 7327 | | '-evalf', 'xx:0..3 & zz:0..3 & not(xx: xx..xx+1 )', |
| 7328 | | '-evalf', 'xx:0..3 & zz:0..3 & not(xx: xx..xx )', |
| 7329 | | '-evalf', 'xx:0..3 & zz:0..3 & not(xx: xx-1..xx )', |
| 7330 | | '-evalf', 'xx:0..3 & zz:0..3 & not((xx<zz <=> xx:0..zz-1) )', |
| 7331 | | '-evalf', 'xx:0..3 & zz:0..3 & not((xx<=zz <=> xx:0..zz) )', |
| 7332 | | '-evalf', 'xx:0..3 & zz:0..3 & not(card(xx..xx) = 1 & card(xx..xx-1) = 0 )', |
| 7333 | | '-evalf', 'xx:0..3 & zz:0..3 & not(card(xx..xx+1) = 2 )', |
| 7334 | | '-evalf', 'xx:0..3 & zz:0..3 & not((xx>zz <=> card(xx..zz) = 0) )', |
| 7335 | | '-evalf', 'xx:0..3 & zz:0..3 & not((xx<=zz => card(xx..zz) = zz-xx+1) )', |
| 7336 | | '-evalf', 'xx:0..3 & zz:0..3 & not((xx<1 => {} : 1..xx --> INTEGER) )', |
| 7337 | | '-evalf', 'xx:0..3 & zz:0..3 & not({} : 1..0 --> INTEGER )', |
| 7338 | | '-evalf', 'xx:0..3 & zz:0..3 & not(xx..zz = {nn | nn:INT & nn>=xx & nn<=zz})', |
| 7339 | | '-evalf', 'xx:0..3 & zz:0..3 & not( (xx..zz = {} <=> zz < xx) )', |
| 7340 | | '-evalf', 'xx:0..3 & zz:0..3 & not( (xx..zz /= {} <=> zz >= xx) )', |
| 7341 | | '-evalf', 'xx:0..3 & zz:0..3 & not( (#v.(v:xx..zz) <=> zz >= xx) )', |
| 7342 | | '-evalf', 'xx:0..3 & zz:0..3 & not( !v.(v:xx..zz => v>=xx & v <= zz))', |
| 7343 | | '-evalf', 'xx:0..3 & zz:0..3 & not( xx..(xx-1) <: xx..zz )', |
| 7344 | | '-evalf', 'xx:0..3 & zz:0..3 & not( xx..zz <: xx..zz )', |
| 7345 | | '-evalf', 'xx:0..3 & zz:0..3 & not( xx..zz <: xx..(zz+1) )', |
| 7346 | | '-evalf', 'xx:0..3 & zz:0..3 & not( (xx+1)..zz <: xx..zz )', |
| 7347 | | '-evalf', 'xx:0..3 & zz:0..3 & not( xx..(zz-1) <: xx..zz )', |
| 7348 | | '-evalf', 'xx:0..3 & zz:0..3 & not( (xx+1)..(zz-1) <: xx..zz)', |
| 7349 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x*y = y*x)', |
| 7350 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not(x*(y+z) = x*y + x*z)', |
| 7351 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x+y = y+x)', |
| 7352 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x*1 = x)', |
| 7353 | | '-evalf', 'x:-3..3 & y:-3..3 & not(1*x = x)', |
| 7354 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x*0 = 0)', |
| 7355 | | '-evalf', 'x:-3..3 & y:-3..3 & not(0*x = 0)', |
| 7356 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not((x+y)+z = x + (y+z))', |
| 7357 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not((x*y)*z = x*(y*z))', |
| 7358 | | '-evalf', 'x:-3..3 & y:-3..3 & not(2*x = x+x)', |
| 7359 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x**2 = x*x)', |
| 7360 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>=0 => 1**x = 1)', |
| 7361 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>=0 => (((x / 2)*2 = x) <=> (x mod 2 = 0)))', |
| 7362 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>0 => 2**x = 2*(2**(x-1)))', |
| 7363 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>0 => 2**(10*x) = 2*(2**(10*x-1)))', |
| 7364 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>0 => 3**(10*x) = 3*(3**(10*x-1)))', |
| 7365 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>y or x<=y) ', |
| 7366 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>y or x=y or x<y) ', |
| 7367 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>=y or x<y) ', |
| 7368 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>=y or x<=y) ', |
| 7369 | | '-evalf', 'x:-3..3 & y:-3..3 & (x>y & x<=y) ', |
| 7370 | | '-evalf', 'x:-3..3 & y:-3..3 & (x<y & y<x) ', |
| 7371 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x-x = 0 )', |
| 7372 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x=y <=> x-y = 0) ', |
| 7373 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>y <=> x >= y+1) ', |
| 7374 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x<y <=> x <= y-1) ', |
| 7375 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x<y or y<x) <=> x/=y) ', |
| 7376 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x<y & y<=z) => x<z) ', |
| 7377 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-4..4 & not((x<y & y<z) => x<z) ', |
| 7378 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-4..4 & not((x<=y & y<z) => x<z) ', |
| 7379 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x<=y & y<=z) => x<=z) ', |
| 7380 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x<=y & y<=x) => x=y)', |
| 7381 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x=y <=> y=x) ', |
| 7382 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x/=y <=> y/=x) ', |
| 7383 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x<y <=> y>x) ', |
| 7384 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>y <=> y<x) ', |
| 7385 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x<=y <=> y>=x) ', |
| 7386 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>=y <=> y<=x) ', |
| 7387 | | '-evalf', 'x:-3..3 & y:-3..3 & not(not(x<y) <=> x>=y) ', |
| 7388 | | '-evalf', 'x:-3..3 & y:-3..3 & not(not(x<=y) <=> x>y) ', |
| 7389 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x=y or x=z) => (y=x or z=x)) ', |
| 7390 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x=y or x=z) <=> (y=x or z=x)) ', |
| 7391 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x=y <=> x=z) => (y=z or x/=y))', |
| 7392 | | '-evalf', 'x:-3..3 & y:-3..3 & not ( (x-y-x+y = 0) )', |
| 7393 | | '-evalf', 'x:-3..3 & y:-3..3 & not ( x*x >= 0 )', |
| 7394 | | '-evalf', 'x:-3..3 & y:-3..3 & not ( (x*x = 0 <=> x=0) )', |
| 7395 | | '-evalf', 'x:-3..3 & y:-3..3 & not ( (x*x = 0 => x=0) )', |
| 7396 | | '-evalf', 'x:-3..3 & y:-3..3 & not ( (x=0 => x*x = 0) )', |
| 7397 | | '-evalf', 'x:-3..3 & y:-3..3 & not ( x*x = -x * -x )', |
| 7398 | | '-evalf', 'x:-3..3 & y:-3..3 & not (x<=y <=> min({x,y}) = x)', |
| 7399 | | '-evalf', 'x:-3..3 & y:-3..3 & not (x<=y <=> max({x,y}) = y)', |
| 7400 | | '-evalf', 'x:-3..3 & y:-3..3 & not (x<y <=> max({x,y}) /= x)', |
| 7401 | | '-evalf', 'x:-3..3 & y:-3..3 & not (x<y <=> min({x,y}) /= y)', |
| 7402 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>=0 & y>0 => ((x/y) * y = x - x mod y))', |
| 7403 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not(x/=y & x/=z & y/=z => SIGMA(zz).(zz:{x,y,z}|zz) = x+y+z)', |
| 7404 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not(x/=y & x/=z & y/=z => PI(zz).(zz:{x,y,z}|zz) = x*y*z)', |
| 7405 | | '-evalf', 'x:-3..3 & y:-3..3 & not(SIGMA(zz).(zz:{x}|zz) = x)', |
| 7406 | | '-evalf', 'x:-3..3 & y:-3..3 & not(PI(zz).(zz:{x}|zz) = x)', |
| 7407 | | '-evalf', 'x:-3..3 & y:-3..3 & not(succ(x) = x+1) ', |
| 7408 | | '-evalf', 'x:-3..3 & y:-3..3 & not(pred(x) = x-1) ', |
| 7409 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x < succ(x))', |
| 7410 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x > pred(x))', |
| 7411 | | '-evalf', 'x:-3..3 & y:-3..3 & not(pred(succ(x)) = x)', |
| 7412 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x+succ(y) = succ(x+y))', |
| 7413 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x*succ(y) = x+x*y)', |
| 7414 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>=0 => 1**x = 1)', |
| 7415 | | '-evalf', 'x:-3..3 & y:-3..3 & not (x**1 = x)', |
| 7416 | | '-evalf', 'x:-3..3 & y:-3..3 & not (x**0 = 1)', |
| 7417 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x>0 => 0**x = 0)', |
| 7418 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not(z>=0 => (x*y)**z = x**z * y**z)', |
| 7419 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not(y>=0 & z>=0 => (x**(y+z) = x**y * x**z))', |
| 7420 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not(y>=0 & z>=0 => (x**(y*z) = (x**y)**z))', |
| 7421 | | '-evalf', 'x:-3..3 & y:-3..3 & not(#x.(x:INTEGER & {x} \\/ {1,2} = {1,2} ) )', |
| 7422 | | '-evalf', 'x:-3..3 & y:-3..3 & not( min({x}) = x )', |
| 7423 | | '-evalf', 'x:-3..3 & y:-3..3 & not(x <= y => min({x,y}) = x )', |
| 7424 | | '-evalf', 'x:-3..3 & y:-3..3 & not(y <= x => min({x,y}) = y )', |
| 7425 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not( min({x}\\/{y,z}) = min({min({x}), min({y,z})}) )', |
| 7426 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not( min({y,z} \\/ {x}) = min({min({y,z}),x}) )', |
| 7427 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not( x:y..z <=> (y<=x & x<=z))', |
| 7428 | | '-evalf', 'x:-3..3 & y:-3..3 & z:-3..3 & not( x:y..z <=> (y<=x & x<=z & y<=z))', |
| 7429 | | '-evalf', 'x:-3..3 & y:-3..3 & y /= 0 & not ( -x/y = -(x/y) )', |
| 7430 | | '-evalf', '(2=3 & 1=1 <=> 4=5 & 2=2)', |
| 7431 | | '-evalf', 'SS : POW(-1..3) & not (SS = ran(%x.(x:SS|x*1)))', |
| 7432 | | '-evalf', 'SS : POW(-1..3) & not (SS = {z|z:INTEGER & #x.(x:SS & z=x*1)})', |
| 7433 | | '-evalf', 'SS : POW(-1..3) & VV : POW(-1..3) & not ( SS <<: VV or SS /<<: VV )', |
| 7434 | | '-evalf', 'SS : POW(-1..3) & VV : POW(-1..3) & not ( (VV <<: SS & SS <: TT) => (VV <<: TT))', |
| 7435 | | '-evalf', 'SS : POW(-1..3) & VV : POW(-1..3) & not (SS <<: VV => (card(SS) < card(VV)))', |
| 7436 | | '-evalf', 'SS : POW(-1..3) & VV : POW(-1..3) & not (SS <: VV => (card(SS) <= card(VV)))', |
| 7437 | | '-evalf', 'SS : POW(-1..3) & VV : POW(-1..3) & not (SS /\\ VV = {} <=> SS <: (-1..3) - VV)', |
| 7438 | | '-evalf', 'SS : POW(-1..3) & VV : POW(-1..3) & not((SS=VV & SS /= {}) => (max(SS) = max(VV) & min(SS)=min(VV)))', |
| 7439 | | '-evalf', 'SS : POW(-1..3) & VV : POW(-1..3) & not((SS <: VV & SS/= {}) => (max(SS) <= max(VV) & min(SS) >= min(VV)))', |
| 7440 | | '-evalf', 'a<:1..3 & b<:1..3 & not( a<:b <=> POW(a) <: POW(b) )', |
| 7441 | | '-evalf', 'a<:1..3 & b<:1..3 & not( a<<:b <=> POW(a) <<: POW(b))', |
| 7442 | | '-evalf', 'a<:1..3 & b<:1..3 & not( POW(a) /<: POW1(b) & FIN(a) /<: FIN1(b))', |
| 7443 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( (a={} or b={}) => (a*b)={} & (a*b) <: (c*d) )', |
| 7444 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( (a={} or b={} & f : a <-> b) => f: c <-> d ))', |
| 7445 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( (a={} or b={} & f : a +-> b) => f: c +-> d ))', |
| 7446 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( (a={} or b={} & f : a >+> b) => f: c >+> d ))', |
| 7447 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( ( a <: c & b<:d => (a*b) <: c*d))', |
| 7448 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a <: c & b<:d & f : a <-> b => f: c <-> d )', |
| 7449 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a <: c & b<:d & f : a +-> b => f: c +-> d )', |
| 7450 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a <: c & b<:d & f : a >+> b => f: c >+> d )', |
| 7451 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( b<:d & f : a --> b => f: a --> d )', |
| 7452 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( b<:d & f : a >-> b => f: a >-> d )', |
| 7453 | | '-evalf', 'a<:1..3 & b<:1..3 & c<:1..3 & d<:1..3 & not( a<:c & f : a +->> b => f: c +->> b )', |
| 7454 | | '-evalf', 's1:STRING & s2:STRING & not((s1=s2 <=> s2=s1))', |
| 7455 | | '-evalf', 's1:STRING & s2:STRING & not( s1=s2 or s1 /= s2 )', |
| 7456 | | '-evalf', 's1:STRING & s2:STRING & not( s1=s2 & s2=s3 => s1 = s3 )', |
| 7457 | | '-evalf', 's1:STRING & s2:STRING & not( s1=s2 & s2/=s3 => s1 /= s3 )', |
| 7458 | | '-evalf', 's1:STRING & s2:STRING & not(s1=s2 <=> card({s1,s2}) = 1)', |
| 7459 | | '-evalf', 's1:STRING & s2:STRING & not( s1=s2 <=> {s1,s2} = {s1} )', |
| 7460 | | '-evalf', 's1:STRING & s2:STRING & not({s1,s2,s3} = {s3} \\/ {s2} \\/ {s1} )', |
| 7461 | | '-evalf', 's1:STRING & s2:STRING & not({x| x=s1 or x=s2} = {s2,s1} )', |
| 7462 | | '-evalf', 's1:STRING & s2:STRING & not( s1 : dom( { s2 |-> s2, s3|->s3, s1 |->s1} ) )', |
| 7463 | | '-evalf', 's1:STRING & s2:STRING & not((s1/=s2 => s1 /: dom( { s2 |-> s2} ) ) )', |
| 7464 | | '-evalf', 's1:STRING & s2:STRING & not( s1 /: {s1,s2,s3} - {s2,s1} )', |
| 7465 | | '-evalf', 'S={"a","b"} & s1:S & s2:S & s3:S & not(card({s1,s2,s3} - {s2,s1}) < 2)', |
| 7466 | | '-evalf', 's1:STRING & s2:STRING & not( s1:STRING <=> 1=1 )', |
| 7467 | | '-evalf', 's1:STRING & s2:STRING & not( s1/:STRING <=> 1=2 )', |
| 7468 | | '-evalf', 's1:STRING & s2:STRING & not( s1=s2 <=> {s1} \\/ {s2} = {s1})', |
| 7469 | | '-evalf', 's1:STRING & s2:STRING & not( {s1,s2} \\/ {s3} = {s1,s2,s3})', |
| 7470 | | '-evalf', 's1:STRING & s2:STRING & not( {s2} \\/ {s1,s2,s3} = {s1,s2,s3} )', |
| 7471 | | '-evalf', 'S={"a","b"} & s1:S & s2:S & s3:S & not( s1 /= s3 => ({s1,s2} /\\ {s3,s2} = {s2}))', |
| 7472 | | '-evalf', 'S={"a","b"} & s1:S & s2:S & s3:S & not( #x.(x:STRING & {x} \\/ {s1,s2} = {s1,s2} & x:{s1,s2,s3}))', |
| 7473 | | '-evalf', 'S={"a","b"} & s1:S & s2:S & s3:S & not( #x.(x:STRING & {x} \\/ {s1,s2} = {s1,s2} ) )', |
| 7474 | | '-evalf', 'SS<:POW(BOOL) & not( SS \\/ (TT /\\ VV) = (SS \\/ TT) /\\ (SS \\/ VV))', |
| 7475 | | '-evalf', 'SS<:POW(BOOL) & not( SS <<: VV => (card(SS) < card(VV)) )', |
| 7476 | | '-evalf', 'x<:BOOL & not(POW(x) = POW1(x) \\/ {{}})', |
| 7477 | | '-evalf', 'not(#t138.(x<:BOOL & (!t135.(t135 <: x => t135 : t138 \\/ {{}}) & !t135.(t135 : t138 \\/ {{}} => t135 <: x) & (!t137.(t137 <: x & not(t137 = {}) => t137 : t138) & !t137.(t137 : t138 => t137 <: x & not(t137 = {}))))))', % translation of above for z3 |
| 7478 | | '-evalf', 'x<:BOOL & x <<: y & not(POW(x) <<: POW(y))', |
| 7479 | | '-evalf', 'x<:BOOL & not(x = y) & x <: y & not(not(#t166.(btrue & (!t163.(t163 <: x => t163 : t166) & !t163.(t163 : t166 => t163 <: x) & (!t165.(t165 <: y => t165 : t166) & !t165.(t165 : t166 => t165 <: y))))) & #(t168,t170).(t168 <: t170 & (!t167.(t167 <: x => t167 : t168) & !t167.(t167 : t168 => t167 <: x) & (!t169.(t169 <: y => t169 : t170) & !t169.(t169 : t170 => t169 <: y)))))', % translation of above for z3 |
| 7480 | | '-evalf', 'SS<:BOOL & VV<:BOOL & not(union({SS,VV})=SS \\/ VV)', |
| 7481 | | '-evalf', 'SS<:BOOL & VV<:BOOL & not(union({SS,VV,WW})=SS \\/ VV \\/ WW)', |
| 7482 | | '-evalf', 'SS<:BOOL & VV<:BOOL & SV = {SS}\\/{VV} & SVW= SV\\/{WW} & not(union(SVW)=SS \\/ VV \\/ WW)', |
| 7483 | | '-evalt', 'SS<:BOOL & VV<:BOOL & SV = {SS}\\/{VV} & SVW= SV\\/{WW} & not(inter(SVW)=SS \\/ VV \\/ WW)', |
| 7484 | | '-evalf', 'SS<:BOOL & VV<:BOOL & SV = {SS}\\/{VV} & SVW= SV\\/{WW} & not(inter(SVW)=SS /\\ VV /\\ WW)', |
| 7485 | | '-evalf', 'SS<:POW(BOOL) & not(union({SS,TT}) = SS \\/ TT)', |
| 7486 | | '-evalf', 'SS<:POW(BOOL) & not(SS/={} & TT/={} => inter(SS \\/ TT) = inter(SS) /\\ inter(TT))', |
| 7487 | | '-evalf', 'r:BOOL <-> BOOL & not(r <: closure1(r))', |
| 7488 | | '-evalf', 'r:BOOL <-> BOOL & not(r <: closure(r))', |
| 7489 | | '-evalf', 'rx:BOOL <-> BOOL & not(id( dom(rx) \\/ ran(rx) ) <: closure(rx))', |
| 7490 | | '-evalf', 'rx:BOOL <-> BOOL & not(( id(BOOL) ; rx) = rx)', |
| 7491 | | '-evalf', 'rx:BOOL <-> BOOL & not(( rx ; id(BOOL) ) = rx)', |
| 7492 | | '-evalf', 'rx:BOOL <-> BOOL & ff:BOOL<->BOOL & not(( rx; ff )~ = (ff~ ; rx ~))', |
| 7493 | | '-evalf', 'rx:BOOL <-> BOOL & ff:BOOL<->BOOL & not( (ff ; rx)[HH] = rx[ff[HH]])', |
| 7494 | | '-evalf', 'ff:BOOL<->BOOL & not( gg <+ ff = (dom(ff) <<| gg) \\/ ff )', |
| 7495 | | '-evalf', 'ff:BOOL<->BOOL & gg:BOOL<->BOOL & not( dom(ff) <<| gg = {a,b| (a,b):gg & a/:dom(ff)} )', |
| 7496 | | '-evalf', 'ff:BOOL<->BOOL & gg:BOOL<->BOOL & not( gg |>> ran(ff) = {a,b| (a,b):gg & b/:ran(ff)})', |
| 7497 | | '-evalf', 'ff:BOOL<->BOOL & ii=1 & not (iterate(ff,ii) = ff)', |
| 7498 | | '-evalf', 'x<:BOOL & x <: y & not(POW(x) <: POW(y))', |
| 7499 | | '-evalt', 'x<:BOOL & x <: y & not(POW(x) <<: POW(y))', % True, |
| 7500 | | '-evalf', 'x<:BOOL & x <<: y & not(POW(x) <<: POW(y))', |
| 7501 | | '-evalf', 'xx:0..3 & not(xx>xx-1 & card(xx..xx) = 1)', % used to cause timeout in CHR mode |
| 7502 | | '-evalf', 'f:BOOL-->POW(BOOL) & card(f(TRUE))=0 & card(f(FALSE))=0 & card(union(ran(f)))>0', |
| 7503 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 7504 | | ], 'check laws expressed as individual constraints'). |
| 7505 | | |
| 7506 | | cli_testcase(2132, [laws], ['-p', 'SMT', 'TRUE', |
| 7507 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x<y & y<z) => x<z) ', % does not work with CLPFD=FALSE |
| 7508 | | '-evalf', 'x:-3..3 & y:-3..3 & not((x<=y & y<z) => x<z) ' |
| 7509 | | |Cmds],'Test 2131 with SMT true') :- |
| 7510 | | cli_testcase(2131, _, Cmds,_). |
| 7511 | | cli_testcase(2133, [laws, chr], ['-p', 'CHR', 'TRUE' |Cmds],'Test 2131 with SMT and CHR true') :- |
| 7512 | | cli_testcase(2132, _, Cmds,_). |
| 7513 | | cli_testcase(2134, [laws], ['-p', 'CLPFD', 'FALSE' |Cmds],'Test 2131 with CLPFD false') :- |
| 7514 | | cli_testcase(2131, _, Cmds,_). |
| 7515 | | cli_testcase(2135, [b_test], [ |
| 7516 | | '../prob_examples/public_examples/B/Tester/Uses/MachineB_wrong_uses.mch', |
| 7517 | | '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check that operations of a used machine cannot be called'). |
| 7518 | | cli_testcase(2136, [b_test], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7519 | | '../prob_examples/public_examples/B/PerformanceTests/ModelChecking/IncrementalStatePackingTestLargeSlow_err.mch', |
| 7520 | | '-mc', 20, '-p', 'PROOF_INFO', 'TRUE', |
| 7521 | | '-expcterr', 'invariant_violation'], 'Check that invariant (proven for all events) violation found'). |
| 7522 | | cli_testcase(2137, [b_test, operation_reuse, operation_reuse_full], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7523 | | '../prob_examples/public_examples/B/PerformanceTests/ModelChecking/IncrementalStatePackingTestLargeSlow_err.mch', |
| 7524 | | '-mc', 20, '-p', 'OPERATION_REUSE', 'full', '-p', 'PROOF_INFO', 'TRUE', |
| 7525 | | '-expcterr', 'invariant_violation'], 'Check that invariant (proven for all events) violation found'). |
| 7526 | | cli_testcase(2138, [eventb_test, operation_reuse, operation_reuse_full, codespeed], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7527 | | '../prob_examples/public_examples/EventBPrologPackages/ABZ_Landing_Gear/Ref3_ControllerSensors_mch.eventb', |
| 7528 | | '-mc', 2500, '-p', 'OPERATION_REUSE', 'full', '-p', 'COMPRESSION', 'TRUE', '-nodead', |
| 7529 | | '-cc', 2354, 10154, |
| 7530 | | '-check_op_cache_stats', 242, 0, 24, 0 % used to be 248,24,2; |
| 7531 | | % but after improving Proof info 6 calls to invariant checks have disappeared; see also test 2218 |
| 7532 | | ], 'Check that operation reuse works for Event-B'). |
| 7533 | | cli_testcase(2139, [b_test, operation_reuse, operation_reuse_full, codespeed], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7534 | | '../prob_examples/public_examples/B/Other/Meeduse/gpuScheduler_main.mch', |
| 7535 | | '-mc', 4000, '-p', 'OPERATION_REUSE', 'full', '-p', 'COMPRESSION', 'TRUE', '-noass', |
| 7536 | | '-cc', 3180, 26054, |
| 7537 | | '-check_op_cache_stats', 9598, 3566, 4, 10],% 3566 was 3500, before remove_finite rule made more conservative |
| 7538 | | 'Check Meeduse model'). |
| 7539 | | cli_testcase(2140, [b_test, operation_reuse, operation_reuse_full, codespeed], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7540 | | '../prob_examples/public_examples/B/Other/Meeduse/gpuScheduler_main.mch', |
| 7541 | | '-mc', 4000, '-p', 'OPERATION_REUSE', 'full', '-p', 'COMPRESSION', 'TRUE', '-noass', |
| 7542 | | '-nodead', '-p', 'SAFETY_MODEL_CHECK', 'TRUE', '-bf', |
| 7543 | | '-cc', 3180, 3181, % was 3179, but now we store at least one transition per operation for coverage |
| 7544 | | '-check_op_cache_stats', 9598 , 3566, 4, 10], % 3566 was 3500, before remove_finite rule made more conservative |
| 7545 | | 'Test 2140 with safety invariant model checking'). |
| 7546 | | cli_testcase(2141, [eventb_test, operation_reuse, operation_reuse_full, codespeed], [ |
| 7547 | | '../prob_examples/examples/EventBPrologPackages/Advance_WP2/v6_Sep2014/ex_mch.eventb', |
| 7548 | | '-animate', 300, '-p', 'OPERATION_REUSE', 'full', '-p', 'COMPRESSION', 'TRUE', |
| 7549 | | '-check_op_cache_stats', '_', '_', 41, 28], 'Test used to pose problem to operation reuse'). |
| 7550 | | cli_testcase(2142, [cbc], [ |
| 7551 | | '-evalt','x>1 & y:NATURAL & y=x+x & z={y,x}', |
| 7552 | | '-p', 'CLPFD', 'TRUE', '-p', 'CHR', 'FALSE'], 'Check CLPFD overflows are caught'). |
| 7553 | | cli_testcase(2143, [operation_reuse, csp_test,cspb], ['-p', 'STRICT_RAISE_ENUM_WARNINGS','TRUE', |
| 7554 | | '../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/Airports.mch', '-csp-guide', |
| 7555 | | '../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/AirportsCtrl.csp', |
| 7556 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'OPERATION_REUSE', 'TRUE', '-mc', 1000, |
| 7557 | | '-check_op_cache_stats', 127, 0, 2 , 0, |
| 7558 | | '-cc', 843, 3504, '-strict'], 'Checking operation reuse CSP-M || B models.'). |
| 7559 | | cli_testcase(2144, [operation_reuse,csp_test,cspb],['-p', 'STRICT_RAISE_ENUM_WARNINGS','TRUE', |
| 7560 | | '../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-csp-guide', |
| 7561 | | '../prob_examples/public_examples/CSPB/Dining/Dining.csp', |
| 7562 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'OPERATION_REUSE', 'TRUE', |
| 7563 | | '-mc', 5000, '-nodead', |
| 7564 | | '-p', 'MAX_INITIALISATIONS', 100, |
| 7565 | | '-check_op_cache_stats', 516, 373, 3 , 2, |
| 7566 | | '-cc', 1862, 4957, |
| 7567 | | '-strict'],'Check operation_reuse in Dining.csp'). |
| 7568 | | cli_testcase(2145, [operation_reuse,csp_test,cspb],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS','TRUE', |
| 7569 | | '../prob_examples/public_examples/CSPB/LTSMin/Counters_smaller.mch', '-csp-guide', |
| 7570 | | '../prob_examples/public_examples/CSPB/LTSMin/Counters.csp', |
| 7571 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'OPERATION_REUSE', 'TRUE', |
| 7572 | | '-mc', 85000, |
| 7573 | | '-check_op_cache_stats', 63, 0 , 3 , 0, |
| 7574 | | '-cc', 21486, 21486, |
| 7575 | | '-strict'],'Check operation_reuse in Dining.csp'). |
| 7576 | | cli_testcase(2146, [b_test,card], ['-strict', '-p', 'STRICT_RAISE_ENUM_WARNINGS','TRUE', |
| 7577 | | '../prob_examples/public_examples/B/FeatureChecks/DeferredSetsDisjointSubsets1.mch', '-init' ,'-assertions'], 'check cardinality of deferred set detects disjoint subsets'). |
| 7578 | | cli_testcase(2147, [smt_solver_integration], [ |
| 7579 | | '-evalt', ':z3-double-check a="(!&/()=>\\"<,.\\"-_%?"', |
| 7580 | | '-evalt', ':z3-double-check a=""', |
| 7581 | | '-evalt', ':z3-double-check a="\\""', |
| 7582 | | '-evalt', ':z3-double-check a="\\"\\""' |
| 7583 | | ], 'check z3 model translation for strings'). |
| 7584 | | cli_testcase(2148, [operation_reuse,eventb_test],[ |
| 7585 | | '../prob_examples/examples/EventBPrologPackages/Soton/UML-B/drone_0_mch.eventb', |
| 7586 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'OPERATION_REUSE', 'TRUE', |
| 7587 | | '-mc', 3000, '-scope', 'card(SCXML_eq)<5', |
| 7588 | | '-check_op_cache_stats', 1164, 0, 15 , 0, |
| 7589 | | % analysed are these, but many more are added to the state space'-cc', 2422, 10767, |
| 7590 | | '-strict'],'Check operation_reuse with scope'). |
| 7591 | | cli_testcase(2149, [smt_solver_integration], [ |
| 7592 | | '-evalt', ':z3-double-check rev(["a","b"]) = a', |
| 7593 | | '-evalf', ':z3-double-check rev(["a"]) = []', |
| 7594 | | '-evalt', ':z3-double-check first(["a","b"]) = a', |
| 7595 | | '-evalt', ':z3-double-check last(["a","b"]) = a', |
| 7596 | | '-evalt', ':z3-double-check ["a","b"]<-"c" = a', |
| 7597 | | '-evalt', ':z3-double-check "c"->["a","b"] = a', |
| 7598 | | '-evalt', ':z3-double-check tail(["a","b"]) = a', |
| 7599 | | '-evalt', ':z3-double-check front(["a","b"]) = a', |
| 7600 | | '-evalt', ':z3-double-check rev([3,4]) = a', |
| 7601 | | '-evalf', ':z3-double-check rev([6]) = []', |
| 7602 | | '-evalt', ':z3-double-check first([7,8]) = a', |
| 7603 | | '-evalt', ':z3-double-check last([9,10]) = a', |
| 7604 | | '-evalt', ':z3-double-check [11,12,13]<-14 = a', |
| 7605 | | '-evalt', ':z3-double-check 9->[6,155] = a', |
| 7606 | | '-evalt', ':z3-double-check tail([4,7]) = a', |
| 7607 | | '-evalt', ':z3-double-check front([4,7]) = a', |
| 7608 | | '-evalt', ':z3-double-check size([4,7,5]) = a', |
| 7609 | | '-evalt', ':z3-double-check size([4,7,5]) = 3', |
| 7610 | | '-evalf', ':z3-double-check size([4,7,5]) = 4' |
| 7611 | | ], 'check sequences with z3'). |
| 7612 | | cli_testcase(2150, [operation_reuse,eventb_test],[ |
| 7613 | | '../prob_examples/examples/RodinModels/SAP/TUCC_Example/v3/m_wodel123_partner_behaviour.eventb', |
| 7614 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'OPERATION_REUSE', 'TRUE', |
| 7615 | | '-mc', 1000, '-expcterr', 'model_check_incomplete', |
| 7616 | | '-op_cache_profile', |
| 7617 | | '-strict'],'Check that unmodifiable check works and read vars are correctly computed'). |
| 7618 | | cli_testcase(2151, [pragmas,eventb_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7619 | | '../prob_examples/public_examples/EventBPrologPackages/Tests/TestProBIgnoreAxioms_ctx.eventb', |
| 7620 | | '-init', '-p', 'USE_IGNORE_PRAGMAS', 'TRUE', |
| 7621 | | '-strict'],'Check prob-ignore labels respected'). |
| 7622 | | cli_testcase(2152, [b_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7623 | | '../prob_examples/public_examples/B/PerformanceTests/Compression/TotFunSkeleton.mch', |
| 7624 | | '-mc', 1000, '-expcterr', 'model_check_incomplete', |
| 7625 | | '-p', 'COMPRESSION', 'full', '-memory', '-prob-profile', % TODO: check that we Stored 1 AVL sets |
| 7626 | | '-strict'],'Exercise bit-vector compression'). |
| 7627 | | cli_testcase(2153, [b_test,json_trace_replay,records,operation_reuse], ['../prob_examples/public_examples/B/FeatureChecks/AssignToRecordField.mch', |
| 7628 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'OPERATION_REUSE', 'full', |
| 7629 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/FeatureChecks/AssignToRecordField.prob2trace' |
| 7630 | | ], 'Check read information correctly identfied'). |
| 7631 | | cli_testcase(2154, [tickets,json_trace_replay], ['../prob_examples/public_examples/B/Tickets/PartitionPrettyPrintBug/ABZ16_m4.eventb', |
| 7632 | | '-pp', '../prob_examples/public_examples/B/Tickets/PartitionPrettyPrintBug/ABZ16_m4_pp.mch', |
| 7633 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tickets/PartitionPrettyPrintBug/ABZ16_m4.prob2trace' |
| 7634 | | ], 'Check partition pretty-printing properly parenthesised'). |
| 7635 | | cli_testcase(2155, [b_test,cruise,external,operation_reuse], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7636 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-bf', |
| 7637 | | '-scope', 'PROB_STATISTICS("bf-level")<5', |
| 7638 | | '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'COMPRESSION', 'TRUE', |
| 7639 | | '-cc', '833', '6578', % 456 are ignored |
| 7640 | | '-strict', '-nodead', '-p', 'MAX_INITIALISATIONS', 5], 'Test SCOPE with breadth-first level predicate'). |
| 7641 | | cli_testcase(2156, [wd], ['../prob_examples/public_examples/B/Tickets/PartitionPrettyPrintBug/ABZ16_m4.eventb', |
| 7642 | | '-evalu', ':prove not(x=STANDBY) => not(x=PREPARATION)', |
| 7643 | | '-evalu', ':prove x=STANDBY => x=PREPARATION', |
| 7644 | | '-evalt', ':prove x=TRUE => not(x=FALSE)', |
| 7645 | | '-evalt', ':prove not(x=TRUE) => x=FALSE', |
| 7646 | | '-evalt', ':prove x=STANDBY => not(x=PREPARATION)' |
| 7647 | | ], 'Check simple equalities proven by wd prover'). |
| 7648 | | cli_testcase(2157, [infinite,external,choose], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7649 | | '-evalt', 's={f|f = /*@symbolic*/ %x.(x : NATURAL | IF x = 1 THEN 1 ELSE x+1 END)} & res = CHOOSE(s)(2)', |
| 7650 | | '-evalt', 'f = /*@symbolic*/ %x.(x : NATURAL | IF x = 1 THEN 1 ELSE x+1 END) & s = {f} & res = CHOOSE(s)(2)', |
| 7651 | | '-evalt', 's={f|f = /*@symbolic*/ %x.(x : NATURAL | IF x = 1 THEN 1 ELSE x+1 END)} & res = MU(s)(2)', |
| 7652 | | '-evalt', 'f = /*@symbolic*/ %x.(x : NATURAL | IF x = 1 THEN 1 ELSE x+1 END) & s = {f} & 3 = MU(s)(2)' |
| 7653 | | % '-evalt', 'f = /*@symbolic*/ %x.(x : NATURAL | IF x = 1 THEN 1 ELSE x+1 END) & s = {f, {0|->0}}' % does not work |
| 7654 | | ], 'Check singleton sets with infinite element are not expanded, and check MU/CHOOSE'). |
| 7655 | | cli_testcase(2158, [infinite,external,choose], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7656 | | '-evalt', 'f = /*@symbolic*/ %x.(x : NATURAL | IF x = 0 THEN 0 ELSE 2+f(x-1) END) /*@desc recursive_let */ & f(20)=40', |
| 7657 | | '-evalt', 'f = /*@symbolic*/ %x.(x >=0 | IF x = 0 THEN 1 ELSE 2+f(x-1) END) /*@desc letrec */ & f(20)=41', |
| 7658 | | '-evalt', '{f|f = /*@symbolic*/ %x.(x : NATURAL | IF x = 0 THEN 0 ELSE 2+f(x-1) END) /*@desc recursive_let*/ } = s & rf = CHOOSE(s) & res = rf(10)', |
| 7659 | | '-evalt', '{f|f = /*@symbolic*/ %x.(x : NATURAL | IF x = 0 THEN 0 ELSE 2+f(x-1) END) /*@desc recursive_let*/ } = s & rf = MU(s) & 20 = rf(10)', |
| 7660 | | '-evalt', 'MU({f|f = /*@symbolic*/ %x.(x>=0 | IF x = 0 THEN 0 ELSE 2+f(x-1) END) /*@desc recursive_let*/ })(10) = 20', |
| 7661 | | '-evalt', 'MU({f|f = /*@symbolic*/ %x.(x : NATURAL1 | IF x = 1 THEN 0 ELSE 1+f(x/2) END) /*@desc letrec */})(1024) = 10', |
| 7662 | | '-evalt', 'card({f|f = /*@symbolic*/ %x.(x : NATURAL1 | IF x = 1 THEN 0 ELSE 1+f(x/2) END) /*@desc letrec */})=1' |
| 7663 | | ], 'Check recursive_let pragma annotation'). |
| 7664 | | cli_testcase(2159, [infinite,external,choose], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7665 | | '-evalt', 'ilog2 = /*@symbolic */ {x,r| x:NATURAL & 2**r<=x & 2**(r+1) > x} & res=ilog2(1024)', |
| 7666 | | '-evalt', 'ilog2 = /*@symbolic */ {x,r| x:NATURAL & 2**r<=x & 2**(r+1) > x} & 10=ilog2(1024) & ilog2(1025)=10 & ilog2(2048)=11', |
| 7667 | | '-evalt', 'ilog3 = /*@symbolic */ {x,r| x:NATURAL & 3**r<=x & 3**(r+1) > x} & 4=ilog3(81) & ilog3(1000)=6', |
| 7668 | | '-evalt', '1**r = t & t:0..100' |
| 7669 | | ], 'Check propagation of power_of / exponentiation'). |
| 7670 | | cli_testcase(2160, [external], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7671 | | '../prob_examples/public_examples/B/FeatureChecks/NonDetDetection/NonDetSelect.mch', |
| 7672 | | '-mc', 1000, '-noinv', '-noass', '-expecterr', 'goal_found' |
| 7673 | | ], 'Check NON_DET_STATE external function and use of external functions in GOAL'). |
| 7674 | | cli_testcase(2161, [recursion,json_trace_replay], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7675 | | '../prob_examples/public_examples/B/RecursiveFunctions/Factorial_NewSyntax.mch', |
| 7676 | | '-trace_replay', json, '../prob_examples/public_examples/B/RecursiveFunctions/Factorial_NewSyntax.prob2trace', |
| 7677 | | '-assertions' |
| 7678 | | ], 'Check JSON trace replay works with recursive function'). |
| 7679 | | cli_testcase(2162, [cdclt,smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7680 | | '../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/ABZ16_m4.eventb', '-init', |
| 7681 | | '-p', 'TIME_OUT', '60000', |
| 7682 | | '-evalf', ':z3-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_0.eval', |
| 7683 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_0.eval', |
| 7684 | | '-evalf', ':z3-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_1.eval', |
| 7685 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_1.eval', |
| 7686 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_2.eval', |
| 7687 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_3.eval', |
| 7688 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_4.eval', |
| 7689 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_5.eval', |
| 7690 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_6.eval', |
| 7691 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_7.eval', |
| 7692 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_8.eval', |
| 7693 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_9.eval', |
| 7694 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_10.eval', |
| 7695 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_11.eval', |
| 7696 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_12.eval', |
| 7697 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_13.eval', |
| 7698 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_14.eval', |
| 7699 | | '-evalf', ':cdclt-file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m4/m4_monolithic_bmc_k_15.eval' |
| 7700 | | ], 'Double check CDCL(T) solver for BMC constraints of ABZ16_m4'). |
| 7701 | | cli_testcase(2163, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7702 | | '../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/ABZ16_m6.eventb', '-init', |
| 7703 | | '-p', 'TIME_OUT', '60000', |
| 7704 | | '-eval', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_0.eval', |
| 7705 | | '-eval', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_1.eval', |
| 7706 | | '-eval', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_2.eval', |
| 7707 | | '-eval', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_3.eval', |
| 7708 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_0.eval', |
| 7709 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_1.eval', |
| 7710 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_2.eval', |
| 7711 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_3.eval' |
| 7712 | | ], 'Double check CDCL(T) solver for BMC constraints of ABZ16_m6 containing unfixed deferred sets'). |
| 7713 | | cli_testcase(2164, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7714 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/R5_Switch.eventb', '-init', |
| 7715 | | '-p', 'TIME_OUT', '60000', |
| 7716 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_0.eval', |
| 7717 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_1.eval', |
| 7718 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_2.eval', |
| 7719 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_3.eval', |
| 7720 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_0.eval', |
| 7721 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_1.eval', |
| 7722 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_2.eval', |
| 7723 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_3.eval' |
| 7724 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearSwitch/Ref5_Switch_monolithic_bmc_k_4.eval' % needs more than 60 seconds |
| 7725 | | ], 'Double check CDCL(T) solver for BMC constraints of Landing Gear R5 Switch'). |
| 7726 | | cli_testcase(2165, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'FALSE', |
| 7727 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/R6_Lights.eventb', '-init', |
| 7728 | | '-p', 'TIME_OUT', '60000', |
| 7729 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_0.eval', |
| 7730 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1.eval', |
| 7731 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_2.eval', |
| 7732 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_3.eval', |
| 7733 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_0.eval', |
| 7734 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1.eval', |
| 7735 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_2.eval', |
| 7736 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_3.eval' |
| 7737 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_4.eval', % needs more than 60 seconds |
| 7738 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_5.eval', % |
| 7739 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6.eval' % |
| 7740 | | ], 'Double check CDCL(T) solver for BMC constraints of Landing Gear R6 Lights'). |
| 7741 | | cli_testcase(2166, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'FALSE', |
| 7742 | | '../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching.mch', '-init', |
| 7743 | | '-p', 'TIME_OUT', '60000', |
| 7744 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/core_bug.eval', |
| 7745 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 7746 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 7747 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 7748 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval', |
| 7749 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_4.eval', |
| 7750 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_5.eval', |
| 7751 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_6.eval', |
| 7752 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_7.eval', |
| 7753 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_8.eval', |
| 7754 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_9.eval', |
| 7755 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_10.eval', |
| 7756 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_11.eval', |
| 7757 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_12.eval', |
| 7758 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_13.eval', |
| 7759 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_14.eval', |
| 7760 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_15.eval', |
| 7761 | | % long runtime for the following tests |
| 7762 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_16.eval', |
| 7763 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_17.eval', |
| 7764 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_18.eval', |
| 7765 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_19.eval', |
| 7766 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_20.eval', |
| 7767 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_21.eval', |
| 7768 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_22.eval', |
| 7769 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_23.eval', |
| 7770 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_24.eval', |
| 7771 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_25.eval', |
| 7772 | | % same constraints but not considering the current state |
| 7773 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/core_bug.eval', |
| 7774 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 7775 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 7776 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 7777 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval', |
| 7778 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_4.eval', |
| 7779 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_5.eval', |
| 7780 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_6.eval', |
| 7781 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_7.eval', |
| 7782 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_8.eval', |
| 7783 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_9.eval', |
| 7784 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_10.eval', |
| 7785 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_11.eval', |
| 7786 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_12.eval', |
| 7787 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_13.eval', |
| 7788 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_14.eval', |
| 7789 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_15.eval', |
| 7790 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_16.eval', |
| 7791 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_17.eval', |
| 7792 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_18.eval', |
| 7793 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_19.eval', |
| 7794 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_20.eval', |
| 7795 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_21.eval', |
| 7796 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_22.eval', |
| 7797 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_23.eval', |
| 7798 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_24.eval', |
| 7799 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_25.eval' |
| 7800 | | |
| 7801 | | ], 'Double check CDCL(T) solver for BMC constraints of LargeBranching'). |
| 7802 | | cli_testcase(2167, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7803 | | '../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase.tla', '-init', |
| 7804 | | '-p', 'TIME_OUT', '60000', |
| 7805 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_0.eval', |
| 7806 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_1.eval', |
| 7807 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_2.eval', |
| 7808 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_3.eval', |
| 7809 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_4.eval', |
| 7810 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_5.eval', |
| 7811 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_6.eval', |
| 7812 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_7.eval', |
| 7813 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_8.eval', |
| 7814 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_9.eval', |
| 7815 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_10.eval', |
| 7816 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_11.eval', |
| 7817 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_12.eval', |
| 7818 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_13.eval', |
| 7819 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_14.eval', |
| 7820 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_15.eval', |
| 7821 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_16.eval', |
| 7822 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_17.eval', |
| 7823 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_18.eval', |
| 7824 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_19.eval', |
| 7825 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_20.eval', |
| 7826 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_21.eval', |
| 7827 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_22.eval', |
| 7828 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_23.eval', |
| 7829 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_24.eval', |
| 7830 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_25.eval', |
| 7831 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_0.eval', |
| 7832 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_1.eval', |
| 7833 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_2.eval', |
| 7834 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_3.eval', |
| 7835 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_4.eval', |
| 7836 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_5.eval', |
| 7837 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_6.eval', |
| 7838 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_7.eval', |
| 7839 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_8.eval', |
| 7840 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_9.eval', |
| 7841 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_10.eval', |
| 7842 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_11.eval', |
| 7843 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_12.eval', |
| 7844 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_13.eval', |
| 7845 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_14.eval', |
| 7846 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_15.eval', |
| 7847 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_16.eval', |
| 7848 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_17.eval', |
| 7849 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_18.eval', |
| 7850 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_19.eval', |
| 7851 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_20.eval', |
| 7852 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_21.eval', |
| 7853 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_22.eval', |
| 7854 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_23.eval', |
| 7855 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_24.eval', |
| 7856 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_25.eval' |
| 7857 | | |
| 7858 | | ], 'Double check CDCL(T) solver for BMC constraints of SimpleTwoPhase'). |
| 7859 | | cli_testcase(2168, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7860 | | '../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents.mch', '-init', |
| 7861 | | '-p', 'TIME_OUT', '60000', |
| 7862 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_0.eval', |
| 7863 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_1.eval', |
| 7864 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_0.eval', |
| 7865 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_1.eval' |
| 7866 | | ], 'Double check CDCL(T) solver for BMC constraints of SearchEvents'). |
| 7867 | | cli_testcase(2169, [eventb_test,json_trace_replay,operation_reuse], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7868 | | '../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m3_mch.eventb', |
| 7869 | | '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'COMPRESSION', 'TRUE', '-mc', 500, |
| 7870 | | '-property', 'd=3', '-cc', 239, 505, |
| 7871 | | '-trace_replay', 'json', |
| 7872 | | '../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m3_mch.prob2trace', |
| 7873 | | '-read_write_matrix_csv', '../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m3_rw_matrix.csv' |
| 7874 | | ], 'Check variant variables lead to no problem'). |
| 7875 | | cli_testcase(2170, [b_test,recursion,external,quantified,union,json_trace_replay], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7876 | | '../prob_examples/public_examples/B/Compilers/NFA.mch', |
| 7877 | | '-trace_replay', 'json','../prob_examples/public_examples/B/Compilers/NFA.prob2trace'], 'Test trace replay with recursive symbolic functions.'). |
| 7878 | | cli_testcase(2171, [infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7879 | | '-evalt', '%n.(n:NATURAL|%x.(x:NATURAL|2*x+n)) = f & f = %n.(n:NATURAL|%y.(y:NATURAL|2*y+n))' |
| 7880 | | ], 'Test comparison of symbolic functions / sets with alpha-conversion'). |
| 7881 | | cli_testcase(2172, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7882 | | '../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents.mch', '-init', |
| 7883 | | '-p', 'TIME_OUT', '30000', |
| 7884 | | '-evalf', ':prob-file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_0.eval', |
| 7885 | | '-evalt', ':prob-file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_1.eval', |
| 7886 | | '-evalf', ':prob-file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_2.eval' |
| 7887 | | % SearchEvents_monolithic_bmc_k_3.eval too slow |
| 7888 | | ], 'Adapted version of test 2168 for prob'). |
| 7889 | | cli_testcase(2173, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7890 | | '-p', 'TIME_OUT', '60000', |
| 7891 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/Eval/SAT_uf20-02.eval', |
| 7892 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/Eval/SAT_uf20-02_pred.eval', |
| 7893 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/Eval/SAT_uf20-02_unsat.eval' |
| 7894 | | ], 'Double check CDCL(T) solver for SAT constraints'). |
| 7895 | | cli_testcase(2174, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'FALSE', |
| 7896 | | '../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching.mch', |
| 7897 | | '-p', 'TIME_OUT', '3000', '-init', |
| 7898 | | |
| 7899 | | '-evalf', ':prob-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 7900 | | '-evalt', ':prob-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 7901 | | '-evalt', ':prob-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 7902 | | '-evalt', ':prob-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval', |
| 7903 | | |
| 7904 | | '-evalf', ':z3-free-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 7905 | | '-evalt', ':z3-free-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 7906 | | '-evalt', ':z3-free-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 7907 | | '-evalt', ':z3-free-file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval' |
| 7908 | | ], 'Variation of test 2166 with z3 and prob; testing new :z3-free command'). |
| 7909 | | cli_testcase(2175, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'FALSE', |
| 7910 | | '-p', 'TIME_OUT', '3000', |
| 7911 | | '-evalt', ':z3-double-check l = {1,2,4} & !x.(x:l => y /= x) & (#z.(z:l & y=z+z) <=> b=TRUE)', |
| 7912 | | '-evalt', ':z3-double-check x : POW({1,2,y}) & z:x & z>2', % check precomputation does not fail |
| 7913 | | '-evalt', ':z3-double-check !(x,y).(x|->y:[1,2,3] => v /= x)', |
| 7914 | | '-evalt', ':z3-cns DOM = 1..3 & Board : POW(DOM * DOM * DOM)', % check POW elimination |
| 7915 | | '-evalt', ':z3-cns Board : POW(DOM * DOM * DOM) & DOM <: INTEGER', |
| 7916 | | %'-evalt', ':z3-axm Board : POW(DOM * DOM * DOM) & DOM <: INTEGER', % unkown since Z3 4.12.2 |
| 7917 | | '-evalt', ':z3-cns mxint = 500 & goal : -mxint ..mxint', % is now more performant |
| 7918 | | '-evalt', ':z3-double-check not(A\\/B=BOOL & A/\\B={}) & A={TRUE} & A \\/ B = BOOL', % check negated partition |
| 7919 | | %'-evalt', ':z3-double-check ((x:FIN(x) or x<:NATURAL1) => B=TRUE) & (x=1..10 or x = NATURAL) & B=TRUE', % TODO: mk_value fails |
| 7920 | | '-evalt', ':z3-file ../prob_examples/public_examples/Eval/argumentation_theory.eval' |
| 7921 | | ], 'Check quantifier expansion for z3'). |
| 7922 | | cli_testcase(2176, [cdclt,smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7923 | | '-p', 'TIME_OUT', '60000', |
| 7924 | | '-evalf', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & !ii.(ii:2..3 => aa(ii)/=aa(ii-1)) & ran(aa)={FALSE}', |
| 7925 | | %'-evalf', ':z3-double-check ii=1 & aa:1..3 --> BOOL & !ii.(ii:2..3 => aa(ii)/=aa(ii-1)) & ran(aa)={FALSE}', % unknown |
| 7926 | | %'-evalt', ':z3-double-check ii=1 & aa:1..3 --> BOOL & !ii.(ii:2..3 => aa(ii)/=aa(ii-1)) & ran(aa)={FALSE,TRUE}', % unknown |
| 7927 | | '-evalf', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & !ii.(ii:2..3 => aa(ii)/=aa(ii-1)) & ran(aa)={FALSE}', |
| 7928 | | %'-evalf', ':z3-double-check ii=1 & aa:1..3 --> BOOL & !ii.(ii:2..3 => aa(ii)/=aa(ii-1)) & ran(aa)={FALSE}', % unknown |
| 7929 | | '-evalf', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & {ii|aa(ii)=TRUE} = dom(aa) & FALSE:ran(aa)', |
| 7930 | | '-evalf', ':z3-double-check ii=1 & aa:1..3 --> BOOL & {ii|aa(ii)=TRUE} = dom(aa) & FALSE:ran(aa)', |
| 7931 | | '-evalt', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & SIGMA(ii).(ii|->TRUE:aa|ii) = 6', |
| 7932 | | '-evalf', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & SIGMA(ii).(ii|->TRUE:aa|ii) = 6 & FALSE:ran(aa)', |
| 7933 | | '-evalt', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & PI(ii).(ii|->TRUE:aa|ii+1) = 24', |
| 7934 | | '-evalf', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & PI(ii).(ii|->TRUE:aa|ii+1) = 24 & FALSE:ran(aa)', |
| 7935 | | '-evalt', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & UNION(ii).(ii|->TRUE:aa |{ii}) = 1..3', |
| 7936 | | '-evalf', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & UNION(ii).(ii|->TRUE:aa |{ii}) = 1..3 & FALSE:ran(aa)', |
| 7937 | | '-evalt', ':z3-double-check ii=1 & aa:1..3 --> BOOL & UNION(ii).(ii|->TRUE:aa |{ii}) = 1..3', |
| 7938 | | '-evalf', ':z3-double-check ii=1 & aa:1..3 --> BOOL & UNION(ii).(ii|->TRUE:aa |{ii}) = 1..3 & FALSE:ran(aa)', |
| 7939 | | '-evalt', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & INTER(ii).(ii|->TRUE:aa or ii=0|ii..(ii+1)) = 0..1', |
| 7940 | | '-evalf', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & INTER(ii).(ii|->TRUE:aa or ii=0|ii..(ii+1)) = 0..1 & TRUE:ran(aa)', |
| 7941 | | '-evalt', ':cdclt-double-check ii=1 & aa:1..3 --> BOOL & LET ii BE ii=3 IN aa(ii)=TRUE & x=1..ii END & a(ii)=FALSE', |
| 7942 | | '-evalt', ':z3-double-check ii=1 & aa:1..3 --> BOOL & LET ii BE ii=3 IN aa(ii)=TRUE & x=1..ii END & a(ii)=FALSE' |
| 7943 | | % :z3 ii=1 & aa:1..3 --> BOOL & SIGMA(ii).(ii|->TRUE:aa|ii) = 6 % translation failed |
| 7944 | | ], 'Check quantifier scoping for SMT solvers'). |
| 7945 | | cli_testcase(2177, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7946 | | '../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents.mch', '-init', |
| 7947 | | '-p', 'TIME_OUT', '60000', |
| 7948 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'false', |
| 7949 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 7950 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem.eval', |
| 7951 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem2.eval', |
| 7952 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2.eval', |
| 7953 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug.eval', |
| 7954 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug2.eval', |
| 7955 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug3.eval', |
| 7956 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd.eval', |
| 7957 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd2.eval', |
| 7958 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd_contradiction.eval', |
| 7959 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem.eval', |
| 7960 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem2.eval', |
| 7961 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2.eval', |
| 7962 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug.eval', |
| 7963 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug2.eval', |
| 7964 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug3.eval', |
| 7965 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd.eval', |
| 7966 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd2.eval', |
| 7967 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd_contradiction.eval' |
| 7968 | | ], 'Test well-definedness issue for CDCL(T) solver to not report unsatisfiability for satisfiable formulas: SearchEvents'). |
| 7969 | | cli_testcase(2178, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7970 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/R6_Lights.eventb', '-init', |
| 7971 | | '-p', 'TIME_OUT', '60000', |
| 7972 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 7973 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 7974 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 7975 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 7976 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 7977 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 7978 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 7979 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 7980 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 7981 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd_contradiction.eval', |
| 7982 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd_contradiction.eval' |
| 7983 | | ], 'Test well-definedness issue for CDCL(T) solver to not report unsatisfiability for satisfiable formulas: LandingGearLights'). |
| 7984 | | cli_testcase(2179, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 7985 | | '../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents.mch', '-init', |
| 7986 | | '-p', 'TIME_OUT', '60000', |
| 7987 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 7988 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 7989 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'false', |
| 7990 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem.eval', |
| 7991 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem2.eval', |
| 7992 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2.eval', |
| 7993 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug.eval', |
| 7994 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug2.eval', |
| 7995 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug3.eval', |
| 7996 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd.eval', |
| 7997 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd2.eval', |
| 7998 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd_contradiction.eval', |
| 7999 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem.eval', |
| 8000 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem2.eval', |
| 8001 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2.eval', |
| 8002 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug.eval', |
| 8003 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug2.eval', |
| 8004 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug3.eval', |
| 8005 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd.eval', |
| 8006 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd2.eval', |
| 8007 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd_contradiction.eval' |
| 8008 | | ], 'Test well-definedness issue for CDCL(T) solver to not report unsatisfiability for satisfiable formulas without static analysis: SearchEvents'). |
| 8009 | | cli_testcase(2180, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8010 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/R6_Lights.eventb', '-init', |
| 8011 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 8012 | | '-p', 'TIME_OUT', '60000', |
| 8013 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 8014 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 8015 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 8016 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 8017 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 8018 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 8019 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 8020 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 8021 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd_contradiction.eval', |
| 8022 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd_contradiction.eval' |
| 8023 | | ], 'Test well-definedness issue for CDCL(T) solver to not report unsatisfiability for satisfiable formulas without static analysis: LandingGearLights'). |
| 8024 | | cli_testcase(2181, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8025 | | '-evalt', '#file .(file:1..2)', |
| 8026 | | '-evalt', '#file . (file:1..2)'], 'Check #file can be used for existential quantifier'). |
| 8027 | | cli_testcase(2182, [b_test,external,hash], ['stdlib/AssertionsForLibraryHash.mch', '-assertions', '-strict'], 'Assertions for LibraryHash'). |
| 8028 | | cli_testcase(2183, [b_test,forall], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8029 | | '-evalf', '!(x,y).(x|->y : { (y,x),(1,2)} => x<y)', |
| 8030 | | '-evalf', '!(x,y).(x|->y : { (y,x),(1,2)} => x>y)', |
| 8031 | | '-evalf', '!(x,y).(x>0 & x|->y : { (y,10/x),(1,2)} => y/=2)', |
| 8032 | | '-evalt', '!(x,y).(x|->y : { (y,x),(1,2)} & x>0 & y>0 => x+y>0)' |
| 8033 | | ], 'Test forall with sets reusing parameters'). |
| 8034 | | cli_testcase(2184, [cbc,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/QueensWithEvents_ForallTest1.mch', |
| 8035 | | '-mc', 60, '-cc', 43, 82, '-strict'], 'Check forall instead of perm in N-Queens'). |
| 8036 | | cli_testcase(2185, [cbc,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/QueensWithEvents_ForallTest2.mch', |
| 8037 | | '-mc', 60, '-cc', 7, 10, '-strict'], 'Check forall instead of perm in N-Queens'). |
| 8038 | | cli_testcase(2186, [cbc,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/QueensWithEvents_ForallTest3.mch', |
| 8039 | | '-mc', 60, '-cc', 7, 10, '-strict'], 'Check forall instead of perm in N-Queens'). |
| 8040 | | cli_testcase(2187, [cbc,forall], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/QueensWithEvents_ForallTest2b.mch', |
| 8041 | | '-mc', 60, '-cc', 7, 10, '-strict'], 'Check forall instead of perm in N-Queens'). |
| 8042 | | cli_testcase(2188, [b_test,forall], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8043 | | '-evalt', 'a:1..n --> BOOL & !i.(i|->TRUE:a => i mod 2=0) & n=40 & !i.(i|->FALSE:a => i mod 2=1)', |
| 8044 | | '-evalf', 'a:1..n --> BOOL & n=200 & !i.(i|->FALSE:a => i mod 2=1) & a(n)=FALSE', |
| 8045 | | '-evalf', 'a:1..n --> BOOL & n=200 & !i.(i|->FALSE:a => i mod 2=1) & a(2)=FALSE' |
| 8046 | | ], 'Test forall for set membership with a pattern is not delaying'). |
| 8047 | | cli_testcase(2189, [cbc,card,forall], ['../prob_examples/public_examples/B/Puzzles/Queens/NBishopsSets_v2.mch', |
| 8048 | | '-p', 'TIME_OUT', 5000, % set it higher for Windows bot |
| 8049 | | '-init'], 'See that ProB can solve this puzzle; variation of test 1631'). |
| 8050 | | cli_testcase(2190, [cbc_refinement,refinement], [ |
| 8051 | | '../prob_examples/public_examples/CSP/simple/RefinementChecks.csp', |
| 8052 | | '--MAIN', 'A', '-mc', '100', |
| 8053 | | '-save', '../prob_examples/public_examples/CSP/simple/RefinementChecks_A_spec.P' |
| 8054 | | ], 'Save CSP state space for later refinement check'). |
| 8055 | | cli_testcase(2191, [cbc_refinement,refinement], [ |
| 8056 | | '../prob_examples/public_examples/CSP/simple/RefinementChecks.csp', |
| 8057 | | '--MAIN', 'C', |
| 8058 | | '-refchk', '../prob_examples/public_examples/CSP/simple/RefinementChecks_A_spec_saved.P' |
| 8059 | | ], 'CSP refinement check against saved state space'). |
| 8060 | | cli_testcase(2192, [cbc_refinement,refinement], [ |
| 8061 | | '../prob_examples/public_examples/CSP/simple/RefinementChecks.csp', |
| 8062 | | '--MAIN', 'D', |
| 8063 | | '-refchk', '../prob_examples/public_examples/CSP/simple/RefinementChecks_A_spec_saved.P' |
| 8064 | | ], 'CSP refinement check against saved state space'). |
| 8065 | | cli_testcase(2193, [cbc_refinement,refinement], [ |
| 8066 | | '../prob_examples/public_examples/CSP/simple/RefinementChecks.csp', |
| 8067 | | '--MAIN', 'E', |
| 8068 | | '-refchk', '../prob_examples/public_examples/CSP/simple/RefinementChecks_A_spec_saved.P' |
| 8069 | | ], 'CSP refinement check against saved state space'). |
| 8070 | | cli_testcase(2194,[private_source_not_available],[ |
| 8071 | | '../private_examples/Thales/Hansen_FMTools_Issue2/WD_Issue.prob', |
| 8072 | | '-df', '-mc', 200, '-expcterr', goal_found, |
| 8073 | | '-p', 'TRY_FIND_ABORT', 'FALSE'], 'Ensure no wd error found'). |
| 8074 | | cli_testcase(2195, [tickets, union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8075 | | '-evalt', '%i.(i:dom(g)|UNION(x,y).(x=g(i) & x:dom(f) & y = f(x) & y /= {} |y))=res & f = {2|->{22}} & g=[1,2]', |
| 8076 | | '-evalt', '%i.(i:dom(g)|UNION(x,y).(x=g(i) & x:dom(f) & y = f(x) & y /= {} |y))=res & f = {2|->{22}} & g=[1,2] & res = {(1|->{}),(2|->{22})}', |
| 8077 | | '-p', 'TRY_FIND_ABORT', 'TRUE'], 'Ensure no wd error found due to quant_union_inter_let/find_one_point rules bug'). |
| 8078 | | cli_testcase(2196, [error_checks], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8079 | | '-eval', 'x = {(1|->2)|->3, 44|->(55|->66)}', |
| 8080 | | '-expcterr', 'type_expression_error'], |
| 8081 | | 'Ensure type error caught'). |
| 8082 | | cli_testcase(2197, [kodkod], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 8083 | | '-evalf', ':kodkod mx=10 & x: (0-mx)..mx & y:(0-1)..mx & z:(0-1)..mx & not((x=y or x=z) => (y=x or z=x)) & ((x=y <=> x=z) => (y=z or x/=y))', |
| 8084 | | '-evalt', ':kodkod mx=10 & x: (0-mx)..mx & y:(0-1)..mx & z:(0-1)..mx & ((x=y or x=z) => (y=x or z=x)) & ((x=y <=> x=z) => (y=z or x/=y))', |
| 8085 | | '-evalt', ':kodkod card({x,y,z,mx| mx=3 & x: (0-mx)..mx & y:(0-1)..mx & z:(0-1)..mx & ((x=y or x=z) => (y=x or z=x)) & ((x=y <=> x=z) => (y=z or x/=y))})=175', |
| 8086 | | '-evalt', ':kodkod ({x,y,z,mx| mx=10 & x: (0-mx)..mx & y:(0-1)..mx & z:(0-1)..mx & not((x=y or x=z) => (y=x or z=x)) & ((x=y <=> x=z) => (y=z or x/=y))})={}', |
| 8087 | | '-evalt', ':kodkod card({x,y,z,mx| mx=3 & x: (0-mx)..mx & y:(0-1)..mx & z:(0-1)..mx & ((x:{y,z}) => (x:{z,y})) & ((x=y <=> x=z) => (y=z or x/=y))})=175', |
| 8088 | | '-evalt', ':kodkod ({x,y,z,mx| mx=10 & x: (0-mx)..mx & y:(0-1)..mx & z:(0-1)..mx & not((x:{y,z}) => (x:{z,y})) & ((x=y <=> x=z) => (y=z or x/=y))})={}', |
| 8089 | | '-evalt', 'card({x,y,z,mx| mx=3 & x: (0-mx)..mx & y:(0-1)..mx & z:(0-1)..mx & (((x:{y,y}) => (x:{z,z})) & ((x=y <=> x=z) => (y=z or x/=y)))})=155' |
| 8090 | | ], 'Ensure issue in kodkod integer cast typing solved'). |
| 8091 | | cli_testcase(2198, [b_test], ['../prob_examples/public_examples/B/Implementations/Values/DefSetsPartiallyEnum.mch', |
| 8092 | | '../prob_examples/public_examples/B/Implementations/Values/DefSetsPartiallyEnumImp.imp', |
| 8093 | | '../prob_examples/public_examples/B/Implementations/Values/DefSetsPartiallyEnum_v2.mch', |
| 8094 | | '../prob_examples/public_examples/B/Implementations/Values/ArrayValuationAImp.imp', |
| 8095 | | '../prob_examples/public_examples/B/Implementations/Values/EnumSetImp.imp', |
| 8096 | | '-t', '-assertions', '-mc', 10, '-nodead' |
| 8097 | | ], 'test VALUES clause can access constants in abstraction and check partial enumerated sets detection'). |
| 8098 | | cli_testcase(2199, [smt], ['../prob_examples/public_examples/SMT/SendMoreMoney.smt2', |
| 8099 | | '../prob_examples/public_examples/SMT/KnightsKnaves.smt2' |
| 8100 | | ], 'test Send More Money in SMTLib format'). |
| 8101 | | cli_testcase(2200, [ltl], ['../prob_examples/public_examples/B/LTL/Tests/UnchangedOperator.mch', |
| 8102 | | '../prob_examples/public_examples/B/LTL/Tests/UnchangedOperator2.mch', |
| 8103 | | '-ltlassertions', |
| 8104 | | '-p', 'LTL_SAFETY_MODEL_CHECK', 'TRUE' |
| 8105 | | ], 'test new LTL operators unchanged, changed, increasing, decreasing, BA'). |
| 8106 | | cli_testcase(2201, [ltl], ['../prob_examples/public_examples/B/LTL/Tests/UnchangedOperator.mch', |
| 8107 | | '../prob_examples/public_examples/B/LTL/Tests/UnchangedOperator2.mch', |
| 8108 | | '-ltlassertions', |
| 8109 | | '-p', 'LTL_SAFETY_MODEL_CHECK', 'FALSE' |
| 8110 | | ], 'test 2001 without LTL safety mc'). |
| 8111 | | cli_testcase(2202, [tickets], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8112 | | '-evalf', 'ff:1..1<->BOOL & not (ff : setX --> setY <=> (ff: setX +-> setY & dom(ff) = setX))', |
| 8113 | | '-evalf', 'ff:1..3<->BOOL & gg:1..2<->BOOL & not (ff : setX --> setY <=> (ff: setX +-> setY & dom(ff) = setX))', |
| 8114 | | % these below were already false before fixing the ticket; they just test other similar dangerous calls: |
| 8115 | | '-evalf', 'ff:1..2<->BOOL & setX <: 1..3 & not (ff : setX --> setY <=> (ff: setX +-> setY & SIGMA(y).(y:dom(ff)|y)= SIGMA(y).(y:setX|y)))', |
| 8116 | | '-evalf', 'SIGMA(y).(y:S|y) = 2 & S<:0..1', |
| 8117 | | '-evalf', 'SIGMA(y).(y:S|y) = 2 & S<:0..1 & S={s1,s2}', |
| 8118 | | '-evalt', 'SIGMA(y).(y:S|y) = 1 & S<:0..1 & S={s1,s2}', |
| 8119 | | '-evalf', 'SIGMA(y).(y:S|y) = 4 & (S<:1..2 <=> f:1..2 --> BOOL) & f:1..2 +->BOOL & card(f)=2' |
| 8120 | | ], 'check that subset-reification issue generating lists with duplicates is solved on SWI'). |
| 8121 | | cli_testcase(2203, [tickets,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8122 | | '-evalt', 'UNION(x,y).(x:INTEGER & y=x+1|{x|->y}) = f & f(2)=3', |
| 8123 | | '-evalt', 'UNION(a,b).(a:1..2 & b:BOOL|{b|->a}) = UNION(b,a).(a:1..2 & b:BOOL|{b|->a})', |
| 8124 | | '-evalt', 'UNION(a,b).(a:1..2 & b:BOOL|{b|->a}) = UNION(b,a,c).(a:1..2 & b:BOOL & c=a+1|{b|->a})', |
| 8125 | | '-evalt', 'UNION(a,b,c).(a:BOOL & b:1..6 & c:10..20 & b+b=c|{b|->a}) = {(5|->FALSE),(5|->TRUE),(6|->FALSE),(6|->TRUE)}' |
| 8126 | | , |
| 8127 | | '-evalt', 'UNION(c,b,a).(a:BOOL & b:1..6 & c:10..20 & b+b=c|{b|->a}) = {(5|->FALSE),(5|->TRUE),(6|->FALSE),(6|->TRUE)}', |
| 8128 | | '-evalt', 'UNION(c,a,b).(a:BOOL & b:1..6 & c:10..20 & b+b=c|{b|->a}) = {(5|->FALSE),(5|->TRUE),(6|->FALSE),(6|->TRUE)}' |
| 8129 | | ], 'check UNION into comprehension set translation'). |
| 8130 | | cli_testcase(2204,[wd,wd_prover],[ |
| 8131 | | '-evalt', ':prove (x>1 & x<20) => not(x mod 20 = 0)', |
| 8132 | | '-evalt', ':prove (x>=1 & x<20) => not(x mod 20 = 0)', |
| 8133 | | '-evalt', ':prove (x>1 & x<y) => not(x mod y = 0)', |
| 8134 | | '-evalt', ':prove (x>=1 & x<20) => (x mod 20) >= 1', |
| 8135 | | '-evalu', ':prove (x>1 & x<=20) => not(x mod 20 = 0)', |
| 8136 | | '-evalu', ':prove (x>=1 & x<=20) => (x mod 20) >= 1', |
| 8137 | | '-evalu', ':prove x>1 => not(x mod 20 = 0)', |
| 8138 | | '-evalu', ':prove not(x mod 2 = 0) or not(x > 1)', |
| 8139 | | |
| 8140 | | |
| 8141 | | '-evalt', ':prove x mod 2 /= 2', |
| 8142 | | '-evalt', ':prove x mod 2 : 0..1', |
| 8143 | | '-evalt', ':prove x mod 2 < 2', |
| 8144 | | '-evalt', ':prove 2 mod x <= 2', |
| 8145 | | '-evalt', ':prove x mod 2 : NATURAL', |
| 8146 | | '-evalt', ':prove x mod 2 : {0,1}', |
| 8147 | | '-evalt', ':prove x mod 2 : {0,1,3}', |
| 8148 | | '-evalt', ':prove x:0..3 => x mod 4 : {0,1,2,3}', |
| 8149 | | '-evalt', ':prove x:0..3 => x mod 4 : {0,1,2,3,5}', |
| 8150 | | '-evalt', ':prove x:0..3 => x mod 6 : {0,1,2,3,4}', |
| 8151 | | '-evalt', ':prove x:0..3 => x mod 5 : {0,1,2,3,5}', |
| 8152 | | '-evalt', ':prove x:{1,2,3,4,5} => x mod 10 : {0,1,2,3,4,5,9}', |
| 8153 | | '-evalt', ':prove x:{1,3,5} => x mod 10 : {0,1,2,3,4,5,9}', |
| 8154 | | '-evalu', ':prove x mod 2 /= 1', |
| 8155 | | '-evalu', ':prove x mod 2 /= 0', |
| 8156 | | '-evalu', ':prove 2 mod x <= 1', |
| 8157 | | '-evalu', ':prove 2 mod x > 0', |
| 8158 | | '-evalu', ':prove x mod 2 : NATURAL1', |
| 8159 | | '-evalu', ':prove x:0..3 => x mod 5 : {0,1,3,5}', |
| 8160 | | '-evalu', ':prove x:{1,3,5,6} => x mod 10 : {0,1,2,3,4,5,9}', |
| 8161 | | '-evalu', ':prove x mod 3 < 2' |
| 8162 | | ], 'check bug in modulo proof rule fixed'). |
| 8163 | | cli_testcase(2205, [infinite, external, regex, let], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8164 | | '-evalt', 'f = %s.(s:STRING & REGEX_MATCH(s,"[a-z]+")=TRUE | s)', |
| 8165 | | '-evalt', 'f = %s.(s:STRING & REGEX_MATCH(s,"[a-z]+")=TRUE | s) & f("abz") = "abz"', |
| 8166 | | '-evalt', 'f = %s.(s:STRING & REGEX_MATCH(s,"[a-z]+")=TRUE | s) & "ab0" /: dom(f)', |
| 8167 | | '-evalt', 'f = %s.(s:STRING & GET_STRING_IS_DECIMAL(s) = TRUE| s) & f("10.0") = "10.0" & "a" /: dom(f)', |
| 8168 | | '-evalt', 'f = LET pat BE pat = "[a-z]+" IN %s.(s:STRING & REGEX_MATCH(s,pat)=TRUE | (pat,s)) END & f("abz")=r', |
| 8169 | | '-evalt', 'f = LET pat BE pat = "[a-z]+" IN %s.(s:STRING & REGEX_MATCH(s,pat)=TRUE | REGEX_REPLACE(s,pat,"xx")) END & f("abz")="xx"', |
| 8170 | | '-evalt', 'f = LET pat BE pat = "([a-z]+)([A-Z]*)" IN %s.(s:STRING & REGEX_MATCH(s,pat)=TRUE | REGEX_REPLACE(s,pat,"$1")) END & f("abzAZ")=abz', % also checks $1 feature |
| 8171 | | '-evalt', 'f = LET pat BE pat = "([a-z]+)([A-Z]*)" IN %s.(s:STRING & REGEX_MATCH(s,pat)=TRUE | REGEX_REPLACE(s,pat,"$1.$2")) END & f("abzAZ")=abz.AZ', % also checks $1 feature |
| 8172 | | '-evalt', 'f = %x.(x /= "" | x^x) & f("a") = "aa"', |
| 8173 | | '-evalt', 'f = %x.("" /= x | x^x) & f("a") = "aa"', |
| 8174 | | '-evalt', 'f = %x.(x /= 0 | 100/x) & f(2) = 50', |
| 8175 | | '-evalt', 'f = %(x,y).(x /= 0 | y/x) & f(2,100) = 50', |
| 8176 | | '-evalt', 'f = %(x,y).(x /= y | y/(y-x)) & f(5,10) = 2', |
| 8177 | | '-evalt', 'f = %x.(x < y*y | x+x) & f(2)=res & y:3..5', |
| 8178 | | '-evalt', 'f = %x.(x > y*y | x+x) & f(200)=res & y:3..5', |
| 8179 | | '-evalt', 'f = %x.(x <= y*y | x+x) & f(2)=res & y:3..5', |
| 8180 | | '-evalt', 'f = %x.(x >= y*y | x+x) & f(200)=res & y:3..5', |
| 8181 | | '-evalt', 'f = %x.( y*y <= x | x+x) & f(200)=res & y:3..5' |
| 8182 | | ], 'check detection of function as symbolic involving certain external predicates'). |
| 8183 | | cli_testcase(2206, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8184 | | '../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents.mch', '-init', |
| 8185 | | '-p', 'TIME_OUT', '60000', |
| 8186 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 8187 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 8188 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'false', |
| 8189 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem.eval', |
| 8190 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem2.eval', |
| 8191 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2.eval', |
| 8192 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug.eval', |
| 8193 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug2.eval', |
| 8194 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug3.eval', |
| 8195 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd.eval', |
| 8196 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd2.eval', |
| 8197 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd_contradiction.eval', |
| 8198 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem.eval', |
| 8199 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/min_example_wd_problem2.eval', |
| 8200 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2.eval', |
| 8201 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug.eval', |
| 8202 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug2.eval', |
| 8203 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v2_static_analysis_bug3.eval', |
| 8204 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd.eval', |
| 8205 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd2.eval', |
| 8206 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SearchEvents/SearchEvents_monolithic_bmc_k_3_core_v3_wd_contradiction.eval' |
| 8207 | | ], 'Test well-definedness issue for CDCL(T) solver to not report unsatisfiability for satisfiable formulas without static analysis and symmetry breaking: SearchEvents'). |
| 8208 | | cli_testcase(2207, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8209 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/R6_Lights.eventb', '-init', |
| 8210 | | '-p', 'TIME_OUT', '60000', |
| 8211 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 8212 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 8213 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 8214 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 8215 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 8216 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 8217 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 8218 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 8219 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 8220 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 8221 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd_contradiction.eval' |
| 8222 | | ], 'Test well-definedness issue for CDCL(T) solver to not report unsatisfiability for satisfiable formulas: LandingGearLights (static analysis but no symmetry breaking)'). |
| 8223 | | cli_testcase(2208, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8224 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/R6_Lights.eventb', '-init', |
| 8225 | | '-p', 'TIME_OUT', '60000', |
| 8226 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 8227 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 8228 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 8229 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 8230 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_1_core.eval', |
| 8231 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd.eval', |
| 8232 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 8233 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd2.eval', |
| 8234 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 8235 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd3.eval', |
| 8236 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearLights/Ref6_CockpitLights_monolithic_bmc_k_6_wd_contradiction.eval' |
| 8237 | | ], 'Test well-definedness issue for CDCL(T) solver to not report unsatisfiability for satisfiable formulas: LandingGearLights (no static analysis or symmetry breaking)'). |
| 8238 | | cli_testcase(2209,[private_source_not_available],[ |
| 8239 | | '../private_examples/ClearSy/2022/28_Apr/rule_RVF219/rule_RVF219_compo.mch', |
| 8240 | | '-execute_all', '-silent', |
| 8241 | | '-evalt', 'caval__rule__1__done=TRUE & caval__rule__2__done=TRUE & caval__rule__3__done=TRUE & caval__rule__4__done=TRUE & caval__rule__8__done=TRUE', |
| 8242 | | '-evalt', 'card(caval__rule__2__ALL)=25504' |
| 8243 | | ], 'Test performance issue with term_variables in exists'). |
| 8244 | | cli_testcase(2210,[cbc,quantified,exists],[ |
| 8245 | | '-evalt', '{x|x:1..10 & #y.(y>x & y*y >10)}=res', |
| 8246 | | '-evalt', 'card({x|x:1..10 & #y.(y>x & y*y >10)})=10' |
| 8247 | | ], 'Check enumeration warning in existential quantifier not propagated out'). |
| 8248 | | cli_testcase(2211,[wd,wd_prover],[ |
| 8249 | | '-evalt', ':prove shock_absorber:INTEGER => not(shock_absorber : {ground,flight} \\ {shock_absorber})', |
| 8250 | | '-evalt', ':prove shock_absorber:INTEGER => (shock_absorber /: {ground,flight} \\ {shock_absorber})', |
| 8251 | | '-evalu', ':prove shock_absorber:INTEGER => not(shock_absorber /: {ground,flight} \\ {shock_absorber})', |
| 8252 | | '-evalt', ':prove x:INTEGER & x=shock_absorber => (x /: {ground,flight} \\ {shock_absorber})', |
| 8253 | | '-evalt', ':prove x:BOOL & x=shock_absorber => not(x : {ground,flight} \\ {shock_absorber})', |
| 8254 | | '-evalt', ':prove x<:BOOL & x /<: y => x/=y', |
| 8255 | | '-evalt', ':prove x<:BOOL & x /<: y => y/=x', |
| 8256 | | '-evalt', ':prove x<:BOOL & x /<: y => not(y=x)', |
| 8257 | | '-evalt', ':prove x>0 & y>0 => not(x>0 & y<=0)', |
| 8258 | | '-evalt', ':prove x>0 & y>0 => not(x<=0 & y>0)', |
| 8259 | | '-evalt', ':prove x>0 & y>0 => not(x<=0 & y<=1)', |
| 8260 | | '-evalu', ':prove x>0 & y>0 => not(x<=1 & y<=1)', |
| 8261 | | '-evalt', ':prove x>0 & y>0 => not(x<=0 or y<=0)', |
| 8262 | | '-evalu', ':prove x>0 & y>0 => not(x<=0 or y>0)', |
| 8263 | | '-evalt', ':prove x>0 => (y>0 => not(x<=0 or y<=0))', |
| 8264 | | '-evalt', ':prove x>0 => ( x=1 or x>1)', |
| 8265 | | '-evalu', ':prove x>0 => not( x=1 or x>1)', |
| 8266 | | '-evalt', ':prove x>0 => not( x/=1 & not(x>1))', |
| 8267 | | '-evalt', ':prove x>1 & y>2 => not( x>0 => not(y>2))', |
| 8268 | | '-evalt', ':prove a <:b & a /<<: {1,2} => b /<<: {1,2}', % requires to push all hyps (push_more_hyps option) |
| 8269 | | '-evalt', ':prove a ={} & b<:BOOL => b/<<:a', |
| 8270 | | '-evalt', ':prove a =BOOL & b<:BOOL => a/<<:b', |
| 8271 | | '-evalu', ':prove a ={} & b<:BOOL => a/<<:b', |
| 8272 | | '-evalu', ':prove a =BOOL & b<:BOOL => b/<<:a', |
| 8273 | | '-evalt', ':prove a ={} & b<:BOOL & a/=b => b/<:a', |
| 8274 | | '-evalt', ':prove a ={} & b<:BOOL & a/=b => not(b<:a)', |
| 8275 | | '-evalu', ':prove a ={} & b<:BOOL & a/=c => not(b<:a)', |
| 8276 | | '-evalt', ':prove a=b => (a>0 <=> b>0)', |
| 8277 | | '-evalu', ':prove a=b => (a>0 <=> b>=0)', |
| 8278 | | '-evalu', ':prove a>=b => (a>0 <=> b>0)', |
| 8279 | | '-evalt', ':prove a:INTEGER => (a>b <=> not(b>=a))', |
| 8280 | | '-evalt', ':prove a:INTEGER => not(a>b <=> not(a>b))', |
| 8281 | | '-evalu', ':prove a:INTEGER => not(a>b <=> not(a>=b))', |
| 8282 | | '-evalu', ':prove a<:BOOL => not(a<:b <=> b<:a)', |
| 8283 | | '-evalu', ':prove a<:BOOL => not(not(a<:b) <=> not(b<:a))', |
| 8284 | | '-evalt', ':prove a<:BOOL => not((a<:b) <=> not(a<:b))', % requires to push all hyps |
| 8285 | | '-evalt', ':prove a<:BOOL => not(not(a<<:b) <=> (a<<:b))', % ditto, requires push_more_hyps option |
| 8286 | | '-evalt', ':prove x<:INTEGER & inter({x,y,{1}}) : FIN(inter({x,y,{1}}))', |
| 8287 | | '-evalt', ':prove x<:POW(INTEGER) & inter({{1}}\\/x) : FIN(inter({{1}}\\/x))', |
| 8288 | | '-evalu', ':prove x<:POW(INTEGER) & inter({NATURAL}\\/x) : FIN(inter({NATURAL}\\/x))' |
| 8289 | | ], 'check wd prover can deal with negations in goal'). |
| 8290 | | cli_testcase(2212, [b_test,json_trace_replay], [ |
| 8291 | | '../prob_examples/public_examples/B/Tester/Includes/InclQueue.mch', |
| 8292 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tester/Includes/InclQueue.prob2trace' |
| 8293 | | ], 'Check inclusion of machine with parameters'). |
| 8294 | | cli_testcase(2213, [cbc,disprover,private], [ |
| 8295 | | '../prob_examples/public_examples/ProofObligations/Tickets/TestPartialFunctionBuggyProofRule_ctx.pl', |
| 8296 | | '-check_disprover_result', 0,1,0, |
| 8297 | | '-p', 'DOUBLE_EVALUATION', 'TRUE', |
| 8298 | | '-export_po' % exercise the export_po_as_machine (nested_print_sequent_as_classicalb) |
| 8299 | | % this is also done in ProB for Rodin |
| 8300 | | ],'Test this PO involving partial function cannot be proven'). |
| 8301 | | cli_testcase(2214, [ltl], ['../prob_examples/public_examples/EventBPrologPackages/OperatingSystem/12301853/m03_proB_mch.eventb', |
| 8302 | | '--model-check', '-expcterr', 'model_check_incomplete' , '-cc', 465, 1662, |
| 8303 | | '-p', 'CLPFD', 'FALSE', '-p', 'MAX_OPERATIONS', 20, |
| 8304 | | '-ltlfile', |
| 8305 | | '../prob_examples/public_examples/EventBPrologPackages/OperatingSystem/12301853/LTL_m03.ltl'], |
| 8306 | | 'Check Rodin LTL file format now supported'). |
| 8307 | | cli_testcase(2215, [ltl], ['../prob_examples/public_examples/EventBPrologPackages/OperatingSystem/12301853/m06_proB_mch.eventb', |
| 8308 | | '--model-check', '-expcterr', 'model_check_incomplete' , '-cc', 309, 964, |
| 8309 | | '-p', 'CLPFD', 'FALSE', '-p', 'MAX_OPERATIONS', 30, |
| 8310 | | '-ltlfile', |
| 8311 | | '../prob_examples/public_examples/EventBPrologPackages/OperatingSystem/12301853/LTL_m06.ltl'], |
| 8312 | | 'Check Rodin LTL file format now supported'). |
| 8313 | | cli_testcase(2216, [ltl], ['../prob_examples/public_examples/EventBPrologPackages/OperatingSystem/12301853/m11_proB_mch.eventb', |
| 8314 | | '--model-check', '-cc', 105, 252, |
| 8315 | | '-p', 'CLPFD', 'FALSE', '-p', 'MAX_OPERATIONS', 30, '-p', 'MAX_INITIALISATIONS', 100, |
| 8316 | | '-ltlfile', |
| 8317 | | '../prob_examples/public_examples/EventBPrologPackages/OperatingSystem/12301853/LTL_m11.ltl'], |
| 8318 | | 'Check Rodin LTL file format now supported'). |
| 8319 | | cli_testcase(2217, [eventb_test,operation_reuse], |
| 8320 | | ['../prob_examples/examples/RodinModels/Pacemaker/M4_VVIR_prob_mch.eventb', |
| 8321 | | '-mc', 100000, '-cc', 25814, 42617 , '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'COMPRESSION', 'TRUE', |
| 8322 | | '-expcterr', 'model_check_incomplete' |
| 8323 | | ], 'Check Pacemaker model with operation reuse.'). |
| 8324 | | cli_testcase(2218, [eventb_test,operation_reuse], |
| 8325 | | ['../prob_examples/examples/RodinModels/Pacemaker/M4_VVIR_prob_mch.eventb', |
| 8326 | | '-cbc', all, |
| 8327 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 100 |
| 8328 | | ], 'Check that all proof info available for Pacemaker model (with conjuncts as invariants).'). |
| 8329 | | cli_testcase(2219, [tickets], ['../prob_examples/public_examples/B/ErrorMachines/ParseErrors/SemicolonError.mch', |
| 8330 | | '-expcterrpos', parse_error, 6, 17, |
| 8331 | | '-expcterrpos', parse_error, 8, 18, '-expcterr', 'load_main_file' |
| 8332 | | ], 'Check semicolons detected'). % https://github.com/hhu-stups/prob-issues/issues/141 |
| 8333 | | cli_testcase(2220, [b_test,json_trace_replay,visb], [ |
| 8334 | | '../prob_examples/public_examples/B/VisB/TrafficLight/TrafficLight.mch', '-init', |
| 8335 | | '-visb-click', 'peds_green', |
| 8336 | | '-visb-click', 'peds_red', |
| 8337 | | '-visb-click', 'cars_yellow_1', |
| 8338 | | '-visb-click', 'cars_green', |
| 8339 | | '-visb-click', 'cars_yellow_2', |
| 8340 | | '-visb-click', 'cars_red', |
| 8341 | | '-visb-click', 'peds_green', |
| 8342 | | '-visb', '../prob_examples/public_examples/B/VisB/TrafficLight/traffic_light.json', |
| 8343 | | '../prob_examples/public_examples/B/VisB/TrafficLight/TrafficLight_Trace.html', |
| 8344 | | '-his', '../prob_examples/public_examples/B/VisB/TrafficLight/TrafficLight_Trace.txt' |
| 8345 | | %'-his_option','json' % cannot be tested for equality at moment because of metadata |
| 8346 | | ], |
| 8347 | | 'Check VisB click response'). |
| 8348 | | cli_testcase(2221, [b_test,infinite,memoize], [ |
| 8349 | | '../prob_examples/public_examples/B/RecursiveFunctions/Fibonacci_Memoized.mch', '-assertions', '-init', |
| 8350 | | '-csv', 'prob_memo_profile', 'user_output', |
| 8351 | | '-csv', 'constants_analysis', 'user_output', |
| 8352 | | '-assertions'], |
| 8353 | | 'test new prob_memo_profile csv command'). |
| 8354 | | cli_testcase(2222, [xtl,ctl], ['../prob_examples/public_examples/XTL/microwave.P', |
| 8355 | | '-ctlformulat', 'AG ({closed} or {open})', |
| 8356 | | '-ctlformulat', 'EF ( EG ({closed}))', |
| 8357 | | '-ctlformulaf', 'EG ({closed})', |
| 8358 | | '-ctlformulat', 'EF ({heat})', |
| 8359 | | '-ctlformulaf', 'EF ( AG ({closed}))', |
| 8360 | | '-ctlformulaf', 'AF ({heat})', |
| 8361 | | '-ctlformulat', 'AX ({closed})', |
| 8362 | | '-ctlformulat', 'AX AX({heat} or {open})' |
| 8363 | | ], 'Testing CTL for XTL model'). |
| 8364 | | cli_testcase(2223,[cbc,external],[ |
| 8365 | | '-evalt', '{v|%(r,s).(r:INTEGER|r+s)(0|->%(x,y).(x:INTEGER|x*y)(v|->v))=10000} = {-100,100}', |
| 8366 | | '-evalt', '{v|%(r,s).(r:INTEGER|r*s)(v|->%(x,y).(x:INTEGER|x*y)(v|->v))=1000} = {10}', |
| 8367 | | '-evalt', '{v|%(r,s).(r:INTEGER|r*s)(v|->%(x,v).(x:INTEGER|x*v)(v|->v))=1000} = {10}', |
| 8368 | | '-evalf', '%(r,s).(r:INTEGER|r+s)(0|->%(x,y).(x:INTEGER|x*y)(v|->v))=1000', |
| 8369 | | '-evalf', '%(r,s).(r:INTEGER|r*s)(v|->%(x,y).(x:INTEGER|x*y)(v|->v))=10000', |
| 8370 | | '-evalf', '%(r,s).(r:INTEGER|r*s)(v|->%(x,v).(x:INTEGER|x*v)(v|->v))=10000', |
| 8371 | | '-evalt', '(%(x,y).(x:INTEGER|%v.(v:INTEGER|v+x*y))(v|->v))(0)=10000', |
| 8372 | | '-evalf', '(%(x,y).(x:INTEGER|%v.(v:INTEGER|v+x*y))(v|->v))(0)=1000', |
| 8373 | | '-evalt', '{v|(%(x,y).(x:INTEGER|%v.(v:INTEGER|v+x*y))(v|->v))(0)=10000}={-100,100}', |
| 8374 | | '-evalt', 's=STRINGIFY(%(r,s).(r:INTEGER|r*s)(v|->%(x,y).(x:INTEGER|x*y)(v|->v))) & s = "v * (v * v)"' |
| 8375 | | ], 'Check lambda function call inlining'). |
| 8376 | | cli_testcase(2224, [error_checks,wd], [ |
| 8377 | | '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/DefCallStackDisplay.mch', |
| 8378 | | '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/DefCallStackDisplay2.mch', |
| 8379 | | '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/DefCallStackDisplay3.mch', |
| 8380 | | '-model_check', |
| 8381 | | '-expcterr', well_definedness_error |
| 8382 | | ], |
| 8383 | | 'exercise printing of call stack'). |
| 8384 | | |
| 8385 | | cli_testcase(2225,[b_test,operation_calls_in_expr],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8386 | | '../prob_examples/public_examples/B/Tickets/OpCallsInExpr/OpCallInExpression.mch', |
| 8387 | | '../prob_examples/public_examples/B/Tickets/OpCallsInExpr/OpCallInExpression_v4.mch', |
| 8388 | | '../prob_examples/public_examples/B/Tickets/OpCallsInExpr/OpCallInExpression2.mch', |
| 8389 | | '-mc', '1000', |
| 8390 | | '-assertions' |
| 8391 | | ], 'Test calling operations in expressions mixed with allowing local calls'). |
| 8392 | | cli_testcase(2226,[b_test,operation_calls_in_expr],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8393 | | '../prob_examples/public_examples/B/Tickets/OpCallsInExpr/OpCallInExpression_v2.mch', |
| 8394 | | '-init', |
| 8395 | | '-expcterrpos', type_error, 13, 31, '-expcterr', load_main_file |
| 8396 | | ], 'Detect erroneous operation call'). |
| 8397 | | cli_testcase(2227,[b_test,operation_calls_in_expr],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8398 | | '../prob_examples/public_examples/B/Tickets/OpCallsInExpr/OpCallInExpression_v3.mch', |
| 8399 | | '-init', |
| 8400 | | '-expcterrpos', type_error, 14, 11, '-expcterr', load_main_file |
| 8401 | | ], 'Detect erroneous operation call'). |
| 8402 | | cli_testcase(2228, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/RelLaws.mch', '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete', |
| 8403 | | '-p', 'OPTIMIZE_AST', 'FALSE'], 'Test 297 without OPTIMIZE_AST.'). |
| 8404 | | cli_testcase(2229, [eventb_test, theories], ['-mc', 100, '-cc', 9, 16, '-strict', '../prob_examples/public_examples/EventBPrologPackages/Theory/Mammar_Somme/sum_set.eventb'], 'Check support for SUM axiomatic operator on sets of integers'). |
| 8405 | | cli_testcase(2230, [eventb_test, theories, json_trace_replay], |
| 8406 | | ['-mc', 100, '-expcterr', 'model_check_incomplete', '-assertions', |
| 8407 | | '-trace_replay', 'json', '../prob_examples/public_examples/EventBPrologPackages/Theory/TestTheoryFloats1_mch.prob2trace', |
| 8408 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/TestTheoryFloats1_mch.eventb'], |
| 8409 | | 'Check support for real operators'). |
| 8410 | | cli_testcase(2231, [eventb_test, theories, json_trace_replay,strings], |
| 8411 | | ['-mc', 3, '-assertions', '-nodead', |
| 8412 | | '-p', 'AUTO_DETECT_THEORY_MAPPING', 'TRUE', |
| 8413 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/StandardLibrary/RealTheoryTests1_ctx.eventb', |
| 8414 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/TestStringTheory1_ctx.eventb', |
| 8415 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/TestRealsOpTheory_ctx.eventb'], |
| 8416 | | 'Check support for strings, unicode REAL and new preference'). |
| 8417 | | cli_testcase(2232, [eventb_test, theories, clpfd_tables], |
| 8418 | | ['-mc', 100, '-opterr', 'model_check_incomplete', '-assertions', '-nodead', |
| 8419 | | '-opterr', 'virtual_time_out', |
| 8420 | | '-p', 'AUTO_DETECT_THEORY_MAPPING', 'TRUE', |
| 8421 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/StandardLibrary/Sampler_mch.eventb', |
| 8422 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/StandardLibrary/Sampler2_mch.eventb', |
| 8423 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/StandardLibrary/JobQueue_mch.eventb', |
| 8424 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/StandardLibrary/ConnectedNetwork_mch.eventb'], |
| 8425 | | % Sampler2 creates a simulation_error when using SICStus 4.7 standard table/2 constraint |
| 8426 | | 'Check support for standard library without .ptm theory mapping file and fix issue with SICS table/2'). |
| 8427 | | cli_testcase(2233, [cbc,sigma], [ |
| 8428 | | '-evalt', ' data = {TRUE|->0, FALSE|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8429 | | '-evalt', ' data = {1|->0, 2|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8430 | | '-evalt', ' data = {1|->-1, 2|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-2', |
| 8431 | | '-evalt', ' data = {1|->1, 2|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=0', |
| 8432 | | '-evalt', ' data = {1|->-1, 2|->-1} & res = PI(x,y).(x|->y:data|y) & res=1', |
| 8433 | | '-evalt', ' data = {1|->0, 2|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res<0', |
| 8434 | | '-evalt', ' data = {1|->0, 2|->-1} & res = PI(x,y).(x|->y:data|y) & res=0', |
| 8435 | | '-evalt', ' data = {1|->2, 2|->-1} & res = PI(x,y).(x|->y:data|y) & res=-2', |
| 8436 | | '-evalt', ' data = {1|->0, 3|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8437 | | '-evalt', ' data = {1|->0, 2|->0, 3|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8438 | | '-evalt', ' data = {1|->0, 2|->0, 3|->-1, 4|->0} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8439 | | '-evalt', ' data = {1|->0, 2|->0, 3|->-1, 4|->0, -1|->0} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8440 | | '-evalt', ' data = {1|->0, 2|->0, 3|->-1, 4|->0, -1|->2} & res = SIGMA(x,y).(x|->y:data|y) & res=1', |
| 8441 | | '-evalt', ' data = {1|->0, 2|->0, 3|->-1, 5|->0, -11|->2} & res = SIGMA(x,y).(x|->y:data|y) & res=1', |
| 8442 | | '-evalt', ' data = {"a"|->0, "b"|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8443 | | '-evalt', ' data = {(1,1)|->0, (1,2)|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8444 | | '-evalt', ' data = {(1,1)|->0, (2,1)|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8445 | | '-evalt', ' data = {1|->0, 1|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8446 | | '-evalt', ' data = {(1,1)|->0, (1,1)|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8447 | | '-evalt', ' data = {(1,1)|->0, (1,1)|->-1, (1,2)|->0} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8448 | | '-evalt', ' data = {rec(f:1)|->0, rec(f:2)|->-1} & res = SIGMA(x,y).(x|->y:data|y) & res=-1', |
| 8449 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 8450 | | ], 'check bug in clpfd:table/2 circumvented'). |
| 8451 | | cli_testcase(2234, [tla,visb,cbc], ['../prob_examples/public_examples/TLA/TLA_Examples/EinsteinRiddle/Einstein.tla', |
| 8452 | | '-cbc', all, '-expecterr', cbc, |
| 8453 | | '-visb_with_vars', '../prob_examples/public_examples/TLA/TLA_Examples/EinsteinRiddle/Einstein_tla.json', |
| 8454 | | '../prob_examples/public_examples/TLA/TLA_Examples/EinsteinRiddle/Einstein.html' |
| 8455 | | ], 'check TLA model can be solved and visualised'). % see also test 2090 |
| 8456 | | cli_testcase(2235, [visb], ['../prob_examples/public_examples/B/Mathematical/AI/MCTS.mch', |
| 8457 | | '-animate', 100, |
| 8458 | | '-dot', 'custom_graph', '../prob_examples/public_examples/B/Mathematical/AI/MCTS_100.dot', |
| 8459 | | % we could also generate .pdf |
| 8460 | | '-visb_with_vars', '../prob_examples/public_examples/B/Mathematical/AI/MCTS_visb.json', |
| 8461 | | '../prob_examples/public_examples/B/Mathematical/AI/MCTS_100.html' |
| 8462 | | ], 'check MCTS with VisB and CustomGraph'). |
| 8463 | | cli_testcase(2236, [b_test,strings], [ |
| 8464 | | '-evalt', ' size("a//") = 3', |
| 8465 | | '-evalt', ' size("a// ") = 4', |
| 8466 | | '-evalt', ' "abc//def" = "abc/" ^ "/def"', |
| 8467 | | '-evalt', ' size("a// ") = 4 // comment', |
| 8468 | | '-evalt', ' size("a// ") = /* comment */ 4 // comment', |
| 8469 | | '-evalt', ' size("a\\\\") = 2' |
| 8470 | | ], 'check double slash in strings'). |
| 8471 | | cli_testcase(2237, [laws], ['../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 8472 | | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', |
| 8473 | | '-p', 'CLPFD', 'FALSE', |
| 8474 | | '-mc', '100000', '-cs', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Test 295 without CLPFD.'). |
| 8475 | | cli_testcase(2238,[tickets,json_trace_replay],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8476 | | '../prob_examples/public_examples/B/Tickets/Gruteser1/Ticket_clpfd_Rangierfahrt.mch', |
| 8477 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tickets/Gruteser1/Ticket_clpfd_Rangierfahrt.prob2trace' |
| 8478 | | ], 'Check opt_ground_atom accidental cut issue solved'). |
| 8479 | | cli_testcase(2239,[tickets,json_trace_replay],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8480 | | '../prob_examples/public_examples/B/Tickets/Gruteser1/Rangierfahrt0_prob.mch', |
| 8481 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tickets/Gruteser1/ProblemTrace.prob2trace' |
| 8482 | | ], 'Check opt_ground_atom accidental cut issue solved on larger example'). % step 24 is the important one |
| 8483 | | cli_testcase(2240,[tickets,operation_reuse,json_trace_replay],[ % prob-issues #238 |
| 8484 | | '../prob_examples/public_examples/B/Tickets/Vu_TraceReplayOpReuse/Poker.mch', '-p', 'OPERATION_REUSE', 'TRUE', |
| 8485 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tickets/Vu_TraceReplayOpReuse/Poker.prob2trace' |
| 8486 | | ], 'Check operation caching copies max reached infos to ensure executed by predicate is used by trace replay'). |
| 8487 | | cli_testcase(2241, [cruise,ltl,safety], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-ltlformulat', 'G ([CruiseBecomesAllowed] => X e(SetCruiseSpeed))', '-p', 'LTL_SAFETY_MODEL_CHECK', 'TRUE', |
| 8488 | | '-cc', '1361', '25696', '-p', 'MAX_INITIALISATIONS', 5], 'Ensure safety mc inspects entire state space'). |
| 8489 | | cli_testcase(2242,[b_test,json_trace_replay],[ |
| 8490 | | '../prob_examples/public_examples/B/Other/Leftpad/Leftpad_i.imp', |
| 8491 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Other/Leftpad/Leftpad_i.prob2trace' |
| 8492 | | ], 'Check VALUES clause with interval as set'). |
| 8493 | | cli_testcase(2243,[ltl,external],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8494 | | '../prob_examples/public_examples/B/LTL/Tests/NonDetOutput.mch', |
| 8495 | | '-ltlformulat', 'G {GET_IS_DET("Set")=TRUE}', |
| 8496 | | '-ltlformulaf', 'G {GET_IS_DET_OUTPUT("Choose")=TRUE}', |
| 8497 | | '-ltlformulat', 'G {NON_DET_STATE=FALSE}', |
| 8498 | | '-ltlformulaf', 'G {NON_DET_OUTPUT_STATE=FALSE}', |
| 8499 | | '-ltlformulat', 'G {not("Set" : NON_DET_OUTPUT_OPERATIONS)}', |
| 8500 | | '-ltlformulaf', 'G {not("Choose" : NON_DET_OUTPUT_OPERATIONS)}' |
| 8501 | | ], 'Check using external determinism checking functions in LTL'). |
| 8502 | | cli_testcase(2244,[wd],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8503 | | '-evalt', ':check-ast x/0 = x mod 0', |
| 8504 | | '-evalt', ':check-ast first({})=1 => last({})=2', |
| 8505 | | '-evalt', ':check-ast last({})=1 => tail([3,2])=[2]', |
| 8506 | | '-evalt', ':check-ast (min({})=1 or max({})=1) <=> {}(2)>0', |
| 8507 | | '-evalt', ':check-ast (-1)**2 = x', |
| 8508 | | '-evalt', ':check-ast 2>3 => (-1)**2 = x', |
| 8509 | | '-evalt', ':check-ast #lkyde.(union(lkyde) <: {FALSE,TRUE})' |
| 8510 | | ], 'Run a few ASTs with WD conditions through check-ast'). |
| 8511 | | cli_testcase(2245,[b_test,refinement,json_trace_replay],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8512 | | '../prob_examples/public_examples/B/FeatureChecks/InclusionChecks/SimpleRefSees/Ref1.ref', |
| 8513 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/FeatureChecks/InclusionChecks/SimpleRefSees/Ref1.prob2trace' |
| 8514 | | ], 'Check inclusion at abstract and refined level'). |
| 8515 | | cli_testcase(2246,[b_test,refinement,json_trace_replay],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8516 | | '../prob_examples/examples/B/KILOK/Aufteilung/Rangierfahrt_KI_prob.mch', |
| 8517 | | '-trace_replay', 'json', '../prob_examples/examples/B/KILOK/Aufteilung/Rangierfahrt_KI_prob.prob2trace' |
| 8518 | | ], 'Check inclusion at abstract and refined level'). |
| 8519 | | cli_testcase(2247,[b_test,refinement,json_trace_replay],[ |
| 8520 | | '../prob_examples/examples/B/KILOK/Aufteilung/Rangierfahrt_KI.mch', |
| 8521 | | '-trace_replay', 'json', '../prob_examples/examples/B/KILOK/Aufteilung/Rangierfahrt_KI.prob2trace' |
| 8522 | | ], 'Check inclusion at abstract and refined level, in particular for deferred sets'). % machine has invariant violation |
| 8523 | | cli_testcase(2248,[cbc,tickets],[ |
| 8524 | | '-evalt', 'mousePositionBlockSlot : POW(INTEGER) & not(mousePositionBlockSlot = {})', |
| 8525 | | '-evalt', 'mp : POW(INTEGER) & isClickedBlock = mp & not(mp <: blockedTime) & not(mp = {})', |
| 8526 | | '-p', 'TRACE_INFO', 'TRUE', '-p', 'SMT', 'TRUE' |
| 8527 | | ], 'Check trace value printing issue fixed'). |
| 8528 | | cli_testcase(2249, [cdclt], [%'-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8529 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/R4_Handle.eventb', '-init', |
| 8530 | | '-p', 'TIME_OUT', '60000', |
| 8531 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/test.eval', |
| 8532 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_0.eval', |
| 8533 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1.eval', |
| 8534 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2.eval', |
| 8535 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction.eval', |
| 8536 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction2.eval', |
| 8537 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction.eval', |
| 8538 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction2.eval', |
| 8539 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction3.eval', |
| 8540 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction4.eval', |
| 8541 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution.eval', |
| 8542 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution2.eval', % timeout |
| 8543 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution3.eval', |
| 8544 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution4.eval', |
| 8545 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution.eval', |
| 8546 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution2.eval', |
| 8547 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution3.eval', |
| 8548 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution5.eval', |
| 8549 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution6.eval', |
| 8550 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution7.eval', % timeout |
| 8551 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution8.eval', |
| 8552 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution9.eval', % timeout |
| 8553 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution10.eval', % timeout |
| 8554 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/test.eval', |
| 8555 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_0.eval', |
| 8556 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1.eval', |
| 8557 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction.eval', |
| 8558 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction2.eval', |
| 8559 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction.eval', |
| 8560 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction2.eval', |
| 8561 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction3.eval', |
| 8562 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction4.eval', |
| 8563 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution.eval', |
| 8564 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution2.eval', |
| 8565 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution3.eval', |
| 8566 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution4.eval', |
| 8567 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution.eval', |
| 8568 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution2.eval', |
| 8569 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution3.eval', |
| 8570 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution4.eval', |
| 8571 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution5.eval', |
| 8572 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution6.eval', |
| 8573 | | %'-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution7.eval', % timeout |
| 8574 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution8.eval', |
| 8575 | | %'-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution9.eval', % timeout |
| 8576 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution10.eval' |
| 8577 | | ], 'Double check CDCL(T) solver for BMC constraints of Landing Gear R4 Handle'). |
| 8578 | | cli_testcase(2250, [cdclt], [ %'-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8579 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/R4_Handle.eventb', '-init', |
| 8580 | | '-p', 'TIME_OUT', '60000', |
| 8581 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 8582 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 8583 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/test.eval', |
| 8584 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_0.eval', |
| 8585 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1.eval', |
| 8586 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction.eval', |
| 8587 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction2.eval', |
| 8588 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2.eval', |
| 8589 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction.eval', |
| 8590 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction2.eval', |
| 8591 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction3.eval', |
| 8592 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction4.eval', |
| 8593 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution.eval', |
| 8594 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution2.eval', |
| 8595 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution3.eval', |
| 8596 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution4.eval', |
| 8597 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution.eval', |
| 8598 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution2.eval', |
| 8599 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution3.eval', |
| 8600 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution5.eval', |
| 8601 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution6.eval', |
| 8602 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution7.eval', % timeout |
| 8603 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution8.eval', % timeout |
| 8604 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution9.eval', % timeout |
| 8605 | | %'-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution10.eval', % timeout |
| 8606 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/test.eval', |
| 8607 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_0.eval', |
| 8608 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1.eval', |
| 8609 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction.eval', |
| 8610 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction2.eval', |
| 8611 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction.eval', |
| 8612 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction2.eval', |
| 8613 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction3.eval', |
| 8614 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction4.eval', |
| 8615 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution.eval', |
| 8616 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution2.eval', |
| 8617 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution3.eval', |
| 8618 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution4.eval', |
| 8619 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution.eval', |
| 8620 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution2.eval', |
| 8621 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution3.eval', |
| 8622 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution4.eval', |
| 8623 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution5.eval', |
| 8624 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution6.eval', |
| 8625 | | %'-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution7.eval', % timeout |
| 8626 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution8.eval', |
| 8627 | | %'-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution9.eval', % timeout |
| 8628 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution10.eval' |
| 8629 | | ], 'Double check CDCL(T) solver without static analysis and symmetry breaking for BMC constraints of Landing Gear R4 Handle'). |
| 8630 | | cli_testcase(2251, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8631 | | '../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/R4_Handle.eventb', '-init', |
| 8632 | | '-p', 'TIME_OUT', '60000', |
| 8633 | | %'-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/test.eval', % timeout |
| 8634 | | %'-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_0.eval', % unknown |
| 8635 | | %'-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1.eval', % unknown |
| 8636 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction.eval', |
| 8637 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction2.eval', |
| 8638 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction.eval', |
| 8639 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction2.eval', |
| 8640 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction3.eval', |
| 8641 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction4.eval', |
| 8642 | | '-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution.eval', |
| 8643 | | %'-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution2.eval', % unknown |
| 8644 | | '-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution3.eval', |
| 8645 | | %'-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution4.eval', % unkown |
| 8646 | | %'-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution.eval', % timeout |
| 8647 | | %'-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution2.eval', % unknown |
| 8648 | | '-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution3.eval', |
| 8649 | | %'-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/test.eval', % unknown |
| 8650 | | %'-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_0.eval', % unknown |
| 8651 | | %'-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1.eval', % occasional unknown |
| 8652 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction.eval', |
| 8653 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_contradiction2.eval', |
| 8654 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction.eval', |
| 8655 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction2.eval', |
| 8656 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction3.eval', |
| 8657 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_contradiction4.eval', |
| 8658 | | '-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution.eval', |
| 8659 | | %'-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution2.eval', % occasional unknown |
| 8660 | | '-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution3.eval' |
| 8661 | | %'-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_1_solution4.eval', % unknown |
| 8662 | | %'-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution.eval', % unknown |
| 8663 | | %'-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution2.eval', % unknown |
| 8664 | | %'-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LandingGearHandle/Ref4_ControllerHandle_monolithic_bmc_k_2_solution3.eval' % unknown since Z3 version 4.13.0 |
| 8665 | | ], 'Double check Z3 interface for BMC constraints of Landing Gear R4 Handle'). |
| 8666 | | cli_testcase(2252, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8667 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/PM_M0_AAI.eventb', '-init', |
| 8668 | | '-p', 'TIME_OUT', '60000', |
| 8669 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Change_Pace_Int.eval', |
| 8670 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF.eval', |
| 8671 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF_with_Sensor.eval', |
| 8672 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_ON.eval', |
| 8673 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Sense_ON.eval', |
| 8674 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_tic.eval', |
| 8675 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Change_Pace_Int.eval', |
| 8676 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF.eval', |
| 8677 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF_with_Sensor.eval', % timeout |
| 8678 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_ON.eval', % timeout |
| 8679 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Sense_ON.eval' |
| 8680 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_tic.eval' % timeout |
| 8681 | | ], 'Double check CDCL(T) solver for inductive invariant constraints of a pacemaker model'). |
| 8682 | | cli_testcase(2253, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8683 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/PM_M0_AAI.eventb', '-init', |
| 8684 | | '-p', 'TIME_OUT', '60000', |
| 8685 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 8686 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 8687 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Change_Pace_Int.eval', |
| 8688 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF.eval', |
| 8689 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF_with_Sensor.eval', |
| 8690 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_ON.eval', |
| 8691 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Sense_ON.eval', |
| 8692 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_tic.eval', |
| 8693 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Change_Pace_Int.eval', |
| 8694 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF.eval', |
| 8695 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF_with_Sensor.eval', % timeout |
| 8696 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_ON.eval', % timeout |
| 8697 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Sense_ON.eval' |
| 8698 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_tic.eval' % timeout |
| 8699 | | ], 'Double check CDCL(T) solver without static symmetry breaking and static analysis for inductive invariant constraints of a pacemaker model'). |
| 8700 | | cli_testcase(2254, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8701 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/PM_M0_AAI.eventb', '-init', |
| 8702 | | '-p', 'TIME_OUT', '5000', |
| 8703 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Change_Pace_Int.eval', |
| 8704 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF.eval', |
| 8705 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF_with_Sensor.eval', |
| 8706 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_ON.eval', |
| 8707 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Sense_ON.eval', |
| 8708 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_tic.eval', |
| 8709 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Change_Pace_Int.eval', |
| 8710 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF.eval', |
| 8711 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_OFF_with_Sensor.eval', |
| 8712 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Pace_ON.eval', |
| 8713 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_Sense_ON.eval', |
| 8714 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_tic.eval' |
| 8715 | | ], 'Double check integration of Z3 for inductive invariant constraints of a pacemaker model'). |
| 8716 | | cli_testcase(2255, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8717 | | '-p', 'maxNrOfInitialisations', '1', |
| 8718 | | '-p', 'TIME_OUT', '60000', |
| 8719 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/PM_M1_VOOR.eventb', '-init', |
| 8720 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 8721 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 8722 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 8723 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 8724 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 8725 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval', |
| 8726 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 8727 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 8728 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', % timeout |
| 8729 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 8730 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 8731 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval' |
| 8732 | | ], 'Double check CDCL(T) solver for inductive invariant constraints of a pacemaker model'). |
| 8733 | | cli_testcase(2256, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8734 | | '-p', 'maxNrOfInitialisations', '1', |
| 8735 | | '-p', 'TIME_OUT', '60000', |
| 8736 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 8737 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 8738 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/PM_M1_VOOR.eventb', '-init', |
| 8739 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 8740 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 8741 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 8742 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 8743 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 8744 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval', |
| 8745 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 8746 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 8747 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', % timeout |
| 8748 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 8749 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval' |
| 8750 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval' % timeout |
| 8751 | | ], 'Double check CDCL(T) solver without static symmetry breaking and static analysis for inductive invariant constraints of a pacemaker model'). |
| 8752 | | cli_testcase(2257, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8753 | | '-p', 'maxNrOfInitialisations', '1', |
| 8754 | | '-p', 'TIME_OUT', '20000', |
| 8755 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/PM_M1_VOOR.eventb', '-init', |
| 8756 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 8757 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 8758 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 8759 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 8760 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 8761 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval', |
| 8762 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 8763 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 8764 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 8765 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 8766 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 8767 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval' |
| 8768 | | ], 'Double check integration of Z3 for inductive invariant constraints of a pacemaker model'). |
| 8769 | | |
| 8770 | | cli_testcase(2258, [kodkod, tickets], [ |
| 8771 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/PM_M1_VOOR.eventb', |
| 8772 | | '-init', '-p', 'SOLVER_FOR_PROPERTIES', 'kodkod'], 'Check division bug in Kodkod interval analysis'). |
| 8773 | | |
| 8774 | | cli_testcase(2259, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'FALSE', |
| 8775 | | '../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching.mch', '-init', |
| 8776 | | '-p', 'TIME_OUT', '60000', |
| 8777 | | '-evalt', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/core_bug.eval', |
| 8778 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 8779 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 8780 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 8781 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval', |
| 8782 | | % same constraints but not considering the current state |
| 8783 | | '-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/core_bug.eval', |
| 8784 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 8785 | | '-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 8786 | | '-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 8787 | | '-evalt', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval' |
| 8788 | | ], 'Double check integration of Z3 solver for BMC constraints of LargeBranching'). |
| 8789 | | cli_testcase(2260, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8790 | | '../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase.tla', '-init', |
| 8791 | | '-p', 'TIME_OUT', '60000', |
| 8792 | | %'-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_0.eval', % unknown in Gitlab pipeline |
| 8793 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_1.eval', |
| 8794 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_2.eval', |
| 8795 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_3.eval', |
| 8796 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_23.eval', |
| 8797 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_24.eval', |
| 8798 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_25.eval', |
| 8799 | | %'-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_0.eval', % unknown in Gitlab pipeline |
| 8800 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_1.eval', |
| 8801 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_2.eval', |
| 8802 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_3.eval', |
| 8803 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_23.eval', |
| 8804 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_24.eval', |
| 8805 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/SimpleTwoPhase/SimpleTwoPhase_monolithic_bmc_k_25.eval' |
| 8806 | | ], 'Double check integration of Z3 solver for BMC constraints of SimpleTwoPhase'). |
| 8807 | | cli_testcase(2261, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8808 | | '-p', 'TIME_OUT', '60000', |
| 8809 | | '../prob_examples/public_examples/EventBPrologPackages/BinarySearch/binary_search_prob_mch.eventb', '-init', |
| 8810 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_0.eval', |
| 8811 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_1.eval', |
| 8812 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_5.eval', |
| 8813 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_10.eval', |
| 8814 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_0.eval', |
| 8815 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_1.eval', |
| 8816 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_5.eval', |
| 8817 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_10.eval' |
| 8818 | | ], 'Double check CDCL(T) solver for BMC constraints of a binary search model'). |
| 8819 | | cli_testcase(2262, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8820 | | '-p', 'TIME_OUT', '60000', |
| 8821 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 8822 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 8823 | | '../prob_examples/public_examples/EventBPrologPackages/BinarySearch/binary_search_prob_mch.eventb', '-init', |
| 8824 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_0.eval', |
| 8825 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_1.eval', |
| 8826 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_5.eval', |
| 8827 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_10.eval', % sometimes throws clpfd overflow error in unsat core computation, CDCL(T) result is fine |
| 8828 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_0.eval', |
| 8829 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_1.eval', |
| 8830 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_5.eval' |
| 8831 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_10.eval' |
| 8832 | | ], 'Double check CDCL(T) solver without static symmetry breaking and static analysis for BMC constraints of a binary search model'). |
| 8833 | | cli_testcase(2263, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8834 | | '-p', 'TIME_OUT', '60000', |
| 8835 | | '../prob_examples/public_examples/EventBPrologPackages/BinarySearch/binary_search_prob_mch.eventb', '-init', |
| 8836 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_0.eval', |
| 8837 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_1.eval', |
| 8838 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_5.eval', |
| 8839 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_10.eval', |
| 8840 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_0.eval', |
| 8841 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_1.eval', |
| 8842 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_5.eval', |
| 8843 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BinarySearch/binary_search_prob_mch_monolithic_bmc_k_10.eval' |
| 8844 | | ], 'Double check integration of Z3 for BMC constraints of a binary search model'). |
| 8845 | | cli_testcase(2264, [cbc,tickets], [ |
| 8846 | | '-evalf', 'x=SIGMA(y).(y:1..n|y) & x = PI(y).(y:1..n|y) & n:4..10', % used to be issue in norm_expr, mapping PI to SIGMA |
| 8847 | | '-evalt', 'x=SIGMA(y).(y:1..n|y) & x = PI(y).(y:1..n|y) & n:2..10' |
| 8848 | | ], 'Check issue in norm_expr fixed'). |
| 8849 | | |
| 8850 | | cli_testcase(2265, [private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8851 | | '-p', 'TIME_OUT', '1000', '-p', 'CLPFD', 'FALSE', '-pref_group', 'integer', 'int32', '-noinv', |
| 8852 | | '-execute_all', '-animate_stats', |
| 8853 | | '-evalt', 'aa41=TRUE & aa42=FALSE & aa44=TRUE & aa45=FALSE & aa48=TRUE & aa50=TRUE & card(aa49)=160', |
| 8854 | | '../prob_examples/examples/B/ClearSy/Olaf/rule_Regle_P3_NID_C/rule_olaf_bugly.mch'],'Data validation run'). |
| 8855 | | cli_testcase(2266,[private],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8856 | | '../prob_examples/examples/B/ClearSy/Caval/N_ITERa_avec_DV_sans_DV/rule_avec_DV_bugly.mch', |
| 8857 | | '-execute_all', '-animate_stats', |
| 8858 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 8859 | | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'DATA_VALIDATION', 'TRUE', |
| 8860 | | % '-p', 'LIFT_EXISTS', 'TRUE', % should also work without this |
| 8861 | | '-execute_expect_steps', 44, |
| 8862 | | '-evalt', 'card(aa100)=243 & aa101=TRUE & card(aa102)=128 & aa103=TRUE', |
| 8863 | | '-evalt', 'card(aa111)=234 & aa112=TRUE & card(aa119)=246 & aa120=TRUE', |
| 8864 | | '-evalt', 'card(aa96)=110 & aa97=TRUE & card(aa98)=110 & aa99=TRUE', |
| 8865 | | %'-silent', |
| 8866 | | '-noinv'], 'Scrambled version of test 1945'). |
| 8867 | | cli_testcase(2267, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8868 | | '-p', 'TIME_OUT', '60000', |
| 8869 | | '../prob_examples/public_examples/B/Simple/TwoPurses.mch', '-init', |
| 8870 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/TwoPurses/TwoPurses_monolithic_bmc_k_0.eval', |
| 8871 | | % '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/TwoPurses/TwoPurses_monolithic_bmc_k_1.eval', % sometimes times out |
| 8872 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/TwoPurses/TwoPurses_monolithic_bmc_k_0.eval' |
| 8873 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/TwoPurses/TwoPurses_monolithic_bmc_k_1.eval' % successful but takes some time |
| 8874 | | ], 'Double check CDCL(T) solver for BMC constraints of a simple model with nested quantified formulas and WD conditions.'). |
| 8875 | | cli_testcase(2268,[private],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8876 | | '../prob_examples/examples/B/ClearSy/Caval/rule_SSO_SLOT_MSG_ID_SET_SSO_Well_def/rule_SSO_SLOT_bugly.mch', |
| 8877 | | '-execute_all', '-animate_stats', |
| 8878 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 8879 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 8880 | | '-p', 'COMPRESSION', 'TRUE', |
| 8881 | | '-execute_expect_steps', 6, |
| 8882 | | '-evalt', 'aa33=TRUE & aa34=TRUE & aa36=TRUE & aa37=TRUE & aa39=TRUE & aa40=FALSE & aa41={} &aa42=TRUE & aa43=FALSE', |
| 8883 | | '-silent' |
| 8884 | | ], 'Scrambled version of 1950; ensure wd-problem solved'). |
| 8885 | | cli_testcase(2270,[private],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8886 | | '../prob_examples/examples/B/ClearSy/Caval/rule_Test__RGP_71237__RI_091/rule_DebugPv10_bugly.mch', |
| 8887 | | '../prob_examples/examples/B/ClearSy/Caval/rule_Test__RGP_71237__RI_091/rule_DebugPv11_bugly.mch', |
| 8888 | | '-execute', 9, '-animate_stats', '-silent', |
| 8889 | | '-evalt', 'aa650=FALSE & aa651=TRUE & aa718=TRUE & aa716=TRUE & aa717=(NATURAL1 * {[]}) & aa721=(NATURAL1 * {FALSE})', |
| 8890 | | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, |
| 8891 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 8892 | | '-p', 'COMPRESSION', 'TRUE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647], 'Scrambled version of 1952; Ensure in_domain delay solved. In addition check cartesian product detection with seq types.'). |
| 8893 | | cli_testcase(2271,[private],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8894 | | '../prob_examples/examples/B/ClearSy/Caval/2019_June/string_tail/rule_nok_bugly.mch', |
| 8895 | | '-execute', 4, '-animate_stats', '-silent', |
| 8896 | | '-expcterr', deadlock, |
| 8897 | | '-execute_expect_steps', 3, |
| 8898 | | '-evalt', 'aa747=TRUE', |
| 8899 | | '-evalt', 'aa748=FALSE & aa749={({}|->TRUE)}' |
| 8900 | | ], 'Scrambled version of test 1973, Ensure pending co-routing in reverse of sequence solved'). |
| 8901 | | cli_testcase(2272,[private],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8902 | | '../prob_examples/examples/B/ClearSy/Caval/2019_June/performance/toto_ko_bugly.mch', |
| 8903 | | '-execute', 4, '-animate_stats', '-expcterr', deadlock, |
| 8904 | | '-execute_expect_steps', 3, |
| 8905 | | '-evalt', 'aa6=TRUE', |
| 8906 | | '-evalt', 'aa7=TRUE', |
| 8907 | | '-evalt', 'aa8 = {({(1|->2|->3|->4|->2)}|->FALSE),({(1|->2|->3|->4|->3)}|->FALSE)}' ], 'Scrambled version of 1974, Ensure we do not wait for identifier in exists using used_ids_defined_by_equality optimisation'). |
| 8908 | | cli_testcase(2273,[private],[ |
| 8909 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', % Note: generated virtual timeout, no longer does after override does not try to expand symbolic closures anymore |
| 8910 | | '../prob_examples/examples/B/ClearSy/Caval/2019_Aug/call_residue/rule_erreur_bugly.mch', |
| 8911 | | '-p', 'RAISE_ABORT_IMMEDIATELY', 'FALSE', % necessary as of 3974491412f39ab8b6beea3d2a7c47e7c56315ae |
| 8912 | | '-execute_all', '-animate_stats', '-noinv', |
| 8913 | | '-execute_expect_steps', 23, |
| 8914 | | '-evalt', 'aa518=TRUE', |
| 8915 | | '-evalt', 'aa553=TRUE', |
| 8916 | | '-evalt', 'aa555=TRUE'], 'Scrambled version of test 1977; Ensure we have no call_residue internal error'). |
| 8917 | | cli_testcase(2274,[private],[ |
| 8918 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8919 | | '../prob_examples/examples/B/ClearSy/Caval/2019_Sep/rule_dummy/rule_dummy_acc_bugly.mch', |
| 8920 | | '-execute_all', '-animate_stats', '-noinv', |
| 8921 | | '-execute_expect_steps', 3, |
| 8922 | | '-evalt', 'aa32=TRUE', |
| 8923 | | '-evalt', 'card(aa33)=4299' |
| 8924 | | ], 'Scrambled version of 1980, Ensure that compilation of set_extension works properly'). |
| 8925 | | cli_testcase(2275,[private,regex],[ |
| 8926 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8927 | | '../prob_examples/examples/B/ClearSy/Caval/2019_Sep/non_ground_closure/rule_bugly.mch', |
| 8928 | | '-execute_all', '-animate_stats', '-noinv', |
| 8929 | | '-execute_expect_steps', 13, |
| 8930 | | '-evalt', 'aa155=TRUE', |
| 8931 | | '-evalt', 'aa157=TRUE', |
| 8932 | | '-evalt', 'card(aa158)=254', |
| 8933 | | '-evalt', 'aa159=TRUE', |
| 8934 | | '-evalt', 'card(aa160)=254' |
| 8935 | | ], 'Scrambled version of 1981; Ensure that no internal error due to non-ground closure'). |
| 8936 | | cli_testcase(2276,[private],[ |
| 8937 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 8938 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 8939 | | '../prob_examples/examples/B/ClearSy/Caval/2020/01_Jan/regressions2/rule_Regle_Transverse_Variable_Q_DIR/rule_bugly.mch', '-p', 'BUGLY', 'TRUE', |
| 8940 | | '-execute_all', %'-silent', |
| 8941 | | '-animate_stats', |
| 8942 | | '-execute_expect_steps', 6, |
| 8943 | | '-evalt', 'aa40=TRUE & aa42=TRUE & aa44=TRUE & aa46=TRUE', |
| 8944 | | '-evalt', 'card(aa41) = 1187 & card(aa47) = 180' |
| 8945 | | ], 'Scrambled version of test 2002, Ensure useless existentially quantified variable (value) does not perturb enumeration'). |
| 8946 | | cli_testcase(2277,[private],[ |
| 8947 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 8948 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 8949 | | '../prob_examples/examples/B/ClearSy/Caval/2020/01_Jan/ticket_record_typing/ruleERR_missingdata_bugly.mch', |
| 8950 | | '-execute_all', |
| 8951 | | '-execute_expect_steps', 3, %'-silent', |
| 8952 | | '-evalt', 'aa646=TRUE', |
| 8953 | | '-evalt', 'caval__rule__1__ALL={({("FINAL_GEIF__id1"|->1|->"eq11"|->"eq11"|->1|->"aa")}|->FALSE),({("FINAL_GEIF__id1"|->1|->"eq21"|->"eq21"|->1|->"aa")}|->FALSE),({("FINAL_GEIF__id1"|->2|->"A_equ2__tst2"|->"A_equ2__tst2"|->2|->"aa")}|->FALSE),({("FINAL_GEIF__id2"|->3|->"A_equ2__tst1"|->"A_equ2__tst1"|->3|->"aa")}|->FALSE),({("FINAL_GEIF__id2"|->4|->"A_equ2__tst2"|->"A_equ2__tst1"|->4|->"aa")}|->FALSE)}' |
| 8954 | | ], 'Scrambled version of 2003; Ensure problem with type checker and wrongly sorted record fields solved'). |
| 8955 | | cli_testcase(2278,[private],[ |
| 8956 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'TRUE', |
| 8957 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 8958 | | '../prob_examples/examples/B/ClearSy/Caval/2020/01_Jan/ticket_record_typing/ruleOK_noExpectedName_bugly.mch', |
| 8959 | | '-execute_all', '-execute_expect_steps', 3, |
| 8960 | | '-silent', |
| 8961 | | '-evalt', 'caval__rule__1__done=TRUE', |
| 8962 | | '-evalt', 'caval__rule__1__ALL={({("FINAL_GEIF__id1"|->1|->"eq11"|->1|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id1"|->1|->"eq21"|->1|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id1"|->2|->"A_equ2__tst2"|->2|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id2"|->3|->"A_equ2__tst1"|->3|->"{1,2,3,4}")}|->FALSE),({("FINAL_GEIF__id2"|->4|->"A_equ2__tst2"|->4|->"{1,2,3,4}")}|->FALSE)} ' |
| 8963 | | ], 'Scrambled version of test 2004; Variation of test 2003 with file which did not exhibit initial problem'). |
| 8964 | | cli_testcase(2279,[private],[ |
| 8965 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'FALSE', |
| 8966 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 8967 | | '../prob_examples/examples/B/ClearSy/Caval/2020/01_Jan/memory/Debug__2486__INF/rule_OPS_SDS_2486/rule_bugly.mch', |
| 8968 | | %'../private_examples/ClearSy/2020/01_Jan/memory/Debug__2486__TO_STRING/rule_OPS_SDS_2486/rule.mch', |
| 8969 | | '-execute', 4, %'-execute_all', '-execute_expect_steps', 5, %'-silent', |
| 8970 | | '-animate_stats', |
| 8971 | | '-evalt', 'aa151=TRUE & aa153=TRUE & aa155=FALSE' |
| 8972 | | ], 'Scrambled version of 2007 restricted to 4 steps; Test infinite loop in instantiated_enough for filter_cannot_match in b_compiler solved. Also test enum warning due to seq/set type and record values solved.'). |
| 8973 | | cli_testcase(2280, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8974 | | '-p', 'TIME_OUT', '60000', |
| 8975 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 8976 | | '../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-init', |
| 8977 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M0_mch_monolithic_bmc_k_0.eval', |
| 8978 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M0_mch_monolithic_bmc_k_1.eval', |
| 8979 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M0_mch_monolithic_bmc_k_2.eval', |
| 8980 | | '-eval', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M0_mch_monolithic_bmc_k_0.eval', |
| 8981 | | '-eval', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M0_mch_monolithic_bmc_k_1.eval', |
| 8982 | | '-eval', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M0_mch_monolithic_bmc_k_2.eval' |
| 8983 | | ], 'Double check CDCL(T) solver for BMC constraints that cannot be decided due to the use of unfixed deferred sets.'). |
| 8984 | | cli_testcase(2281, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8985 | | '-p', 'TIME_OUT', '60000', |
| 8986 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 8987 | | '../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb', '-init', |
| 8988 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M1_mch_monolithic_bmc_k_0.eval', |
| 8989 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M1_mch_monolithic_bmc_k_1.eval', |
| 8990 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M1_mch_monolithic_bmc_k_2.eval', |
| 8991 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M1_mch_monolithic_bmc_k_0.eval', |
| 8992 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M1_mch_monolithic_bmc_k_1.eval', |
| 8993 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Bepi_Soton/M1_mch_monolithic_bmc_k_2.eval' |
| 8994 | | ], 'Double check CDCL(T) solver for BMC constraints some of which cannot be decided due to the use of unfixed deferred sets.'). |
| 8995 | | cli_testcase(2282, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 8996 | | '-p', 'TIME_OUT', '60000', |
| 8997 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 8998 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/PM_M0_AAI.eventb', '-init', |
| 8999 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_0.eval', |
| 9000 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_1.eval', |
| 9001 | | '-evalf', ':cdclt #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_2.eval', % ProB is not able to double check the result |
| 9002 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_0.eval', |
| 9003 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_1.eval', |
| 9004 | | '-evalf', ':cdclt-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_2.eval' |
| 9005 | | ], 'Double check CDCL(T) solver for BMC constraints including IDL constraints.'). |
| 9006 | | cli_testcase(2283,[private_source_not_available],[ |
| 9007 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 20000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 9008 | | '../private_examples/ClearSy/2023/rules_GDE_TAILLE_loss/rule_CHAMPS_COMMUNS_AUX_FICHIERS_MCMDORIGINE_RVF64_MCMD_FOLIO.mch', |
| 9009 | | '-execute_all', '-execute_expect_steps', 10, %'-silent', |
| 9010 | | '-animate_stats', |
| 9011 | | '-evalt', 'card(caval__rule__3__ALL)=426', |
| 9012 | | '-evalt', 'card(caval__rule__4__ALL)=395', |
| 9013 | | '-evalt', 'card(caval__rule__6__ALL)=395', |
| 9014 | | '-evalt', 'card(caval__rule__8__ALL)=563', |
| 9015 | | '-evalt', 'caval__rule__8__done=TRUE' |
| 9016 | | ], 'Issue with allow_to_lift_exists annotation for domain/range solved.'). % takes about 70 seconds |
| 9017 | | cli_testcase(2284,[tickets],[ |
| 9018 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9019 | | '-evalt', '{x|x<:BOOL & card(x) <= 0} = {{}}', |
| 9020 | | '-evalt', '{x|x<:BOOL & card(x) = 0} = {{}}', |
| 9021 | | '-evalt', '{x|x<:BOOL & card(x) > 0} = {{TRUE,FALSE},{TRUE},{FALSE}}', |
| 9022 | | '-evalt', '{x|x<:BOOL & card(x) >= 1} = {{TRUE,FALSE},{TRUE},{FALSE}}' |
| 9023 | | ], 'Detect card to equal/not_equal empty_set transformations work correctly'). |
| 9024 | | cli_testcase(2285,[b_test,refinement,json_trace_replay],[ |
| 9025 | | '../prob_examples/public_examples/B/Tester/TraceReplay/CheckOptimizedReplay.mch', |
| 9026 | | '-expcterr', 'replay_json_trace_file', % it is actually a warning for imprecise replay |
| 9027 | | '-expcterr', 'trace_replay', % ditto |
| 9028 | | '-evalt', 'cnt=5 & pc=1', % check we are in right end state |
| 9029 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tester/TraceReplay/CheckOptimizedReplay.prob2trace' |
| 9030 | | ], 'Check flexible replay where parameter is negated'). |
| 9031 | | cli_testcase(2286,[infinite,cbc],[ |
| 9032 | | '-evalt', 'closure1({1|->2,2|->3}) : 1..3 <-> 1..3', |
| 9033 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 <-> 1..3', |
| 9034 | | '-evalf', 'closure({1|->2,2|->3}) : INTEGER <-> 1..3', |
| 9035 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 <-> INTEGER', |
| 9036 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 <->> 1..3', |
| 9037 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 <<-> 1..3', |
| 9038 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 <<->> 1..3', |
| 9039 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 +-> 1..3', |
| 9040 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 +->> 1..3', |
| 9041 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 --> 1..3', |
| 9042 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 -->> 1..3', |
| 9043 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 >-> 1..3', |
| 9044 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 >->> 1..3', |
| 9045 | | '-evalf', 'closure({1|->2,2|->3}) : 1..3 >+> 1..3', |
| 9046 | | '-evalt', 'f=%x.(x:INTEGER|x*x) & f:INTEGER +-> INTEGER', |
| 9047 | | '-evalf', 'f=%x.(x:INTEGER|x*x) & f:INTEGER >+> INTEGER' |
| 9048 | | % does not work yet: closure({1|->2,2|->3}) /: 1..3 <-> 1..3 |
| 9049 | | ], 'Check infinite reflexive closure result can be checked symbolically'). |
| 9050 | | cli_testcase(2287,[private_source_not_available],[ |
| 9051 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 25000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 9052 | | '../private_examples/ClearSy/2023/Machines_perf_0111/Thales_All/rule_zcpa2.mch', |
| 9053 | | '-noinv', % there are invariant violations |
| 9054 | | '-execute_all', '-execute_expect_steps', 5, %'-silent', |
| 9055 | | '-animate_stats', |
| 9056 | | '-evalt', 'caval__rule__1__done=TRUE & caval__rule__2__done=TRUE', |
| 9057 | | '-evalt', 'card(caval__rule__1__ALL)=96', |
| 9058 | | '-evalt', 'card(caval__rule__2__ALL)=17' |
| 9059 | | ], 'Issue with virtual timeout in exists for rel_composition/iterate solved.'). % takes about 30 seconds |
| 9060 | | cli_testcase(2288, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9061 | | '-p', 'TIME_OUT', '20000', |
| 9062 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/PM_M0_AAI.eventb', '-init', |
| 9063 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_0.eval', |
| 9064 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_1.eval', |
| 9065 | | '-evalf', ':z3 #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_2.eval', % ProB is not able to double check the result |
| 9066 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_0.eval', |
| 9067 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_1.eval', |
| 9068 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_AAI/M0_AAI_monolithic_bmc_k_2.eval' |
| 9069 | | ], 'Double check Z3 solver for BMC constraints including IDL constraints.'). |
| 9070 | | cli_testcase(2289, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9071 | | '-p', 'TIME_OUT', '1000', |
| 9072 | | '-p', 'z3_solve_for_animation', 'true', |
| 9073 | | '../prob_examples/public_examples/B/SmtSolverTests/unfixed_deferred_sets/simple_unfixed_deferred_sets.mch', '-init', |
| 9074 | | '-evalt', ':z3-double-check f:BOOL --> DS3', |
| 9075 | | '-evalt', ':z3-double-check f:BOOL >-> DS3', |
| 9076 | | '-evalf', ':z3-double-check !x.(x:INTEGER => card(DS) = x)', |
| 9077 | | '-evalf', ':z3-double-check !x.(x:INTEGER => card(DS3) = x)', |
| 9078 | | '-evalf', ':z3-double-check f:1..4 >-> DS3', |
| 9079 | | '-evalf', ':z3-double-check f:1..4 >->> DS3', |
| 9080 | | '-evalf', ':z3-double-check f:BOOL -->> DS3', |
| 9081 | | '-evalt', ':z3-double-check x:INTEGER & card(DS) = x', |
| 9082 | | '-evalt', ':z3-double-check x:INTEGER & card(DS3) = x', |
| 9083 | | '-evalt', ':z3-double-check f:1..3 -->> DS3', |
| 9084 | | '-evalt', ':z3-double-check f:BOOL <-> DS3', |
| 9085 | | '-evalt', ':z3-free-double-check f:BOOL --> DS3', |
| 9086 | | '-evalt', ':z3-free-double-check f:BOOL >-> DS3', |
| 9087 | | '-eval', ':z3-free-double-check !x.(x:INTEGER => card(DS) = x)', % unfixed deferred set |
| 9088 | | '-eval', ':z3-free-double-check !x.(x:INTEGER => card(DS3) = x)', % unfixed deferred set |
| 9089 | | '-eval', ':z3-free-double-check f:1..4 >-> DS3', % unfixed deferred set |
| 9090 | | '-eval', ':z3-free-double-check f:1..4 >->> DS3', % unfixed deferred set |
| 9091 | | '-eval', ':z3-free-double-check f:BOOL -->> DS3', % unfixed deferred set |
| 9092 | | '-evalt', ':z3-free-double-check x:INTEGER & card(DS) = x', |
| 9093 | | '-evalt', ':z3-free-double-check x:INTEGER & card(DS3) = x', |
| 9094 | | '-evalt', ':z3-free-double-check f:1..3 -->> DS3', |
| 9095 | | '-evalt', ':z3-free-double-check f:BOOL <-> DS3', |
| 9096 | | '-eval', ':z3-free-double-check f:1..5 -->> (DS3*(1..2))', % nested unfixed deferred set |
| 9097 | | '-eval', ':z3-free-double-check f:1..6 -->> (DS3*(1..2))' |
| 9098 | | ], 'Double check Z3 solver for constraints involving unfixed deferred sets.'). |
| 9099 | | cli_testcase(2290, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9100 | | '-p', 'TIME_OUT', '60000', |
| 9101 | | '../prob_examples/public_examples/B/SmtSolverTests/unfixed_deferred_sets/simple_unfixed_deferred_sets.mch', '-init', |
| 9102 | | '-evalt', ':cdclt-double-check f:BOOL --> DS3', |
| 9103 | | '-evalt', ':cdclt-double-check f:BOOL >-> DS3', |
| 9104 | | '-evalf', ':cdclt-double-check !x.(x:INTEGER => card(DS) = x)', |
| 9105 | | '-evalf', ':cdclt-double-check !x.(x:INTEGER => card(DS3) = x)', |
| 9106 | | '-evalf', ':cdclt-double-check f:1..4 >-> DS3', |
| 9107 | | '-evalf', ':cdclt-double-check f:1..4 >->> DS3', |
| 9108 | | '-evalf', ':cdclt-double-check f:BOOL -->> DS3', |
| 9109 | | '-evalt', ':cdclt-free-double-check x:INTEGER & card(DS) = x', |
| 9110 | | '-evalt', ':cdclt-free-double-check x:INTEGER & card(DS3) = x', |
| 9111 | | '-evalt', ':cdclt-double-check f:1..3 -->> DS3', |
| 9112 | | '-evalt', ':cdclt-double-check f:BOOL <-> DS3', |
| 9113 | | '-evalt', ':cdclt-free-double-check f:BOOL --> DS3', |
| 9114 | | '-evalt', ':cdclt-free-double-check f:BOOL >-> DS3', |
| 9115 | | '-eval', ':cdclt-free-double-check !x.(x:INTEGER => card(DS) = x)', % unfixed deferred set |
| 9116 | | '-eval', ':cdclt-free-double-check !x.(x:INTEGER => card(DS3) = x)', % unfixed deferred set |
| 9117 | | '-eval', ':cdclt-free-double-check f:1..4 >-> DS3', % unfixed deferred set |
| 9118 | | '-eval', ':cdclt-free-double-check f:1..4 >->> DS3', % unfixed deferred set |
| 9119 | | '-eval', ':cdclt-free-double-check f:BOOL -->> DS3', % unfixed deferred set |
| 9120 | | '-evalt', ':cdclt-free-double-check x:INTEGER & card(DS) = x', |
| 9121 | | '-evalt', ':cdclt-free-double-check x:INTEGER & card(DS3) = x', |
| 9122 | | '-evalt', ':cdclt-free-double-check f:1..3 -->> DS3', |
| 9123 | | '-evalt', ':cdclt-free-double-check f:BOOL <-> DS3', |
| 9124 | | '-eval', ':cdclt-free-double-check f:1..5 -->> (DS3*(1..2))', % nested unfixed deferred set |
| 9125 | | '-eval', ':cdclt-free-double-check f:1..6 -->> (DS3*(1..2))' |
| 9126 | | ], 'Double check CDCL(T) solver for constraints involving unfixed deferred sets.'). |
| 9127 | | cli_testcase(2291, [external,reals,wd], [ |
| 9128 | | '-evalt', 'max({2.0,3.0,x})=r & x:{2.0,4.1} & r>3.0', |
| 9129 | | '-evalt', 'min({2.0,3.0,x})=r & x:{2.0,1.1} & r<2.0', |
| 9130 | | '-evalf', 'min({2.0,3.0,x})=r & x:{2.0,4.1} & r>3.0', |
| 9131 | | '-evalt', 'max(ran(%x.(x:1..100|2.0 / real(x)))) = 2.0', |
| 9132 | | '-evalt', 'min(ran(%x.(x:1..100|2.0 / real(x)))) = 0.02', |
| 9133 | | '-evalt', 'min(ran(%x.(x:1..100|-2.0 / real(x)))) = -2.0', |
| 9134 | | '-evalt', ':wd ll<:REAL & ll/={} & ll:FIN(ll) & ff=max(ll)', % from test 2018 with REAL |
| 9135 | | '-evalt', ':wd ll<:REAL & ll/={} & ll:FIN(ll) & ff=min(ll)', |
| 9136 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE' |
| 9137 | | ], 'check min and max work with reals'). |
| 9138 | | cli_testcase(2292, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9139 | | '-p', 'TIME_OUT', '1000', |
| 9140 | | '-p', 'z3_solve_for_animation', 'true', |
| 9141 | | '../prob_examples/public_examples/TLC/NoError/safecap2549260349036854403.mch', '-init', |
| 9142 | | '-eval', ':z3-double-check not(tl : TRAIN +-> AMBIT) & tl = {} <+ {tt |-> {A_S10 |-> AD,S10_S12 |-> AE,S12_S14 |-> AG,S14_S16 |-> AI,S14_S116 |-> AI,S16_B |-> AL,S116_C |-> BL}({A_B |-> A_S10,A_C |-> A_S10}(ll))}', |
| 9143 | | '-eval', ':z3-double-check not(tl : TRAIN +-> AMBIT) & tl = {tt |-> AD}', |
| 9144 | | '-eval', ':z3-double-check aa : TRAIN -->> AMBIT', |
| 9145 | | '-eval', ':z3-free-double-check not(tl : TRAIN +-> AMBIT) & tl = {} <+ {tt |-> {A_S10 |-> AD,S10_S12 |-> AE,S12_S14 |-> AG,S14_S16 |-> AI,S14_S116 |-> AI,S16_B |-> AL,S116_C |-> BL}({A_B |-> A_S10,A_C |-> A_S10}(ll))}', |
| 9146 | | '-eval', ':z3-free-double-check not(tl : TRAIN +-> AMBIT) & tl = {tt |-> AD}', |
| 9147 | | '-eval', ':z3-free-double-check aa : TRAIN -->> AMBIT' |
| 9148 | | ], 'Double check Z3 solver for constraints involving unfixed deferred sets.'). |
| 9149 | | cli_testcase(2293, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9150 | | '-p', 'TIME_OUT', '60000', |
| 9151 | | '../prob_examples/public_examples/TLC/NoError/safecap2549260349036854403.mch', '-init', |
| 9152 | | '-eval', ':cdclt-double-check not(tl : TRAIN +-> AMBIT) & tl = {} <+ {tt |-> {A_S10 |-> AD,S10_S12 |-> AE,S12_S14 |-> AG,S14_S16 |-> AI,S14_S116 |-> AI,S16_B |-> AL,S116_C |-> BL}({A_B |-> A_S10,A_C |-> A_S10}(ll))}', |
| 9153 | | '-eval', ':cdclt-double-check not(tl : TRAIN +-> AMBIT) & tl = {tt |-> AD}', |
| 9154 | | '-eval', ':cdclt-double-check aa : TRAIN -->> AMBIT', |
| 9155 | | '-eval', ':cdclt-free-double-check not(tl : TRAIN +-> AMBIT) & tl = {} <+ {tt |-> {A_S10 |-> AD,S10_S12 |-> AE,S12_S14 |-> AG,S14_S16 |-> AI,S14_S116 |-> AI,S16_B |-> AL,S116_C |-> BL}({A_B |-> A_S10,A_C |-> A_S10}(ll))}', |
| 9156 | | '-eval', ':cdclt-free-double-check not(tl : TRAIN +-> AMBIT) & tl = {tt |-> AD}', |
| 9157 | | '-eval', ':cdclt-free-double-check aa : TRAIN -->> AMBIT' |
| 9158 | | ], 'Double check CDCL(T) solver for constraints involving unfixed deferred sets.'). |
| 9159 | | cli_testcase(2294, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9160 | | '-p', 'TIME_OUT', '60000', |
| 9161 | | '../prob_examples/public_examples/B/PerformanceTests/ModelChecking/BooleanFunctions.mch', '-init', |
| 9162 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_3.eval', |
| 9163 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_4.eval', % sometimes throws enumeration warning |
| 9164 | | % '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_5.eval', % comment out to avoid unknowns in buildbot |
| 9165 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_6.eval', % can take some time |
| 9166 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_3.eval', |
| 9167 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_4.eval' |
| 9168 | | % '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_5.eval' % sometimes unknown on buildbot |
| 9169 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/BooleanFunctions/BooleanFunctions_monolithic_bmc_k_6.eval' % can take some time |
| 9170 | | ], 'Double check CDCL(T) solver for constraints involving choice points within ProB\'s constraint solver for which we use chronological backtracking instead of backjumping.'). |
| 9171 | | cli_testcase(2295, [eventb_test, theories], [ |
| 9172 | | '-p', 'AUTO_DETECT_THEORY_MAPPING', 'TRUE', |
| 9173 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Float/ctx_float_tests_nodiv_ctx.eventb', |
| 9174 | | '-assertions'], |
| 9175 | | 'Check that Event-B float theory with inductive datatype'). |
| 9176 | | cli_testcase(2296, [cbc], [ |
| 9177 | | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Cansell_RingLead/elect2_2_mch.eventb', |
| 9178 | | '-evalf', ':prob-file ../prob_examples/public_examples/EventBPrologPackages/Tickets/Cansell_RingLead/bmc/elect2_2_mch_monolithic_bmc_k_1.eval'], 'Ensure we do not produce unfixed_deferred_set Unknown result'). |
| 9179 | | cli_testcase(2297, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9180 | | '-evalt', '{y|y<:BOOL & %x.(x:INTEGER|x+1)(card(y))=2} = {{FALSE},{TRUE}}', |
| 9181 | | '-evalt', '{x|x<:BOOL & %x.(x:INTEGER|x+1)(card(x))=2} = {{FALSE},{TRUE}}', |
| 9182 | | '-evalt', '{v|(%(x,v).(x:INTEGER|x*v)(v|->v))=100} = {-10,10}' |
| 9183 | | ], 'Check no issues with variable clashes and lambda function (inlining)'). |
| 9184 | | cli_testcase(2298,[private_source_not_available],[ |
| 9185 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 20000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 9186 | | '../private_examples/ClearSy/2019_May/perf_3264/rule_186.mch', |
| 9187 | | '-execute', 49, %'-silent', |
| 9188 | | '-animate_stats', |
| 9189 | | '-evalt', 'card(ic___OPS_SDS_3264_BBS)=218', |
| 9190 | | '-evalt', 'card(ic___OPS_SDS_3264_DPS)=185', |
| 9191 | | '-evalt', 'card(ic___edge_chaining)=304', |
| 9192 | | '-evalt', 'card(ic___ns___edge_paths)=17186', |
| 9193 | | '-evalt', 'caval__ic___ns___edge_paths__initialized=TRUE', |
| 9194 | | '-evalt', 'caval__ic___edge_normal_chaining__done=TRUE', |
| 9195 | | '-evalt', 'caval__ic___OPS_SDS_3264_OTHER_DP_IN_BLOCK__done = TRUE', |
| 9196 | | '-evalt', 'caval__acc___edge__LINK_DOWN_TANGENT__done=TRUE' |
| 9197 | | ], 'Issue with lambda treatment of b_test_closure.'). % takes about 62 seconds for 49 steps; difficult step is number 51 |
| 9198 | | cli_testcase(2299, [cbc,cbc_tests], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9199 | | '../prob_examples/public_examples/B/TestCaseGeneration/Ontology/Person_incremental.mch', |
| 9200 | | '-cbc_sequence_with_target', 'add', '{(hasSpeed |-> 0)} : dom(testcases)', |
| 9201 | | '-cbc_sequence_with_target', 'add', '{(hasSpeed |-> 1)} : dom(testcases)' |
| 9202 | | ], 'Check issue with expansion of large set solved'). |
| 9203 | | cli_testcase(2300, [cbc], [%'-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9204 | | '-evalt', '/*@symbolic */ {x|x:1..100000000 & x / 22 > 10} = x & (x={} <=> B=TRUE)', |
| 9205 | | '-evalt', '/*@symbolic */ {x|x>2 & x / 22 > 10} = x & (x={} <=> B=TRUE)', |
| 9206 | | '-evalf', '/*@symbolic */ {x|x>2 & x / 22 > 10} = x & (x={} <=> B=TRUE) & /*@symbolic */ {x|x>2 & x / 23 > 11} = x & (x={} <=> B=FALSE)', |
| 9207 | | '-evalt', '/*@symbolic */ {x|x>2 & x / 22 > 10} = x & (x*{1}) /= (x*{2})', |
| 9208 | | % some with WD conditions: |
| 9209 | | '-evalt', '/*@symbolic */ {x|x:1..100000000 & x mod 22=1} = x & (x={} <=> B=TRUE)', |
| 9210 | | '-evalt', '/*@symbolic */ {x|x>2 & x mod 22=1} = x & (x={} <=> B=TRUE)', |
| 9211 | | '-evalf', '/*@symbolic */ {x|x>2 & x mod 22=1} = x & (x={} <=> B=TRUE) & /*@symbolic */ {x|x>2 & x mod 23=1} = x & (x={} <=> B=FALSE)', |
| 9212 | | '-evalt', '/*@symbolic */ {x|x>2 & x mod 22=1} = x & (x*{1}) /= (x*{2})', |
| 9213 | | '-evalf', '/*@symbolic */ {x|x<0 & x mod 22=1 & x>-1000} = x & (x={} <=> B=TRUE) & (!x.(x:1..10000 => (B=FALSE <=> x+x < 20000))) & (!x.(x:1..10000 => (B=TRUE <=> x+x < 20000))) ' |
| 9214 | | ], 'Check that empty-ness check of closures has been improved'). |
| 9215 | | cli_testcase(2301, [csp_test], [ |
| 9216 | | '../prob_examples/public_examples/CSP/Tickets/304/SetChannelSynchronisation.csp', |
| 9217 | | '-t' |
| 9218 | | ], 'Check issue 304 with synchronisation of CSP sets'). |
| 9219 | | cli_testcase(2302, [cbc], [%'-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9220 | | '-evalt', 'id0 <: {1} & INTEGER - id0 +-> {} : FIN1(INTEGER +-> {})', |
| 9221 | | '-evalt', 'id0 <: {1} & INTEGER - id0 +-> {} : POW1(INTEGER +-> {})', |
| 9222 | | '-evalt', 'id0 <: {1} & INTEGER - id0 +-> {} : FIN(INTEGER +-> {})', |
| 9223 | | '-evalt', 'INTEGER --> {1} : FIN1(INTEGER --> {1})' |
| 9224 | | ], 'Check no problem with inf Prolog term for cardinality'). |
| 9225 | | cli_testcase(2303, [infinite,b_test,json_trace_replay], [ |
| 9226 | | '../prob_examples/public_examples/B/PerformanceTests/DeferredSets/InfiniteDeferredSets.mch', |
| 9227 | | '../prob_examples/public_examples/B/PerformanceTests/DeferredSets/InfiniteDeferredSets2.mch', |
| 9228 | | '-trace_replay', 'json', % model name removed in trace file |
| 9229 | | '../prob_examples/public_examples/B/PerformanceTests/DeferredSets/InfiniteDeferredSets.prob2trace', |
| 9230 | | '-expcterr', 'virtual_time_out', % TODO: should this be generated here? |
| 9231 | | '-evalt', 'ID2 /= ID3 & {iv}:FIN1(ID) & {iv,ID2,ID3,ID4}:FIN1(ID)', |
| 9232 | | '-evalt', '#ss.(ss<:ID & card(ss) = 3)', |
| 9233 | | '-evalt', '#ss.(ss<:ID & card(ss) = 20)', |
| 9234 | | '-evalt', 'ss={iv,ID2,ID3,ID4} & ii /: ss', |
| 9235 | | '-evalf', 'ID : FIN(ID)', |
| 9236 | | '-evalt', 'not(ID = {iv})', |
| 9237 | | '-evalf', '(ID = {iv})', |
| 9238 | | '-evalt', 'iv:ID', |
| 9239 | | '-evalt', '#x.(x /= iv)', |
| 9240 | | '-evalt', 'not(#x.(ID = {x}))', |
| 9241 | | '-evalf', '(#x.(ID = {x}))', |
| 9242 | | '-evalf', '(B=TRUE <=> ({x}=ID)) & (B=TRUE <=> ({x} /= ID))', |
| 9243 | | '-evalt', 'f:BOOL >-> ID', |
| 9244 | | '-evalf', 'f:BOOL >->> ID' |
| 9245 | | ], 'Check issue 304 with synchronisation of CSP sets'). |
| 9246 | | cli_testcase(2304, [wd,wd_prover], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9247 | | '../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/mondex_m3.eventb', |
| 9248 | | '-silent', |
| 9249 | | '-wd', 65, 72, '-timeout', 400 % timeout per PO |
| 9250 | | ], 'Test we no longer prove all POs'). % some were unprovable, old remove_finite cleanup rule was unsound for proving |
| 9251 | | cli_testcase(2305, [external,reals,json_trace_replay], [ |
| 9252 | | '../prob_examples/public_examples/B/Tester/TraceReplay/TestNonDetInitReplayReals.mch', |
| 9253 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tester/TraceReplay/TestNonDetInitReplayReals.prob2trace', |
| 9254 | | '-evalt', 'ff(aa)=30.0 & ff(bb)=21.0' |
| 9255 | | ], 'Check trace replay with becomes element of :: and reals work'). |
| 9256 | | cli_testcase(2306, [infinite,eventb_test,json_trace_replay], [ |
| 9257 | | '../prob_examples/examples/EventBPrologPackages/SEMCODT/MachineSystemLibrary_mch.eventb', |
| 9258 | | '-expcterr', 'virtual_time_out', % TODO: should this be generated here? |
| 9259 | | '-trace_replay', 'json', '../prob_examples/examples/EventBPrologPackages/SEMCODT/MachineSystemLibrary_mch.prob2trace' |
| 9260 | | ], 'Check infinite deferred set works'). |
| 9261 | | cli_testcase(2307, [b_test,let], [%'-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9262 | | '-evalt', 'LET x BE x=1+1 IN %y.(y:0..x|y+x+x) END (x) = res & x=0 & res=4', |
| 9263 | | '-evalf', 'LET x BE x=1+1 IN %y.(y:0..x|y+x+x) END (x) = res & x=0 & res=6', |
| 9264 | | '-evalt', 'LET x BE x=1+1 IN %y.(y:0..x|y+x+x) END (xx) = res & xx=0 & res=4' |
| 9265 | | ], 'Check lambda inlining with LET expressions'). |
| 9266 | | cli_testcase(2308, [external,reals,json_trace_replay], [ |
| 9267 | | '../prob_examples/public_examples/B/ErrorMachines/UninitialisedVAR/Person_LeiTai.mch', |
| 9268 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/ErrorMachines/UninitialisedVAR/Person_LeiTai.prob2trace', |
| 9269 | | %Note: if we animate one step further we get a problem reading an uninitialised variable |
| 9270 | | '-evalt', 'card(testcases)=16' |
| 9271 | | ], 'Check no time-out in invariant due to closure expansion for WF priority'). |
| 9272 | | cli_testcase(2309, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9273 | | '-evalt', ':cdclt-double-check y:-10..10 & n:-10..10 & a=IF n>7 THEN 1/y ELSE 1/n END', % rewrite if and add y/=0 and n/=0 |
| 9274 | | '-evalt', ':cdclt-double-check z:-10..10 & a=LET x BE x=1/z IN 2*x*x END', % rewrite let and add z/=0 |
| 9275 | | '-evalt', ':cdclt-double-check z:-10..10 & LET x BE x=1/z IN %y.(y:0..x|y+x+x) END (x) = res', % add z/=0 |
| 9276 | | '-evalt', ':cdclt-double-check x:INTEGER & s:POW(1..10) & x=min(s)', % add s/={} |
| 9277 | | '-evalt', ':cdclt-double-check x:INTEGER & s:POW(1..10) & x=max(s)', % add s/={} |
| 9278 | | '-evalt', ':cdclt-double-check x:INTEGER & {(1,2)}(x)=2', % add x:dom({(1,2)}) |
| 9279 | | '-evalt', ':cdclt-double-check !(y,n).(y:-10..10 & n:-10..10 => IF n>7 THEN 1/y ELSE 1/n END<100)', |
| 9280 | | '-evalt', ':cdclt-double-check #(y,n).(y:-10..10 & n:-10..10 & IF n>7 THEN 1/y ELSE 1/n END<100)', |
| 9281 | | '-evalt', ':cdclt-double-check a=bool(#(y,n).(y:-10..10 & n:-10..10 & IF n>7 THEN 1/y ELSE 1/n END<100))' |
| 9282 | | ], 'Check rewriting of if- and let-expressions and some WD conditions for the SMT solver'). |
| 9283 | | cli_testcase(2310,[private_source_not_available],[ |
| 9284 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9285 | | '../private_examples/ClearSy/2023/rules_GDE_TAILLE_loss/rule_CHAMPS_COMMUNS_AUX_FICHIERS_MCMDORIGINE_RVF64_MCMD_FOLIO.mch', |
| 9286 | | '-execute_all', '-animate_stats', '-noinv', |
| 9287 | | '-execute_expect_steps', 10, '-p', 'TIME_OUT', 30000, |
| 9288 | | '-evalt', 'caval__rule__8__done=TRUE', |
| 9289 | | '-evalt', 'card(caval__rule__3__ALL)=426 & card(caval__rule__4__ALL)=395 & card(caval__rule__6__ALL)=395' ], |
| 9290 | | 'Ensure no timeout due to exists not lifted'). % now takes about 70 seconds for 10 steps; see e99501de85ca9cba167aec3cbae67c1271121b32 |
| 9291 | | cli_testcase(2311, [proz,json_trace_replay], [ |
| 9292 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9293 | | '../prob_examples/public_examples/Z/Daniel/Praxis/network2.tex', |
| 9294 | | '-trace_replay', 'json', '../prob_examples/public_examples/Z/Daniel/Praxis/network2.prob2trace', |
| 9295 | | '-evalt', 'card({wsIdle,wsEditing})=2', |
| 9296 | | '-evalt', 'wsWaiting({1}) = wsWaiting({x})' |
| 9297 | | ], 'Check JSON trace replay works with freetype ids in trace'). |
| 9298 | | cli_testcase(2312, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListTest1.eventb', '-init', |
| 9299 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9300 | | '-evalt', 'cons(2,nil) /= nil', |
| 9301 | | '-evalf', 'cons(2,nil) = cons(3,x)', |
| 9302 | | '-evalt', 'cons(x,nil) /= nil & x>2 & x<10', |
| 9303 | | '-evalt', 'card({cons(2,nil) , cons(3,nil)})=2', |
| 9304 | | '-evalt', 'cons(TRUE,nil) /= cons(FALSE,nil)' |
| 9305 | | % '-evalt', 'card({cons(2,nil) , cons(3,nil)})=2 & cons(TRUE,nil) /= cons(FALSE,nil)' % does not work yet; type error |
| 9306 | | ], 'Checking using polymorphic freetype constructors in formulas'). |
| 9307 | | cli_testcase(2313,[private],[ |
| 9308 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'FALSE', |
| 9309 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 9310 | | '../prob_examples/examples/B/ClearSy/Caval/2023/Machines_perf0323/Lowesoft/rule_Eq_9_internal_bugly.mch', |
| 9311 | | '-execute_all', '-execute_expect_steps', 4, %'-silent', |
| 9312 | | '-animate_stats', |
| 9313 | | '-evalt', 'aa56=TRUE & card(aa57)=9670 & aa58=TRUE & aa59={}' |
| 9314 | | ], 'Test no slowdown'). % was due to apply_check_tuple_delay real division, although issue only appears in original file before scrambling, as it modifies strings and results |
| 9315 | | cli_testcase(2314,[private_source_not_available],[ |
| 9316 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'FALSE', |
| 9317 | | '-p', 'DATA_VALIDATION', 'TRUE', |
| 9318 | | '../private_examples/ClearSy/2023/Machines_perf_0323/Lowesoft/rule_Rule_Eq_0009.mch', |
| 9319 | | '-execute_all', '-execute_expect_steps', 4, %'-silent', |
| 9320 | | '-animate_stats', |
| 9321 | | '-evalt', 'caval__rule__1__done=TRUE & card(caval__rule__1__ALL)=9670 & caval__rule__2__done=TRUE & card(caval__rule__2__ALL)=795' |
| 9322 | | ], 'version of 2313 not scrambled'). % tests fix in 30e348cf02697748b3f902c7f7e7fd2bccd279bb |
| 9323 | | cli_testcase(2315, [laws,data_validation], [ |
| 9324 | | '../prob_examples/public_examples/B/Laws/RelLaws.mch', |
| 9325 | | '../prob_examples/public_examples/B/Laws/EqualityLaws.mch', |
| 9326 | | '../prob_examples/public_examples/B/Laws/BoolLaws.mch', |
| 9327 | | '../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', |
| 9328 | | '../prob_examples/public_examples/B/Laws/SetLaws.mch', |
| 9329 | | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', |
| 9330 | | '../prob_examples/public_examples/B/Laws/CardinalityLaws.mch', |
| 9331 | | '../prob_examples/public_examples/B/Laws/FunLaws.mch', |
| 9332 | | '../prob_examples/public_examples/B/Laws/SubstitutionLaws.mch', |
| 9333 | | '../prob_examples/public_examples/B/Laws/BoolLaws_SetCompr.mch', |
| 9334 | | '../prob_examples/public_examples/B/Laws/SetLawsPow.mch', |
| 9335 | | '../prob_examples/public_examples/B/Laws/SetLawsPowPow.mch', |
| 9336 | | '../prob_examples/public_examples/B/Laws/SetRelLaws_NatBool.mch', |
| 9337 | | '../prob_examples/public_examples/B/Laws/RelLaws_BOOL1.mch', |
| 9338 | | '../prob_examples/public_examples/B/Laws/RelLaws_BOOL2.mch', |
| 9339 | | '../prob_examples/public_examples/B/Laws/RelLaws_BOOL3.mch', |
| 9340 | | '../prob_examples/public_examples/B/Laws/RelLaws_STRING1.mch', |
| 9341 | | '../prob_examples/public_examples/B/Laws/RelLaws_REC1.mch', |
| 9342 | | '../prob_examples/public_examples/B/Laws/FunLawsRecStrings.mch', |
| 9343 | | '-mc', '500', '-cs', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-opterr', 'model_check_incomplete', |
| 9344 | | '-p', 'CLPFD', 'TRUE', '-p', 'DATA_VALIDATION', 'TRUE'], 'Laws (297,...) with DATA_VALIDATION.'). |
| 9345 | | cli_testcase(2316,[private_source_not_available],[ |
| 9346 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'RAISE_ABORT_IMMEDIATELY', 'FALSE', |
| 9347 | | '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', '-noinv', |
| 9348 | | '../private_examples/ClearSy/2023/perf_0704/rule_genz.mch', |
| 9349 | | '-execute_all', '-execute_expect_steps', 17, %'-silent', |
| 9350 | | '-animate_stats', |
| 9351 | | '-evalt', 'caval__rule__1__done=TRUE & card(caval__rule__1__ALL)=1808 & card(ic___Elementary_ZoneKpMax)=1809' |
| 9352 | | ], 'test we do not lift gz,bmz_name exists and idle waitflag works without duplication of calls'). % takes around 90 secs |
| 9353 | | cli_testcase(2317,[wd,wd_prover],[ |
| 9354 | | '-evalt', ':prove x<:INTEGER & card(x):0..1 => x:FIN(x)', |
| 9355 | | '-evalt', ':prove x<:INTEGER & card(x)<= y => x:FIN(x)', |
| 9356 | | '-evalt', ':prove x<:INTEGER & card(x)<= 10 => x:FIN(x)', |
| 9357 | | '-evalt', ':prove x<:INTEGER & card(x)< 10 => x:FIN(x)', |
| 9358 | | '-evalt', ':prove x<:INTEGER & 10>card(x) => x:FIN(x)', |
| 9359 | | '-evalt', ':prove x<:INTEGER & y>=card(x) => x:FIN(x)', |
| 9360 | | '-evalt', ':prove real(1) /= 0.0', |
| 9361 | | '-evalt', ':prove real(1) /= real(0)', |
| 9362 | | '-evalt', ':prove floor(1.1) = ceiling(0.9)', |
| 9363 | | '-evalt', ':prove floor(1.1) /= ceiling(1.1)', |
| 9364 | | '-evalu', ':prove real(0) /= 0.0' |
| 9365 | | ], 'check wd prover can use previous card hyps to prove finite and some simple real literals'). |
| 9366 | | cli_testcase(2318,[cbc],[ |
| 9367 | | '-evalt', 'iterate(%x.(x:NATURAL|x+2),2000)[{20}] = {4020}', |
| 9368 | | '-evalt', 'iterate(%x.(x:NATURAL|x+2),2000)(20) = 4020', |
| 9369 | | '-evalt', 'iterate(%x.(x:NATURAL|x+2),20000)[{20}] = {40020}', |
| 9370 | | '-evalt', 'iterate(%x.(x:1..20100|x+2),10000)[{20}] = {20020}', |
| 9371 | | % now also check that image of closure / closure1 still works: |
| 9372 | | '-evalt', 'closure1(%x.(x:NATURAL|x/2))[{20}] = {10,5,2,1,0}', |
| 9373 | | '-evalt', 'closure1(%x.(x:1..1000|x/2))[{20}] = {10,5,2,1,0}', |
| 9374 | | '-evalt', 'closure(%x.(x:NATURAL|x/2))[{20}] = {20,10,5,2,1,0}', |
| 9375 | | '-evalt', 'closure(%x.(x:1..1000|x/2))[{20}] = {20,10,5,2,1,0}' |
| 9376 | | ], 'check performance improvement for image of iterate'). |
| 9377 | | cli_testcase(2319,[smt_solver_integration],[ |
| 9378 | | '-evalt', ':z3-double-check a:REAL', |
| 9379 | | '-evalt', ':z3-double-check a:REAL & a=1.1', |
| 9380 | | '-evalt', ':z3-double-check a:REAL & a=-1.1', |
| 9381 | | '-evalt', ':z3-double-check a:REAL & a/=b', |
| 9382 | | '-evalt', ':z3-double-check a:REAL & a=1.2*b', |
| 9383 | | '-evalt', ':z3-double-check a:REAL & a=1.2+b', |
| 9384 | | '-evalt', ':z3-double-check a:REAL & a=1.2-b', |
| 9385 | | '-evalt', ':z3-double-check a:REAL & a=1.2/b', |
| 9386 | | '-evalt', ':z3-double-check a:REAL & b/=0.0 & a=1.2/b', |
| 9387 | | '-evalt', ':z3-double-check a:REAL & b/=0.0 & b/=1.0 & a=1.2/b', |
| 9388 | | '-evalt', ':z3-double-check a:REAL & a=1.2*0.5', |
| 9389 | | '-evalf', ':z3-double-check a:REAL & a=1.2*0.5 & a /= 0.6', |
| 9390 | | '-evalt', ':z3-double-check a:REAL & a=1.2/0.5', |
| 9391 | | '-evalt', ':z3-double-check a:REAL & a=1.2+0.5', |
| 9392 | | '-evalt', ':z3-double-check a:REAL & a=1.2-0.5', |
| 9393 | | '-evalt', ':z3-double-check a:REAL & a=1.2-0.5', |
| 9394 | | '-evalt', ':z3-double-check a:REAL & a=max({1.1,1.2,1.3})', |
| 9395 | | '-evalf', ':z3-double-check a:REAL & a=max({1.1,1.2,1.3}) & a/=1.3', |
| 9396 | | '-evalt', ':z3-double-check a:REAL & a=min({1.1,1.2,1.3})', |
| 9397 | | '-evalf', ':z3-double-check a:REAL & a=min({1.1,1.2,1.3}) & a/=1.1', |
| 9398 | | '-evalt', ':z3-double-check a=1.0/49.0', |
| 9399 | | '-evalt', ':z3-double-check 0.0=0.0/49.0', |
| 9400 | | '-evalt', ':z3-double-check a=1.0/1000000000.0', |
| 9401 | | '-evalt', ':z3 x*2.2=4.4 & x=2.0', |
| 9402 | | '-evalf', ':z3 x*2.2=4.4 & x=3.0', |
| 9403 | | '-evalt', ':z3 a=3.2*8.9 & a=28.48', |
| 9404 | | '-evalt', ':z3-double-check a=3.2/8.9', |
| 9405 | | '-evalt', ':z3-double-check a=3.2/8.9*3.564', |
| 9406 | | '-evalt', ':z3-double-check floor(4.2) = 4', |
| 9407 | | '-evalt', ':z3-double-check floor(4.9) = 4', |
| 9408 | | '-evalt', ':z3-double-check floor(-4.2) = -5', |
| 9409 | | '-evalt', ':z3-double-check floor(-4.9) = -5', |
| 9410 | | '-evalt', ':z3-double-check ceiling(4.2) = 5', |
| 9411 | | '-evalt', ':z3-double-check ceiling(4.9) = 5', |
| 9412 | | '-evalt', ':z3-double-check ceiling(-4.2) = -4', |
| 9413 | | '-evalt', ':z3-double-check ceiling(-4.9) = -4', |
| 9414 | | '-evalt', ':z3 a:REAL & a=3.2+8.90000000000001 & floor(a)=b & a=12.10000000000001 & b=12', |
| 9415 | | '-evalt', ':z3 a:REAL & a=3.2+8.9 & floor(a)=b & a=12.1 & b=12', |
| 9416 | | '-evalf', ':z3 a:REAL & a=3.2+8.9 & floor(a)=b & a=12.1 & b=10', |
| 9417 | | '-evalf', ':z3 !(id0).(id0 : REAL => 0 <= floor(id0))', |
| 9418 | | '-evalf', ':z3 !(id0).(id0 : REAL => 0 <= ceiling(id0))', |
| 9419 | | '-evalf', ':z3 !(id0,id1,id2,id3).(id0 : STRING * INTEGER & id1 : REAL & id2 : POW(INTEGER * POW(INTEGER * STRING)) & id3 : INTEGER & MAXINT / 52 <= floor(id1) => id3 + id3 <= 94 / 31)' |
| 9420 | | %'-evalt', ':z3-double-check a=max({1.2,1.3,1.4,0.4}) & b=floor(a)', % Z3 is not able to solve the following formulas |
| 9421 | | %'-evalt', ':z3-double-check a=max({1.2,1.3,1.4,0.4}) & b=ceiling(a)', |
| 9422 | | %'-evalt', ':z3-double-check a=min({1.2,1.3,1.4,0.4}) & b=floor(a+0.35)', |
| 9423 | | %'-evalt', ':z3-double-check a=min({1.2,1.3,1.4,0.4}) & b=ceiling(a*3.2)', |
| 9424 | | ], 'simple formulas to double check real support of Z3'). |
| 9425 | | cli_testcase(2320,[tickets, infinite],[ |
| 9426 | | '-evalt', 'ran(id2) <: BOOL & {} <<: (pred ; id2)' |
| 9427 | | ], 'check symbolic composition works with list value'). % required type argument to construct closure |
| 9428 | | cli_testcase(2322,[tickets, wd],[ |
| 9429 | | '-evalt', '(id0 : seq1(INTEGER) & last(id0) < 84 * MAXINT) <=> (first(id5) /= 0.0 & (id5 : seq1(REAL) & {id6|id6 : POW(INTEGER * REAL) & bfalse} : FIN({id6|id6 : POW(INTEGER * REAL) & bfalse})) & (id4 - 96.9113325147011) / first(id5) < PI(id6).(id6 : POW(INTEGER * REAL) & bfalse|prj1(REAL,POW(REAL))(id7)))' |
| 9430 | | %'-expcterr', well_definedness_error % was evalnw but with reification of REAL comparison (3b3f2834dde2a25ffc480300bdf5e11f28a4aabf) we now find solution |
| 9431 | | ], 'check no pending coroutine'). |
| 9432 | | cli_testcase(2323, [external,wd], [ |
| 9433 | | '-evalt', ':wd x>0 & r:BOOL<->BOOL & iterate(r,x) = res', |
| 9434 | | '-evalf', ':wd x<10 & r:BOOL<->BOOL & iterate(r,x) = res', |
| 9435 | | '-evalt', ':wd x:NATURAL & r:BOOL<->BOOL & iterate(r,x) = res', |
| 9436 | | '-evalt', ':wd x<:BOOL & r:BOOL<->BOOL & iterate(r,card(x)) = res', |
| 9437 | | '-evalt', ':wd x<:1..10 & r:BOOL<->BOOL & iterate(r,card(x)) = res', |
| 9438 | | '-evalt', 'r : BOOL<->BOOL & (x:3..4 => iterate(r,y) = iterate(r,y-1)) & y:0..10 & x>10 & x<100' |
| 9439 | | ], 'check wd works with iterate '). |
| 9440 | | cli_testcase(2324, [external,tickets], [ |
| 9441 | | '-evalt', ':prob (id0 : seq1(REAL) & real(MININT) = first(id0)) <=> prj2(REAL,REAL)(id1) <= id2' |
| 9442 | | ], 'ensure default instantiation for REAL generated in case term not needed'). |
| 9443 | | cli_testcase(2325, [wd], [ '-p', 'TRACE_INFO', 'TRUE', |
| 9444 | | '-evalf', '(card(inter({rr|rr : POW(INTEGER) & rr = NATURAL1})) <= 1 & inter({rr|rr : POW(INTEGER) & rr = NATURAL1}) : FIN(inter({rr|rr : POW(INTEGER) & rr = NATURAL1}))) & SIGMA(id0,id1,id2).(id0 : STRING & id1 : STRING & id2 : STRING & FLOAT <: id3|79 * MININT) >= MU(inter({rr|rr : POW(INTEGER) & rr = NATURAL1}))' |
| 9445 | | ], 'test improved WD treatment for predicate components'). % WFE grounded at end for all components in one go |
| 9446 | | cli_testcase(2326, [wd], [ '-p', 'TRACE_INFO', 'TRUE', |
| 9447 | | '-evalnwd', '(card(inter({rr|rr : POW(INTEGER) & rr = NATURAL1})) <= 1 & SIGMA(id0).(id0 : BOOL|79 * MININT) >= MU(inter({rr|rr : POW(INTEGER) & rr = NATURAL1})))', |
| 9448 | | '-evalnwd', '(card(inter({rr|rr : POW(INTEGER) & rr = NATURAL1})) <= 1 & SIGMA(id0).(id0 : BOOL|79 * MININT) < 2)', |
| 9449 | | '-expcterr', 'well_definedness_error' |
| 9450 | | ], 'test improved WD treatment for predicate components'). % WFE grounded at end for all components in one go |
| 9451 | | cli_testcase(2327, [b_test], [ |
| 9452 | | '-eval', '{xx,xx|xx:BOOL} =res & res:BOOL<->BOOL', |
| 9453 | | '-expcterr', 'type_expression_error' |
| 9454 | | ], 'test duplicate ids in comprehension set detected'). |
| 9455 | | cli_testcase(2328, [b_test,infinite, total_function], [ '-p', 'TRACE_INFO', 'TRUE', |
| 9456 | | '-eval', '(id10 ; id11) : STRING --> BOOL & ran(id10)<:BOOL', |
| 9457 | | '-eval', '(id10 ; id11) : STRING --> BOOL & ran(id10)<:BOOL & id11 = id(BOOL)', % this one could be solved in principle |
| 9458 | | '-evalt', '(id10 ; id11) : STRING --> BOOL & ran(id10)<:BOOL & id11 = id(BOOL) & id10 = STRING*{TRUE}', |
| 9459 | | '-expcterr', 'eval_string_enum_warning' |
| 9460 | | ], 'test no call_residue due to symbolic total function closure'). |
| 9461 | | cli_testcase(2329, [wd], [ |
| 9462 | | '-evalnwd', 'max(NATURAL1)>0', |
| 9463 | | '-evalnwd', 'max(NATURAL)>0', |
| 9464 | | '-evalnwd', 'max(INTEGER)>0', |
| 9465 | | '-evalnwd', 'min(INTEGER)<0', |
| 9466 | | '-expcterr', 'well_definedness_error' |
| 9467 | | ], 'test reporting of min/max of unbounded global sets as non wd'). |
| 9468 | | cli_testcase(2330, [tickets], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9469 | | '-evalt', '(id1 : dom(id0) & id0 : POW(INTEGER * POW(POW(STRING))) +-> INTEGER & MININT * 61 < id0(id1)) <=> (id3 : dom(id2) & id2 : INTEGER +-> POW(INTEGER * INTEGER * INTEGER) & prj2(NATURAL,INT) = id2(id3))', |
| 9470 | | '-evalt', 'x={NATURAL1,NATURAL} & y:x & 0:y' % was also working before |
| 9471 | | ], 'Check no enumeration warning thrown during normalisation'). |
| 9472 | | cli_testcase(2331, [b_test], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9473 | | '-evalt', '{x\x22c5\x:1..10|x*x} = {1,4,9,16,25,36,49,64,81,100}', % \x22c5\ is Unicode dot |
| 9474 | | '-evalt', '{x\x22c5\x:1..10|x*x} = {1,4,9,16,25,36,49,64,81,100}', |
| 9475 | | '-evalt', '{x,y\x22c5\x:1..5 & y:2..3|x*y} = {2,3,4,6,8,9,10,12,15}', |
| 9476 | | '-evalt', '{x\x22c5\ x:{x,y\x22c5\x:1..5 & y:2..3|x*y} & x<12 & x>9|x*10} = {100}', |
| 9477 | | '-evalt', 'prj2(prj1(1|->2|->3)) = 2', |
| 9478 | | '-evalt', 'prj1(prj1(1|->2|->3)) = 1', |
| 9479 | | '-evalt', 'prj2(1|->2|->3) = 3', |
| 9480 | | '-evalt', 'prj2(prj1(1|->2|->3)) = prj2(INTEGER,INTEGER)(prj1(INTEGER*INTEGER,INTEGER)(1|->2|->3))', % mix |
| 9481 | | '-evalt', 'prj2(INTEGER,INTEGER)[{2}*{3}] = {3}' % old style still works |
| 9482 | | ], 'Check new Event-B prj1/prj2 and set comprehension syntax'). |
| 9483 | | cli_testcase(2332, [tickets,card], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9484 | | '-evalt', '(INTEGER /\\ id0) /= {} & INTEGER /\\ id0 : FIN(INTEGER /\\ id0) & card(id0) <= 1 & MU(INTEGER /\\ id0) = 111', |
| 9485 | | '-evalt', '(INTEGER /\\ id0) /= {} & INTEGER /\\ id0 : FIN(INTEGER /\\ id0) & card(INTEGER /\\ id0) <= 1 & MU(INTEGER /\\ id0) = 0', |
| 9486 | | '-evalt', '(INTEGER /\\ id0) /= {} & INTEGER /\\ id0 : FIN(INTEGER /\\ id0) & card(INTEGER /\\ id0) <= 1 & MU(INTEGER /\\ id0) >= 0' |
| 9487 | | ], 'Check cyclic term issue in construct_interval_closure solved'). |
| 9488 | | cli_testcase(2333, [tickets,card,wd], [ |
| 9489 | | '-evalnwd', 'id1 <: INT & 1 < card(seq1(id1))', |
| 9490 | | '-evalnwd', ' id1 <: INT & 1 + ceiling(id0) < card(seq1(id1))', |
| 9491 | | '-opterr', 'eval_string_enum_warning', |
| 9492 | | '-expcterr', 'well_definedness_error' |
| 9493 | | ], 'Check CLPFD unification with inf is prevented'). |
| 9494 | | cli_testcase(2334,[smt_solver_integration],[ |
| 9495 | | '-evalt', ':z3-double-check size([]) /: {}' |
| 9496 | | ], 'ensure bug in size of empty sequence for Z3 fixed'). |
| 9497 | | cli_testcase(2335,[infinite,external],[ |
| 9498 | | '-evalf', '(INTEGER<->id1) /= {} & INTEGER<->id1 : FIN(INTEGER<->id1) & card(INTEGER<->id1) <= 1 & MU(INTEGER<-> id1) /= {x,y | x : INTEGER & y : BOOL & bfalse}', % used to be -evalu |
| 9499 | | '-evalnwd', '(INTEGER<->id1) /= {} & card(INTEGER<->id1) <= 1 & MU(INTEGER<-> id1) /= {x,y | x : INTEGER & y : BOOL & bfalse}', |
| 9500 | | '-opterr', 'eval_string_enum_warning', |
| 9501 | | '-expcterr', 'well_definedness_error' |
| 9502 | | ], 'ensure no representation error due to infinite cardinality'). |
| 9503 | | cli_testcase(2336, [infinite], [ |
| 9504 | | '-evalt', 'INTEGER /= {x}', |
| 9505 | | '-evalf', 'INTEGER = {x}', |
| 9506 | | '-evalt', '{x} /= INTEGER', |
| 9507 | | '-evalt', 'REAL /= {x}', |
| 9508 | | '-evalt', 'FLOAT /= {x}', |
| 9509 | | '-evalt', 'NATURAL /= {x}', |
| 9510 | | '-evalt', 'NATURAL1 /= {x}', |
| 9511 | | '-evalt', 'STRING /= {x}', |
| 9512 | | '-evalt', '{x,y} /= INTEGER', |
| 9513 | | '-evalt', '{x,y} /= REAL', |
| 9514 | | '-evalt', '{x,y,z} /= INTEGER', |
| 9515 | | '-evalt', '{x,y,z} /= INTEGER <=> B=TRUE', |
| 9516 | | '-evalt', '{x,y,z} /= INTEGER <=> B=TRUE & card({x,y,z})=3', |
| 9517 | | '-evalt', '{x|x>1} /= {x}', |
| 9518 | | '-evalt', '{x|x<2} /= {x}', |
| 9519 | | '-evalt', '{x} /= {z|z>100}' |
| 9520 | | %'-evalt', '{x,y,z} /= {z|z>100} <=> B=TRUE' % does not work yet |
| 9521 | | ], 'test not equal with infinite global sets succeed'). |
| 9522 | | cli_testcase(2337, [wd,tickets], [ |
| 9523 | | '-evalt', '{id19,id20|id19 : BOOL & id20 <: INTEGER}(id1) = x' |
| 9524 | | % in principle this is a WD error as the relation is not a function |
| 9525 | | % here this leads to x not being assigned a value as id20 is marked as do_not_enumerate |
| 9526 | | ], 'test no pending co-routines for WD issue'). |
| 9527 | | cli_testcase(2338, [infinite,tickets], [ |
| 9528 | | '-evalf', 'not({1|->2} : INTEGER <->> {2})', |
| 9529 | | '-evalt', '({1|->2} : INTEGER <->> {2})', |
| 9530 | | '-evalt', 'not({1|->2,2|->3} : INTEGER <->> {2})', |
| 9531 | | '-evalt', 'not({1|->3,2|->3} : INTEGER <->> {2,3})', |
| 9532 | | '-evalt', 'not({1|->2,2|->4} : INTEGER <->> {2,3,4})', |
| 9533 | | '-evalf', 'not({1|->4,2|->2} : INTEGER <->> {2,4})', |
| 9534 | | '-evalt', '({1|->4,2|->2} : INTEGER <->> {2,4})', |
| 9535 | | '-evalf', 'not({1|->4,2|->3} : INTEGER <->> 3..4)', |
| 9536 | | '-evalt', '({1|->4,2|->3} : INTEGER <->> 3..4)' |
| 9537 | | ], 'test issue with negation of surjection_relation'). |
| 9538 | | cli_testcase(2339, [infinite,tickets,reals], [ |
| 9539 | | '-evalt', 'not(REAL <<: {})', |
| 9540 | | '-evalt', 'not(FLOAT <<: {})', |
| 9541 | | '-evalt', 'not(FLOAT <<: {1.0})', |
| 9542 | | '-evalt', 'not(REAL <<: {1.0})', |
| 9543 | | '-evalt', 'not(REAL <<: {1.0}) & not( REAL <: {}) & not( REAL <: {1.0})', |
| 9544 | | '-evalf', 'REAL <<: {}', |
| 9545 | | '-evalf', 'REAL <: {}', |
| 9546 | | '-evalf', 'REAL <: {1.0,2.0}', |
| 9547 | | '-evalf', 'FLOAT <: {1.0,2.0}' |
| 9548 | | ], 'test issue with negation of strict subset for reals'). |
| 9549 | | cli_testcase(2340, [laws,reals], ['../prob_examples/public_examples/B/Laws/RealLaws.mch', '-mc', '500', '-nogoal', '-nodead', '-strict'], 'Some Laws about the REAL datatype'). |
| 9550 | | cli_testcase(2341, [laws,reals,strings], ['../prob_examples/public_examples/B/Laws/SetRelLaws_RecRealString.mch', '-mc', '500', '-nogoal', '-nodead','-expcterr', 'model_check_incomplete'], 'Some Laws using both STRING and REAL datatype'). |
| 9551 | | cli_testcase(2342, [tickets,records], [ |
| 9552 | | '-eval', 'rec(a:1,a:2) = rec(a:1)', |
| 9553 | | '-expcterr', 'type_expression_error' |
| 9554 | | ], 'test duplicate record field with same type detected'). |
| 9555 | | cli_testcase(2343, [b_test,refinement],['../prob_examples/public_examples/B/RefinementChecking/Simple/ifabc1.mch', '-init', '-ref_check','F', '../prob_examples/public_examples/B/RefinementChecking/Simple/ifabc2_refine_spec.P'], 'Test failure trace refinement checking for B.'). |
| 9556 | | cli_testcase(2344, [b_test,refinement],['../prob_examples/public_examples/B/RefinementChecking/Simple/ifabc2.mch', '-init', '-ref_check', 'F', '../prob_examples/public_examples/B/RefinementChecking/Simple/ifabc1_refine_spec.P', |
| 9557 | | '-expcterr', 'refinement_check_fails'], 'Test failure trace refinement checking for B finds counter example.'). |
| 9558 | | cli_testcase(2345, [cbc,json_trace_replay],['../prob_examples/public_examples/B/PerformanceTests/SAT_Tests/IceCream_Generic.mch', |
| 9559 | | '-trace_replay', 'json', '../prob_examples//public_examples/B/PerformanceTests/SAT_Tests/IceCream_Generic.prob2trace'], |
| 9560 | | 'Test example is now solved without SMT mode.'). |
| 9561 | | cli_testcase(2346, [cbc],['../prob_examples/examples/EventBPrologPackages/Stock/concreteTrace_ctx.eventb', |
| 9562 | | '-init'], |
| 9563 | | 'Test propagation of empty total function range to relation'). |
| 9564 | | cli_testcase(2347, [cbc,random],['../prob_examples/public_examples/B/Mathematical/Info4/TuringMachine_Cook_SAT.mch', |
| 9565 | | '-evalt', ':prob #Alphabet.(1:Alphabet)', % and check existential quantifier with clash not removed |
| 9566 | | '-evalt', '#Alphabet.(1:Alphabet)', % ditto |
| 9567 | | '-evalt', ':prob #Alphabet.(I/:Alphabet)', % ditto |
| 9568 | | '-evalf', '!x.(x : POW(Alphabet) => card(x) = 3)', % ditto |
| 9569 | | '-init'], |
| 9570 | | 'Test SAT-style encoding of Cook of TM works'). |
| 9571 | | cli_testcase(2348, [tickets,records], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9572 | | '-evalf', '{x,y,z,v,w,a} <: 1..3 & {x|->y,x|->z,v|->z,v|->w,a|->w,w|->a} /\\ {z|->y,z|->v,y|->x,w|->x,w|->z,a|->z,a|->y,w|->y,a|->x,v|->y} = {}', |
| 9573 | | '-evalt', '{x,y,z,v,w,a} <: 1..150 & {x|->y,x|->z,v|->z,v|->w,a|->w,w|->a} /\\ {z|->y,z|->v,y|->x,w|->x,w|->z,a|->z,a|->y,w|->y,a|->x,v|->y} = {}', |
| 9574 | | '-evalt', '{x,y,z,v,w,a} <: 1..3 & {x|->y,x|->z,v|->z,v|->w,a|->w,w|->a} /\\ {z|->y,z|->v,y|->x,w|->x,w|->z,a|->z,a|->y,w|->y,a|->x} = {}' |
| 9575 | | ], 'Test expansion of disjointness of set extensions'). |
| 9576 | | cli_testcase(2349, [csp_test], [ |
| 9577 | | '../prob_examples/public_examples/CSP/other/Kleine/needham-schroeder.csp', '-assertions'], |
| 9578 | | 'Test no call residues due to ignore_infinite_datatypes kludge.'). |
| 9579 | | cli_testcase(2350, [tickets,external], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9580 | | '-evalt', 'e_ne : {rec(Id:{"ne_1717"}),rec(Id:{"ne_102"})} & MU(e_ne\'Id) = "ne_1717" & i_e = "sig1725" & {iC1,iC2} <: ({"ne_1717" |->{("ic1"|->0.0),("ic2"|->0.167),("ic3"|->1.0)}})(MU(e_ne\'Id))~ & prj1(iC1) <= 0.2 & 0.2 < prj1(iC2) & {(0.0|->"ic1"|->1),(0.167|->"ic2"|->2),(1.0|->"ic3"|->3)}(iC1) = pred({(0.0|->"ic1"|->1),(0.167|->"ic2"|->2),(1.0|->"ic3"|->3)}(iC2))', % used to fail |
| 9581 | | '-evalt', 'e_ne : {rec(Id:{"ne_1717"}),rec(Id:{"ne_102"})} & MU(e_ne\'Id) = "ne_1717" & i_e = "sig1725" & {iC1,iC2} <: ({"ne_1717" |->{("ic1"|->0.0),("ic2"|->0.167),("ic3"|->1.0)}})(MU(e_ne\'Id))~ & prj1(iC1) <= 0.2 & 0.2 < prj1(iC2) & {(0.0|->"ic1"|->1),(0.167|->"ic2"|->2),(1.0|->"ic3"|->3)}(iC1) = pred({(0.0|->"ic1"|->1),(0.167|->"ic2"|->2),(1.0|->"ic3"|->3)}(iC2)) & iC1 = (0.167|->"ic2")', % was ok |
| 9582 | | '-evalt', 'e_ne : {rec(Id:{"ne_1717"}),rec(Id:{"ne_102"})} & MU(e_ne\'Id) = "ne_1717" & i_e = "sig1725" & {iC1,iC2} <: ({"ne_1717" |->{("ic1"|->0.0),("ic2"|->0.167),("ic3"|->1.0)}})(MU(e_ne\'Id))~ & prj1(iC1) <= 0.2 & 0.2 < prj1(iC2) & {(0.0|->"ic1"|->1),(0.167|->"ic2"|->2)}(iC1) = pred({(0.167|->"ic2"|->2),(1.0|->"ic3"|->3)}(iC2))', % used to fail |
| 9583 | | '-evalt', 'e_ne : {rec(Id:{"ne_1717"}),rec(Id:{"ne_102"})} & MU(e_ne\'Id) = "ne_1717" & i_e = "sig1725" & {iC1,iC2} <: ({"ne_1717" |->{("ne_1717_aps01_ic1"|->0),("ne_1717_aps01_ic2"|->1),("ne_1717_aps01_ic3"|->10)}})(MU(e_ne\'Id))~ & prj1(iC1) <= 2 & 2 < prj1(iC2) & {(0|->"ne_1717_aps01_ic1"|->1),(1|->"ne_1717_aps01_ic2"|->2),(10|->"ne_1717_aps01_ic3"|->3)}(iC1) = pred({(0|->"ne_1717_aps01_ic1"|->1),(1|->"ne_1717_aps01_ic2"|->2),(10|->"ne_1717_aps01_ic3"|->3)}(iC2)) & e_sloc = ("ne_1717"|->2)' |
| 9584 | | ], |
| 9585 | | 'Test equality reification for floating numbers fixed.'). |
| 9586 | | cli_testcase(2351, [b_test,records], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9587 | | '-p', 'CLPFD', 'FALSE', % ensure fast without CLPFD propagations |
| 9588 | | '-evalt', ':prob n=10000 & s=UNION(x).(x:1..n|{rec(f1:x,f2:x+1)}) & !y,z.(y:2..n & rec(f1:y,f2:z):s => z>2)', % used to take 12 secs |
| 9589 | | '-evalt', ':prob n=10000 & s=UNION(x).(x:1..n|{rec(f1:x,f2:x+1)}) & !y,r.(y:2..n & r\'f1=y & r:s => r\'f2>2)' |
| 9590 | | ], 'Test performance of looking up records'). |
| 9591 | | cli_testcase(2352, [smt_solver_integration], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9592 | | % see smt_solvers_interface/ast_cleanup_for_smt.pl and smt_solvers_interface/set_rewriter.pl |
| 9593 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) < 3', |
| 9594 | | '-evalt', ':z3-double-check x:INTEGER & 3 > card({x,y,z})', |
| 9595 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) <= 2', |
| 9596 | | '-evalt', ':z3-double-check x:INTEGER & 2 >= card({x,y,z})', |
| 9597 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) < 4', |
| 9598 | | '-evalt', ':z3-double-check x:INTEGER & 4 > card({x,y,z})', |
| 9599 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) <= 4', |
| 9600 | | '-evalt', ':z3-double-check x:INTEGER & 4 >= card({x,y,z})', |
| 9601 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) <= 3', |
| 9602 | | '-evalt', ':z3-double-check x:INTEGER & 3 >= card({x,y,z})', |
| 9603 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) >= 3', |
| 9604 | | '-evalt', ':z3-double-check x:INTEGER & 3 >= card({x,y,z})', |
| 9605 | | '-evalf', ':z3-double-check x:INTEGER & card({x,y,z}) > 3', |
| 9606 | | '-evalf', ':z3-double-check x:INTEGER & 3 < card({x,y,z})', |
| 9607 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) > 2', |
| 9608 | | '-evalt', ':z3-double-check x:INTEGER & 2 < card({x,y,z})', |
| 9609 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) >= 1', |
| 9610 | | '-evalt', ':z3-double-check x:INTEGER & 1 <= card({x,y,z})', |
| 9611 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y}) = 1', |
| 9612 | | '-evalt', ':z3-double-check x:INTEGER & 1 = card({x,y})', |
| 9613 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y}) /= 1', |
| 9614 | | '-evalt', ':z3-double-check x:INTEGER & 1 /= card({x,y})', |
| 9615 | | '-evalf', ':z3-double-check x:INTEGER & card({x,y,z}) = 0', |
| 9616 | | '-evalf', ':z3-double-check x:INTEGER & 0 = card({x,y,z})', |
| 9617 | | '-evalt', ':z3-double-check x:INTEGER & card({x,y,z}) = 3', |
| 9618 | | '-evalt', ':z3-double-check x:INTEGER & 3 = card({x,y,z})', |
| 9619 | | '-evalf', ':z3-double-check x:INTEGER & card({x,y,z}) = 0', |
| 9620 | | '-evalf', ':z3-double-check x:INTEGER & card({x,y,z}) >= 4', |
| 9621 | | '-evalf', ':z3-double-check x:INTEGER & 4 <= card({x,y,z})', |
| 9622 | | '-evalf', ':z3-double-check x:INTEGER & 0 = card({x,y,z})', |
| 9623 | | '-evalt', ':z3-double-check x:POW(INTEGER) & card(x) = 0', % these rules also work for sets that are not statically finite |
| 9624 | | '-evalt', ':z3-double-check x:POW(INTEGER) & 0 = card(x)', |
| 9625 | | '-evalt', ':z3-double-check x:POW(INTEGER) & card(x) /= 0', |
| 9626 | | '-evalt', ':z3-double-check x:POW(INTEGER) & 0 /= card(x)', |
| 9627 | | '-evalt', ':z3-double-check x:POW(INTEGER) & card(x) > 0', |
| 9628 | | '-evalt', ':z3-double-check x:POW(INTEGER) & 0 < card(x)' |
| 9629 | | ], 'Test rewriting of cardinality constraints using finite sets for Z3.'). |
| 9630 | | cli_testcase(2353, [b_test,external,records,rulesdsl,xml], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9631 | | '../prob_examples/examples/Rules/RailML_Simple/RailML3_IS.rmch', |
| 9632 | | '-execute_all', '-execute_expect_steps', 86, |
| 9633 | | '-evalt', 'RailML3_IS_NETWORK_IDS={"nw01"} & card(RailML_spotLocation)=41 & card(RailML_signalIS)=13 & card(RailML_netRelation)=13', |
| 9634 | | '-evalt', 'card(warnings_linearLocation_Counterexamples)=72 & warnings_level_Counterexamples={}', |
| 9635 | | '-evalt', 'card(warnings_spotLocation_Counterexamples)=41 & warnings_netRelation_Counterexamples={}', |
| 9636 | | '-evalt', 'TEST /= {}' |
| 9637 | | ], 'Test avl indexed lookup for complex records with set field values works'). |
| 9638 | | cli_testcase(2354, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9639 | | '-p', 'SOLVER_STRENGTH', 10, % will force attempt_reification |
| 9640 | | '-evalt', ':prob n=2000 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE =>f(i-1)=FALSE)) & f(1)=TRUE' |
| 9641 | | ], 'Test performance wrt reification'). |
| 9642 | | cli_testcase(2355, [satsolver_test], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9643 | | '-evalt', ':sat-double-check x=TRUE or x=FALSE', |
| 9644 | | '-evalf', ':sat-double-check x=TRUE & x=FALSE', |
| 9645 | | '-evalt', ':sat-double-check x=TRUE & (x=TRUE => y=TRUE) & (y=TRUE => x=TRUE)', |
| 9646 | | '-evalf', ':sat-double-check x=TRUE & (x=TRUE => y=TRUE) & (y=TRUE => x=FALSE)', |
| 9647 | | '-evalt', ':sat-double-check x=TRUE & (x=TRUE <=> y=TRUE) & (y=TRUE <=> z=TRUE)', |
| 9648 | | '-evalt', ':sat-double-check n=12 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE =>f(i-1)=FALSE)) & f(1)=TRUE', |
| 9649 | | '-evalt', ':sat-double-check n=12 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE =>f(i-1)=FALSE)) & f(1)=TRUE & f(12)=TRUE', |
| 9650 | | '-evalf', ':sat-double-check n=12 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE <=>f(i-1)=FALSE)) & f(1)=TRUE & f(12)=TRUE', |
| 9651 | | '-evalt', ':sat-double-check n=12 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})=1', |
| 9652 | | '-evalf', ':sat-double-check n=12 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})=1 & card({i|i:1..n & f(i)=FALSE})=1', |
| 9653 | | '-evalt', ':sat-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})>2 & card({i|i:1..n & f(i)=FALSE})>2', |
| 9654 | | '-evalf', ':sat-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})>3 & card({i|i:1..n & f(i)=FALSE})>2', |
| 9655 | | '-evalt', ':sat-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})<4 & card({i|i:1..n & f(i)=FALSE})<4', |
| 9656 | | '-evalf', ':sat-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})<3 & card({i|i:1..n & f(i)=FALSE})<4', |
| 9657 | | '-evalt', ':sat-double-check f:1..3-->BOOL & card({y|y:1..3 & f(y)=TRUE}) <=2 &f(1)=TRUE & f(3)=TRUE', |
| 9658 | | '-evalf', ':sat-double-check f:1..3-->BOOL & card({y|y:1..3 & f(y)=TRUE}) <=2 &f(1)=TRUE & f(3)=TRUE & f(2)=TRUE', |
| 9659 | | '-evalf', ':sat-double-check f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) <=6 &f(1)=TRUE & f(3)=TRUE & !i.(i:1..10 => (f(i)=FALSE => f(i*10)=TRUE))', |
| 9660 | | '-evalt', ':sat-double-check f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) <=10 &f(1)=TRUE & f(3)=TRUE & !i.(i:1..10 => (f(i)=FALSE => f(i*10)=TRUE))', |
| 9661 | | '-evalf', ':sat f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) >=20 & card({y|y:1..100 & f(y)=TRUE}) <=19', % ProB times out here |
| 9662 | | '-evalt', ':sat-double-check f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) >=20 & card({y|y:1..100 & f(y)=TRUE}) <=20', |
| 9663 | | '-evalt', ':sat-double-check n=3 & f:1..n-->BOOL & f(1)=TRUE & card({i|i:1..n & (f(i)=TRUE or i=2)})=2', |
| 9664 | | '-evalf', ':sat-double-check n=3 & f:1..n-->BOOL & f(1)=TRUE & card({i|i:1..n & (f(i)=TRUE or i=2)})=1', |
| 9665 | | '-evalt', ':sat-double-check f:1..n --> BOOL & n=50 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1))', |
| 9666 | | '-evalf', ':sat-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=1)})=3', |
| 9667 | | '-evalf', ':sat-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=1)})=1', |
| 9668 | | '-evalt', ':sat-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=1)})=2', |
| 9669 | | '-evalf', ':sat-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=2)})=2', |
| 9670 | | '-evalt', ':sat-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=2)})=3' |
| 9671 | | ], 'Test new satsolver backend.'). |
| 9672 | | cli_testcase(2356, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9673 | | '../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/ABZ16_m6.eventb', '-init', |
| 9674 | | '-p', 'TIME_OUT', '60000', |
| 9675 | | '-eval', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_0.eval', |
| 9676 | | '-eval', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_1.eval', |
| 9677 | | '-eval', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_2.eval', |
| 9678 | | '-eval', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_3.eval', |
| 9679 | | '-eval', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_1.eval', |
| 9680 | | '-eval', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/ABZ16_m6/m6_monolithic_bmc_k_2.eval' |
| 9681 | | ], 'Double check integration of Z3 for BMC constraints of ABZ16_m6 containing unfixed deferred sets'). |
| 9682 | | cli_testcase(2357,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9683 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 20000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 9684 | | '../private_examples/ClearSy/2023/error_0720/rule_CHAMPS_COMMUNS_AUX_FICHIERS_MCMDOUVERTUREITIAU_RVF65_MCMD_FOLIO.mch', |
| 9685 | | '-execute_all', '-execute_expect_steps', 15, %'-silent', |
| 9686 | | '-animate_stats', |
| 9687 | | '-evalt', 'card(caval__rule__12__ALL)=8', |
| 9688 | | '-evalt', 'caval__rule__1__ALL={({}|->{109}|->{}|->TRUE)}', |
| 9689 | | '-evalt', 'caval__rule__10__ALL={} & caval__rule__11__ALL={}', |
| 9690 | | '-evalt', 'caval__rule__2__ALL={} & caval__rule__5__ALL={} & caval__rule__6__ALL={}', |
| 9691 | | '-evalt', 'caval__rule__13__done=TRUE' |
| 9692 | | ], 'Issue used_ids field wrong fro memoization closure leading to identifier not found error'). % fixed in c5e3cd063a89b7b6d3c8c255ec6517ee76981415 |
| 9693 | | cli_testcase(2358,[private,regex],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'PROB_SAFE_MODE', 'TRUE', |
| 9694 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 20000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 9695 | | '../prob_examples/examples/B/ClearSy/Caval/2023/error_0720/rule_RVF65_bugly.mch', |
| 9696 | | '-execute_all', '-execute_expect_steps', 15, %'-silent', |
| 9697 | | '-animate_stats', |
| 9698 | | '-evalt', 'card(aahm)=16', |
| 9699 | | '-evalt', 'aajl={({}|->{109}|->{}|->TRUE)}', |
| 9700 | | '-evalt', 'aarl={} & aatl={}', |
| 9701 | | '-evalt', 'aall={} & aahl={} & aadm={}', |
| 9702 | | '-evalt', 'aaam=TRUE' |
| 9703 | | ], 'Bugly version of test 2357'). % not sure the original error also occurs with this model |
| 9704 | | cli_testcase(2359,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9705 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 20000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 9706 | | '../private_examples/ClearSy/2023/Machines_0731/rule_OPS_SDS_4537/rule.mch', |
| 9707 | | '-execute_all', '-execute_expect_steps', 3, %'-silent', |
| 9708 | | '-animate_stats', |
| 9709 | | '-evalt', 'caval__rule__1__ALL={} & caval__Compute_Variables_CounterExamples={}', |
| 9710 | | '-evalt', 'caval__rule__1__done=TRUE' |
| 9711 | | ], 'Test no virtual time-out (ZC_PROP_1 in UNION used only in one disjunct)'). |
| 9712 | | % in principle a virtual time-out is ok as ZC_PROP_1 has infinitely many values, but is not used in result of UNION |
| 9713 | | cli_testcase(2360, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/Clashes/DefParaClash.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Ensure no internal error'). |
| 9714 | | cli_testcase(2361,[private,data_validation,external,regex],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9715 | | '-p', 'TIME_OUT', 2000, '-p', 'DATA_VALIDATION', 'TRUE', '-animate_all', |
| 9716 | | '../prob_examples/examples/B/ClearSy/Caval/2023/perf_0810/RVF354_MDYS_op1.mch', |
| 9717 | | '-evalt', 'card(rule_check_1)=1108 & rule_done_1=TRUE' |
| 9718 | | ], 'Test Caval prob-users example works fast'). % was still slow with 1.12.1, fast since 6796bf80d653dbdfa2f88a30980158c82af0a5ec |
| 9719 | | cli_testcase(2362,[private,data_validation,external,regex],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9720 | | '-p', 'TIME_OUT', 2000, '-p', 'DATA_VALIDATION', 'TRUE', '-animate_all', |
| 9721 | | '../prob_examples/examples/B/ClearSy/Caval/2023/perf_0810/RVF354_MDYS_op2.mch', |
| 9722 | | '-evalt', 'card(rule_check_2)=1108 & rule_done_2=TRUE' |
| 9723 | | ], 'Test Caval prob-users example works fast'). % ditto, was still slow with 1.12.1 |
| 9724 | | cli_testcase(2363, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'FALSE', |
| 9725 | | '../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching.mch', '-init', |
| 9726 | | '-p', 'TIME_OUT', '60000', |
| 9727 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 9728 | | '-evalt', ':cdclt-double-check -ct <= -2 & ct <= 33554432', |
| 9729 | | '-evalt', ':cdclt-double-check -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432', |
| 9730 | | '-evalt', ':cdclt-double-check -ct <= -2 & -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432 & ct__ <= 0 & not(-ct__ <= -33554432)', |
| 9731 | | '-evalf', ':cdclt-double-check ct <= 2 & -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432 & ct__ <= 0 & not(-ct__ <= -33554432) & ct__ <= 33554432', |
| 9732 | | '-evalf', ':cdclt-double-check lim <= 33554432 & -lim <= -33554432 & ct <= 2 & -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432 & ct__ <= 0 & not(-ct__ <= -33554432) & ct__ <= 33554432', |
| 9733 | | '-evalt', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/core_bug.eval', |
| 9734 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 9735 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 9736 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 9737 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval', |
| 9738 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_4.eval', |
| 9739 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_5.eval', |
| 9740 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_6.eval', |
| 9741 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_7.eval', |
| 9742 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_8.eval', |
| 9743 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_9.eval', |
| 9744 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_10.eval', % sometimes times out on Windows |
| 9745 | | '-evalt', ':cdclt-free-double-check -ct <= -2 & ct <= 33554432', |
| 9746 | | '-evalt', ':cdclt-free-double-check -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432', |
| 9747 | | '-evalt', ':cdclt-free-double-check -ct <= -2 & -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432 & ct__ <= 0 & not(-ct__ <= -33554432)', |
| 9748 | | '-evalt', ':cdclt-free-double-check ct <= 2 & -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432 & ct__ <= 0 & not(-ct__ <= -33554432) & ct__ <= 33554432', |
| 9749 | | '-evalt', ':cdclt-free-double-check lim <= 33554432 & -lim <= -33554432 & ct <= 2 & -ct <= -2 & not(-ct <= -33554432) & ct <= 33554432 & ct__ <= 0 & not(-ct__ <= -33554432) & ct__ <= 33554432', |
| 9750 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/core_bug.eval', |
| 9751 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_0.eval', |
| 9752 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_1.eval', |
| 9753 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_2.eval', |
| 9754 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_3.eval', |
| 9755 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_4.eval', |
| 9756 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_5.eval', |
| 9757 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_6.eval', |
| 9758 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_7.eval', |
| 9759 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_8.eval', |
| 9760 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_9.eval', |
| 9761 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_10.eval', |
| 9762 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_11.eval', |
| 9763 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_12.eval', |
| 9764 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_13.eval', |
| 9765 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_14.eval', |
| 9766 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_15.eval', |
| 9767 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_16.eval', |
| 9768 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_17.eval', |
| 9769 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_18.eval', |
| 9770 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_19.eval', |
| 9771 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_20.eval', |
| 9772 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_21.eval', |
| 9773 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_22.eval', |
| 9774 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_23.eval', |
| 9775 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_24.eval', |
| 9776 | | '-evalt', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/LargeBranching/LargeBranching_monolithic_bmc_k_25.eval' |
| 9777 | | ], 'Double check CDCL(T) using the additional IDL solver similar to test 2166.'). |
| 9778 | | cli_testcase(2364, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9779 | | '-evalt', ':idl x:INTEGER & x>y', |
| 9780 | | '-evalf', ':idl x:INTEGER & x>y & y>x', |
| 9781 | | '-evalt', ':idl x:INTEGER & x=1', |
| 9782 | | '-evalf', ':idl x:INTEGER & x<3 & x>3', |
| 9783 | | '-evalf', ':idl x:INTEGER & x<3 & x-1>3', |
| 9784 | | '-evalt', ':idl x:INTEGER & x<3 & y<4', |
| 9785 | | '-evalt', ':idl x:INTEGER & x<3 & y-2>4', |
| 9786 | | '-evalt', ':idl x:INTEGER & x<3 & y-2<4', |
| 9787 | | '-evalf', ':idl x:INTEGER & x<3-2 & x-2>(-1)', |
| 9788 | | '-evalt', ':idl x:INTEGER & x+y<x+2', |
| 9789 | | '-evalt', ':idl x:INTEGER & x-y<=2 & y-z<=1 & z-x<=-1', |
| 9790 | | '-evalf', ':idl x:INTEGER & x-y<=2 & y-z<=1 & z-x<=-4', |
| 9791 | | '-evalf', ':idl x:INTEGER & x<y+3 & y<=z+2 & z<x-4', |
| 9792 | | '-evalf', ':idl x:INTEGER & x<=z-6 & x<=w-3 & y<=x+3 & z<=y+2 & z<=w-1 & w<=y+5', |
| 9793 | | '-evalt', ':idl x:INTEGER & x<=z-5 & x<=w-3 & y<=x+3 & z<=y+2 & z<=w-1 & w<=y+5', |
| 9794 | | '-evalf', ':idl x:INTEGER & x<=z-5 & x<=w-3 & y<=x+3 & z=y+2 & z=w-1 & w=y+5', |
| 9795 | | '-evalt', ':idl x:INTEGER & x=w-3 & y=x+3 & z=y+2' |
| 9796 | | ], 'Simple tests for the graph-based solver for the IDL.'). |
| 9797 | | cli_testcase(2365, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9798 | | '-p', 'TIME_OUT', '60000', |
| 9799 | | '-p', 'maxNrOfInitialisations', '1', |
| 9800 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/PM_M1_VOOR.eventb', '-init', |
| 9801 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 9802 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 9803 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 9804 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_0.eval', |
| 9805 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_2.eval', |
| 9806 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 9807 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 9808 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 9809 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 9810 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 9811 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval', |
| 9812 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_0.eval', |
| 9813 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_1.eval', |
| 9814 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 9815 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 9816 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 9817 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 9818 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 9819 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval' |
| 9820 | | ], 'Double check CDCL(T) using the additional IDL solver for constraints from inductive invariant checking of a pacemaker model.'). |
| 9821 | | cli_testcase(2366, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9822 | | '-p', 'TIME_OUT', '60000', |
| 9823 | | '-p', 'maxNrOfInitialisations', '1', |
| 9824 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/PM_M1_VOOR.eventb', '-init', |
| 9825 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 9826 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 9827 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 9828 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_0.eval', |
| 9829 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_2.eval', |
| 9830 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 9831 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 9832 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 9833 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 9834 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 9835 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval', |
| 9836 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_0.eval', |
| 9837 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_1.eval', |
| 9838 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 9839 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 9840 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 9841 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 9842 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 9843 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval' |
| 9844 | | ], 'Double check CDCL(T) using the additional IDL solver as in test 2365 but without the additional static analysis.'). |
| 9845 | | cli_testcase(2367, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9846 | | '-p', 'TIME_OUT', '60000', |
| 9847 | | '-p', 'maxNrOfInitialisations', '1', |
| 9848 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/PM_M0_VOO.eventb', '-init', |
| 9849 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 9850 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 9851 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 9852 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_0.eval', |
| 9853 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_1.eval', |
| 9854 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_2.eval', |
| 9855 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_3.eval', |
| 9856 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_4.eval', |
| 9857 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_5.eval', |
| 9858 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_6.eval', |
| 9859 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_7.eval', |
| 9860 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_0.eval', |
| 9861 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_1.eval' |
| 9862 | | %'-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_2.eval' % sometimes times out on Windows |
| 9863 | | ], 'Double check CDCL(T) using the additional IDL solver for constraints from bounded model checking of a pacemaker model.'). |
| 9864 | | cli_testcase(2368, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9865 | | '-p', 'TIME_OUT', '60000', |
| 9866 | | '-p', 'maxNrOfInitialisations', '1', |
| 9867 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/PM_M0_VOO.eventb', '-init', |
| 9868 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 9869 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 9870 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 9871 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_0.eval', |
| 9872 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_1.eval', |
| 9873 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_2.eval', |
| 9874 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_3.eval', |
| 9875 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_4.eval', |
| 9876 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_5.eval', |
| 9877 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_6.eval', |
| 9878 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_7.eval', |
| 9879 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_0.eval', |
| 9880 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_1.eval', |
| 9881 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_2.eval' |
| 9882 | | ], 'Double check CDCL(T) using the additional IDL solver as in test 2367 but without the additional static analysis.'). |
| 9883 | | cli_testcase(2369, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9884 | | '-p', 'TIME_OUT', '60000', |
| 9885 | | '-p', 'maxNrOfInitialisations', '1', |
| 9886 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/PM_M3_AAI.eventb', '-init', |
| 9887 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 9888 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 9889 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 9890 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_0.eval', |
| 9891 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_1.eval', |
| 9892 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_2.eval', |
| 9893 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_3.eval', |
| 9894 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_4.eval', |
| 9895 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_5.eval', |
| 9896 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_6.eval', |
| 9897 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_7.eval', |
| 9898 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_0.eval', |
| 9899 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_1.eval', |
| 9900 | | '-evalf', ':cdclt-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_2.eval' % cannot be solved by ProB in time |
| 9901 | | %'-evalf', ':cdclt-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_3.eval' % |
| 9902 | | ], 'Double check CDCL(T) using the additional IDL solver for constraints from bounded model checking of a pacemaker model.'). |
| 9903 | | cli_testcase(2370, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9904 | | '-p', 'TIME_OUT', '60000', |
| 9905 | | '-p', 'maxNrOfInitialisations', '1', |
| 9906 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/PM_M3_AAI.eventb', '-init', |
| 9907 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 9908 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 9909 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 9910 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_0.eval', |
| 9911 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_1.eval', |
| 9912 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_2.eval', |
| 9913 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_3.eval', |
| 9914 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_4.eval', |
| 9915 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_5.eval', |
| 9916 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_6.eval', |
| 9917 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_7.eval', |
| 9918 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_0.eval', |
| 9919 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_1.eval', |
| 9920 | | '-evalf', ':cdclt-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_2.eval' % cannot be solved by ProB in time |
| 9921 | | %'-evalf', ':cdclt-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_3.eval' % sometimes times out on Windows |
| 9922 | | ], 'Double check CDCL(T) using the additional IDL solver as in test 2369 but without the additional static analysis.'). |
| 9923 | | cli_testcase(2371, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9924 | | '-p', 'TIME_OUT', '60000', |
| 9925 | | '-p', 'maxNrOfInitialisations', '1', |
| 9926 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/PM_M1_VOOR.eventb', '-init', |
| 9927 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_0.eval', |
| 9928 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_2.eval', |
| 9929 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 9930 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 9931 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 9932 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 9933 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 9934 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval', |
| 9935 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_0.eval', |
| 9936 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_monolithic_bmc_k_1.eval', |
| 9937 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Acler_sensed.eval', |
| 9938 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_OFF.eval', |
| 9939 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Pace_ON.eval', |
| 9940 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Decrease_Interval.eval', |
| 9941 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_Increase_Interval.eval', |
| 9942 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M1_VOOR/M1_VOOR_tic.eval' |
| 9943 | | ], 'Double check Z3 using constraints from inductive invariant checking of a pacemaker.'). |
| 9944 | | cli_testcase(2372, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9945 | | '-p', 'TIME_OUT', '60000', |
| 9946 | | '-p', 'maxNrOfInitialisations', '1', |
| 9947 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/PM_M0_VOO.eventb', '-init', |
| 9948 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_0.eval', |
| 9949 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_1.eval', |
| 9950 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_2.eval', |
| 9951 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_3.eval', |
| 9952 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_4.eval', |
| 9953 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_5.eval', |
| 9954 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_6.eval', |
| 9955 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_7.eval', |
| 9956 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_0.eval', |
| 9957 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_1.eval', |
| 9958 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_2.eval', |
| 9959 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_3.eval', % cannot be solved by ProB in time |
| 9960 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_4.eval', % |
| 9961 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_5.eval', % |
| 9962 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_6.eval', % |
| 9963 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M0_VOO/M0_VOO_monolithic_bmc_k_7.eval' % |
| 9964 | | ], 'Double check Z3 using constraints from boundel model checking of a pacemaker.'). |
| 9965 | | cli_testcase(2373, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9966 | | '-p', 'TIME_OUT', '60000', |
| 9967 | | '-p', 'maxNrOfInitialisations', '1', |
| 9968 | | '../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/PM_M3_AAI.eventb', '-init', |
| 9969 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_0.eval', |
| 9970 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_1.eval', |
| 9971 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_2.eval', |
| 9972 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_3.eval', |
| 9973 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_4.eval', |
| 9974 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_5.eval', |
| 9975 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_6.eval', |
| 9976 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_7.eval', |
| 9977 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_0.eval', |
| 9978 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_1.eval', |
| 9979 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_2.eval', % cannot be solved by ProB in time |
| 9980 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_3.eval', % |
| 9981 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_4.eval', % |
| 9982 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_5.eval', % |
| 9983 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_6.eval', % |
| 9984 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/PM_M3_AAI/M3_AAI_monolithic_bmc_k_7.eval' % |
| 9985 | | ], 'Double check Z3 using constraints from boundel model checking of a pacemaker refinement used in test 2372.'). |
| 9986 | | cli_testcase(2374, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 9987 | | '-p', 'TIME_OUT', '60000', |
| 9988 | | '../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot.mch', '-init', |
| 9989 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 9990 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 9991 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 9992 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval', |
| 9993 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_2.eval', |
| 9994 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_3.eval', |
| 9995 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_4.eval', |
| 9996 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_5.eval', |
| 9997 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_6.eval', |
| 9998 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_7.eval', |
| 9999 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_8.eval', |
| 10000 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_9.eval', |
| 10001 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_10.eval', % sometimes times out on Windows |
| 10002 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 10003 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval' |
| 10004 | | ], 'Double check CDCL(T) for constraints from bounded model checking of a lightbot model.'). |
| 10005 | | cli_testcase(2375, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10006 | | '-p', 'TIME_OUT', '60000', |
| 10007 | | '../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot.mch', '-init', |
| 10008 | | '-p', 'cdclt_perform_static_analysis', 'false', |
| 10009 | | '-p', 'cdclt_perform_symmetry_breaking', 'false', |
| 10010 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 10011 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval', |
| 10012 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_2.eval', |
| 10013 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_3.eval', |
| 10014 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_4.eval', |
| 10015 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_5.eval', |
| 10016 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_6.eval', |
| 10017 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_7.eval', |
| 10018 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_8.eval', |
| 10019 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_9.eval', |
| 10020 | | %'-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_10.eval', % sometimes times out on Windows |
| 10021 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 10022 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval' |
| 10023 | | ], 'Double check CDCL(T) for the same constraints used in test 2374 but without the additional static analysis.'). |
| 10024 | | cli_testcase(2376, [cdclt], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10025 | | '-p', 'TIME_OUT', '60000', |
| 10026 | | '../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot.mch', '-init', |
| 10027 | | '-p', 'cdclt_use_idl_theory_solver', 'true', |
| 10028 | | '-p', 'cdclt_perform_static_analysis', 'true', |
| 10029 | | '-p', 'cdclt_perform_symmetry_breaking', 'true', |
| 10030 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 10031 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval', |
| 10032 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_2.eval', |
| 10033 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_3.eval', |
| 10034 | | '-evalf', ':cdclt-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_4.eval', |
| 10035 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 10036 | | '-evalf', ':cdclt-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval' |
| 10037 | | ], 'Double check CDCL(T) for the same constraints used in test 2374 but using the additional IDL solver.'). |
| 10038 | | cli_testcase(2377, [smt_solver_integration], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10039 | | '-p', 'TIME_OUT', '60000', |
| 10040 | | '../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot.mch', '-init', |
| 10041 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 10042 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval', |
| 10043 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_2.eval', |
| 10044 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_3.eval', |
| 10045 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_4.eval', |
| 10046 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_5.eval', |
| 10047 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_6.eval', |
| 10048 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_7.eval', |
| 10049 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_8.eval', |
| 10050 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_9.eval', |
| 10051 | | '-evalf', ':z3-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_10.eval', |
| 10052 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_0.eval', |
| 10053 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_1.eval', |
| 10054 | | '-evalf', ':z3-free-double-check #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_2.eval', |
| 10055 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_3.eval', % cannot be solved by ProB in time |
| 10056 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_4.eval', % |
| 10057 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_5.eval', % |
| 10058 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_6.eval', % |
| 10059 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_7.eval', % |
| 10060 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_8.eval', % |
| 10061 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_9.eval', % |
| 10062 | | '-evalf', ':z3-free #file ../prob_examples/public_examples/B/SmtSolverTests/Lightbot/Lightbot_monolithic_bmc_k_10.eval' |
| 10063 | | ], 'Double check Z3 for constraints from bounded model checking of a lightbot model.'). |
| 10064 | | |
| 10065 | | cli_testcase(2378, [setlog], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10066 | | '-evalt', ':slog-double-check f:1..3 --> 1..3 & card(ran(f))=3 & f(1)>1', |
| 10067 | | '-evalt', ':slog-double-check f:INTEGER+->INTEGER & dom(f)=1..2 & dom(f)/=1..1 & f/={}', |
| 10068 | | '-evalt', ':slog-double-check f:INTEGER+->INTEGER & dom(f)=1..2 & dom(f)/=1..1 & f/={} & ran(f)=1..2', |
| 10069 | | '-evalt', ':slog-double-check f:INTEGER+->INTEGER & dom(f)<:1..2 & dom(f)/=1..1 & dom(f)/={}', |
| 10070 | | '-evalt', ':slog-double-check a<:1..3 & (2:a <=> 3:a) & (2:a <=> 1/:a) & a /\\ 1..1 = {}', |
| 10071 | | '-evalf', ':slog-double-check ff:1..3<->BOOL & gg:1..3<->BOOL & not ((dom(ff\\/gg) = dom(ff) \\/ dom(gg)) )', % now failing with 14h version of setlog, and quite a few more below |
| 10072 | | '-evalf', ':slog-double-check f:1..3 --> BOOL & f~:BOOL +-> INTEGER', |
| 10073 | | '-evalf', ':slog-double-check f:1..3 --> BOOL & f~:BOOL +-> INTEGER & card(ran(f))<=2', |
| 10074 | | '-evalt', ':slog-double-check x:BOOL & x/=TRUE', |
| 10075 | | '-evalf', ':slog-double-check x:BOOL & x/=TRUE & x/=FALSE', |
| 10076 | | '-evalt', ':slog-double-check s<:1..10 & not(1..3 <:s or s<:1..3)', |
| 10077 | | '-evalf', ':slog-double-check f:1..3 --> BOOL & f~:BOOL +-> INTEGER & ran(f) <: {TRUE,FALSE}', |
| 10078 | | '-evalf', ':slog-double-check x <: {TRUE,FALSE} & {TRUE} <: x & {FALSE}<: x & x/= BOOL', |
| 10079 | | '-evalf', ':slog-double-check x<:1..3 & not(2:x <=> 3:x) & 3:x & 2:x', |
| 10080 | | '-evalt', ':slog-double-check x:1..10 & #y.(y:BOOL & y=TRUE & x<2)', |
| 10081 | | '-evalt', ':slog-double-check x:1..10 & !y.(y:1..9 => x>y)', |
| 10082 | | '-evalt', ':slog x <: 1..5 & r[x]=x & r[{1}] /= {1} & card(x)=3', |
| 10083 | | '-evalt', ':slog x <: 1..5 & r[x]=x & r[{1}] /= {1} & card(x)=3 & r[{2}]={2}', |
| 10084 | | '-evalt', ':slog-double-check x <: 1..5 & r:1..5 <-> 1..5 & r[x]=x & r[{1}] /= {1} & card(x)=3 & r[{2}]={2}', % a bit slow |
| 10085 | | '-evalt', ':slog x>0 & x:S & x=max(S)', |
| 10086 | | '-evalt', ':slog x>0 & x:S & (x=max(S) or (y:S & y>x))', |
| 10087 | | '-evalt', ':slog x>0 & x:S & not(x=max(S)) & (y:S & y>x)', |
| 10088 | | '-evalt', ':slog x>1 & x:S & !y.(y:S => y<=x)', |
| 10089 | | %'-evalt', ':slog x>1 & x:S & !y.(y:S => #z.(z:S & z>y))', % translation failed |
| 10090 | | '-evalt', ':slog-double-check {x|x:1..10 & x>z} = 3..10', |
| 10091 | | |
| 10092 | | % idl from test 2364 |
| 10093 | | '-evalt', ':slog x:INTEGER & x>y', |
| 10094 | | '-evalf', ':slog-double-check x:INTEGER & x>y & y>x', |
| 10095 | | '-evalt', ':slog-double-check x:INTEGER & x=1', |
| 10096 | | '-evalf', ':slog-double-check x:INTEGER & x<3 & x>3', |
| 10097 | | '-evalf', ':slog-double-check x:INTEGER & x<3 & x-1>3', |
| 10098 | | '-evalt', ':slog-double-check x:INTEGER & x<3 & y<4', |
| 10099 | | '-evalt', ':slog x:INTEGER & x<3 & y-2>4', |
| 10100 | | '-evalt', ':slog-double-check x:INTEGER & x<3 & y-2<4', |
| 10101 | | '-evalf', ':slog-double-check x:INTEGER & x<3-2 & x-2>(-1)', |
| 10102 | | '-evalt', ':slog x:INTEGER & x+y<x+2', |
| 10103 | | '-evalt', ':slog x:INTEGER & x-y<=2 & y-z<=1 & z-x<=-1', |
| 10104 | | '-evalf', ':slog x:INTEGER & x-y<=2 & y-z<=1 & z-x<=-4', |
| 10105 | | '-evalf', ':slog x:INTEGER & x<y+3 & y<=z+2 & z<x-4', |
| 10106 | | '-evalf', ':slog x:INTEGER & x<=z-6 & x<=w-3 & y<=x+3 & z<=y+2 & z<=w-1 & w<=y+5', |
| 10107 | | '-evalt', ':slog x:INTEGER & x<=z-5 & x<=w-3 & y<=x+3 & z<=y+2 & z<=w-1 & w<=y+5', |
| 10108 | | '-evalf', ':slog x:INTEGER & x<=z-5 & x<=w-3 & y<=x+3 & z=y+2 & z=w-1 & w=y+5', |
| 10109 | | '-evalt', ':slog x:INTEGER & x=w-3 & y=x+3 & z=y+2', |
| 10110 | | % from test 2309 |
| 10111 | | '-evalt', ':slog-double-check x:INTEGER & s:POW(1..10) & x=min(s)', |
| 10112 | | '-evalt', ':slog-double-check x:INTEGER & s:POW(1..10) & x=max(s)', |
| 10113 | | '-evalt', ':slog-double-check x:INTEGER & {(1,2)}(x)=2', |
| 10114 | | % from test 2211 |
| 10115 | | '-evalf', ':slog-double-check not(x<:BOOL & x /<: y => x/=y)', |
| 10116 | | '-evalf', ':slog-double-check not(x<:BOOL & x /<: y => y/=x)', |
| 10117 | | '-evalf', ':slog-double-check not(x<:BOOL & x /<: y => not(y=x))', |
| 10118 | | '-evalf', ':slog not(x>0 & y>0 => not(x>0 & y<=0))', |
| 10119 | | '-evalf', ':slog not(x>0 & y>0 => not(x<=0 & y>0))', |
| 10120 | | '-evalf', ':slog not(x>0 & y>0 => not(x<=0 & y<=1))', |
| 10121 | | '-evalt', ':slog not(x>0 & y>0 => not(x<=1 & y<=1))', |
| 10122 | | '-evalf', ':slog not(x>0 & y>0 => not(x<=0 or y<=0))', |
| 10123 | | '-evalt', ':slog not(x>0 & y>0 => not(x<=0 or y>0))', |
| 10124 | | '-evalf', ':slog not(x>0 => (y>0 => not(x<=0 or y<=0)))', |
| 10125 | | '-evalf', ':slog not(x>0 => ( x=1 or x>1))', |
| 10126 | | '-evalt', ':slog not(x>0 => not( x=1 or x>1))', |
| 10127 | | '-evalf', ':slog not(x>0 => not( x/=1 & not(x>1)))', |
| 10128 | | '-evalf', ':slog not(x>1 & y>2 => not( x>0 => not(y>2)))', |
| 10129 | | '-evalf', ':slog not(a <:b & a /<<: {1,2} => b /<<: {1,2})', |
| 10130 | | '-evalf', ':slog not(a ={} & b<:BOOL => b/<<:a)', |
| 10131 | | '-evalf', ':slog-double-check not(a =BOOL & b<:BOOL => a/<<:b)', |
| 10132 | | '-evalt', ':slog-double-check not(a ={} & b<:BOOL => a/<<:b)', |
| 10133 | | '-evalt', ':slog-double-check not(a =BOOL & b<:BOOL => b/<<:a)', |
| 10134 | | '-evalf', ':slog-double-check not(a ={} & b<:BOOL & a/=b => b/<:a)', |
| 10135 | | '-evalf', ':slog-double-check not(a ={} & b<:BOOL & a/=b => not(b<:a))', |
| 10136 | | '-evalt', ':slog-double-check not(a ={} & b<:BOOL & a/=c => not(b<:a))', |
| 10137 | | '-evalf', ':slog not(a=b => (a>0 <=> b>0))', |
| 10138 | | '-evalt', ':slog not(a=b => (a>0 <=> b>=0))', |
| 10139 | | '-evalt', ':slog not(a>=b => (a>0 <=> b>0))', |
| 10140 | | '-evalf', ':slog not(a:INTEGER => (a>b <=> not(b>=a)))', |
| 10141 | | '-evalf', ':slog not(a:INTEGER => not(a>b <=> not(a>b)))', |
| 10142 | | '-evalt', ':slog not(a:INTEGER => not(a>b <=> not(a>=b)))', |
| 10143 | | '-evalt', ':slog not(a<:BOOL => not(a<:b <=> b<:a))', |
| 10144 | | '-evalt', ':slog not(a<:BOOL => not(not(a<:b) <=> not(b<:a)))', |
| 10145 | | '-evalf', ':slog not(a<:BOOL => not((a<:b) <=> not(a<:b)))', |
| 10146 | | '-evalf', ':slog not(a<:BOOL => not(not(a<<:b) <=> (a<<:b)))', |
| 10147 | | |
| 10148 | | '-evalf', ':slog-double-check x:POW({1,2}) & 3:x', |
| 10149 | | '-evalf', ':slog-double-check x:POW({1,2}) & card(x)>2', |
| 10150 | | '-evalt', ':slog-double-check x:FIN1({1,2}) & 2:x & card(x)=2', |
| 10151 | | '-evalf', ':slog-double-check x: 1..3 +-> 1..2 & 3:ran(x)', |
| 10152 | | '-evalt', ':slog-double-check x: 1..3 +-> 1..2 & 2:ran(x)', |
| 10153 | | '-evalf', ':slog-double-check x: 1..2 +-> NATURAL1 & 0:ran(x)', |
| 10154 | | '-evalt', ':slog-double-check x: 1..2 +-> NATURAL & 0:ran(x)', |
| 10155 | | '-evalf', ':slog-double-check x: 0..2<->1..2 & 0:ran(x)', |
| 10156 | | '-evalf', ':slog-double-check x: 1..2<->1..2 & 0:ran(x)', |
| 10157 | | '-evalf', ':slog-double-check x: 1..2<->1..2 & 0:dom(x)', |
| 10158 | | '-evalt', ':slog-double-check x: 0..2<->1..2 & 0:dom(x)', |
| 10159 | | '-evalf', ':slog-double-check x: NATURAL1<->1..2 & 0:ran(x)', |
| 10160 | | '-evalt', ':slog x: NATURAL1<->1..2 & 2:ran(x)', |
| 10161 | | '-evalf', ':slog-double-check x: NATURAL1<->1..2 & 0:dom(x)', |
| 10162 | | '-evalt', ':slog-double-check x: NATURAL<->1..2 & 0:dom(x)', |
| 10163 | | '-evalf', ':slog-double-check x: NATURAL1 +-> 1..2 & 0:dom(x)', |
| 10164 | | '-evalt', ':slog-double-check x: NATURAL +-> 1..2 & 0:dom(x)', |
| 10165 | | '-evalt', ':slog-double-check x: NATURAL1 +-> NATURAL1 & 1:dom(x) & 1:ran(x)', |
| 10166 | | '-evalf', ':slog-double-check x: NATURAL1 +-> NATURAL1 & (0:dom(x) or 0:ran(x))', |
| 10167 | | '-evalt', ':slog x: NATURAL1 +-> NATURAL1 & (1:dom(x) or 0:ran(x))', |
| 10168 | | '-evalt', ':slog-double-check x <: NATURAL1 & x<:0..1 & card(x)=1', |
| 10169 | | '-evalf', ':slog-double-check x <: NATURAL1 & x<:0..1 & card(x)=2', |
| 10170 | | '-evalf', ':slog-double-check x : NATURAL1 <-> 0..1 & dom(x)<:-1..0 & x /= {}', |
| 10171 | | '-evalt', ':slog-double-check x /: NATURAL1 <-> INTEGER & dom(x)<:-1..1 & ran(x)<:3..4', |
| 10172 | | '-evalf', ':slog x /: NATURAL1 <-> INTEGER & dom(x)<:1..2 & ran(x)<:3..4', |
| 10173 | | '-evalt', ':slog-double-check x<: -1..2 & not(x<:NATURAL)', |
| 10174 | | '-evalf', ':slog-double-check x<: 1..2 & not(x<:NATURAL)', |
| 10175 | | '-evalf', ':slog-double-check x:POW1(NATURAL1) & x<:-1..0', |
| 10176 | | '-evalt', ':slog-double-check x:POW1(NATURAL1) & x<:0..1', |
| 10177 | | '-evalt', ':slog-double-check x/:POW1(NATURAL) & x<:-1..0', |
| 10178 | | '-evalf', ':slog-double-check x/:POW(NATURAL) & x<:2..3', |
| 10179 | | '-evalt', ':slog-double-check x/:POW1(NATURAL) & x<:2..3', |
| 10180 | | '-evalf', ':slog-double-check x/:POW1(NATURAL) & x<:2..3 & x/={}', |
| 10181 | | '-evalt', ':slog-double-check f:1..2 +-> 1..2 & not(f \\/ {1 |-> 1} : INTEGER +->INTEGER)', |
| 10182 | | '-evalf', ':slog-double-check f:1..2 +-> 1..2 & not(f \\/ {1 |-> f(1)} : INTEGER +->INTEGER)', |
| 10183 | | '-evalt', ':slog-double-check f:1..2 +-> 1..2 & not(f <+ {3 |-> 1} : 1..2 +->INTEGER)', |
| 10184 | | '-evalf', ':slog-double-check f:1..2 +-> 1..2 & not(f <+ {1 |-> 1} : 1..2 +->INTEGER)', |
| 10185 | | '-evalt', ':slog-double-check f:1..2 +-> 1..2 & not(f \\/ {1 |-> 3} : 1..2 +->INTEGER)', |
| 10186 | | '-evalt', ':slog-double-check f:1..2 +-> 1..2 & not(f \\/ {1 |-> 1} : 1..2 +->1..2)', |
| 10187 | | '-evalt', ':slog-double-check f:BOOL --> POW(1..2) & not(f <+ {TRUE|->1..3} : BOOL +-> POW(1..2))', |
| 10188 | | '-evalf', ':slog-double-check f:BOOL --> POW(1..2) & not(f <+ {TRUE|->1..2} : BOOL +-> POW(1..2))', |
| 10189 | | '-evalt', ':slog-double-check x = POW(1 .. 2)', |
| 10190 | | '-evalt', ':slog-double-check f: BOOL --> (BOOL +-> BOOL) & f(TRUE):BOOL-->BOOL', |
| 10191 | | '-evalt', ':slog-double-check f: BOOL --> (BOOL +-> BOOL) & f(FALSE)={}', |
| 10192 | | '-evalt', ':slog-double-check f: BOOL --> POW(BOOL) & f(TRUE)={TRUE} & f(FALSE)={}', |
| 10193 | | '-evalt', ':slog-double-check f: BOOL --> POW(BOOL) & f(TRUE):POW1(BOOL) & f(FALSE)={}' |
| 10194 | | % does not work :slog-double-check f: BOOL --> (BOOL +-> BOOL) & f(FALSE)={} & f(TRUE):BOOL-->BOOL |
| 10195 | | % times out: :slog f:BOOL +-> BOOL & not(f <+ {TRUE |-> TRUE} : BOOL +->BOOL) |
| 10196 | | ], 'Simple tests for setlog solver.'). |
| 10197 | | cli_testcase(2379, [eventb_test, theories, reals], ['../prob_examples/examples/EventBPrologPackages/Toulouse/Dupont/RealsTest_mch.eventb', |
| 10198 | | '--model-check', '-cc', '7', '6', '-nodead', |
| 10199 | | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10200 | | '-evalt', 'plus(Rone,Rone) |-> Rone : gt', '-evalt', 'plus(Rone,Rzero) = Rone', |
| 10201 | | '-evalt', 'times(Rone,Rzero) = Rzero', |
| 10202 | | '-evalt', 'plus(Rone,Rzero) : RReal' |
| 10203 | | ], 'Checking real theory with currying of binary operators'). |
| 10204 | | cli_testcase(2380, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/SeqTest1.eventb', '-mc', 2000, '-nodead', '-strict', |
| 10205 | | '-p', 'TRY_FIND_ABORT', 'TRUE'], 'Test 1156 for Seq theory with TRY_FIND_ABORT'). |
| 10206 | | cli_testcase(2381, [b_test,json_trace_replay,visb], [ |
| 10207 | | '../prob_examples/examples/EventBPrologPackages/Toulouse/Mendil/T_TemperatureMachine_mch.eventb', |
| 10208 | | '-expcterr', virtual_time_out, |
| 10209 | | '-evalt', 'unit(xx)=Kelvin & value(xx)=-100', |
| 10210 | | '-evalf', 'unit(xx)=Kelvin & unit(xx)=Celsius', |
| 10211 | | '-trace_replay', 'json', '../prob_examples/examples/EventBPrologPackages/Toulouse/Mendil/T_TemperatureMachine_presentation.prob2trace', |
| 10212 | | '-visb', '../prob_examples/examples/EventBPrologPackages/Toulouse/Mendil/Temp_VisB.json', |
| 10213 | | '../prob_examples/examples/EventBPrologPackages/Toulouse/Mendil/Temp_VisB.html'], 'Check JSON replay and VisB HTML generation with theory operators'). |
| 10214 | | cli_testcase(2382, [eventb_test, theories, reals], [ |
| 10215 | | '../prob_examples/examples/EventBPrologPackages/Toulouse/Dupont/SimpleRealsPlusTest_ctx.eventb', |
| 10216 | | '-evalt', 'plus(Rone,Rzero) : RReal', |
| 10217 | | '-evalt', 'plus(Rone,Rzero) : RRealPlus', |
| 10218 | | '-assertions'], |
| 10219 | | 'Check that reals are allowed for type checking in Event-B theories that use reals'). |
| 10220 | | cli_testcase(2383, [b_test,wd], [ |
| 10221 | | '../prob_examples/examples/EventBPrologPackages/Toulouse/Mendil/T_TemperatureMachinePrefix_mch.eventb', |
| 10222 | | '-p', 'TRY_FIND_ABORT', 'TRUE', '-expcterr', model_check_incomplete, |
| 10223 | | '-expcterr', virtual_time_out, '-mc', 100], 'Check no spurious WD errors'). |
| 10224 | | cli_testcase(2384, [b_test,wd], [ |
| 10225 | | '-evalf', 'bla = %x.(x:NATURAL|x+1) & bla /: POW(NATURAL*NATURAL)', % was wrong |
| 10226 | | '-evalt', 'bla = %x.(x:NATURAL|x+1) & bla : POW(NATURAL*NATURAL)', |
| 10227 | | '-evalt', 'bla = %x.(x:NATURAL|x-1) & bla /: POW(NATURAL*NATURAL)', |
| 10228 | | '-evalf', 'bla = %x.(x:NATURAL|x-1) & bla : POW(NATURAL*NATURAL)' |
| 10229 | | ], 'Check issue in symbolic subset check solved'). % bug was in get_subset_counter_example_closure |
| 10230 | | cli_testcase(2385, [b_test], [ |
| 10231 | | './distribution_examples/Simple/ACounter.mch', |
| 10232 | | './distribution_examples/Simple/Bakery0.mch', |
| 10233 | | './distribution_examples/Simple/Bakery1.mch', |
| 10234 | | './distribution_examples/Simple/GCD.mch', |
| 10235 | | './distribution_examples/Simple/KnightsKnaves.mch', |
| 10236 | | % './distribution_examples/Simple/Lift.mch', % invariant violation |
| 10237 | | |
| 10238 | | './distribution_examples/LessSimple/CSM.mch', |
| 10239 | | './distribution_examples/LessSimple/Schleusen.mch', |
| 10240 | | './distribution_examples/LessSimple/SATLIB_blocksworld_medium.mch', |
| 10241 | | './distribution_examples/LessSimple/SATLIB_uf20-903.mch', |
| 10242 | | './distribution_examples/LessSimple/Sieve.mch', |
| 10243 | | './distribution_examples/LessSimple/Sorting.mch', |
| 10244 | | './distribution_examples/LessSimple/SortingUnicode.mch', |
| 10245 | | % './distribution_examples/LessSimple/TravelAgency.mch', % invariant violation |
| 10246 | | './distribution_examples/LessSimple/phonebook.mch', |
| 10247 | | %'./distribution_examples/LessSimple/phonebook6.mch', % invariant violation |
| 10248 | | './distribution_examples/LessSimple/scheduler.mch', |
| 10249 | | './distribution_examples/LessSimple/tictac.mch', |
| 10250 | | './distribution_examples/LessSimple/GraphColouring/GraphColouringNAT.mch', |
| 10251 | | |
| 10252 | | './distribution_examples/Records/Schleusen_Records.mch', |
| 10253 | | './distribution_examples/Refinement/Server.mch', |
| 10254 | | './distribution_examples/Refinement/ServerR.ref', |
| 10255 | | './distribution_examples/Tutorial/StackConstructive.mch', |
| 10256 | | |
| 10257 | | './distribution_examples/Puzzles/Farmer.mch', |
| 10258 | | './distribution_examples/Puzzles/GardnerSwitchingPuzzle_v2.mch', |
| 10259 | | './distribution_examples/Puzzles/GolombRuler2.mch', |
| 10260 | | './distribution_examples/Puzzles/Hanoi.mch', |
| 10261 | | './distribution_examples/Puzzles/KissPassion.mch', |
| 10262 | | './distribution_examples/Puzzles/NoNeighboursProblem.mch', |
| 10263 | | './distribution_examples/Puzzles/PexSolve.mch', |
| 10264 | | './distribution_examples/Puzzles/RussianPostalPuzzle.mch', |
| 10265 | | './distribution_examples/Puzzles/SendMoreMoney.mch', |
| 10266 | | './distribution_examples/Puzzles/SubsetSum2.mch', |
| 10267 | | './distribution_examples/Puzzles/SudokuSETS9.mch', |
| 10268 | | './distribution_examples/Puzzles/TrainTorchPuzzle.mch', |
| 10269 | | './distribution_examples/Puzzles/WhoKilledAgatha.mch', |
| 10270 | | |
| 10271 | | './distribution_examples/GraphicalAnimation/BlocksWorldGeneric.mch', |
| 10272 | | './distribution_examples/GraphicalAnimation/CopySavePasteTools.mch', |
| 10273 | | './distribution_examples/GraphicalAnimation/Hanoi.mch', |
| 10274 | | './distribution_examples/GraphicalAnimation/Jars.mch', |
| 10275 | | './distribution_examples/GraphicalAnimation/LatinSquares.mch', |
| 10276 | | './distribution_examples/GraphicalAnimation/Lift0.mch', |
| 10277 | | './distribution_examples/GraphicalAnimation/Lift2.mch', |
| 10278 | | './distribution_examples/GraphicalAnimation/Lift3.mch', |
| 10279 | | './distribution_examples/GraphicalAnimation/Mandelbrot.mch', |
| 10280 | | './distribution_examples/GraphicalAnimation/NQueens.mch', |
| 10281 | | './distribution_examples/GraphicalAnimation/NQueens.mch', |
| 10282 | | './distribution_examples/GraphicalAnimation/NQueensBig.mch', |
| 10283 | | './distribution_examples/GraphicalAnimation/Puzzle8.mch', |
| 10284 | | './distribution_examples/GraphicalAnimation/RushHour.mch', |
| 10285 | | './distribution_examples/GraphicalAnimation/SamuraiSudoku_Hard.mch', |
| 10286 | | './distribution_examples/GraphicalAnimation/SendMoreMoney.mch', |
| 10287 | | './distribution_examples/GraphicalAnimation/SudokuAsConstant.mch', |
| 10288 | | './distribution_examples/GraphicalAnimation/TwoQueensSevenKnights.mch', |
| 10289 | | './distribution_examples/GraphicalAnimation/gol.mch', |
| 10290 | | './distribution_examples/GraphicalAnimation/gol_v2.mch', |
| 10291 | | './distribution_examples/GraphicalAnimation/scheduler.mch', |
| 10292 | | '-init', '-mc', 15, '-opterr', model_check_incomplete, '-nogoal', '-nodead' ], 'Check distribution examples can be loaded'). |
| 10293 | | cli_testcase(2386, [b_test,cbc], [ |
| 10294 | | '-evalf', 'x1 : (0 .. 4294967295) & x2 : (0 .. 255) & res = x1 / 2 ** x2 & res <0', |
| 10295 | | '-evalf', 'x1 : (0 .. 4294967295) & x2 : (0 .. 255) & res = x1 / 2 ** x2 & res > 4294967295', |
| 10296 | | '-evalf', 'x1 : (0 .. 4294967295) & x2 : (0 .. 255) & res = x1 / 2 ** x2 & res /: (0 .. 4294967295)', |
| 10297 | | '-evalt', 'x1 : (0 .. 4294967295) & x2 : (0 .. 255) & res = x1 / 2 ** x2 & res /: (1 .. 4294967295)' |
| 10298 | | ], 'Check no CLPFD overflow'). |
| 10299 | | cli_testcase(2387,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10300 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 2000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 10301 | | '../private_examples/ClearSy/2023/perf_1124/rule.mch', |
| 10302 | | '-execute_all', '-execute_expect_steps', 5, %'-silent', |
| 10303 | | '-animate_stats', |
| 10304 | | '-evalt', 'card(caval__rule__1__ALL)=303', |
| 10305 | | '-evalt', 'card(caval__rule__2__ALL)=303', |
| 10306 | | '-evalt', 'card(caval__rule__3__ALL)=71', |
| 10307 | | '-evalt', 'caval__rule__3__done=TRUE' |
| 10308 | | ], 'Fix issue in STRING_JOIN sorting too early'). |
| 10309 | | cli_testcase(2388,[private,external,strings],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10310 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 2000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 10311 | | '../prob_examples/examples/B/ClearSy/Caval/2023/perf_1124/rule_bugly.mch', |
| 10312 | | '-execute_all', '-execute_expect_steps', 5, %'-silent', |
| 10313 | | '-evalt', 'card(aaxc)=303', |
| 10314 | | '-evalt', 'card(aazc)=303', |
| 10315 | | '-evalt', 'card(aabd)=71', |
| 10316 | | '-evalt', 'aayc=TRUE' |
| 10317 | | ], 'Fix issue in STRING_JOIN sorting too early'). % bugly version of test 2387 |
| 10318 | | cli_testcase(2389, [b_test,infinite], [ |
| 10319 | | '-evalt', 'NEG /\\ NATURAL = {} & NEG \\/ NATURAL = INTEGER ', |
| 10320 | | '-evalt', 'NEG /\\ NATURAL = {} & NEG \\/ NATURAL = INTEGER & -1:NEG & -1000:NEG & 0 /: NEG & 1/:NEG', |
| 10321 | | '-evalt', 'NEG /\\ NATURAL1 = {} & NEG \\/ NATURAL1 = INTEGER & -1:NEG & -1000:NEG & 0 : NEG & 1/:NEG', |
| 10322 | | '-evalt', 'NEG = {x|x < 0} & NEG /\\ NATURAL = {}', |
| 10323 | | '-evalt', 'NEG = {x|x < 1} & NEG /\\ NATURAL1 = {}', |
| 10324 | | '-evalf', 'NEG = {x|x < 1} & NEG /\\ NATURAL = {}', |
| 10325 | | '-evalt', 'NEG = {x|x < 1} & NEG \\/ NATURAL1 = INTEGER', |
| 10326 | | '-evalt', 'NEG = {x|x < 1} & NEG \\/ NATURAL = INTEGER', |
| 10327 | | '-evalt', 'NEG = {x|x /: NATURAL} & NEG \\/ NATURAL =INTEGER', |
| 10328 | | '-evalt', 'NEG = {x|x /: NATURAL} & NEG \\/ NATURAL1 = res & res /= INTEGER & 0/:res & 1000:res', |
| 10329 | | '-evalt', 'NEG = {x|x /: NATURAL} & NEG /\\ NATURAL = {}', |
| 10330 | | '-evalt', 'NEG = {x|x /: NATURAL} & NEG /\\ NATURAL1 = {}', |
| 10331 | | '-evalt', 'NEG = {x|x /: NATURAL1} & NEG /\\ NATURAL1 = {}', |
| 10332 | | '-evalf', 'NEG = {x|x /: NATURAL1} & NEG /\\ NATURAL = {}', |
| 10333 | | '-evalt', 'NEG = {x|x /: NATURAL1} & NATURAL1 /\\ NEG = {}' |
| 10334 | | ], 'Check infinite partition works'). |
| 10335 | | cli_testcase(2390, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10336 | | './distribution_examples/Simple/Lift.mch', % invariant violation |
| 10337 | | './distribution_examples/LessSimple/TravelAgency.mch', % invariant violation |
| 10338 | | './distribution_examples/LessSimple/phonebook6.mch', % invariant violation |
| 10339 | | '-init', '-mc', 1500, '-bf', |
| 10340 | | '-expcterr', invariant_violation, '-nogoal', '-nodead' ], 'Check distribution examples can be loaded'). |
| 10341 | | cli_testcase(2391, [external,json_trace_replay], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10342 | | '../prob_examples/public_examples/B/ExternalFunctions/JSON/ReadProB2JSON.mch', |
| 10343 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/ExternalFunctions/JSON/ReadProB2JSON.prob2trace' |
| 10344 | | ], 'Check READ_JSON'). |
| 10345 | | cli_testcase(2392, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10346 | | '-evalt_file', '../prob_examples/public_examples/B/B2SAT/pigeon/pigeon_bv_simple2_expanded2.eval', |
| 10347 | | '-evalt_file', '../prob_examples/public_examples/B/B2SAT/pigeon/pigeon_bv_simple2_expanded3.eval', |
| 10348 | | '-evalt_file', '../prob_examples/public_examples/B/B2SAT/pigeon/pigeon_bv_simple2_expanded5.eval' |
| 10349 | | ], 'Check many quantifiers and disjunctions and merging of FD info from disjuncts'). |
| 10350 | | cli_testcase(2393, [satsolver_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10351 | | '../prob_examples/public_examples/B/B2SAT/pigeon/Pigeon_30_bv.mch', '-init', |
| 10352 | | '-properties' |
| 10353 | | ], 'Test b2sat performance and quantifier expansion'). %SET_PREF_SOLVER_FOR_PROPERTIES |
| 10354 | | cli_testcase(2394, [smt_solver_integration], [ |
| 10355 | | '-evalf', ':z3-sat A=TRUE & A=FALSE', |
| 10356 | | '-evalf', ':z3-sat A=TRUE & (A=FALSE or B=TRUE) & B=FALSE', |
| 10357 | | '-evalt', ':z3-sat A=TRUE & B=TRUE', |
| 10358 | | '-evalt', ':z3-sat A=TRUE & B=TRUE & (A=FALSE or B=FALSE or C=TRUE)', |
| 10359 | | '-evalf', ':z3-sat A=TRUE & B=TRUE & (A=FALSE or B=FALSE or C=TRUE) & C=FALSE', |
| 10360 | | '-evalt', ':z3-sat (A=TRUE => B=FALSE) & A=FALSE & B=TRUE', |
| 10361 | | '-evalf', ':z3-sat (A=TRUE => B=FALSE) & A=TRUE & B=TRUE', |
| 10362 | | '-evalf', ':z3-sat (A=TRUE <=> B=FALSE) & A=TRUE & B=TRUE', |
| 10363 | | '-evalt', ':z3-sat (A=TRUE <=> B=FALSE) & A=TRUE & B=FALSE', |
| 10364 | | '-evalt', ':z3-sat not(A=TRUE)', |
| 10365 | | '-evalf', ':z3-sat not(A=TRUE) & A=TRUE' |
| 10366 | | ], 'Some simple tests for Z3 SAT solver'). |
| 10367 | | % z3-sat uses normal B to Z3-SMTlib translation, but different settings of Z3 |
| 10368 | | % sat-z3 uses b2sat translation and then Z3 as ordinary sat solver |
| 10369 | | cli_testcase(2395, [satsolver_test,smt_solver_integration], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10370 | | '-evalt', ':sat-z3-double-check x=TRUE or x=FALSE', |
| 10371 | | '-evalf', ':sat-z3-double-check x=TRUE & x=FALSE', |
| 10372 | | '-evalt', ':sat-z3-double-check x=TRUE & (x=TRUE => y=TRUE) & (y=TRUE => x=TRUE)', |
| 10373 | | '-evalf', ':sat-z3-double-check x=TRUE & (x=TRUE => y=TRUE) & (y=TRUE => x=FALSE)', |
| 10374 | | '-evalt', ':sat-z3-double-check x=TRUE & (x=TRUE <=> y=TRUE) & (y=TRUE <=> z=TRUE)', |
| 10375 | | '-evalt', ':sat-z3-double-check n=12 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE =>f(i-1)=FALSE)) & f(1)=TRUE', |
| 10376 | | '-evalt', ':sat-z3-double-check n=12 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE =>f(i-1)=FALSE)) & f(1)=TRUE & f(12)=TRUE', |
| 10377 | | '-evalf', ':sat-z3-double-check n=12 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE <=>f(i-1)=FALSE)) & f(1)=TRUE & f(12)=TRUE', |
| 10378 | | '-evalt', ':sat-z3-double-check n=12 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})=1', |
| 10379 | | '-evalf', ':sat-z3-double-check n=12 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})=1 & card({i|i:1..n & f(i)=FALSE})=1', |
| 10380 | | '-evalt', ':sat-z3-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})>2 & card({i|i:1..n & f(i)=FALSE})>2', |
| 10381 | | '-evalf', ':sat-z3-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})>3 & card({i|i:1..n & f(i)=FALSE})>2', |
| 10382 | | '-evalt', ':sat-z3-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})<4 & card({i|i:1..n & f(i)=FALSE})<4', |
| 10383 | | '-evalf', ':sat-z3-double-check n=6 & f:1..n-->BOOL & card({i|i:1..n & f(i)=TRUE})<3 & card({i|i:1..n & f(i)=FALSE})<4', |
| 10384 | | '-evalt', ':sat-z3-double-check f:1..3-->BOOL & card({y|y:1..3 & f(y)=TRUE}) <=2 &f(1)=TRUE & f(3)=TRUE', |
| 10385 | | '-evalf', ':sat-z3-double-check f:1..3-->BOOL & card({y|y:1..3 & f(y)=TRUE}) <=2 &f(1)=TRUE & f(3)=TRUE & f(2)=TRUE', |
| 10386 | | '-evalf', ':sat-z3-double-check f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) <=6 &f(1)=TRUE & f(3)=TRUE & !i.(i:1..10 => (f(i)=FALSE => f(i*10)=TRUE))', |
| 10387 | | '-evalt', ':sat-z3-double-check f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) <=10 &f(1)=TRUE & f(3)=TRUE & !i.(i:1..10 => (f(i)=FALSE => f(i*10)=TRUE))', |
| 10388 | | '-evalf', ':sat f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) >=20 & card({y|y:1..100 & f(y)=TRUE}) <=19', % ProB times out here |
| 10389 | | '-evalt', ':sat-z3-double-check f:1..100-->BOOL & card({y|y:1..100 & f(y)=TRUE}) >=20 & card({y|y:1..100 & f(y)=TRUE}) <=20', |
| 10390 | | '-evalt', ':sat-z3-double-check n=3 & f:1..n-->BOOL & f(1)=TRUE & card({i|i:1..n & (f(i)=TRUE or i=2)})=2', |
| 10391 | | '-evalf', ':sat-z3-double-check n=3 & f:1..n-->BOOL & f(1)=TRUE & card({i|i:1..n & (f(i)=TRUE or i=2)})=1', |
| 10392 | | '-evalt', ':sat-z3-double-check f:1..n --> BOOL & n=50 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1))', |
| 10393 | | '-evalf', ':sat-z3-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=1)})=3', |
| 10394 | | '-evalf', ':sat-z3-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=1)})=1', |
| 10395 | | '-evalt', ':sat-z3-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=1)})=2', |
| 10396 | | '-evalf', ':sat-z3-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=2)})=2', |
| 10397 | | '-evalt', ':sat-z3-double-check f:1..n --> BOOL & n=3 & f(1)=TRUE & !i.(i:2..n => f(i) /= f(i-1)) & card({i|i:1..3 & (f(i)=TRUE or i=2)})=3' |
| 10398 | | ], 'Test new satsolver backend (test 2355) but with Z3 as sat solver.'). |
| 10399 | | cli_testcase(2396, [cbc,external,strings], [ |
| 10400 | | '-evalt', '{x,y|conc([x,"_",y])="a_b"} = {("a"|->"b")}', |
| 10401 | | '-evalt', '{x|conc(x) = "a_b" & size(x)=3 & x(2)="_"} = {["a","_","b"]}', |
| 10402 | | '-evalt', '{x|conc(x) = "a_b" & size(x)=3 & x(2)=""} = {["","","a_b"],["a","","_b"],["a_","","b"],["a_b","",""]}', |
| 10403 | | '-evalf', 'conc(x)="a_b" & x(2)="x" & size(x)<3' % <4 does not work yet |
| 10404 | | ], 'Test predicates with conc for strings'). |
| 10405 | | cli_testcase(2397, [tickets,json_trace_replay], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10406 | | '../prob_examples/public_examples/B/Tickets/LetPredicateReify/tictac_MCTS.mch', |
| 10407 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tickets/LetPredicateReify/tictac_MCTS.prob2trace', |
| 10408 | | '-evalt', 'WIN(0) or WIN(1)', |
| 10409 | | '-evalt', 'not(WIN(1) => WIN(0))' |
| 10410 | | ], 'Check let_predicate predicate reuse issue solved'). |
| 10411 | | cli_testcase(2398, [tickets], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10412 | | '-evalt', '{x,v,y|x:1..2 & x:y & y<:1..4 & v=x+1 & LET x BE x=v+v IN x:y END} = {(1|->2|->{1,4}),(1|->2|->{1,2,4}),(1|->2|->{1,2,3,4}),(1|->2|->{1,3,4})}', |
| 10413 | | '-evalt', 'x:1..2 & y:3..4 & (x:z or LET x BE x=y+y IN x:z & x+1:z END) & z<:6..8' |
| 10414 | | ], 'Check let_predicate predicate reuse issue solved'). |
| 10415 | | cli_testcase(2399, [eventb_test,theories], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10416 | | '../prob_examples/examples/EventBPrologPackages/Floats/AitSadoune_MEDI2023/TestPowOperator_ctx.eventb', |
| 10417 | | '../prob_examples/examples/EventBPrologPackages/Floats/AitSadoune_MEDI2023/TestFloatTheory2_ctx.eventb', |
| 10418 | | '../prob_examples/examples/EventBPrologPackages/Floats/AitSadoune_MEDI2023/TestFloatTheory3_ctx.eventb', |
| 10419 | | '-init', '-assertions'],'Check float theory with axiomatic operators via set comprehensions'). |
| 10420 | | cli_testcase(2400, [eventb_test,theories,json_trace_replay], [ |
| 10421 | | '../prob_examples/examples/EventBPrologPackages/Floats/AitSadoune_MEDI2023/mch_floating_point_speed2_v2.eventb', |
| 10422 | | '-trace_replay', 'json', '../prob_examples/examples/EventBPrologPackages/Floats/AitSadoune_MEDI2023/mch_floating_point_speed2_v2.prob2trace', |
| 10423 | | '-expcterr', 'virtual_time_out'],'Check overriding direct def predicate operators via set comprehensions'). |
| 10424 | | cli_testcase(2401, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10425 | | '-evalt', '{n|n>0 & 2**n <= 7} = 1..2', |
| 10426 | | '-evalt', '{n|n>0 & 2**n <= 8} = 1..3', |
| 10427 | | '-evalt', '{n|n>0 & 2**n <= 1024} = 1..10', |
| 10428 | | '-evalt', '{n|n>0 & 2**n <= 1023} = 1..9', |
| 10429 | | '-evalt', '{n|n>0 & 2**n <= 2000} = 1..10', |
| 10430 | | '-evalt', '{n|n>0 & 2**n <= 2**33+1} = 1..33', |
| 10431 | | '-evalt', '{n|n>0 & 3**n <= 3**10} = 1..10', |
| 10432 | | '-evalt', '!b.(b:2..10 => {n|n>0 & b**n <= b**10} = 1..10)', |
| 10433 | | '-evalt', '!b.(b:2..10 => {n|n>0 & b**n <= b**11-1} = 1..10)' |
| 10434 | | ], 'Check power propagation'). |
| 10435 | | cli_testcase(2402, [eventb_test,dot], ['../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TestMC_m1_mch.eventb', '-mc', '1000', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-nodead', '-expcterr', 'event_error:evt1:simulation_error', |
| 10436 | | '-dot', 'last_error', '../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TestMC_m1_sim_error.dot'], 'Test dot visualisation of simulation error from test 148'). |
| 10437 | | cli_testcase(2403, [eventb_test,theories], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10438 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Inductive/BaumTest_ctx.eventb', |
| 10439 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Inductive/BaumTest2_ctx.eventb', |
| 10440 | | '../prob_examples/public_examples/EventBPrologPackages/Theory/Inductive/TestInductiveRecOp_ctx.eventb', |
| 10441 | | '-init', '-assertions'],'Check inductive datatypes'). |
| 10442 | | cli_testcase(2404, [tickets], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'DATA_VALIDATION', 'TRUE', |
| 10443 | | '-evalf', 'S=[11,22,33] & ((x=1 & #y.(3|->y:S)) or (x=2 & not(#y.(3|->y:S)))) <=> P=TRUE & x>1 & x<10 & P=TRUE', |
| 10444 | | '-evalf', 'S=[11,22,33] & ((x=1 & v:ran(S)) or (x=2 & not(v:ran(S)))) <=> P=TRUE & x>1 & x<10 & P=TRUE & v:{22,33}' |
| 10445 | | ],'Check interference between predicate reuse of exists in reification and non-required predicates'). |
| 10446 | | cli_testcase(2405,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10447 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 2000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 10448 | | '../private_examples/ClearSy/2024/perf_0126/rule_RVF192_MSVI_FOLIO.mch', |
| 10449 | | '-execute_all', '-execute_expect_steps', 3, %'-silent', |
| 10450 | | '-animate_stats', |
| 10451 | | '-evalt', 'card(caval__rule__1__ALL)=0', |
| 10452 | | '-evalt', 'caval__rule__1__done=TRUE' |
| 10453 | | ], 'Check interference between predicate reuse of exists in reification and non-required predicates'). |
| 10454 | | cli_testcase(2406,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10455 | | '-p', 'JVM_PARSER_HEAP_MB', '12000', '-p', 'TIME_OUT', 2000, '-p', 'DATA_VALIDATION', 'TRUE', '-release-java-parser', |
| 10456 | | '../private_examples/ClearSy/2023/Machines_perf_0323/CCSL/rule_TYPES_AUTORISES_RVF3_GEN__MRGA.mch', |
| 10457 | | '-execute_all', '-execute_expect_steps', 3, %'-silent', |
| 10458 | | '-animate_stats', |
| 10459 | | '-evalt', 'card(caval__rule__1__ALL)=84458', |
| 10460 | | '-evalt', 'caval__rule__1__done=TRUE' |
| 10461 | | ], 'Performance check for non-det reification of exists'). |
| 10462 | | cli_testcase(2407, [eventb_test,theories,json_trace_replay], [ |
| 10463 | | '../prob_examples/examples/EventBPrologPackages/ABZ2023/Mammar_v15/M3_sep5_mch.eventb', |
| 10464 | | '-trace_replay', 'json', '../prob_examples/examples/EventBPrologPackages/ABZ2023/Mammar_v15/M3_sep5_mch.prob2trace', |
| 10465 | | '-expcterr', 'setup_constants_unknown', |
| 10466 | | '-expcterr', 'virtual_time_out'],'Check prob-ignore label recognised with 8722 hyphen'). |
| 10467 | | cli_testcase(2408, [eventb_test], ['../prob_examples/examples/EventBPrologPackages/ABZ2023/Mammar_v16/C2_ctx.eventb', '-mc', '10', '-strict', |
| 10468 | | '-nodead', '-expcterr', 'model_check_incomplete'], 'Test cardinality inference for deferred set works'). |
| 10469 | | cli_testcase(2409, [eventb_test,theories,json_trace_replay,visb], [ |
| 10470 | | '../prob_examples/examples/EventBPrologPackages/ABZ2023/Mammar_v19/M8_mch.eventb', |
| 10471 | | '-trace_replay', 'json', '../prob_examples/examples/EventBPrologPackages/ABZ2023/Mammar_v19/M8_mch.prob2trace', |
| 10472 | | '-visb', '../prob_examples/examples/EventBPrologPackages/ABZ2023/Mammar_v19/visualization/AMAN_M8_vis.json', |
| 10473 | | '../prob_examples/examples/EventBPrologPackages/ABZ2023/Mammar_v19/m8_VisB.html' |
| 10474 | | ],'Check that new description_event terms recognised'). |
| 10475 | | cli_testcase(2410, [kodkod], [ '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', |
| 10476 | | '-evalt', ':kodkod sss - {TRUE} = {} & sss = {TRUE} ' |
| 10477 | | ,'-evalt', ':kodkod sss - {TRUE} = {FALSE} & sss /= {FALSE}' |
| 10478 | | ,'-evalf', ':kodkod sss - {TRUE} = {FALSE} & FALSE /: sss' |
| 10479 | | ,'-evalt', ':kodkod sss - {1,4,5} = {} & sss = {1,4,5}' |
| 10480 | | ], 'check constraint propagation bug for set_subtraction fixed'). |
| 10481 | | cli_testcase(2411, [b_test, imp, refinement,while], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10482 | | '../prob_examples/examples/B/B2Sol/SAC_2024_CaseStudy/B_weth_i.imp', '-mc', 100, |
| 10483 | | '-expcterr', 'model_check_incomplete' |
| 10484 | | ], 'Check visibility and $0 access in invariant of while loops'). |
| 10485 | | cli_testcase(2412, [b_test, operation_reuse,while], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10486 | | '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'COMPRESSION', 'TRUE', |
| 10487 | | '../prob_examples/public_examples/B/PerformanceTests/codegenerator/SetCardBig.mch', '-mc', 100, |
| 10488 | | '-cc', 3,3 |
| 10489 | | ], 'Check correct read info for while loop'). |
| 10490 | | cli_testcase(2413,[private,systerel],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10491 | | '../prob_examples/examples/B/Systerel/Ticket_C578.EML.010/bug65anofirst_wo_adc_pragma.mch', |
| 10492 | | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-aa', 4, 0, 0, '-init', '-p', 'CLPFD', 'FALSE', % much slower with CLPFD |
| 10493 | | %'-p', 'SYMBOLIC', 'TRUE', % this takes very long |
| 10494 | | '-p', 'TIME_OUT', 10000 |
| 10495 | | ], 'Check ticket Ticket_C578.EML.010 from 2013'). % used to be big difference from source, much slower than with probcli |
| 10496 | | cli_testcase(2414, [smt_solver_integration], [ |
| 10497 | | '../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/Train_1_beebook_tlc.mch', '-init', |
| 10498 | | '-evalf', ':z3 #(TRK,frm,resrt,rsrtbl).(not(rsrtbl : resbl --> resrt & r = R8 & r : resrt - frm & TRK1 = ((dom(nxt(r)) <<| TRK) |>> ran(nxt(r))) \\/ nxt(r) & frm1 = frm & nxt1 = nxt & resrt1 = resrt & rsrtbl1 = rsrtbl & (r1 = R9 & r1 : resrt - ran(rsrtbl) & (resrt2 = resrt - {r1} & frm2 = frm - {r1}) & TRK2 = TRK & nxt2 = nxt & rsrtbl2 = rsrtbl) & (r2 = R9 & r2 : resrt1 - ran(rsrtbl1) & (resrt3 = resrt1 - {r2} & frm3 = frm1 - {r2}) & TRK3 = TRK1 & nxt3 = nxt1 & rsrtbl3 = rsrtbl1) & (r3 = R8 & r3 : resrt2 - frm2 & TRK4 = ((dom(nxt2(r3)) <<| TRK2) |>> ran(nxt2(r3))) \\/ nxt2(r3) & frm4 = frm2 & nxt4 = nxt2 & resrt4 = resrt2 & rsrtbl4 = rsrtbl2) => TRK3 = TRK4 & frm3 = frm4 & nxt3 = nxt4 & resrt3 = resrt4 & rsrtbl3 = rsrtbl4))', |
| 10499 | | '-evalf', ':z3 #(LBT,TRK,frm,OCC,resbl,resrt,rsrtbl).(not(rsrtbl : resbl --> resrt & rsrtbl <: rtbl & OCC <: resbl & !r.(r : ROUTES => nxt(r)[(rtbl~)[{r}] - (rsrtbl~)[{r}]] /\\ (rsrtbl~)[{r}] - OCC = {}) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}]] <: (rsrtbl~)[{r}]) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}] - OCC] <: (rsrtbl~)[{r}] - OCC) & TRK : BLOCKS >+> BLOCKS & frm <: resrt & rsrtbl[OCC] <: frm & !r.(r : resrt - frm => rtbl |> {r} = rsrtbl |> {r}) & !(x,y).(x |-> y : TRK => #r.(x |-> y : nxt(r))) & !r.(r : frm => (rsrtbl~)[{r}] <| nxt(r) = (rsrtbl~)[{r}] <| TRK) & LBT <: OCC & !(a,b).(b : LBT & (b : ran(nxt(rsrtbl(b))) & (a = (nxt(rsrtbl(b))~)(b) & a : dom(rsrtbl))) => rsrtbl(a) /= rsrtbl(b)) & rsrtbl : resbl --> resrt & rsrtbl <: rtbl & OCC <: resbl & !r.(r : ROUTES => nxt(r)[(rtbl~)[{r}] - (rsrtbl~)[{r}]] /\\ (rsrtbl~)[{r}] - OCC = {}) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}]] <: (rsrtbl~)[{r}]) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}] - OCC] <: (rsrtbl~)[{r}] - OCC) & (R2 : resrt - frm & (rsrtbl~)[{R2}] <| {(A|->B),(B|->D),(D|->E),(E|->F),(F|->G),(L|->A)} = (rsrtbl~)[{R2}] <| TRK & R7 : resrt - ran(rsrtbl)) & (R7 : resrt - ran(rsrtbl) & (resrt1 = resrt - {R7} & frm1 = frm - {R7}) & LBT1 = LBT & TRK1 = TRK & OCC1 = OCC & resbl1 = resbl & rsrtbl1 = rsrtbl & fst1 = fst & lst1 = lst & nxt1 = nxt & rtbl1 = rtbl) & rsrtbl1 = resrtbl => R2 : resrt1 - frm1 & (rsrtbl1~)[{R2}] <| {(A|->B),(B|->D),(D|->E),(E|->F),(F|->G),(L|->A)} = (rsrtbl1~)[{R2}] <| TRK))', |
| 10500 | | '-evalf', 'not(rsrtbl : resbl --> resrt & rsrtbl <: rtbl & OCC <: resbl & !r.(r : ROUTES => nxt(r)[(rtbl~)[{r}] - (rsrtbl~)[{r}]] /\\ (rsrtbl~)[{r}] - OCC = {}) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}]] <: (rsrtbl~)[{r}]) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}] - OCC] <: (rsrtbl~)[{r}] - OCC) & TRK : BLOCKS >+> BLOCKS & frm <: resrt & rsrtbl[OCC] <: frm & !r.(r : resrt - frm => rtbl |> {r} = rsrtbl |> {r}) & !(x,y).(x |-> y : TRK => #r.(x |-> y : nxt(r))) & !r.(r : frm => (rsrtbl~)[{r}] <| nxt(r) = (rsrtbl~)[{r}] <| TRK) & LBT <: OCC & !(a,b).(b : LBT & (b : ran(nxt(rsrtbl(b))) & (a = (nxt(rsrtbl(b))~)(b) & a : dom(rsrtbl))) => rsrtbl(a) /= rsrtbl(b)) & rsrtbl : resbl --> resrt & rsrtbl <: rtbl & OCC <: resbl & !r.(r : ROUTES => nxt(r)[(rtbl~)[{r}] - (rsrtbl~)[{r}]] /\\ (rsrtbl~)[{r}] - OCC = {}) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}]] <: (rsrtbl~)[{r}]) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}] - OCC] <: (rsrtbl~)[{r}] - OCC) & (K : LBT & K : dom(TRK) & TRK(K) : OCC & (OCC1 = OCC - {K} & rsrtbl1 = {K} <<| rsrtbl & resbl1 = resbl - {K} & LBT1 = LBT - {K} \\/ {TRK(K)}) & TRK1 = TRK) & (J : OCC & J : dom(TRK) & TRK(J) /: OCC & OCC2 = OCC \\/ {TRK(J)} & LBT2 = LBT & TRK2 = TRK & resbl2 = resbl & rsrtbl2 = rsrtbl) & (J : OCC1 & J : dom(TRK1) & TRK1(J) /: OCC1 & OCC3 = OCC1 \\/ {TRK1(J)} & LBT3 = LBT1 & TRK3 = TRK1 & resbl3 = resbl1 & rsrtbl3 = rsrtbl1) & (K : LBT2 & K : dom(TRK2) & TRK2(K) : OCC2 & (OCC4 = OCC2 - {K} & rsrtbl4 = {K} <<| rsrtbl2 & resbl4 = resbl2 - {K} & LBT4 = LBT2 - {K} \\/ {TRK2(K)}) & TRK4 = TRK2) => LBT3 = LBT4 & OCC3 = OCC4 & TRK3 = TRK4 & resbl3 = resbl4 & rsrtbl3 = rsrtbl4)', |
| 10501 | | '-evalf', ':z3 #(LBT,TRK,frm,OCC,resbl,resrt,rsrtbl).(not(rsrtbl : resbl --> resrt & rsrtbl <: rtbl & OCC <: resbl & !r.(r : ROUTES => nxt(r)[(rtbl~)[{r}] - (rsrtbl~)[{r}]] /\\ (rsrtbl~)[{r}] - OCC = {}) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}]] <: (rsrtbl~)[{r}]) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}] - OCC] <: (rsrtbl~)[{r}] - OCC) & TRK : BLOCKS >+> BLOCKS & frm <: resrt & rsrtbl[OCC] <: frm & !r.(r : resrt - frm => rtbl |> {r} = rsrtbl |> {r}) & !(x,y).(x |-> y : TRK => #r.(x |-> y : nxt(r))) & !r.(r : frm => (rsrtbl~)[{r}] <| nxt(r) = (rsrtbl~)[{r}] <| TRK) & LBT <: OCC & !(a,b).(b : LBT & (b : ran(nxt(rsrtbl(b))) & (a = (nxt(rsrtbl(b))~)(b) & a : dom(rsrtbl))) => rsrtbl(a) /= rsrtbl(b)) & rsrtbl : resbl --> resrt & rsrtbl <: rtbl & OCC <: resbl & !r.(r : ROUTES => nxt(r)[(rtbl~)[{r}] - (rsrtbl~)[{r}]] /\\ (rsrtbl~)[{r}] - OCC = {}) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}]] <: (rsrtbl~)[{r}]) & !r.(r : ROUTES => nxt(r)[(rsrtbl~)[{r}] - OCC] <: (rsrtbl~)[{r}] - OCC) & (R2 : resrt - frm & (rsrtbl~)[{R2}] <| nxt(R2) = (rsrtbl~)[{R2}] <| TRK & R7 : resrt - ran(rsrtbl)) & (R7 : resrt - ran(rsrtbl) & (resrt1 = resrt - {R7} & frm1 = frm - {R7}) & LBT1 = LBT & TRK1 = TRK & OCC1 = OCC & resbl1 = resbl & rsrtbl1 = rsrtbl & fst1 = fst & lst1 = lst & nxt1 = nxt & rtbl1 = rtbl) => R2 : resrt1 - frm1 & (rsrtbl~)[{R2}] <| nxt(R2) = (rsrtbl~)[{R2}] <| TRK))' |
| 10502 | | ], 'check AST optimization for z3'). |
| 10503 | | cli_testcase(2415, [cbc,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10504 | | '-evalt', 'F=%x.(x:INTEGER|x+1) & F /: FIN(F)', |
| 10505 | | '-evalt', 'F=%x.(x>2|x+1) & F /: FIN(F)', |
| 10506 | | '-evalt', 'F=%x.(x>2 or x=0|x+1) & F /: FIN(F)', |
| 10507 | | % '-evalt', 'F=%x.(x=10 or x<0|x+1) & F /: FIN(F)', % does not work yet |
| 10508 | | '-evalt', 'F= %(x,y).(x=y+1 & y=x+1 | x+y) & F : FIN(F)', |
| 10509 | | '-evalt', 'F=%x.(x:NATURAL1 & x/=2 & x/=4| x+1)', |
| 10510 | | '-evalt', 'F=%afh.(afh: INTEGER +-> INTEGER & afh/={} | card(afh))', |
| 10511 | | '-evalt', 'F=%afh.(afh: INTEGER +-> INTEGER & {}/=afh | card(afh))', |
| 10512 | | '-evalt', 'F=%afh.(afh: INTEGER <-> INTEGER & {}/=afh | card(afh))', |
| 10513 | | '-evalt', 'F=%afh.(afh: INTEGER --> INTEGER & {}/=afh | card(afh))', |
| 10514 | | '-evalt', 'F=%afh.(afh: BOOL --> INTEGER & {}/=afh | card(afh))', |
| 10515 | | '-evalt', 'F=/*@symbolic*/{x| x:S1 or x:S2} & F /: FIN(F) & S1<:INTEGER & S1 = NATURAL1 & S2 <: 1..5', |
| 10516 | | '-evalt', 'F=/*@symbolic*/{x| x:S1 or x:S2} & F /: FIN(F) & S1<:INTEGER & S1 <: 1..5 & S2 = NATURAL1', |
| 10517 | | '-evalt', 'F=%x.(x:NATURAL1 & x/=2 & x/=4| x+1) & F /: FIN(F)', |
| 10518 | | '-evalt', 'F=%x.(x:POW(NATURAL1) & x/={}| card(x)) & F /: FIN(F)', |
| 10519 | | '-evalt', 'F=%x.(x:POW(INTEGER) & x/={}| card(x)) & F /: FIN(F)', |
| 10520 | | '-evalt', 'F=%afh.(afh: INTEGER --> INTEGER & {}/=afh | card(afh)) & F /: FIN(F)', |
| 10521 | | '-evalt', 'F=%afh.(afh: POW(INTEGER --> INTEGER) & {}/=afh | card(afh)) & F /: FIN(F)', |
| 10522 | | '-evalt', 'F=%afh.(afh: seq(STRING +-> INTEGER) & {}/=afh | card(afh)) & F /: FIN(F)', |
| 10523 | | '-evalf', 'F=%afh.(afh: seq({}) & afh:INTEGER<->INTEGER & {}/=afh | card(afh)) & F /: FIN(F)', |
| 10524 | | '-evalt', 'F=%afh.(afh: seq({}) & afh:INTEGER<->INTEGER & {}/=afh | card(afh)) & F : FIN(F)', |
| 10525 | | '-evalt', '%(afh,afi).(afh: INTEGER +-> INTEGER & afh/={} & afi: INTEGER |afi)=F & F/:FIN(F)' |
| 10526 | | ], 'check improved infinite detection allowing not_equal works'). |
| 10527 | | cli_testcase(2416, [b_test,closure1,infinite,wd], ['../prob_examples/public_examples/B/Tickets/Hansen7/ClosureTest_NotWD.mch', '-init', |
| 10528 | | '-expecterr', 'well_definedness_error', '-opterr', 'setup_constants_unknown', |
| 10529 | | '-opterr', 'virtual_time_out', '-expcterr', 'setup_constants_fails' |
| 10530 | | ], 'Version of test 1879 where wd error not masked by failure'). |
| 10531 | | cli_testcase(2417, [eventb_test,theories,json_trace_replay,visb], [ |
| 10532 | | '../prob_examples/public_examples/B/Tickets/TraceReplaySlow/Execute_by_Predicate_Problem_Enumerated.mch', |
| 10533 | | '-p', 'MAX_OPERATIONS', 0, % avoid virtual_time_out |
| 10534 | | '-trace_replay', 'json', '../prob_examples/public_examples/B/Tickets/TraceReplaySlow/Execute_by_Predicate_Problem_Enumerated.prob2trace' |
| 10535 | | ],'Check that execute by predicate with seq. composition and becomes_such works'). |
| 10536 | | cli_testcase(2418, [eventb_test,card], [ |
| 10537 | | '../prob_examples/examples/EventBPrologPackages/Soton/Property/c0_property_Prob_ctx_v1.eventb', |
| 10538 | | '-init'], 'Check deferred set detection works via card(.) axiom of other deferred set'). |
| 10539 | | cli_testcase(2419, [eventb_test,card], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10540 | | '../prob_examples/examples/EventBPrologPackages/Toulouse/Riviere/bdi/TermsContext_ctx.eventb', |
| 10541 | | '-p', 'DEFAULT_SETSIZE', 20, |
| 10542 | | '-init'], 'Check deferred max set size detection works via card(.) and partition'). |
| 10543 | | cli_testcase(2420, [eventb_test,infinite,theories], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10544 | | '../prob_examples/examples/EventBPrologPackages/Toulouse/Riviere/bdi/bdireasoning_mch_v2.eventb', |
| 10545 | | '-p', 'DEFAULT_SETSIZE', 20, |
| 10546 | | '-init'], 'Check no virtual time-out due to function with symbolic results'). |
| 10547 | | cli_testcase(2421, [b_test,proz],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', |
| 10548 | | '../prob_examples/public_examples/B/NewSyntax/FreeTypeInFreeType.mch', |
| 10549 | | '-init','-assertions'], |
| 10550 | | 'Check freetypes can use fields with other freetypes as type'). |
| 10551 | | |
| 10552 | | |
| 10553 | | % /Users/leuschel/git_root/prob_examples/public_examples/B/Simple/UpCounter.mch -ctlformula 'AG {c<mx}' -p MAXINT 10 |
| 10554 | | % store counter example |
| 10555 | | |
| 10556 | | % sicstus -l tests/test_runner.pl --goal "id(690-694)." |
| 10557 | | % INSERT NEW TESTCASES ABOVE THIS LINE; cli_testcase is sorted in ascending order |
| 10558 | | % ---------------------------------------------------------------------- |
| 10559 | | |
| 10560 | | % ---------------------------------------------------------------------- |
| 10561 | | % ---------------------------------------------------------------------- |
| 10562 | | |
| 10563 | | % ---------------------------------------------------------------------- |
| 10564 | | % IF A NEW TESTCASE REQUIRES CHECKING OUTPUT, ADD NEW LINE(S) BELOW |
| 10565 | | % cli_testcase_diff_check_output is sorted in descending order |
| 10566 | | |
| 10567 | | cli_testcase_diff_check_output(2402, |
| 10568 | | '../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TestMC_m1_sim_error.dot', |
| 10569 | | '../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TestMC_m1_sim_error_saved.dot'). |
| 10570 | | cli_testcase_diff_check_output(2220, |
| 10571 | | '../prob_examples/public_examples/B/VisB/TrafficLight/TrafficLight_Trace.txt', |
| 10572 | | '../prob_examples/public_examples/B/VisB/TrafficLight/TrafficLight_Trace_Saved.txt'). |
| 10573 | | cli_testcase_diff_check_output(2190, |
| 10574 | | '../prob_examples/public_examples/CSP/simple/RefinementChecks_A_spec.P', |
| 10575 | | '../prob_examples/public_examples/CSP/simple/RefinementChecks_A_spec_saved.P'). |
| 10576 | | cli_testcase_diff_check_output(2154,'../prob_examples/public_examples/B/Tickets/PartitionPrettyPrintBug/ABZ16_m4_pp.mch', |
| 10577 | | '../prob_examples/public_examples/B/Tickets/PartitionPrettyPrintBug/ABZ16_m4_Internal.mch'). |
| 10578 | | cli_testcase_diff_check_output(2094,'../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/prob_cbc_counterexample_test2094.mch', |
| 10579 | | '../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/prob_cbc_counterexample.mch'). |
| 10580 | | cli_testcase_diff_check_output(2093,'../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/prob_bmc_counterexample_test2093.mch', |
| 10581 | | '../prob_examples/public_examples/TLA/TLA_Google_Group/Einstein/TLA_Examples/prob_bmc_counterexample.mch'). |
| 10582 | | cli_testcase_diff_check_output(2061,'../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt','../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result_true.txt'). |
| 10583 | | cli_testcase_diff_check_output(2051, |
| 10584 | | '../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest2_rw.csv', |
| 10585 | | '../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest2_rw_saved.csv'). |
| 10586 | | cli_testcase_diff_check_output(2050, |
| 10587 | | '../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest_rw.csv', |
| 10588 | | '../prob_examples/public_examples/B/Tester/ReadWriteAnalysis/BecomesSuchTest_rw_saved.csv'). |
| 10589 | | cli_testcase_diff_check_output(2035,'../prob_examples/public_examples/B/CBC/DeadlockTest_his.txt','../prob_examples/public_examples/B/CBC/DeadlockTest_his_saved.txt'). |
| 10590 | | cli_testcase_diff_check_output(2031,'../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc_rw_matrix.csv','../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc_rw_matrix_saved.csv'). |
| 10591 | | cli_testcase_diff_check_output(1941,'../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1_invariant.dot', '../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1_invariant_saved.dot'). |
| 10592 | | cli_testcase_diff_check_output(1941,'../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1_hierarchy.dot', '../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1_hierarchy_saved.dot'). |
| 10593 | | cli_testcase_diff_check_output(1937,'../prob_examples/public_examples/B/Pragmas/TestLabel_pp.mch','../prob_examples/public_examples/B/Pragmas/TestLabel_pp_saved.mch'). |
| 10594 | | |
| 10595 | | cli_testcase_diff_check_output(1915,'../prob_examples/examples/B/Alstom/etcs/actions_feasibility.csv', |
| 10596 | | '../prob_examples/examples/B/Alstom/etcs/actions_feasibility_saved.csv'). |
| 10597 | | cli_testcase_diff_check_output(1904,'../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6_rw_matrix.csv', |
| 10598 | | '../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6_rw_matrix_saved.csv'). |
| 10599 | | cli_testcase_diff_check_output(1840,'../prob_examples/public_examples/Latex/tests/prob_latex_doc.tex', |
| 10600 | | '../prob_examples/public_examples/Latex/tests/prob_latex_doc_saved.tex'). |
| 10601 | | cli_testcase_diff_check_output(1837,'../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect_feasibility.csv', |
| 10602 | | '../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect_feasibility_saved.csv'). |
| 10603 | | cli_testcase_diff_check_output(1810,'../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString_Internal.mch', |
| 10604 | | '../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString_Internal_Saved.mch'). |
| 10605 | | cli_testcase_diff_check_output(1797,'../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_rw_matrix.csv', |
| 10606 | | '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_rw_matrix_saved.csv'). |
| 10607 | | cli_testcase_diff_check_output(1793,'../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2_enabling.csv', |
| 10608 | | '../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2_enabling_saved.csv'). |
| 10609 | | cli_testcase_diff_check_output(1771,'../prob_examples/public_examples/B/CBC/Enabling/OpParameterTests_enabling_analysis.csv', '../prob_examples/public_examples/B/CBC/Enabling/OpParameterTests_enabling_analysis_saved.csv'). |
| 10610 | | cli_testcase_diff_check_output(1770,'../prob_examples/public_examples/B/CBC/Enabling/ChoiceByPredicate_enabling_analysis.csv', '../prob_examples/public_examples/B/CBC/Enabling/ChoiceByPredicate_enabling_analysis_saved.csv'). |
| 10611 | | cli_testcase_diff_check_output(1703,'../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2_enabling_analysis.csv', '../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2_enabling_analysis_saved.csv'). |
| 10612 | | cli_testcase_diff_check_output(1702,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_enabling_analysis.csv', '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_enabling_analysis_saved.csv'). |
| 10613 | | cli_testcase_diff_check_output(1676,'../prob_examples/examples/EventBPrologPackages/Soton/MCM_Tests/tests.xml', '../prob_examples/examples/EventBPrologPackages/Soton/MCM_Tests/FENCEM7_mcm_tests_1675_saved.xml'). |
| 10614 | | cli_testcase_diff_check_output(1675,'../prob_examples/public_examples/B/TestCaseGeneration/MCM_Tests/SimpleTestModel_mcm_tests.xml', '../prob_examples/public_examples/B/TestCaseGeneration/MCM_Tests/SimpleTestModel_mcm_tests_saved.xml'). |
| 10615 | | %cli_testcase_diff_check_output(1665,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records_internal.mch', |
| 10616 | | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records_internal_saved.mch'). |
| 10617 | | cli_testcase_diff_check_output(1543,'../prob_examples/public_examples/B/Tickets/Beauger2/bug_not_labels_corrected_ppf.mch','../prob_examples/public_examples/B/Tickets/Beauger2/bug_not_labels_corrected_ppf_saved.mch'). |
| 10618 | | cli_testcase_diff_check_output(1494,'../prob_examples/public_examples/B/Ivo/NoDisablings_mx5_Coverage.txt','../prob_examples/public_examples/B/Ivo/NoDisablings_mx5_Coverage_saved.txt'). |
| 10619 | | cli_testcase_diff_check_output(1493,'../prob_examples/public_examples/B/Ivo/SkippingComplexGuardsEvaluation_mch_mx5000_Coverage.txt','../prob_examples/public_examples/B/Ivo/SkippingComplexGuardsEvaluation_mch_mx5000_Coverage_saved.txt'). |
| 10620 | | cli_testcase_diff_check_output(1451,'../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt','../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result_true.txt'). |
| 10621 | | cli_testcase_diff_check_output(1439,'../prob_examples/public_examples/B/Tickets/LambdaInverse/LambdaInverseBehaviour.sptxt','../prob_examples/public_examples/B/Tickets/LambdaInverse/LambdaInverseBehaviour_saved.sptxt'). |
| 10622 | | cli_testcase_diff_check_output(1405,'../prob_examples/public_examples/B/Simple/VerySimpleDFA_transition_diagram.dot','../prob_examples/public_examples/B/Simple/VerySimpleDFA_transition_diagram_saved.dot'). |
| 10623 | | cli_testcase_diff_check_output(1402,'../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt','../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result_true.txt'). |
| 10624 | | cli_testcase_diff_check_output(1389,'../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt','../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result_defset.txt'). |
| 10625 | | cli_testcase_diff_check_output(1388,'../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt','../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result_true.txt'). |
| 10626 | | cli_testcase_diff_check_output(1387,'../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt','../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result_enumwarning.txt'). |
| 10627 | | cli_testcase_diff_check_output(1386,'../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt','../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result_false.txt'). |
| 10628 | | cli_testcase_diff_check_output(1383,'../prob_examples/examples/B/Alstom/Ticket_Dec08_2014/Segment_refAdhesionLevel_GER5_sptxt.txt','../prob_examples/examples/B/Alstom/Ticket_Dec08_2014/Segment_refAdhesionLevel_GER5_sptxt_saved.txt'). |
| 10629 | | cli_testcase_diff_check_output(1378,'../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori.his','../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori_saved.his'). |
| 10630 | | cli_testcase_diff_check_output(1377,'../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.his','../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori_saved.his'). |
| 10631 | | cli_testcase_diff_check_output(1377,'../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.sptxt','../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori_saved.sptxt'). |
| 10632 | | % the provided counter-example varies for test 1366: |
| 10633 | | %cli_testcase_diff_check_output(1366,'../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2_his.txt', |
| 10634 | | % '../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2_his_saved.txt'). |
| 10635 | | cli_testcase_diff_check_output(1364,'../prob_examples/public_examples/B/Demo/scheduler_his.txt', |
| 10636 | | '../prob_examples/public_examples/B/Demo/scheduler_his_ctl_saved.txt'). |
| 10637 | | cli_testcase_diff_check_output(1363,'../prob_examples/public_examples/B/Simple/UpCounter_his.txt', |
| 10638 | | '../prob_examples/public_examples/B/Simple/UpCounter_his_ctl20_saved.txt'). |
| 10639 | | cli_testcase_diff_check_output(1360,'../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck_feasibility.csv', |
| 10640 | | '../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck_feasibility_saved.csv'). |
| 10641 | | cli_testcase_diff_check_output(1358,'../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition_feasibility.csv', |
| 10642 | | '../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition_feasibility_saved.csv'). |
| 10643 | | cli_testcase_diff_check_output(1357,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_cbc_tests.xml', |
| 10644 | | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_cbc_tests_saved.xml'). |
| 10645 | | cli_testcase_diff_check_output(1341,'../prob_examples/public_examples/B/Demo/Bakery0_all_paths.xml', |
| 10646 | | '../prob_examples/public_examples/B/Demo/Bakery0_all_paths_saved.xml'). |
| 10647 | | %cli_testcase_diff_check_output(1339,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/GenericUsageOfSquare_internal.mch', |
| 10648 | | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/GenericUsageOfSquare_internal_saved.mch'). |
| 10649 | | cli_testcase_diff_check_output(1319,'../prob_examples/public_examples/B/Demo/scheduler_bf_states.P','../prob_examples/public_examples/B/Demo/scheduler_bf_saved_states.P'). |
| 10650 | | cli_testcase_diff_check_output(1271,'../prob_examples/public_examples/B/Tickets/Hansen10/PrettyPrintBug_his.txt','../prob_examples/public_examples/B/Tickets/Hansen10/PrettyPrintBug_his_saved.txt'). |
| 10651 | | cli_testcase_diff_check_output(1196,'../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.csv','../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_saved.csv'). |
| 10652 | | cli_testcase_diff_check_output(1148,'../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/peterson_R_Coverage_POR.txt','../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/peterson_R_Coverage_saved.txt'). |
| 10653 | | cli_testcase_diff_check_output(1147,'../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/em_abs_Coverage_POR.txt','../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/em_abs_Coverage_saved.txt'). |
| 10654 | | cli_testcase_diff_check_output(1144,'../prob_examples/public_examples/B/Ivo/BenchmarksPOR/BPEL2B/Model_Machine_4_NoDeadlock_v5_Coverage_POR.txt','../prob_examples/public_examples/B/Ivo/BenchmarksPOR/BPEL2B/Model_Machine_4_NoDeadlock_v5_Coverage_saved.txt'). |
| 10655 | | cli_testcase_diff_check_output(1119,'../prob_examples/public_examples/CSPB/Tickets/Bauer/machine_his.txt','../prob_examples/public_examples/CSPB/Tickets/Bauer/machine_his_saved.txt'). |
| 10656 | | cli_testcase_diff_check_output(1116,'../prob_examples/public_examples/EventBPrologPackages/Tests/UnicodeIds_spdot.dot','../prob_examples/public_examples/EventBPrologPackages/Tests/UnicodeIds_spdot_saved.dot'). |
| 10657 | | cli_testcase_diff_check_output(1045,'../prob_examples/examples/RodinModels/Deploy/Bosch/CruiseControl/CrsCtl_m4_Coverage_pge.txt','../prob_examples/examples/RodinModels/Deploy/Bosch/CruiseControl/CrsCtl_m4_Coverage.txt'). |
| 10658 | | cli_testcase_diff_check_output(1044,'../prob_examples/public_examples/B/EventB/EventB_Projekt/lift_solution_Coverage_pge.txt','../prob_examples/public_examples/B/EventB/EventB_Projekt/lift_solution_Coverage.txt'). |
| 10659 | | cli_testcase_diff_check_output(1043,'../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.cov','../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc_saved.cov'). |
| 10660 | | cli_testcase_diff_check_output(1033,'../prob_examples/public_examples/B/Benchmarks/scheduler_transition_diagram.dot','../prob_examples/public_examples/B/Benchmarks/scheduler_transition_diagram_saved.dot'). |
| 10661 | | cli_testcase_diff_check_output(989,'../prob_examples/public_examples/EventBPrologPackages/PerformanceTests/LargeConstants_ctx_internal.mch','../prob_examples/public_examples/EventBPrologPackages/PerformanceTests/LargeConstants_ctx_internal_saved.mch'). |
| 10662 | | cli_testcase_diff_check_output(988,'../prob_examples/public_examples/CSP/simple/Copy_spmdot.dot','../prob_examples/public_examples/CSP/simple/Copy_spmdot_saved.dot'). |
| 10663 | | cli_testcase_diff_check_output(988,'../prob_examples/public_examples/CSP/simple/Copy_spddot.dot','../prob_examples/public_examples/CSP/simple/Copy_spddot_saved.dot'). |
| 10664 | | cli_testcase_diff_check_output(987,'../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2_por.cov','../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2.cov'). |
| 10665 | | cli_testcase_diff_check_output(977,'../prob_examples/public_examples/B/Ivo/BridgeTransitions_por.cov','../prob_examples/public_examples/B/Ivo/BridgeTransitions.cov'). |
| 10666 | | cli_testcase_diff_check_output(982,'../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_1_ori.his','../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_1_ori_saved.his'). |
| 10667 | | cli_testcase_diff_check_output(981,'../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori.his','../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_Route_0001ori_saved.his'). |
| 10668 | | cli_testcase_diff_check_output(980,'../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori.his','../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_DB_SIGAREA_0024_ori_saved.his'). |
| 10669 | | cli_testcase_diff_check_output(979,'../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori.his','../prob_examples/examples/B/Alstom/CompilatonProject/Regles/Rule_TMS_Overlap_0017_2_ori_saved.his'). |
| 10670 | | %cli_testcase_diff_check_output(957,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/DifferentUnitNotations_internal.mch', |
| 10671 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/DifferentUnitNotations_internal_saved.mch'). |
| 10672 | | cli_testcase_diff_check_output(944,'../prob_examples/public_examples/Eval/evalout.dot','../prob_examples/public_examples/Eval/evalout_saved.dot'). |
| 10673 | | %cli_testcase_diff_check_output(942,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Case_internal.mch', |
| 10674 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Case_internal_saved.mch'). |
| 10675 | | cli_testcase_diff_check_output(894,'../prob_examples/public_examples/B/Daniel/minienabling_analysis.csv', |
| 10676 | | '../prob_examples/public_examples/B/Daniel/minienabling_analysis_saved.csv'). |
| 10677 | | %cli_testcase_diff_check_output(881,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Choice_internal.mch', |
| 10678 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Choice_internal_saved.mch'). |
| 10679 | | %cli_testcase_diff_check_output(865,'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_no_unicode.csp', |
| 10680 | | %'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_no_unicode_saved.csp'). |
| 10681 | | %cli_testcase_diff_check_output(864,'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_unicode.csp', |
| 10682 | | %'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_unicode_saved.csp'). |
| 10683 | | cli_testcase_diff_check_output(808,'../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_state_graph.dot', |
| 10684 | | '../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_state_graph_saved.dot'). |
| 10685 | | cli_testcase_diff_check_output(767,'../prob_examples/examples/B/Siemens/BAC9_ZC/pas_as_env_inv_ld_sptxt.txt', |
| 10686 | | '../prob_examples/examples/B/Siemens/BAC9_ZC/pas_as_env_inv_ld_sptxt_saved.txt'). |
| 10687 | | %cli_testcase_diff_check_output(707,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m3_internal.mch', |
| 10688 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m3_internal_saved.mch'). |
| 10689 | | %cli_testcase_diff_check_output(706,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m2_internal.mch', |
| 10690 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m2_internal_saved.mch'). |
| 10691 | | %cli_testcase_diff_check_output(705,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m1_internal.mch', |
| 10692 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m1_internal_saved.mch'). |
| 10693 | | %cli_testcase_diff_check_output(704,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m0_internal.mch', |
| 10694 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m0_internal_saved.mch'). |
| 10695 | | %cli_testcase_diff_check_output(701,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m1_internal.mch', |
| 10696 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m1_internal_saved.mch'). |
| 10697 | | %cli_testcase_diff_check_output(700,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m0_internal.mch', |
| 10698 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m0_internal_saved.mch'). |
| 10699 | | %cli_testcase_diff_check_output(696,'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnitsUnsat_internal.mch', |
| 10700 | | %'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnitsUnsat_internal_saved.mch'). |
| 10701 | | %cli_testcase_diff_check_output(695,'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnits_internal.mch', |
| 10702 | | %'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnits_internal_saved.mch'). |
| 10703 | | %cli_testcase_diff_check_output(686,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SequenceOperations_internal.mch', |
| 10704 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SequenceOperations_internal_saved.mch'). |
| 10705 | | %cli_testcase_diff_check_output(683,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/AdditionConversion_internal.mch', |
| 10706 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/AdditionConversion_internal_saved.mch'). |
| 10707 | | %cli_testcase_diff_check_output(681,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IntegerOperations_internal.mch', |
| 10708 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IntegerOperations_internal_saved.mch'). |
| 10709 | | %cli_testcase_diff_check_output(680,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel_i_internal.mch', |
| 10710 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel_i_internal_saved.mch'). |
| 10711 | | %cli_testcase_diff_check_output(679,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel0_internal.mch', |
| 10712 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel0_internal_saved.mch'). |
| 10713 | | %cli_testcase_diff_check_output(678,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_i_internal.mch', |
| 10714 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_i_internal_saved.mch'). |
| 10715 | | %cli_testcase_diff_check_output(677,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_internal.mch', |
| 10716 | | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_internal_saved.mch'). |
| 10717 | | %cli_testcase_diff_check_output(676,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/UserDefinedAlias_internal.mch', |
| 10718 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/UserDefinedAlias_internal_saved.mch'). |
| 10719 | | %cli_testcase_diff_check_output(675,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IfTypeAndClash_internal.mch', |
| 10720 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IfTypeAndClash_internal_saved.mch'). |
| 10721 | | %cli_testcase_diff_check_output(673,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IrregularConversions_internal.mch', |
| 10722 | | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IrregularConversions_internal_saved.mch'). |
| 10723 | | %cli_testcase_diff_check_output(667,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/System_internal.mch', |
| 10724 | | % '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/System_internal_saved.mch'). |
| 10725 | | %cli_testcase_diff_check_output(666,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/TrafficLight_internal.mch', |
| 10726 | | % '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/TrafficLight_internal_saved.mch'). |
| 10727 | | %cli_testcase_diff_check_output(665,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/Car_internal.mch', |
| 10728 | | % '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/Car_internal_saved.mch'). |
| 10729 | | %cli_testcase_diff_check_output(662,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/KnownExponent_internal.mch', |
| 10730 | | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/KnownExponent_internal_saved.mch'). |
| 10731 | | %cli_testcase_diff_check_output(661,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/MultiplicationConversion_internal.mch', |
| 10732 | | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/MultiplicationConversion_internal_saved.mch'). |
| 10733 | | %cli_testcase_diff_check_output(657,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SimpleCorrectUsage_internal.mch', |
| 10734 | | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SimpleCorrectUsage_internal_saved.mch'). |
| 10735 | | cli_testcase_diff_check_output(634,'../prob_examples/public_examples/B/Kodkod/Loop_statespace.dot', |
| 10736 | | '../prob_examples/public_examples/B/Kodkod/Loop_statespace_saved.dot'). |
| 10737 | | cli_testcase_diff_check_output(616,'../prob_examples/public_examples/B/Tester/Partition_internal.mch', |
| 10738 | | '../prob_examples/public_examples/B/Tester/Partition_internal_saved.mch'). |
| 10739 | | cli_testcase_diff_check_output(613,'../prob_examples/public_examples/B/Pragmas/AssertionPragmas_internal.mch', |
| 10740 | | '../prob_examples/public_examples/B/Pragmas/AssertionPragmas_internal_saved.mch'). |
| 10741 | | cli_testcase_diff_check_output(540,'../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter_results.xml', |
| 10742 | | '../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter_results_saved.xml'). |
| 10743 | | |
| 10744 | | cli_testcase_diff_check_output(514,'../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A0_true.dot','../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A0_true_saved.dot'). |
| 10745 | | cli_testcase_diff_check_output(514,'../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A1_true.dot','../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A1_true_saved.dot'). |
| 10746 | | cli_testcase_diff_check_output(514,'../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A2_true.dot','../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A2_true_saved.dot'). |
| 10747 | | cli_testcase_diff_check_output(514,'../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A3_true.dot','../prob_examples/public_examples/B/Mathematical/Voting/dot_output/NoCondorcetWinnerKodkod_A3_true_saved.dot'). |
| 10748 | | |
| 10749 | | |
| 10750 | | cli_testcase_diff_check_output(584,'../prob_examples/public_examples/TLA/ErrorTests/GraphIso_tla.mch', '../prob_examples/public_examples/TLA/ErrorTests/GraphIso_tla_saved.mch'). |
| 10751 | | cli_testcase_diff_check_output(563,'../prob_examples/public_examples/B/Daniel/TestM_testcases.xml', '../prob_examples/public_examples/B/Daniel/TestM_testcases_saved.xml'). |
| 10752 | | cli_testcase_diff_check_output(562,'../prob_examples/public_examples/EventBPrologPackages/Pitesti/bank_testfile.xml','../prob_examples/public_examples/EventBPrologPackages/Pitesti/bank_testfile_saved.xml'). |
| 10753 | | cli_testcase_diff_check_output(515,'../prob_examples/public_examples/B/Demo/scheduler_spdot.dot','../prob_examples/public_examples/B/Demo/scheduler_spdot_saved.dot'). |
| 10754 | | cli_testcase_diff_check_output(515,'../prob_examples/public_examples/B/Demo/scheduler_spmdot.dot','../prob_examples/public_examples/B/Demo/scheduler_spmdot_saved.dot'). |
| 10755 | | cli_testcase_diff_check_output(515,'../prob_examples/public_examples/B/Demo/scheduler_spddot.dot','../prob_examples/public_examples/B/Demo/scheduler_spddot_saved.dot'). |
| 10756 | | cli_testcase_diff_check_output(510,'../prob_examples/public_examples/B/Laws/RelLaws_internal.mch','../prob_examples/public_examples/B/Laws/RelLaws_internal_saved.mch'). |
| 10757 | | cli_testcase_diff_check_output(500,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch','../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_prettyprintedf.mch'). |
| 10758 | | cli_testcase_diff_check_output(499,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch','../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_prettyprintedf.mch'). |
| 10759 | | cli_testcase_diff_check_output(498,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch','../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp_saved.mch'). |
| 10760 | | cli_testcase_diff_check_output(497,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_pp.mch','../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_prettyprinted.mch'). |
| 10761 | | cli_testcase_diff_check_output(451,'../prob_examples/public_examples/B/Simple/UpCounter_his.txt','../prob_examples/public_examples/B/Simple/UpCounter_his_saved.txt'). |
| 10762 | | cli_testcase_diff_check_output(452,'../prob_examples/public_examples/B/Simple/UpCounter_his.txt','../prob_examples/public_examples/B/Simple/UpCounter_his_saved2.txt'). |
| 10763 | | cli_testcase_diff_check_output(453,'../prob_examples/public_examples/B/Simple/UpCounter_his.txt','../prob_examples/public_examples/B/Simple/UpCounter_his_saved3.txt'). |
| 10764 | | cli_testcase_diff_check_output(454,'../prob_examples/public_examples/B/Simple/UpCounter_his.txt','../prob_examples/public_examples/B/Simple/UpCounter_his_saved4.txt'). |
| 10765 | | cli_testcase_diff_check_output(455,'../prob_examples/public_examples/B/Simple/UpCounter_sptxt.txt','../prob_examples/public_examples/B/Simple/UpCounter_sptxt_saved.txt'). |
| 10766 | | cli_testcase_diff_check_output(461,'../prob_examples/public_examples/B/Daniel/rel_fnc_his.txt','../prob_examples/public_examples/B/Daniel/rel_fnc_his_saved.txt'). |
| 10767 | | |
| 10768 | | cli_testcase_diff_check_output(462,'../prob_examples/public_examples/B/Simple/UpCounter_his.txt','../prob_examples/public_examples/B/Simple/UpCounter_his_saved3.txt'). |
| 10769 | | cli_testcase_diff_check_output(463,'../prob_examples/public_examples/B/CBC/SimpleDeadlock1_his.txt','../prob_examples/public_examples/B/CBC/SimpleDeadlock1_his_saved.txt'). % FAILS with old write_history |
| 10770 | | cli_testcase_diff_check_output(464,'../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr_his.txt','../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr_his_saved.txt'). |
| 10771 | | cli_testcase_diff_check_output(466,'../prob_examples/public_examples/B/PerformanceTests/WhileLoopBench_his.txt','../prob_examples/public_examples/B/PerformanceTests/WhileLoopBench_saved_his.txt'). |
| 10772 | | cli_testcase_diff_check_output(467,'../prob_examples/public_examples/B/FeatureChecks/IFTHENELSE_his.txt','../prob_examples/public_examples/B/FeatureChecks/IFTHENELSE_saved_his.txt'). |
| 10773 | | cli_testcase_diff_check_output(468,'../prob_examples/public_examples/B/Puzzles/Farmer_sptxt.txt','../prob_examples/public_examples/B/Puzzles/Farmer_saved_sptxt.txt'). |
| 10774 | | cli_testcase_diff_check_output(468,'../prob_examples/public_examples/B/Puzzles/Farmer_his.txt','../prob_examples/public_examples/B/Puzzles/Farmer_saved_his.txt'). |
| 10775 | | cli_testcase_diff_check_output(469,'../prob_examples/public_examples/B/PerformanceTests/LargeSets/LargeExplicitSet_sptxt.txt','../prob_examples/public_examples/B/PerformanceTests/LargeSets/LargeExplicitSet_saved_sptxt.txt'). |
| 10776 | | cli_testcase_diff_check_output(470,'../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas_his.txt','../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas_saved_his.txt'). |
| 10777 | | cli_testcase_diff_check_output(470,'../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas_sptxt.txt','../prob_examples/public_examples/EventBPrologPackages/Abrial_Train_Ch17/train_4_mch_lukas_saved_sptxt.txt'). |
| 10778 | | cli_testcase_diff_check_output(471,'../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_sptxt.txt','../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_saved_sptxt.txt'). |
| 10779 | | cli_testcase_diff_check_output(471,'../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_his.txt','../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_saved_his.txt'). |
| 10780 | | cli_testcase_diff_check_output(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRRR_sptxt.txt','../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRRR_saved_sptxt.txt'). |
| 10781 | | cli_testcase_diff_check_output(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRRR_his.txt','../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRRR_saved_his.txt'). |
| 10782 | | cli_testcase_diff_check_output(473,'../prob_examples/public_examples/B/NewSyntax/SET_Game_Rec_sptxt.txt','../prob_examples/public_examples/B/NewSyntax/SET_Game_Rec_saved_sptxt.txt'). |
| 10783 | | cli_testcase_diff_check_output(473,'../prob_examples/public_examples/B/NewSyntax/SET_Game_Rec_his.txt','../prob_examples/public_examples/B/NewSyntax/SET_Game_Rec_saved_his.txt'). |
| 10784 | | cli_testcase_diff_check_output(474,'../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A0_true.dot','../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A0_true_saved.dot'). |
| 10785 | | cli_testcase_diff_check_output(474,'../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A1_false.dot','../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A1_false_saved.dot'). |
| 10786 | | cli_testcase_diff_check_output(474,'../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A2_false.dot','../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A2_false_saved.dot'). |
| 10787 | | cli_testcase_diff_check_output(474,'../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A3_false.dot','../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A3_false_saved.dot'). |
| 10788 | | cli_testcase_diff_check_output(474,'../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A4_false.dot','../prob_examples/public_examples/B/ExpressionViewer/dot_output/TotFunAnalyseTest_A4_false_saved.dot'). |
| 10789 | | cli_testcase_diff_check_output(476,'../prob_examples/public_examples/B/Tickets/Mejia1/TestInit_statespace.dot','../prob_examples/public_examples/B/Tickets/Mejia1/TestInit_statespace_saved.dot'). |
| 10790 | | cli_testcase_diff_check_output(479,'../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha_statespace.dot','../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha_statespace_saved.dot'). |
| 10791 | | cli_testcase_diff_check_output(480,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_statespace.dot','../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_statespace_saved.dot'). |
| 10792 | | cli_testcase_diff_check_output(383,'../prob_examples/public_examples/B/Puzzles/SudokuHexAsConstant_sptxt.txt','../prob_examples/public_examples/B/Puzzles/SudokuHexAsConstant_sptxt_saved.txt'). |
| 10793 | | |
| 10794 | | % specify that a testcase output file should not be deleted before running the tests |
| 10795 | | cli_testcase_do_not_delete(584,'../prob_examples/public_examples/TLA/ErrorTests/GraphIso_tla.mch'). |
| 10796 | | |
| 10797 | | % declaration of additinoal testcase files; in order to be able to generate archives |
| 10798 | | % of standalone tests |
| 10799 | | extra_testcase_file(305,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS0.def'). |
| 10800 | | extra_testcase_file(306,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS1.def'). |
| 10801 | | extra_testcase_file(307,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS.def'). |
| 10802 | | extra_testcase_file(465,'../prob_examples/public_examples/B/Simple/UpCounter_saved10.P'). |
| 10803 | | extra_testcase_file(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRR.ref'). |
| 10804 | | extra_testcase_file(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsR.ref'). |
| 10805 | | extra_testcase_file(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/Towns.mch'). |
| 10806 | | extra_testcase_file(475,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS2.def'). |
| 10807 | | |
| 10808 | | % use |
| 10809 | | % sicstus -l tests/test_runner.pl --goal "run_last_test, halt ; halt." |
| 10810 | | % or |
| 10811 | | % make runlast |
| 10812 | | % to just run last test case |
| 10813 | | % use |
| 10814 | | % sicstus -l tests/test_runner.pl --goal "id(ID), halt ; halt." |
| 10815 | | % to run a specific test |