| 1 | % (c) 2009-2019 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 | skip_test/1, | |
| 9 | cli_testcase_diff_check_output/3, cli_testcase_do_not_delete/2, | |
| 10 | extra_testcase_file/2]). | |
| 11 | ||
| 12 | %:- use_module('../extensions/profiler/profiler.pl'). | |
| 13 | %:- use_module('../extensions/profiler/profiler_te.pl'). | |
| 14 | %:- enable_profiling(cli_testcase/5). | |
| 15 | ||
| 16 | :- use_module(module_information,[module_info/2]). | |
| 17 | :- module_info(group,infrastructure). | |
| 18 | :- module_info(description,'This module defines the (integration) tests.'). | |
| 19 | ||
| 20 | cli_testcase(Id,Groups,TestConfiguration,Arguments,Description) :- | |
| 21 | ? | cli_testcase(Id,Groups,ArgumentsTemp,Description), |
| 22 | options_all_tests(Id,AdditionalArguments), | |
| 23 | append(ArgumentsTemp,AdditionalArguments,Arguments), | |
| 24 | (additional_configuration(Id,Conf) -> TestConfiguration = Conf ; TestConfiguration = []). | |
| 25 | ||
| 26 | ||
| 27 | skip_test(TestConfigurationInfos) :- | |
| 28 | member(skip,TestConfigurationInfos) -> true | |
| 29 | ; member(conditional_skip(Callable), TestConfigurationInfos), call(Callable). | |
| 30 | ||
| 31 | ||
| 32 | % options that should be used in all testcases | |
| 33 | options_all_tests(1303,['-strict']) :- !. | |
| 34 | options_all_tests(1351,['-strict']) :- !. % tests generate warnings and we still want to load the B machines | |
| 35 | options_all_tests(1658,['-strict']) :- !. | |
| 36 | options_all_tests(_,['-strict','-p','STRICT_RAISE_WARNINGS','TRUE']). | |
| 37 | ||
| 38 | :- use_module(tools,[host_platform/1,platform_is_64_bit/0]). | |
| 39 | additional_configuration(37, [conditional_skip(\+(platform_is_64_bit))]). /* CLP(FD) buffer overflow on win32 */ | |
| 40 | additional_configuration(43, [conditional_skip(\+(platform_is_64_bit))]). /* integer too large for 32-bit systems */ | |
| 41 | additional_configuration(50, [conditional_skip(host_platform(windows))]). | |
| 42 | additional_configuration(161, [conditional_skip(host_platform(windows))]). | |
| 43 | additional_configuration(271, [conditional_skip(host_platform(windows))]). | |
| 44 | %additional_configuration(324, [skip]). /* because only works if SMT mode is allowed to instantiate */ | |
| 45 | additional_configuration(539, [conditional_skip(host_platform(windows))]). | |
| 46 | additional_configuration(469, [conditional_skip(\+(platform_is_64_bit))]). /* timeout */ | |
| 47 | additional_configuration(767, [conditional_skip(\+(platform_is_64_bit))]). /* integer overflow on 32-bit systems */ | |
| 48 | %additional_configuration(865, [conditional_skip(host_platform(windows))]). | |
| 49 | additional_configuration(875, [skip]). % The type checker temporarily also allows {x|->y | x=y+1 } (added to support UNION/INTER with Prolog BParser) | |
| 50 | additional_configuration(943, [skip]). % Skip until we move to new parser | |
| 51 | additional_configuration(1101, [conditional_skip(\+(platform_is_64_bit))]). % not enough memory | |
| 52 | additional_configuration(1102, [conditional_skip(\+(platform_is_64_bit))]). % not enough memory | |
| 53 | additional_configuration(1103, [conditional_skip(\+(platform_is_64_bit))]). % not enough memory | |
| 54 | additional_configuration(1131, [conditional_skip(\+(platform_is_64_bit))]). % not enough memory | |
| 55 | additional_configuration(1157, [conditional_skip(\+(platform_is_64_bit))]). % not enough memory | |
| 56 | 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?! */ | |
| 57 | additional_configuration(1207, [conditional_skip(\+(platform_is_64_bit))]). /* integer overflow on 32-bit systems */ | |
| 58 | additional_configuration(1360, [conditional_skip(\+(platform_is_64_bit))]). /* funnily enough: no clpfd overflow */ | |
| 59 | %additional_configuration(810, [conditional_skip(host_platform(windows))]). /* java heap space */ | |
| 60 | additional_configuration(967, [skip]). % the proof of the invariant relies on the theorem, which is proven but has wd-problem | |
| 61 | additional_configuration(844, [skip]). % repl option is not anymore available | |
| 62 | additional_configuration(988, [skip]). % skip test case until merging 'feature/avl_sets_csp' with 'develop' | |
| 63 | additional_configuration(987, [skip]). % no reductions can be gained in this test case | |
| 64 | additional_configuration(1086, [skip]). | |
| 65 | additional_configuration(1316, [conditional_skip(host_platform(windows))]). | |
| 66 | additional_configuration(1441, [conditional_skip(\+(platform_is_64_bit))]). /* timeout */ | |
| 67 | additional_configuration(1447, [conditional_skip(\+(platform_is_64_bit))]). /* timeout */ | |
| 68 | additional_configuration(1448, [skip]). /* PO 'axm2/WD' no longer provable due to change of cardinality3 block declaration; should be fixed by merging kernel_cardinality */ | |
| 69 | additional_configuration(1452, [conditional_skip(\+(platform_is_64_bit))]). /* timeout */ | |
| 70 | additional_configuration(1609, [conditional_skip(\+(platform_is_64_bit))]). /* integer overflow on 32-bit systems */ | |
| 71 | additional_configuration(1654, [conditional_skip(host_platform(windows))]). % file contains unicode and can not be checked out properly on windows | |
| 72 | additional_configuration(1716, [conditional_skip(\+(platform_is_64_bit))]). /* timeout */ | |
| 73 | additional_configuration(1771, [conditional_skip(host_platform(windows))]). | |
| 74 | additional_configuration(1792, [conditional_skip(\+(platform_is_64_bit))]). /* CLP(FD) overflow on win32 */ | |
| 75 | ||
| 76 | % skipped due to failing assertion in z3 | |
| 77 | % apparently, something is broken in the translation | |
| 78 | additional_configuration(1812, [skip]). % seems to work now on Mac | |
| 79 | additional_configuration(1815, [skip]). % seems to work now on Mac | |
| 80 | ||
| 81 | additional_configuration(1947, [conditional_skip(host_platform(linux))]). % also something broken in Z3 on Linux only | |
| 82 | ||
| 83 | % 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 ** .... --> ) | |
| 84 | additional_configuration(129, [skip]). | |
| 85 | additional_configuration(130, [skip]). | |
| 86 | additional_configuration(131, [skip]). | |
| 87 | additional_configuration(132, [skip]). | |
| 88 | additional_configuration(333, [skip]). | |
| 89 | additional_configuration(334, [skip]). | |
| 90 | additional_configuration(1308, [skip]). % Kodkod test, now fails with more conservative card treatment, 20th April 2016, git sha: a422afcd2949b8b0a40821f0029b41240935e695 | |
| 91 | additional_configuration(1552, [skip]). % removed unsafe function application treatment in b_compiler, 22nd July 2016 | |
| 92 | additional_configuration(1705, [skip]). % requires feature b_write_eventb_machine_to_classicalb_to_file to be added to cli_start_mc_with_tlc | |
| 93 | additional_configuration(1755, [skip]). % requires solving test 614, 1101 for new UNION translation | |
| 94 | additional_configuration(1791, [skip]). % skip until new Parser available | |
| 95 | additional_configuration(1809, [skip]). % skip until Kodkod problem solved | |
| 96 | ||
| 97 | % these machines cannot be model checked symbolically as of now | |
| 98 | % solvers / provers are too weak | |
| 99 | % or they just take too long | |
| 100 | additional_configuration(1431, [skip]). | |
| 101 | additional_configuration(1582, [skip]). | |
| 102 | additional_configuration(1583, [skip]). | |
| 103 | additional_configuration(1585, [skip]). | |
| 104 | ||
| 105 | ||
| 106 | % ----------------------------------- | |
| 107 | ||
| 108 | cli_testcase(0, [unit], ['-selfcheck', '-strict', '-p', 'CLPFD', 'FALSE'], 'Unit tests'). | |
| 109 | cli_testcase(1, [unit], ['-selfcheck', '-strict', '-p', 'CLPFD', 'TRUE'], 'Unit tests (with CLPFD)'). | |
| 110 | cli_testcase(2, [unit], ['-selfcheck', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SYMBOLIC', 'TRUE'], 'Unit tests (with CLPDFD and SYMBOLIC)'). | |
| 111 | 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'). | |
| 112 | cli_testcase(4, [b_test], ['-t', '-strict', '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/DefinitionScopeOk.mch'], 'DEFINITION scope test'). | |
| 113 | cli_testcase(5, [b_test], ['-t', '-strict', '../prob_examples/public_examples/B/FeatureChecks/ForAll_VariousVersions.mch'], 'For all test'). | |
| 114 | cli_testcase(6, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/NotMemberCheck.mch', '-t', '-strict', '-assertions', '-expcterr', virtual_time_out], 'Not member closures test'). | |
| 115 | cli_testcase(7, [bench], ['../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.mch', '-t', '-strict'], 'Carla Travel Agency trace check'). | |
| 116 | cli_testcase(8, [bench], ['../prob_examples/public_examples/B/Benchmarks/RouteIsSeq.mch', '-t', '-strict'], ''). | |
| 117 | cli_testcase(9, [bench], ['../prob_examples/public_examples/B/Benchmarks/Sets2.mch', '-t', '-strict'], ''). | |
| 118 | cli_testcase(10, [bench], ['../prob_examples/public_examples/B/Benchmarks/Doors.mch', '-t', '-strict'], ''). | |
| 119 | cli_testcase(11, [bench], ['../prob_examples/public_examples/B/Benchmarks/DSP0.mch', '-t', '-mc', '100', '-noinv', '-strict', '-nodead', '-expcterr', 'model_check_incomplete'], ''). | |
| 120 | cli_testcase(12, [bench], ['../prob_examples/public_examples/B/Benchmarks/DSP0_complicated_initialisation.mch', '-t', '-mc', '100', '-noinv', '-strict', '-nodead', '-expcterr', 'model_check_incomplete'], ''). | |
| 121 | cli_testcase(13, [bench], ['../prob_examples/public_examples/B/Benchmarks/CSM.mch', '-mc', '1000', '-strict', '-check_complete', '-cc', '341', '1229'], 'Model check CSM'). | |
| 122 | cli_testcase(14, [bench], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-t', '-mc', '100', '-strict', '-check_complete', '-cc', '36', '121'], 'Model check scheduler'). | |
| 123 | cli_testcase(15, [bench], ['../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', '-t', '-mc', '100', '-expcterr', 'model_check_incomplete', '-strict'], 'Model check phonebook7'). | |
| 124 | cli_testcase(16, [bench], ['../prob_examples/public_examples/B/Benchmarks/tictac.mch', '-mc', '100', '-noinv', '-nodead', '-expcterr', 'model_check_incomplete', '-strict'], ''). | |
| 125 | cli_testcase(17, [bench,case], ['../prob_examples/public_examples/B/Benchmarks/Teletext_bench.mch', '-mc', '100', '-strict'], ''). | |
| 126 | cli_testcase(18, [bench], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-t', '-strict'], ''). | |
| 127 | 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'], ''). | |
| 128 | cli_testcase(20, [performance_tests], ['../prob_examples/public_examples/B/Daniel/Kodkod/Power2Nr.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE', '-aa', '4', '0', '0'], ''). | |
| 129 | cli_testcase(21, [performance_tests], ['../prob_examples/public_examples/B/Daniel/Kodkod/Power2Nr.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE', '-ma', '4', '0', '0'], ''). | |
| 130 | cli_testcase(22, [performance_tests], ['../prob_examples/public_examples/B/Daniel/Kodkod/StarTopologySingleSol.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], ''). | |
| 131 | cli_testcase(23, [performance_tests,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/conc_seq_test.mch', '-strict', '-t'], 'concatenation test'). | |
| 132 | cli_testcase(24, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/LargeSets/PartialFunCheck.mch', '-strict', '-t'], ''). | |
| 133 | cli_testcase(25, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAll_NATURAL.mch', '-strict', '-t'], ''). | |
| 134 | cli_testcase(26, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion.mch', '-strict', '-t'], ''). | |
| 135 | cli_testcase(27, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansian_Cartesian.mch', '-strict', '-t', '-assertions'], ''). | |
| 136 | cli_testcase(28, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion_Cartesian2.mch', '-strict', '-t', '-assertions', '-p', 'CLPFD', 'FALSE'], ''). | |
| 137 | cli_testcase(29, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion_Cartesian2.mch', '-strict', '-t', '-assertions', '-p', 'CLPFD', 'TRUE'], ''). | |
| 138 | cli_testcase(30, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ForAll/ForAllExpansion_Cartesian3.mch', '-strict', '-t', '-assertions'], ''). | |
| 139 | cli_testcase(31, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/LargeSets/SeqCheck.mch', '-strict', '-t'], ''). | |
| 140 | cli_testcase(32, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SetLogInefficiencies.mch', '-t', '-strict'], ''). | |
| 141 | cli_testcase(33, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SetLogInefficiencies2.mch', '-t', '-strict'], ''). | |
| 142 | cli_testcase(34, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SetLogInefficiencies3.mch', '-t', '-strict'], ''). | |
| 143 | cli_testcase(35, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteClosures.mch', '-strict', '-t'], ''). | |
| 144 | cli_testcase(36, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteClosures2.mch', '-strict', '-t'], ''). | |
| 145 | cli_testcase(37, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteAbsSqrt.mch', '-strict', '-t'], ''). | |
| 146 | cli_testcase(38, [performance_tests,card], ['../prob_examples/public_examples/B/PerformanceTests/InfCardChecks.mch', '-p', 'CLPFD', 'TRUE', '-strict', '-t'], ''). | |
| 147 | cli_testcase(39, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ID_Checks.mch', '-strict', '-t', '-assertions'], ''). | |
| 148 | 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.'). | |
| 149 | cli_testcase(41, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/DirectProductPerformance.mch', '-strict', '-init', '-p', 'SYMBOLIC', 'TRUE', '-p', 'TIME_OUT', '15000'], ''). | |
| 150 | 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], ''). | |
| 151 | % StartSieve generates virtual_time_out | |
| 152 | cli_testcase(43, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/BinomialCoefficients.mch', '-t', '-strict'], ''). | |
| 153 | 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], ''). | |
| 154 | cli_testcase(45, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/GraphIso/CheckGraphIsomorphism.mch', '-t', '-strict', '-l', 'log/CheckGraphIsomorphism.log'], ''). | |
| 155 | cli_testcase(46, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/GraphIso/CheckLargeGraphIsomorphismAsConstants.mch', '-t', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '5000'], ''). | |
| 156 | cli_testcase(47, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/Theories/FiniteSequences1.mch', '-t', '-mc', '100', '-expcterr', 'model_check_incomplete', '-strict'], ''). | |
| 157 | cli_testcase(48, [performance_tests], ['../prob_examples/public_examples/B/Mathematical/Theories/FiniteSequences2.mch', '-t', '-mc', '100', '-expcterr', 'model_check_incomplete', '-strict'], ''). | |
| 158 | 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'). | |
| 159 | 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 | |
| 160 | cli_testcase(51, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/MaxPropagation.mch', '-strict', '-t'], ''). | |
| 161 | cli_testcase(52, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/MaxPropagation2.mch', '-strict', '-t'], ''). | |
| 162 | cli_testcase(53, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/SetMembershipInference.mch', '-strict', '-t'], ''). | |
| 163 | cli_testcase(54, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/SetMembershipReification.mch', '-strict', '-t'], ''). | |
| 164 | cli_testcase(55, [performance_tests,codespeed], ['../prob_examples/public_examples/B/Demo/SortByPermutation_v2.mch', '-strict', '-t','-p', 'TIME_OUT', '7000'], ''). | |
| 165 | cli_testcase(56, [performance_tests,codespeed], ['../prob_examples/public_examples/B/IPD/colouring/GraphColouringNAT2.mch', '-t', '-strict'], ''). | |
| 166 | cli_testcase(57, [performance_tests,codespeed], ['../prob_examples/public_examples/EventBPrologPackages/Puzzles/Instance_small_60_400_9_ctx.eventb', '-init', '-strict', '-p', 'CLPFD', 'TRUE'], ''). | |
| 167 | cli_testcase(58, [performance_tests], ['../prob_examples/public_examples/B/BZTT/PO_Scheduler.mch', '-mc', '100', '-strict', '-t', '-nodead'], ''). | |
| 168 | cli_testcase(59, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/IDL_SimpleUnsat.mch', '-strict', '-init', '-expcterr', 'setup_constants_fails'], ''). | |
| 169 | cli_testcase(60, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/int_completeness1.mch', '-strict', '-init', '-p', 'CLPFD', 'TRUE', '-expcterr', 'setup_constants_fails'], ''). | |
| 170 | cli_testcase(61, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/int_completeness1_event.mch', '-strict', '-p', 'CLPFD', 'TRUE', '-t'], ''). | |
| 171 | cli_testcase(62, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SMTLIB/SquareEquivalenceProblem.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE', '-mc', '10', '-cc', '2', '2'], ''). | |
| 172 | cli_testcase(63, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/clpfd_constraint_checks/IntegerComprSets.mch', '-strict', '-t'], ''). | |
| 173 | cli_testcase(64, [performance_tests], ['../prob_examples/public_examples/B/PerformanceTests/SeqEnumWithLargeMAXINT.mch', '-strict', '-t'], ''). | |
| 174 | cli_testcase(65, [performance_tests,sequences,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/ConstraintPropagation/SequenceSolving.mch', '-strict', '-t'], ''). | |
| 175 | cli_testcase(66, [performance_tests,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/SAT_Tests/SubsetReificationTest.mch', '-strict', '-t'], ''). | |
| 176 | cli_testcase(67, [symmtest], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/monitor2.mch', '-mc', '100', '-cc', '15', '92', '-p', 'SYMMETRY_MODE', 'nauty', '-strict'], ''). | |
| 177 | cli_testcase(68, [symmtest], ['-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'], ''). | |
| 178 | cli_testcase(69, [symmtest], ['-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'], ''). | |
| 179 | cli_testcase(70, [symmtest], ['-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'], ''). | |
| 180 | cli_testcase(71, [symmtest], ['-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'], ''). | |
| 181 | cli_testcase(72, [symmtest], ['-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'], ''). | |
| 182 | cli_testcase(73, [symmtest], ['-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'], ''). | |
| 183 | cli_testcase(74, [symmtest], ['-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 | |
| 184 | cli_testcase(75, [symmtest], ['-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 | |
| 185 | cli_testcase(76, [symmtest], ['-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'], ''). | |
| 186 | cli_testcase(77, [symmtest], ['-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 | |
| 187 | cli_testcase(78, [symmtest], ['-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 | |
| 188 | cli_testcase(79, [symmtest], ['-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 | |
| 189 | cli_testcase(80, [symmtest], ['-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 | |
| 190 | cli_testcase(81, [symmtest], ['-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 | |
| 191 | cli_testcase(82, [symmtest], ['-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 | |
| 192 | cli_testcase(83, [symmtest], ['-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 | |
| 193 | cli_testcase(84, [symmtest], ['-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 | |
| 194 | cli_testcase(85, [symmtest], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/PairRelation.mch', '-mc', '100', '-cc', '39', '173', '-p', 'DEFAULT_SETSIZE', '3', '-strict'], ''). | |
| 195 | cli_testcase(86, [symmtest], ['-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'], ''). | |
| 196 | cli_testcase(87, [symmtest], ['-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'], ''). | |
| 197 | cli_testcase(88, [symmtest], ['-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'], ''). | |
| 198 | cli_testcase(89, [symmtest], ['-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'], ''). | |
| 199 | cli_testcase(90, [symmtest], ['-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'], ''). | |
| 200 | cli_testcase(91, [symmtest], ['-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'], ''). | |
| 201 | cli_testcase(92, [symmtest], ['-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'], ''). | |
| 202 | cli_testcase(93, [symmtest], ['-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'], ''). | |
| 203 | cli_testcase(94, [symmtest], ['-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'], ''). | |
| 204 | cli_testcase(95, [symmtest], ['-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'], ''). | |
| 205 | cli_testcase(96, [symmtest], ['-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'], ''). | |
| 206 | cli_testcase(97, [symmtest], ['-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'], ''). | |
| 207 | cli_testcase(98, [symmtest], ['../prob_examples/public_examples/B/SymmetryReduction/USB_4Endpoints.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'nauty', '-cc', '355', '11220', '-strict'], ''). | |
| 208 | cli_testcase(99, [symmtest,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'). | |
| 209 | cli_testcase(100, [symmtest], ['../prob_examples/public_examples/B/SymmetryReduction/USB_4Endpoints.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'flood', '-cc', '694', '11572', '-strict'], ''). | |
| 210 | cli_testcase(101, [symmtest], ['../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'], ''). | |
| 211 | cli_testcase(102, [symmtest,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], ''). | |
| 212 | cli_testcase(103, [symmtest], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch', '-mc', '10000', '-p', 'SYMMETRY_MODE', 'off', '-cc', '731', '2187', '-nogoal', '-strict'], ''). | |
| 213 | cli_testcase(104, [symmtest], ['../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 | |
| 214 | cli_testcase(105, [symmtest], ['../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 | |
| 215 | cli_testcase(106, [symmtest,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'], ''). | |
| 216 | cli_testcase(107, [symmtest], ['-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'], ''). | |
| 217 | cli_testcase(108, [symmtest], ['-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'], ''). | |
| 218 | cli_testcase(109, [symmtest], ['-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'], ''). | |
| 219 | cli_testcase(110, [symmtest], ['../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'], ''). | |
| 220 | cli_testcase(111, [symmtest], ['../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 | |
| 221 | cli_testcase(112, [symmtest], ['../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 | |
| 222 | cli_testcase(113, [symmtest], ['../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'], ''). | |
| 223 | cli_testcase(114, [symmtest], ['../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 | |
| 224 | cli_testcase(115, [symmtest], ['../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 | |
| 225 | cli_testcase(116, [symmtest], ['../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'], ''). | |
| 226 | cli_testcase(117, [symmtest], ['../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'], ''). | |
| 227 | cli_testcase(118, [symmtest], ['../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 | |
| 228 | cli_testcase(119, [symmtest], ['../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 | |
| 229 | cli_testcase(120, [symmtest], ['../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'], ''). | |
| 230 | cli_testcase(121, [symmtest], ['../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'], ''). | |
| 231 | cli_testcase(122, [symmtest], ['../prob_examples/public_examples/B/SymmetryReduction/PhilRing.mch', '-mc', '1000', '-p', 'DEFAULT_SETSIZE', '2', '-p', 'SYMMETRY_MODE', 'nauty', '-cc', '8', '18', '-strict'], ''). | |
| 232 | cli_testcase(123, [symmtest], ['../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 | |
| 233 | cli_testcase(124, [symmtest], ['../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 | |
| 234 | cli_testcase(125, [symmtest], ['../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 | |
| 235 | cli_testcase(126, [symmtest], ['../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 | |
| 236 | 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 | |
| 237 | cli_testcase(128, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_1_mch.eventb', '-t', '-strict', '-expcterr', virtual_time_out], ''). | |
| 238 | cli_testcase(129, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_2_mch.eventb', '-t', '-p', 'CLPFD', 'FALSE', '-strict'], ''). | |
| 239 | cli_testcase(130, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_2_mch.eventb', '-t', '-p', 'CLPFD', 'TRUE', '-strict'], ''). | |
| 240 | cli_testcase(131, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_3_0_mch.eventb', '-t', '-strict'], ''). | |
| 241 | cli_testcase(132, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon_4_0_mch.eventb', '-t', '-strict'], ''). | |
| 242 | cli_testcase(133, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Records/SampleThreeRecordsTranslated.mch', '-t', '-strict', '-mc', '100', '-cc', '4', '6'], 'Check record translation'). | |
| 243 | cli_testcase(134, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Records/INTEGER_Record.mch', '-t', '-strict', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE'], ''). | |
| 244 | cli_testcase(135, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Test1.0/Testid_mch.eventb', '-t', '-strict', '-pref_group', integer, int32, '-p', 'CLPFD', 'TRUE'], ''). | |
| 245 | cli_testcase(136, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/sieve.eventb', '-t', '-strict', '-mc', '1000', '-strict', '--hash64', 142217803204665821], 'Complete model check of Sieve'). | |
| 246 | cli_testcase(137, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_0.eventb', '-t', '-strict'], ''). | |
| 247 | cli_testcase(138, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_1.eventb', '-t', '-strict'], ''). | |
| 248 | cli_testcase(139, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_3.eventb', '-t', '-strict'], ''). | |
| 249 | cli_testcase(140, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-t', '-strict'], ''). | |
| 250 | 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], ''). | |
| 251 | cli_testcase(142, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Stefan_SecureBuilding/M21_mch.eventb', '-mc', '10000', '-t', '-strict'], ''). | |
| 252 | 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'], ''). | |
| 253 | 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'], ''). | |
| 254 | cli_testcase(145, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Test1.0/Testprj_mch.eventb', '-t', '-strict', '-p', 'MAXINT', '99999', '-p', 'MININT', '-99999'], ''). | |
| 255 | cli_testcase(146, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Test1.0/TestPartition_mch.eventb', '-t', '-strict'], 'Partition for Event-B'). | |
| 256 | cli_testcase(147, [eventb_test], ['../prob_examples/public_examples/B/EventB_AtelierB/Lift.sys', '-t', '-strict'], ''). | |
| 257 | 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'], ''). | |
| 258 | cli_testcase(149, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Convergence/countdown_r_mch.eventb', '-mc', '100', '-strict', '-p', 'NUMBER_OF_ANIMATED_ABSTRACTIONS', '20', '-cc', '7', '7', '--hash64', 714084921427841469], ''). | |
| 259 | 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'], ''). | |
| 260 | 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'], ''). | |
| 261 | 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'], ''). | |
| 262 | 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'], ''). | |
| 263 | 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'], ''). | |
| 264 | 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'], ''). | |
| 265 | 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'], ''). | |
| 266 | 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'], ''). | |
| 267 | 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'], ''). | |
| 268 | cli_testcase(159, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/MultiLevel/TheoremsInGuardsOK.eventb', '-mc', '10', '-nodead', '-strict'], ''). | |
| 269 | 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'], ''). | |
| 270 | cli_testcase(161, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/CompareWithFDR/GenPrime.csp', '-t', '-strict'], ''). | |
| 271 | cli_testcase(162, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/buses.csp', '-t', '-strict'], ''). | |
| 272 | cli_testcase(163, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/Peterson_v2.csp', '-t', '-strict', '-mc',1000, '-cc', 215, 429], ''). | |
| 273 | cli_testcase(164, [csp_test], ['-c', '../prob_examples/public_examples/CSP/mydemos/demo/mbuff.csp', '-t', '-strict'], ''). | |
| 274 | cli_testcase(165, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/crossing.csp', '-t', '-strict', '-mc', '3910'], ''). | |
| 275 | cli_testcase(166, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/SetCompTests.csp', '-t', '-strict'], ''). | |
| 276 | cli_testcase(167, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/SimpleCompLinkedPar.csp', '-t', '-strict'], ''). | |
| 277 | cli_testcase(168, [csp_test], ['-c', '../prob_examples/public_examples/CSP/mydemos/SequenceComprTests2.csp', '-t', '-strict', '-v'], ''). | |
| 278 | cli_testcase(169, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/BigUnionInterTests.csp', '-t', '-strict'], ''). | |
| 279 | cli_testcase(170, [csp_test], ['../prob_examples/public_examples/B/Tickets/299/faust_deadlock.csp', '-mc', '100000', '-strict', '-expcterr', 'deadlock'], ''). | |
| 280 | cli_testcase(171, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/LargeStateSpace.csp', | |
| 281 | '-silent', '-mc', '999999', '-cc', '101102', '101101', '-strict', '-expcterr', 'deadlock'], 'Long counter-example trace'). | |
| 282 | cli_testcase(172, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/RenameRecordPattern.csp', '-mc', '999999', '-t', '-strict'], ''). | |
| 283 | cli_testcase(173, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/RenameRecordPattern2.csp', '-t', '-assertions', '-strict'], ''). | |
| 284 | cli_testcase(174, [csp_test], ['../prob_examples/public_examples/CSP/FDRFeatureTests/SimpleRefTest.csp', '-assertions', '-strict'], ''). | |
| 285 | cli_testcase(175, [csp_test], ['../prob_examples/public_examples/CSP/fontaine/RecDataType.csp', '-t', '-strict'], ''). | |
| 286 | cli_testcase(176, [csp_test], ['../prob_examples/public_examples/CSP/fontaine/RecDataTypeFunctions.csp', '-t', '-strict'], ''). | |
| 287 | 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'], ''). | |
| 288 | 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'], ''). | |
| 289 | cli_testcase(179, [csp_test], ['../prob_examples/public_examples/CSP/UML_Compass/Microwave.csp', '-assertions', '-strict'], ''). | |
| 290 | cli_testcase(180, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/roscoe_section2-2.csp', '-assertions', '-strict'], ''). | |
| 291 | cli_testcase(181, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/ref_benchmarks/SimpleDeadlockCheck.csp', '-assertions', '-strict'], ''). | |
| 292 | cli_testcase(182, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/simple/DivChecks.csp', '-assertions', '-strict'], ''). | |
| 293 | cli_testcase(183, [csp_test,csp_bench], ['../prob_examples/public_examples/CSP/other/Ivo/Failure_Divergence_Tests.csp', '-assertions', '-strict'], ''). | |
| 294 | cli_testcase(184, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Deadlock_Skip_Tests.csp', '-assertions', '-strict'], ''). | |
| 295 | cli_testcase(185, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Failures_Tests.csp', '-assertions', '-strict'], ''). | |
| 296 | cli_testcase(186, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/AgentErrorsLetWithIn.csp', '-assertions', '-strict'], ''). | |
| 297 | cli_testcase(188, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/Deterministic_simple_v2.csp', '-assertions', '-strict'], ''). | |
| 298 | cli_testcase(189, [csp_test,codespeed], ['../prob_examples/public_examples/CSP/ref_benchmarks/abp_chapter5_roscoe_bench.csp', '-assertions', '-strict'], 'Roscoe chapter 5 tests'). | |
| 299 | cli_testcase(190, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/ucs1.csp', '-assertions', '-strict'], ''). | |
| 300 | cli_testcase(191, [csp_test], ['../prob_examples/public_examples/CSP/simple/check_print.csp', '-t', '-strict'], ''). | |
| 301 | cli_testcase(192, [csp_test], ['../prob_examples/public_examples/CSP/simple/check_set_compr_pat.csp', '-t', '-mc', '1000', '-nodead', '-cc', '6', '10', '-strict'], ''). | |
| 302 | cli_testcase(193, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/failsim.csp', '-assertions', '-strict'], ''). | |
| 303 | cli_testcase(194, [typechecker_test], ['../prob_examples/public_examples/B/Tickets/305/Environment.mch', '-t', '-strict'], ''). | |
| 304 | cli_testcase(195, [typechecker_test], ['../prob_examples/public_examples/B/Tickets/308/Basic_Controller.mch', '-t', '-mc', '100', '-strict', '-expcterr', 'model_check_incomplete'], ''). | |
| 305 | cli_testcase(196, [typechecker_test,unit], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/expressions.mch', '-strict'], ''). | |
| 306 | ||
| 307 | % SBMF 2010 | |
| 308 | cli_testcase(197, [counterex], ['../prob_examples/public_examples/B/Counterexamples/CarlaTravelAgencyErr.mch', '-mc', '1000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF TravelAgency'). | |
| 309 | 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'). | |
| 310 | 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'). | |
| 311 | cli_testcase(200, [counterex], ['../prob_examples/public_examples/B/PerformanceTests/BreadthFirstTest.mch', '-mc', '100000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF BFTest'). | |
| 312 | cli_testcase(201, [counterex], ['../prob_examples/public_examples/B/PerformanceTests/DepthFirstTest.mch', '-mc', '100000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF DFTest'). | |
| 313 | cli_testcase(202, [counterex], ['../prob_examples/public_examples/B/SymmetryReduction/Peterson_err.mch', '-mc', '10000', '-expcterr', 'invariant_violation', '-strict'], 'SBMF Peterson_err'). | |
| 314 | cli_testcase(203, [counterex], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-mc', '10000', '-strict', '-expcterr', 'deadlock'], ''). | |
| 315 | cli_testcase(204, [counterex], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M3_mch.eventb', '-mc', '10000', '-strict', '-expcterr', 'deadlock'], ''). | |
| 316 | cli_testcase(205, [counterex,infinite,total_function], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_infinite_int.eventb', '-p', 'CLPFD', 'TRUE', | |
| 317 | '-p', 'DEFAULT_SETSIZE', 3, | |
| 318 | '-t', '-expcterr', virtual_time_out ], 'Requires total function from NATURAL to TC_Type; now succeeds again'). % was '-expcterr', setup_constants_fails | |
| 319 | ||
| 320 | cli_testcase(206, [log_performance_tests], ['../prob_examples/public_examples/EventBPrologPackages/sieve.eventb', '-mc', '1000', '-l', 'log/sieve.log', '-strict', '--hash64', 142217803204665821], ''). | |
| 321 | cli_testcase(207, [puzzles_test], ['../prob_examples/public_examples/B/Demo/RussianPostalPuzzle.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 322 | cli_testcase(208, [puzzles_test], ['../prob_examples/public_examples/B/Demo/TrainTorchPuzzle.mch', '-mc', '10000', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 323 | cli_testcase(209, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/BlocksWorldGeneric.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 324 | cli_testcase(210, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Farmer.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 325 | cli_testcase(211, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 326 | cli_testcase(212, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 327 | cli_testcase(213, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi8.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 328 | cli_testcase(214, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch', '-p', 'SYMMETRY_MODE', 'hash', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 329 | cli_testcase(215, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi6Sym.mch','-p','SYMMETRY_MODE','hash','-mc','10000','-card','Stakes','4','-expcterr','goal_found'], ''). | |
| 330 | cli_testcase(216, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi8Sym.mch', '-p', 'SYMMETRY_MODE', 'hash', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 331 | cli_testcase(217, [puzzles_test,xtl], ['-mc', '10000', '../prob_examples/public_examples/XTL/Hanoi.P', '-nodead', '-expcterr', 'xtl_error'], 'Test XTL Hanoi example'). | |
| 332 | cli_testcase(218, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/water.mch', '-mc', '10000', '-expcterr', 'goal_found'], ''). | |
| 333 | cli_testcase(219, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/LatinSquares.mch', '-mc', '10000', '-p', 'MAXINT', 5, '-expcterr', deadlock], ''). | |
| 334 | cli_testcase(220, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/CrewAllocationConstants.mch', '-t', '-p', 'TIME_OUT', '5000', '-p', 'CLPFD', 'FALSE'], ''). | |
| 335 | cli_testcase(221, [puzzles_test,codespeed], ['../prob_examples/public_examples/B/Puzzles/CrewAllocationConstants.mch', '-t', '-p', 'TIME_OUT', '8000', '-p', 'CLPFD', 'TRUE'], ''). | |
| 336 | cli_testcase(222, [b_test,cruise,codespeed], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '25696', '-strict', '--hash64', 203058745203935766, '-p', 'MAX_INITIALISATIONS', 5], 'Complete Model Check of Cruise Controller'). % 8.12.2015: adapted hash from 212678735433640605 for new order of variables | |
| 337 | 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'], ''). | |
| 338 | cli_testcase(224, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TwoOpsSameName.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 339 | cli_testcase(225, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/PreCondViolated.mch', '-mc', '10', '-strict', '-expcterr', 'precondition_error'], ''). | |
| 340 | cli_testcase(226, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/AssertCondViolated.mch', '-mc', '10', '-strict', '-expcterr', 'assert_error'], ''). | |
| 341 | cli_testcase(227, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopOk.mch', '-t', '-mc', '30', '-p', 'MAX_OPERATIONS', 30, '-strict'], ''). | |
| 342 | cli_testcase(228, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopVariantError.mch', '-mc', '10', '-strict', '-expcterr', 'while_variant_error'], ''). | |
| 343 | cli_testcase(229, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopVariantErr2.mch', '-mc', '10', '-strict', '-expcterr', 'while_variant_error'], ''). | |
| 344 | cli_testcase(230, [error_checks,while], ['../prob_examples/public_examples/B/ErrorMachines/WhileLoopInvariantError.mch', '-mc', '10', '-strict', '-expcterr', 'while_invariant_violation'], ''). | |
| 345 | cli_testcase(231, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/FunLaws_wderror.mch', '-mc', '2500', '-strict', '-expcterr', 'well_definedness_error', '-expcterr', 'well_definedness_error'], ''). | |
| 346 | cli_testcase(232, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/DivByZero.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). | |
| 347 | 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'], ''). | |
| 348 | cli_testcase(234, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/DivByZeroInsideNotExists.mch', '-strict', '-init', '-expcterr', 'well_definedness_error', '-expcterr', 'setup_constants_inconsistent'], ''). | |
| 349 | cli_testcase(235, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/PowerOfNegativeNumber.mch', '-strict', '-t', '-expcterr', 'well_definedness_error'], ''). | |
| 350 | cli_testcase(236, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedInter.mch', '-init', '-animate', '1', '-strict', '-expcterr', 'well_definedness_error','-expcterr', 'animate'], ''). | |
| 351 | 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'], ''). | |
| 352 | cli_testcase(238, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/MaxOfEmptySet.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). | |
| 353 | cli_testcase(239, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedArithmetic/MinOfEmptySet.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). | |
| 354 | cli_testcase(240, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedSeqOperations/LastEmptySeq.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). | |
| 355 | cli_testcase(241, [error_checks,wd], ['../prob_examples/public_examples/B/ErrorMachines/UndefinedSeqOperations/FrontEmptySeq.mch', '-init', '-strict', '-expcterr', 'well_definedness_error'], ''). | |
| 356 | cli_testcase(242, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/OpCalls/Caller.mch', '-strict', '-expcterr', 'precondition_error', '-mc', '100'], ''). | |
| 357 | 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'). | |
| 358 | cli_testcase(244, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError1.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 359 | cli_testcase(245, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError2.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 360 | cli_testcase(246, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError3.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 361 | cli_testcase(247, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/TypeError4.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 362 | cli_testcase(248, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/CstDefError1.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 363 | cli_testcase(249, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/CstDefError2.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 364 | cli_testcase(250, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/ParameterError1.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 365 | 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], ''). | |
| 366 | cli_testcase(252, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/AssignmentToParameterErr.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 367 | cli_testcase(253, [error_checks], ['../prob_examples/public_examples/B/ErrorMachines/NoTypingForPara.mch', '-strict', '-expcterr', 'type_error', '-expcterr', 'load_main_file'], ''). | |
| 368 | cli_testcase(254, [error_checks,parser], ['../prob_examples/public_examples/B/ErrorMachines/RecursiveDefinition.mch', '-strict', '-expcterrpos', 'parse_error', 10, 0, '-expcterr', 'load_main_file'], ''). | |
| 369 | 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'], ''). | |
| 370 | cli_testcase(256, [tickets,card], ['../prob_examples/public_examples/B/Tickets/184/ModeProtocolMachine_mch.eventb', '-mc', '200000', '-noass', '-p', 'MAX_INITIALISATIONS', '10', '-c', '--goal', 'card(incoming(MnAOC))>0 & card(outgoing(MnAOC))>0', '-strict', '-expcterr', 'goal_found'], ''). | |
| 371 | cli_testcase(257, [tickets], ['../prob_examples/public_examples/B/Tickets/102/Bijections_mch.eventb', '-t', '-mc', '1000', '-nodead', '-strict'], ''). | |
| 372 | cli_testcase(258, [tickets], ['../prob_examples/public_examples/B/Tickets/102/PartialInjections_mch.eventb', '-t', '-mc', '1000', '-nodead', '-strict'], ''). | |
| 373 | cli_testcase(259, [tickets], ['../prob_examples/public_examples/B/Tickets/102/PartialFunctions_mch.eventb', '-mc', '1000', '-nodead', '-strict'], ''). | |
| 374 | cli_testcase(260, [tickets], ['../prob_examples/public_examples/B/Tickets/102/Relations_mch.eventb', '-mc', '1000', '-nodead', '-strict'], ''). | |
| 375 | cli_testcase(261, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalFunctions_mch.eventb', '-mc', '1000', '-nodead', '-strict'], ''). | |
| 376 | cli_testcase(262, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalInjections_mch.eventb', '-mc', '1000', '-nodead', '-strict'], ''). | |
| 377 | cli_testcase(263, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalSurjections_mch.eventb', '-mc', '1000', '-t', '-nodead', '-strict'], ''). | |
| 378 | cli_testcase(264, [tickets], ['../prob_examples/public_examples/B/Tickets/102/PartialSurjections_mch.eventb', '-mc', '1000', '-t', '-nodead', '-strict'], ''). | |
| 379 | cli_testcase(265, [tickets], ['../prob_examples/public_examples/B/Tickets/102/TotalRelations_mch.eventb', '-mc', '1000', '-t', '-nodead', '-strict'], ''). | |
| 380 | cli_testcase(266, [tickets], ['../prob_examples/public_examples/B/Tickets/Sven1/AbsIntern.mch', '-t', '-strict'], ''). | |
| 381 | cli_testcase(267, [tickets], ['../prob_examples/public_examples/B/Tickets/Sven1/AbsInternCst.mch', '-t', '-strict'], ''). | |
| 382 | cli_testcase(268, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio1/MAX_BIT_VECTOR_DEFINITION_v2.mch', '-t', '-strict', '-properties'], ''). | |
| 383 | cli_testcase(269, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio1/MAX_BIT_VECTOR_DEFINITION_v2.mch', '-t', '-strict', '-p', 'SYMBOLIC', 'TRUE'], ''). | |
| 384 | 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' | |
| 385 | 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' | |
| 386 | 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'], ''). | |
| 387 | 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' | |
| 388 | cli_testcase(274, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/POWER2_v2.mch', '-init', '-strict', '-aa', '19', '0', '0'], ''). | |
| 389 | cli_testcase(275, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/POWER2.mch', '-init', '-strict', '-ma', '18', '0', '0'], ''). | |
| 390 | cli_testcase(276, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio4/FailingInit1.mch', '-init', '-strict', '-expcterr', 'initialisation_fails', '-expcterr', bmachine_static_checks], ''). | |
| 391 | 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], ''). | |
| 392 | 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], ''). | |
| 393 | cli_testcase(279, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio4/FailingInit4.mch', '-init', '-strict', '-expcterr', 'initialisation_fails', '-expcterr', bmachine_static_checks], ''). | |
| 394 | 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], ''). | |
| 395 | cli_testcase(281, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio6/Z80_Simple.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], ''). | |
| 396 | cli_testcase(282, [tickets], ['../prob_examples/public_examples/B/Tickets/Alstom1/TestBecomesElementOf.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], 'becomes element of cartesian product'). | |
| 397 | cli_testcase(283, [tickets], ['../prob_examples/public_examples/B/Tickets/Alstom1/TestPFBecomeSuch.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], 'becomes element of partial function'). | |
| 398 | cli_testcase(284, [tickets], ['../prob_examples/public_examples/B/Tickets/Alstom1/MAXINT_M1.mch', '-strict', '-t', '-p', 'CLPFD', 'TRUE'], ''). | |
| 399 | 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'], ''). | |
| 400 | cli_testcase(286, [tickets], ['../prob_examples/public_examples/B/Tester/TestExistsLetExtraction.mch', '-t', '-strict'], ''). | |
| 401 | cli_testcase(287, [tickets,imp], ['../prob_examples/public_examples/B/Tickets/177/loop_invariant.imp', '-strict', '-t'], ''). | |
| 402 | cli_testcase(288, [tickets], ['../prob_examples/public_examples/B/Tickets/181/alstom_memory.mch', '-strict', '-t', '-mc', '100'], ''). | |
| 403 | 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 | |
| 404 | cli_testcase(290, [laws], ['../prob_examples/public_examples/EventBPrologPackages/Laws/LawsEventBSpecific.eventb', '-t', '-mc', '1000', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'FALSE', '-expcterr', virtual_time_out, '-expcterr', 'model_check_incomplete'], 'LawsEventBSpecific (CLPFD FALSE)'). | |
| 405 | cli_testcase(291, [laws], ['../prob_examples/public_examples/B/Laws/EqualityLaws.mch', '-t', '-mc', '100000', '-nodead', '-c', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], ''). | |
| 406 | cli_testcase(292, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/ExplicitComputations.mch', '-t', '-mc', '100000', '-nodead', '-c', '-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).'). | |
| 407 | cli_testcase(293, [laws,rel_fnc,cbc], ['../prob_examples/public_examples/B/Laws/ExplicitComputations.mch', '-t', '-mc', '100000', '-nodead', '-c', '-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).'). | |
| 408 | cli_testcase(294, [laws], ['../prob_examples/public_examples/B/Laws/BoolLaws.mch', '-mc', '100000', '-nodead', '-c', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Various laws about BOOL datatype and boolean connectives.'). | |
| 409 | cli_testcase(295, [laws], ['../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', | |
| 410 | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', | |
| 411 | '-mc', '100000', '-c', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Various arithmetic laws.'). | |
| 412 | cli_testcase(296, [laws], ['../prob_examples/public_examples/B/Laws/NatRangeLaws.mch', '-mc', '100000', '-c', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Laws about intervals etc.'). | |
| 413 | cli_testcase(297, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/RelLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on relations.'). | |
| 414 | cli_testcase(298, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 415 | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'FALSE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets'). | |
| 416 | cli_testcase(299, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 417 | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'SYMBOLIC', 'TRUE', '-p', 'CLPFD', 'FALSE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets'). | |
| 418 | cli_testcase(300, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 419 | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets'). | |
| 420 | cli_testcase(301, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 421 | '../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SYMBOLIC', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets'). | |
| 422 | cli_testcase(302, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 423 | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'FALSE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets (with Natural Numbers, CLPFD FALSE)'). | |
| 424 | cli_testcase(303, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 425 | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets (with Natural Numbers)'). | |
| 426 | cli_testcase(304, [laws], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 427 | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'SYMBOLIC', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets (with Natural Numbers)'). | |
| 428 | cli_testcase(305, [laws,repl], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 429 | '../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS0.mch', '-t', '-mc', '100000', '-c', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '28000'], 'Some REPL Unit Tests'). | |
| 430 | cli_testcase(306, [laws,repl], ['../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS1.mch', '-t', '-mc', '100000', '-c', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '28000'], 'Some REPL Unit Tests'). | |
| 431 | cli_testcase(307, [laws,repl], ['../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS.mch', '-t', '-mc', '100000', '-c', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '45000'], 'Some REPL Unit Tests'). | |
| 432 | 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.'). | |
| 433 | cli_testcase(309, [laws,card], ['../prob_examples/public_examples/B/Laws/CardinalityLaws.mch', '-mc', '2500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE'], 'Cardinality Laws'). | |
| 434 | cli_testcase(310, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). | |
| 435 | cli_testcase(311, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). | |
| 436 | cli_testcase(312, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M2_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). | |
| 437 | cli_testcase(313, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M3_mch.eventb', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict'], ''). | |
| 438 | cli_testcase(314, [cbc_deadlock], ['../prob_examples/public_examples/B/Demo/Lift.mch', '-cbc_deadlock', '-strict'], ''). | |
| 439 | cli_testcase(315, [cbc_deadlock], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-cbc_deadlock', '-strict'], ''). | |
| 440 | cli_testcase(316, [cbc_deadlock], ['../prob_examples/public_examples/B/Demo/RussianPostalPuzzle.mch', '-cbc_deadlock', '-strict'], ''). | |
| 441 | cli_testcase(317, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/NoDeadlock.mch', '-cbc_deadlock', '-strict'], ''). | |
| 442 | cli_testcase(318, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/SimpleDeadlock1.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 443 | cli_testcase(319, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/DeadlockIntBools.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 444 | cli_testcase(320, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 445 | cli_testcase(321, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc_deadlock', '-strict'], ''). | |
| 446 | cli_testcase(322, [cbc_deadlock], ['../prob_examples/public_examples/B/CBC/MinSet_Deadlock.mch', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 447 | 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 */ | |
| 448 | 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, | |
| 449 | '-p', 'TIME_OUT', '7500'], '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 | |
| 450 | cli_testcase(325, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Deadlock/BrakeSystem_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 451 | cli_testcase(326, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Deadlock/QueenEventsTF_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check', '-p', 'CLPFD', 'FALSE'], ''). | |
| 452 | 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'], ''). | |
| 453 | 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'], ''). | |
| 454 | cli_testcase(329, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 455 | cli_testcase(330, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 456 | cli_testcase(331, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc_deadlock', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 457 | 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 | |
| 458 | ], ''). | |
| 459 | 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'], ''). | |
| 460 | 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'], ''). | |
| 461 | 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'], ''). | |
| 462 | 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'], ''). | |
| 463 | cli_testcase(337, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m0_mch.eventb', '-cbc_deadlock', '-strict'], ''). | |
| 464 | cli_testcase(338, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m1_mch.eventb', '-cbc_deadlock', '-strict'], ''). | |
| 465 | cli_testcase(339, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m2_mch.eventb', | |
| 466 | '-cbc_deadlock', '-strict', | |
| 467 | '-expcterr', 'enumeration_warning'], 'CBC Deadlock check with enumeration warning'). | |
| 468 | cli_testcase(340, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/ch2_car/m3_mch.eventb', | |
| 469 | '-cbc_deadlock', '-strict', | |
| 470 | '-expcterr', 'enumeration_warning'], 'CBC Deadlock check with enumeration warning'). | |
| 471 | cli_testcase(341, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/Abrial_Teaching/search/m_1b_mch.eventb', '-cbc_deadlock', '-strict'], ''). | |
| 472 | cli_testcase(342, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_1.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 473 | cli_testcase(343, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_2.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 474 | cli_testcase(344, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/TrafficLight/tlm_3.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 475 | cli_testcase(345, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/siemens_mch_0.eventb', '-cbc_deadlock', '-strict'], ''). | |
| 476 | cli_testcase(346, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/scheduler.eventb', '-cbc_deadlock', '-strict'], ''). | |
| 477 | cli_testcase(347, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/earley_2.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 478 | cli_testcase(348, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/ProofDirected/benchmarks/mondex_m2.eventb', '-cbc_deadlock', '-strict', '-strict', '-expcterr', 'cbc_deadlock_check'], ''). | |
| 479 | 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', '-strict' , '-v'], 'cxcc0 cbc_deadlock'). | |
| 480 | 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'], ''). | |
| 481 | 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'], ''). | |
| 482 | 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'], ''). | |
| 483 | 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'], ''). | |
| 484 | 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'], ''). | |
| 485 | 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'], ''). | |
| 486 | 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'], ''). | |
| 487 | 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'], ''). | |
| 488 | 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'], ''). | |
| 489 | 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'], ''). | |
| 490 | 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'], ''). | |
| 491 | 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'], ''). | |
| 492 | 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'). | |
| 493 | 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', '80', '-p', 'MAX_INITIALISATIONS', '0', '-strict'], 'Test that time-out triggered within CBC Deadlock check'). | |
| 494 | cli_testcase(364, [cbc_deadlock], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-cbc_deadlock', '-strict'], ''). | |
| 495 | cli_testcase(365, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/StableMarriages.mch', '-t', '-strict', '-cc', '7', '15', '-mc', '100', '--hash64', 192740982584039033], ''). | |
| 496 | cli_testcase(366, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/StableMarriagesLarger.mch', '-t', '-strict', '-cc', '7', '46', '-mc', '100', '--hash64', 13443197532344872], ''). | |
| 497 | cli_testcase(367, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/GolombRuler.mch', '-t', '-p', 'CLPFD', 'TRUE', '-strict'], ''). | |
| 498 | cli_testcase(368, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Tischordnung.mch', '-t', '-strict', '-cc', '3', '7', '-mc', '100', '--hash64', 168992916868770688], ''). | |
| 499 | cli_testcase(369, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Wegenetz.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 500 | cli_testcase(370, [puzzles_test], ['../prob_examples/public_examples/B/Demo/RussianPostalPuzzle.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 501 | cli_testcase(371, [puzzles_test], ['../prob_examples/public_examples/B/Demo/TrainTorchPuzzle.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 502 | cli_testcase(372, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/BlocksWorldGeneric.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 503 | cli_testcase(373, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Farmer.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 504 | cli_testcase(374, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/Hanoi.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 505 | cli_testcase(375, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/water.mch', '-mc', '1000', '-strict', '-nodead', '-expcterr', 'goal_found'], ''). | |
| 506 | cli_testcase(376, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/EventBPrologPackages/Puzzles/CopyPastAsEvent_mch.eventb', '-t', '-strict'], ''). | |
| 507 | cli_testcase(377, [puzzles_test], ['../prob_examples/public_examples/EventBPrologPackages/Puzzles/Sudoku_ctx.eventb', '-t', '-strict'], ''). | |
| 508 | cli_testcase(378, [puzzles_test,queens], ['-p', 'CLPFD', 'TRUE', '-p', 'MAX_OPERATIONS', 5000, | |
| 509 | '../prob_examples/public_examples/EventBPrologPackages/Puzzles/NQueensAsEvent_mch.eventb', '-t', '-strict'], ''). | |
| 510 | cli_testcase(379, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/PexSolve.mch', '-t', '-strict'], ''). | |
| 511 | cli_testcase(380, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/KnightsTour.mch', '-t', '-strict'], ''). | |
| 512 | cli_testcase(381, [puzzles_test], ['../prob_examples/public_examples/B/Puzzles/KnightsTour_v2.mch', '-t', '-strict'], ''). | |
| 513 | cli_testcase(382, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SudokuAsConstant.mch', '-t', '-strict'], ''). | |
| 514 | 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'], ''). | |
| 515 | cli_testcase(384, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SudokuAsConstantNoSolution.mch', '-init', '-strict', '-expcterr', 'setup_constants_fails'], ''). | |
| 516 | cli_testcase(385, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/LatinSquaresBig.mch', '-t', '-strict'], ''). | |
| 517 | cli_testcase(386, [puzzles_test,queens], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/NQueens50.mch', '-t', '-properties', '-strict'], ''). | |
| 518 | cli_testcase(387, [puzzles_test,cbc,codespeed], ['-p', 'CLPFD', 'TRUE', '-p', 'MAX_INITIALISATIONS', 19, | |
| 519 | '../prob_examples/public_examples/B/Puzzles/TwoQueensSevenKnights.mch', '-t', '-assertions', '-strict'], ''). | |
| 520 | cli_testcase(388, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SendMoreMoney.mch', '-t', '-strict'], ''). | |
| 521 | cli_testcase(389, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/KissPassion.mch', '-t', '-strict'], ''). | |
| 522 | cli_testcase(390, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/CopySavePasteTools.mch', '-t', '-strict'], ''). | |
| 523 | cli_testcase(391, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/NoNeighboursProblem.mch', '-cbc_sequence', 'SolAbove', '-strict'], 'Neighbour differ by more than one puzzle'). | |
| 524 | cli_testcase(392, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SubsetSum.mch', '-t', '-strict'], ''). | |
| 525 | cli_testcase(393, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/SubsetSum2.mch', '-t', '-strict'], ''). | |
| 526 | cli_testcase(394, [puzzles_test], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/WhoKilledAgatha.mch', '-t', '-mc', '100', '-p', 'MAX_INITIALISATIONS', '100', '-strict'], ''). | |
| 527 | cli_testcase(395, [puzzles_test,codespeed], ['../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'). | |
| 528 | 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'). | |
| 529 | cli_testcase(397, [cbc,smt_test], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc', 'all', '-strict', '-p', 'SMT', 'TRUE'], ''). | |
| 530 | cli_testcase(398, [cbc,smt_test], ['../prob_examples/public_examples/B/CBC/NATURAL_Add.mch', '-cbc', 'all', '-strict', '-p', 'SMT', 'TRUE', '-p', 'CLPFD', 'TRUE'], ''). | |
| 531 | cli_testcase(399, [cbc], ['../prob_examples/public_examples/B/Demo/Lift.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], ''). | |
| 532 | cli_testcase(400, [cbc], ['../prob_examples/public_examples/B/Tutorial/DoubleCounter.mch', '-cbc', 'Double', '-strict', '-expcterr', 'cbc', '-p', 'CLPFD', 'TRUE'], ''). | |
| 533 | cli_testcase(401, [cbc], ['../prob_examples/public_examples/B/Tutorial/DoubleCounter.mch', '-cbc', 'Double', '-strict', '-expcterr', 'cbc', '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', '150'], ''). | |
| 534 | cli_testcase(402, [cbc], ['../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], ''). | |
| 535 | cli_testcase(403, [cbc], ['../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet.mch', '-cbc', 'write', '-strict', '-expcterr', 'cbc'], ''). | |
| 536 | cli_testcase(404, [cbc], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], ''). | |
| 537 | cli_testcase(405, [cbc], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc', 'Delete', '-strict', '-expcterr', 'cbc'], ''). | |
| 538 | cli_testcase(406, [cbc], ['../prob_examples/public_examples/B/CBC/ProcessIDStarvation_InvErr.mch', '-cbc', 'Run', '-strict'], ''). | |
| 539 | cli_testcase(407, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch.eventb', '-cbc', 'all', '-strict'], ''). | |
| 540 | cli_testcase(408, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc', 'bridge', '-strict'], ''). | |
| 541 | cli_testcase(409, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc', 'approach', '-strict', '-p', 'SMT', 'TRUE'], ''). | |
| 542 | cli_testcase(410, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_mch_unproven.eventb', '-cbc', 'exit', '-strict'], ''). | |
| 543 | cli_testcase(411, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc', 'bridge', '-strict', '-expcterr', 'cbc'], ''). | |
| 544 | cli_testcase(412, [cbc,smt_test], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc', 'approach', '-strict', '-p', 'SMT', 'TRUE'], ''). | |
| 545 | cli_testcase(413, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Alexei/ttrain_fifo_mch.eventb', '-cbc', 'exit', '-strict'], ''). | |
| 546 | 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'], ''). | |
| 547 | 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'], ''). | |
| 548 | 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'], ''). | |
| 549 | cli_testcase(417, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Tests/Ticket167.eventb', | |
| 550 | '-cbc', 'inc', '-strict', | |
| 551 | '-expcterr', 'enumeration_warning'], 'CBC check with enumeration warning'). | |
| 552 | cli_testcase(418, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'redeal', '-strict', '-expcterr', 'cbc'], ''). | |
| 553 | cli_testcase(419, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'HasFlush', '-strict', '-expcterr', 'cbc'], ''). | |
| 554 | cli_testcase(420, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'hasFourOfAKind', '-strict', '-expcterr', 'cbc'], ''). | |
| 555 | cli_testcase(421, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/BMS/Poker_v2/FiveCardSolo_mch.eventb', '-p', 'CLPFD', 'TRUE', '-cbc', 'HasStraight', '-strict', '-expcterr', 'cbc'], ''). | |
| 556 | 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'], ''). | |
| 557 | 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'], ''). | |
| 558 | 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'], ''). | |
| 559 | cli_testcase(425, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/SSF/Bepi_Soton/M0_mch.eventb', '-cbc', 'all', '-strict'], ''). | |
| 560 | 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'], ''). | |
| 561 | cli_testcase(427, [kodkod], ['-kodkod_comparision', '2', '../prob_examples/public_examples/B/Kodkod/expressions/functions.mch', '-strict'], ''). | |
| 562 | cli_testcase(428, [kodkod], ['-p', 'CLPFD', 'true', '-kodkod_comparision', '2', '../prob_examples/public_examples/B/Kodkod/expressions/triples.mch', '-strict'], ''). | |
| 563 | cli_testcase(429, [kodkod], ['-kodkod_comparision', '3', '../prob_examples/public_examples/B/Kodkod/expressions/relations.mch', '-strict'], ''). | |
| 564 | cli_testcase(430, [kodkod], ['-kodkod_comparision', '0', '../prob_examples/public_examples/B/Kodkod/expressions/sequences.mch', '-strict'], ''). | |
| 565 | cli_testcase(431, [kodkod], ['-kodkod_comparision', '1', '../prob_examples/public_examples/B/Kodkod/NoNeighboursProblem.mch', '-strict'], ''). | |
| 566 | cli_testcase(432, [kodkod], ['-p','MAX_INITIALISATIONS',50,'-kodkod_comparision', '0', '../prob_examples/public_examples/B/Kodkod/WhoKilledAgatha.mch', '-strict'], ''). | |
| 567 | cli_testcase(433, [kodkod], ['-pacheck', '../prob_examples/public_examples/B/predicate_analysis/basic.mch', '-strict'], ''). | |
| 568 | cli_testcase(434, [kodkod], ['-pacheck', '../prob_examples/public_examples/B/predicate_analysis/function_cards.mch', '-strict'], ''). | |
| 569 | cli_testcase(435, [kodkod], ['-pacheck', '../prob_examples/public_examples/B/predicate_analysis/setext_dombug.mch', '-strict'], ''). | |
| 570 | cli_testcase(436, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/general4.csp', '-assertions', '-strict'], ''). | |
| 571 | 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.'). | |
| 572 | cli_testcase(438, [csp_test], ['../prob_examples/public_examples/CSP/ref_benchmarks/basin_olderog_bank.csp', '-assertions', '-strict'], ''). | |
| 573 | cli_testcase(439, [b_test,strings], ['../prob_examples/public_examples/B/FeatureChecks/EmptyString.mch', '-t', '-strict', '-assertions'], 'Check that we allow the empty string.'). | |
| 574 | ||
| 575 | 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.'). | |
| 576 | 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.'). | |
| 577 | 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.'). | |
| 578 | 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.'). | |
| 579 | 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.'). | |
| 580 | 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.'). | |
| 581 | 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).'). | |
| 582 | 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).'). | |
| 583 | ||
| 584 | cli_testcase(448, [tickets], ['../prob_examples/public_examples/B/Tickets/Hansen1/Bi_func.mch', '-mc', '1000', '-t', '-strict'], 'Check issue with existential quantifier inside set comprehension.'). | |
| 585 | cli_testcase(449, [tickets], ['../prob_examples/public_examples/B/Tickets/Burdy1/TestOrApplyFun.mch', '-mc', '1000', '-t', '-strict'], 'Check issue with undefined function application in context of disjunct.'). | |
| 586 | cli_testcase(450, [tickets], ['../prob_examples/public_examples/B/Tickets/Plagge1/KnightKnaves2.mch', '-init', '-strict'], 'Check that no time-out occurs in compiled mode'). | |
| 587 | ||
| 588 | 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.'). | |
| 589 | 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.'). | |
| 590 | 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.'). | |
| 591 | 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.'). | |
| 592 | 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.'). | |
| 593 | ||
| 594 | cli_testcase(456, [puzzles_test,queens], ['../prob_examples/public_examples/B/Puzzles/Queens/QueensAllSolutions.mch', '-t', '-strict', '-check_complete', '-mc', 100], 'A version of N-Queens where all solutions are computed and we try to find N.'). | |
| 595 | ||
| 596 | cli_testcase(457, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on functions.'). | |
| 597 | cli_testcase(458, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLawsWithLambda.mch', '-mc', '500', '-c', '-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.'). | |
| 598 | 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.'). | |
| 599 | 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.'). | |
| 600 | 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.'). | |
| 601 | 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.'). | |
| 602 | 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'). | |
| 603 | 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 | |
| 604 | 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.'). | |
| 605 | 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.'). | |
| 606 | 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.'). | |
| 607 | 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'). | |
| 608 | cli_testcase(469, [b_test,sptxt], ['../prob_examples/public_examples/B/PerformanceTests/LargeSets/LargeExplicitSet.mch', '-animate', '7', '-strict', '-p', 'TIME_OUT', 5000, | |
| 609 | '-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) | |
| 610 | 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.'). | |
| 611 | ||
| 612 | 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.'). | |
| 613 | 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.'). | |
| 614 | 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.'). | |
| 615 | 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.'). | |
| 616 | cli_testcase(475, [laws,repl], ['../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS2.mch', '-t', '-mc', '100000', '-c', '-strict', '-p', 'CLPFD', 'TRUE', '-assertions', '-p', 'TIME_OUT', '60000'], 'Check that REPL unit tests work'). | |
| 617 | 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'). | |
| 618 | 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.'). | |
| 619 | 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.'). | |
| 620 | 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.'). | |
| 621 | cli_testcase(480, [b_test,dot], ['-p', 'CLPFD', 'TRUE', '-p', 'DOT_LOOPS', 'FALSE', | |
| 622 | '-p', 'DOT_ROOT', 'FALSE', '-p', 'MAX_INITIALISATIONS', 5, | |
| 623 | '../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.'). | |
| 624 | 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 | |
| 625 | 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 | |
| 626 | 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'). | |
| 627 | 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'). | |
| 628 | 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'). | |
| 629 | 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'). | |
| 630 | cli_testcase(487, [csp_test,refinement], ['../prob_examples/public_examples/CSP/simple/DivChecks3.csp', '-assertions', '-strict'], 'Check that ProB deals with Divergence correctly'). | |
| 631 | 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.'). | |
| 632 | 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'). | |
| 633 | cli_testcase(490, [csp_test,refinement], ['../prob_examples/public_examples/CSP/simple/exception_operator.csp', '-assertions', '-strict'], 'Check that new exception operator works'). | |
| 634 | 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'). | |
| 635 | cli_testcase(492, [csp_test],['../prob_examples/public_examples/CSP/evans/traffic_spec.csp', '-assertions', '-strict'], 'Checking CSP assertions.'). | |
| 636 | cli_testcase(493, [tickets], ['../prob_examples/public_examples/B/Tickets/Mejia2/ticket_simplified.mch', '-t', '-mc',100,'-assertions', '-strict'], 'Check cartesian product ticket'). | |
| 637 | cli_testcase(494, [laws,case], ['../prob_examples/public_examples/B/Laws/SubstitutionLaws.mch', '-mc', '100', '-c', '-t', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Check basic properties of B substitutions.'). | |
| 638 | ||
| 639 | 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'). | |
| 640 | cli_testcase(496, [laws,card], ['../prob_examples/public_examples/B/Laws/ExplicitComputationsCLPFD.mch', '-assertions', '-mc', '100000', '-nodead', '-c', '-strict', '-p', 'TIME_OUT', '7000'], 'Many explicit computations which check that all operators work as expected on various concrete data.'). | |
| 641 | 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'). | |
| 642 | 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'). | |
| 643 | 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'). | |
| 644 | 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'). | |
| 645 | 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'). | |
| 646 | cli_testcase(502, [laws], ['../prob_examples/public_examples/B/Abrial_BBook/BBook_Page80.mch', '-init', '-assertions', '-strict'], 'Check example from B-Book'). | |
| 647 | cli_testcase(503, [laws], ['../prob_examples/public_examples/B/Abrial_BBook/BBook_Page83.mch', '-init', '-assertions', '-strict'], 'Check example from B-Book'). | |
| 648 | 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'). | |
| 649 | 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'). | |
| 650 | 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'). | |
| 651 | cli_testcase(507, [laws], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetCompr.mch', '-mc', '1000', '-nodead', '-c', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). | |
| 652 | cli_testcase(508, [laws], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetComprCLPFD.mch', '-mc', '1000', '-nodead', '-c', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). | |
| 653 | 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'). | |
| 654 | 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'). | |
| 655 | cli_testcase(511, [csp_test,csp_det], ['../prob_examples/public_examples/CSP/other/Ivo/Deterministic1.csp', '-assertions', '-strict'], 'Check more CSP deterministic assertions'). | |
| 656 | cli_testcase(512, [csp_test,csp_det], ['../prob_examples/public_examples/CSP/other/Ivo/Deterministic2_v2.csp', '-assertions', '-strict'], 'Check more CSP deterministic assertions'). | |
| 657 | 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.'). | |
| 658 | 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.'). | |
| 659 | 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.'). | |
| 660 | cli_testcase(516, [symmtest], ['../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'). | |
| 661 | cli_testcase(517, [symmtest], ['../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'). | |
| 662 | cli_testcase(518, [symmtest], ['-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'). | |
| 663 | cli_testcase(519, [symmtest], ['-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'). | |
| 664 | 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)'). | |
| 665 | cli_testcase(521, [tickets,csp_test], ['../prob_examples/public_examples/CSP/Tickets/Shi/hanoi4.csp', '-assertions', '-strict'], 'Check that exception does not occur (Ticket)'). | |
| 666 | 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'). | |
| 667 | 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'). | |
| 668 | cli_testcase(524, [tickets], ['../prob_examples/public_examples/B/Tickets/Beauger1/PredProblem.mch', '-t', '-strict'], 'Check that we can use relational composition ; with pred.'). | |
| 669 | cli_testcase(525, [b_test,infinite,finite], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteParityFunction.mch', '-t', '-strict', '-assertions'], 'Some more tests with infinite functions.'). | |
| 670 | 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.'). | |
| 671 | 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.'). | |
| 672 | cli_testcase(528, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/UsesLibraryMath.mch', '-t', '-strict', '-assertions'], 'Check that external functions work.'). | |
| 673 | cli_testcase(529, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/PrologFun.mch', '-assertions', '-strict'], 'Check that external functions PROLOG_FUN work.'). | |
| 674 | cli_testcase(530, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/PrintExternal.mch', '-t', '-strict'], 'Check that external printing functions work.'). | |
| 675 | cli_testcase(531, [b_test,external,strings], ['../prob_examples/public_examples/B/ExternalFunctions/LibraryStrings.mch', '-assertions', '-strict'], 'Check that external String functions work.'). | |
| 676 | cli_testcase(532, [symmtest], ['../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.'). | |
| 677 | cli_testcase(533, [b_test,infinite], ['../prob_examples/public_examples/B/PerformanceTests/InfiniteLanguageConcatenation.mch', '-mc', 1000, '-nodead','-assertions', '-strict'], 'Check that this function is detected as infinite and not expanded.'). | |
| 678 | cli_testcase(534, [tickets], ['../prob_examples/public_examples/B/Tickets/Hansen3/TestingCircDef2.mch', '-mc', 1000, '-nodead','-assertions', '-strict'], 'Check that the erroneous circular definition problem is gone.'). | |
| 679 | 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.'). | |
| 680 | 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.'). | |
| 681 | cli_testcase(537, [tickets,strings], [ '-init', '-strict', '-p','MAXINT',10, | |
| 682 | '-evalt', 'INTEGER/<:{1,2,3,7,9,10}', | |
| 683 | '-evalt', 'NATURAL/<:{1,2,3,7,9,10}', | |
| 684 | '-evalt', 'NATURAL1/<:{1,2,3,7,9,10}', | |
| 685 | '-evalt', 'NATURAL1/<:{0,1,2,3,4}', | |
| 686 | '-evalt', 'NATURAL1/<<:{1,2,3,7,9,10}', | |
| 687 | '-evalt', 'NATURAL1/<<:1..100', | |
| 688 | '-evalt', 'NATURAL1/<<:{x|x<100}', | |
| 689 | '-evalt', 'NATURAL1/<<:{x|x>0}', | |
| 690 | '-evalt', 'NATURAL1/<<:{x|x>=2}', | |
| 691 | '-evalf', 'NATURAL1/<<:{x|x>=0}', | |
| 692 | '-evalt', 'NATURAL/<<:{x|x>=0}', | |
| 693 | '-evalt', 'NATURAL1/<<:0..MAXINT', | |
| 694 | '-evalt', 'NATURAL1/<:0..MAXINT', | |
| 695 | '-evalt', 'NATURAL/<:0..MAXINT', | |
| 696 | '-evalf', 'NATURAL<:0..MAXINT', | |
| 697 | '-evalt', 'INTEGER/<:MININT..MAXINT', | |
| 698 | '-evalt', 'STRING/<<:{"a"}', | |
| 699 | '-evalt', 'STRING/<:{"a"}', | |
| 700 | '-evalf', 'STRING<:{"a"}', | |
| 701 | '-evalf', 'STRING<<:{"a"}', | |
| 702 | '-evalf', 'STRING/<:STRING', | |
| 703 | '-evalt', 'STRING/<<:STRING', | |
| 704 | '-evalt', 'BOOL /<<: {TRUE,FALSE}', | |
| 705 | '-evalf', 'BOOL /<: {TRUE,FALSE}', | |
| 706 | '-evalt', 'BOOL /<: {TRUE}' | |
| 707 | %, '-expcterr', 'eval_string_enum_warning' | |
| 708 | ], 'Test subset works without enum warnings.'). % used to be: 'Test that eval_string catches expansion errors.'). | |
| 709 | cli_testcase(538, [tickets], [ '-init', '-strict', '-p','MAXINT',10, '-evalt', '1..10 <: NATURAL1'], 'Test that these predicates do not cause enumeration warnings.'). | |
| 710 | cli_testcase(539, [b_test,kodkod], ['../prob_examples/public_examples/B/Kodkod/CrewAllocationConstantsLarge.mch', '-t', '-strict', '-p','TIME_OUT',3000, '-p', 'KODKOD', 'TRUE', '-properties', '-assertions'], 'Check that Kodkod translator works and that solution is ok (via -assertions). Skipped on Windows because of Memory restrictions.'). | |
| 711 | 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.'). | |
| 712 | 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.'). | |
| 713 | 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.'). | |
| 714 | 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.'). | |
| 715 | 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.'). | |
| 716 | 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.'). | |
| 717 | 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.'). | |
| 718 | cli_testcase(547, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/Simple_LTL_Tupels.csp', '-ltlassertions', '-strict'],'Check LTL formulas in File.'). | |
| 719 | 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.'). | |
| 720 | 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.'). | |
| 721 | 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.'). | |
| 722 | cli_testcase(551, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/TestingCardinality.csp', '-assertions', '-strict', '-expcterr', virtual_time_out], ''). | |
| 723 | cli_testcase(552, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/DotTupleTestCase.csp', '-assertions', '-strict'], ''). | |
| 724 | 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.'). | |
| 725 | cli_testcase(554, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/Factorial.mch', '-t', '-strict', '-p', 'SYMBOLIC', 'FALSE'], 'Test that other recursive function works.'). | |
| 726 | 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.'). | |
| 727 | 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'). | |
| 728 | 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.'). | |
| 729 | cli_testcase(558, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/Tests/RecursiveIntegerEquation.mch', '-init', '-assertions','-strict', '-p', 'SYMBOLIC', 'FALSE', '-mc', 100, '-nodead'], 'Test that we do not accidentally treat equation over non-relation type.'). | |
| 730 | 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'], 'Test that we do not accidentally treat equation over non-relation type.'). | |
| 731 | cli_testcase(560, [b_test,csp_test], ['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-mc', '1000', '-strict', '-p', 'MAX_INITIALISATIONS', 15], 'Test that the dining philosophers without guidance by CSP have no deadlock'). | |
| 732 | 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'). | |
| 733 | 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'). | |
| 734 | 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'). | |
| 735 | 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'). | |
| 736 | ||
| 737 | cli_testcase(565, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/comsets.fuzz', '-t', '-strict'],'ProZ test'). | |
| 738 | cli_testcase(566, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/distributed_concatenation.fuzz', '-t', '-strict'],'ProZ test'). | |
| 739 | cli_testcase(567, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/compaction.fuzz', '-t', '-strict'],'ProZ test'). | |
| 740 | cli_testcase(568, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/zrm_refcard_ops.fuzz', '-t', '-strict'],'ProZ test'). | |
| 741 | cli_testcase(569, [b_test,ltl], ['../prob_examples/public_examples/B/SymmetryReduction/Fraikin/Library.mch','-p','IGNORE_HASH_COLLISIONS', | |
| 742 | 'TRUE','-p','FORGET_STATE_SPACE','FALSE','-p','SYMMETRY_MODE','hash', '-expcterr', 'model_check_incomplete','-mc','9999', | |
| 743 | '-ltlformulat','G( e(Reserve(m1,b1)) => not({b1:dom(reservation) & m1 : ran(reservation(b1))}) )', '-strict'],'Check enabled e() with multiple parameters'). | |
| 744 | 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'). | |
| 745 | cli_testcase(572, [b_test,ltl],['../prob_examples/public_examples/B/LTL/DerrickSmith/Abstract.mch', '-ltlassertions', '-strict'],'Check ltl assertions from DEFINITIONS'). | |
| 746 | cli_testcase(573, [b_test,ltl],['../prob_examples/public_examples/B/LTL/Mikrowelle.mch', '-ltlassertions', '-strict'],'Check ltl assertions from DEFINITIONS'). | |
| 747 | 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'). | |
| 748 | 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'). | |
| 749 | 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.'). | |
| 750 | cli_testcase(577, [b_test,ltl],['../prob_examples/public_examples/B/LTL/DerrickSmith/Abstract.mch', '-ltlformulat', 'G([AOp2] => F(sink))', '-strict'],'Check ltl formula'). | |
| 751 | cli_testcase(578, [b_test,ltl],['../prob_examples/public_examples/B/LTL/DerrickSmith/Abstract.mch', '-ltlformulat', 'G([AOp2] => F(deadlock))', '-strict'],'Check ltl formula'). | |
| 752 | cli_testcase(579, [csp_test],['../prob_examples/public_examples/CSP/mydemos/ReplicatedSharing.csp', '-mc', '100000', '-t', '-strict'],'Model check and trace replicated sharing processes.'). | |
| 753 | 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.'). | |
| 754 | cli_testcase(581, [csp_test],['../prob_examples/public_examples/CSP/mydemos/SeqTests.csp', '-mc', '100000', '-nodead', '-t', '-strict'], 'Testing CSP sequences.'). | |
| 755 | cli_testcase(582, [csp_test],['../prob_examples/public_examples/CSP/other/Ivo/Sequences.csp', '-mc', '100000', '-t', '-strict'], 'Testing CSP sequence structures.'). | |
| 756 | 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 | |
| 757 | cli_testcase(584, [b_test,tla],['../prob_examples/public_examples/TLA/ErrorTests/GraphIso.tla', '-init', '-strict' | |
| 758 | %'-expcterr', tla2b_parser, '-expcterr', load_main_file % TLA2B no longer generates .mch file ! | |
| 759 | ],'Check that TLA2B does not overwrite pre-existing machine file'). | |
| 760 | cli_testcase(585, [b_test],['-strict', | |
| 761 | '-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'). | |
| 762 | cli_testcase(586, [b_test,tla],['../prob_examples/public_examples/TLA/Login/Login_Deadlock.tla', '-init', '-strict', | |
| 763 | '-mc', 100, '-p', 'SYMMETRY_MODE', hash, '-expcterr', deadlock],'Check that config file found and model checking TLA works'). | |
| 764 | 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(-).'). | |
| 765 | cli_testcase(588, [b_test,pragmas],['../prob_examples/public_examples/B/Pragmas/SymbolicPragmas.mch', '-init', | |
| 766 | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 767 | '-assertions', '-strict'], 'Test that symbolic annotation pragma works.'). | |
| 768 | cli_testcase(589,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/InputOutputChannelValues.csp', '-mc', '10000', '-t', '-strict'], 'Testing complicated CSP-M datatypes.'). | |
| 769 | 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.'). | |
| 770 | cli_testcase(591,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/replicates.csp', '-mc', '10000', '-t', '-strict'], 'Testing replicate processes.'). | |
| 771 | cli_testcase(592,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/replicates2.csp', '-mc', '10000', '-t', '-strict'], 'Testing replicate processes.'). | |
| 772 | cli_testcase(593, [b_test,operation_reuse], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '25696', '--hash64', 203058745203935766, | |
| 773 | '-strict', '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'MAX_INITIALISATIONS', 5], 'Test Operation Reuse'). | |
| 774 | cli_testcase(594, [b_test], [ '-init', '-strict', '-evalt', '!x.(x:1..10=>x<11)', '-evalf', '!y.(y:1..10 => y<10)'], 'Test that universally quantified predicates work in eval_string.'). | |
| 775 | cli_testcase(595, [b_test],['-strict', | |
| 776 | '-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'). | |
| 777 | 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'). | |
| 778 | cli_testcase(597,[csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/DotDatatypes.csp', '-mc', '10000', '-t', '-strict'], 'Testing complex datatypes.'). | |
| 779 | cli_testcase(598,[tickets], ['../prob_examples/public_examples/B/Tickets/DefMchSameName/DefMchSameName.mch', '-ma', 7, 0 , 0, '-strict'], 'Testing that -main_assertions work properly.'). | |
| 780 | 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.'). | |
| 781 | cli_testcase(600,[tickets], ['../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 | |
| 782 | cli_testcase(601,[tickets], ['../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 | |
| 783 | cli_testcase(602,[tickets], ['../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.'). | |
| 784 | 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.'). | |
| 785 | 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'). | |
| 786 | cli_testcase(605, [b_test], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-init', '-strict', '-eval', '(A <=> (waiting={})) & A', '-p', 'BOOL_AS_PREDICATE', 'FALSE', '-expcterr' ,parse_machine_predicate_error], 'Test that BOOL as predicate can be disabled.'). | |
| 787 | 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.'). | |
| 788 | cli_testcase(607, [b_test,sat],['-strict', | |
| 789 | '-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.'). | |
| 790 | 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.'). | |
| 791 | 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.'). | |
| 792 | 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.'). | |
| 793 | 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.'). | |
| 794 | 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.'). | |
| 795 | 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.'). | |
| 796 | 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.'). | |
| 797 | 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.'). | |
| 798 | 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.'). | |
| 799 | 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.'). | |
| 800 | 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.'). | |
| 801 | cli_testcase(619,[b_test,ctl], ['../prob_examples/public_examples/B/LTL/Tests/CTL_SetMove_2States.mch', '-init', | |
| 802 | '-ctlformulat', 'AG(EX{xx=bb})', '-ctlformula', 'AGEFEX[Move]true', '-ctlformula', 'AGEFEX[Set(aa)]{xx=aa}', | |
| 803 | '-ctlformulat', 'not(EF EX[Set(aa)]{xx=bb})', | |
| 804 | '-ctlformulat', 'EF EG {xx=bb}', | |
| 805 | '-ctlformulat', '{xx=bb} => EG {xx=bb}', | |
| 806 | '-ctlformulat', '{xx=bb} => not AF {xx=aa}', | |
| 807 | '-ctlformulat', '{xx=bb} => AF {not(xx=aa)}', | |
| 808 | '-strict'], 'Testing CTL formulas on simple statespaces.'). | |
| 809 | 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.'). | |
| 810 | cli_testcase(621,[b_test,ctl], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-init', | |
| 811 | '-ctlformulat', 'AG ( EX[swap]true => {active /= {}})', | |
| 812 | '-ctlformulat', 'AG ( (EX[new]true) or (EX[del]true) or (EX[swap]true) )', | |
| 813 | '-ctlformulat', 'AF {card(waiting)>0}', | |
| 814 | '-ctlformulat', 'AG( {card(active)>0} => EG e(swap))', | |
| 815 | '-strict'], 'Testing CTL formulas on simple statespaces.'). | |
| 816 | 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.'). | |
| 817 | 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.'). | |
| 818 | cli_testcase(624,[csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/AIDCPRB_small.csp', '-mc', '10000', '-t', '-strict'], 'Testing complex datatypes.'). | |
| 819 | cli_testcase(625, [b_test,tla,choose],['../prob_examples/public_examples/TLA/Tests/ChooseTest.tla', '-mc', 100, '-strict'], 'Testing TLA2B translation and loading.'). | |
| 820 | 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.'). | |
| 821 | cli_testcase(627, [cbc,smt_test], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-cbc_sequence', 'new;new;del;ready', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE'], 'Check cbc_sequence'). | |
| 822 | cli_testcase(628, [cbc,smt_test], ['../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'). | |
| 823 | 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.'). | |
| 824 | 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.'). | |
| 825 | 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.'). | |
| 826 | 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.'). | |
| 827 | 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).'). | |
| 828 | 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 | |
| 829 | cli_testcase(635, [b_test,kodkod], ['../prob_examples/public_examples/B/Kodkod/Loop.mch', '-strict', '-mc', 20, '-nodead', '-bf', '-p', 'MAX_INITIALISATIONS', 8, '-p', 'KODKOD', 'TRUE', '-cc', 15, 14], 'Test performance on Loop example with Kodkod'). | |
| 830 | 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'). | |
| 831 | 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 | |
| 832 | 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.'). | |
| 833 | 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'). | |
| 834 | 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'). | |
| 835 | 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'). | |
| 836 | 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'). | |
| 837 | cli_testcase(643, [laws], ['../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'). | |
| 838 | 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'). | |
| 839 | %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], ''). | |
| 840 | 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.'). | |
| 841 | 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.'). | |
| 842 | 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).'). | |
| 843 | cli_testcase(649, [tickets,infinite], ['../prob_examples/public_examples/B/Tickets/PROB-83/Time.mch', '-t', '-strict'], 'Check infinite function works. (PROB-83)'). | |
| 844 | 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.'). | |
| 845 | 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.'). | |
| 846 | 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.'). | |
| 847 | cli_testcase(653, [tickets], ['../prob_examples/public_examples/B/Tickets/Mejia5/essai_fncs.mch', '-t', '-strict'], 'Check ticket (with NAT >+> NAT)'). | |
| 848 | cli_testcase(654, [laws], ['../prob_examples/public_examples/B/Laws/SetRelLaws_NatBool.mch', '-mc', '750', '-nodead', '-c', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Various laws about relations.'). | |
| 849 | 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 !! <-------------- | |
| 850 | 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.'). | |
| 851 | %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'], ''). | |
| 852 | 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.'). | |
| 853 | 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], ''). | |
| 854 | cli_testcase(660, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/TestLibraryIO.mch', '-t', '-strict', '-p', 'CLPFD', 'TRUE'], 'Test IO Library'). | |
| 855 | %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'], ''). | |
| 856 | %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'], ''). | |
| 857 | cli_testcase(664, [ltl], ['../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter.mch', '-ltllimit', '50', '-ltlformula', 'G{1=1}', '-strict', '-expcterr', ltl_incomplete, '-expcterr', state_space], 'check that no error reported for incomplete model check'). | |
| 858 | %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'], ''). | |
| 859 | %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'], ''). | |
| 860 | %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'], ''). | |
| 861 | cli_testcase(668, [ltl,csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/BobAlice.csp', '-ltlassertions', '-strict'],'Check LTL formulas in File.'). | |
| 862 | %cli_testcase(669, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/IncorrectUnitDefinition.mch', '-plugin', 'units', '-strict', '-expecterr', 'incorrect_unit_definition'], ''). | |
| 863 | %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.'). | |
| 864 | %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], ''). | |
| 865 | %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'], ''). | |
| 866 | %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'], ''). | |
| 867 | %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'], ''). | |
| 868 | %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'], ''). | |
| 869 | %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'], ''). | |
| 870 | %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'], ''). | |
| 871 | %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'], | |
| 872 | %'also checks that invariants copied to refinement machine'). | |
| 873 | %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'], ''). | |
| 874 | cli_testcase(682, [ltl,csp_test], ['../prob_examples/public_examples/CSP/slicing/peterson_modelcheck.csp', '-ltlassertions', '-strict'],'Check LTL formulas in File.'). | |
| 875 | %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'], ''). | |
| 876 | cli_testcase(684, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/AIDCPRB.csp', '-mc', '10000', '-nodead', '-strict'],'Model checking test for fixed bug number 3675.'). | |
| 877 | cli_testcase(685, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/SafetyPRB.csp', '-mc', '150000', '-nodead', '-strict'],'Model checking test for fixed bug number 3675.'). | |
| 878 | %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'], ''). | |
| 879 | 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'). | |
| 880 | %cli_testcase(688, [plugin_units,wd,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/Tests/SomeUnitErrors.mch', '-plugin', 'units', '-strict', '-expecterr', 'well_definedness_error'], ''). | |
| 881 | 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'). | |
| 882 | 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'). | |
| 883 | 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'). | |
| 884 | 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'). | |
| 885 | 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'). | |
| 886 | 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'). | |
| 887 | %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'], ''). | |
| 888 | %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'], ''). | |
| 889 | cli_testcase(697, [tickets,external], ['../prob_examples/public_examples/B/Tickets/Burlando1/machine_test_PRINTF.mch', '-t', '-strict'], 'Test PRINTF'). | |
| 890 | 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'). | |
| 891 | cli_testcase(699, [cbc,cbc_deadlock], ['../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'). | |
| 892 | %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'], ''). | |
| 893 | %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'], ''). | |
| 894 | 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.'). | |
| 895 | 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.'). | |
| 896 | %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'], ''). | |
| 897 | %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'], ''). | |
| 898 | %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'], ''). | |
| 899 | %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'], ''). | |
| 900 | 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.'). | |
| 901 | cli_testcase(709, [laws,kodkod],['../prob_examples/public_examples/B/Kodkod/LawsArithmeticCsts.mch', '-init', '-expcterr', 'setup_constants_fails','-strict', '-p', 'CLPFD', 'FALSE', '-p', 'KODKOD', 'TRUE','-p', 'TIME_OUT', '9000'], 'Testing setting up constants finds no counter-example to mathematical laws.'). | |
| 902 | 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.'). | |
| 903 | cli_testcase(711, [laws,kodkod],['../prob_examples/public_examples/B/Kodkod/LawsRelCsts.mch', '-init', '-expcterr', 'setup_constants_fails','-strict', '-p', 'CLPFD', 'FALSE', '-p', 'KODKOD', 'TRUE'], 'Testing setting up constants finds no counter-example to mathematical laws.'). | |
| 904 | 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.'). | |
| 905 | 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.'). | |
| 906 | 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.'). | |
| 907 | 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.'). | |
| 908 | 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.'). | |
| 909 | 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.'). | |
| 910 | 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.'). | |
| 911 | 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.'). | |
| 912 | 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.'). | |
| 913 | 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.'). | |
| 914 | 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.'). | |
| 915 | 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.'). | |
| 916 | 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.'). | |
| 917 | 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.'). | |
| 918 | 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).'). | |
| 919 | 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.'). | |
| 920 | 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).'). | |
| 921 | 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.'). | |
| 922 | 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.'). | |
| 923 | 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.'). | |
| 924 | cli_testcase(732, [laws,kodkod],['../prob_examples/public_examples/B/Kodkod/LawsSetsCsts.mch', '-init', '-expcterr', 'setup_constants_fails','-strict', '-p', 'KODKOD', 'TRUE'], 'Testing setting up constants finds no counter-example to mathematical laws.'). | |
| 925 | 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'). | |
| 926 | cli_testcase(734, [laws,kodkod], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetCompr.mch', '-init', '-c', '-p', 'KODKOD','TRUE', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). | |
| 927 | cli_testcase(735, [laws,kodkod], ['../prob_examples/public_examples/B/Laws/BoolLaws_SetComprCLPFD.mch', '-init', '-c', '-p', 'KODKOD','TRUE', '-strict'], 'Various laws about boolean connectives in set comprehension form.'). | |
| 928 | 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'). | |
| 929 | cli_testcase(737, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/LibraryFiles.mch', '-init', '-assertions','-strict'], 'Check that external functions work.'). | |
| 930 | cli_testcase(738, [b_test,proz],['../prob_examples/public_examples/Z/Testcases/freetypes.fuzz', '-mc', '1000', '-nodead', '-strict'],'ProZ test for freetypes'). | |
| 931 | 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.'). | |
| 932 | 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.'). | |
| 933 | 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.'). | |
| 934 | 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).'). | |
| 935 | 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).'). | |
| 936 | 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).'). | |
| 937 | 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).'). | |
| 938 | 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).'). | |
| 939 | 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).'). | |
| 940 | 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).'). | |
| 941 | 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.'). | |
| 942 | 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.'). | |
| 943 | 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.'). | |
| 944 | 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).'). | |
| 945 | 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.'). | |
| 946 | 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'). | |
| 947 | cli_testcase(755, [csp_test], ['../prob_examples/public_examples/CSPB/TestVariableProbing.csp', '-MAIN', 'OTHER', '-mc', 100, '-cc', 4, 4, '-strict'], 'Test setting main process'). | |
| 948 | cli_testcase(756, [xtl], ['../prob_examples/public_examples/XTL/Promela/promela_int.P', '-t', '-mc', 100, | |
| 949 | '-cc', 23, 29, '-strict'], 'Test Promela XTL interpreter'). | |
| 950 | cli_testcase(757, [error_checks,csp_repl], ['../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.'). | |
| 951 | cli_testcase(758, [csp_repl], ['../prob_examples/public_examples/CSP/other/Ivo/Farmer.csp', '-strict', '-get_csp_assertions_as_string'], 'Testing getting Csp assertions from file.'). | |
| 952 | 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.'). | |
| 953 | 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.'). | |
| 954 | 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.'). | |
| 955 | 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.'). | |
| 956 | 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.'). | |
| 957 | cli_testcase(764, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/InterleavedIfThenElseBlocks.csp', '-strict', '-mc', 1000], 'Testing interleaved if-then-else blocks.'). | |
| 958 | cli_testcase(767, [private,data_validation,siemens], ['../prob_examples/examples/B/Siemens/BAC9_ZC/pas_as_env_inv_ld.mch','-strict', '-t', '-p', | |
| 959 | '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.'). | |
| 960 | 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.'). | |
| 961 | 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.'). | |
| 962 | 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).'). | |
| 963 | 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.'). | |
| 964 | 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).'). | |
| 965 | 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.'). | |
| 966 | 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.'). | |
| 967 | 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.'). | |
| 968 | 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.'). | |
| 969 | 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.'). | |
| 970 | 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.'). | |
| 971 | 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.'). | |
| 972 | 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.'). | |
| 973 | 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.'). | |
| 974 | 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.'). | |
| 975 | 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 | |
| 976 | 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', '-p', 'MAX_OPERATIONS', 0, '-p', 'MAXINT', 2147483647, '-p', 'TIME_OUT', 5000, '-p', 'EXPAND_FORALL_UPTO', 0], 'Siemens Data Validation Test.'). | |
| 977 | 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', '-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.'). | |
| 978 | 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.'). | |
| 979 | 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.'). | |
| 980 | 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 | |
| 981 | 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.'). | |
| 982 | 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 | |
| 983 | '-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.'). | |
| 984 | 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', | |
| 985 | '-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.'). | |
| 986 | 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', | |
| 987 | '-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.'). | |
| 988 | 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', | |
| 989 | '-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.'). | |
| 990 | 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', | |
| 991 | '-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.'). | |
| 992 | 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', | |
| 993 | '-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.'). | |
| 994 | 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', | |
| 995 | '-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.'). | |
| 996 | 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', | |
| 997 | '-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.'). | |
| 998 | 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)'). | |
| 999 | 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'). | |
| 1000 | cli_testcase(809, [private,data_validation], ['../prob_examples/public_examples/B/Tickets/LargeMachTypeErr/LargeValueOk.mch', '-assertions', '-strict'], 'Check loading large data'). | |
| 1001 | 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'). | |
| 1002 | 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.'). | |
| 1003 | cli_testcase(812, [error_checks,csp_test], ['../prob_examples/public_examples/CSP/ErrorModels/csp_tupels/IllegalDataValueError.csp', '-strict', '-mc', 10, '-expcterr', 'valid_value', '-expcterr', 'general_error_occurred','-expcterr', 'check_channel_output_value'], 'Testing for raising illegal data value error.'). | |
| 1004 | 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.'). | |
| 1005 | 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.'). | |
| 1006 | 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.'). | |
| 1007 | 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.'). | |
| 1008 | 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.'). | |
| 1009 | 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.'). | |
| 1010 | 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.'). | |
| 1011 | 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.'). | |
| 1012 | 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.'). | |
| 1013 | 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.'). | |
| 1014 | 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.'). | |
| 1015 | 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.'). | |
| 1016 | 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.'). | |
| 1017 | 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.'). | |
| 1018 | 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.'). | |
| 1019 | 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.'). | |
| 1020 | 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.'). | |
| 1021 | 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.'). | |
| 1022 | 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.'). | |
| 1023 | 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.'). | |
| 1024 | 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.'). | |
| 1025 | 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.'). | |
| 1026 | 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.'). | |
| 1027 | 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.'). | |
| 1028 | 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.'). | |
| 1029 | cli_testcase(838, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingComprehensionSetGuards.csp', '-strict', '-mc', 10000], 'Testing set comprehension guards.'). | |
| 1030 | cli_testcase(839, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDataTypeDefBody.csp', '-strict', '-mc', 10], 'Testing expanding symbolic sets.'). | |
| 1031 | 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.'). | |
| 1032 | 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.'). | |
| 1033 | 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.'). | |
| 1034 | 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.'). | |
| 1035 | cli_testcase(844, [csp_repl], ['../prob_examples/public_examples/CSP/other/Ivo/Farmer.csp', '-strict', '-get_csp_enumerated_assertions_as_string'], 'Testing getting enumerated assertions from file.'). | |
| 1036 | cli_testcase(845, [csp_repl], ['../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.'). | |
| 1037 | 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.'). | |
| 1038 | 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.'). | |
| 1039 | 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.'). | |
| 1040 | 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.'). | |
| 1041 | 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.'). | |
| 1042 | cli_testcase(851, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/subtype_ex.csp', '-strict', '-mc', 1000,'-expcterr', 'deadlock' ,'-df'], 'Testing complex subtype expressions.'). | |
| 1043 | cli_testcase(852, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/subtype_nametype_ex.csp', '-strict', '-mc', 2500,'-expcterr', 'deadlock'], 'Testing complex subtype expressions.'). | |
| 1044 | cli_testcase(853, [private], ['../prob_examples/examples/CSP/Winter/miniAlvey.csp', '-strict', '-t', '-c', '-v'], 'Testing complex CSP spec.'). | |
| 1045 | 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.'). | |
| 1046 | 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'). | |
| 1047 | 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.'). | |
| 1048 | 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.'). | |
| 1049 | 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.'). | |
| 1050 | 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.'). | |
| 1051 | cli_testcase(860, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingIsMemberBuiltInFunction.csp', '-mc', '100000', '-nodead', '-strict', '-assertions'], 'Testing member(-,-) builtin function.'). | |
| 1052 | 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).'). | |
| 1053 | cli_testcase(862, [error_checks,csp_test], ['../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=).'). | |
| 1054 | 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.'). | |
| 1055 | %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.'). | |
| 1056 | %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.'). | |
| 1057 | 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.'). | |
| 1058 | 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.'). | |
| 1059 | cli_testcase(868, [parser,tickets], ['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-ltlformulat', 'G {taken= {} ', '-strict', '-expcterr', 'ltl'], 'Testing that LTL parser does not loop. (PARSERLIB-11)'). | |
| 1060 | cli_testcase(869, [parser,tickets], ['../prob_examples/public_examples/CSPB/Dining/Dining.mch', '-ctlformula', 'AG {taken= {} ', '-strict', '-expcterr', 'ctl'], 'Testing that CTL parser does not loop. (PARSERLIB-11)'). | |
| 1061 | 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.'). | |
| 1062 | 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'). | |
| 1063 | %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], ''). | |
| 1064 | %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], ''). | |
| 1065 | %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], ''). | |
| 1066 | 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).'). | |
| 1067 | cli_testcase(876, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/mbuff.csp', '-assertions', '-strict'], 'Checking CSP assertions.'). | |
| 1068 | cli_testcase(877, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/crossing.csp', '-assertions', '-strict'], 'Checking CSP assertions.'). | |
| 1069 | cli_testcase(878, [csp_repl], ['-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.'). | |
| 1070 | 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.'). | |
| 1071 | 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.'). | |
| 1072 | %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'], ''). | |
| 1073 | 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.'). | |
| 1074 | cli_testcase(883, [csp_test], ['../prob_examples/public_examples/CSP/ucsexamples/chapter14/maxpro.csp', '-assertions', '-strict'], 'Checking CSP assertions from file'). | |
| 1075 | cli_testcase(884, [b_test,proz], ['../prob_examples/public_examples/Z/Woodcock/InnerMember.fuzz', '-t', '-mc', 100, '-strict'], 'Checking Z model'). | |
| 1076 | 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.'). | |
| 1077 | 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.'). | |
| 1078 | 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.'). | |
| 1079 | 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.'). | |
| 1080 | cli_testcase(889, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingComplexChannelTypes.csp', '-assertions', '-strict'], 'Testing outputing channel values of complex types.'). | |
| 1081 | 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.'). | |
| 1082 | 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.'). | |
| 1083 | cli_testcase(892, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/CheckingPossibleInputVariablesOnChannel.csp', '-assertions', '-strict'], 'Testing for possible input patterns on channels.'). | |
| 1084 | cli_testcase(893,[private],['../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).'). | |
| 1085 | 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).'). | |
| 1086 | cli_testcase(895, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/3675/SafetyPRB.csp', '-assertions', '-strict'],'Assertions check of processes with complex events.'). | |
| 1087 | cli_testcase(896, [kodkod], ['-p','KODKOD','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)'). | |
| 1088 | cli_testcase(897, [kodkod], ['-p','KODKOD','TRUE','-eval','S<:1..10 & S/={}', '-strict'],'Checking the information about the integer range of the elements of an empty set (Ticket PROB-220)'). | |
| 1089 | 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'). | |
| 1090 | cli_testcase(899, [kodkod], ['-p','KODKOD','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)'). | |
| 1091 | 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.'). | |
| 1092 | 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.'). | |
| 1093 | 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.'). | |
| 1094 | 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).'). | |
| 1095 | 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.'). | |
| 1096 | 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'], ''). | |
| 1097 | 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'], ''). | |
| 1098 | 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.'). | |
| 1099 | 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'], ''). | |
| 1100 | 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'], ''). | |
| 1101 | cli_testcase(910, [analysis_test], ['-pacheck','../prob_examples/public_examples/B/predicate_analysis/sets.mch', '-strict'], 'Test cases for the predicate analysis: rules about sets'). | |
| 1102 | cli_testcase(911, [analysis_test,sigma], ['-pacheck','../prob_examples/public_examples/B/predicate_analysis/arithmetic.mch', '-strict'], 'Test cases for the predicate analysis: some arithmetic (mainly SIGMA)'). | |
| 1103 | cli_testcase(912, [kodkod,cbc], ['../prob_examples/public_examples/B/Kodkod/TestCBCAssertionCheck.mch', '-cbc_assertions', '-strict', '-p','KODKOD', 'TRUE', '-expcterr',cbc_assertions], 'Check that Kodkod CBC Checking works.'). | |
| 1104 | 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.'). | |
| 1105 | 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'). | |
| 1106 | 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.'). | |
| 1107 | cli_testcase(916, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', '-csp_eval', 'Events', '-strict'], 'Evaluating CSP-M expressions.'). | |
| 1108 | cli_testcase(917, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', '-csp_eval', '{|a|}', '-strict'], 'Evaluating CSP-M expressions.'). | |
| 1109 | 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.'). | |
| 1110 | 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', '-strict'], 'Checking CSP-M assertions for CSP-M || B models.'). | |
| 1111 | cli_testcase(920, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/ExpandingDataTypeDefBody.csp', '-csp_eval', | |
| 1112 | '{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.'). | |
| 1113 | 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.'). | |
| 1114 | cli_testcase(922, [csp_test], ['-csp_eval', 'if member(1,{1..10}) then true else false', '-strict'], 'Evaluating CSP-M expressions.'). | |
| 1115 | 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)'). | |
| 1116 | 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.'). | |
| 1117 | 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.'). | |
| 1118 | 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.'). | |
| 1119 | 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).'). | |
| 1120 | 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).'). | |
| 1121 | 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.'). | |
| 1122 | 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.'). | |
| 1123 | cli_testcase(931, [csp_test], ['../prob_examples/public_examples/CSP/ucsexamples/chapter20/phone.csp', '-csp_eval', 'Phones', '-strict'], 'Evaluating CSP-M expressions.'). | |
| 1124 | 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).'). | |
| 1125 | 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).'). | |
| 1126 | cli_testcase(934, [typechecker_test], ['-eval', '[a,c:=1,3](a<b&b<c)', '-strict'], 'Type-checking a substitution on a predicate'). | |
| 1127 | 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)'). | |
| 1128 | 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', | |
| 1129 | %'-p', 'csp_event_visible_to_user', 'false', % used to be csp_event probcli option | |
| 1130 | '-ltlformulat', 'G not [link.AMS.AMS]', '-strict'], 'Checking ltl formulas for CSP-M || B models.'). | |
| 1131 | 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.'). | |
| 1132 | 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.'). | |
| 1133 | 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.'). | |
| 1134 | 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.'). | |
| 1135 | 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.'). | |
| 1136 | %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'], ''). | |
| 1137 | 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)'). | |
| 1138 | 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'],''). | |
| 1139 | cli_testcase(945, [eventb_test, theories], ['-t', '-strict', '../prob_examples/public_examples/EventBPrologPackages/Theory/TestBoolOps_mch.eventb'], 'Check BoolOps Theory.'). | |
| 1140 | 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'). | |
| 1141 | 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'). | |
| 1142 | 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.'). | |
| 1143 | cli_testcase(949, [tickets], ['-assertions', '-strict', '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsOK.mch', | |
| 1144 | '../prob_examples/public_examples/B/Tickets/PrjMemCheck/PrjTestsOK_For_AtelierB.mch'], 'Check that we prj1/prj2 work correctly.'). | |
| 1145 | 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.'). | |
| 1146 | 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.'). | |
| 1147 | 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.'). | |
| 1148 | 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.'). | |
| 1149 | 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.'). | |
| 1150 | 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'). | |
| 1151 | 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'). | |
| 1152 | %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'], ''). | |
| 1153 | cli_testcase(958, [eventb_test], ['-t', '-p', 'CLPFD', 'FALSE', '-p', 'PROOF_INFO', 'FALSE' , '-p', 'TIME_OUT', '100', '-expcterr', 'time_out_for_invariant', | |
| 1154 | '-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'). | |
| 1155 | 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'). | |
| 1156 | 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'). | |
| 1157 | 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'). | |
| 1158 | 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'). | |
| 1159 | ||
| 1160 | 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.'). | |
| 1161 | 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'). | |
| 1162 | cli_testcase(965, [eventb_test,wd], ['-mc',100, '-p', 'PROOF_INFO', 'TRUE' , '-expcterr', well_definedness_error, '-expcterr', assertion_violation, | |
| 1163 | '-expcterr', checking_assertions, % is actually a warning generated by translate_events_in_current_scope_to_warnings | |
| 1164 | '-strict','../prob_examples/public_examples/EventBPrologPackages/ProofDirected/TestProofDirected_WD_Thm_mch.eventb'],'Check that Proof Info works well in conjunction with ill-defined theorems'). | |
| 1165 | 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'). | |
| 1166 | cli_testcase(967, [eventb_test], ['-mc',100, '-noass', '-nodead', '-p', 'PROOF_INFO', 'TRUE' , '-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'). | |
| 1167 | 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'). | |
| 1168 | cli_testcase(969, [b_test,recursion,external], ['-assertions', '-strict','../prob_examples/public_examples/B/Tickets/Bracknell1/C0.mch'],'Check that no recursion detected'). | |
| 1169 | cli_testcase(970, [b_test,recursion,external], ['-init', '-strict','../prob_examples/public_examples/B/Tickets/Bracknell1/C0_ctx.eventb'],'Check that no recursion detected'). | |
| 1170 | cli_testcase(971, [b_test], ['../prob_examples/public_examples/B/Tester/Prj1NATURAL.mch', '-t', '-mc', '1000', '-strict'], 'Check that prj1(NATURAL,...) not expanded'). | |
| 1171 | cli_testcase(972, [cbc], ['../prob_examples/public_examples/B/CBC/plavis_MemoryLoad_SP_14_TestComp.mch', '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 3, '-p', 'MININT', -1, '-strict'], 'Check that partitioning into components works'). | |
| 1172 | cli_testcase(973, [cbc], ['../prob_examples/public_examples/B/CBC/ComponentPartitioningTest.mch', '-p', 'CLPFD', 'TRUE', '-init', '-strict'], 'Check that partitioning into components works'). | |
| 1173 | cli_testcase(974, [cbc], ['../prob_examples/public_examples/B/CBC/PartitionConstraintAssertionCheck.mch', '-p', 'CLPFD', 'TRUE', '-cbc_deadlock', '-expcterr', 'cbc_deadlock_check', '-strict', '-v'], 'Check that partitioning into components works'). | |
| 1174 | cli_testcase(975, [por], ['../prob_examples/public_examples/B/Ivo/PruningActionsTest1.mch', '-mc', '1000000', '-p', 'por', ample_sets, '-expcterr', invariant_violation, '-strict'], 'POR test.'). | |
| 1175 | 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).'). | |
| 1176 | cli_testcase(977, [por], ['../prob_examples/public_examples/B/Ivo/BridgeTransitions.mch', '-mc', '1000000', '-cc', 55, '_', '-check_complete_operation_coverage', '-p', 'por', ample_sets, '-get_min_max_coverage', '../prob_examples/public_examples/B/Ivo/BridgeTransitions_por.cov', '-strict'], 'POR test (no state space reductions).'). | |
| 1177 | cli_testcase(978, [por], ['../prob_examples/public_examples/B/Ivo/CycleDetections.mch', '-mc', '1000000', '-p', 'por', ample_sets, '-expcterr', invariant_violation, '-strict'], 'POR test.'). | |
| 1178 | % commit 484a10c2cdd8cc4b13f1be8f30e8eac7be5a30c3 from 23 Oct 2013 broke 979-982; CSE optimization should recover performance | |
| 1179 | 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 | |
| 1180 | 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 | |
| 1181 | 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 | |
| 1182 | 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 | |
| 1183 | 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'). | |
| 1184 | 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 | |
| 1185 | 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'). | |
| 1186 | cli_testcase(986, [eventb_test], ['-t','-mc',100,'-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'). | |
| 1187 | 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.'). | |
| 1188 | 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)'). | |
| 1189 | 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'). | |
| 1190 | 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'). | |
| 1191 | 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.'). | |
| 1192 | 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'). | |
| 1193 | 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 | |
| 1194 | 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'). | |
| 1195 | cli_testcase(995, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLawsWithLambda.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict','-p', 'MEMO', 'TRUE', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Laws this time with MEMO and CLPFD'). | |
| 1196 | 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'). | |
| 1197 | 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).'). | |
| 1198 | 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".'). | |
| 1199 | 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'). | |
| 1200 | 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.'). | |
| 1201 | cli_testcase(1001, [b_test,union,card], ['-evalt', '{x|x <| [1,2,3] = [1,2] & card(x)=2} = {{1,2}}', | |
| 1202 | '-evalt', 'x <| s = [1,2,3] \\/ {29|->29} & x <: 1..1000 & s = %i.(i:1..300|i)', | |
| 1203 | '-evalt', 's |> x = [1,2,3] \\/ {29|->29} & x <: 1..1000 & s = %i.(i:1..300|i)', | |
| 1204 | '-evalt', '{x| [1,4,3]|>x = [1,4] & card(x)=2}={{1,4}}', | |
| 1205 | '-evalf', 's |> x = [1,2,3] \\/ {29|->29} & x <: 2..3000 & s = %i.(i:1..900|i) ', | |
| 1206 | '-evalt', '{x|#s.(x <| s = [1,2,3] \\/ {29|->29} & x <: 1..30 & s = %i.(i:1..300|i))} = {{1,2,3,29}}', | |
| 1207 | '-evalt', '{z,x|[1,2,z] |>> x = [1,2] & z:12..13 & x<:11..12}={(12|->{11,12}),(12|->{12})}', | |
| 1208 | '-evalt', 'x <<| [11,12,13,14,z] = [11,12,13,14] & z:12..13 ', | |
| 1209 | '-evalt', 'x <| [111,222,333,444,555] = [111,222,333,444]', | |
| 1210 | '-evalt', 'x <<| [111,222,333,444,555] = [111,222,333,444]', | |
| 1211 | '-evalt', '[111,222,333,444,555] |>x = [111,222,333,444]', | |
| 1212 | '-evalt', '[111,222,333,444,555] |>>x = [111,222,333,444]', | |
| 1213 | '-evalt', '{x|{x} <<| [111,222,333,444,555,666] = [111,222,333,444,555]} = {6}', | |
| 1214 | '-evalt', '{x| [111,222,333,444,555,666] |>> {x} = [111,222,333,444,555]} = {666}', | |
| 1215 | '-evalt', '{x| {x} <| [111,222,333,444,555,666] = {5|->555}} = {5}', | |
| 1216 | '-evalt', '{x| [111,222,333,444,555,666] |> {x} = {5|->555}} = {555}', | |
| 1217 | '-evalt', '{x| [111,222,333,444,555,555] |> {x} = {5|->555,6|->555}} = {555}', | |
| 1218 | '-p', 'CLPFD', 'TRUE', '-strict'], 'Ensure that domain/range restriction properly treated.'). | |
| 1219 | cli_testcase(1002, [cbc], ['-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 127, '-p', 'MININT', -128, | |
| 1220 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bank-Extraer_SP_29.prob', | |
| 1221 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_22.prob', | |
| 1222 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_11.prob', | |
| 1223 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_12.prob' | |
| 1224 | %,'-expcterr', 'eval_string_enum_warning' | |
| 1225 | ], 'SetLog tests now succeeding tests'). | |
| 1226 | cli_testcase(1003, [cbc], ['-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 127, '-p', 'MININT', -128, | |
| 1227 | %sc | |
| 1228 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCAddCat_SP_4.prob', | |
| 1229 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCAddCat_SP_22.prob', | |
| 1230 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCSetLevel_DNF_3.prob', | |
| 1231 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sc-SCSetSC_DNF_3.prob', | |
| 1232 | %bank | |
| 1233 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bank-CerrarCaja_SP_12.prob', | |
| 1234 | %banco G | |
| 1235 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_18.prob', | |
| 1236 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_2.prob', | |
| 1237 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_24.prob', | |
| 1238 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_25.prob', | |
| 1239 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_4.prob', | |
| 1240 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_5.prob', | |
| 1241 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/bancoG-Withdraw_NR_8.prob', | |
| 1242 | %qsee | |
| 1243 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_10.prob', | |
| 1244 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-LoadMemory_SP_9.prob', | |
| 1245 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpAux_SP_6.prob', | |
| 1246 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpAux_SP_8.prob', | |
| 1247 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_3.prob', | |
| 1248 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_6.prob', | |
| 1249 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_8.prob', | |
| 1250 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitScientificData_SP_16.prob', | |
| 1251 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitScientificData_SP_24.prob', | |
| 1252 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitScientificData_SP_8.prob', | |
| 1253 | %plavis ; two more missing | |
| 1254 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_45.prob', | |
| 1255 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_52.prob', | |
| 1256 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-MemoryLoad_SP_55.prob', | |
| 1257 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-RetrieveEData_SP_23.prob', | |
| 1258 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_13.prob', | |
| 1259 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_24.prob', | |
| 1260 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_3.prob', | |
| 1261 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_31.prob', | |
| 1262 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_38.prob', | |
| 1263 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_39.prob', | |
| 1264 | % iae | |
| 1265 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_103.prob', | |
| 1266 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_146.prob', | |
| 1267 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_148.prob', | |
| 1268 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_149.prob', | |
| 1269 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_18.prob', | |
| 1270 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_56.prob', | |
| 1271 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_58.prob', | |
| 1272 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/iae-DetectReferenceEvent_NR_59.prob', | |
| 1273 | % sensors | |
| 1274 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/sensors-KeepMaxReading_SP_5.prob' | |
| 1275 | %,'-expcterr', 'eval_string_enum_warning' | |
| 1276 | ], 'SetLog tests some originally succeeding tests'). | |
| 1277 | cli_testcase(1004, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CCounterErr_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 1278 | cli_testcase(1005, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CCounter_mch.eventb', '-cbc_refinement'], ''). | |
| 1279 | cli_testcase(1006, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CEnterLeave_mch.eventb', '-cbc_refinement'], ''). | |
| 1280 | cli_testcase(1007, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CEnterLeaveErr1_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 1281 | cli_testcase(1008, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CEnterLeave_Rename_mch.eventb', '-cbc_refinement'], ''). | |
| 1282 | cli_testcase(1009, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CMergeErr_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement, '-p', 'CLPFD', 'TRUE'], ''). | |
| 1283 | cli_testcase(1010, [cbc_refinement,refinement], ['../prob_examples/public_examples/EventBPrologPackages/RefinementChecking/CMerge_mch.eventb', '-cbc_refinement'], ''). | |
| 1284 | cli_testcase(1011, [cbc_refinement,refinement], ['./distribution_examples/Refinement/ServerR.ref', '-cbc_refinement'], ''). | |
| 1285 | cli_testcase(1012, [cbc_refinement,refinement], ['./distribution_examples/Refinement/ServerR_wrong.ref', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 1286 | cli_testcase(1013, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/ConcreteVars/MI.imp', '-cbc_refinement'], 'CBC refinement check on implementation'). | |
| 1287 | 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 | |
| 1288 | cli_testcase(1015, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Copy/ReturnEqualI.imp', '-cbc_refinement'], ''). | |
| 1289 | cli_testcase(1016, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Division/DivisionImplOk.imp', '-cbc_refinement'], ''). | |
| 1290 | cli_testcase(1017, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Division/DivisionImplWrongCondition.imp', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 1291 | 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.'). | |
| 1292 | cli_testcase(1019, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/Implementations/FTP/FileTransfer1.ref', '-cbc_refinement'], ''). | |
| 1293 | cli_testcase(1020, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/Implementations/FTP/FileTransfer2.ref', '-cbc_refinement'], ''). | |
| 1294 | cli_testcase(1021, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Mul/MulImp.imp', '-cbc_refinement'], ''). | |
| 1295 | cli_testcase(1022, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Mul/MulImpErr.imp', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 1296 | cli_testcase(1023, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Power/AExpBImpl.imp', '-cbc_refinement'], ''). | |
| 1297 | cli_testcase(1024, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Simple10/Simple10Imp.imp', '-cbc_refinement'], ''). | |
| 1298 | cli_testcase(1025, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Simple10/Simple10ImpErr.imp', '-cbc_refinement', '-expcterr', cbc_refinement, '-p', 'CLPFD', 'TRUE'], ''). | |
| 1299 | cli_testcase(1026, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/Simple10/Simple10ImpErr2.imp', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 1300 | cli_testcase(1027, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/RefinementChecking/ServerR.ref', '-cbc_refinement'], ''). | |
| 1301 | cli_testcase(1028, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/RefinementChecking/ServerR_wrong.ref', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 1302 | cli_testcase(1029, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/RefinementChecking/SwapR.ref', '-cbc_refinement'], ''). | |
| 1303 | cli_testcase(1030, [b_test,infinite,sequences, theories], ['../prob_examples/public_examples/B/FunctionalProgramming/SequenceTheory.mch', '-t', '-assertions'], 'Check infinite functions and sets'). | |
| 1304 | cli_testcase(1031, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/DeferredSetAndConstants.mch', '-init', | |
| 1305 | '-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'). | |
| 1306 | 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).'). | |
| 1307 | cli_testcase(1033, [dot], ['../prob_examples/public_examples/B/Benchmarks/scheduler.mch', '-bf', '-mc', 1000, '-strict', '-dotexpr', transition_diagram, 'card(active)', '../prob_examples/public_examples/B/Benchmarks/scheduler_transition_diagram.dot'],'Check Transition Diagram for Expression.'). | |
| 1308 | cli_testcase(1034, [tickets], ['../prob_examples/public_examples/B/Tickets/leuschel4/SetBecomeElementOf.mch', '-t'], 'check no error with ::'). | |
| 1309 | cli_testcase(1035, [tickets], ['../prob_examples/public_examples/B/Tester/SubstSetInTests.mch', '-t', '-p', 'CLPFD' ,'TRUE', '-p', 'SYMBOLIC', 'TRUE'], 'check no error with ::'). | |
| 1310 | 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'). | |
| 1311 | 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.'). | |
| 1312 | cli_testcase(1038, [b_test], ['-evalt', 'x mod 100000 >= 99999', | |
| 1313 | '-evalf', 'x mod 100000 > 99999', | |
| 1314 | '-evalt', '(x+2) mod 100000 >= 99999', | |
| 1315 | '-evalt', '(x-2) mod 100000 >= 99999 & x>2', | |
| 1316 | '-evalt', '{x,y|x mod y = x & y : 10..11 & x>0 & x+3>y}={(8|->10),(9|->10),(9|->11),(10|->11)}', | |
| 1317 | '-evalt', 'x:NATURAL & x mod 10000 = 9999', | |
| 1318 | '-evalt', 'x:NATURAL & x mod 10000 = 998', | |
| 1319 | '-evalf', 'x:NATURAL & x mod 10000 = 10000', | |
| 1320 | '-evalf', 'x:NATURAL & x mod 10000 = 10001', | |
| 1321 | '-evalt', '{X|X:1..20 & X**8 = 256} = {2}', | |
| 1322 | '-evalt', '{X|X:1..20 & X**9 = 256} = {}', | |
| 1323 | '-evalt', '{X,Y,Z|X:1..20 & Y : 8..9 & Z : 255..513 & X**Y = Z} = {(2,8,256),(2,9,512)}', | |
| 1324 | '-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)}', | |
| 1325 | '-p', 'CLPFD', 'TRUE', '-strict' | |
| 1326 | %, '-expcterr', eval_string_enum_warning | |
| 1327 | ], 'Ensure modulo constraint propagation.'). | |
| 1328 | cli_testcase(1039, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/MaxDevelopment/MaxImp.imp', '-cbc_refinement'], ''). | |
| 1329 | cli_testcase(1040, [cbc_refinement,imp,refinement], ['../prob_examples/public_examples/B/Implementations/MaxDevelopment/MaxImpVector.imp', '-cbc_refinement'], ''). | |
| 1330 | 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'). | |
| 1331 | cli_testcase(1042, [cbc_refinement,refinement], ['../prob_examples/public_examples/B/Implementations/MaxDevelopment/MaxR2.ref', '-cbc_refinement'], ''). | |
| 1332 | cli_testcase(1043, [pge], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', '-mc', '1000000', '-bf', '-p', pge, full, '-get_coverage_information', '../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.cov', '-strict'], 'Testing for identical coverage information after the PGE optimization.'). | |
| 1333 | 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.'). | |
| 1334 | cli_testcase(1045, [pge_fast], ['../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.'). | |
| 1335 | 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).'). | |
| 1336 | 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).'). | |
| 1337 | 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.'). | |
| 1338 | 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'). | |
| 1339 | cli_testcase(1050, [eventb_test,cbc], ['../prob_examples/examples/EventBPrologPackages/Advance_WP2/SubstationMeter_2603_2013.eventb', '-cbc', 'all', '-strict'], 'Test that proof info correctly used; machine fully proven.'). | |
| 1340 | 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.'). | |
| 1341 | cli_testcase(1052, [eventb_test,cbc], ['../prob_examples/examples/EventBPrologPackages/Advance_WP2/SubstationMeter_finite_mch.eventb', '-strict', '-mc', 50, '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test multi-level animation.'). | |
| 1342 | % generates many "Keeping comprehension-set symbolic" messages due to assignment in confirm event: | |
| 1343 | % 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)))))))} | |
| 1344 | cli_testcase(1054, [b_test, let], ['../prob_examples/public_examples/B/FeatureChecks/NestedAnys.mch', '-t', '-mc', 100, '-cc', 6, 7], 'Check LET extraction'). | |
| 1345 | cli_testcase(1055, [csp_test,refinement], ['../prob_examples/public_examples/CSP/ucsexamples/chapter04/abp.csp','-assertions','-strict'], 'Checking CSP-M assertions.'). | |
| 1346 | 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.'). | |
| 1347 | 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'). | |
| 1348 | 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).'). | |
| 1349 | 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) }', | |
| 1350 | '-evalt', '{X,F|bool(X /\\ {1} = {} & X \\/ {1} = 1..50000)=F & F:{TRUE,FALSE} & F=bool({1} <: {2,1})} <<: { (2..50000,TRUE), ({},TRUE) }', | |
| 1351 | '-evalt', 'card(%(X,F).(bool(X /\\ {1} = {} & X \\/ {1} = 1..50000)=F & F:{TRUE,FALSE} & F=bool({1} <: {2,1})|F))=1', | |
| 1352 | '-evalt', '{X| X /\\ {1} = {} & X \\/ {1} = 1..20} = {2..20}'], 'Check partition detection inside expressions'). | |
| 1353 | cli_testcase(1060, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/PartitionDetection.mch', '-t'], 'Check partition detection inside substitutions'). | |
| 1354 | 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)', | |
| 1355 | '-evalt', '#f.(f : 1..10 --> 1..10 & ran(f) = 1..10)'],'Check that range/domain/-->> scale properly'). | |
| 1356 | 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})', | |
| 1357 | '-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))', | |
| 1358 | '-evalt', 'i = %(x,y).(x:INTEGER&y:INTEGER|x+y) & m = %y.(y:NATURAL|y*y) & f = (i;m) & 2500 = f(20,30)', | |
| 1359 | '-evalt', 'i = %(x,y).(x:INTEGER&y:INTEGER|x+y) & m = %y.(y:NATURAL1|bool(y>100)) & f = (i;m) & TRUE = f(20,90)', | |
| 1360 | '-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', | |
| 1361 | '-evalt', 'max0 = %x.(x<:INTEGER|max(x)-1) & inc = %v.(v:INTEGER|v+1) & m = (max0;inc) & m(1..100 \\/ {4321})=4321', | |
| 1362 | '-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' | |
| 1363 | ],'Check that relational composition of infinite function works'). | |
| 1364 | 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.'). | |
| 1365 | 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.'). | |
| 1366 | ||
| 1367 | 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', | |
| 1368 | '-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'). | |
| 1369 | ||
| 1370 | cli_testcase(1066, [b_test], ['../prob_examples/public_examples/B/Mathematical/GCD.mch', '-init', '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', 128, '-evalt', 'half(201)=100', | |
| 1371 | '-eval', 'gcd({10,15})', % this one is not well defined | |
| 1372 | '-evalt', 'gcdc({1000,750})=250'], 'Check that expression values enumerated'). % gcd({10,15}) requires enumeration of result value | |
| 1373 | ||
| 1374 | cli_testcase(1067, [cbc], ['../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'). | |
| 1375 | cli_testcase(1068, [cbc], ['../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'). | |
| 1376 | 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'). | |
| 1377 | cli_testcase(1070, [cbc], ['../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'). | |
| 1378 | cli_testcase(1071, [cbc], ['../prob_examples/public_examples/B/TestCaseGeneration/InvolvedSequences2.mch', '-cbc_sequence', 'Op1;Op2;Op3;Target3', '-p', 'CLPFD', 'TRUE'], 'Check that constraints can be solved'). | |
| 1379 | 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'). | |
| 1380 | 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'). | |
| 1381 | cli_testcase(1074, [cbc,tla,smt_test], ['../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'). | |
| 1382 | 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'). | |
| 1383 | 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'). | |
| 1384 | ||
| 1385 | 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)', | |
| 1386 | '-evalf', '{y|#(r,r2).({x,y|x<y} = r & r2 = (r;r) & 20|->y : r2 & y|->25 : r2)} = (22..24)', | |
| 1387 | '-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', | |
| 1388 | '-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', | |
| 1389 | '-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)', | |
| 1390 | '-evalt', 'half = {x,y|y+y=x} & card(half[1024 .. xx] \\/ (closure1(half) ; half)[1024 .. xx])=10 & xx=1024', | |
| 1391 | '-p', 'SYMBOLIC', 'TRUE', '-p', 'CLPFD', 'TRUE' | |
| 1392 | , '-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 | |
| 1393 | ], 'Test that symbolic relational composition works'). | |
| 1394 | 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'). | |
| 1395 | 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'). | |
| 1396 | 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'). | |
| 1397 | 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'). | |
| 1398 | cli_testcase(1082, [csp_test], ['../prob_examples/public_examples/CSP/Tickets/TUBerlin/Interleaving.csp','-assertions','-strict'], 'Checking CSP-M assertions.'). | |
| 1399 | 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', | |
| 1400 | '-p', 'MEMO', 'TRUE' %, '-expcterr' , eval_string_enum_warning | |
| 1401 | ],'ensure no avl_set(empty) is generated anymore'). | |
| 1402 | cli_testcase(1084, [cbc,card], ['-evalt', 'r:INTEGER<->INTEGER & dom(r)=2..20', | |
| 1403 | '-evalt', 'r:INTEGER<->BOOL & dom(r)=2..50', | |
| 1404 | '-evalt', 'r:INTEGER<->INTEGER & ran(r)=2..50', | |
| 1405 | %'-evalt', 'r:INTEGER<->INTEGER & ran(r)=2..16 & card(r)>=15', | |
| 1406 | %'-evalt', 'r:INTEGER<->INTEGER & dom(r)=2..16 & card(r)>=15', | |
| 1407 | '-evalt', 'r:INTEGER<->INTEGER & dom(r)=10002..10016', | |
| 1408 | '-evalt', 'r:INTEGER<->INTEGER & ran(r)=10002..10016', | |
| 1409 | '-evalt', 'card({r|r:INTEGER<->INTEGER & dom(r)=61..64 & card(r)=4 & ran(r) = 55..56})=14', | |
| 1410 | '-evalt', 'card({r|r:INTEGER<->INTEGER & dom(r)=9961..9964 & card(r)=4 & ran(r) = 2155..2158})=24', | |
| 1411 | '-evalt', 'card({r|r:INTEGER<->INTEGER & dom(r)=61..64 & card(r)=4 & ran(r) = 155..159})=0', | |
| 1412 | '-p', 'CLPFD', 'TRUE' %, '-expcterr', eval_string_enum_warning | |
| 1413 | ],'ensure proper constraint-solving for domain/range'). | |
| 1414 | 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'). | |
| 1415 | cli_testcase(1086, [csp_test, cbc], ['../prob_examples/public_examples/CSP/clpfd_tests/SetComprehensionCBC.csp','-p', 'CLPFD', 'TRUE', '-assertions','-strict'], 'Checking CSP-M assertions (CBC test case).'). | |
| 1416 | 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'). | |
| 1417 | cli_testcase(1088, [cbc,smt_test], ['../prob_examples/public_examples/B/Benchmarks/phonebook7.mch','-p', 'CLPFD', 'TRUE', | |
| 1418 | '-p', 'TIME_OUT', 5000, % increased time-out after change of pfun enumeration priority; TO DO: fix | |
| 1419 | '-p', 'SMT', 'TRUE', % added SMT option after adding wait flag for propagate_result_to_input in domain_wf in bsets_clp | |
| 1420 | '-cbc', 'all','-strict'], 'Check that we do not time-out (due to delaying normalisation of variables).'). | |
| 1421 | 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'). | |
| 1422 | cli_testcase(1090, [b_test,infinite,sigma,union], [ | |
| 1423 | '-evalt', 'f = {x,y,z| x*x + y*y = z*z} & {y|(3,4,y):f} = {-5,5}', | |
| 1424 | '-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]}', | |
| 1425 | '-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', | |
| 1426 | '-p', 'CLPFD', 'TRUE'],'ensure ProB detects certain relations as infinite automatically'). | |
| 1427 | 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).'). | |
| 1428 | 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).'). | |
| 1429 | cli_testcase(1093, [b_test,infinite,override,sigma,union,card], [ | |
| 1430 | '-evalt', 'f = %x.(x:NATURAL|x+x) & g = f <+ {0|->1} & g(0)=res0 & g(111)=res1', | |
| 1431 | '-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', | |
| 1432 | '-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', | |
| 1433 | '-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)', | |
| 1434 | '-p', 'CLPFD', 'TRUE'],'ensure symbolic treatment of override'). | |
| 1435 | 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).'). | |
| 1436 | 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.'). | |
| 1437 | 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.'). | |
| 1438 | cli_testcase(1097, [tickets,eventb_test,'PROB-292'], ['../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'). | |
| 1439 | 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'). | |
| 1440 | cli_testcase(1099, [b_test,card,infinite], [ '-p', 'TIME_OUT', 1500, | |
| 1441 | '-evalt', 'f = /*@symbolic*/ {x,y|x:0..2**32 & x mod 2 =0 & y=x*x} & f(x) = 10000', | |
| 1442 | '-evalt', 'f = /*@symbolic*/ {x,y|x:0..2**132 & x mod 2 =0 & y=x*x} & f(x) = 10000', | |
| 1443 | '-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)', | |
| 1444 | '-p', 'CLPFD', 'TRUE'],'ensure detection of large set comprehensions'). % TO DO: see if we can it to work again without symbolic | |
| 1445 | cli_testcase(1100, [b_test,card], [ | |
| 1446 | '-evalt', 'r = {(111,2222),(333,4444)} & s = (2000..2001)*{v|v>3000} & x : (r||s)', | |
| 1447 | '-evalt', 'card(((1..100)*(50..60) || (2..30)*(20..22))) = 95700', | |
| 1448 | '-evalt', 'card(((1..100)*(50..60) || (2..30)*(23..22)))=0', | |
| 1449 | '-evalt', '(((1..10)*(50..60) || (2..30)*(23..24)))~ = (((50..60)*(1..10) || (23..24)*(2..30)))', | |
| 1450 | '-evalt', 'card(((1..1000)*(50..60) || (2..30)*(20..22))) = 957000', | |
| 1451 | '-evalt', 'card(((1..n)*(50..60) || (2..30)*(20..22))) = 957*n & n=10', | |
| 1452 | '-p', 'CLPFD', 'TRUE' %, '-expcterr', 'eval_string_enum_warning' | |
| 1453 | ],'ensure symbolic treatment of parallel product works'). | |
| 1454 | ||
| 1455 | cli_testcase(1101, [private,data_validation,infinite],[ | |
| 1456 | '../prob_examples/examples/B/Systerel/C578.EML.014/360_002.mch', | |
| 1457 | '../prob_examples/examples/B/Systerel/C578.EML.014/380_002.mch', | |
| 1458 | '../prob_examples/examples/B/Systerel/C578.EML.014/612_001.mch', | |
| 1459 | '../prob_examples/examples/B/Systerel/C578.EML.014/019_100_corrected.mch', | |
| 1460 | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_TVD_8.mch', | |
| 1461 | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_CBTC_TER_1.mch', | |
| 1462 | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_ZMA_PRUD_1.mch', | |
| 1463 | '../prob_examples/examples/B/Systerel/C578.EML.014/CF_ZMA_PRUD_7.mch', | |
| 1464 | '-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', 'TRUE', '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-strict'], | |
| 1465 | 'check data validation tasks with infinite sets'). | |
| 1466 | cli_testcase(1102, [private,data_validation,infinite],[ | |
| 1467 | '../prob_examples/examples/B/Systerel/C578.EML.014/019_100.mch', | |
| 1468 | '-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'], | |
| 1469 | 'check data validation tasks with infinite sets'). | |
| 1470 | cli_testcase(1103, [private,data_validation,infinite],[ | |
| 1471 | '../prob_examples/examples/B/Systerel/C578.EML.014/435_002.mch', | |
| 1472 | '-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'], | |
| 1473 | 'check data validation tasks with infinite sets'). | |
| 1474 | cli_testcase(1104, [b_test, let,quantified,union,card], [ | |
| 1475 | '-evalt', 'INTER(x , y,z ).(x=1..y & y=5&z=2|x) = {1,2,3,4,5}', | |
| 1476 | '-evalt', 'UNION(x , y,z ).(x=1..y & y=5&z=2|x) = {1,2,3,4,5}', | |
| 1477 | '-evalt', 'UNION(x , y ).(x=1..y & y=20|x)=1..20', | |
| 1478 | '-evalt', 'UNION(beu).(beu=1|{2}) = {2}', | |
| 1479 | '-evalt', 'UNION(xx).(xx<:55..60|xx) = 55..60', | |
| 1480 | '-evalt', 'UNION(x , y ).(x=1..y & y=20&v<10|x)=r & v=20 & r={}', | |
| 1481 | '-evalt', 'UNION(x , y ).(x=1..y & y=20&v<10|x)=r & v=5 & r=1..20', | |
| 1482 | '-evalt', 'UNION(x).(x=1 & x>2|{1}) = {}', | |
| 1483 | '-evalf', 'card(UNION(x).(x=1 & x>2|{1}))>0', | |
| 1484 | '-evalt', 'UNION(x).(x=1 & (x>2 or x<3)|{x}) = {1}', | |
| 1485 | '-evalt', 'UNION(x,y).(x=1 & (x>2 or x<y) & y:0..3|{x|->y}) = {(1|->2),(1|->3)}', | |
| 1486 | '-evalt', 'UNION(x,y).(x=y & y=x+1 & x:1..100|{x|->y}) = {}', | |
| 1487 | '-evalt', 'UNION(x,y).(x=1 & y:1..2|{x+y}) = {2,3}', | |
| 1488 | '-evalt', 'INTER(x,y).(x=1 & y:1..2|{x+y}) = {}', | |
| 1489 | '-evalt', 'INTER(x,y).(x=1 & y:1..2|{x+y,x+y+1})={3}', | |
| 1490 | '-evalt', 'INTER(x,y,z).(x=1000 & z=x+1000 & y:1..2|{x+y+z,x+y+z+1}) = {3002}', | |
| 1491 | '-evalf', '!(x,y).(x=1 & y:(x+1)..(x+19) => y+y<30)', | |
| 1492 | '-evalt', '!(x,y).(x=1 & y:(x+1)..(x+19) => y+y<42)', | |
| 1493 | '-evalt', '!x.(x=100 & x>200 => x>999)', | |
| 1494 | '-evalt', '!x.(x=100 & x>50 => x>99)', | |
| 1495 | '-evalf', '!x.(x=100 & x>50 => x>100)', | |
| 1496 | '-evalt', '!(x,y,z,v).(x=10 & y=20 & z=x+y & v:x..z => v:NATURAL1)', | |
| 1497 | '-evalt', 'f = {1|->2} & !e.(2:dom(f) & e=f(2) => e>100)', | |
| 1498 | '-evalf', 'f = {1|->2} & !e.(1:dom(f) & e=f(1) => e>100)', | |
| 1499 | '-evalf', 'f = {1|->2} & !e.(e=f(1) => e>100)', | |
| 1500 | '-evalt', 'f = {1|->200} & !e.(e=f(1) => e>199)' | |
| 1501 | ],'ensure UNION/INTER can be dealt with by typechecker, + LET introduction works correctly...'). | |
| 1502 | cli_testcase(1105,[private, data_validation,alstom,codespeed],[ | |
| 1503 | '../prob_examples/examples/B/Alstom/sgd_Jun11/vital_gradient_v3/vital_gradient_optimized.mch', | |
| 1504 | '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '35000', '-t'], | |
| 1505 | 'check that trace can be replayed'). | |
| 1506 | cli_testcase(1106, [b_test,recursion,external], ['../prob_examples/public_examples/B/RecursiveFunctions/PrimitiveRecursiveFunctions.mch', | |
| 1507 | '../prob_examples/public_examples/B/RecursiveFunctions/SumTLA.mch', | |
| 1508 | '../prob_examples/public_examples/B/RecursiveFunctions/TransitiveClosureFunction.mch', | |
| 1509 | '../prob_examples/public_examples/B/RecursiveFunctions/TransitiveClosureFunctionIFTE.mch', | |
| 1510 | '-assertions', '-strict', '-p', 'SYMBOLIC', 'FALSE'], 'Test that other recursive functions work.'). | |
| 1511 | 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.'). | |
| 1512 | cli_testcase(1108, [b_test,sigma,card], ['-p', 'CLPFD', 'TRUE', | |
| 1513 | '-evalt', 'bool(!(x,y).(x:1..400000 & y:1..x => x>=y)) /= bool(!(x,y).(x:1..400000 & y:1..x => x>y))', | |
| 1514 | '-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))', | |
| 1515 | % we wrap into bool to avoid top-level rewriting of ! | |
| 1516 | '-evalt', '!(x,y).(x:1..400000 & y:1..x => x>=y)', | |
| 1517 | '-evalf', '!(x,y).(x:1..400000 & y:1..x => x>y)', | |
| 1518 | '-evalf', '!x.(x:POW(1..100) & card(x)>1 => SIGMA(y).(y:x|y)>3)', | |
| 1519 | '-evalf', '!x.(x:POW(1..100) & card(x)>1 => SIGMA(y).(y:x|y)<200)', | |
| 1520 | '-strict'], 'Check that forall can now deal with large domains'). | |
| 1521 | cli_testcase(1109, [tickets], ['../prob_examples/public_examples/B/Tickets/Valerio3/BV16_DEFINITION.mch', '-strict', '-init', '-p', 'SYMBOLIC', 'TRUE', '-p', 'CLPFD', 'TRUE', | |
| 1522 | '-evalf', '!(vec).( vec : BIT_VECTOR => size (vec)<=16)', | |
| 1523 | '-evalt', 'bool(!(vec).( vec : BIT_VECTOR => size (vec)<=16))=bool(!(vec).( vec : BIT_VECTOR => size (vec)<=2))' | |
| 1524 | %,'-expcterr', 'eval_string_enum_warning' | |
| 1525 | ], 'Check that ProB now detects this quantification to be false'). % previously it was not detected due to limited enumeration | |
| 1526 | cli_testcase(1110, [ltl], ['../prob_examples/public_examples/B/Ivo/PruningActionsTest2.mch', '-ltlassertions', '-strict'], 'Checking independency of actions by means of LTL Formulas.'). | |
| 1527 | cli_testcase(1111, [tickets,quantified,union],['../prob_examples/public_examples/B/PerformanceTests/UNION_PerfTest.mch', | |
| 1528 | '-p', 'SYMBOLIC', 'TRUE', '-assertions' ,'-p' ,'CLPFD', 'TRUE', | |
| 1529 | '-p', 'TIME_OUT', 1000], 'Ensure symbolic ran closure can be expanded efficiently'). | |
| 1530 | cli_testcase(1112, [tickets,alstom],['../prob_examples/examples/B/Alstom/cbtc/params_cbtc.mch', | |
| 1531 | '-init' ,'-p' ,'IGNORE_PRJ_TYPES', 'TRUE', '-p', 'TIME_OUT', '3500'], 'Ensure symbolic ran closure can be expanded efficiently'). | |
| 1532 | cli_testcase(1113, [b_test,card], ['-p', 'CLPFD', 'TRUE', | |
| 1533 | '-evalt', 'card({x|#y.(y:111..112 & x = {{y*y}})}) = 2', | |
| 1534 | '-evalt', 'card({x|#y.(y:111..112 & x = {{{{{y*y}}}}})}) = 2', | |
| 1535 | '-evalt', 'card({x|#y.(y:POW(BOOL) & card(y)=1 & x = ({(y,TRUE)},TRUE,TRUE,FALSE,TRUE,FALSE,TRUE,FALSE))}) =2', | |
| 1536 | '-evalt', '{x|#y.(y:POW(BOOL) & card(y)=1 & x = {(y,TRUE,FALSE,TRUE)})} = {{((({FALSE}|->TRUE)|->FALSE)|->TRUE)},{((({TRUE}|->TRUE)|->FALSE)|->TRUE)}}', | |
| 1537 | '-evalt', '{x,y|#z.(z:{1024,2048,4096} & x=z+z & y={{z*z}})} = {(2048|->{{1048576}}),(4096|->{{4194304}}),(8192|->{{16777216}})}', | |
| 1538 | '-evalt', '{x|#z.(z:1..2**20 & x=z & x+z<100)} = 1..49', | |
| 1539 | '-strict'], 'Check closures with top-level existential quantifiers'). | |
| 1540 | cli_testcase(1114, [tickets,csp_test],['../prob_examples/public_examples/B/Tickets/315/ANN_Neuron.csp', | |
| 1541 | '-t' , '-mc', 200, '-check_complete', '-cc', 26, 42], 'Ensure ticket remains fixed'). | |
| 1542 | cli_testcase(1115, [tickets,eventb_test],['../prob_examples/public_examples/EventBPrologPackages/Ticket_ThmGuard/M2_mch.eventb', | |
| 1543 | '-t' , '-mc', 200, '-check_complete'], 'Ensure theorem in guards work'). | |
| 1544 | cli_testcase(1116, [dot,eventb_test,dot],['../prob_examples/public_examples/EventBPrologPackages/Tests/UnicodeIds_mch.eventb', | |
| 1545 | '-mc', 200, '-nodead', '-check_complete', '-dot', 'state_space', '../prob_examples/public_examples/EventBPrologPackages/Tests/UnicodeIds_spdot.dot'], 'Ensure Unicode characters work in Dot export'). | |
| 1546 | cli_testcase(1117, [tickets],['../prob_examples/public_examples/B/Tickets/Srivastava1/Total_M1.mch', | |
| 1547 | '-t' , '-strict'], 'Ensure that expensive arg in relations check not computed'). | |
| 1548 | 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'). | |
| 1549 | 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'). | |
| 1550 | 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.'). | |
| 1551 | cli_testcase(1121, [tickets,csp_test],['../prob_examples/public_examples/CSP/other/Ivo/ComplexDataTypes.csp', '-t'], 'Checking complex input/output values for channel.'). | |
| 1552 | ||
| 1553 | cli_testcase(1122, [private,data_validation], ['../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'). | |
| 1554 | cli_testcase(1123, [tickets], ['../prob_examples/public_examples/B/ErrorMachines/IllegalFunCalls/FunCall_Exists_correct.mch', '-init' ,'-assertions'], 'Check that WD issue inside negate exists solved'). | |
| 1555 | cli_testcase(1124, [tickets,wd], ['../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'). | |
| 1556 | cli_testcase(1125, [b_test,data_validation,infinite,override], ['-p', 'SYMBOLIC', 'TRUE', | |
| 1557 | '-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'], | |
| 1558 | 'Test that override works symbolically'). | |
| 1559 | cli_testcase(1126, [private,data_validation,infinite,override], ['../prob_examples/examples/B/Systerel/C578/2013/machines_14082013/PB_00611_005.mch', | |
| 1560 | '../prob_examples/examples/B/Systerel/C578/2013/machines_14082013/PS_00611_006.mch', | |
| 1561 | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE'], 'Check symbolic override issues solved'). | |
| 1562 | cli_testcase(1127, [tickets], ['../prob_examples/public_examples/B/Tickets/PROB-306/OperationCallBug.mch', '-strict', '-init', | |
| 1563 | '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check type checker for wrong number of arguments in operation call'). | |
| 1564 | cli_testcase(1128, [tickets], ['../prob_examples/public_examples/B/Tickets/PROB-306/OperationCallBug2.mch', '-strict', '-init', | |
| 1565 | '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check type checker for wrong number of results in operation call'). | |
| 1566 | cli_testcase(1130, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_03092013/error/0050_001.mch', | |
| 1567 | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'TIME_OUT', 3500], 'Check bug remains solved (unification in b_compute_expression2)'). | |
| 1568 | cli_testcase(1131, [private,data_validation],[ | |
| 1569 | '../prob_examples/examples/B/Systerel/C578/2013/machines_06092013/C_02_001.mch', | |
| 1570 | '-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'], | |
| 1571 | 'check memory consumption ok'). | |
| 1572 | cli_testcase(1132,[csp_test], ['../prob_examples/public_examples/CSP/CSPOZ/CurriedNATupleFunNested.csp', '-assertions', '-strict'], 'Nested NA-Tuples.'). | |
| 1573 | ||
| 1574 | cli_testcase(1133, [csp_test], ['../prob_examples/public_examples/CSP/mydemos/demo/basin_olderog_bank.csp', '-mc', 1000, '-cc', 129, 673, '-strict'], ''). | |
| 1575 | 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.'). | |
| 1576 | cli_testcase(1135, [csp_test], ['../prob_examples/public_examples/CSP/CSPOZ/CurriedNATupleFunNested.csp', '-assertions', '-t', '-strict'], 'Testing curry functions.'). | |
| 1577 | cli_testcase(1136, [csp_test], ['../prob_examples/public_examples/CSP/evans/KeyNETv2.csp', '-mc', '1000', '-nodead', '-cc', 24, 23, '-assertions', '-strict'], ''). | |
| 1578 | 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.'). | |
| 1579 | 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.'). | |
| 1580 | 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.'). | |
| 1581 | 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).'). | |
| 1582 | 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).'). | |
| 1583 | 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).'). | |
| 1584 | 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).'). | |
| 1585 | 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', '-get_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).'). | |
| 1586 | cli_testcase(1145, [b_test], ['-p', 'CLPFD', 'TRUE', | |
| 1587 | '-evalt', '{} <: (1..100000000 \\/ {-1})'], | |
| 1588 | 'Check that we do not compute <: if first arg {}'). | |
| 1589 | cli_testcase(1146, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_06092013/T_032_002.mch', | |
| 1590 | '-init' ,'-aa', 0,1,0, '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'TIME_OUT', 11500, '-p', 'CLPFD', 'TRUE', | |
| 1591 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check test eq_emtpy_set bug remains solved'). % increased time-out from 7500 | |
| 1592 | cli_testcase(1147, [por], ['../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Peterson/em_abs.mch', '-mc', 10000, '-p', por, 'ample_sets', '-get_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'). | |
| 1593 | 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', '-get_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'). | |
| 1594 | 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'). | |
| 1595 | cli_testcase(1150, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/BoolOpsTest1.eventb', '-mc', 10, '-nodead', '-strict'], 'Checking the BoolOps theory'). | |
| 1596 | cli_testcase(1151, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListTest1.eventb', '-mc', 100, '-nodead', '-strict'], 'Checking the List theory'). | |
| 1597 | cli_testcase(1152, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ClosureTest1.eventb', '-p', 'SYMMETRY_MODE', nauty, '-p', 'MAX_OPERATIONS', 100, '-mc', 1000, '-nodead', '-strict'], 'Checking the closure theory'). | |
| 1598 | cli_testcase(1153, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/SumProductTest1.eventb', '-mc', 100, '-nodead', '-strict'], 'Checking the SUM and PRODUCT theory'). | |
| 1599 | cli_testcase(1154, [b_test,union], ['-p', 'CLPFD', 'TRUE', | |
| 1600 | '-evalt', 'x : 1..1000040 \\/ {10000061} & x mod 2 = 0', | |
| 1601 | '-evalt', 'x : 1..10000040 \\/ {10000061} & x mod 2 = 0', | |
| 1602 | '-evalt', 'x : 1..10000040 \\/ {10000061}' | |
| 1603 | % does not work yet: ,'-evalt', ' x : {-33} \/ {0} \/ 1..10000040 \/ {10000061} \/ {-22}' | |
| 1604 | ], 'Check union of AVL with large interval does not expand interval'). | |
| 1605 | 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'). | |
| 1606 | cli_testcase(1156, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/SeqTest1.eventb', '-mc', 2000, '-nodead', '-strict'], 'Checking the Seq theory'). | |
| 1607 | cli_testcase(1157, [private,data_validation,infinite,override],[ | |
| 1608 | '../prob_examples/examples/B/Systerel/C578.EML.014/670_002.mch', | |
| 1609 | '-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'], | |
| 1610 | 'check override computed explicitly for A*B*C <+ {...} for reasonable sizes'). % increased TIME_OUT from 11000 | |
| 1611 | cli_testcase(1158, [b_test], ['-p', 'SYMBOLIC', 'TRUE','-p', 'CLPFD', 'TRUE', | |
| 1612 | '-evalt', '95|->93 : dom({x,y,z| x>z & y<z})', | |
| 1613 | '-evalf', '94|->93 : dom({x,y,z| x>z & y<z})' ], | |
| 1614 | 'check symbolic treatment of domain'). | |
| 1615 | cli_testcase(1159, [b_test,card], ['-p', 'CLPFD', 'TRUE', | |
| 1616 | '-evalt', '{S1|S1 <: {"d","f","3","14","play"} & {"d"} /<<: S1 & card(S1):4..5} = {{"14","3","f","play"}}' ], | |
| 1617 | 'simple CBC check from old paper'). | |
| 1618 | cli_testcase(1160, [b_test,infinite], ['-p', 'SYMBOLIC', 'TRUE','-p', 'CLPFD', 'TRUE', | |
| 1619 | '-evalt', 'f = %i.(i:1..100|i*i) & f[NATURAL1] = x & max(x)=10000', | |
| 1620 | '-evalt', 'f = %i.(i:1..100|i*i) & f[{v|v<=20}] = x & max(x)=400', | |
| 1621 | '-evalt', 'f = %i.(i:0..100|i*i) & f[NATURAL1] = x & min(x)=1'], | |
| 1622 | 'test that we can take image of infinite set'). | |
| 1623 | cli_testcase(1161, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/07_001.mch', | |
| 1624 | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'TIME_OUT', 39500, | |
| 1625 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check performance'). % increased time-out from 9500 (16th July 2014) | |
| 1626 | cli_testcase(1162, [private,data_validation], [%'../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/02_001_adapted.mch', % moved to test 1376 | |
| 1627 | '../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/30_001_adapted.mch', | |
| 1628 | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', 35000, | |
| 1629 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check performance'). | |
| 1630 | cli_testcase(1163, [b_test], ['-p', 'CLPFD', 'TRUE', | |
| 1631 | '-evalf', '0..x <: 1..100000 & x>0', | |
| 1632 | '-evalt', '0..101001 <: 0..x & x <1001000', | |
| 1633 | '-evalt', '1..2**65 <: 1..2**66', | |
| 1634 | '-evalf', '1..2**67 <: 1..2**66', | |
| 1635 | '-evalt', '1..2**65 <: x..2**66 & x:0..10', | |
| 1636 | '-evalf', '1..2**65 <: x..2**66 & x:2..100000', | |
| 1637 | '-evalf', 'x:180..200 & y: 3000..4000 & x+y=z & x..z <: x..w & w<3500 & w<z', | |
| 1638 | '-evalt', 'x:180..200 & y: 3000..4000 & x+y=z & x..z <: x..w & w<3500 & w<=z', | |
| 1639 | ||
| 1640 | '-evalf', '0..x <<: 1..100000 & x>0', | |
| 1641 | '-evalt', '0..101001 <<: 0..x & x <1001000', | |
| 1642 | '-evalt', '1..2**65 <<: 1..2**66', | |
| 1643 | '-evalf', '1..2**66 <<: 1..2**66', | |
| 1644 | '-evalt', '2..2**66 <<: 1..2**66', | |
| 1645 | '-evalt', '-10000..x <<: 1..2 & x>-(2**20)', | |
| 1646 | '-evalf', 'x:180..200 & y: 3000..4000 & x+y=z & x..z <<: x..w & w<3500 & w<=z', | |
| 1647 | ||
| 1648 | '-evalt', '{x|1..x /<: 1..10000 & x<10003} = {10001,10002}', | |
| 1649 | '-evalt', '1000..x /<: 1..y & y..1010 /<: y..1009 & x..1010 /<: x..1009 & y>0', | |
| 1650 | ||
| 1651 | '-evalt', '1..2**65 /<<: 1..2**65', | |
| 1652 | '-evalf', '1..2**65 /<<: 1..2**66', | |
| 1653 | '-evalf', '2..2**66 /<<: 1..2**66', | |
| 1654 | '-evalf', 'x..y /<<: 1001..1002 & x:100..200 & y:0..10', | |
| 1655 | '-evalt', '{x,y|x..y /<<: 1001..1002 & x:100..200 & y:0..100}={(100,100)}', | |
| 1656 | '-evalt', '{x,y|x..y /<<: 1001..1002 & x:1001..1030 & y<1004} = {(1001|->1002),(1001|->1003),(1002|->1003),(1003|->1003)}', | |
| 1657 | '-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)}', | |
| 1658 | '-evalt', '10..y /<<: 200..x & x>100 & y:1..5', | |
| 1659 | '-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)}' | |
| 1660 | ||
| 1661 | ], 'Check interval treatment in subset'). | |
| 1662 | 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.'). | |
| 1663 | cli_testcase(1165, [b_test,sequences,strings], ['-p', 'CLPFD', 'TRUE', %'-expcterr', eval_string_enum_warning, | |
| 1664 | '-evalt', 'mdp = 5 * 43 & (yy: mdp + 1 .. ( mdp + 43 ) & yy: dom(memp)) & memp:seq(STRING)', | |
| 1665 | '-evalt', '16: dom(memp) & memp:seq(STRING)', | |
| 1666 | '-evalt', 'memp:seq(STRING) & 16: dom(memp)', | |
| 1667 | '-evalt', 'memp:seq(STRING) & mdp = 5 * 43 & (yy: mdp + 1 .. ( mdp + 43 ) & yy: dom(memp))', | |
| 1668 | '-evalt', '{x} /\\ 0..2000 = {} & x>0' | |
| 1669 | ], 'Check constraint propagation of in domain + in sequence + interval intersection'). | |
| 1670 | cli_testcase(1166, [b_test], ['-p', 'CLPFD', 'TRUE', | |
| 1671 | '-evalt', 'x /\\ 1000..2000 = {1001}', | |
| 1672 | '-evalt', 'x /\\ 1000..2000 = {y}', | |
| 1673 | '-evalt', '1000..2000 /\\ x = {y}', | |
| 1674 | '-evalt', '{x} /\\ 10000..999999 = r & r={y}', | |
| 1675 | '-evalt', '{x} /\\ 10000..999999 = {y}', | |
| 1676 | '-evalt', '10000..x = {y}', | |
| 1677 | '-evalf', '10000..20000000 = {y}', | |
| 1678 | '-evalf', '{x|x>2} = {y}', | |
| 1679 | '-evalt', 'x:0..999999 & y:0..99999 & {x} /\\ 10000..999999 = {y}', | |
| 1680 | '-evalt', '{x} /\\ {y} /= {} & x:1000..2000 & y>=0', | |
| 1681 | '-evalt', '{x} /\\ {y} /= {} & x:1000000..20000000 & y>=0', | |
| 1682 | '-evalt', 'a..b = {x} & x:100..1002', | |
| 1683 | '-evalt', '{a,b,x|a..b = {x} & x:1000..1002} = {((1000|->1000)|->1000),((1001|->1001)|->1001),((1002|->1002)|->1002)}', | |
| 1684 | ||
| 1685 | '-evalt', '{x|x>0} = NATURAL1', | |
| 1686 | '-evalf', '{x|x>0} = NATURAL', | |
| 1687 | '-evalt', '{x|x>0} /= NATURAL', | |
| 1688 | '-evalt', '{x|x<110} /= NATURAL', | |
| 1689 | '-evalt', '{x|x>0} <: NATURAL1', | |
| 1690 | '-evalf', '{x|x>=0} <: NATURAL1', | |
| 1691 | '-evalt', '{x|x>0} <: INTEGER', | |
| 1692 | '-evalt', '{x|x>0} <: {x|x>-1}', | |
| 1693 | '-evalt', '{x|x>0} <: {x|x>0}', | |
| 1694 | '-evalf', '{x|x>0} <: {x|x>1}', | |
| 1695 | '-evalf', 'NATURAL1 <: 0..10000', | |
| 1696 | '-evalt', '{x|x>1} <<: {x|x>0}', | |
| 1697 | '-evalf', '{x|x>0} <<: {x|x>0}', | |
| 1698 | '-evalf', '{x|x>0} <<: NATURAL1', | |
| 1699 | '-evalt', '{x|x>0} <<: NATURAL', | |
| 1700 | '-evalt', '{x|x>0} <<: INTEGER', | |
| 1701 | '-evalf', '{x|x>0} <<: {x|x>2}', | |
| 1702 | '-evalt', '{x|x>0} <<: {x|x>-200}', | |
| 1703 | '-evalf', 'NATURAL1 <<: 0..10000', | |
| 1704 | '-evalf', '{x|x<20000} <<: 0..10000', | |
| 1705 | '-evalf', '{x|x>0} /<: NATURAL1', | |
| 1706 | '-evalt', '{x|x>=0} /<: NATURAL1', | |
| 1707 | '-evalf', '{x|x>0} /<: INTEGER', | |
| 1708 | '-evalf', '{x|x>0} /<: {x|x>-1}', | |
| 1709 | '-evalf', '{x|x>0} /<: {x|x>0}', | |
| 1710 | '-evalt', '{x|x>0} /<: {x|x>1}', | |
| 1711 | '-evalt', 'NATURAL1 /<: 0..10000', | |
| 1712 | '-evalt', '{x|x>=0} /<<: NATURAL', | |
| 1713 | '-evalt', '{x|x>=0} /<<: NATURAL1', | |
| 1714 | '-evalf', '{x|x>=0} /<<: INTEGER', | |
| 1715 | '-evalt', 'NATURAL /<<: NATURAL1', | |
| 1716 | '-evalf', '1..100 /<<: NATURAL1', | |
| 1717 | '-evalt', '0..100 /<<: NATURAL1', | |
| 1718 | '-evalt', '{x|x<20000} /<<: 0..10000', | |
| 1719 | '-evalt', 'NATURAL1 /<<: 0..10000', | |
| 1720 | ||
| 1721 | '-evalf', '0..B <: 1..B & B:1..1000000', | |
| 1722 | '-evalf', '0..x <: 1..1000 & x>0', | |
| 1723 | '-evalf', '0..B <<: 1..B & B:1..1000000', | |
| 1724 | '-evalf', '0..x <<: 1..1000 & x>0', | |
| 1725 | '-evalt', '{x,y} /<<: NATURAL1 & x:2..3 & y:0..5', | |
| 1726 | '-evalf', '{x,y} /<<: NATURAL1 & x:2..3 & y:1..5', | |
| 1727 | '-evalt', '{x,y} <<: NATURAL1 & x:2..3 & y:4..5', | |
| 1728 | '-evalf', '{x,y} <<: NATURAL1 & x:-22..-3 & y:-4..0', | |
| 1729 | '-evalt', '%(x,y).( x:1..4 & y : {-1, 0, 1} | x + y)[INTEGER*INTEGER] /\\ {x|x<=3} = 0..3', | |
| 1730 | '-evalt', '{x,z|x:1..z & x:z..3} = {(1|->1),(2|->2),(3|->3)}' % just a check about interval propagation | |
| 1731 | %, | |
| 1732 | %'-evalt', 'x /\\ y /= {} & x<:1..10000 & y<:10000..20000', | |
| 1733 | %'-evalt', 'x /\\ y /= {} & x = {y|y : 1..n & y mod 2 = 0} & y = {v|v:1..n & v mod 17 = 0} & n = 10000', | |
| 1734 | %'-evalt', '{x|NATURAL1 /\\ 0..x /= {} & x< 20} = 1..19' | |
| 1735 | ], 'Check constraint propagation of intersection with intervals'). | |
| 1736 | 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'). | |
| 1737 | cli_testcase(1168, [b_test,smt_test], ['-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', | |
| 1738 | '-evalt', '{y,f|f = %x.(x:1..10|x+y) & f(5)=1005} = {(1000|->[1001,1002,1003,1004,1005,1006,1007,1008,1009,1010])}' | |
| 1739 | ], 'Check constraint propagation for partially known functions'). | |
| 1740 | cli_testcase(1169, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', | |
| 1741 | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions', | |
| 1742 | '../prob_examples/public_examples/B/CBC/RULE_r967_1.mch', '-expcterr', 'cbc_assertions' | |
| 1743 | ], 'Check ProB finds counter example for rule'). | |
| 1744 | cli_testcase(1170, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', | |
| 1745 | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 1746 | '-expcterr', 'cbc_assertions_enumeration_warning', | |
| 1747 | '../prob_examples/public_examples/B/CBC/RULE_InSetLeavesXY_32_1.mch', | |
| 1748 | '../prob_examples/public_examples/B/CBC/RULE_r967_preuve_backward.mch' | |
| 1749 | ], 'Check ProB finds counter example for rule'). | |
| 1750 | cli_testcase(1171, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', | |
| 1751 | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 1752 | '-expcterr', 'cbc_assertions_enumeration_warning', | |
| 1753 | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_ShouldGenerateEnumWarning2.mch' | |
| 1754 | ], 'Check ProB finds no counter example for rule and no proof'). | |
| 1755 | cli_testcase(1172, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', | |
| 1756 | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 1757 | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_NoEnumWarning1.mch' | |
| 1758 | ], 'Check ProB finds no counter example for rule and no proof'). | |
| 1759 | ||
| 1760 | cli_testcase(1173, [b_test,cbc], ['-p', 'CLPFD', 'FALSE', | |
| 1761 | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 1762 | '-expcterr', 'cbc_assertions_enumeration_warning', | |
| 1763 | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_ShouldGenerateEnumWarning1.mch' | |
| 1764 | ], 'Check ProB finds no counter example for rule and no proof'). | |
| 1765 | cli_testcase(1174, [b_test,cbc], ['-p', 'CLPFD', 'TRUE', | |
| 1766 | '-p','MAX_INITIALISATIONS', 0, '-cbc_assertions_proof', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 1767 | '-expcterr', 'cbc_assertions_enumeration_warning', | |
| 1768 | '../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/DefSet_ShouldGenerateEnumWarning1.mch' | |
| 1769 | ], 'Check ProB finds no counter example for rule and no proof'). | |
| 1770 | cli_testcase(1175, [b_test,card], ['-p', 'CLPFD', 'TRUE', | |
| 1771 | '-evalf', 'n: INTEGER & {n} = r & r={n1} & (n1/=n)', | |
| 1772 | '-evalf', 'n: POW(INTEGER) & {n} = r & r={n1} & (n1/=n)', | |
| 1773 | '-evalf', 'n: BOOL & {n} = r & r={n1} & (n1/=n)', | |
| 1774 | '-evalf', 'n>0 & {n} ={n1} & (n1/=n)', | |
| 1775 | '-evalf', 'f:POW(NATURAL) & f2 = f \\/ {p2} & p1:f & p1/:f2 & p1/=p2', | |
| 1776 | '-evalf', 'f:POW(NATURAL) & f2 = f \\/ {p2} & p1:f & p1/:f2', | |
| 1777 | '-evalf', 'p1:dom(f) & f2 = {p2} <<| f & p1 /: dom(f2) & p1/=p2 & f:NATURAL <->NATURAL', | |
| 1778 | '-evalt', 'p1:dom(f) & f2 = {p2} <<| f & p1 /: dom(f2) & p1=p2 & f:NATURAL <->NATURAL', | |
| 1779 | '-evalf', 'x /= y & s={x,y,z} & x/=z & y/=z & x:NATURAL1 & card(s)<3', | |
| 1780 | '-evalf', 'x:s & y:s & z:s & x /= y & x/=z & y/=z & x:NATURAL1 & card(s)<3', | |
| 1781 | '-evalf', 'x /= y & x/=z & y/=z & s={x,y,z} & card(s)<3 & s<:STRING', | |
| 1782 | '-evalf', 'f:NATURAL +-> INTEGER & f2 = f <+ {p2|->1} & p1:dom(f) & p1/:dom(f2) & p1/=p2', | |
| 1783 | '-evalt', 'x /= "a" & (x /= "a" => y>1000000) & (y>1000000 => x = "b") & y<2000000', | |
| 1784 | '-evalt', 'x /= "a" & (x /= "a" => y>100000 & y<200000) & (y>100000 => x = "b")', | |
| 1785 | '-evalt', 'x /= "a" & ("a" /= x => y>100000 & y<200000) & (y>100000 => x = "b")', | |
| 1786 | '-evalt', 'x /= 33 & (x /= 33 => y>1000000) & (y>1000000 => x = 2133) & y<2000000', | |
| 1787 | '-evalt', 'x /= 1 & (1 /= x => y>100000 & y<200000) & (y>100000 => x = 2)', | |
| 1788 | '-evalf', 'x /= 1 & (1 /= x => y>100000 & y<200000) & (y>100000 => x = 1)' | |
| 1789 | ], 'Check that a few inconsistencies can be detected without enumeration'). | |
| 1790 | 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'). | |
| 1791 | 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'). | |
| 1792 | 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'). | |
| 1793 | 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'). | |
| 1794 | cli_testcase(1180, [b_test,card], ['-p', 'CLPFD', 'TRUE', | |
| 1795 | '-evalt', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..4} = 1..4', | |
| 1796 | '-evalt', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..40} = 1..40', | |
| 1797 | '-evalf', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..40} = 1..4', | |
| 1798 | '-evalf', '{x|#y.(y>x & (y mod 1000 = 0 or y<x+20)) & x:1..40} /= 1..40', | |
| 1799 | '-evalt', '{x|#y.(y>x) & x:1..100} /= {}', | |
| 1800 | '-evalf', '{x|#y.(y>x) & x:1..100} = {}', | |
| 1801 | '-evalt', 'card({x|#y.(y>x) & x:1..100}) = 100', | |
| 1802 | '-evalt', 'card({x,y| x>=60000 & x<=64999 & x mod 2 =1 & y=x+x}) = 2500', | |
| 1803 | '-evalt', 'card({x,y| x>=60000 & x<=64999 & x mod 2 =1 & y=x+x}) = 2500', | |
| 1804 | '-evalt', 'x = (1 .. 100000) - {4} & card(x) = 99999', | |
| 1805 | '-evalt', '{x| x:1..100 & {y|y:x..x+10} = {z|z>=x & z<x+11 & #v.(v>x)}} = 1..100', | |
| 1806 | '-evalt', '[0,0,0,0,0,0,0,0,0,1]:{x|x:seq(0..1) & 1:ran(x)}', | |
| 1807 | '-evalf', '[0,0,0,0,0,0,0,0,0,0]:{x|x:seq(0..1) & 1:ran(x)}', | |
| 1808 | '-evalt', '[0,0,1,1,0,1,0]:{x|x:seq(0..1) & card(x)>5}', | |
| 1809 | '-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}' | |
| 1810 | ],'Check enum warnings properly dealt with'). | |
| 1811 | cli_testcase(1181, [b_test,card], ['-p', 'CLPFD', 'TRUE', '-expcterr', 'eval_string', | |
| 1812 | '-evalt', '{x|x:seq(0..1) & card(x)>5} /= {x|x:seq(0..1) & card(x)>6}' | |
| 1813 | ],'Check enum warnings generated'). | |
| 1814 | 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'). | |
| 1815 | 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'). | |
| 1816 | 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).'). | |
| 1817 | 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)'). | |
| 1818 | cli_testcase(1186, [laws], ['../prob_examples/public_examples/EventBPrologPackages/Laws/finiteTest_ctx.eventb', | |
| 1819 | '-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'). | |
| 1820 | 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', | |
| 1821 | 'x:seq({1}) & 5:dom(x) & card(x)>6', '-p', 'DISPROVER_MODE', 'TRUE', % required to enable special card treatment | |
| 1822 | '-p', 'CLPFD', 'FALSE', '-strict' | |
| 1823 | %, '-expcterr', eval_string_enum_warning | |
| 1824 | ], 'Ensure proper enumeration of sequences (CLPFD=FALSE).'). | |
| 1825 | 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'). | |
| 1826 | cli_testcase(1189, [b_test,tickets,closure1], ['../prob_examples/public_examples/B/Tickets/Hansen7/ClosureTest2.mch', '-init', '-properties'], 'Check closure1 enumeration issue resolved'). | |
| 1827 | 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'). | |
| 1828 | 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.'). | |
| 1829 | 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'). | |
| 1830 | 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, | |
| 1831 | '-evalt', 'make_BIBIRec((TRUE,55),(FALSE,66)) = ((TRUE,55),(FALSE,66))'], 'Check that record detection works with nested records'). | |
| 1832 | cli_testcase(1194, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/platoon/platoon1_prob_simplified.eventb', '-t', '-strict', '-p', 'USE_RECORD_CONSTRUCTION', 'TRUE', '-p', 'MAX_OPERATIONS', 20, '-p', 'MAX_INITIALISATIONS', 40, '-expcterr', virtual_time_out, | |
| 1833 | '-evalt', 'sqrt(0)=0', | |
| 1834 | '-evalt', 'sqrt(10)=3', | |
| 1835 | '-evalt', 'sqrt(10000)=100', | |
| 1836 | '-evalt', 'dist(make(10|->20) |-> make(10|->20)) = 0', | |
| 1837 | '-evalt', 'dist(make(10|->20) |-> make(10|->30)) = 10', | |
| 1838 | '-evalt', 'dist(make(10|->20) |-> make(0|->20)) = 10', | |
| 1839 | '-evalt', 'dist(make(10|->20) |-> make(20|->20)) = 10', | |
| 1840 | '-evalt', 'dist(make(10|->10) |-> make(20|->20)) = 14', | |
| 1841 | '-evalt', 'dist(make(10|->10) |-> make(10010|->10010)) = 14142', | |
| 1842 | '-evalt', 'xcoord(make(1024,2048)) = 1024', | |
| 1843 | '-evalt', 'ycoord(make(1024,2048)) = 2048' | |
| 1844 | ], 'Check that record detection + symbolic treatment work'). | |
| 1845 | cli_testcase(1195, [performance_tests,b_test,codespeed], ['../prob_examples/public_examples/B/Mathematical/GraphIso/CheckLargeGraphIsomorphismAsConstants_v2.mch', | |
| 1846 | '-t', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '5000'], | |
| 1847 | 'Test constraint solving for larger graph'). | |
| 1848 | cli_testcase(1196, [b_test], ['../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.mch', '-t', '-strict', | |
| 1849 | '-csvhist', 'card(session) |-> card(session_response) |-> card(user_hotel_bookings) |-> user_rental_bookings', | |
| 1850 | '../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.csv'], | |
| 1851 | 'Test evaluating expression over history and saving to CSV file'). | |
| 1852 | cli_testcase(1197, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Tests/PartitionTest_ctx.eventb', '-init', '-assertions', '-strict'], 'Test partition border cases'). | |
| 1853 | cli_testcase(1198, [b_test,infinite,total_function], [ | |
| 1854 | '-evalt', '(NATURAL * NATURAL)* {1024} : (NATURAL*NATURAL) --> NATURAL', | |
| 1855 | '-evalt', 'NATURAL * {0} : NATURAL --> NATURAL', | |
| 1856 | '-evalt', 'NATURAL * {0} : NATURAL +-> NATURAL', | |
| 1857 | '-evalt', 'NATURAL1 * {0} : NATURAL +-> NATURAL', | |
| 1858 | '-evalt', 'NATURAL1 * {0} : INTEGER +-> NATURAL', | |
| 1859 | '-evalf', 'NATURAL * {0} : NATURAL --> NATURAL1', | |
| 1860 | '-evalf', 'NATURAL * {0} : NATURAL +-> NATURAL1', | |
| 1861 | '-evalf', 'NATURAL1 * {0} : NATURAL --> NATURAL', | |
| 1862 | '-evalf', 'NATURAL * {0} : NATURAL1 --> NATURAL' | |
| 1863 | ], 'Test cartesian product with singleton set recognised as total function'). | |
| 1864 | cli_testcase(1199, [eventb_test,tickets,infinite, theories], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_Symbolic/C_Cart_ctx.eventb', | |
| 1865 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_Symbolic/C_bijNAT_ctx.eventb', | |
| 1866 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_Symbolic/C_symbolic_ctx.eventb', | |
| 1867 | '../prob_examples/public_examples/EventBPrologPackages/Theory/ConstraintSolving_Demo_ctx.eventb', | |
| 1868 | '-init','-assertions', '-strict'], 'Checking that various infinite functions can be defined and checked'). | |
| 1869 | cli_testcase(1200, [b_test], ['../prob_examples/public_examples/B/Mathematical/MaxClique.mch', | |
| 1870 | '-init','-assertions', '-strict'], 'Checking constraint solving capabilities'). | |
| 1871 | cli_testcase(1201, [eventb_test, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/SeqTest2_ctx.eventb', '-init', '-assertions', '-strict'], 'Test Theory Plugin support'). | |
| 1872 | cli_testcase(1202, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_ModularExp/ExpModFunctionCtxt_ctx.eventb', | |
| 1873 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Kanso_ModularExp/ModularExponenation.mch', '-init', '-assertions', '-strict'], 'Test Recursive Function support'). | |
| 1874 | cli_testcase(1203, [b_test,queens], ['../prob_examples/public_examples/B/Puzzles/PeaceableQueens/JustQueens_8_8.mch', '-init', '-strict'], 'A constraint solving example'). | |
| 1875 | 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'). | |
| 1876 | 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'). | |
| 1877 | cli_testcase(1206, [tickets], ['../prob_examples/public_examples/B/Tickets/PROB-320/Hierarchical_temp.mch', '-t', | |
| 1878 | '-expcterr', 'precondition_error'], 'Check precondition error raised and error message generation works. (Ticket PROB-320)'). | |
| 1879 | cli_testcase(1207, [tickets], ['-p', 'TIME_OUT', 7000, '-p', 'CLPFD', 'TRUE', | |
| 1880 | '-evalf', '61*(x*x)+1 = y*y & x:1..1500000 & y>0'], 'Check that no instantiation error or other problem occurs'). | |
| 1881 | cli_testcase(1208, [typechecker_test,unit], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/including.mch', '-strict'], 'Typechecker test when including other machines'). | |
| 1882 | cli_testcase(1209, [typechecker_test,unit], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/definitions.mch', '-strict'], 'Typechecker test when using definitions'). | |
| 1883 | cli_testcase(1210, [typechecker_test,unit,parser,refinement], ['-typecheckertest','../prob_examples/public_examples/B/Typecheckertests/refi.ref', '-strict'], 'Typechecker test when using refinement'). | |
| 1884 | 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.'). | |
| 1885 | 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.'). | |
| 1886 | 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'). | |
| 1887 | cli_testcase(1214, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/OverridingBuiltinFunctions.csp', '-assertions', '-strict'], 'Testing if we can override built-in functions.'). | |
| 1888 | cli_testcase(1215, [csp_test], ['../prob_examples/public_examples/CSP/other/Ivo/OverridingBuiltinFunctionsLets.csp', '-assertions', '-strict'], 'Testing if we can override built-in functions.'). | |
| 1889 | cli_testcase(1216, [b_test,cbc,union,card], [ | |
| 1890 | '-evalt', 'z:10001..10002 & {x,y} \\/ t = {z}', | |
| 1891 | '-evalt', 'z:10001..10002 & {x} \\/ {y} = {z}', | |
| 1892 | '-evalf', 'z:10001..10002 & {x,y} \\/ t = {z} & y<10001', | |
| 1893 | '-evalf', 'z:10001..10002 & {x,y} \\/ t = {z} & t<:9000..10000 & t/= {}', | |
| 1894 | '-evalf', 'z:10001..10002 & {x,y} \\/ t = {z} & t:POW1(9000..10000)', | |
| 1895 | '-evalt', 'z:10001..10002 & {x} \\/ {y,v} = {z}', | |
| 1896 | '-evalt', 'z:10001..10002 & {x,v} \\/ {y} = {z}', | |
| 1897 | '-evalt', 'z:10001..10002 & {x,v} \\/ t = {z} & {a} \\/ {b} = t', | |
| 1898 | '-evalt', 'union({{x},{y},{z}}) = {3333}', % works by ast_cleanup translating to union | |
| 1899 | '-evalt', 'union({{x}}) = {3333}', % ditto | |
| 1900 | '-evalt', 'union({{x},{y},{z},{w}}) = {v} & v:200001..300001 & w:300001..400001', % ditto | |
| 1901 | '-evalt', 'union({S,V,W}) = 1..10 & S/\\V = {} & S/\\W ={} & V /\\ W = {} & card(S) < card(V) & card(V) < card(W)' % ditto + partition detection | |
| 1902 | % TO DO: z:10001..10002 & {x,w} \\/ {y,v} = {z} | |
| 1903 | ], 'Testing propagation in union from result to arguments.'). | |
| 1904 | cli_testcase(1217, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Disprover/ProofTests/TestPrj_Nat_ctx.eventb', '-cbc_assertions', | |
| 1905 | '-p', 'PROOF_INFO', 'FALSE', '-strict'], 'Testing if prj1|->prj2 theorems can be proven'). | |
| 1906 | cli_testcase(1218, [b_test,sequences], [ | |
| 1907 | '-evalf', 'p:perm(5..20) & p(10)=21' | |
| 1908 | ], 'Testing propagation for permutation sequence.'). | |
| 1909 | cli_testcase(1219, [puzzles_test,queens], ['-p', 'CLPFD', 'TRUE', '../prob_examples/public_examples/B/Puzzles/NQueens40_perm.mch', '-init', '-properties', '-strict'], ''). | |
| 1910 | 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'], ''). | |
| 1911 | 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'). | |
| 1912 | cli_testcase(1222, [private], ['-p', 'CLPFD', 'TRUE', '../prob_examples/examples/B/ClearSy/alloc_large.mch', '-init', '-p', 'TIME_OUT', '18500'], | |
| 1913 | 'Test that ProB finds isomorphism for large graph'). % increased time out from 9500 | |
| 1914 | cli_testcase(1223, [b_test,card], [ | |
| 1915 | '-evalf', 'z:11..10002 & z2:10003..520004 & z3: -1000..10 & z4:-22222..-2000 &a: {z,z2} & a:{z3,z4}', | |
| 1916 | '-evalt', 'z:11..10002 & z2:10003..520004 & z3: -1000..11 & z4:-22222..-2000 &a: {z2,z} & a:{z3,z4}', | |
| 1917 | '-evalf', 'x <: 1..7 & y <: 1..7 & (x<:y <=> y<:x) & x/\\y = {3} & x\\/y = 1..7 & card(x) = card(y)+1', | |
| 1918 | '-evalt', 'y:1..1000001 & f:100001..100005 --> 1..9000 & x:dom(f) & x:2..100003 & (x>5000 => y:100001..100002)', | |
| 1919 | '-evalf', 'f: 1..10 --> 100..200 & x:dom(f~) & x>200', | |
| 1920 | '-evalf', 'f: 10..200 --> 1..200000 & x|->y : f & (x>200 or x<10)', | |
| 1921 | '-evalf', 'f: (BOOL*BOOL) --> 100..200000 & b|->x : f & (x>200000 or x<100)', | |
| 1922 | '-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))', | |
| 1923 | '-evalt', 'f : 1001..2001 --> 1900..3333 & x|->y : f & y<x', | |
| 1924 | '-evalf', 'f : 1001..2001 --> 1900..3333 & x|->y : f & y+101<x', | |
| 1925 | '-evalf', 'x:1..400 & y:1..400 & f: 2..390 --> 391..399 & x|->y :f & y|->x :f', | |
| 1926 | '-evalt', 'r: 1001..1005 <-> 1000..1099 & x|->y : r & v|->w : r & x+y = v+w+103 & card(r) = 3', | |
| 1927 | '-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', | |
| 1928 | '-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)}', | |
| 1929 | '-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', | |
| 1930 | '-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', | |
| 1931 | '-evalt', 's = {(1,rec(a:1)), (2,rec(a:2))} & (1,rec(a:x)) : s', | |
| 1932 | '-evalt', 'a = {rec(x:1,y:22),rec(x:2,y:44)} & {v,w|rec(x:v,y:w):a} = {(1,22),(2,44)}', | |
| 1933 | '-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)}', | |
| 1934 | '-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', | |
| 1935 | '-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', | |
| 1936 | '-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', | |
| 1937 | '-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', | |
| 1938 | '-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' | |
| 1939 | ], 'Testing propagation for membership.'). | |
| 1940 | 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.'). | |
| 1941 | cli_testcase(1225, [eventb_test,laws, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListLaws_ctx.eventb', | |
| 1942 | '../prob_examples/public_examples/EventBPrologPackages/Theory/PairLaws_ctx.eventb', | |
| 1943 | '-assertions','-strict'], 'Various checks for sets involving freetypes (Lists Theory)'). | |
| 1944 | cli_testcase(1226, [b_test,finite], [ | |
| 1945 | '-evalu', 's=({x|x mod 2 = 0 & x>200}) & s:FIN(s)' | |
| 1946 | , '-expcterr', eval_string_enum_warning | |
| 1947 | ], 'Check that finite warning produced'). | |
| 1948 | cli_testcase(1227, [eventb_test,laws, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListLawsMC_mch.eventb','-mc',500, '-bf', '-strict', | |
| 1949 | '-expcterr', 'virtual_time_out', '-expcterr', 'model_check_incomplete'], 'Various checks for sets involving freetypes (Lists Theory)'). | |
| 1950 | cli_testcase(1228, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/MammarLaleau_Failures_ReadDoors_inv8_selected.mch', '-cbc_assertions', | |
| 1951 | '-p', 'PROOF_INFO', 'FALSE', '-strict'], 'Check no enum warning occurs when using bool with integer inside'). | |
| 1952 | cli_testcase(1229, [eventb_test], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/PROB-322/ExpressionTest.eventb','-init','-strict'], 'Checking usage of typeof-Operator'). | |
| 1953 | cli_testcase(1230, [cbc], ['../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/MammarLaleau_Cylinders_LockGearCylinder_inv4_selected.mch', | |
| 1954 | %'../prob_examples/public_examples/EventBPrologPackages/Disprover/EnumWarningTests/MammarLaleau_Doors_Make_GearExtended_inv2_all.mch', | |
| 1955 | '-cbc_assertions', | |
| 1956 | '-p', 'PROOF_INFO', 'FALSE' ,'-p', 'DISPROVER_MODE', 'TRUE', '-strict'], 'Check no time-out occurs'). | |
| 1957 | cli_testcase(1231, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/TestingFairness.mch', '-ltlassertions', '-strict'], 'Test fairness implementation.'). | |
| 1958 | cli_testcase(1232, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/MutualExclusion.mch', '-ltlassertions', '-strict'], 'Test fairness implementation.'). | |
| 1959 | cli_testcase(1233, [b_test,fairness,ltl], ['../prob_examples/public_examples/B/LTL/Fairness/WeakFairnessTest.mch', '-ltlassertions', '-strict'], 'Test fairness implementation.'). | |
| 1960 | cli_testcase(1234, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/phils.csp', '-ltlassertions', '-strict'], 'Test fairness implementation.'). | |
| 1961 | cli_testcase(1235, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/FairnessUnderscoreArgs.csp', '-ltlassertions', '-strict'], 'Test fairness.'). | |
| 1962 | 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.'). | |
| 1963 | 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.'). | |
| 1964 | 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.'). | |
| 1965 | 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.'). | |
| 1966 | 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.'). | |
| 1967 | 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.'). | |
| 1968 | cli_testcase(1242, [csp_test,fairness,ltl], ['../prob_examples/public_examples/CSP/LTL/rabp_scc_issue.csp', '-ltlassertions', '-strict'], 'Test fairness.'). | |
| 1969 | 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.'). | |
| 1970 | cli_testcase(1244, [b_test, ltl], ['../prob_examples/public_examples/B/LTL/Fairness/TestingFairness.mch', | |
| 1971 | '-ltlformulat', true, '-ltlformulat', 'G{1=1}', | |
| 1972 | '-ctlformulat', 'AG{1=1}', '-ctlformulaf', 'EF{1=2}', | |
| 1973 | %'-ltlformulaf', false, % does not work ! | |
| 1974 | '-ltlformulaf', 'G{1=2}', '-strict'], 'Testing the trivial LTL formula true + other trivial ones.'). | |
| 1975 | 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."). | |
| 1976 | cli_testcase(1246, [cbc], [ | |
| 1977 | '-evalf', 'x/0 = 1 & x:1..20', | |
| 1978 | '-evalf', 'x:-2..2 & 10/x =1', | |
| 1979 | '-evalt', 'x:-2..2 & 10/x = 5', | |
| 1980 | '-p', 'DISPROVER_MODE', 'TRUE'], 'Testing no WD error generated in disprover mode.'). | |
| 1981 | cli_testcase(1247, [cbc], [ | |
| 1982 | '-evalt', 'i>200 & (i mod 37 = 7)', | |
| 1983 | '-evalt', 'i>200 & (i mod 37 = 1)', | |
| 1984 | '-evalt', 'i>20 & (i mod 2 = 0)', | |
| 1985 | '-evalf', 'i>200 & (i mod 37 = 7) & i < 229', | |
| 1986 | '-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}', | |
| 1987 | '-evalt', '{i|i>200 & (i mod 50 = 10) & i<1000 & i mod 100 /= 10} = {260,360,460,560,660,760,860,960}', | |
| 1988 | '-evalt', 'x > 0 & x mod 30 =0 & x mod 19 = 0', | |
| 1989 | '-evalt', 'x > 0 & x mod 50 =0 & x mod 61 = 0 & x mod 23 = 0', | |
| 1990 | '-evalf', 'x > 0 & x mod 50 =0 & x mod 61 = 0 & x mod 23 = 0 & x<70150' | |
| 1991 | ], 'Testing improved constraint propagation for modulo.'). | |
| 1992 | cli_testcase(1248, [tickets], ['../prob_examples/public_examples/B/Tickets/Disprover_InstantiationError/GraphColour_PO.mch', '-init', '-p', 'TIME_OUT', 300, '-p', 'DISPROVER_MODE', 'TRUE', | |
| 1993 | '-expcterr', setup_constants_fails, '-expcterr', time_out, '-strict'], 'Check that no instantiation error occurs'). | |
| 1994 | cli_testcase(1249, [cbc,slot], ['../prob_examples/public_examples/B/PerformanceTests/SlotToolSolver_Inconsistency.mch', | |
| 1995 | '-init', '-p', 'TIME_OUT', 2500, '-expcterr', setup_constants_fails, '-strict' | |
| 1996 | %,'-expcterr', no_det_value_stored_for_constant % changed from warning to message 18/02/2018 | |
| 1997 | ], 'Check that inconsistency detected quickly'). | |
| 1998 | cli_testcase(1250, [cbc], [ | |
| 1999 | '-evalf', 'f:0..100 --> POW(1..100) & f(20) = {99} & !x.(x:dom(f) => !y.(y:f(x) => y /= 99))', | |
| 2000 | '-evalt', 'f:0..100 --> POW(1..100) & f(20) = {98} & !x.(x:dom(f) => !y.(y:f(x) => y /= 99))', | |
| 2001 | '-evalf', 'f:0..100 --> POW(1..100) & f(20) = {99} & !x.(x:dom(f) => !y.(y:f(x) & y>20 => y /= 99))' | |
| 2002 | ], 'Check universal quantification inconsistency detected'). | |
| 2003 | cli_testcase(1251, [cbc], ['../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'). | |
| 2004 | 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, '-expcterr', time_out, '-expcterr', well_definedness_error, '-strict'], 'Check that division by zero detected.'). | |
| 2005 | cli_testcase(1253, [tickets,union], ['../prob_examples/public_examples/B/Tickets/LambdaUnionEnumWarning/Seq1UnionFunction.mch', | |
| 2006 | '-init', '-assertions', '-strict'], 'Check that symbolic function not expanded in rel. composition'). | |
| 2007 | cli_testcase(1254, [cbc, tickets, chr], ['-p', 'CHR', 'TRUE', | |
| 2008 | '-evalf', 'x> a & x: 33..a', | |
| 2009 | '-evalt', 'x>=a & x>=33 & x<=a', | |
| 2010 | '-evalf', 'x>a & x>=33 & x<=a' | |
| 2011 | ], 'Check CHR detects inconsistencies'). | |
| 2012 | cli_testcase(1255, [cbc], ['-p', 'DISPROVER_MODE', 'TRUE', | |
| 2013 | '-evalf', 'z>0 & z mod z = 100 & x:{1,2,3} & not(x>0)'], 'Check no enum warning'). | |
| 2014 | cli_testcase(1256, [tickets,card], [ | |
| 2015 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Cansell_RingLead/ring_ctx.eventb', | |
| 2016 | '-init'], 'Check no infinite loop when computing minimum cardinality'). | |
| 2017 | 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).'). | |
| 2018 | 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.'). | |
| 2019 | 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).'). | |
| 2020 | cli_testcase(1260, [b_test],['../prob_examples/public_examples/B/NewSyntax/FreetypeIntList.mch','-p','MAXINT',10,'-t','-strict'],'Check rudimental freetype functionally'). | |
| 2021 | cli_testcase(1261, [cbc], [ | |
| 2022 | '-evalt', '(x:{y|y:NATURAL & y mod 100 = 1} <=> v=0) & v=0 & x>1' | |
| 2023 | ], 'Test reification of closures'). | |
| 2024 | 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'). | |
| 2025 | 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'). | |
| 2026 | cli_testcase(1264, [b_test,infinite], ['../prob_examples/public_examples/B/Mathematical/FormaleSprachen.mch', | |
| 2027 | '-init','-assertions', '-strict'], 'Checking various operations work on infinite sets (e.g., complement set).'). | |
| 2028 | cli_testcase(1265, [tickets,card], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/MinCardInference/RegularGrammar_Ex1_ctx.eventb', '-init', | |
| 2029 | '-evalt', 'card(Symbols)=4', | |
| 2030 | '-evalt', 'card(NonTerminals)=2', | |
| 2031 | '-evalt', 'card(Terminals)=2'], 'Check that minimum cardinality inference works'). | |
| 2032 | cli_testcase(1266, [b_test],['../prob_examples/public_examples/B/Tickets/Hansen9/SimpleCSGGrammar2_SlowCLPFD.mch','-t','-strict','-p','CLPFD','TRUE'],'Check no time-out'). | |
| 2033 | cli_testcase(1267, [cbc,sequences], [ | |
| 2034 | '-evalt', '{n|[11,22,3,4,5,6,7] /|\\ n = [11,22]} = {2}' | |
| 2035 | , '-evalt', '{l|[2222]^l /|\\ 7 = l} = {[2222,2222,2222,2222,2222,2222,2222]}' | |
| 2036 | , '-evalt', '{x,n|[1111,x,33,44] /|\\ n = [1111,2222] & n:0..4} = {(2222,2)}' | |
| 2037 | , '-evalt', '{x,y,n|[1111,x,3333,4444,y,y] /|\\ n = [1111,2222,3333,4444,5555] & n:0..6} = {((2222|->5555)|->5)}' | |
| 2038 | %,'-evalt', '{n,x,y|[11,22,3,4,5,6,7] /|\ n = [x,y]} = {((2|->11)|->22)}' % does not work yet TO DO | |
| 2039 | ], | |
| 2040 | 'test sequence constraint solving'). | |
| 2041 | 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.'). | |
| 2042 | cli_testcase(1269, [tickets,card], [ | |
| 2043 | '-evalt', 'm={{1,2},{1,3}} & {k1,k2|k1:m & 1:k1 & k2:m & 1:k2 & k1/=k2} =r & card(r)=2', | |
| 2044 | '-evalt', 'm={{1,2},{1,3},{2,3}} & {k1,k2|k1:m & 1:k1 & k2:m & 1:k2 & k1/=k2} =r & card(r)=2', | |
| 2045 | '-evalt', 'm={{1,2},{1,3}} & {k1,k2|k1:m & 1:k1 & k2:m-{k1} & 1:k2} =r & card(r)=2', | |
| 2046 | '-evalt', 'm={{1,2},{1,3},{2,3}} & {k1,k2|k1:m & 1:k1 & k2:m-{k1} & 1:k2} =r & card(r)=2' | |
| 2047 | ], 'ensure bug in not_equal_object for sets remains fixed'). | |
| 2048 | cli_testcase(1270, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsPow2.mch', '-mc', '200', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'More laws about sets of sets'). | |
| 2049 | 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'). | |
| 2050 | cli_testcase(1272, [cbc,card], [ | |
| 2051 | '-evalf', 'card({x|x:1..10 & x*x<i}) = 0 & i>1', | |
| 2052 | '-evalt', 'card({x|x>1 & x<2**e & x mod 2 = 0}) = 0', | |
| 2053 | '-evalt', 'card({b|b:1..8 & b mod n = 1})=c & n:2..4', | |
| 2054 | '-evalt', 'f: 1..n --> 0..1000 & f(1)=0 & card({i|i:1..n & f(i)>0}) = n/2 & n=100', | |
| 2055 | '-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))', | |
| 2056 | '-evalt', 'n=100 & f:1..n --> BOOL & card({x|x:dom(f) & f(x)=TRUE})=50' | |
| 2057 | ], 'ensure proper reification of card'). | |
| 2058 | cli_testcase(1273, [cbc,card], [ | |
| 2059 | '-evalf', '{10,22} <: {x|x>10 & x mod 2 = 0}', | |
| 2060 | '-evalt', '{100,22} <: {x|x>10 & x mod 2 = 0}', | |
| 2061 | '-evalf', '{11,22} <: {x|x>10 & x mod 2 = 0}', | |
| 2062 | '-evalt', 'card({S|S <<: 12..15 & (12:S => 15:S & 14 /:S) & (13:S <=> 12:S) & S/={}})=4', | |
| 2063 | '-evalt', 'card({S|S <<: 12..14 & (12:S => 15:S & 14 /:S) & (13:S <=> 12:S) & S/={}}) =1', | |
| 2064 | '-evalt', 'card({S|S <<: 12..19 & (12:S => 15:S & 14 /:S) & (13:S <=> 12:S) & S/={}})=79', | |
| 2065 | '-evalt', 'card({S|S <<: 11..18 & (12:S => 15:S & 14 /:S) & (15:S <=> 12:S) & S/={}})=95', | |
| 2066 | '-evalt', 'card({S|S <: 11..18 & (12:S => 15:S & 14 /:S) & (15:S <=> 12:S) & S/={}})=95', | |
| 2067 | '-evalt', 'card({S|S <: 12..15 & (12:S => 15:S) & 14 /:S }) = 6', | |
| 2068 | '-evalt', 'card({S|S <<: 12..15 & (12:S => 15:S) & 14 /:S }) = 6', | |
| 2069 | '-evalt', '({S|S <: 12..15 & (12:S => 15:S) & 14 /:S }) = {{},{12,15},{13},{12,13,15},{13,15},{15}}' | |
| 2070 | ], 'ensure no expansion in subset and proper computation of all solutions'). | |
| 2071 | cli_testcase(1274, [tickets],['../prob_examples/public_examples/B/Tickets/Hansen11/RecNatFunLoop.mch', '-init', '-assertions', '-strict', '-vv'],'Check no infinite recursion'). | |
| 2072 | 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'). | |
| 2073 | cli_testcase(1276, [tickets,cbc],['../prob_examples/public_examples/B/Compilers/LLParsing.mch', '-t', '-strict'],'Check no enumeration warning due to existential quantifiers'). | |
| 2074 | 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'). | |
| 2075 | 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'). | |
| 2076 | 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'). | |
| 2077 | 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'). | |
| 2078 | 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'). | |
| 2079 | cli_testcase(1282, [tickets,let,card],['../prob_examples/public_examples/B/Tickets/PROB-333/M1.mch', '-init', '-strict' | |
| 2080 | , '-evalt', '#(b).(b:NAT)' | |
| 2081 | , '-evalt', '#(a).(a:NAT)' | |
| 2082 | , '-evalt', '!(a).(a:ID => card(ID-{a}) = 1)' | |
| 2083 | , '-evalt', '!(ab).(ab:ID => card(ID-{ab}) = 1)' | |
| 2084 | , '-evalt', ' #aa.(not(myTRUE))' | |
| 2085 | , '-evalt', '{aa|myTRUE} = {aa}' | |
| 2086 | ],'Assignment to variables introduced by LET are not allowed'). | |
| 2087 | cli_testcase(1283, [b_test,wd], ['../prob_examples/public_examples/B/ErrorMachines/NestedFunUpdate_Error.mch', '-nodead', '-mc', 10, '-strict', | |
| 2088 | '-expcterr', 'well_definedness_error'], 'Ensure we find error in assignment.'). | |
| 2089 | cli_testcase(1284, [eventb_test,tickets], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/SlowLambdaFunctions/TestParIf2_v2_mch.eventb', | |
| 2090 | '-p', 'MAX_OPERATIONS', 40, | |
| 2091 | '-p', 'TIME_OUT', 1000, | |
| 2092 | '-mc', 1000, '-expcterr', 'model_check_incomplete', '-cc', 193, 4369, | |
| 2093 | '-strict'], 'Ensure performance acceptable for nested function applications.'). | |
| 2094 | cli_testcase(1285, [cbc], ['../prob_examples/public_examples/B/Tickets/PartialFunCBCPerformance/Prove_simpler_ctx.eventb', | |
| 2095 | '../prob_examples/public_examples/B/Tickets/PartialFunCBCPerformance/ProveCommutativityAxioms_ctx.eventb', | |
| 2096 | '-p', 'TIME_OUT', 1000, '-p', 'MAX_INITIALISATIONS', 90, | |
| 2097 | '-init', '-mc', 1000, '-nodead', '-strict' | |
| 2098 | ], 'Ensure we find solution to initalisation.'). | |
| 2099 | 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.'). | |
| 2100 | cli_testcase(1287, [eventb_test, theories],['../prob_examples/public_examples/EventBPrologPackages/Theory/RecursiveSetFunctions_ctx.eventb','-assertions', '-init', '-strict', | |
| 2101 | '-evalt', 'sumset(1..1000) = 500500'], 'Test that recursive functions with COND work and that we can use Theory operators in evalt.'). | |
| 2102 | 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', | |
| 2103 | '-p', 'CLPFD', 'TRUE', '-p', 'SMT', 'TRUE', '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'TIME_OUT', 100, | |
| 2104 | '-expcterr', cbc_assertions_time_out, | |
| 2105 | '-cbc_assertions','-strict'], 'Test Siemens Proof Rule.'). | |
| 2106 | cli_testcase(1289, [tickets,records],['../prob_examples/public_examples/B/Tickets/Hansen12/RecordCallResidue.mch', '-init', '-assertions', '-strict'],'Check no call residue for records.'). | |
| 2107 | 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.'). | |
| 2108 | cli_testcase(1291, [tickets,infinite,override],['../prob_examples/public_examples/B/Tickets/Hansen13/OverrideSymbolicTest.mch', '-t', '-strict'],'Check override substitution works symbolically.'). | |
| 2109 | cli_testcase(1292, [b_test,case],['../prob_examples/examples/B/Satpathy/Teletext104/Teletext104_deterministic.mch', '-t', '-strict'],'Check this relatively large machine works.'). | |
| 2110 | cli_testcase(1293, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test1.tla', '-mc', 100, '-strict'], 'TLC regression test: equality.'). | |
| 2111 | cli_testcase(1294, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test2.tla', '-mc', 100, '-strict'], 'TLC regression test: functions.'). | |
| 2112 | %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 | |
| 2113 | cli_testcase(1296, [b_test,tla],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test4.tla', '-mc', 100, '-strict'], 'TLC regression test: sets.'). | |
| 2114 | 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.'). | |
| 2115 | 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.'). | |
| 2116 | cli_testcase(1299, [b_test,tla,choose],['../prob_examples/public_examples/TLA/Tests/TLC_Regression_Tests/test7.tla', '-mc', 100, '-strict'], 'TLC regression test: Choose operator.'). | |
| 2117 | cli_testcase(1300, [cbc], [ | |
| 2118 | '-evalf', '[1,2,3,3,3,4] : seq({1, 2, 3}) - seq({1, 2})', | |
| 2119 | '-evalt', '[1,2,3,3,3,4] /: seq({1, 2, 3}) - seq({1, 2})', | |
| 2120 | '-evalf', '[1,2,2,2,2,1] : seq({1, 2, 3}) - seq({1, 2})', | |
| 2121 | '-evalt', '[1,2,2,2,2,1] /: seq({1, 2, 3}) - seq({1, 2})', | |
| 2122 | '-evalt', '[1,2,3,3,3,2] : seq({1, 2, 3}) - seq({1, 2})', | |
| 2123 | '-evalf', '[1,2,3,3,3,2] /: seq({1, 2, 3}) - seq({1, 2})', | |
| 2124 | '-evalt', '[1,2,2,2,2,1,v] : seq({1, 2, 3}) - seq({1, 2}) & v>1', | |
| 2125 | '-evalt', '{x | x : NATURAL - {x|x>10}} = 0..10', | |
| 2126 | '-evalt', '{x | x : NATURAL - NATURAL1} = 0..0', | |
| 2127 | '-evalt', 'x /: NATURAL - {x|x>10} & x>0 & x<100', | |
| 2128 | '-evalt', '11..99 = {x|x /: NATURAL - {x|x>10} & x>0 & x<100}', | |
| 2129 | '-evalt', 'x : NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', | |
| 2130 | '-evalt', 'x /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', | |
| 2131 | '-evalt', '-11 /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', | |
| 2132 | '-evalt', '1024 : NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', | |
| 2133 | '-evalf', '1024 /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', | |
| 2134 | '-evalt', '1025 /: NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', | |
| 2135 | '-evalf', '1025 : NATURAL1 /\\ {x|x>20 & x mod 2 = 0}', | |
| 2136 | '-evalt', '[1,2] : seq({1, 2, 3}) /\\ seq({0, 1, 2})', | |
| 2137 | '-evalt', '[1,2,3] /: seq({1, 2, 3}) /\\ seq({0, 1, 2})', | |
| 2138 | '-evalt', '[1,2,3,4] /: seq({1, 2, 3}) /\\ seq({0, 1, 2})', | |
| 2139 | '-evalt', '[1,2,2,2,1,2] : seq({1, 2, 3}) /\\ seq({0, 1, 2})', | |
| 2140 | '-evalt', 'seq({1, 2, 3}) /\\ seq({0, 1, 2}) = sq & [1,2,2,2,1] : sq', | |
| 2141 | '-evalt', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2] : sq', | |
| 2142 | '-evalf', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2] /: sq', | |
| 2143 | '-evalt', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2,0] /: sq', | |
| 2144 | '-evalf', 'seq({1, 2, 3}) \\/ seq({0, 1, 2}) = sq & [1,2,3,3,2,0] : sq', | |
| 2145 | '-evalt', '{200,201,301,400} - {x|x>0 & x mod 100 = 0} = {201,301}', | |
| 2146 | '-evalt', '{200,201,301,400} /\\ {x|x>0 & x mod 100 = 0} = {200,400}', | |
| 2147 | '-evalt', '500 : ( {x|x>0 & x mod 100 = 0} - {200,400})', | |
| 2148 | '-evalt', '400 /: ( {x|x>0 & x mod 100 = 0} - {200,400})', | |
| 2149 | '-evalf', '400 : ( {x|x>0 & x mod 100 = 0} - {200,400})', | |
| 2150 | '-evalt', 'abs = id(NATURAL) \\/ %x.(x<0|-x) & abs(2001)=2001 & abs(-2002)=2002', % added 23.3.2015 | |
| 2151 | '-evalt', 'f = id(NATURAL) /\\ %x.(x<100|-x) & f={0|->0}', % added 23.3.2015 | |
| 2152 | '-evalt', 'abs = %x.(x<0|-x) \\/ id(NATURAL) & abs(2001)=2001 & abs(-2002)=2002', % added 23.3.2015 | |
| 2153 | '-evalt', '0: NATURAL - {1} - {2}', % added 14.5.2018 | |
| 2154 | '-evalt', '3: NATURAL - {1} - {2}', % added 14.5.2018 | |
| 2155 | '-evalf', '1: NATURAL - {1} - {2}', % added 14.5.2018 | |
| 2156 | '-evalf', '2: NATURAL - {1} - {2}', % added 14.5.2018 | |
| 2157 | '-evalt', '33: NATURAL - {1} - {2}', % added 14.5.2018 | |
| 2158 | '-evalf', '0: NATURAL1 - {11} - {22}', % added 14.5.2018 | |
| 2159 | '-evalf', '11: NATURAL1 - {11} - {22}', % added 14.5.2018 | |
| 2160 | '-evalf', '22: NATURAL1 - {11} - {22}', % added 14.5.2018 | |
| 2161 | '-evalt', '1: NATURAL1 - {11} - {22}', % added 14.5.2018 | |
| 2162 | '-evalt', '23: NATURAL1 - {11} - {22}', % added 14.5.2018 | |
| 2163 | '-evalf', '{} = NATURAL1 - {11} - {22}' % added 14.5.2018 | |
| 2164 | ], 'ensure symbolic treatment of set difference and intersection membership'). | |
| 2165 | cli_testcase(1301, [tickets,infinite,strings,card], [ | |
| 2166 | '-evalt', 'NATURAL1 /: {NATURAL,INTEGER,NATURAL,1..2,{}}', | |
| 2167 | '-evalf', 'NATURAL1 : {NATURAL,INTEGER,NATURAL,1..2,{}}', | |
| 2168 | '-evalt', 'NATURAL1 : {NATURAL,INTEGER,NATURAL1,1..2,{}}', | |
| 2169 | '-evalt', '1..2 : {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', | |
| 2170 | '-evalt', '{} : {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', | |
| 2171 | '-evalt', '{NATURAL} <: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', | |
| 2172 | '-evalt', '{NATURAL} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', | |
| 2173 | '-evalt', '{NATURAL,{},INTEGER} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', | |
| 2174 | '-evalt', '{NATURAL,{},INTEGER,{1,2}} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', | |
| 2175 | '-evalf', '{NATURAL,{},INTEGER,{1,3}} <<: {NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}}', | |
| 2176 | '-evalt', '7=card({NATURAL,INTEGER,NATURAL1,1..2,{},1..3,{2}})', | |
| 2177 | '-evalt', '5=card({NATURAL1,INTEGER,NATURAL1,1..2,{},1..3,{1,2}})', | |
| 2178 | '-evalt', '{NATURAL1,INTEGER,x} = r & {}:r', | |
| 2179 | '-evalt', '{STRING,{},{"hallo"}} = s & card(s)=3 & {}:s & STRING:s', | |
| 2180 | '-evalt', 'r = { {1..2},{NATURAL}, {INTEGER}, {{}}, {NATURAL1}, {NATURAL1,NATURAL} } & {x} : r & x=NATURAL', | |
| 2181 | '-evalt', 'r = { {1..2},{NATURAL}, {INTEGER}, {{}}, {NATURAL1}, {NATURAL1,NATURAL} } & {x,y} : r & x=NATURAL & y=NATURAL1', | |
| 2182 | '-evalf', 'r = { {1..2},{NATURAL}, {INTEGER}, {{}}, {NATURAL1}, {NATURAL1,INTEGER} } & {x,y} : r & x=NATURAL & y=NATURAL1', | |
| 2183 | '-evalt', '{x|x>10 & x*x = 100} : {NATURAL,{},1..3,{2},INTEGER}', | |
| 2184 | '-evalt', '{x|x>4 & x*x = 100} : {NATURAL,{},1..3,{10},INTEGER}', | |
| 2185 | '-evalt', '{3,2,1} : {NATURAL1,{},1..3,{2},INTEGER}' | |
| 2186 | ], 'test putting infinite global sets into AVL sets'). | |
| 2187 | 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'). | |
| 2188 | cli_testcase(1303,[private,data_validation,alstom],['../prob_examples/examples/B/Alstom/Ticket_July2_2014/Rule_DB_SIGAREA_0030.mch','-strict', '-t', '-pref_group', integer, int32, '-p', 'TIME_OUT', 15000, '-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)'). | |
| 2189 | cli_testcase(1304, [eventb_test,laws, theories], ['../prob_examples/public_examples/EventBPrologPackages/Theory/ListLawsMC_inf_mch.eventb','-t', '-strict', | |
| 2190 | '-expcterr', 'virtual_time_out'], 'Various checks for sets involving freetypes (Lists Theory; PROB-325) that no wd-error occurs'). | |
| 2191 | 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'). | |
| 2192 | 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'). | |
| 2193 | cli_testcase(1307,[private,b_test,alstom],['../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'). | |
| 2194 | cli_testcase(1308, [b_test,kodkod,'PROB-331'], ['../prob_examples/public_examples/B/Tickets/PROB-331/HadamardMatrixRel_ForKodkod.mch', '-init', '-strict', '-p','TIME_OUT',3000, '-p', 'KODKOD', 'TRUE', '-p', 'KODKOD_ONLY_FULL', 'FALSE'], 'Check that Kodkod finds solution.'). | |
| 2195 | 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'). | |
| 2196 | cli_testcase(1310, [tickets,'PROB-335'], [ | |
| 2197 | '../prob_examples/public_examples/B/Tickets/PROB-335/RecordDetectionBugSimple.mch', % used to generate a virtual time-out (fixed July 13th 2014) | |
| 2198 | '../prob_examples/public_examples/B/Tickets/PROB-335/ExtremaFinding.mch', '-mc', 100, '-p', 'MAX_INITIALISATIONS', 20, '-nodead', | |
| 2199 | '-init', '-assertions', '-strict'], 'Check that Record Detection does not mess up.'). | |
| 2200 | 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'). | |
| 2201 | 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 !! | |
| 2202 | cli_testcase(1313, [tickets,'PROB-346',infinite], | |
| 2203 | ['-evalt', 'x=prj1(INTEGER,INTEGER) & y=prj1(INTEGER,INTEGER) & x=y', | |
| 2204 | '-evalt', 'x=prj1(INTEGER,POW(NATURAL*INTEGER)) & y=prj1(INTEGER,POW(NATURAL*INTEGER)) & x=y', | |
| 2205 | '-evalt', 'prj1(NATURAL1,NATURAL1)(222,333)=222', | |
| 2206 | '-evalt', 'prj2(NATURAL1,NATURAL1)(222,333)=333', | |
| 2207 | '-evalt', 'dom(prj1(NATURAL,NATURAL1)) = NATURAL*NATURAL1', | |
| 2208 | '-evalt', 'dom(prj2(NATURAL1,NATURAL1)) = NATURAL1*NATURAL1' | |
| 2209 | ], 'Check that no infinite expansion occurs when comparing two prj1 functions + other prj1/prj2 tests'). | |
| 2210 | cli_testcase(1314, [cbc,card], [ | |
| 2211 | '-evalt', ' s = [x,y,z] & rev(s) = {1|->v,v|->w,w|->v} & v>w', | |
| 2212 | '-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)}', | |
| 2213 | '-evalt', 'rev({x|->y}) = {v|->w} & w:NATURAL', | |
| 2214 | '-evalt', 'card({s,x,y,z,v,w|s = [x,y,z] & rev(s) = {1|->v,v|->w,w|->v} }) = 2', | |
| 2215 | '-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)}', | |
| 2216 | '-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)}', | |
| 2217 | '-evalt' , '{v,w,x,y|{1|->v,v|->w,w|->v} = [x,y,x]} = {(((2|->3)|->2)|->3)}', | |
| 2218 | '-evalt', 'min({1+10,x}) = max({1+10,x})', | |
| 2219 | '-evalt', '{x|min({1+10,x}) = max({1+10,x})} = {11}' | |
| 2220 | ], 'Testing constraint propagation for reverse and unification with set extensions.'). | |
| 2221 | cli_testcase(1315, [cbc], [ | |
| 2222 | '-evalf', 'x>y & x=y', | |
| 2223 | '-evalf', 'x+1 > y+1 & x=y', | |
| 2224 | '-evalf', 'x+1 < y+1 & x=y', | |
| 2225 | % require CHR: '-evalf', 'x<y & y<z & x=z', or '-evalf', 'x+1 < y & x=y' | |
| 2226 | '-evalt', '!(x,y).(x:INTEGER & x>y => x/=y)' | |
| 2227 | ], 'Check simple inconsistencies with <, > detected now'). | |
| 2228 | 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 | |
| 2229 | ], 'Test challenging puzzle'). | |
| 2230 | cli_testcase(1317, [csp_test,ltl], ['../prob_examples/public_examples/CSP/other/Ivo/Underscore_LTL.csp', '-ltlassertions', '-strict'], 'Checking underscore arguments in LTL formulas.'). | |
| 2231 | 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'). | |
| 2232 | cli_testcase(1319, [b_test], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/Demo/scheduler.mch', | |
| 2233 | '-mc', '100', '-bf', '-cc', '36', '156', '-p', 'DEFAULT_SETSIZE', '3', '-save_state', | |
| 2234 | '../prob_examples/public_examples/B/Demo/scheduler_bf_states.P'], 'Test -save_state works'). | |
| 2235 | cli_testcase(1320, [cbc], [ | |
| 2236 | '-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'). | |
| 2237 | cli_testcase(1321, [cbc,wd], [ | |
| 2238 | '-eval', '{} : (1..(10/0) +-> {22})', | |
| 2239 | '-expcterr', well_definedness_error], 'check WD error detected for binary_in_definitely_true'). | |
| 2240 | cli_testcase(1322, [cbc,wd], [ | |
| 2241 | '-eval', '{} : POW(1..(10/0))', | |
| 2242 | '-expcterr', well_definedness_error], 'check WD error detected for unary_in_definitely_true'). | |
| 2243 | cli_testcase(1323, [eventb_test,tickets,theories], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/testSUM_Theory_agg_op_ctx.eventb', | |
| 2244 | '-init', '-assertions', | |
| 2245 | '-strict'], 'Ensure no variable clash with agg_op1/2.'). | |
| 2246 | cli_testcase(1324, [b_test], [ | |
| 2247 | '-evalt', 'a & b', | |
| 2248 | '-evalt', 'a=5', | |
| 2249 | '-p', 'BOOL_AS_PREDICATE', 'TRUE' | |
| 2250 | ], 'Extended formula syntax.'). | |
| 2251 | cli_testcase(1325, [b_test,refinement,card], ['../prob_examples/public_examples/B/FeatureChecks/Refinement/RefDefSetAsEnumSet.mch', | |
| 2252 | '-init', '-assertions', | |
| 2253 | '-strict'], 'Ensure enumerated set declaration in refinement using all-diff with card detected.'). | |
| 2254 | cli_testcase(1326, [b_test,cse, cse_test, strings], ['-p', 'CSE', 'TRUE', '-p', 'TIME_OUT', 150, | |
| 2255 | '-evalf', 'x:1..500000 & y:1..500000 & (x+y)**2 = 4+(x+y)**2', | |
| 2256 | '-evalf', '(x*y*z) = (y*x*z)+10', | |
| 2257 | '-evalf', '(x*y*z) = (y*z*x)+10', | |
| 2258 | '-evalf', '(x*(z*y)) = ((y*x)*z)+10', | |
| 2259 | '-evalf', '(x*y*z*z*x) = (z*x*y*x*z)+10', | |
| 2260 | '-evalf', '(x*y*(z*z)*x) = (z*(x*y)*x*z)+10', | |
| 2261 | '-evalf', '(x\\/y\\/v\\/x) /= (v\\/x\\/y) & x<:BOOL', % CSE does not fully detect LHS and RHS identical (because of idempotence) | |
| 2262 | '-evalf', '(x\\/y\\/v\\/x) /= (v\\/x\\/x\\/y) & x<:BOOL', | |
| 2263 | '-evalf', '(x\\/y\\/v\\/x) /= (v\\/x\\/x\\/y) & x<:STRING', | |
| 2264 | '-evalf', '(x\\/y\\/v\\/x) <<: (v\\/x\\/x\\/y) & x<:STRING', | |
| 2265 | '-evalf', '(x\\/y\\/v\\/x) /<: (v\\/x\\/x\\/y) & x<:STRING', | |
| 2266 | '-evalt', '(x\\/y\\/v\\/x) <: (v\\/x\\/x\\/y) & x<:BOOL', | |
| 2267 | '-evalt', '(x\\/y\\/v\\/x) /<<: (v\\/x\\/x\\/y) & x<:BOOL', | |
| 2268 | '-evalt', '(x*y*(z*z)*x) = (z*(x*y)*x*z*x)-36 & x:0..2 & y:0..2 & z:0..3', | |
| 2269 | '-evalt', '#x.((x>10+10) & (x>10+10 => b=TRUE) & x:1..200)', | |
| 2270 | '-evalt', '{0|->1,4|->2}(x*2+x*2) > 1', | |
| 2271 | '-evalt', '{0|->x*x, 1|->(x*x)+1}(v) = 9 & v:0..1 & x:0..10', % had WD error v:0..10 | |
| 2272 | '-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)}', | |
| 2273 | '-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)}', | |
| 2274 | '-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)}' | |
| 2275 | ], 'Ensure CSE works'). | |
| 2276 | cli_testcase(1327, [tickets], ['-p', 'CSE', 'TRUE', '-p', 'TIME_OUT', '150s', | |
| 2277 | '-expcterr', eclipse_preference | |
| 2278 | ], 'Ensure error in set preference discovered'). | |
| 2279 | cli_testcase(1328, [cbc_refinement,refinement], ['../prob_examples/examples/RodinModels/Seiter_RefinementChecking/auth_0_mch.eventb', '-cbc_refinement'], ''). | |
| 2280 | cli_testcase(1329, [cbc_refinement,refinement], ['../prob_examples/examples/RodinModels/Seiter_RefinementChecking/auth_1_mch.eventb', '-cbc_refinement'], ''). | |
| 2281 | cli_testcase(1330, [cbc_refinement,refinement], ['../prob_examples/examples/RodinModels/Seiter_RefinementChecking/auth_2_mch.eventb', '-cbc_refinement', '-expcterr', cbc_refinement], ''). | |
| 2282 | cli_testcase(1331, [tickets, 'PROB-356',slot], ['../prob_examples/public_examples/B/Tickets/PROB-356/SlotSolver.mch', | |
| 2283 | '-init', '-p', 'TIME_OUT', '25000', '-eval', 'CHECK(ges, ger, 1)' | |
| 2284 | ], 'Ensure no access record errors'). | |
| 2285 | cli_testcase(1332, [tickets, 'PROB-355',slot], ['../prob_examples/public_examples/B/Tickets/PROB-355/SlotSolver.mch', | |
| 2286 | '-init', '-p', 'TIME_OUT', '20000', '-eval', 's1 : COURSES & CHECK(s1, soz, 1)' | |
| 2287 | ], 'Ensure no infinite loop'). | |
| 2288 | cli_testcase(1333, [cbc_deadlock,cache], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', | |
| 2289 | '-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 | |
| 2290 | cli_testcase(1334, [b_test,cse_test,codespeed], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-strict', '-model_check', '-p', 'CSE', 'TRUE', '--hash64', 203058745203935766, '-p', 'MAX_INITIALISATIONS', 5, '-cc', '1361', '25696'], 'Check CSE for Cruise Controller'). % the hash is only valid on 64-bit systems ( conditional skip added); adapted hash on 8.12.2015 for new variable order | |
| 2291 | cli_testcase(1335, [b_test], ['../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'). | |
| 2292 | cli_testcase(1336, [tickets, 'SLOT-24',slot,codespeed], ['../prob_examples/public_examples/B/Tickets/SLOT-24/SlotSolver.mch', | |
| 2293 | '-init', '-evalt', 'CHECK(ges, ger, 1)', '-evalf', 'CHECK(rom, jap, 1)', '-main_assertions' | |
| 2294 | ], 'Ensure no access record errors'). | |
| 2295 | cli_testcase(1337, [parser,tickets, 'PARSERLIB-32'], ['../prob_examples/public_examples/B/Tickets/PARSERLIB-32/TestDefOrder.mch', | |
| 2296 | '-mc', 100 | |
| 2297 | ], 'Ensure that definition order for predicate-definitions does not matter'). | |
| 2298 | cli_testcase(1338, [private, 'SLOT-24', recursion,slot], ['../prob_examples/examples/B/SlotTool/SlotTool_19092014/SlotSolver.mch', | |
| 2299 | '-init', '-assertions' | |
| 2300 | ], 'Ensure complicated unsat core computations keep on working'). | |
| 2301 | %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'). | |
| 2302 | 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.'). | |
| 2303 | cli_testcase(1341, [b_test], ['../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.'). | |
| 2304 | 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.'). | |
| 2305 | 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.'). | |
| 2306 | cli_testcase(1344, [csp_test,assertions], ['../prob_examples/public_examples/CSP/other/Ivo/AParallel.csp', '-assertions', '-strict'], 'Testing pattern matching for alphabetised parallel operators.'). | |
| 2307 | cli_testcase(1345, [csp_test,assertions], ['../prob_examples/public_examples/CSP/other/Ivo/AParallel1.csp', '-assertions', '-strict'], 'Testing pattern matching for alphabetised parallel operators.'). | |
| 2308 | 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).'). | |
| 2309 | cli_testcase(1347, [csp_test], ['../prob_examples/public_examples/CSP/other/Andreas_Hense/ATM/ATM_v5.csp', '-t', '-strict'], ''). | |
| 2310 | cli_testcase(1348, [csp_test,assertions,records], ['../prob_examples/public_examples/CSP/other/Ivo/EnumeratingDataTypes.csp', '-assertions', '-strict'], 'Enumerating partial data type records.'). | |
| 2311 | cli_testcase(1349, [b_test,ltl], ['../prob_examples/public_examples/B/Ivo/Threads.mch', '-ltlassertions', | |
| 2312 | '-ltlformula', 'GF deadlock(Step1_p1,Step1_p2)', | |
| 2313 | '-ltlformula', 'G deterministic(Step1_p1,Sync)', | |
| 2314 | '-ltlformula', 'G(e(Step1_p2) or controller(Step1_p1,Sync))', | |
| 2315 | '-strict'], 'Covering the new APs (deadlock(...),deterministic(...), and controller(...)) of the LTL interpreter.'). | |
| 2316 | cli_testcase(1350, [cbc,tickets], ['../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_mch.eventb', '-cbc_sequence', 'aload_R07' ], 'Check cbc sequence on example with partially enumerated sets'). | |
| 2317 | cli_testcase(1351, [tickets], ['../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_CLPFD_Overflow/Machine_Bug3.mch', '-init', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '3500', | |
| 2318 | '-expcterrpos', type_error, 716, 48, | |
| 2319 | '-expecterr', 'bmachine_construction', | |
| 2320 | '-expcterrpos', 'bmachine_static_checks', 716, 0 % added this 15.12.2015 as we now also generate warning for length | |
| 2321 | ], 'Check abs DEFINITION error message works (and VAR hides constant)'). | |
| 2322 | cli_testcase(1352, [tickets,while], ['../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_CLPFD_Overflow/Machine_Bug3_renamed.mch', | |
| 2323 | '-t', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '3500' ], 'Check no error in compiling While loop'). | |
| 2324 | cli_testcase(1353, [b_test], [ | |
| 2325 | '-evalt', '{x|x>99988844111111222200 & x<99988844111111222300 & x mod 20 = 1} = res & 2000 /: res & 99988844111111222201 : res', | |
| 2326 | '-eval', '{x|x>99988844111111222200 & x<99988844111111222300 & x mod 20 = 1}' | |
| 2327 | , '-evalt', '{x|x>ll & x<99988844111111222300 & x mod 20 = 9} = res & (ll=99988844111111222200 or ll = 99988844111111222201) & 99988844111111222209 : res' | |
| 2328 | , '-evalt', '{x|x>ll & x<99988844111111222300 & x mod 20 = 2} = res & 2000 /: res & 99988844111111222202 : res & (ll=99988844111111222200 or ll = 99988844111111222201)' | |
| 2329 | ], 'Check CLPFD Overflow is caught'). | |
| 2330 | 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.'). | |
| 2331 | 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.'). | |
| 2332 | 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'). | |
| 2333 | 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'). | |
| 2334 | cli_testcase(1358, [cbc,enabling], ['../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition.eventb', | |
| 2335 | '-p', 'TIME_OUT', 3000, | |
| 2336 | '-feasibility_analysis_csv', 1500, | |
| 2337 | '../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition_feasibility.csv'], 'Check feasibility analysis works'). | |
| 2338 | 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', | |
| 2339 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/SeqTest/SortRecFunction_ctx.eventb', | |
| 2340 | '-p', 'MAXINT', '3', '-t' ,'-assertions'], 'Check no enumeration warning'). | |
| 2341 | cli_testcase(1360, [cbc,enabling], ['../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck.mch', | |
| 2342 | '-opterr', 'clpfd_overflow', | |
| 2343 | '-feasibility_analysis_csv', 750,'../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck_feasibility.csv'], 'Check feasibility analysis works'). | |
| 2344 | cli_testcase(1361, [ctl,tickets], ['../prob_examples/public_examples/B/LTL/MammarFrappier/FlightSystem_corrected_3_3.mch', '-ctlformula', 'AG({Customers1|->Flights1 /: tickets} => EF({Customers1|->Flights1 : tickets}))', | |
| 2345 | '-ltllimit', 100, '-expcterr', 'ctl_incomplete', '-expcterr', 'state_space', | |
| 2346 | '-p', 'STRICT_RAISE_WARNINGS', 'TRUE'], 'Check that incomplete CTL model check detected'). | |
| 2347 | cli_testcase(1362, [ctl,tickets], ['../prob_examples/public_examples/B/LTL/MammarFrappier/FlightSystem_corrected_3_3.mch', | |
| 2348 | '-ctlformulat', 'AG({Customers1|->Flights1 /: tickets} => EF({Customers1|->Flights1 : tickets}))', | |
| 2349 | '-p', 'STRICT_RAISE_WARNINGS', 'TRUE', '-cc', 2199, 15212], 'Check that CTL model check works without ltllimit'). | |
| 2350 | cli_testcase(1363, [ctl], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', | |
| 2351 | '-p', 'MAXINT', 20, | |
| 2352 | '-ctlformulaf', 'AG({c<mx})', '-his', '../prob_examples/public_examples/B/Simple/UpCounter_his.txt', '-his_option','show_states' | |
| 2353 | ], 'Check that CTL model check works without ltllimit'). | |
| 2354 | cli_testcase(1364, [ctl], ['../prob_examples/public_examples/B/Demo/scheduler.mch', | |
| 2355 | '-p', 'DEFAULT_SETSIZE', '3', | |
| 2356 | '-ctlformulaf', 'AG {active={} or ready = {} or waiting ={}}', '-bf', '-mc', 9999, '-his', '../prob_examples/public_examples/B/Demo/scheduler_his.txt', '-his_option','show_states' | |
| 2357 | ], 'Check that CTL model check generates correct counter example'). | |
| 2358 | cli_testcase(1365, [ctl], ['../prob_examples/public_examples/B/Demo/scheduler.mch', | |
| 2359 | '-ctlformulat', 'AG({card(ready)>1} => EF {card(active)>0})', | |
| 2360 | '-ctlformulat', 'AG EF {active = {}}', | |
| 2361 | '-ctlformulat', 'EG {active = {}}', | |
| 2362 | '-p', 'DEFAULT_SETSIZE', '3' | |
| 2363 | ], 'Check CTL formulas'). | |
| 2364 | 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', | |
| 2365 | '-expcterr', 'invariant_violation'], 'Check BMC works'). | |
| 2366 | cli_testcase(1367, [cbc,tickets,bmc], ['../prob_examples/public_examples/B/Tickets/OpCallModifiesInfo/OpCallModifiesInfo.mch', '-bmc', 5, | |
| 2367 | '-expcterr', 'invariant_violation'], 'Check Modifies Info correct for operation calls'). | |
| 2368 | cli_testcase(1368, [cbc,tickets], ['../prob_examples/public_examples/B/Tickets/ComponentPartitioning/ManyPartialFunctions.mch', '-init', | |
| 2369 | '-p', 'DEFAULT_SETSIZE', 5], 'Check component partition works with equality inlining'). | |
| 2370 | cli_testcase(1369, [b_test,tla,tlc],['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-mc_with_tlc'], 'TLC regression test'). | |
| 2371 | 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'). | |
| 2372 | 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'). | |
| 2373 | cli_testcase(1372, [b_test], ['../prob_examples/public_examples/B/Mathematical/FormaleSprachen.mch', | |
| 2374 | '-p', 'SMT', 'TRUE', | |
| 2375 | '-init','-assertions', '-strict'], 'Test 1264 but with SMT mode.'). | |
| 2376 | cli_testcase(1373, [private,codespeed], ['../prob_examples/examples/B/Alstom/vesg_Aug11/gradient_train_altitude.mch', | |
| 2377 | '-animate', 5, '-p', 'TIME_OUT', 300000000, '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-p', 'CLPFD', 'FALSE'], 'Test Alstom example'). | |
| 2378 | cli_testcase(1374, [tickets,card], [ | |
| 2379 | '-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))'], | |
| 2380 | 'Test that no choice points due to add_element'). | |
| 2381 | cli_testcase(1375, [cbc, cbc_tests, tickets,bmc], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/VerySimpleCounterWrong.mch', '-bmc', 6, | |
| 2382 | '-expcterr', 'invariant_violation'], 'Check BMC works'). | |
| 2383 | cli_testcase(1376, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/02_001_adapted.mch', | |
| 2384 | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', 155000, | |
| 2385 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Check performance (previously part of 1162)'). | |
| 2386 | 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, | |
| 2387 | '-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 | |
| 2388 | 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'). | |
| 2389 | 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 with CSE'). | |
| 2390 | 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'). | |
| 2391 | cli_testcase(1381, [tickets,cse_test], ['../prob_examples/public_examples/B/Tickets/CSE/BoolValue.mch', | |
| 2392 | '../prob_examples/public_examples/B/Tickets/CSE/ExplicitComputations_Reduced.mch', | |
| 2393 | '-init', '-p', 'CSE', 'TRUE'], 'Check sharing of predicates works'). | |
| 2394 | cli_testcase(1382, [cbc, disprover], ['../prob_examples/examples/B/Alstom/DisproverProject/prob13265_hyp_removed.mch', | |
| 2395 | '-cbc_assertions', '-p', 'MAX_INITIALISATIONS', 0], 'Check partitioning for cbc_assertions works'). | |
| 2396 | cli_testcase(1383, [tickets, external], ['../prob_examples/examples/B/Alstom/Ticket_Dec08_2014/Segment_refAdhesionLevel_GER5.mch', | |
| 2397 | '-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'). | |
| 2398 | cli_testcase(1384, [cbc,sigma,card], [ | |
| 2399 | '-evalt', '{y|SIGMA(x).(x:1..10 & x mod 5 = 0|x+y) = 215} = {100}', | |
| 2400 | '-evalt', '{y|PI(x).(x:1..10 & x mod 5 = 0|x+y) = 66} = {-16,1}', | |
| 2401 | '-evalt', 'SIGMA(x).(x:{y} \\/ {z}|x) = 10 & y>z & z>0', | |
| 2402 | '-evalt', '{y,z|SIGMA(x).(x:{y} \\/ {z}|x+3) = 10 & y>z & z>0} = {(3,1)}', | |
| 2403 | '-evalt', 'SIGMA(i).(i:1..1000|i)=500500', | |
| 2404 | '-evalt', 'SIGMA(i).(i:0..1000|i)=500500', | |
| 2405 | '-evalt', 'SIGMA(i).(i:-2..1000|i)=500497', | |
| 2406 | '-evalt', 'SIGMA(i).(i:-3..1000|i)=500494', | |
| 2407 | '-evalt', 'SIGMA(i).(i:-2..-3|i)=0', | |
| 2408 | '-evalt', '{y,m|PI(x).(x:1..3|x+y) = m & m:25..100} = {(2,60)}', | |
| 2409 | '-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', | |
| 2410 | '-evalf', 's:seq(NATURAL1) & size(s)=220 & SIGMA(i).(i:1..size(s)|s(i)) = 200', | |
| 2411 | '-evalf', 'x = SIGMA(i).(i:1..n|i) & x<0', | |
| 2412 | '-evalt', 'x = SIGMA(i).(i:1..n|i) & n>1 & x = 5050', | |
| 2413 | '-evalt', '{n|5050 = SIGMA(i).(i:1..n|i)} = {100}', | |
| 2414 | '-evalf', 'x = SIGMA(i).(i:1..n|i) & n>100 & x < 5151', | |
| 2415 | '-evalt', '{x,n|x = SIGMA(i).(i:-3..n|i) & n>1 & x < 5150 & x>5100} = {(5145,101)}', | |
| 2416 | '-evalf', 's = [x,10,y] & PI(i).(i:dom(s)|s(i)) = r & x>0 & y>0 & r<10', | |
| 2417 | '-evalt', 's<:11..15 & card(s)<3 & SIGMA(x).(x:s|x)=23' | |
| 2418 | ], 'Check constraint propagation of SIGMA / PI work better now'). | |
| 2419 | cli_testcase(1385, [cbc,sigma], ['../prob_examples/public_examples/B/Puzzles/Minesweeper.mch', | |
| 2420 | '../prob_examples/public_examples/B/Puzzles/Minesweeper_v2.mch', | |
| 2421 | %'../prob_examples/public_examples/B/Puzzles/Minesweeper_v3.mch', still time-out | |
| 2422 | '../prob_examples/public_examples/B/Puzzles/Minesweeper_v4.mch', | |
| 2423 | '-init', '-cbc_assertions'], 'Check this version with SIGMA can be solved efficiently'). | |
| 2424 | cli_testcase(1386, [cbc,atelierb], ['../prob_examples/examples/B/Alstom/DisproverProject/FalsePO1.mch', | |
| 2425 | '-cbc_assertions', '-expecterr', 'cbc_assertions', '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). | |
| 2426 | cli_testcase(1387, [cbc,atelierb,chr], ['../prob_examples/examples/B/Alstom/DisproverProject/TimeOutPO1.mch', | |
| 2427 | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2428 | '-cbc_assertions', | |
| 2429 | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). | |
| 2430 | cli_testcase(1388, [cbc,atelierb,chr], ['../prob_examples/examples/B/Alstom/DisproverProject/TruePO1.mch', | |
| 2431 | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2432 | '-cbc_assertions', | |
| 2433 | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). | |
| 2434 | cli_testcase(1389, [cbc,atelierb,chr], ['../prob_examples/examples/B/Alstom/DisproverProject/DeferredSetPO1.mch', | |
| 2435 | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2436 | '-cbc_assertions', | |
| 2437 | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). | |
| 2438 | /* does not work yet: | |
| 2439 | cli_testcase(1382, [private, 'SLOT-24', recursion,slot,cse], ['../prob_examples/examples/B/SlotTool/SlotTool_19092014/SlotSolver.mch', | |
| 2440 | '-init', '-assertions', '-p', 'CSE', 'TRUE' | |
| 2441 | ], 'Ensure complicated unsat core computations keep on working with CSE TRUE'). | |
| 2442 | */ | |
| 2443 | cli_testcase(1390, [tickets], [ | |
| 2444 | '-evalu', '({1}*INTEGER)=f & res = f[{1}] & res=MININT..MAXINT', '-expcterr', eval_string_enum_warning], | |
| 2445 | 'Check that we do not report this as true / false'). | |
| 2446 | cli_testcase(1391, [tickets,proz], ['../prob_examples/public_examples/Z/Daniel/Praxis/network2.fuzz', | |
| 2447 | '../prob_examples/public_examples/Z/Daniel/scheduler.fuzz', | |
| 2448 | '../prob_examples/public_examples/Z/Daniel/SudokuSETS9.fuzz', | |
| 2449 | '../prob_examples/public_examples/Z/Daniel/watergate.fuzz', | |
| 2450 | '-t'], | |
| 2451 | 'Ensure no pending co-routines for instantiation of freetype value (network2)'). | |
| 2452 | cli_testcase(1392, [cbc,sigma], [ | |
| 2453 | '-evalt', 'r = {s1,s2| SIGMA(i).(i:s1|i) = SIGMA(j).(j:s2|j)} & {x,y}|->{10}:r & {6}|->{x}:r', | |
| 2454 | '-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)}', | |
| 2455 | '-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 | |
| 2456 | ], 'Check that we can find a solution : choice point enumerated before enumerating y'). | |
| 2457 | cli_testcase(1393, [tickets,slot,codespeed], ['../prob_examples/public_examples/B/Tickets/SLOT-PERFORMANCE3/WiWiSolver.mch', | |
| 2458 | '-init', % '-v', % generates non-ground closure warnings | |
| 2459 | '-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)}' | |
| 2460 | ], 'Ensure no time-out due to total-function setup too late'). | |
| 2461 | cli_testcase(1394, [tickets,alstom,private,codespeed,union], ['../prob_examples/examples/B/Alstom/ixl/lausanne.mch', '-t', | |
| 2462 | '-p', 'TIME_OUT', 5000], 'Ensure no time-out due to rel_compose calling union without WF'). | |
| 2463 | cli_testcase(1395, [cbc, symmtest], ['../prob_examples/public_examples/B/SymmetryReduction/DefSetWithConstantsTest2.mch', '-init', | |
| 2464 | '-expecterr', 'setup_constants_fails', '-p', 'TIME_OUT', '9000'], 'Ensure static symmetry reduction works'). | |
| 2465 | cli_testcase(1396, [cbc, symmtest], ['../prob_examples/public_examples/B/SymmetryReduction/DefSetWithConstantsTest3.mch', '-mc', 9999, '-nodead', | |
| 2466 | '-cc', 19, 18 ], 'Ensure static symmetry reduction works'). | |
| 2467 | cli_testcase(1397, [cbc], ['../prob_examples/public_examples/B/Puzzles/HandshakeSimple_TotFun.mch' ], 'Ensure forall quantifier also uses contrapositive'). | |
| 2468 | cli_testcase(1398, [cbc, symmtest], ['../prob_examples/public_examples/B/SymmetryReduction/DefSetWithConstantsTest2.mch', '-cbc_sequence', '', | |
| 2469 | '-expecterr', 'cbc_sequence_no_solution_found'], 'Ensure static symmetry reduction works'). | |
| 2470 | ||
| 2471 | cli_testcase(1399, [cbc], [ | |
| 2472 | '-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' | |
| 2473 | ], '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 | |
| 2474 | cli_testcase(1400, [cbc,disprover,chr], [ | |
| 2475 | '-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)', | |
| 2476 | '-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)', | |
| 2477 | '-p', 'CHR', 'TRUE' | |
| 2478 | ], '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 | |
| 2479 | ||
| 2480 | cli_testcase(1401, ['PROB-369',csp_test,cspb,'PROB-371','PROB-368',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', | |
| 2481 | '-evalt', '-2 mod 3 = 1'], 'Check synchronisation with sequence type works and z minor mode set for modulo'). | |
| 2482 | cli_testcase(1402, [cbc,atelierb,chr,disprover], ['../prob_examples/examples/B/Alstom/DisproverProject/TruePO1_Taut.mch', | |
| 2483 | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2484 | '-cbc_assertions_tautology_proof', | |
| 2485 | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt'], 'Test Atelier-B Disprover interface'). | |
| 2486 | cli_testcase(1403, [cbc,smt,chr], [ | |
| 2487 | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/n_queen/queen20-1.smt2', | |
| 2488 | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/toroidal_bench/toroidal_queen2-1.smt2', | |
| 2489 | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/toroidal_bench/toroidal_queen3-1.smt2', | |
| 2490 | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/toroidal_bench/toroidal_queen5-1.smt2', | |
| 2491 | '../prob_examples/public_examples/SMT/QF_IDL/queens_bench/super_queen/super_queen10-1.smt2', | |
| 2492 | %'../prob_examples/public_examples/SMT/QF_IDL/queens_bench/super_queen/super_queen20-1.smt2', | |
| 2493 | '-p', 'CHR', 'TRUE', '-p', 'SMT', 'TRUE'], 'Test SMT interface and solving'). | |
| 2494 | % | |
| 2495 | ||
| 2496 | cli_testcase(1404, [ltl], ['../prob_examples/public_examples/EventBPrologPackages/ABZ_Landing_Gear/Ref4_ControllerHandle_mch.eventb', '-mc', 99999, '-cc' , 8629, 41811, | |
| 2497 | '-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))' | |
| 2498 | ], 'Check LTL pattern deterministic'). | |
| 2499 | cli_testcase(1405, [dot], ['../prob_examples/public_examples/B/Simple/VerySimpleDFA.mch', '-bf', '-mc', 1000, '-strict', '-dotexpr', transition_diagram, 's', '../prob_examples/public_examples/B/Simple/VerySimpleDFA_transition_diagram.dot'],'Check Transition Diagram for Expression.'). | |
| 2500 | cli_testcase(1406, [b_test,cbc,atelierb,disprover], ['-cbc_assertions_tautology_proof', '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'ALLOW_UNTYPED_IDENTIFIERS', 'TRUE', | |
| 2501 | '-expcterr', 'cbc_assertions_enumeration_warning', | |
| 2502 | '../prob_examples/examples/B/Alstom/DisproverProject/TypingIssues/prob17066_not_provable.mch' | |
| 2503 | ], 'Check ProB finds no counter example for rule and no proof'). | |
| 2504 | cli_testcase(1407, [b_test,cbc,atelierb,disprover], ['-cbc_assertions_tautology_proof', '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'ALLOW_UNTYPED_IDENTIFIERS', 'TRUE', | |
| 2505 | '../prob_examples/examples/B/Alstom/DisproverProject/TypingIssues/prob17066_provable.mch' | |
| 2506 | ], 'Check ProB finds no counter example for rule and no proof'). | |
| 2507 | ||
| 2508 | cli_testcase(1408, [cbc,sigma], [ | |
| 2509 | '-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 | |
| 2510 | '-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)}' | |
| 2511 | ], 'Check that partition propagates well (no enum warning)'). | |
| 2512 | ||
| 2513 | cli_testcase(1409, [cbc,disprover], [ | |
| 2514 | '../prob_examples/public_examples/ProofObligations/GearDoor1_mch.pl', | |
| 2515 | '../prob_examples/public_examples/ProofObligations/GearsDoorsHandle3_mch.pl', | |
| 2516 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M2_mch.pl', | |
| 2517 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M20_mch.pl', | |
| 2518 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M3_mch.pl', | |
| 2519 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M30_mch.pl', | |
| 2520 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m1_true.pl', | |
| 2521 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m2_mch.pl', | |
| 2522 | '-p', 'DOUBLE_EVALUATION', 'FALSE' | |
| 2523 | %,'../prob_examples/examples/ProofObligations/ABZ14_Mery/M4_mch.pl' | |
| 2524 | ],'Check Disprover can prove all POs'). | |
| 2525 | cli_testcase(1410, [cbc,disprover], [ | |
| 2526 | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_1_true.pl', | |
| 2527 | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_3_true.pl', | |
| 2528 | '-p', 'DOUBLE_EVALUATION', 'FALSE' | |
| 2529 | ],'Check Disprover can prove all POs; this test also checks register predicate works better'). | |
| 2530 | cli_testcase(1411, [cbc,disprover], [ | |
| 2531 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest2_ctx.pl', | |
| 2532 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest3_ctx.pl', | |
| 2533 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest4_ctx.pl', | |
| 2534 | '-check_disprover_result', 0,0,2, | |
| 2535 | '-p', 'DOUBLE_EVALUATION', 'FALSE' | |
| 2536 | ],'Check Disprover cannot prove po'). | |
| 2537 | cli_testcase(1412, [cbc,random,sigma], [ | |
| 2538 | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', | |
| 2539 | '-evalt', 'x:1..20 --> 1..100 & SIGMA(v).(v:1..20|x(v)) = 20*50' | |
| 2540 | % 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] | |
| 2541 | % 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] | |
| 2542 | ],'Check random enumeration'). | |
| 2543 | cli_testcase(1413, [cbc,chr,disprover], [ | |
| 2544 | '-p', 'CHR', 'TRUE', | |
| 2545 | '-evalf', 'xx>0 & xx+1 <= p & xx=p' | |
| 2546 | %'-evalf', 'xx>0 & xx+2 <= p & xx=p' % does not work yet | |
| 2547 | ],'Check CHR propagation'). | |
| 2548 | cli_testcase(1414, [b_test,cbc,atelierb,disprover], ['-cbc_assertions_tautology_proof', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2549 | '-p', 'CHR', 'TRUE', '-p', 'CSE', 'TRUE', | |
| 2550 | %'../prob_examples/examples/B/Alstom/DisproverProject/ProvableByPP/prob9313.mch', % does not work yet | |
| 2551 | '../prob_examples/examples/B/Alstom/DisproverProject/ProvableByPP/prob9313_1.mch' | |
| 2552 | ], 'Check ProB finds proof'). | |
| 2553 | cli_testcase(1415, [cbc,random], [ | |
| 2554 | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', | |
| 2555 | '../prob_examples/public_examples/B/FeatureChecks/RandomEnumeration.mch', | |
| 2556 | '-init', '-assertions' | |
| 2557 | ],'Check random enumeration'). | |
| 2558 | 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.'). | |
| 2559 | 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).'). | |
| 2560 | cli_testcase(1418, [cbc,sigma,card], [ | |
| 2561 | '-evalf', 'card(s)=5 & card(r)=3 & SIGMA(x).(x:r|x)=SIGMA(y).(y:s|y) & s<:0..16 & r<:s', | |
| 2562 | '-evalt', 'card(x)=10 & !y.(y:x & y<50 => y+1:x) & x<:1..50', | |
| 2563 | '-evalt', '{x|card(x)=10 & !y.(y:x & y<50 => y+1:x) & x<:1..50} = {41..50}', | |
| 2564 | '-evalt', '{x|card(x)=50 & !y.(y:x & y<50 => y+1:x) & x<:1..50} = {1..50}', | |
| 2565 | '-evalt', '{x|card(x)=150 & !y.(y:x & y<50 => y+1:x) & x<:1..50} = {}', | |
| 2566 | '-evalt', 'card(x)=10 & !(y,z).(y|->z:x & y<50 => y+1|->z:x) & x<:(1..50)*{TRUE}', | |
| 2567 | '-evalt', 'card(x)=10 & !(y).(y:x & y\'f1<50 => rec(f1:y\'f1+1):x) & x<:struct(f1:1..50)', | |
| 2568 | '-evalt', 'card(x)=10 & !(y,z).(y|->z:x & y<50 => y+1|->z:x) & x<:(1..50)*{"A","B"}' | |
| 2569 | % 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)' | |
| 2570 | % also slow: card(x)=10 & !(y).(y:x & prj1(INTEGER,BOOL)(y)<50 => (prj1(INTEGER,BOOL)(y)+1,TRUE):x) & x<:(1..50)*BOOL | |
| 2571 | % 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 | |
| 2572 | % 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) | |
| 2573 | % slow : card(x)=10 & !(y,z).(z|->y:x => ( y<50 => z|->y+1:x)) & x<:BOOL*(1..50) | |
| 2574 | ], 'Test this is solved quickly using new ordered_value check for card.'). | |
| 2575 | cli_testcase(1419, [cbc,card], [ '-p', 'SMT', 'TRUE', | |
| 2576 | '-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)', | |
| 2577 | '-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})', | |
| 2578 | '-evalt', 'card(x)=1 & !(y).(y:x & prj1(INTEGER,BOOL)(y)<50 => (prj1(INTEGER,BOOL)(y)+1,TRUE):x) & x<:(1..50)*BOOL' | |
| 2579 | ], 'Test this is solved quickly using new ordered_value check for card & avoid bug in expand all quantifeir.'). | |
| 2580 | cli_testcase(1420, [tickets,sigma], [ | |
| 2581 | '-evalt', 'Z={((((1|->1)|->-59843)|->-57163)),((((2|->1)|->-57163)|->-56910))} & r=SIGMA(a,b,c,d).((a,b,c,d):Z|d-c)' | |
| 2582 | ], 'Test issue with Sigma/Pi for multiple variables'). | |
| 2583 | cli_testcase(1421, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/InfiniteAndFiniteCounterCorrect.mch', '-symbolic_model_check', 'ic3'], 'Contains Finite and Infinite Counter'). | |
| 2584 | 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'). | |
| 2585 | cli_testcase(1423, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/InfiniteCounter.mch', '-symbolic_model_check', 'ic3'], 'Contains Infinite Counter'). | |
| 2586 | cli_testcase(1424, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/VerySimpleCounter.mch', '-symbolic_model_check', 'ic3'], 'Simple Counter'). | |
| 2587 | 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'). | |
| 2588 | 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'). | |
| 2589 | 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'). | |
| 2590 | cli_testcase(1428, [symbolic_model_checker], ['../prob_examples/public_examples/B/SymbolicModelChecking/Bakery0.mch', '-symbolic_model_check', 'ic3'], 'Bakery Model without Invariant Violation'). | |
| 2591 | 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'). | |
| 2592 | cli_testcase(1430, [laws], ['../prob_examples/public_examples/B/Laws/SetLawsNatural.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets with Natural sets mixed'). | |
| 2593 | 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'). | |
| 2594 | 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'). | |
| 2595 | 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.'). | |
| 2596 | 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.'). | |
| 2597 | cli_testcase(1435, [cbc, symmtest,card], ['../prob_examples/public_examples/B/CBC/GraphMining_RunningExample_Unsat.mch', '-init', '-expcterr', 'setup_constants_fails'], 'Test odered set symmetry breaking works with card(S)>Nr constraint.'). | |
| 2598 | cli_testcase(1436, [cbc,disprover], [ | |
| 2599 | '../prob_examples/public_examples/ProofObligations/GearDoor1_mch.pl', | |
| 2600 | '../prob_examples/public_examples/ProofObligations/GearsDoorsHandle3_mch.pl', | |
| 2601 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M2_mch.pl', | |
| 2602 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M20_mch.pl', | |
| 2603 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M3_mch.pl', | |
| 2604 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M30_mch.pl', | |
| 2605 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m1_true.pl', | |
| 2606 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m2_mch.pl', | |
| 2607 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m0_mch.pl', | |
| 2608 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m1_mch.pl', | |
| 2609 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m2_mch.pl', | |
| 2610 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel1/LPN0_mch.pl', | |
| 2611 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel1/LPN1_mch.pl', | |
| 2612 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel1/LPN2_mch.pl', | |
| 2613 | '-p', 'DOUBLE_EVALUATION', 'TRUE' | |
| 2614 | %,'../prob_examples/examples/ProofObligations/ABZ14_Mery/M4_mch.pl' | |
| 2615 | ],'Test 1409 with double check'). | |
| 2616 | cli_testcase(1437, [cbc,disprover], [ | |
| 2617 | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_1_true.pl', | |
| 2618 | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_3_true.pl', | |
| 2619 | '-p', 'DOUBLE_EVALUATION', 'TRUE' | |
| 2620 | ],'Test 1410 with double check'). | |
| 2621 | cli_testcase(1438, [cbc,disprover], [ | |
| 2622 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest2_ctx.pl', | |
| 2623 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest3_ctx.pl', | |
| 2624 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest4_ctx.pl', | |
| 2625 | '-check_disprover_result', 0,0,2, | |
| 2626 | '-p', 'DOUBLE_EVALUATION', 'TRUE' | |
| 2627 | ],'Test 1411 with double check'). | |
| 2628 | 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.'). | |
| 2629 | cli_testcase(1440, [cbc,disprover], [ | |
| 2630 | '../prob_examples/public_examples/ProofObligations/InconsistenHyp_ctx.pl', | |
| 2631 | '-p', 'DOUBLE_EVALUATION', 'TRUE', '-p', 'STRICT_RAISE_WARNINGS', 'TRUE', | |
| 2632 | '-expcterr', 'disprover_inconsistent_hypotheses' | |
| 2633 | ],'Test 1411 with double check'). | |
| 2634 | cli_testcase(1441, [disprover,s21], [ | |
| 2635 | '../prob_examples/public_examples/ProofObligations/S21/train_0_mch.pl', | |
| 2636 | '-timeout', 500, % sets disprover_timeout | |
| 2637 | '-check_disprover_result', 11,0,24 | |
| 2638 | % [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] | |
| 2639 | ],'S21 proof obligations'). | |
| 2640 | cli_testcase(1442, [disprover,s21], [ | |
| 2641 | '../prob_examples/public_examples/ProofObligations/S21/train_1_mch.pl', | |
| 2642 | '-check_disprover_result', 16,0,27 % changed 8th January 2018, was 15,0,28, after improved propagation for function application; see test 1885 | |
| 2643 | ],'S21 proof obligations'). | |
| 2644 | cli_testcase(1443, [disprover,s21], [ | |
| 2645 | '../prob_examples/public_examples/ProofObligations/S21/train_2_mch.pl', | |
| 2646 | '-check_disprover_result', 0,0,6 | |
| 2647 | ],'S21 proof obligations'). | |
| 2648 | cli_testcase(1444, [disprover,s21], [ | |
| 2649 | '../prob_examples/public_examples/ProofObligations/S21/train_3_mch.pl', | |
| 2650 | '-check_disprover_result', 11,0,0, | |
| 2651 | '-expcterr', 'disprover_inconsistent_hypotheses' | |
| 2652 | ],'S21 proof obligations'). | |
| 2653 | cli_testcase(1445, [disprover,s21], [ | |
| 2654 | '../prob_examples/public_examples/ProofObligations/S21/train_4_mch.pl', | |
| 2655 | '-check_disprover_result', 1,0,0, | |
| 2656 | '-expcterr', 'disprover_inconsistent_hypotheses' | |
| 2657 | ],'S21 proof obligations'). | |
| 2658 | cli_testcase(1446, [disprover,s21], [ | |
| 2659 | '../prob_examples/public_examples/ProofObligations/S21/train_5_mch.pl', | |
| 2660 | '-check_disprover_result', 79,0,0, | |
| 2661 | '-expcterr', 'disprover_inconsistent_hypotheses' | |
| 2662 | ],'S21 proof obligations'). | |
| 2663 | cli_testcase(1447, [disprover,s21], [ | |
| 2664 | '../prob_examples/public_examples/ProofObligations/S21/train_ctx0_ctx.pl', | |
| 2665 | '-check_disprover_result', 1,10,6, | |
| 2666 | % proven: [axm10/WD] | |
| 2667 | % disproven: [axm2/THM,axm3/THM,axm4/THM,axm5/THM,axm6/THM,axm7/THM,axm8/THM,axm11/THM,axm10/THM,axm9/THM] | |
| 2668 | '-timeout', 2000 % timeout per PO | |
| 2669 | ],'S21 proof obligations'). | |
| 2670 | cli_testcase(1448, [disprover,s21], [ | |
| 2671 | '../prob_examples/public_examples/ProofObligations/S21/train_ctx1_ctx.pl', | |
| 2672 | '-check_disprover_result', 1,0,2 | |
| 2673 | ],'S21 proof obligations'). | |
| 2674 | cli_testcase(1449, [disprover,s21], [ | |
| 2675 | '../prob_examples/public_examples/ProofObligations/S21/train_ctx2_ctx.pl', | |
| 2676 | '-check_disprover_result', 7,0,0, | |
| 2677 | '-expcterr', 'disprover_inconsistent_hypotheses' | |
| 2678 | ],'S21 proof obligations'). | |
| 2679 | cli_testcase(1450, [disprover,s21], [ | |
| 2680 | '../prob_examples/public_examples/ProofObligations/S21/train_ctx5_ctx.pl', | |
| 2681 | '-check_disprover_result', 0,0,0 | |
| 2682 | ],'S21 proof obligations'). | |
| 2683 | cli_testcase(1451, [cbc,atelierb,chr], ['../prob_examples/examples/B/Alstom/DisproverProject/TrueContradiction.mch', | |
| 2684 | '-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2685 | '-cbc_assertions', '-cbc_option', contradiction_check, '-cbc_option', tautology_check , '-cbc_option', unsat_core, | |
| 2686 | '-cbc_result_file', '../prob_examples/examples/B/Alstom/DisproverProject/ProB_Result.txt', | |
| 2687 | '-strict', '-expcterr', contradiction_in_hypotheses], 'Test Atelier-B Disprover interface'). | |
| 2688 | cli_testcase(1452, [disprover], [ | |
| 2689 | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Cylinders_mch.pl', | |
| 2690 | '-timeout', 2500, % sets disprover_timeout | |
| 2691 | '-check_disprover_result', 37,0,0 | |
| 2692 | ],'ABZ Mammar Laleau - requires exists expansion'). | |
| 2693 | cli_testcase(1453, [disprover], [ | |
| 2694 | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Gears_mch.pl', | |
| 2695 | %'../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Doors_mch.pl', | |
| 2696 | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/GearsIntermediateStates_mch.pl', | |
| 2697 | '../prob_examples/public_examples/ProofObligations/Mammar_Laleau_ABZ/Failures_mch.pl' % requires good reification of partial_function test | |
| 2698 | ],'ABZ Mammar Laleau POs should all be proven, test closure reification'). | |
| 2699 | cli_testcase(1454, [disprover,cbc], ['-p','SMT','TRUE', | |
| 2700 | '-evalf', 'not(handler_ind : dom({FALSE |-> d,TRUE |-> c}) &{FALSE |-> a,TRUE |-> b} : BOOL +-> INTEGER) & handler_ind : BOOL & d:INTEGER', % other small test | |
| 2701 | '-evalf', 'not(handler_ind : dom({FALSE |-> d,TRUE |-> c}) &{FALSE |-> a,TRUE |-> b} : BOOL --> INTEGER) & handler_ind : BOOL & d:INTEGER', % other small test | |
| 2702 | '-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 | |
| 2703 | '-evalf', 'not(f <+ {po |-> {TRUE |-> currentTime + 12,FALSE |-> 16}(po)} : BOOL +-> NATURAL) & f : BOOL +-> NATURAL & currentTime>0', % this checks not_partial_function improvement | |
| 2704 | '-evalf', 'not(BOOL * {currentTime + 4} : BOOL --> NATURAL) & currentTime >0' % this checks not_subset improvement for not_total_function | |
| 2705 | ],'Check reification of x:NATURAL and choice point in not_total_function and not_partial_function'). | |
| 2706 | cli_testcase(1455, [cbc,atelierb,disprover], ['-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2707 | '-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))' | |
| 2708 | ], 'Test splitting of existential quantifier'). | |
| 2709 | % some laws also checked in CHR+DISPROVER mode: | |
| 2710 | cli_testcase(1456, [laws,rel_fnc,cbc,disprover], ['../prob_examples/public_examples/B/Laws/ExplicitComputations.mch', '-t', '-mc', '100000', '-nodead', '-c', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '9000', | |
| 2711 | '-p', 'DISPROVER_MODE', 'TRUE'], 'Many explicit computations which check that all operators work as expected on various concrete data (CLPFD+DISPROVER mode).'). | |
| 2712 | cli_testcase(1457, [laws,chr], ['../prob_examples/public_examples/B/Laws/BoolLaws.mch', '-mc', '100000', '-nodead', '-c', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', | |
| 2713 | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE'], 'Various laws about BOOL datatype and boolean connectives.'). | |
| 2714 | cli_testcase(1458, [laws,chr], ['../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', '-mc', '100000', '-c', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', | |
| 2715 | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE'], 'Various arithmetic laws.'). | |
| 2716 | cli_testcase(1459, [laws,chr], ['../prob_examples/public_examples/B/Laws/NatRangeLaws.mch', '-mc', '100000', '-c', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', | |
| 2717 | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE'], 'Laws about intervals etc.'). | |
| 2718 | cli_testcase(1460, [laws,rel_fnc,chr], ['../prob_examples/public_examples/B/Laws/RelLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', | |
| 2719 | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Use model checking to check a variety of laws on relations.'). | |
| 2720 | cli_testcase(1461, [laws,chr], ['../prob_examples/public_examples/B/Laws/SetLaws.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'FALSE', | |
| 2721 | '-p', 'DISPROVER_MODE', 'TRUE', '-p', 'CHR', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Mathematical Laws about Sets'). | |
| 2722 | cli_testcase(1462, [cbc,atelierb,disprover], ['-p', 'CHR', 'TRUE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 2723 | '-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)', | |
| 2724 | '-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} ' | |
| 2725 | ], 'Test improved treatment of function overwrite'). | |
| 2726 | cli_testcase(1463, [disprover], [ | |
| 2727 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel2/m6_mch.pl', | |
| 2728 | '-timeout', 600, % sets disprover_timeout | |
| 2729 | '-check_disprover_result', 102,0,1 | |
| 2730 | ],'Requires function overwrite + better sharing of negated preds'). | |
| 2731 | cli_testcase(1464, [cbc,cse, cse_test,sigma], [ '-p', 'CSE', 'TRUE', | |
| 2732 | '-evalf', 'x+y >100 & x+y <99', | |
| 2733 | '-evalt', '(x+y)+(x+y)=(x+y)', | |
| 2734 | '-evalt', '((x+y)+z)*(x+y)+((x+z)+y) + (x+z) = 0', | |
| 2735 | '-evalt', '!x.(x:NATURAL &x+z<10 => x+z<11) & z=2', | |
| 2736 | '-evalt', 'SIGMA(x).(x:NATURAL &x+z<4 | x+z)=5 & z=2', | |
| 2737 | '-evalt', 'PI(x).(x:NATURAL &x+z<4 | x+z)=6 & z=2', | |
| 2738 | '-evalt', '(z>1 => #x.(x:NATURAL &x+z<10 & x+z<11)) & z=2', | |
| 2739 | '-evalt', '%(x).(x:NATURAL1 &x+z<4 | x+z)=[3] & z=2', | |
| 2740 | '-evalt', '{x,r | x:NATURAL1 &x+z<4 & r= x+z}=[3] & z=2', | |
| 2741 | '-evalt', '{v|v+(x+x) : 0..10 & v:0..5 & v+(x+x) < 3}={0} & x+x : 0..4', | |
| 2742 | '-evalt', 'f:BOOL +-> 0..10 & (f/={} => f(TRUE)>5) & (FALSE:dom(f)=> f(TRUE)>5)', | |
| 2743 | '-evalt', 'f:BOOL +-> 0..10 & (f/={} => f(TRUE)>5) <=> b=TRUE & (FALSE:dom(f)=> f(TRUE)>5) <=> b=FALSE', | |
| 2744 | '-evalt', 'f:1..3+->1..3 & (x:dom(f) => #r.(r=f(x) & r>2 & r<10))<=>b=TRUE & x:3..4 & f={}', | |
| 2745 | '-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', | |
| 2746 | '-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)' | |
| 2747 | ], 'Some simple CSE tests'). | |
| 2748 | ||
| 2749 | cli_testcase(1465,[cse, cse_test],['-p', 'CSE', 'TRUE', '-p', 'MAXINT', 127, '-p', 'MININT', -128, | |
| 2750 | ||
| 2751 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-MemoryLoad_SP_55.prob', | |
| 2752 | '-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/qsee-TransmitMemoryDumpOk21_SP_6.prob' | |
| 2753 | % ,'-evalt_file', '../prob_examples/examples/Setlog/prob-ttf/plavis-TransData_SP_13.prob' %% does not work yet | |
| 2754 | ], 'Test from 1003'). | |
| 2755 | cli_testcase(1466,[cse,tickets], ['-p', 'CSE', 'TRUE', | |
| 2756 | '../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m3_act0_inv2_as_b.mch', | |
| 2757 | '-init' | |
| 2758 | ], 'Test WD issue does not prevent from finding solution'). | |
| 2759 | ||
| 2760 | cli_testcase(1467, [disprover,pacemaker], [ | |
| 2761 | '../prob_examples/examples/ProofObligations/Pacemaker_1_15March2011/M0_AOO_mch.pl', | |
| 2762 | '-check_disprover_result', 27,0,1 | |
| 2763 | ],'Pacemaker proof obligations'). | |
| 2764 | 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.'). | |
| 2765 | 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.'). | |
| 2766 | 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.'). | |
| 2767 | 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.'). | |
| 2768 | 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.'). | |
| 2769 | 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).'). | |
| 2770 | 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.'). | |
| 2771 | 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).'). | |
| 2772 | 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.'). | |
| 2773 | 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).'). | |
| 2774 | cli_testcase(1478, [cbc,cse, cse_test,sigma], [ '-p', 'CSE', 'FALSE', '-p', 'SMT', 'TRUE', | |
| 2775 | '-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)' | |
| 2776 | ], 'Test new FDSET collection for function application'). | |
| 2777 | 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).'). | |
| 2778 | 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).'). | |
| 2779 | 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.'). | |
| 2780 | 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.'). | |
| 2781 | cli_testcase(1483, [laws,sequences], ['../prob_examples/public_examples/B/Laws/SeqLaws.mch', '-mc', '500', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE'], 'Laws about sequences'). | |
| 2782 | cli_testcase(1484, [cbc,tickets], [ | |
| 2783 | '-evalt', 'res=x*x+4*x+14', | |
| 2784 | '-evalt', 'x*x+4*x+14=res' | |
| 2785 | ], 'Check no CLPFD overflow'). | |
| 2786 | cli_testcase(1485, [tickets], [ | |
| 2787 | '-evalt', 'x = -(x) & y={x,2} & z={x,3}', | |
| 2788 | '-evalt', 'x = -v & v=2+w & w=10 & y={x,2} & z={x,3}' | |
| 2789 | ], 'Check no error in predicate partitioning and equality replacement'). | |
| 2790 | cli_testcase(1486, [b_test,override], ['-t', '-strict', '../prob_examples/public_examples/B/FeatureChecks/OverrideRelationAssignment.mch'], 'Check function override assignment works for relation'). | |
| 2791 | cli_testcase(1487, [records,cbc], [ | |
| 2792 | '-evalf', 'r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', | |
| 2793 | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', | |
| 2794 | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2 & s:struct(f1:15..20,f2:1..100) & s=r' | |
| 2795 | ], 'A few REPL tests with records'). | |
| 2796 | cli_testcase(1488, [cbc], [ | |
| 2797 | '-evalf', 'A /= {} & A <<: {x} & x:INTEGER', % NotSubsetoOfSingleton | |
| 2798 | '-evalf', '{(x,y)} <: R & x /: dom(R) & R : INTEGER <-> INTEGER', % SingletonNotSubsetRel | |
| 2799 | '-evalf', 'X /\\ Y = Z & X = {} & Z /= {} & X<:INTEGER', % dinters(X,Y,Z) & X = {} & Z neq {} --> false | |
| 2800 | '-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 {} | |
| 2801 | '-evalf', 'R:INTEGER<->INTEGER & R /= {} & dom(R)=D & D <<: {X}', % DomNotSubsetOfSingleton % is_rel(R) & R neq {} & dom(R,D) & ssubset(D,{X}) | |
| 2802 | '-evalf', 'R:INTEGER<->INTEGER & R /= {} & dom(R)=D & A=D & A <| R=Q & R /\\ Q = {}', % DresCapEqual | |
| 2803 | '-evalf', 'R:INTEGER<->INTEGER & R /= {} & dom(R)=D & A=D & A <| R = {}', % DresEqual | |
| 2804 | '-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 | |
| 2805 | % This does not work R:INTEGER<->INTEGER & dom(R)=D & X /: D & dom({(X,Y),B,B2}) = DS & D=DS & Y:INTEGER | |
| 2806 | '-p', 'CLPFD', 'TRUE' | |
| 2807 | ], 'Check that ProB can handle Setlog TTF filtering rules'). | |
| 2808 | cli_testcase(1489, [b_test,proz],['../prob_examples/examples/Z/Cristia/birthdayBook/zspec.fuzz', '-t', '-p', 'DEFAULT_SETSIZE', 3, '-strict'],'ProZ test (new Init/init schema detection)'). | |
| 2809 | cli_testcase(1490, [cbc_tests,cbc,proz],['../prob_examples/examples/Z/Cristia/birthdayBook/zspec.fuzz', | |
| 2810 | '-cbc_tests', 2 ,'', '', '-cbc_cover_all'],'Check that we can cover all events'). | |
| 2811 | cli_testcase(1491, [eventb_test,infinite,override], ['../prob_examples/public_examples/EventBPrologPackages/FeatureTests/InfiniteChanges_mch.eventb', '-t'], 'Test that we can override infinite functions.'). | |
| 2812 | cli_testcase(1492, [tickets,alstom,random], ['../prob_examples/examples/B/Alstom/ixl_Apr_2015/scheduler_i.mch', '-animate', 10, '-p', 'CLPFD', 'FALSE', | |
| 2813 | '-p', 'TIME_OUT', 6000, | |
| 2814 | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE'], 'Test that random enumeration works without CLPFD.'). | |
| 2815 | 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.'). | |
| 2816 | 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.'). | |
| 2817 | 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).'). | |
| 2818 | 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.'). | |
| 2819 | 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.'). | |
| 2820 | cli_testcase(1498, [cbc,queens,card], [ | |
| 2821 | '-evalt', '{x| x:1..3 -->> 5..7 & x(2)=6} = {{(1|->5),(2|->6),(3|->7)},{(1|->7),(2|->6),(3|->5)}}', | |
| 2822 | '-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)}}', | |
| 2823 | '-evalt', '{x| x:1..3 -->> 5..8 & x(2)>x(3)}={}', | |
| 2824 | '-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))', | |
| 2825 | '-evalt', '{x| x:1..3 +->> 5..7 & x(2)=6} = {{(1|->5),(2|->6),(3|->7)},{(1|->7),(2|->6),(3|->5)}}', | |
| 2826 | '-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)}}', | |
| 2827 | '-evalt', '{x| x:1..3 +->> 5..8 & x(2)>x(3)}={}', | |
| 2828 | '-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))', | |
| 2829 | '-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 | |
| 2830 | ], 'Check -->> / +->> optimization works correctly (test new treatment to treat like >-> when domain card = range card; now also >->>)'). | |
| 2831 | cli_testcase(1499, [cbc,cse], ['../prob_examples/public_examples/B/Special/ConstrainedBasedChecking/mesiSet.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc', '-p', 'CSE', 'TRUE'], 'Test 402 with CSE enabled; nonvar types occur'). | |
| 2832 | cli_testcase(1500, [cse], ['../prob_examples/public_examples/B/PerformanceTests/CommonSubexpressions/Sequence_CSE_Test2.mch', '-mc', '1002', '-nodead', '-bf', '-hash64', 25104873554326101, '-p', 'CSE', 'TRUE'], 'Test CSE with Sequence Substitutions'). | |
| 2833 | cli_testcase(1501, [cse], ['../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'). | |
| 2834 | cli_testcase(1502, [cse], ['../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'). | |
| 2835 | cli_testcase(1503, [cse], ['../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'). | |
| 2836 | cli_testcase(1504, [cse], ['../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'). | |
| 2837 | cli_testcase(1505, [smt_solver_integration], [ | |
| 2838 | '-evalt', ':z3 x = 1', | |
| 2839 | '-evalf', ':z3 x = 1 & x > 2' | |
| 2840 | %'-evalt', ':cvc4 x = 1', | |
| 2841 | %'-evalf', ':cvc4 x = 1 & x > 2' | |
| 2842 | ], 'some simple constraints that should be solved by cvc4 / z3'). | |
| 2843 | cli_testcase(1506, [smt_solver_integration], [ | |
| 2844 | '-evalt', ':z3 r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', | |
| 2845 | '-evalf', ':z3 r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', | |
| 2846 | '-evalt', ':z3 r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2 & s:struct(f1:15..20,f2:1..100) & s=r', | |
| 2847 | '-evalt', ':z3 v1:struct(lderb:{TRUE},mspue:{FALSE},fhhxr:{TRUE})' | |
| 2848 | %'-evalt', ':cvc4 r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', | |
| 2849 | %'-evalf', ':cvc4 r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', | |
| 2850 | %'-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', | |
| 2851 | %'-evalt', ':cvc4 v1:struct(lderb:{TRUE},mspue:{FALSE},fhhxr:{TRUE})' | |
| 2852 | ], 'records support by smt solvers'). | |
| 2853 | %cli_testcase(1507, [smt_solver_integration], [ | |
| 2854 | % '-evalt', ':cvc4 test = \"asdfasdfasdF\"' | |
| 2855 | % ], 'string support by smt solvers'). | |
| 2856 | cli_testcase(1508, [smt_solver_integration], [ | |
| 2857 | '-evalf', ':z3 x>0 & x+1 <= p & x=p', | |
| 2858 | '-evalf', ':z3 x>0 & x+2 <= p & x=p', | |
| 2859 | '-evalf', ':z3 not(Pace_Int - sp >= 0) & (sp > 0 & sp < Pace_Int)' % taken from pacemaker disprover testcase | |
| 2860 | %'-evalf', ':cvc x>0 & x+1 <= p & x=p', | |
| 2861 | %'-evalf', ':cvc x>0 & x+2 <= p & x=p', | |
| 2862 | %'-evalf', ':cvc not(Pace_Int - sp >= 0) & (sp > 0 & sp < Pace_Int)' % taken from pacemaker disprover testcase | |
| 2863 | ], 'check that smt solvers would be able to replace the chr code in some cases'). | |
| 2864 | cli_testcase(1509, [smt_solver_integration], [ | |
| 2865 | '-evalt', ':z3 {x} <: {999}', | |
| 2866 | '-evalt', ':z3 {x} <: {999,1000} & x > 999', | |
| 2867 | '-evalt', ':z3 x = {1,2} /\\ {3,4}', | |
| 2868 | '-evalt', ':z3 x={(1,2),(3,4),(4,5),(6,7),(8,9)} & y|->v : x & y|->w : x' | |
| 2869 | %'-evalt', ':cvc4 {x} <: {999}', | |
| 2870 | %'-evalt', ':cvc4 {x} <: {999,1000} & x > 999', | |
| 2871 | %'-evalt', ':cvc4 x={(1,2),(3,4),(4,5),(6,7),(8,9)} & y|->v : x & y|->w : x' | |
| 2872 | ], 'simple set constraints for smt solvers'). | |
| 2873 | cli_testcase(1510, [smt_solver_integration], [ | |
| 2874 | '-evalt', ':z3 x : {1,2} --> NAT', | |
| 2875 | '-evalf', ':z3 x : {1,2} --> NAT & x = {(1,1)}', | |
| 2876 | '-evalt', ':z3 x : {1,2} --> NAT & x = {(1,1),(2,1)}' | |
| 2877 | ], 'functions for z3 (in theory supported by cvc4, but often unknown)'). | |
| 2878 | cli_testcase(1511, [smt_solver_integration], [ | |
| 2879 | '-evalf', ':z3 s = min({1}) & s=2', | |
| 2880 | '-evalf', ':z3 s = min({1,2}) & s>2' | |
| 2881 | %'-evalf', ':cvc s = min({1}) & s=2', | |
| 2882 | %'-evalf', ':cvc s = min({1,2}) & s>2' | |
| 2883 | ], 'check that smt solvers can falsify min / max'). | |
| 2884 | cli_testcase(1512, [cse, ltl], ['../prob_examples/public_examples/B/LTL/Fairness/TestingFairness.mch', | |
| 2885 | '-p', 'CSE', 'TRUE', '-p', 'CSE_SUBST', 'TRUE', | |
| 2886 | '-ltlformulat', true, '-ltlformulat', 'G{1=1}', | |
| 2887 | '-ctlformulat', 'AG{1=1}', '-ctlformulaf', 'EF{1=2}', | |
| 2888 | %'-ltlformulaf', false, % does not work ! | |
| 2889 | '-ltlformulaf', 'G{1=2}', '-strict'], 'Test 1244 with CSE_SUBST, checks top-level PRE detected inside lazy_let_subst.'). | |
| 2890 | cli_testcase(1513, [smt_solver_integration], [ | |
| 2891 | '-evalt', ':z3 x=dom({(1,2)})' | |
| 2892 | ], 'domain and range computation using z3'). | |
| 2893 | cli_testcase(1514, [cse,case],['../prob_examples/examples/B/Satpathy/Teletext104/Teletext104_deterministic.mch', '-t', | |
| 2894 | '-p', 'CSE', 'TRUE', '-p', 'CSE_SUBST', 'TRUE' | |
| 2895 | ],'Test 1292 with CSE_SUBST: Check this relatively large machine works.'). | |
| 2896 | cli_testcase(1515, [cse], [ | |
| 2897 | '-p', 'CSE', 'TRUE', '-p', 'CSE_SUBST', 'TRUE', | |
| 2898 | '-evalt', '(x>1 => 10/x>2) & #v.(v:10..20 & (x>2 => 10/x=v))' | |
| 2899 | ], 'check that no pending co-routines or wd problem'). | |
| 2900 | cli_testcase(1516, [smt_solver_integration], [ | |
| 2901 | '-evalf', ':z3 x = {(1,5),(2,6),(3,7)} & i = x[{1,2}] & 7:i', | |
| 2902 | '-evalt', ':z3 x = {(1,5),(2,6),(3,7)} & i = x[{1,2}]' | |
| 2903 | ], 'check that smt solvers can falsify image (at least z3 can)'). | |
| 2904 | cli_testcase(1517, [smt_solver_integration], [ | |
| 2905 | '-evalf', ':z3 x = 1 .. 4 & z = x /\\ 5 ..3 & z /= {}', | |
| 2906 | %'-evalf', ':cvc x = 1 .. 4 & z = x /\\ 5 ..3 & z /= {}', | |
| 2907 | '-evalt', ':z3 x = 1 .. 4 & z = x /\\ 5 .. 3' | |
| 2908 | %'-evalt', ':cvc x = 1 .. 4 & z = x /\\ 5 .. 3' removed for now | |
| 2909 | ], 'intervals for smt solvers'). | |
| 2910 | cli_testcase(1518, [cbc], [ | |
| 2911 | '-evalt', 'x = %i.(i:1..10|i+i) & x[{j}]={8}', | |
| 2912 | '-evalt', 'ran({x,j|x = {1|->2,2|->4, 4|->8, 5|->8} & x[{j}]={8}})=4..5', | |
| 2913 | '-evalt', 'ran({x,j|x = {1|->2,23|->4, 44|->8, 55|->8} & x[{j}]={8}})={44,55}', | |
| 2914 | '-evalt', 'x = %i.(i:1001..1100|i+i) & x[{j}]={2100}', | |
| 2915 | '-evalt', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,10}', | |
| 2916 | '-evalf', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,11}' | |
| 2917 | ], 'check that we propagate/instantiate for image'). | |
| 2918 | cli_testcase(1519, [b_test,external,records,strings], ['../prob_examples/public_examples/B/ExternalFunctions/LibraryStrings.mch', | |
| 2919 | '-evalt', '{rec(sa:"1.101"),rec(sa:"1.102")} =x & x<: (struct(sa : {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))', | |
| 2920 | '-evalf', '{rec(sa:"1.101"),rec(sa:"1.102.3")} =x & x<: (struct(sa : {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))' | |
| 2921 | ], 'Check that no infinite expansion occurs here.'). | |
| 2922 | cli_testcase(1520, [b_test,unicode,atelierb], | |
| 2923 | ['../prob_examples/public_examples/B/Tickets/UnicodeSupport/t1_2_atelierb.mch', '-t' | |
| 2924 | ],'Test Atelier-B unicode support.'). | |
| 2925 | cli_testcase(1521, [b_test,external,records,infinite], | |
| 2926 | ['../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/SymbolicSubArg.mch', | |
| 2927 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', % test also passes without this | |
| 2928 | '-assertions' | |
| 2929 | ], 'Check that no infinite expansion occurs here.'). | |
| 2930 | cli_testcase(1522, [b_test,external,records,infinite], | |
| 2931 | ['../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/SymbolicSubArg.mch', | |
| 2932 | '../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/NonSymbolicSubArg.mch', | |
| 2933 | '../prob_examples/public_examples/B/Tickets/SymbolicSubArgs/NonSymbolicSubArgDEF.mch', | |
| 2934 | '-assertions' | |
| 2935 | ], 'Like test 1521, but a few virtual time outs occur for NonSymbolic files.'). | |
| 2936 | cli_testcase(1523, [smt_solver_integration], [ | |
| 2937 | '-evalt', ':z3 x = %i.(i:1..10|i+i) & x[{j}]={8}', | |
| 2938 | '-evalt', ':z3 x = %i.(i:1..10|i+i) & x[{5,j}]={16,10}', | |
| 2939 | '-evalf', ':z3 x = %i.(i:1..10|i+i) & x[{5,j}]={16,11}' | |
| 2940 | ], 'parts of test 1518 using smt solvers'). | |
| 2941 | cli_testcase(1524, [tickets,'PROB-381'], [ | |
| 2942 | '../prob_examples/public_examples/B/Tickets/PROB-381/DuplicateFieldInRecord.mch', | |
| 2943 | '../prob_examples/public_examples/B/Tickets/PROB-381/DuplicateFieldInRecordType.mch', '-init', | |
| 2944 | '-expcterr', 'type_error', '-expcterr', 'load_main_file'], 'Check multiple use of record field detected. (Ticket PROB-381)'). | |
| 2945 | cli_testcase(1525, [cbc], [ | |
| 2946 | '-evalf', 'x:S & y:S & y/:T & S<:NATURAL & T=S' | |
| 2947 | ], 'ensure above is detected FALSE wo enum warning; requires better reification for FD equality'). | |
| 2948 | cli_testcase(1526, [cbc], [ | |
| 2949 | '-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 /= {}', | |
| 2950 | '-evalt', 'f = %x.(x:1..9|x+1) \\/ {10|->8} & x = f[x] & x /= {}', | |
| 2951 | '-evalt', 'f = %x.(x:1..n|x+1) \\/ {n+1|->8} & x = f[x] & x /= {} & n=10' | |
| 2952 | ], 'ensure above solved without enum warning (better propagation for image)'). | |
| 2953 | cli_testcase(1527, [smt_solver_integration], [ | |
| 2954 | '-evalt', ':z3 x:1..400 & y:1..400 & f: 280..290 --> 290..299 & x|->y :f & y|->x :f' | |
| 2955 | ], 'check that a model with a complicated representation can be translated back from z3 to prob'). | |
| 2956 | cli_testcase(1528, [cbc], [ | |
| 2957 | '-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)', | |
| 2958 | '-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)', | |
| 2959 | '-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)', | |
| 2960 | '-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'). | |
| 2961 | cli_testcase(1529, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', | |
| 2962 | '-csp_assertion', 'MAIN |= LTL: \"G ([b.blue.blue] => X [c.blue.blue])\"', | |
| 2963 | '-csp_assertion', 'MAIN |= LTL: \"G ([i.2] => X [j.3])\"', | |
| 2964 | '-csp_assertion', 'MAIN |= LTL: \"G ([a.red] => X e(b.red._))\"', | |
| 2965 | '-csp_assertion', 'MAIN |= CTL: \"EGAF e(a.red)\"' , '-strict' | |
| 2966 | ], 'Check LTL and CTL assertions (all are satisfied by the MAIN process).'). | |
| 2967 | cli_testcase(1530, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', | |
| 2968 | '-csp_assertion', 'MAIN |= LTL: \"G ([i.2] => X [j.4])\"', '-expcterr', model_check_fails, '-strict' | |
| 2969 | ], 'Check LTL assertion (check should fail).'). | |
| 2970 | cli_testcase(1531, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', | |
| 2971 | '-csp_assertion', 'MAIN |= CTL: \"AGAF e(a.red)\"', '-strict' | |
| 2972 | ], 'Check CTL assertion (check should not fail).'). | |
| 2973 | cli_testcase(1532, [cbc], ['../prob_examples/public_examples/B/Tickets/FiveWayTraffic/FiveWay_new_mch.eventb', | |
| 2974 | '-mc', 1000, '-strict','-cc', '29', '65', '--hash64', 971801032035978952 | |
| 2975 | ], 'Check no time-out for setup-constants (relational image for singleton set).'). | |
| 2976 | cli_testcase(1533, [cbc,disprover], [ | |
| 2977 | '../prob_examples/public_examples/B/Tickets/FiveWayTraffic/TwoWay_mch.pl', | |
| 2978 | '../prob_examples/public_examples/B/Tickets/FiveWayTraffic/Traffic_Context2_prob_ctx.pl' | |
| 2979 | %, '../prob_examples/public_examples/B/Tickets/FiveWayTraffic/FiveWay_new_prob_mch.pl' % requires higher-timeout | |
| 2980 | ],'Check Disprover can prove all POs'). | |
| 2981 | cli_testcase(1534, [cbc,union,card], [ | |
| 2982 | '-evalt', 'card({x,y| { x \\/ y } <: {{1} \\/ {2}}}) = 9' % { x \/ y } <: {{1} \/ {2}} from Grieskamp Zeta paper | |
| 2983 | ], 'check set comprehenion can be computed without enum warning (union constraint propagation)'). | |
| 2984 | cli_testcase(1535, [cbc,card], [ | |
| 2985 | '-evalt', '{x,y| x = {1,2} & x \\/ y = {1,2,3} & 1:y } = {({1,2}|->{1,3}),({1,2}|->{1,2,3})}' | |
| 2986 | ,'-evalt', 'card({x,y| x<:1..3 & y<:1..3 & ( x \\/ y) = (1..3) }) = 27' | |
| 2987 | ,'-evalt', 'card({x,y| { x \\/ y } <: {{1} \\/ {2} \\/ {3}} }) = 27' | |
| 2988 | ,'-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})}' | |
| 2989 | ,'-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})}' | |
| 2990 | ,'-evalt', 'card({x,y| x \\/ y = 1..5 }) = 243' | |
| 2991 | ], 'Check kernel bug in add_element and copy_list_skeleton fixed'). | |
| 2992 | cli_testcase(1536, [cbc], [ | |
| 2993 | '-evalt', 'sqr = %x.(x>=0|x*x) & (sqr)[{xx}] = {2500}' | |
| 2994 | , '-evalt', 'sqr = %x.(x>=0&x<52|x*x) & (sqr)[{xx}] = {2500}' | |
| 2995 | , '-evalt', 'sqr = %x.(x>=0|x*x) & (sqr)[{xx,vv}] = {2500}' | |
| 2996 | ], 'check no enum warning (image propagation)'). | |
| 2997 | cli_testcase(1537, [ticket,fuzzer,laws], [ | |
| 2998 | '-evalf', 'x:0..5 & (-2) ** x = (8)' | |
| 2999 | , '-evalt', 'x:0..5 & (-2) ** x = -8' | |
| 3000 | , '-evalt', '{x|x>0 & (-2) ** x = -8} = {3}' | |
| 3001 | , '-evalf', 'x:0..3 & (-1) ** x = (-46)' | |
| 3002 | , '-evalf', 'x:-18..-11 & -1 ** x = -46' | |
| 3003 | , '-evalt', '{x|x:0..5 & (-1) ** x = -1} = {1,3,5}' | |
| 3004 | , '-evalt', '{x|x:0..5 & (-1) ** x = 1} = {0,2,4}' | |
| 3005 | , '-evalt', '{x|x:0..5 & (1) ** x = 1} = 0..5' | |
| 3006 | % , '-evalf', 'x=2 & x**y <1 & y>0' % check propagation | |
| 3007 | , '-evalf', 'x**1 /= x' % check propagation | |
| 3008 | , '-evalf', 'x**0 /= 1' % check propagation | |
| 3009 | , '-evalf', '1**x /= 1 & x>0' % check propagation | |
| 3010 | ], 'check no instantiation error when base is 1 or -1'). | |
| 3011 | cli_testcase(1538, [kodkod], [ | |
| 3012 | '-evalt', ':kodkod 2+3=x' % check no warning because nothing for kodkod to solve | |
| 3013 | ,'-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 | |
| 3014 | ], 'check no warning and :kodkod works'). | |
| 3015 | cli_testcase(1539, [laws,tla],['../prob_examples/public_examples/TLC/Laws/NegDivision.tla', '-mc', 1000, '-strict'], 'Test that the division semantics of TLA preserved.'). | |
| 3016 | cli_testcase(1540, [laws,proz,sequences],['../prob_examples/public_examples/Z/ZLive/IntegerTests.fuzz', | |
| 3017 | '../prob_examples/public_examples/Z/ZLive/SetTests.fuzz', | |
| 3018 | '../prob_examples/public_examples/Z/ZLive/SequenceTests.fuzz', | |
| 3019 | '../prob_examples/public_examples/Z/ZLive/RelationTests.fuzz', | |
| 3020 | '../prob_examples/public_examples/Z/ZLive/FreeTypeTests.fuzz', | |
| 3021 | '../prob_examples/public_examples/Z/ZLive/MiscTests.fuzz', | |
| 3022 | '../prob_examples/public_examples/Z/ZLive/LetTests.fuzz', | |
| 3023 | '-mc', 1000, '-nodead', '-strict'], 'Test Integer Z laws and that the division semantics of Z is preserved.'). | |
| 3024 | cli_testcase(1541, [cbc], [ | |
| 3025 | '-evalt', '2 : ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', | |
| 3026 | '-evalt', '-2 /: ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', | |
| 3027 | '-evalt', '1 /: ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', | |
| 3028 | '-evalt', '-10..1 /\\ ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)}) = {}', | |
| 3029 | '-evalt', '-10..10 /\\ ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)}) = 2..10', | |
| 3030 | '-evalf', '-2 : ran({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', | |
| 3031 | '-evalt', '2:ran({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 & z<10)})', | |
| 3032 | '-evalt', '22:ran({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1)})', | |
| 3033 | '-evalt', '1/:ran({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 )})', | |
| 3034 | '-evalt', '1 : dom({y|y : INTEGER * INTEGER & #(x).(y = x |-> x + 2 & x : NATURAL)})', | |
| 3035 | '-evalt', '(TRUE,TRUE):dom({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 )})', | |
| 3036 | '-evalf', '(TRUE,FALSE):dom({x|x:BOOL*BOOL*INTEGER & #(b,z).( x = (b,b,z) & z>1 )})' | |
| 3037 | ],'ensure proper symbolic treatment for domain/range'). | |
| 3038 | cli_testcase(1542, [cbc], [ | |
| 3039 | '-evalf', '{x|x>100 & x mod 102 = 2} = {}', | |
| 3040 | '-evalf', '%x.(x>100 & x mod 102 = 2|x*x) = {}', | |
| 3041 | '-evalt', '{x|x>100 & x mod 102 = 2} /\\ {x| x<100 & x mod 102 =2} = {}', | |
| 3042 | '-evalt', '%x.(x>100 & x mod 102 = 2|x*x) /= {}', | |
| 3043 | '-evalt', '{x|x>100 & x mod 102 = 2} /= {}', | |
| 3044 | '-evalt', '{x|x*x < i & x>2} ={} & i>2', | |
| 3045 | '-evalt', '{x|x*x < i & x>2} /= {} & i>9', | |
| 3046 | '-evalt', '{x|x<20} /= {}', | |
| 3047 | '-evalf', '{x|x<20} = {}' | |
| 3048 | ], 'symbolic treatment of closure emptiness'). | |
| 3049 | cli_testcase(1543, [tickets], | |
| 3050 | ['../prob_examples/public_examples/B/Tickets/Beauger2/bug_not_labels_corrected.mch', '-aa', 0,3,0, | |
| 3051 | '-ppf', '../prob_examples/public_examples/B/Tickets/Beauger2/bug_not_labels_corrected_ppf.mch' | |
| 3052 | ], 'Check that labels correctly assigned.'). | |
| 3053 | cli_testcase(1544, [b_test,trees],['../prob_examples/public_examples/B/Tester/TreeExample.mch', | |
| 3054 | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-assertions', '-init', '-strict'], 'Test that the Atelier-B tree operators supported.'). | |
| 3055 | cli_testcase(1545, [laws], ['../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', | |
| 3056 | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', | |
| 3057 | '-mc', '100000', '-c', '-nodead', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', | |
| 3058 | '-p', 'NORMALIZE_AST', 'TRUE'], 'Various arithmetic laws with AST Normalization.'). | |
| 3059 | cli_testcase(1546, [cbc,trees,sequences], [ | |
| 3060 | '-evalt', '{si|si : dom((%u.(u : seq(INTEGER)|[1] ^ u) ; {[1] |-> 33,[1,2] |-> 55})) & si/=[]} = {[2]}', | |
| 3061 | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3062 | '-evalt', 'arity({[]|->22,[1]|->33,[1,1]|->44,[1,2]|->55},[1])=2' | |
| 3063 | ], 'ensure proper constraint solving/propagation for sequence concatenation'). | |
| 3064 | cli_testcase(1547, [laws,trees,sequences], ['../prob_examples/public_examples/B/Laws/TreeLaws.mch', | |
| 3065 | '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-mc', '100', '-nogoal', '-nodead', '-strict', '-p', 'CLPFD', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Laws about trees'). | |
| 3066 | 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.'). | |
| 3067 | 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'], ''). | |
| 3068 | cli_testcase(1550, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3069 | '-evalt', 'not((y > 0 & y * y > 20) <=> (y * y > 25 & y > 0))', | |
| 3070 | '-evalf', 'not((y > 0 & y * y > 20) <=> (y * y > 21 & y > 0))' | |
| 3071 | ], 'test constraint solving for <=>'). | |
| 3072 | cli_testcase(1551, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3073 | '-evalt', '{b|[a,b,c](2)=333} =res & a : res & b:res' | |
| 3074 | ], 'test constraint solving and compilation of closures (apply sequence extension)'). | |
| 3075 | cli_testcase(1552, [cbc,trees], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3076 | '-evalt', 'a = {(1, {([]|->2)} ), (2, const(1, [a(1)]))}', | |
| 3077 | '-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})}', | |
| 3078 | '-evalt', 'a : 1..2 --> tree({1,2}) & a = {(2, bin(2)), (1, const(1, [a(2)]))}' | |
| 3079 | ], 'test constraint solving and compilation of closures (function application)'). | |
| 3080 | cli_testcase(1553, [csp_test], [ | |
| 3081 | '../prob_examples/public_examples/CSP/Tickets/Ivo/RenamedSymbol.csp', '-assertions', '-strict'], | |
| 3082 | ''). | |
| 3083 | cli_testcase(1554, [tickets,while],['../prob_examples/public_examples/B/Tickets/Hansen18_While/Loop.mch', | |
| 3084 | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopBy2.mch', | |
| 3085 | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopByDouble.mch', | |
| 3086 | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopByTwiceSeqComp.mch', | |
| 3087 | '../prob_examples/public_examples/B/Tickets/Hansen18_While/LoopByClash.mch', | |
| 3088 | '-t', '-mc', 100, '-strict'], | |
| 3089 | 'Check compilation of operation calls inside while loop.'). | |
| 3090 | cli_testcase(1555, [tickets,cbc,slot,trees],[ | |
| 3091 | '../prob_examples/public_examples/B/Tickets/Schneider2_Trees/NewSolver_v2.mch', | |
| 3092 | '../prob_examples/public_examples/B/Tickets/Schneider2_Trees/NewSolver_v3.mch', | |
| 3093 | '-evalt', 'CHOOSE_MODULES("bk-phi-H-2013", solution)'], 'Test constraint solving with trees'). | |
| 3094 | cli_testcase(1556, [cbc],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3095 | '../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_PowBool_ctx.eventb', | |
| 3096 | '../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_FiniteInt_ctx.eventb', '-v', | |
| 3097 | '-cbc_assertion', 'Gesetze:assoc1', '-cbc_assertion', 'Gesetze:assoc2', | |
| 3098 | '-cbc_assertion', 'Gesetze:comm1', '-cbc_assertion', 'Gesetze:comm2', | |
| 3099 | '-cbc_assertion', 'Gesetze:DeMorgan1', '-cbc_assertion', 'Gesetze:DeMorgan2', | |
| 3100 | '-p', 'PROOF_INFO', 'FALSE'], 'Test cbc assertion with label works'). | |
| 3101 | cli_testcase(1557, [laws],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3102 | '../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_Bool_ctx.eventb', | |
| 3103 | '../prob_examples/public_examples/EventBPrologPackages/Laws/KuratowskiPairDefinition_Enum_ctx.eventb', | |
| 3104 | %'../prob_examples/public_examples/EventBPrologPackages/Laws/KuratowskiPairDefinition_Int_ctx.eventb', | |
| 3105 | %'../prob_examples/public_examples/EventBPrologPackages/Laws/Mengen_Gesetze_PowBool_ctx.eventb', % tales 24 seconds | |
| 3106 | '-cbc_assertions', '-p', 'PROOF_INFO', 'FALSE'], 'Test laws over sets using cbc'). | |
| 3107 | cli_testcase(1558, [cbc,card],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3108 | '-evalt', 'f: 1..40 --> BOOL & card({x|x|->TRUE:((1..40)*BOOL) & x|->TRUE :f}) : 10..11', % did not work before | |
| 3109 | '-evalt', 'f: 1..40 --> BOOL & card({x|x:1..40 & x|->TRUE :f}) : 10..11' | |
| 3110 | ], 'Test reification of closure for cardinality'). | |
| 3111 | cli_testcase(1559, [cbc,tickets,card],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3112 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/EinsteinPuzzle/UnsatCore_einstein_ctx_v2.mch', '-init', | |
| 3113 | '-evalt', 't: Menschen >-> Getraenke & Daene |-> Tee : t', | |
| 3114 | '-evalt', 't: Menschen -->> Getraenke & Daene |-> Tee : t', | |
| 3115 | '-evalt', 't: Menschen --> Getraenke & Daene |-> Tee : t', | |
| 3116 | '-evalt', 't: Menschen >->> Getraenke & Daene |-> Tee : t' | |
| 3117 | ], 'Test reification of closure for cardinality'). | |
| 3118 | cli_testcase(1560, [cbc,card], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3119 | '-evalf', 'n>=0 & n1>0 & {n1} \\/ {n} = r & r={n} & not(n1=n)', | |
| 3120 | '-evalf', '{n} /<: {n,n1} & n:INTEGER', | |
| 3121 | '-evalf', '0..B <: 1..B & B:1..1000000', | |
| 3122 | '-evalf', '0..x <: 1..1000 & x>0', | |
| 3123 | '-evalt', '{x|x>0} <: NATURAL1', | |
| 3124 | '-evalf', 'x:seq1(0..1) & x:seq1(2..3)', | |
| 3125 | '-evalt', 'a..b = {x} & x:100..1002', | |
| 3126 | '-evalt', 'x <: (1..100000000 \\/ {-1}) & x={}', | |
| 3127 | '-evalt', 'card(iseq1(1 .. 3) \\/ {{}}) = 16', | |
| 3128 | '-evalt', 'bool(!x.(x<:1..10 => card(x) <11))', | |
| 3129 | '-evalt', 'r:INTEGER<->INTEGER & dom(r)=1..4', | |
| 3130 | '-evalt', 'r:INTEGER<->INTEGER & ran(r)=2..20 & dom(r) = 1..10', | |
| 3131 | '-evalf', '{x|x>20} = {1,y,5,x,4}', | |
| 3132 | '-evalf', '{x|x>20} = y & 1:y', | |
| 3133 | '-evalt', '{x|x>20} = y & 21:y', | |
| 3134 | '-evalf', '2..b = {1,y,5,x,4}', | |
| 3135 | '-evalt', '{X| X /\\ {1} = {} & X \\/ {1} = 1..20} = {2..20}', | |
| 3136 | '-evalt', 'a..b = {x} & x:100..1002', | |
| 3137 | '-eval', '{x|[1,2,3,4,5,6] |>> {x} = [1,2,3,4,5]}', | |
| 3138 | '-eval', '{x|[33] |>> {x} = []}', | |
| 3139 | '-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' | |
| 3140 | ], 'test a few constraints from the ProB-TO-DO-List'). | |
| 3141 | cli_testcase(1561, [cbc], [ | |
| 3142 | '-evalf', 'not(#x.(x>100))', | |
| 3143 | '-evalt', '1..b = {1,y,5,x,4}', | |
| 3144 | '-evalt', 'a..b = {1,y,5,x,4}' | |
| 3145 | ], 'test a few constraints from the ProB-TO-DO-List (with enum warning)'). | |
| 3146 | cli_testcase(1562, [slot,trees,parser,card],[ | |
| 3147 | '../prob_examples/public_examples/B/Tickets/Schneider5_Trees/Solver.mch', | |
| 3148 | '-p', 'TIME_OUT', 35000, | |
| 3149 | '-evalt', '%(x).(x : dom(course_module_combinations) & card(course_module_combinations(x)) > 0|1)={("bk-phi-H-2013"|->1)}', | |
| 3150 | '-evalt', '%(x).(x : dom(course_module_combinations) & course_module_combinations(x) /= {} |1)={("bk-phi-H-2013"|->1)}' | |
| 3151 | % '-evalt', '%(x).(x : dom(course_module_combinations) & card(course_module_combinations(x)) > 1|1)={("bk-phi-H-2013"|->1)}' % still causes problem | |
| 3152 | ], 'Test no complicated set-unification with backtracking'). | |
| 3153 | cli_testcase(1563, [parser,tickets], [ | |
| 3154 | '../prob_examples/public_examples/B/Tickets/CommentsOneLine/OneLineComments.mch', '-t' | |
| 3155 | ], 'Test parser can deal with one line comments'). | |
| 3156 | cli_testcase(1564, [kodkod], [ | |
| 3157 | '-evalf', 'x:0..3 & y:0..3 & (x*y)+7<0', | |
| 3158 | '-evalf', ':kodkod x:0..3 & y:0..3 & (x*y)+7<0' | |
| 3159 | ], 'Test Kodkod bug fixed'). | |
| 3160 | cli_testcase(1565, [fairness], [ | |
| 3161 | '../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.'). | |
| 3162 | cli_testcase(1566, [fairness], [ | |
| 3163 | '../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.'). | |
| 3164 | cli_testcase(1567, [fairness], [ | |
| 3165 | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs2.mch', '-ltlformula', 'SEF => F {addr = 4 or addr = 5}', '-strict'], 'Testing the fairness algorithm.'). | |
| 3166 | cli_testcase(1568, [fairness], [ | |
| 3167 | '../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.'). | |
| 3168 | cli_testcase(1569, [fairness], [ | |
| 3169 | '../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.'). | |
| 3170 | cli_testcase(1570, [fairness], [ | |
| 3171 | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs3.mch', '-ltlformula', 'WEF => F { addr = 8}', '-expcterr', 'ltl', '-strict'], 'Test finding the right fairness loop.'). | |
| 3172 | cli_testcase(1571, [fairness], [ | |
| 3173 | '../prob_examples/public_examples/B/LTL/Fairness/RecursiveSCCs3.mch', '-ltlformula', 'SEF => F { addr = 8}', '-strict'], 'Testing the fairness checking algorithm.'). | |
| 3174 | cli_testcase(1572, [fairness], [ | |
| 3175 | '../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.'). | |
| 3176 | cli_testcase(1573, [fairness], [ | |
| 3177 | '../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.'). | |
| 3178 | cli_testcase(1574, [chr,card], ['-p', 'CHR', 'TRUE', '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3179 | '-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)}', | |
| 3180 | '-evalt', '{x,y|x..y <: 11..18 & card(x..y)=5 & x<y} = {(11|->15),(12|->16),(13|->17),(14|->18)}' | |
| 3181 | ], 'Test CHR interval propagation'). | |
| 3182 | cli_testcase(1575, [external, b_test], [ | |
| 3183 | '../prob_examples/public_examples/B/ExternalFunctions/CSV_Reader.mch', | |
| 3184 | '../prob_examples/public_examples/B/ExternalFunctions/CSV/ChemicalElements.mch', '-t'], 'test CSV reader.'). | |
| 3185 | cli_testcase(1576, [chr], ['-p', 'CHR', 'TRUE', | |
| 3186 | '-evalt', 'x+y=100 & x>y', | |
| 3187 | '-evalt', 'x=100-y & x>y' | |
| 3188 | ], 'Test stronger CHR IDL propagation'). | |
| 3189 | cli_testcase(1577, [cbc,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3190 | '-evalt', 'x = NATURAL1 \\/ -3..-1 & 11:x & -3:x & 0 /: x', | |
| 3191 | '-evalt', '-3..-1 \\/ NATURAL1 = x & 11:x & -3:x & 0 /: x', | |
| 3192 | '-evalt', 'x = NATURAL1 \\/ {-1} & 11:x & -1:x & 0 /: x', | |
| 3193 | '-evalt', 'x = NATURAL1 \\/ {-1,-3} & 11:x & -1:x & -3:x & 0 /: x', | |
| 3194 | '-evalt', 'x = {-1,-33} \\/ NATURAL1 & 11:x & -1:x & -33:x & 0 /: x' | |
| 3195 | ], 'Test better symbolic treatment of union'). | |
| 3196 | cli_testcase(1578, [cbc,bmc], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-bmc', 5, | |
| 3197 | '-expcterr', 'invariant_violation'], 'Check error found using bmc'). | |
| 3198 | cli_testcase(1579, [cbc,bmc], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v3.mch', '-bmc', 10, | |
| 3199 | '-expcterr', 'invariant_violation'], 'Check error found using bmc'). | |
| 3200 | cli_testcase(1580, [symbolic_model_checker], [ | |
| 3201 | '../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v1.mch', | |
| 3202 | %'../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', % fails with SICStus 4.5; fd_degree behaves differently | |
| 3203 | '-symbolic_model_check', 'bmc', | |
| 3204 | '-p', 'TRACE_INFO', 'TRUE', | |
| 3205 | '-expcterr', 'invariant_violation'], 'Check error found using BMC'). | |
| 3206 | cli_testcase(1582, [symbolic_model_checker], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-symbolic_model_check', 'ic3', | |
| 3207 | '-expcterr', 'invariant_violation'], 'Check error found using IC3'). | |
| 3208 | cli_testcase(1583, [symbolic_model_checker], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-symbolic_model_check', 'ctigar', | |
| 3209 | '-expcterr', 'invariant_violation'], 'Check error found using CTIGAR'). | |
| 3210 | cli_testcase(1584, [symbolic_model_checker], [ | |
| 3211 | '../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v1.mch', | |
| 3212 | % '../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', % fails with SICStus 4.5; see test 1580 | |
| 3213 | '-symbolic_model_check', 'bmc', | |
| 3214 | '-expcterr', 'invariant_violation'], 'Check error found using BMC'). | |
| 3215 | cli_testcase(1585, [symbolic_model_checker], ['../prob_examples/public_examples/B/CBC/BinarySearchEvents_Overflow_v2.mch', '-symbolic_model_check', 'kinduction', | |
| 3216 | '-expcterr', 'invariant_violation'], 'Check error found using k-Induction'). | |
| 3217 | cli_testcase(1586, [cbc,wd,error_checks,union], ['-p', 'TRY_FIND_ABORT', 'TRUE', | |
| 3218 | '-eval', 'r = {1|->2, 2|-> 1/0}(1)', | |
| 3219 | '-expcterr', 'well_definedness_error' | |
| 3220 | ], 'Test better symbolic treatment of union'). | |
| 3221 | cli_testcase(1587, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3222 | '-evalt', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..20)', | |
| 3223 | '-evalf', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..21)' | |
| 3224 | ], 'Test inlining of id1=id2 equalities and subsequent detection of identical predicates'). | |
| 3225 | cli_testcase(1588, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3226 | '-evalt', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..20)', | |
| 3227 | '-evalf', 'f: 1..100 --> 10..20 & x:10..20 & f2=f & x2=x+1 & not(f2:1..100 --> 10..20 & x2:11..21)' | |
| 3228 | ], 'Test inlining of id1=id2 equalities and subsequent detection of identical predicates'). | |
| 3229 | cli_testcase(1589, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3230 | '../prob_examples/public_examples/B/Tickets/ForallDomainExpansion/UnsatCore.mch', | |
| 3231 | '-init' | |
| 3232 | ],'Test that forall with domain is expanded'). | |
| 3233 | cli_testcase(1590, [cbc,bmc], [ | |
| 3234 | '../prob_examples/public_examples/B/Tickets/ForallDomainExpansion/binarySearchFail_impl_prob_mch.eventb', | |
| 3235 | '-bmc', 10, '-expcterr', 'invariant_violation' | |
| 3236 | ],'Test that forall with domain is expanded and BMC finds problem'). | |
| 3237 | ||
| 3238 | cli_testcase(1591, [tla,tlc],['../prob_examples/public_examples/B/SymmetryReduction/Peterson.mch', '-mc_with_tlc'], 'TLC regression test'). | |
| 3239 | cli_testcase(1592, [tla,tlc],['../prob_examples/public_examples/B/SymmetryReduction/Peterson_err.mch', '-mc_with_tlc' | |
| 3240 | %, '-expcterr', 'invariant_violation' % currently there is no feedback to probcli about invariant violations found | |
| 3241 | ], 'TLC regression test'). | |
| 3242 | cli_testcase(1593, [puzzles],['../prob_examples/public_examples/B/Puzzles/Bridges.mch', '-init' | |
| 3243 | ], 'Bridges Puzzle'). | |
| 3244 | cli_testcase(1594, [cbc,sigma,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3245 | '-evalt', 'SIGMA(x).(x:M|30) = 3000 & M<:1..100', | |
| 3246 | '-evalt', '{M|SIGMA(x).(x:M|30) = 300 & M<:1..10} = {1..10}', | |
| 3247 | '-evalt', '{M|SIGMA(x).(x:M|30) = 270 & M<:1..10}=res & card(res)=10', | |
| 3248 | % this is slow: {M|SIGMA(x).(x:M|30) = 570 & M<:1..20}=res & card(res)=20; 17 seconds | |
| 3249 | % this does not work: {M|SIGMA(x).(x:M|30) = 3000 & M<:1..100} | |
| 3250 | '-evalt', 'SIGMA(x).(x:M|cp(x)) = 3000 & M=1..100 & cp:M --> {0,15,30}', | |
| 3251 | '-evalt', 'M=1..20 & {cp|SIGMA(x).(x:M|cp(x)) = 570 & cp:M --> {0,30}}=res & card(res)=20', | |
| 3252 | '-evalt', 'M=1..100 & {cp|SIGMA(x).(x:M|cp(x)) = 3000 & cp:M --> {0,15,30}}=res & card(res)=1', | |
| 3253 | '-evalt', 'PI(x).(x:{-1} \\/ 1..20|x) = -2432902008176640000', | |
| 3254 | '-evalt', 'PI(x).(x:M|20) = 400 & M<:1..10', | |
| 3255 | '-evalf', 'SIGMA(x).(x:M|20) = 50 & M<:1..10', | |
| 3256 | '-evalf', 'PI(x).(x:M|20) = 500 & M<:1..10' | |
| 3257 | ], 'Test SIGMA and PI'). | |
| 3258 | cli_testcase(1595, [tickets,eventb_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3259 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/TheoremInGuards/TestM1_mch.eventb', | |
| 3260 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/TheoremInGuards/VM_1_mch.eventb', | |
| 3261 | '-t', '-mc', 100 ], 'Test theorem in guards can use dropped abstract variables'). | |
| 3262 | cli_testcase(1596, [tickets,eventb_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3263 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/TheoremInGuards/TestM1_error_mch.eventb', | |
| 3264 | '-mc', 100, '-expcterr', 'event_error:teste:invalid_theorem_in_guard' | |
| 3265 | ], 'Test theorem in guards can use dropped abstract variables and error found'). | |
| 3266 | cli_testcase(1597, [tickets,tla],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3267 | '../prob_examples/public_examples/B/Tickets/ExistsEnumeration/MC_AlternatingBit_Internal.mch', | |
| 3268 | '-t', '-mc', 500 , '-expcterr', 'model_check_incomplete'], 'Test no problem with LoseAck action and existential quantifier'). | |
| 3269 | cli_testcase(1598, [tickets,tla],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3270 | '../prob_examples/public_examples/TLA/TLA_Distribution/FIFO/MCInnerFIFO.mch', '-scope', 'card(q)<=qLen', | |
| 3271 | '-p', 'MAX_INITIALISATIONS', 40, | |
| 3272 | '-mc', 6000, '-cc', 5810, 9661 , '--hash64', 523977694511884201], 'Test SCOPE works correctly'). | |
| 3273 | cli_testcase(1599, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3274 | '-expcterr', 'bmachine_static_checks', | |
| 3275 | '../prob_examples/public_examples/B/Tester/ExistentialGlobalSetIDTest.mch', '-mc', '1000', | |
| 3276 | '-evalt', '#(ID).( cc /: ID & dom({x,y|x=1 & y:ID}) = {})' | |
| 3277 | ], 'Check that local identifier ID does not confuse optimiser'). | |
| 3278 | cli_testcase(1600, [tickets,private,quantified,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3279 | '../prob_examples/examples/B/Tickets/MemoryError_bugly.mch', '-init', '-assertions' | |
| 3280 | ], 'Check that UNION and dom(dom()) memory consumption issue solved'). | |
| 3281 | cli_testcase(1601, [b_test, implementation, refinement], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3282 | '../prob_examples/examples/B/ClearSy/turbomeca/pld_i.imp','-t' | |
| 3283 | ], 'Check implementation machine'). | |
| 3284 | cli_testcase(1602, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3285 | '../prob_examples/public_examples/B/SchneiderBook/Chapter17/Array.mch','-t' | |
| 3286 | ], 'Check Schneider example'). | |
| 3287 | cli_testcase(1603, [alstom,private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3288 | '../prob_examples/examples/B/Alstom/exemple7.mch', | |
| 3289 | '../prob_examples/examples/B/Alstom/exemple7_occuper_zone.mch', | |
| 3290 | '-t' | |
| 3291 | ], 'Check Alstom machines'). | |
| 3292 | cli_testcase(1604, [eventb_test,private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3293 | '../prob_examples/examples/RodinModels/PaulSimon/ca_m01_mch.eventb', | |
| 3294 | '-p', 'MAX_INITIALISATIONS', '30', '-p', 'MAX_OPERATIONS', '30', | |
| 3295 | '-p', 'DEFAULT_SETSIZE', '3', | |
| 3296 | '-t' | |
| 3297 | ], 'Check Paul Simon complicated EventB machine'). | |
| 3298 | cli_testcase(1605, [cbc, infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3299 | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER --> {0}', | |
| 3300 | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> {0}', | |
| 3301 | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> {u}', | |
| 3302 | '-evalt', 'f = %x.(x:INTEGER|0) & {u|f : INTEGER +-> {u}} = {0}', | |
| 3303 | '-evalt', 'f = %x.(x:INTEGER|0) & {u|f : INTEGER --> {u}} = {0}', | |
| 3304 | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> NATURAL', | |
| 3305 | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER --> NATURAL', | |
| 3306 | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> 0..2', | |
| 3307 | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> 1..2', | |
| 3308 | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER --> 1..2', | |
| 3309 | '-evalt', 'f = %x.(x:INTEGER|1000) & f : INTEGER +-> 999..1002', | |
| 3310 | '-evalt', 'f = %x.(x:INTEGER|1000) & f : INTEGER --> 999..1002', | |
| 3311 | '-evalt', 'f = INTEGER*{1000} & f : INTEGER --> 999..1002', | |
| 3312 | '-evalt', 'f = %x.(x:INTEGER|1000) & f = INTEGER*{1000}', | |
| 3313 | '-evalf', 'f = %x.(x:INTEGER|1000) & f = INTEGER*{1001}', | |
| 3314 | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER +-> NATURAL1', | |
| 3315 | '-evalt', 'f = %x.(x:INTEGER|0) & f : INTEGER -->> {0}', | |
| 3316 | '-evalf', 'f = %x.(x:INTEGER|0) & f : INTEGER -->> {0,1}', | |
| 3317 | '-evalt', 'f = %x.(x/=0|1000/x) & f : INTEGER +-> INTEGER & f(500)=2', | |
| 3318 | '-evalf', 'f = %x.(x/=0|1000/x) & f : INTEGER --> INTEGER', | |
| 3319 | '-evalt', '{x|x/=0} = INTEGER \\ {0}', | |
| 3320 | '-evalf', '{x|x/=0} = INTEGER \\ {1}', | |
| 3321 | '-evalf', '{x|x/=0} /= INTEGER \\ {0}', | |
| 3322 | '-evalt', '{x|x/=0} /= INTEGER \\ {1}', | |
| 3323 | '-evalf', '{x|x/=0} = INTEGER', | |
| 3324 | '-evalt', '{x|x/=0} /= INTEGER', | |
| 3325 | '-evalf', 'INTEGER={x|x/=0}', | |
| 3326 | '-evalt', 'INTEGER/={x|x/=0}', | |
| 3327 | '-evalt', '{b|INTEGER={x|x/=0} <=> b=TRUE}={FALSE}', | |
| 3328 | '-evalt', 'NATURAL/={x|x/=0}', | |
| 3329 | '-evalt', 'NATURAL1/={x|x/=0}', | |
| 3330 | '-evalt', '{x|x/=0} /= NATURAL1', | |
| 3331 | '-evalf', '{x|x/=0} = NATURAL' | |
| 3332 | ], 'Check that %x.(x:P|E) is detected as cartesian product closure for dom_range_for_specific_closure'). | |
| 3333 | cli_testcase(1606, [cbc,card], [ | |
| 3334 | '-evalt', 'n=10000000 & x : (1..n) \\ {5000000}', | |
| 3335 | '-evalt', 'x:(1000..a) \\ {b}', | |
| 3336 | '-evalt', 'x: 1000..b /\\ 1500..c', | |
| 3337 | '-evalt', 'x:1000..2000 & x /: b..2000', | |
| 3338 | '-evalt', 'x:(1000..2000) \\ (b..2000)', | |
| 3339 | '-evalt', 'x:(1000..a) \\ (b..a)', | |
| 3340 | '-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)}', | |
| 3341 | '-evalt', 'card({x,y| x:200..295 & y : 101..190 & x /: y..y+100})=4455' | |
| 3342 | ], 'Test symbolic treatment of set-difference membership'). | |
| 3343 | cli_testcase(1607, [tickets], ['../prob_examples/public_examples/B/Tester/TestAnyChoice.mch', | |
| 3344 | '-t', '-strict'], 'Test that definition can be used at top-level of forall quantifier'). | |
| 3345 | cli_testcase(1608, [symmtest,proz,card], ['../prob_examples/public_examples/Z/Daniel/Derrick_ICFEM06.fuzz', '-strict', | |
| 3346 | '-mc', '10000', '-cc', '29', '149' ], 'Test min card inference works.'). | |
| 3347 | cli_testcase(1609, [cbc,tickets], [ '-p', 'MAXINT', 2147483648, | |
| 3348 | '-evalt', 'x : NAT1 +-> {1,2,3} & (n:NAT & 1..n = dom(x)) & x /= {}' | |
| 3349 | ], 'Test that pf does not expand NAT1'). | |
| 3350 | cli_testcase(1610, [cbc,card], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3351 | '-evalt', 'f=[{1},{3},{6,2,4,8},{1,2,3}] & x:1..4 & y=f(x) & card(y)>3', | |
| 3352 | '-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})}' | |
| 3353 | ], 'Test cardinality restriction'). | |
| 3354 | 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' | |
| 3355 | %, '-expcterr', eval_string_enum_warning | |
| 3356 | ], 'Ensure proper enumeration of sequences (CLPFD=TRUE).'). % variation of test 1187 | |
| 3357 | cli_testcase(1612, [eventb_test, theories], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-assertions', | |
| 3358 | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestConcat_ctx.eventb', | |
| 3359 | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestMySequences_ctx_ok.eventb', | |
| 3360 | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestMySequences_ctx_ok2.eventb'], 'Check Sequence Theory Mapping.'). | |
| 3361 | cli_testcase(1613, [eventb_test, theories], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3362 | '-assertions', '-expecterr', 'check_assertions', | |
| 3363 | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/TestMySequences_ctx_err.eventb'], | |
| 3364 | 'Check Sequence Theory Mapping leads to error (due to wrong mapping).'). | |
| 3365 | cli_testcase(1614, [eventb_test, theories], [ '-assertions', | |
| 3366 | '../prob_examples/public_examples/EventBPrologPackages/Theory/Sequences/MySequences_ctx.eventb'], 'Check Sequence Theory in context.'). | |
| 3367 | cli_testcase(1615, [cbc, cbc_tests,bmc], ['../prob_examples/public_examples/B/SymbolicModelChecking/Counters/CounterArticle.mch', '-bmc', 4, | |
| 3368 | '-expcterr', 'invariant_violation'], 'Check BMC works'). | |
| 3369 | 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'). | |
| 3370 | cli_testcase(1617, [bmc,tickets], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3371 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/bmc_unsat_axioms/f_m0.eventb', | |
| 3372 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/bmc_unsat_axioms/f_m1.eventb', | |
| 3373 | '-bmc', 10], 'Check no counter example reported'). | |
| 3374 | cli_testcase(1618, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3375 | '../prob_examples/public_examples/B/Mathematical/ArgumentationAsSets.mch', | |
| 3376 | '../prob_examples/public_examples/EventBPrologPackages/Mathematical/Arguments_Example_ctx.eventb', | |
| 3377 | '-assertions'], 'Check Argumentation Theory example'). | |
| 3378 | cli_testcase(1619, [b_test, infinite,total_function], ['-evalt', 'x mod 100000 >= 99999', | |
| 3379 | '-evalt', 'x : NATURAL --> {1,2,3}', | |
| 3380 | '-evalt', 'x : NATURAL --> {1,2,3} & x(7) = 3', | |
| 3381 | '-evalf', 'x : NATURAL --> {1,2,3} & x(7) = 3 & x(7) = 2', | |
| 3382 | '-evalt', 'not(x : INTEGER --> {1,2})' | |
| 3383 | ], 'Ensure symbolic treatment of (infinite) total functions.'). | |
| 3384 | cli_testcase(1620, [b_test,external,choose], ['../prob_examples/public_examples/B/ExternalFunctions/ChooseExternal.mch', '-assertions'], 'Test choose operator.'). | |
| 3385 | cli_testcase(1621, [b_test,let], [ | |
| 3386 | '../prob_examples/public_examples/B/Tester/LetTest_IllegalCyclic.mch', | |
| 3387 | '../prob_examples/public_examples/B/Tester/LetTest_IllegalNondet.mch', | |
| 3388 | '../prob_examples/public_examples/B/Tester/LetTest_IllegalNotAllDefined.mch', | |
| 3389 | '../prob_examples/public_examples/B/Tester/LetTest_IllegalNotVarLHS.mch', | |
| 3390 | '../prob_examples/public_examples/B/Tester/LetTest_IllegalVar.mch', | |
| 3391 | '-expcterr','type_error', '-expcterr', 'load_main_file'], 'Check illegal LETs detected.'). | |
| 3392 | cli_testcase(1622, [b_test,recursion], ['../prob_examples/public_examples/B/FunctionalProgramming/Factorial_NewSyntax.mch', | |
| 3393 | '../prob_examples/public_examples/B/FunctionalProgramming/SeqNaturalFoldr_NewSyntax.mch', | |
| 3394 | '../prob_examples/public_examples/B/RecursiveFunctions/SortSet_NewSyntax.mch', | |
| 3395 | '-t', '-strict'], 'Test new IF-THEN-ELSE / LET Syntax for expressions.'). | |
| 3396 | cli_testcase(1623, [b_test], [ | |
| 3397 | '-evalf', 'z < first([z]) & 0<z', | |
| 3398 | '-evalf', 'z < first([z])', | |
| 3399 | '-evalf', 'z < last([z]) & 0<z', | |
| 3400 | %'-evalf', 'z < first([z,z]) & 0<z', % currently requires DISPROVER_MODE | |
| 3401 | %'-evalf', 'z < first(v) & v=[z] & 0<z', | |
| 3402 | '-evalf', 'z > first([z]) & z>0' | |
| 3403 | ], 'Ensure ast_cleanup removes first/last.'). | |
| 3404 | cli_testcase(1624, [cbc,card], [ | |
| 3405 | '-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', | |
| 3406 | '-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', | |
| 3407 | '-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', | |
| 3408 | '-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', | |
| 3409 | '-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', | |
| 3410 | % 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 | |
| 3411 | '-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', | |
| 3412 | % '-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 | |
| 3413 | '-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 | |
| 3414 | '-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 !! | |
| 3415 | '-evalt', 's=1..n & x<:s & card(x):15..26 & n/2/:x & n/4/:x & n=40' % another test; not requiring reification | |
| 3416 | ], 'Test cardinality reification propagates through check_finite_card.'). | |
| 3417 | cli_testcase(1625, [cbc,card], [ | |
| 3418 | '-evalt', 'i=2..x & card(i):10..9122110 & x > 9121000'], 'Check card of interval propagates'). | |
| 3419 | cli_testcase(1626, [cbc,records,card], [ | |
| 3420 | '-evalt', '{v|v:0..5 & card({x,y|x|->y:{(2,2),(2,4)} & x+y>v}):2..3}=0..3', | |
| 3421 | '-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)}' | |
| 3422 | ], 'A few card tests; test reification involving records'). | |
| 3423 | cli_testcase(1627, [cbc,card], [ | |
| 3424 | '-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 | |
| 3425 | '-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', | |
| 3426 | '-evalt', 's=1..20 & x: s-->BOOL & card({t|t|->TRUE:x}):18..19', | |
| 3427 | '-evalt', 's=1..20 & x: s-->BOOL & card({t|t|->FALSE:x}):18..19', | |
| 3428 | '-evalt', 's=1..130 & x: s-->BOOL & card({t|t|->TRUE:x}):128..129', | |
| 3429 | '-evalt', 's=1..258 & x: s-->BOOL & card({t|t|->FALSE:x})=card({t|t|->TRUE:x})', | |
| 3430 | '-evalt', 's:1..n --> 1..n & card({x|x|->x:s})=n & n=50', | |
| 3431 | '-evalt', 'card({s,n|s:1..n --> 1..n & card({x|x|->x:s})=n & n=50})=1', % non-linear pattern | |
| 3432 | '-evalt', 's: 1..20 --> (BOOL*(1..20)) & card({x|x|->(TRUE|->x):s})=10 & card({x|x|->(FALSE|->x):s})=10', | |
| 3433 | '-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 | |
| 3434 | '-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 | |
| 3435 | ], 'Check card propagates without need for t:1..20 constraint'). | |
| 3436 | cli_testcase(1628, [cbc,tickets,card], [ | |
| 3437 | '-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', | |
| 3438 | % {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)))) } | |
| 3439 | '-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)})' | |
| 3440 | ], 'A variation of test 34; computing all solutions'). | |
| 3441 | cli_testcase(1629, [cbc,queens,card], | |
| 3442 | ['../prob_examples/public_examples/B/Tickets/CardReify1/MaxQueensNoCheck_v5.mch', | |
| 3443 | '-t', '-mc', 10], 'Check reification of card works with dom of total function'). | |
| 3444 | cli_testcase(1630, [cbc,card], [ | |
| 3445 | '-evalt', 'f:1..20 >->> 1..20 & card({i|i:1..20 & f~(i)=i})=4', %this also worked before | |
| 3446 | '-evalt', 'f:1..20 >->> 1..20 & card({i|i:ran(f) & f~(i)=i})=4' | |
| 3447 | ], 'Check reification of card with range'). | |
| 3448 | cli_testcase(1631, [cbc,card], ['../prob_examples/public_examples/B/Puzzles/Queens/NBishopsSets.mch', '-init'], 'See that ProB can solve this puzzle'). | |
| 3449 | cli_testcase(1632, [cbc,while], ['../prob_examples/public_examples/B/Tickets/Hansen23_WhilePerformance/WhileSlow_CartProduct.mch', '-t', | |
| 3450 | '-p', 'TIME_OUT', 15000 ], % increased time-out for jenkins | |
| 3451 | 'See that performance of while loop with IF with existential quantifier is ok'). | |
| 3452 | cli_testcase(1633, [kodkod], [ | |
| 3453 | '-evalf', ':kodkod args<:{1,2,3,4} & x:args & x<2 & x/=1', | |
| 3454 | '-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), | |
| 3455 | '-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) | |
| 3456 | % '-evalf', ':kodkod args={1,2,3} & atts : args <-> args & dom(atts) = args & x = card(atts)&x < 2' %% TO DO: fix KODKOD | |
| 3457 | ], 'check kodkod integer ranges are correctly computed, prevent regression'). | |
| 3458 | cli_testcase(1634, [b_test,external], [ | |
| 3459 | '../prob_examples/public_examples/B/ExternalFunctions/MAXIMIZE_Test.mch', | |
| 3460 | '../prob_examples/public_examples/B/Puzzles/Queens/MaxQueensNoCheck_MAXIMIZE.mch', | |
| 3461 | '../prob_examples/public_examples/B/Mathematical/Argumentation/Example3_MAXIMIZE.mch', | |
| 3462 | '-assertions'], | |
| 3463 | 'Check MAXIMIZE external function'). | |
| 3464 | cli_testcase(1635, [private,tickets,codespeed], ['../prob_examples/examples/B/Alstom/DataValidationProject/Tickets/Burdy3/Rule_DB_General_0006.mch', '-t', | |
| 3465 | %'-p','SHOW_EVENTB_ANY_VALUES','TRUE', '-p', 'MAX_OPERATIONS', 1000, | |
| 3466 | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-p', 'TIME_OUT', 5000, '-p','CLPFD', 'TRUE' | |
| 3467 | ], | |
| 3468 | 'Codespeed test; test that cartesian product / concat_sequence performance issue fixed'). % AlstomBurdy_Rule6_CLP | |
| 3469 | cli_testcase(1636, [b_test,tickets,wd], [ | |
| 3470 | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour1/rule.mch', | |
| 3471 | '-expcterr', well_definedness_error, | |
| 3472 | '-mc', 10, '-nodead'], | |
| 3473 | 'Check WD error found'). | |
| 3474 | cli_testcase(1637, [b_test,tickets], [ | |
| 3475 | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour2/fonction_totale.mch', | |
| 3476 | '-t', '-expcterr', setup_constants_inconsistent, | |
| 3477 | '-properties', '-expcterr', check_properties], | |
| 3478 | 'Check partial setup constants possible despite inconsistency'). | |
| 3479 | cli_testcase(1638, [b_test,tickets], [ | |
| 3480 | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour2/fonction_totale_v2.mch', | |
| 3481 | '-animate_all', '-expcterr', setup_constants_fails], | |
| 3482 | 'Check inconsistent properties detected by animate_all'). | |
| 3483 | cli_testcase(1639, [b_test], ['-check_java_version'], 'Check check_java_version works'). | |
| 3484 | cli_testcase(1640, [tickets], ['-evalt', '{}/:STRING --> BOOL', | |
| 3485 | '-evalt', '{"ab"|->TRUE }/:STRING --> BOOL', | |
| 3486 | '-evalt', '{"ab"|->TRUE,"ab"|->FALSE }/:STRING --> BOOL', | |
| 3487 | '-evalt', 'not({TRUE|->"STRING2"} : BOOL >+>> STRING)', | |
| 3488 | '-evalt', 'not({TRUE|->"STRING2"} : BOOL +->> STRING)' | |
| 3489 | ], 'Check bug in not_total_function fixed'). | |
| 3490 | cli_testcase(1641, [laws,rel_fnc], ['../prob_examples/public_examples/B/Laws/FunLawsStrings.mch', '-mc', '500', '-c', '-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.'). | |
| 3491 | cli_testcase(1642, [private,tickets,operation_reuse], [ | |
| 3492 | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour3/rule1.mch', | |
| 3493 | '-t', '-p', 'OPERATION_REUSE', 'TRUE', | |
| 3494 | '-expcterr', invariant_violation], | |
| 3495 | 'Check operation reuse problem fixed'). | |
| 3496 | cli_testcase(1643, [b_test,operation_reuse], ['../prob_examples/public_examples/B/Benchmarks/CSM.mch', '-mc', '1000', '-strict', | |
| 3497 | '-p', 'OPERATION_REUSE', 'TRUE','-check_complete', '-cc', '341', '1229'], 'Test 13 with operation reuse'). | |
| 3498 | cli_testcase(1644, [b_test,operation_reuse], ['-p', 'MAXINT', '5', '../prob_examples/public_examples/B/SymmetryReduction/scheduler1.ref', '-mc', '150', '-cc', '145', '447', | |
| 3499 | '-p', 'OPERATION_REUSE', 'TRUE', '-p', 'DEFAULT_SETSIZE', '3', '-p', 'SYMMETRY_MODE', 'off', '-strict'], 'Test 73 with operation reuse'). | |
| 3500 | cli_testcase(1645, [b_test,operation_reuse], ['-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'). | |
| 3501 | cli_testcase(1646, [cbc,operation_reuse], ['../prob_examples/public_examples/B/Tickets/FiveWayTraffic/FiveWay_new_mch.eventb', | |
| 3502 | '-mc', 1000, '-strict','-p', 'OPERATION_REUSE', 'TRUE','-cc', '29', '65', '--hash64', 971801032035978952 | |
| 3503 | ], 'Test 1532 with operation reuse.'). | |
| 3504 | 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).'). | |
| 3505 | 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).'). | |
| 3506 | cli_testcase(1649, [cbc,card], [ | |
| 3507 | '-evalf', 'occupies : Pigeons >-> Holes & Pigeons=1..100 & Holes=1..99', | |
| 3508 | '-evalt', 'occupies : Pigeons >-> Holes & Pigeons=2..100 & Holes=1..99', | |
| 3509 | '-evalt', 'id(NATURAL) : NATURAL >-> NATURAL', % also check infinite functions work | |
| 3510 | '-evalt', 'id(NATURAL1) : NATURAL1 >-> NATURAL1', % also check infinite functions work | |
| 3511 | '-evalt', 'id(NATURAL1) : NATURAL1 >-> NATURAL', | |
| 3512 | '-evalf', 'id(NATURAL1) : NATURAL >-> NATURAL', | |
| 3513 | '-evalf', 'id(NATURAL) : NATURAL1 >-> NATURAL', | |
| 3514 | '-evalf', 'id(NATURAL) : NATURAL >-> NATURAL1', | |
| 3515 | '-evalt', 'id(NATURAL1) /: NATURAL >-> NATURAL' | |
| 3516 | ], 'Ensure card. check for total_injection works'). | |
| 3517 | cli_testcase(1650, [parser,tickets], [ | |
| 3518 | '../prob_examples/public_examples/B/Tester/SyntaxErrors/MissingSemicolon.mch', '-v', | |
| 3519 | '-expcterrpos', parse_error, 13, 2, '-expcterr', 'load_main_file'], | |
| 3520 | 'Check parser correctly reports syntax error and position'). | |
| 3521 | cli_testcase(1651, [b_test,execute], ['../prob_examples/public_examples/B/Simple/UpCounter.mch', '-init','-execute_all', | |
| 3522 | '-animate_stats', '-strict', '-goal', 'c=20', '-p', 'MAXINT', '20'], 'Check -execute_all.'). | |
| 3523 | cli_testcase(1652, [parser,tickets], [ | |
| 3524 | '-eval', '2>1 & & 3>2', | |
| 3525 | '-expcterrpos', parse_machine_predicate_error, 1, 6 ], | |
| 3526 | 'Check parser correctly reports syntax error and position for eval'). | |
| 3527 | cli_testcase(1653, [b_test,tickets], [ | |
| 3528 | '../prob_examples/public_examples/B/Tester/SelectMultipleTrueCases.mch', | |
| 3529 | '-t', '-mc', 100, '-nogoal', '-cc', 4, 10, '--hash64', 357695998652715541 ], | |
| 3530 | 'Select with multiple true branches dealt with'). | |
| 3531 | cli_testcase(1654, [parser,tickets,'PARSERLIB-44'], [ | |
| 3532 | '../prob_examples/public_examples/B/Tickets/PARSERLIB-44/BinPacking_UnicodeMinus.mch', | |
| 3533 | '-init' ], | |
| 3534 | 'Check parser correctly parses unicode minus used for -->'). | |
| 3535 | cli_testcase(1655, [laws,records], ['../prob_examples/public_examples/B/NewSyntax/RecSetLaws.mch', '-mc', '1000', '-nogoal', '-nodead', '-c', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-t', '-expcterr', 'model_check_incomplete'], 'Various laws about records.'). | |
| 3536 | cli_testcase(1656, [tickets,records,private], ['../prob_examples/examples/B/Tickets/record_projection_bugly.mch', '-assertions'], 'Check performance.'). | |
| 3537 | cli_testcase(1657, [eventb_test,tickets,'PROB-351'], [ | |
| 3538 | '../prob_examples/examples/EventBPrologPackages/Advance_WP2/v5_Aug2014/ex_mch.eventb', | |
| 3539 | '-t' ], | |
| 3540 | 'Check COMMS__ComputeLeastCostRoutes efficient (avoiding re-calculation of same assignment; see PROB-351)'). | |
| 3541 | cli_testcase(1658, [parser,tickets], [ | |
| 3542 | '../prob_examples/public_examples/B/Tickets/Hansen25_OpNamingWarning/Naming_VAR.mch', | |
| 3543 | '-expcterrpos', type_error, 5, 6 | |
| 3544 | ], | |
| 3545 | 'Check type checker reports id clash in VAR'). | |
| 3546 | cli_testcase(1659, [parser,tickets], [ | |
| 3547 | '-eval', ' 2 = TRUE', | |
| 3548 | '-expcterrpos', type_expression_error, 1, 7 ], | |
| 3549 | 'Check type checker correctly reports error and position in eval'). | |
| 3550 | cli_testcase(1660, [parser,tickets], [ | |
| 3551 | '../prob_examples/public_examples/B/Tickets/Hansen25_OpNamingWarning/ReadingUninitialisedVar.mch', '-animate', 10, | |
| 3552 | '-expcterrpos', reading_undefined_variable, 6, 12 , '-nodead' ], | |
| 3553 | 'Check interpreter reports unitialised var and that -nodead works for -animate'). | |
| 3554 | cli_testcase(1661, [eventb_test,tickets], [ | |
| 3555 | '../prob_examples/examples/EventBPrologPackages/Advance_WP2/v5_Aug2014/ex_mch.eventb', | |
| 3556 | '-mc', 10 , '-expcterr', 'time_out_for_assertions', '-expcterr', 'model_check_incomplete'], | |
| 3557 | 'Check that virtual-time_out in assertion checking caught'). | |
| 3558 | cli_testcase(1662, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolation.mch', | |
| 3559 | '-csp-guide', '../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolation.csp', | |
| 3560 | '-mc', '1000', '-expcterr', assertion_violation, '-nodead'], 'Test that static assertion violation found'). | |
| 3561 | cli_testcase(1663, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamic.mch', | |
| 3562 | '-csp-guide', '../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamic.csp', | |
| 3563 | '-mc', '1000', '-expcterr', assertion_violation], 'Test that dynamic assertion violation found'). | |
| 3564 | cli_testcase(1664, [b_test,csp_test,cspb], ['../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamic.mch', | |
| 3565 | '-csp-guide', '../prob_examples/public_examples/CSPB/FeatureTests/AssertionViolationDynamicShort.csp', | |
| 3566 | '-mc', '1000', '-nodead'], 'Test that no dynamic assertion violation found'). | |
| 3567 | %cli_testcase(1665, [plugin_units,pragmas], ['../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records.mch', | |
| 3568 | % '-plugin', 'units', '-strict', | |
| 3569 | % '-pp', '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records_internal.mch'], | |
| 3570 | % 'Check that records are supported in unit plugin'). | |
| 3571 | cli_testcase(1666, [kodkod,tickets,random], [ | |
| 3572 | '../prob_examples/public_examples/B/Tickets/BendispostoTutoren/tuts_cando_only.mch', '-init', '-assertions', | |
| 3573 | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-p', 'KODKOD', 'TRUE' ], | |
| 3574 | 'Check that Randomise Enumeration order and Kodkod work together'). | |
| 3575 | cli_testcase(1667, [cbc,tickets,kodkod,random], [ | |
| 3576 | '../prob_examples/public_examples/B/Tickets/BendispostoTutoren/tuts_working.mch', '-init', '-assertions', | |
| 3577 | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-p', 'KODKOD', 'TRUE' ], | |
| 3578 | 'Check that Randomise Enumeration order and Kodkod work together'). | |
| 3579 | cli_testcase(1668, [cbc,random], [ | |
| 3580 | '../prob_examples/public_examples/B/Tickets/BendispostoTutoren/tuts_working.mch', '-init', '-assertions', | |
| 3581 | '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-p', 'KODKOD', 'FALSE' ], | |
| 3582 | 'Check that Randomise Enumeration order and Kodkod work together'). | |
| 3583 | cli_testcase(1669, [tickets,cbc,card], ['-p', 'MAXINT', 3, | |
| 3584 | '-evalt', 'card(perm(NAT))=24', | |
| 3585 | '-evalt', 'perm(NAT) /= {}', | |
| 3586 | '-evalf', 'perm(NAT) = {}', | |
| 3587 | '-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]}', | |
| 3588 | '-evalt', 'perm(NAT) = perm(0..MAXINT)', | |
| 3589 | '-evalt', 'perm(NAT1) = perm(1..MAXINT)', | |
| 3590 | '-evalt', 'card(perm(INT))=120', | |
| 3591 | '-evalt', 'card(iseq(NAT)) = 65' | |
| 3592 | ], | |
| 3593 | 'Check that perm(NAT)={} bug fixed'). | |
| 3594 | cli_testcase(1670, [b_test], ['-t', '-expcterr', trace_checking_fails, | |
| 3595 | '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/SETPREF.mch', '-p', 'MAXINT', '22', '-card', 'ID', '2'], 'check trace checking fails'). | |
| 3596 | cli_testcase(1671, [tickets, 'PARSERLIB-47', parser], ['-t', '--model-check', | |
| 3597 | '../prob_examples/public_examples/B/FeatureChecks/DollarSymbol/ValidMachines/AssignByPredicateWithDEFTransitive.mch', | |
| 3598 | '../prob_examples/public_examples/B/FeatureChecks/DollarSymbol/ValidMachines/AssignByPredicateWithDEF.mch'], | |
| 3599 | 'check $0 can be used within definitions'). | |
| 3600 | cli_testcase(1672, [tickets, 'PARSERLIB-47', parser], [ | |
| 3601 | '../prob_examples/public_examples/B/FeatureChecks/DollarSymbol/ErrorMachines/DollarInInvariant.mch', | |
| 3602 | '-expcterrpos', type_error, 2, 21, '-expcterr', load_main_file], | |
| 3603 | 'check $0 cannot be used in invariant'). | |
| 3604 | cli_testcase(1673, [tickets, parser], [ | |
| 3605 | '../prob_examples/public_examples/B/ErrorMachines/IllegalSeesIncludes/CyclicM1.mch', | |
| 3606 | '-expcterr', parse_error, '-expcterr', load_main_file], | |
| 3607 | 'check cyclic sees detected and does not lead to parser exception'). | |
| 3608 | cli_testcase(1674, [pragmas], ['-init', | |
| 3609 | '../prob_examples/public_examples/B/Pragmas/FilePragma.mch'], | |
| 3610 | 'check @file "Path" pragma works'). | |
| 3611 | 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'). | |
| 3612 | cli_testcase(1676, [b_test,mcm_tests], ['../prob_examples/examples/EventBPrologPackages/Soton/MCM_Tests/FENCEM7_mch.eventb', | |
| 3613 | '-mcm_tests', '10', '4000', '1=1', | |
| 3614 | '../prob_examples/examples/EventBPrologPackages/Soton/MCM_Tests/tests.xml', | |
| 3615 | '-mcm_cover', 'IssueLoad IssueStore ObserveLoadAfterStore', | |
| 3616 | '-p', 'INTERNAL_ARGUMENT_PREFIX', 'p', | |
| 3617 | '-strict'],'State based test generation with internal operation arguments'). | |
| 3618 | cli_testcase(1677, ['PROB-412',tickets,while], [ | |
| 3619 | '../prob_examples/public_examples/B/Tickets/PROB-412/WhileVariantNotDecreased.mch', '-animate', 10, | |
| 3620 | '-expcterr', animate, '-expcterrpos', while_variant_error, 24, 16 ], | |
| 3621 | 'Check variant not decreasing error found and position ok'). | |
| 3622 | cli_testcase(1678, [while,tickets], [ | |
| 3623 | '../prob_examples/public_examples/B/Tickets/Hansen24_WhileSeesBug/While.mch', | |
| 3624 | '../prob_examples/public_examples/B/Tickets/Hansen24_WhileSeesBug/Runner.mch', | |
| 3625 | '-t', '-mc', 1000 ], | |
| 3626 | 'Check bug with while loop compilation because of incorrect read/modifies info (not renamed) fixed'). | |
| 3627 | cli_testcase(1679, [b_test], [ | |
| 3628 | '../prob_examples/public_examples/B/Tester/ParityFunction.mch', | |
| 3629 | '../prob_examples/public_examples/B/Mathematical/Sieve_WithMin.mch', | |
| 3630 | '../prob_examples/public_examples/B/Benchmarks/Chapter13/Booksrr.ref', | |
| 3631 | '../prob_examples/public_examples/B/Benchmarks/Chapter_10/Safes.mch', | |
| 3632 | '-t'], | |
| 3633 | 'A few trace tests from the Tcl/Tk Regression Test suite'). | |
| 3634 | cli_testcase(1680, [b_test], [ | |
| 3635 | '../prob_examples/examples//B/Siemens/TestString.mch', | |
| 3636 | '-expcterr', 'virtual_time_out', | |
| 3637 | '-t'], | |
| 3638 | 'A few trace tests from the Tcl/Tk Regression Test suite'). | |
| 3639 | cli_testcase(1681, [b_test], [ | |
| 3640 | '../prob_examples/examples/B/ClearSy/control/M1.ref', | |
| 3641 | %'../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". | |
| 3642 | '-t'], | |
| 3643 | 'Check no exists body warning'). | |
| 3644 | cli_testcase(1682, [tickets,private], [ | |
| 3645 | '../prob_examples/examples//B/Alstom/ssp/tms_ssp_0004.mch', | |
| 3646 | '-t'], | |
| 3647 | 'Check no time-out'). | |
| 3648 | cli_testcase(1683, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3649 | '-evalt', '(A=TRUE) <=> (X:Y..Z) & Y:1..10 & Z:0..2 & X >12 & (A=FALSE => X:15..16)' | |
| 3650 | ], 'check interval reification'). | |
| 3651 | cli_testcase(1684, [cbc], [ '-p', 'CLPFD', 'FALSE', '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3652 | '-evalt', '(A=TRUE) <=> (X:Y..Z) & Y:1..10 & Z:0..2 & X >12 & (A=FALSE => X:15..16)' | |
| 3653 | ], 'check interval reification'). | |
| 3654 | cli_testcase(1685, [cbc], [ | |
| 3655 | '-evalt', 'NATURAL1 : x & (x = { {22}, {33}} or x={ NATURAL1 })', | |
| 3656 | '-evalf', 'NATURAL1 : x & x = { {22}, {33}}', | |
| 3657 | '-evalt', '{x|x>30 & x mod 3 =0} /\\ {x|x<50 & x mod 2 =0} = {36,42,48}' | |
| 3658 | ], 'a few checks'). | |
| 3659 | ||
| 3660 | cli_testcase(1686, [cbc,laws,finite], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3661 | '-evalt', 'x:FIN(x) & x=POW(POW(1..9))', | |
| 3662 | '-evalf', 'x/:FIN(x) & x=POW(POW(1..9))', | |
| 3663 | '-evalt', 'x:FIN(x) & x=FIN(POW(1..10))', | |
| 3664 | '-evalt', 'x:FIN(x) & x=POW(POW(1..10))', | |
| 3665 | '-evalf', 'x/:FIN(x) & x=POW(POW(1..10))', | |
| 3666 | '-evalt', 'x:FIN(x) & x=POW(POW(POW(1..10)))', | |
| 3667 | '-evalf', 'x:FIN(x) & x=POW(POW(POW(NATURAL1)))', | |
| 3668 | '-evalt', 'x/:FIN(x) & x=POW(POW(POW(NATURAL1)))', | |
| 3669 | '-evalf', 'x:FIN(x) & x=FIN(POW(POW(NATURAL1)))', | |
| 3670 | '-evalt', 'x/:FIN(x) & x=FIN(POW(POW(NATURAL1)))', | |
| 3671 | '-evalf', 'x:FIN(x) & x=FIN(INTEGER)', | |
| 3672 | '-evalt', 'x/:FIN(x) & x=FIN(INTEGER)', | |
| 3673 | '-evalt', 'x/:FIN(x) & x=POW(INTEGER)', | |
| 3674 | '-evalf', 'x:FIN(x) & x = %x.(x:NATURAL1|1)', | |
| 3675 | '-evalt', 'x:FIN(x) & x = %x.(x:POW(POW(1..11))|1)', | |
| 3676 | % '-evalt', 'x/:FIN(x) & x = %x.(x:POW(POW(1..11))|1)', % computes x, time-out | |
| 3677 | '-evalt', 'x:FIN(x) & x = (3..2)*INTEGER', | |
| 3678 | '-evalt', 'x:FIN(x) & x = INTEGER*(3..2)', | |
| 3679 | '-evalf', 'x:FIN(x) & x = INTEGER*(2..3)', | |
| 3680 | '-evalt', 'x:FIN(x) & x = POW(POW(1..10))*(2..3)', | |
| 3681 | '-evalt', 'x:FIN(x) & x = POW(POW(1..11))*(2..3)', | |
| 3682 | '-evalt', 'x:FIN(x) & x = POW(POW(1..11))*{2,4}', | |
| 3683 | '-evalt', 'x:FIN(x) & x = POW(POW(1..11))*(4..3)', | |
| 3684 | '-evalt', 'x:FIN(x) & x = NATURAL1*(4..3)', | |
| 3685 | '-evalf', 'x:FIN(x) & x = NATURAL1*{2,4}', | |
| 3686 | '-evalf', 'x:FIN(x) & x = (1..2)*NATURAL1', | |
| 3687 | '-evalf', 'x:FIN(x) & x = INTEGER*NATURAL1', | |
| 3688 | '-evalt', 'x:FIN(x) & x=iseq(1..10)', | |
| 3689 | '-evalf', 'x:FIN(x) & x=iseq(NATURAL)', | |
| 3690 | '-evalt', 'x:FIN(x) & x=perm(POW(1..9))', | |
| 3691 | '-evalf', 'x:FIN(x) & x= {x|x : INTEGER & x < 3}', | |
| 3692 | '-evalt', 'x:FIN(x) & x=iseq(POW(POW(1..11)))', | |
| 3693 | '-evalt', 'x:FIN(x) & x=iseq1(POW(POW(1..11)))', | |
| 3694 | '-evalf', 'x:FIN(x) & x=seq(POW(POW(1..11)))', | |
| 3695 | '-evalf', 'x:FIN(x) & x=seq1(POW(POW(1..11)))', | |
| 3696 | '-evalt', 'x:FIN(x) & x=seq(4..3)', | |
| 3697 | '-evalt', 'x:FIN(x) & x=seq1(4..3)', | |
| 3698 | '-evalt', 'x:FIN(x) & x=id(POW(POW(1..11)))', | |
| 3699 | '-evalf', 'x:FIN(x) & x=perm(NATURAL)', | |
| 3700 | '-evalt', 'x:FIN(x) & x=perm(POW(POW(1..11)))', | |
| 3701 | '-evalf', 'x/:FIN(x) & x=perm(POW(POW(1..11)))', | |
| 3702 | '-evalt', '{z|z:seq(BOOL) & size(z)<=0} = {[]}' | |
| 3703 | ], 'a few checks about finite'). | |
| 3704 | cli_testcase(1687, [tickets,parser], [ | |
| 3705 | '../prob_examples/public_examples/B/Tickets/Hansen27_NestedMchErr/M1.mch', | |
| 3706 | '-expcterr', load_main_file, '-expcterrpos', parse_error, 2, 5 ], | |
| 3707 | 'Check error found and position ok'). | |
| 3708 | cli_testcase(1688, [cbc,laws,finite], [ '-p', 'DISPROVER_MODE', 'TRUE', | |
| 3709 | '-eval', 'x/:FIN(x) & x=(POW(1..11) +-> POW(1..9))', | |
| 3710 | % '-eval', 'x:FIN(x) & x=perm(POW(1..9))', | |
| 3711 | '-expcterr', 'eval_string_time_out' | |
| 3712 | ], 'a few checks about finite; ideally we want -evalt'). % TO DO: fix this issue | |
| 3713 | cli_testcase(1689, ['PROB-411',tickets,kodkod], [ | |
| 3714 | '-evalf', ':kodkod args={1,2,3} & atts : args <-> args & dom(atts) = args & x = card(atts)&x < 2' | |
| 3715 | ], 'check card interval analysis bug fixed'). | |
| 3716 | cli_testcase(1690, [tickets], [ | |
| 3717 | '../prob_examples/public_examples/B/Tickets/Hansen21_Sees/AllGroups.mch', | |
| 3718 | '-t', '-expcterr', 'invariant_violation' | |
| 3719 | ], 'check sees bug remains fixed'). | |
| 3720 | cli_testcase(1691, [tickets,records], [ | |
| 3721 | '../prob_examples/public_examples/B/Tickets/RecordPartiallyTyped/Knowledge_loop.mch', | |
| 3722 | '-init' | |
| 3723 | ], 'check that record type bug fixed, no type generated: record([field(a,b)|any])'). | |
| 3724 | cli_testcase(1692, [tickets,quantified,union], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3725 | '-evalt', 'UNION(i).(i:1..2|{i|->i}) ^ UNION(j).(j:1..3|{j|->j}) = [1,2,1,2,3]', | |
| 3726 | '-evalt', 'UNION(i).(i:1..2|{i|->i}) ^ {} = [1,2]', | |
| 3727 | '-evalf', 'UNION(i).(i:1..2|{i|->i}) ^ UNION(j).(j:1..3|{j|->j}) = [1,2,3,4,5]' | |
| 3728 | ], 'ensure both UNIONs are translated'). | |
| 3729 | cli_testcase(1693, [tickets,let], [ | |
| 3730 | '-eval', 'i = 20 & (LET i BE i= i+1 IN i END) =res', | |
| 3731 | '-expcterr', type_expression_error | |
| 3732 | ], 'ensure error in nested LET expression detected'). | |
| 3733 | cli_testcase(1694, [tickets,let], [ | |
| 3734 | '-eval', '(LET i,j BE i=i+10 & j=i+20 IN i+j END)', | |
| 3735 | '-expcterr', type_expression_error | |
| 3736 | ], 'ensure error in nested LET expression detected'). | |
| 3737 | cli_testcase(1695, [tickets,let], [ | |
| 3738 | '-eval', '(LET i,j BE j=i+20 & i=10 IN i+j END)', | |
| 3739 | '-expcterr', type_expression_error | |
| 3740 | ], 'ensure error in nested LET expression detected'). | |
| 3741 | cli_testcase(1696, [tickets,let], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3742 | '-evalt', 'i=1 & r=LET i BE i=10 IN LET j BE j=i+20 IN i+j END END & r=40', | |
| 3743 | % '-evalt', 'k = 1..n & n:2..3 & (LET i,j BE i={10}\\/k & j= i \\/ i IN res=i \\/ j END)', | |
| 3744 | % '-evalt', '(LET i,j BE i=10 & j=i+20 IN i+j END) =40', | |
| 3745 | '-evalt', 'i = 100 & (LET i,j BE i={10} & j= 20 IN (LET j BE j=i \\/ i IN i \\/ j END) END) = {10}', | |
| 3746 | '-evalt', 'x=1 & y=2 & #(x,y).(x=30 & y=x+x & res=y+x) & res=90' | |
| 3747 | ], 'ensure nested LET predicate and expression work'). | |
| 3748 | cli_testcase(1697, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3749 | '-evalt', '{y,n|{x|x:1..n} = {y}} = {1|->1}', | |
| 3750 | '-evalt', 'x:{y|y>0 & y mod 100 = 0} & x:{z|z<1000 & z mod 500 = 0}', | |
| 3751 | '-evalt', '{x|x:1..n} = {y}' | |
| 3752 | ], 'check improved set comprehension propagation'). | |
| 3753 | cli_testcase(1698, [cbc], [ | |
| 3754 | '-evalt', 'x:c1 & c1={y|y>0 & y mod 100 = 0} & x:c2 & c2= {z|z<1000 & z mod 500 = 0}', | |
| 3755 | % these now did not work before: | |
| 3756 | '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104}', | |
| 3757 | '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108}', | |
| 3758 | '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108} & n=110', | |
| 3759 | '-evalf', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108,113}' | |
| 3760 | % '-evalf', 'p = {x|x>100 & x<n & x mod 2 =0} & p = {102,104,106,108,112}' % TO DO: does not work yet | |
| 3761 | % '-evalt', 'p = {x|x>100 & x<n & x mod 2 =0} & {102} <: p' % TO DO: nor this | |
| 3762 | ], 'check improved set comprehension propagation'). | |
| 3763 | cli_testcase(1699, [private,csp_test,cspb], ['../prob_examples/examples/CSPB/Treharne/CSPB-SwanseaPlanModel/Interlocking.mch', | |
| 3764 | '-csp-guide', '../prob_examples/examples/CSPB/Treharne/CSPB-SwanseaPlanModel/Ctrl.csp', | |
| 3765 | '-mc', '40', '-bf', '-cc', 148, 687, '--hash64', 906866094249096570, '-expcterr', 'model_check_incomplete'], 'Test CSP||B model'). | |
| 3766 | cli_testcase(1700, [private,csp_test,cspb], ['../prob_examples/public_examples/B/Ivo/BenchmarksFairness/ProB/DPhil/dphil_ltl6.csp', | |
| 3767 | '-mc', '3000', '-bf', '-cc', 1764, 7125, '--hash64', 419761536083491376], 'Test Dining Philosophers state space (CSP normalisation)'). | |
| 3768 | cli_testcase(1701, [csp_test,cspb], ['../prob_examples/public_examples/CSPB/Counter.mch', | |
| 3769 | '-csp-guide', '../prob_examples/public_examples/CSPB/Counter.csp', | |
| 3770 | '-mc', '40', '-bf', '-cc', 15, 15, '--hash64', 987057609118852348], 'Test CSP||B model'). | |
| 3771 | cli_testcase(1702,[cbc,enabling],[ | |
| 3772 | '-enabling_analysis_csv','../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_enabling_analysis.csv', | |
| 3773 | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', | |
| 3774 | '-p', 'TIME_OUT', 5000 | |
| 3775 | ], 'Check CSV output of Cruise Control'). | |
| 3776 | cli_testcase(1703,[cbc,enabling],[ | |
| 3777 | '-enabling_analysis_csv','../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2_enabling_analysis.csv', | |
| 3778 | '../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2.eventb', | |
| 3779 | '-p', 'TIME_OUT', 5000, | |
| 3780 | '-expcterr', well_definedness_error % added 28/5/2018, T2ReleaseBus -> Update, was previously not detected | |
| 3781 | ], 'Check CSV output of CAN Bus Control'). | |
| 3782 | 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'). | |
| 3783 | cli_testcase(1705, [tla,tlc], ['../prob_examples/public_examples/EventBPrologPackages/Tickets/ExportClassicalB/TestLeftAsVar_mch.eventb', | |
| 3784 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/Tester/UseBKeywords.eventb', '-mc_with_tlc'], 'check TLC for Event-B model with classical B keywords'). | |
| 3785 | cli_testcase(1706, [b_test, infinite,total_function], [ | |
| 3786 | '-evalt', 'f : NATURAL --> STRING', | |
| 3787 | '-evalt', 'f : NATURAL --> POW(INTEGER)', | |
| 3788 | '-evalt', 'f : STRING --> {11,22,33} & f("abc")>22 & f("xyz") < 22', | |
| 3789 | '-evalt', 'f : STRING --> STRING & f("abc")="ABC" & f("xyz") = "XYZ"' | |
| 3790 | ], 'Ensure symbolic treatment of (infinite) total functions with complicated range types.'). | |
| 3791 | cli_testcase(1707, [b_test,cruise,operation_reuse,codespeed], ['../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '25696', '-strict', '--hash64', 203058745203935766, '-p', 'MAX_INITIALISATIONS', 5, | |
| 3792 | '-p', 'OPERATION_REUSE', full], 'Complete Model Check of Cruise Controller'). | |
| 3793 | cli_testcase(1708, [private,tickets,operation_reuse], [ | |
| 3794 | '../prob_examples/examples/B/ClearSy/GeneralElectric_DV/Ticket_Coudour3/rule1.mch', | |
| 3795 | '-t', '-p', 'OPERATION_REUSE', 'full', | |
| 3796 | '-expcterr', invariant_violation], | |
| 3797 | 'Check operation reuse problem fixed'). | |
| 3798 | cli_testcase(1709, [b_test,operation_reuse], ['../prob_examples/public_examples/B/Benchmarks/CSM.mch', '-mc', '1000', '-strict', | |
| 3799 | '-p', 'OPERATION_REUSE', 'full','-check_complete', '-cc', '341', '1229'], 'Test 13 with operation reuse'). | |
| 3800 | cli_testcase(1710, [cbc], [ | |
| 3801 | '-evalt', 'x = {1|->2, 2|->3, 3|->4} & r={y|(y,3):x} & r={2}', | |
| 3802 | '-evalt', 'x = {1|->2, 2|->3, 3|->4, 22|->3} & r={y|(y,3):x} & r={2,22}', | |
| 3803 | '-evalt', 'x = {1|->2, 2|->3, 3|->4} & r={y|(y,5):x} & r={}' | |
| 3804 | ], 'Test new compilation of set membership.'). | |
| 3805 | cli_testcase(1711, [tickets], ['../prob_examples/public_examples/B/ErrorMachines/ParseErrors/DefinitionInQuantifier2.mch', | |
| 3806 | '-expcterrpos', type_error, 16, 18, | |
| 3807 | '-expcterrpos', bmachine_construction, 12, 1, '-expcterr', 'load_main_file' | |
| 3808 | ], 'Check illegal DEFINITION args detected'). | |
| 3809 | cli_testcase(1712, [b_test], ['../prob_examples/public_examples/B/Tester/DefGoal.mch', | |
| 3810 | '-execute_all', '-nogoal', '-check_goal' | |
| 3811 | ], 'Check -check_goal works with -execute_all'). | |
| 3812 | cli_testcase(1713, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/TestLibraryMeta.mch', '-model-check', '-strict'], 'Check that external functions on state space work.'). | |
| 3813 | cli_testcase(1714, [cbc], [ | |
| 3814 | '-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 | |
| 3815 | '-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 | |
| 3816 | '-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)}' | |
| 3817 | ], 'Test new clpfd_table module.'). % tests also pass with prior version of ProB | |
| 3818 | cli_testcase(1715, [tickets,codespeed], [ | |
| 3819 | '../prob_examples/examples/B/Alstom/Boucles_Jul11/essai2_boucle1.mch', | |
| 3820 | '-t', '-strict', | |
| 3821 | '-expcterr', 'invariant_violation', | |
| 3822 | '-p', 'MAXINT', 10000000, '-p', 'MININT', -10000000, '-p', 'TIME_OUT', 14000], % increased from 8000 for windows jenkins jobs | |
| 3823 | 'Test performance (codespeed test Alstom_essai2_boucle1) + tests watched-literal function application'). | |
| 3824 | cli_testcase(1716, [tickets,slot,clpfd_tables], ['../prob_examples/public_examples/B/Tickets/SLOT-PERFORMANCE6/Solver_v2.mch', | |
| 3825 | '-p', 'TIME_OUT', 25000, | |
| 3826 | '-init', % '-v', % generates non-ground closure warnings | |
| 3827 | '-evalt', 'CHECK({"BK-GER-H-2013"}, cmcc, choiceUnits, choiceGroups)', % this worked before | |
| 3828 | '-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 | |
| 3829 | '-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 | |
| 3830 | % '-evalt', 'CHECK({"BK-GES-H-2013"}, cmcc, choiceUnits, choiceGroups)' % does not yet work | |
| 3831 | ], 'Ensure no time-out and that new element/3 constraint for function application and table constraint work'). | |
| 3832 | cli_testcase(1717, [cbc,clpfd_tables], [ | |
| 3833 | '-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', | |
| 3834 | '-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', | |
| 3835 | '-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', | |
| 3836 | '-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', | |
| 3837 | '-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' | |
| 3838 | ], 'Exercise new element/3 function application treatment'). | |
| 3839 | cli_testcase(1718, [cbc], ['../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', 'floor=40', '-check_goal'], 'Check cbc_sequence for longer sequence'). | |
| 3840 | cli_testcase(1719, [smt_solver_integration], [ | |
| 3841 | '-p','SMT_SUPPORTED_INTERPRETER','TRUE', | |
| 3842 | '-evalt', 'x = 1', | |
| 3843 | '-evalf', 'x = 1 & x > 2', | |
| 3844 | '-evalf', 'x>y & y>x', | |
| 3845 | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2', | |
| 3846 | '-evalf', 'r:struct(f1:11..20,f2:12..20) & r\'f1+10 = r\'f2', | |
| 3847 | '-evalt', 'r:struct(f1:11..20,f2:12..30) & r\'f1+10 = r\'f2 & s:struct(f1:15..20,f2:1..100) & s=r', | |
| 3848 | '-evalt', 'v1:struct(lderb:{TRUE},mspue:{FALSE},fhhxr:{TRUE})', | |
| 3849 | '-evalf', 'x>0 & x+2 <= p & x=p', | |
| 3850 | % '-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 | |
| 3851 | '-evalt', '{x} <: {999}', | |
| 3852 | '-evalt', '{x} <: {999,1000} & x > 999', | |
| 3853 | '-evalt', 'x = {1,2} /\\ {3,4}', | |
| 3854 | '-evalt', 'x = {(1,2),(3,4),(4,5),(6,7),(8,9)} & y|->v : x & y|->w : x', | |
| 3855 | '-evalt', 'x : {1,2} --> NAT', | |
| 3856 | '-evalf', 'x : {1,2} --> NAT & x = {(1,1)}', | |
| 3857 | '-evalt', 'x : {1,2} --> NAT & x = {(1,1),(2,1)}', | |
| 3858 | '-evalf', 's = min({1}) & s=2', | |
| 3859 | '-evalf', 's = min({1,2}) & s>2', | |
| 3860 | '-evalt', 'x = %i.(i:1..10|i+i) & x[{j}]={8}', | |
| 3861 | '-evalt', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,10}', | |
| 3862 | '-evalf', 'x = %i.(i:1..10|i+i) & x[{5,j}]={16,11}', | |
| 3863 | '-evalt', 'x:1..10 & #y.(y:1..10 & y>x) & #y.(y:1..10 & y<x)' | |
| 3864 | ], 'some constraints that should be solved by the integrated ProB / SMT solver'). | |
| 3865 | cli_testcase(1720, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3866 | '-evalt', '{x|x:1..n} = {y,y+1}', | |
| 3867 | '-evalt', '1..n = {y,y+1}', | |
| 3868 | '-evalt', '1..n = r & r={y,y+1}', | |
| 3869 | '-evalt', '{n,y|#r.(1001..n = r & r={y,y+1})} = {(1002,1001)}', | |
| 3870 | '-evalf', '1001..n = r & r={y,y+2}', | |
| 3871 | '-evalt', '1001..n = {y,y+2,y+1} & n<20000' % TO DO: get rid of necessity for n<20000 | |
| 3872 | ], 'test improved constraint propagation for in_interval and frozen_dif'). | |
| 3873 | cli_testcase(1721, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3874 | '-evalf', 'X:INTEGER & X*Y /= X*Y2 & Y2=Y', | |
| 3875 | '-evalf', 'X:INTEGER & X+Y /= Y2+X & Y2=Y' | |
| 3876 | ], 'test improved clpfd_neq_expr'). | |
| 3877 | cli_testcase(1722, [cbc,cse], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CSE', 'TRUE', | |
| 3878 | '-evalf', 'not(#(x,y,z).((x+1)*y = 1000 & (x+1)*z=y & z=(x+1) ))', % already worked before | |
| 3879 | '-evalt', 'not(#(x,y,z).((x+1)*y = 1001 & (x+1)*z=y & z=(x+1) ))', % already worked before | |
| 3880 | '-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))', | |
| 3881 | '-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)))', | |
| 3882 | '-evalf', '#(X,Y,Z).(X:INTEGER & #(Z1,Z2,Z3,Z4).(X*Y=Z1 & Z1*Z = Z2 & Z*X = Z3 & Z3*Y = Z4 & Z2 /= Z4))' | |
| 3883 | ], 'test single usage identifier inlining'). | |
| 3884 | cli_testcase(1723, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3885 | '-evalf', 'X:INTEGER & Y*X /= X*Y2 & Y2=Y', | |
| 3886 | '-evalf', 'X:INTEGER & X*Y*(Z+V) /= (V+Z)*X*Y', | |
| 3887 | '-evalf', 'X:INTEGER & X+Y+(Z*V) /= (V*Z)+X+Y', | |
| 3888 | '-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))', | |
| 3889 | '-evalf', 'x:INTEGER & (x-(x+a*b)) /= (y-(b*a+x)) & y=x', % added later | |
| 3890 | '-evalf', 'x:INTEGER & (-(x+a*b)) /= (-(b*a+y)) & y=x' % added later | |
| 3891 | ], 'test improved commutativity detection in clpfd_neq_expr'). | |
| 3892 | cli_testcase(1724, [tickets], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3893 | '-execute_all', '-check_goal', | |
| 3894 | '../prob_examples/public_examples/B/Tester/CheckGoal.mch'],'test check_goal with executed_all'). | |
| 3895 | cli_testcase(1725, [tickets, b_test], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3896 | '-assertions', '-init', | |
| 3897 | '../prob_examples/public_examples/B/Tester/Visibility/M2_xx.mch'],'test visibility in assertions clause'). | |
| 3898 | cli_testcase(1726, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/XML_Reader.mch', '-t', '-assertions', | |
| 3899 | '-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)]', | |
| 3900 | '-strict'], 'Check that external function to read XML works.'). | |
| 3901 | 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.'). | |
| 3902 | cli_testcase(1728, [error_checks], [ '-strict', | |
| 3903 | '-expcterrpos', 'bmachine_static_checks', 10, 15, | |
| 3904 | '../prob_examples/public_examples/B/Tester/InitialisationChecks/IllegalOrderOfInits.mch'],'test detection of illegal initialisations'). | |
| 3905 | cli_testcase(1729, [error_checks], [ '-strict', | |
| 3906 | '-expcterrpos', 'bmachine_static_checks', 10, 25, | |
| 3907 | '../prob_examples/public_examples/B/Tester/InitialisationChecks/IllegalParallelInit.mch'],'test detection of illegal initialisations'). | |
| 3908 | cli_testcase(1730, [error_checks], [ '-strict', | |
| 3909 | '-expcterrpos', 'bmachine_static_checks', 14, 2, | |
| 3910 | '../prob_examples/public_examples/B/Tester/InitialisationChecks/IllegalChoiceOrderInit.mch'],'test detection of illegal initialisations'). | |
| 3911 | cli_testcase(1731, [cbc,infinite], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3912 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', | |
| 3913 | '-evalt', 'f=%x.(x:iseq(struct(a:STRING))|x) & f([rec(a:"a")])=[rec(a:"a")]', | |
| 3914 | '-evalt', 'f=%x.(x:iseq(struct(a:STRING,b:BOOL))|x) & f([rec(a:"a",b:TRUE)])=[rec(a:"a",b:xx)] & xx=TRUE', | |
| 3915 | '-evalt', 'f=%x.(x:iseq(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', | |
| 3916 | '-evalt', 'f=%x.(x:iseq1(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', | |
| 3917 | '-evalt', 'f=%x.(x:seq1(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', | |
| 3918 | '-evalt', 'f=%x.(x:seq(struct(a:NATURAL,b:BOOL))|x) & f([rec(a:222,b:TRUE)])=[rec(a:222,b:xx)] & xx=TRUE', | |
| 3919 | '-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', | |
| 3920 | '-evalf', 'f=%x.(x:iseq(struct(a:STRING))|x) & f([rec(a:"a")])=[rec(a:"b")]'], | |
| 3921 | 'test detection of infinite function without virtual time-outs'). | |
| 3922 | cli_testcase(1732, [tickets], [ | |
| 3923 | '../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.'). | |
| 3924 | cli_testcase(1733, [tickets,execute], [ % '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3925 | '../prob_examples/public_examples/B/Tickets/Hansen31_VirtualTimeout/VirtualTimeout.mch', '-execute', 1000, | |
| 3926 | '-animate_stats', | |
| 3927 | '-expcterr','virtual_time_out_execute'], 'Check that we detect that execute incomplete.'). | |
| 3928 | cli_testcase(1734, [tickets,animate], [ % '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3929 | '../prob_examples/public_examples/B/Tickets/Hansen31_VirtualTimeout/VirtualTimeout.mch', '-animate', 5, | |
| 3930 | '-animate_stats', | |
| 3931 | '-expcterr','virtual_time_out'], 'Check that we detect that execute incomplete.'). | |
| 3932 | cli_testcase(1735, [cbc], ['../prob_examples/public_examples/B/Tester/InitialisationChecks/InitCBCCheck.mch', '-cbc_sequence', 'Goal', '-strict'], 'Check cbc_sequence with non-det. INITIALISATION'). | |
| 3933 | 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'). | |
| 3934 | 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'). | |
| 3935 | 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'). | |
| 3936 | cli_testcase(1739, [cbc], ['../prob_examples/examples/B/Alloy/req2_v3_not_conj_check.mch', | |
| 3937 | '../prob_examples/examples/B/Alloy/req2_v3_not_conj_check2.mch', % version with larger CONTEXT set, more difficult | |
| 3938 | '-t', '-p', 'TIME_OUT', '9500'], 'test not conjunction treatment of kernel'). | |
| 3939 | cli_testcase(1740, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3940 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', | |
| 3941 | '-evalt', '#x.(x:1..10000 & x mod 22 = 11) or b=TRUE', | |
| 3942 | '-evalt', '(#x.(x:1..10000 & x mod 22 = 11) or b=TRUE) => b=FALSE', | |
| 3943 | '-evalt', '(#x.(x:1..10000 & x mod 22 = 22) or b=TRUE) => b=FALSE', | |
| 3944 | '-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))' | |
| 3945 | ], | |
| 3946 | 'test reification of RHS of disjunction (or)'). | |
| 3947 | cli_testcase(1741, [ctl], ['../prob_examples/public_examples/B/Ivo/CTLIssue.mch', '-ctlformulat', 'AF {x=4}'], 'Testing bug-fix caused by an unnecessary cut.'). | |
| 3948 | cli_testcase(1742, [csp_test], ['../prob_examples/public_examples/CSP/simple/verysimple.csp', | |
| 3949 | '-ltlformulat', 'GF e(a.red)', '-strict' | |
| 3950 | ], 'Test check should show that verysimple fulfills the LTL formula, which is equivalent to the CTL formula AGAF e(a.red).'). | |
| 3951 | cli_testcase(1743, [cbc,infinite,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 3952 | '-evalt', '{3} <| %x.(x:NATURAL|x+1) = {3|->4}', | |
| 3953 | '-evalf', '{3} <| %x.(x:NATURAL|x+1) = {a,b} & a/=b', | |
| 3954 | '-evalt', '2..4 = ran((1..3) <| %x.(x:NATURAL|x+1))', | |
| 3955 | '-evalt', '1..3 = dom(%x.(x:NATURAL|x+1)|>(2..4))', | |
| 3956 | '-evalt', '(1..9) <| pred = %x.(x:1..9|x-1)', | |
| 3957 | '-evalt', '(1..9) <| succ = %x.(x:1..9|x+1)', | |
| 3958 | '-evalt', '{n} <| succ = {15|->x} & n<20' | |
| 3959 | ], 'Test better symbolic treatment of union'). | |
| 3960 | cli_testcase(1744, [cbc,infinite,union], [ | |
| 3961 | '-evalt', '4|->b : {3} <<| %x.(x:NATURAL|x+1)', | |
| 3962 | '-evalf', '4|->b : (%x.(x:NATURAL|x+1) |>> (1..9))', | |
| 3963 | '-evalt', '14|->b : (%x.(x:NATURAL|x+1) |>> (1..9))', | |
| 3964 | '-evalt', '{b|14|->b : (%x.(x:NATURAL|x+1) |>> (1..9))} = {15}', | |
| 3965 | '-evalt', 'x = {-1,-33} \\/ NATURAL1 & 11:x & -1:x & -33:x & 0 /: x' | |
| 3966 | ], 'Test better symbolic treatment of union'). | |
| 3967 | cli_testcase(1745, [tickets,codespeed], [ | |
| 3968 | '../prob_examples/public_examples/B/Puzzles/EulerWay.mch', | |
| 3969 | %'../prob_examples/public_examples/B/Puzzles/EulerWayDisjunction.mch', % this does not work yet; disjoin_true change makes this version too slow | |
| 3970 | '-init', '-p', 'TIME_OUT', 9500 | |
| 3971 | ], | |
| 3972 | 'EulerWay Codespeed Test'). | |
| 3973 | cli_testcase(1746, [cbc], [ | |
| 3974 | '../prob_examples/public_examples/B/CBC/Feasibility_baloadR07.mch', | |
| 3975 | '-init' | |
| 3976 | ], | |
| 3977 | 'Check reification of existential quantifier with 27 cases not problematic'). | |
| 3978 | cli_testcase(1747, [codespeed], [ | |
| 3979 | '../prob_examples/public_examples/B/Demo/SortByPermutation_v2.mch', | |
| 3980 | '-t', '-p', 'TIME_OUT', 9500], | |
| 3981 | 'SortByPermutation_v2 Codespeed Test'). | |
| 3982 | cli_testcase(1748, [codespeed], [ | |
| 3983 | '../prob_examples/public_examples/B/PerformanceTests/ModelChecking/CountToMAXINT.mch', | |
| 3984 | '-mc', 500002, '-p', 'MAXINT', 500000, '-nodead'], | |
| 3985 | 'MC_CountToMAXINT_50000 Codespeed Test'). | |
| 3986 | cli_testcase(1749, [codespeed, symmtest], ['../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'). | |
| 3987 | cli_testcase(1750, [alstom,codespeed], [ | |
| 3988 | '../prob_examples/examples/B/Alstom/axl3/axl3.mch', | |
| 3989 | '-t', '-p', 'CLPFD', 'TRUE'], | |
| 3990 | 'axl3 Codespeed Test'). | |
| 3991 | cli_testcase(1751, [alstom,codespeed], [ | |
| 3992 | '../prob_examples/examples/B/Alstom/cbtc/actions_cbtc.mch', | |
| 3993 | '-t', '-p', 'CLPFD', 'TRUE'], | |
| 3994 | 'actions_cbtc Codespeed Test'). | |
| 3995 | cli_testcase(1752, [private,codespeed], [ | |
| 3996 | '../prob_examples/examples/B/Alstom/DataValidationProject/Rule_TMS_Route_0006.mch', | |
| 3997 | '-p', 'MAXINT', 10000000, '-p', 'MININT', -10000000, '-p', 'TIME_OUT', '60000', | |
| 3998 | '-p', 'SHOW_EVENTB_ANY_VALUES', 'true', | |
| 3999 | '-mc', 1000, '-df', '-nodead', '-expcterr', 'invariant_violation', | |
| 4000 | '-p', 'CLPFD', 'FALSE'], | |
| 4001 | 'ClearSy_RuleTMS_R0006 Codespeed Test'). | |
| 4002 | cli_testcase(1753, [codespeed], [ | |
| 4003 | '../prob_examples/examples/B/Alstom/DataValidationProject/Rule_TMS_Route_0006.mch', | |
| 4004 | '-p', 'MAXINT', 10000000, '-p', 'MININT', -10000000, '-p', 'TIME_OUT', '60000', | |
| 4005 | '-p', 'SHOW_EVENTB_ANY_VALUES', 'true', | |
| 4006 | '-mc', 1000, '-df', '-nodead', '-expcterr', 'invariant_violation', | |
| 4007 | '-p', 'CLPFD', 'TRUE'], | |
| 4008 | 'ClearSy_RuleTMS_R0006_CLPFD Codespeed Test'). | |
| 4009 | cli_testcase(1754, [cbc,sigma], [ | |
| 4010 | '../prob_examples/public_examples/B/CBC/Tests/TestSIGMA.mch', | |
| 4011 | '-init', '-assertions' | |
| 4012 | ], | |
| 4013 | 'Check reification of IF-THEN-ELSE in SIGMA + WD detection of total avl function'). | |
| 4014 | cli_testcase(1755, [tickets,quantified,union], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4015 | '-evalt', 'UNION(x).(x:1..4|{x+y}) = 12..15', | |
| 4016 | '-evalf', 'UNION(x).(x:1..4|{x+y}) = 12..16', | |
| 4017 | '-evalt', '{y|UNION(x).(x:1..4|{x+y}) = 12..15} = {11}', | |
| 4018 | '-evalt', '{n|UNION(x).(x:1..10|{x}) = 1..n} = {10}' | |
| 4019 | % UNION(x).(x:1..n|{x}) = 1..10 generates warning | |
| 4020 | % {n|UNION(x).(x:1..n|{x}) = 1..0} = {0} generates virtual time-out | |
| 4021 | ], 'ensure new UNION treatment with better propagation'). | |
| 4022 | cli_testcase(1756, [tickets,card], [ | |
| 4023 | '../prob_examples/public_examples/B/Tester/SetSetupTests/CardDefSetConstraint.mch', | |
| 4024 | '-init', '-assertions' | |
| 4025 | ], | |
| 4026 | 'Check deferred set size inference improved'). | |
| 4027 | cli_testcase(1757, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4028 | '-evalt', '{x,y|IF x:0..3 THEN y=2 ELSE 1=0 END} = {(0|->2),(1|->2),(2|->2),(3|->2)}', | |
| 4029 | '-evalt', '{x,y|IF x/:0..3 THEN 1=0 ELSE y=2 END} = {(0|->2),(1|->2),(2|->2),(3|->2)}' | |
| 4030 | ], 'exercise => FALSE AST simplification'). | |
| 4031 | cli_testcase(1758, [b_test,ltl,safety], [ | |
| 4032 | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', | |
| 4033 | '-ltlformulaf', 'G not [bget]', | |
| 4034 | '-p', 'use_safety_ltl_model_checker', true, '-strict' | |
| 4035 | ], | |
| 4036 | 'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). | |
| 4037 | cli_testcase(1759, [b_test,ltl,safety], [ | |
| 4038 | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', | |
| 4039 | '-ltlformulaf', 'G not ({nsoda = 0} => X [sget])', | |
| 4040 | '-p', 'use_safety_ltl_model_checker', true, '-strict' | |
| 4041 | ], | |
| 4042 | 'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). | |
| 4043 | cli_testcase(1760, [b_test,ltl,safety], [ | |
| 4044 | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', | |
| 4045 | '-ltlformulaf', '{paid=FALSE} or ({nbeer=1} & {nsoda =1}) & (({nbeer = 0}) R (X [bget]))', | |
| 4046 | '-p', 'use_safety_ltl_model_checker', true, '-strict' | |
| 4047 | ],'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). | |
| 4048 | cli_testcase(1761, [b_test,ltl,safety], [ | |
| 4049 | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', | |
| 4050 | '-ltlassertions', '-p', 'use_safety_ltl_model_checker', true, '-strict' | |
| 4051 | ],'Checking that the safety LTL model checker succeeds on each assertions.'). | |
| 4052 | cli_testcase(1762, [b_test,ltl,safety], [ | |
| 4053 | '../prob_examples/public_examples/B/LTL/SafetyMC/BeverageVendingMachine.mch', | |
| 4054 | '-ltlformulaf', 'F [ret_coin] => {paid=TRUE}', '-p', 'use_safety_ltl_model_checker', true, '-strict' | |
| 4055 | ],'Check that safety model checker does not produce incomplete counter examples when transition propositions appear in the safety ltl formula.'). | |
| 4056 | cli_testcase(1763, [cbc,slot,tickets,wd], ['../prob_examples/public_examples/B/Tickets/SLOT-WD-ISSUE/Solver.mch', | |
| 4057 | '-assertions', | |
| 4058 | '-evalt', 'UNSAT_CORE_SESSIONS({group3, group4}) = {session3,session4}' | |
| 4059 | ], 'Check that wd issue with let predicates solved (expressions not guarded)'). | |
| 4060 | cli_testcase(1764, [laws], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4061 | '../prob_examples/public_examples/B/Laws/BoolLaws.mch', | |
| 4062 | '../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', | |
| 4063 | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', | |
| 4064 | '../prob_examples/public_examples/B/Laws/SetLaws.mch', | |
| 4065 | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', | |
| 4066 | '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'OPTIMIZE_AST', 'FALSE', '-opterr', 'model_check_incomplete'], 'Mathematical Laws with AST optimization disabled'). | |
| 4067 | cli_testcase(1765, [cbc], ['../prob_examples/examples/B/AWE_JASP/v7/JavaBC0.mch', | |
| 4068 | '-t', '-mc', '200', | |
| 4069 | '-nogoal', '-noass' | |
| 4070 | ], 'Check Java Bytecode interpreter'). | |
| 4071 | cli_testcase(1766, [private,case], ['../prob_examples/public_examples/B/Tester/ForAllExpansionEnumWarning.mch', | |
| 4072 | '-init', '-aa', 0,0,1 | |
| 4073 | ], 'Check forall not expanded'). | |
| 4074 | 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'). | |
| 4075 | cli_testcase(1768, [b_test,case], ['../prob_examples/public_examples/B/Tester/CaseStmt_Illegal1.mch', '-init', | |
| 4076 | '-expcterrpos', type_error, 24, 10, '-expcterr', load_main_file, | |
| 4077 | '-strict'],'Check case statement with else'). | |
| 4078 | cli_testcase(1769, ['PROB-411',tickets,kodkod,card], [ '-p', 'KODKOD_RAISE_WARNINGS', 'TRUE', | |
| 4079 | '-evalt', ':kodkod card({a,b|a:BOOL & b:1..k})=4 & k:0..2', | |
| 4080 | '-evalf', ':kodkod card({a,b|a:BOOL & b:1..k})=3 & k:0..10', | |
| 4081 | '-evalt', ':kodkod card({a,b,c})=1 & {a,b,c}<:BOOL', | |
| 4082 | '-evalt', ':kodkod card({a,b,c})=2 & {a,b,c}<:1..10 & a+b+c=20' | |
| 4083 | ], 'check card interval analysis succeeds'). | |
| 4084 | cli_testcase(1770,[cbc,enabling],[ | |
| 4085 | '-enabling_analysis_csv','../prob_examples/public_examples/B/CBC/Enabling/ChoiceByPredicate_enabling_analysis.csv', | |
| 4086 | '../prob_examples/public_examples/B/CBC/Enabling/ChoiceByPredicate.mch', | |
| 4087 | '-p', 'TIME_OUT', 1000 | |
| 4088 | ], 'Check CSV enabling output for becomes_such'). | |
| 4089 | cli_testcase(1771,[cbc,enabling],[ | |
| 4090 | '-enabling_analysis_csv','../prob_examples/public_examples/B/CBC/Enabling/OpParameterTests_enabling_analysis.csv', | |
| 4091 | '../prob_examples/public_examples/B/CBC/Enabling/OpParameterTests.mch', | |
| 4092 | '-p', 'TIME_OUT', 6500 % enabling analysis takes 0.1 this | |
| 4093 | ], 'Check CSV enabling output for variety of substitutions'). | |
| 4094 | cli_testcase(1772, [por,ltl], ['../prob_examples/public_examples/B/Ivo/Threads51.mch', '-ltlformulat', 'GF {v1=n}', | |
| 4095 | '-p', por, ample_sets], 'Check LTL property with partial order reduction.'). | |
| 4096 | cli_testcase(1773, [por,ltl], ['../prob_examples/public_examples/B/Ivo/Threads51.mch', '-ltlformulat', 'G not {v1>n+1}', | |
| 4097 | '-p', use_safety_ltl_model_checker, true, '-p', por, ample_sets], 'Check LTL property with partial order reduction.'). | |
| 4098 | cli_testcase(1774, [por,ltl], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', | |
| 4099 | '-ltlformulat', 'G not deadlock', '-p', por, ample_sets, '-p', pge, full | |
| 4100 | ], 'Check LTL property with partial order reduction.'). | |
| 4101 | cli_testcase(1775, [por,ltl], ['../prob_examples/public_examples/B/Benchmarks/CAN_BUS_tlc.mch', | |
| 4102 | '-ltlformulat', 'G not deadlock', '-p', por, ample_sets, '-p', pge, full, | |
| 4103 | '-p', use_safety_ltl_model_checker, true | |
| 4104 | ], 'Check LTL property with partial order reduction.'). | |
| 4105 | cli_testcase(1776, [tickets,while], [ | |
| 4106 | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1.mch', | |
| 4107 | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1_Internal.mch', | |
| 4108 | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1_Internal_v2.mch', | |
| 4109 | '../prob_examples/public_examples/B/Tickets/Hansen32_CompileBug/M1_Internal_v3.mch', | |
| 4110 | '-t' | |
| 4111 | ], | |
| 4112 | 'Check compilation of while with op call and inner while works'). | |
| 4113 | cli_testcase(1777, [por], ['../prob_examples/public_examples/B/Ivo/PORTest_WriteDependencies.mch', '-model_check', '-noinv', '-p', por, ample_sets, | |
| 4114 | '-expcterr', deadlock], 'Check that no incorrect reduction is performed on the model.'). | |
| 4115 | cli_testcase(1778, [laws,random], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4116 | '../prob_examples/public_examples/B/Laws/BoolLaws.mch', | |
| 4117 | '../prob_examples/public_examples/B/Laws/ArithmeticLaws.mch', | |
| 4118 | '../prob_examples/public_examples/B/Laws/ArithmeticExpLaws.mch', | |
| 4119 | '../prob_examples/public_examples/B/Laws/SetLaws.mch', | |
| 4120 | '../prob_examples/public_examples/B/Laws/SetLawsNat.mch', | |
| 4121 | '-mc', '500', '-c', '-nogoal', '-nodead', '-strict', '-p', 'RANDOMISE_ENUMERATION_ORDER', 'TRUE', '-opterr', 'model_check_incomplete'], 'Mathematical Laws with random enumeration'). | |
| 4122 | cli_testcase(1779, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4123 | '../prob_examples/public_examples/B/Tester/Constants6.mch', | |
| 4124 | '../prob_examples/public_examples/B/Tester/Constants7.mch', | |
| 4125 | '-property', 'minnr = 7 & mxnr =9 & pid(p1) = a & pid(p2)=b & pid(p3)=c & pnr(p1)=minnr & pnr(p3)=mxnr & root=a', | |
| 4126 | '-t' | |
| 4127 | ], | |
| 4128 | 'Check -property command works'). | |
| 4129 | 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'). | |
| 4130 | 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'). | |
| 4131 | cli_testcase(1782, [b_test,preferences], ['../prob_examples/public_examples/B/FeatureChecks/LocalOperationCall.mch', | |
| 4132 | '../prob_examples/public_examples/B/FeatureChecks/LocalOperationCall2.mch', | |
| 4133 | '-t'], 'test calling local operations'). | |
| 4134 | 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'). | |
| 4135 | 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'). | |
| 4136 | cli_testcase(1785, [b_test,execute], ['../prob_examples/public_examples/B/FeatureChecks/ExecuteNonDetCsts.mch', '-execute_all', '-check_goal'], 'test execute + check goal'). | |
| 4137 | 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'). | |
| 4138 | cli_testcase(1787, [b_test], ['../prob_examples/public_examples/B/Tester/OpCalls/UseCopy.mch', '-t' | |
| 4139 | ], 'test output parameters can be read'). | |
| 4140 | cli_testcase(1788, [b_test], ['../prob_examples/public_examples/B/Implementations/Values/Sensor0_i.imp', | |
| 4141 | '../prob_examples/public_examples/B/Implementations/Values/DefSetsImp.imp', | |
| 4142 | '-t' | |
| 4143 | ], 'test VALUES clause'). | |
| 4144 | cli_testcase(1789, [b_test,external,records,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4145 | '../prob_examples/public_examples/B/ExternalFunctions/LibraryStrings.mch', | |
| 4146 | '-evalt', '{rec(sa:"1.101"),rec(sa:"1.102")} =x & x<: (struct(sa : /*@symbolic*/ {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))', | |
| 4147 | '-evalf', '{rec(sa:"1.101"),rec(sa:"1.102.3")} =x & x<: (struct(sa : /*@symbolic*/ {s| s : STRING & size(STRING_SPLIT(s,"."))=2}))' | |
| 4148 | ], 'Check that no infinite expansion occurs here.'). | |
| 4149 | cli_testcase(1790, [b_test,external], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4150 | '../prob_examples/public_examples/B/ExternalFunctions/TestLibraryHash.mch', '-assertions'], 'Check HASH and SHA_HASH'). | |
| 4151 | cli_testcase(1791, [b_test,external,rulesdsl], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4152 | '../prob_examples/public_examples/Rules/CSV/Runner_CSV.rmch', '-execute_all', | |
| 4153 | '-check_goal'], 'Check Rules DSL example with CSV reading'). | |
| 4154 | cli_testcase(1792, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4155 | '-evalt', 'y:7..30000000000 & not(#x.(x:1..10 & x:8..y))', | |
| 4156 | '-evalf', 'y:20..30000000000 & not(#x.(x:1..10 & x:8..y))', | |
| 4157 | '-evalf', 'y:7..30000000000 & not(#x.(x /: 1..y))', | |
| 4158 | '-evalf', 'y:7..30000000000 & not(#x.(not(x : 1..y)))', | |
| 4159 | '-evalt', 'x<:BOOL & x/={} & #y.(y /: x)' | |
| 4160 | ], 'check translation of exists into not equal empty_set'). | |
| 4161 | cli_testcase(1793,[cbc,enabling],['-enabling_analysis_csv','../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2_enabling.csv', | |
| 4162 | '../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2.mch'], 'Check CSV output of a simple enabling analysis (Ticket PROB-215).'). | |
| 4163 | cli_testcase(1794,[cbc],['-t', '-cc', 5, 4, | |
| 4164 | '../prob_examples/public_examples/B/CBC/Constraint_with_exists.mch', | |
| 4165 | '../prob_examples/public_examples/B/CBC/Constraint_with_exists_v2.mch'], 'Check improved treatment of in_domain_subtraction and restriction.'). | |
| 4166 | cli_testcase(1795, [cbc], [ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4167 | '-evalf', 'yy:1..5 & !x.(x<:POW(INTEGER) => {yy}:x)', | |
| 4168 | '-evalt', '!x.(x:INTEGER => x<0 or x>y) & y:-1..10', | |
| 4169 | '-evalf', '!x.(x:INTEGER => x<0 or x>y) & y:1..10', | |
| 4170 | '-evalf', 'yy:1..5 & !x.(x<:POW(NATURAL) => {yy}:x)', | |
| 4171 | '-evalt', 'yy:-1..5 & !x.(x<:POW(NATURAL) => {yy}/:x)', | |
| 4172 | '-evalf', 'yy:1..5 & !x.(x<:POW(1..10) => {yy}:x)', | |
| 4173 | '-evalf', '!x.(x:NATURAL => x>y) & y:1..10', | |
| 4174 | '-evalt', '!x.(x:NATURAL => x>y) & y:-1..10', | |
| 4175 | '-evalf', '!x.(x:INTEGER => (x:NATURAL => x>y)) & y:1..10', | |
| 4176 | '-evalt', '!x.(x:INTEGER => (x:NATURAL => x>y)) & y:-1..10' | |
| 4177 | ], 'check improved treatment of forall'). | |
| 4178 | cli_testcase(1796,[eventb_test,wd],['-t', | |
| 4179 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/VariantWDError2_mch.eventb', | |
| 4180 | '-expcterr', well_definedness_error, | |
| 4181 | '-expcterr', 'event_error:inc:event_wd_error' ], 'Check detection of WD errors for variants.'). | |
| 4182 | cli_testcase(1797,[enabling,eventb_test],[ | |
| 4183 | '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_mch_finite.eventb', | |
| 4184 | '-t', | |
| 4185 | '-read_write_matrix_csv', '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_rw_matrix.csv' | |
| 4186 | ], 'Check read-write-matrix with witnesses correctly computed.'). | |
| 4187 | cli_testcase(1798, [laws,rel_fnc,wd], ['../prob_examples/public_examples/B/Laws/FunLawsWithLambda.mch', '-mc', '500', '-c', '-nogoal', '-nodead', '-strict','-p', 'DOUBLE-EVALUATION', 'TRUE', | |
| 4188 | '-p', 'TRY-FIND-ABORT', 'TRUE', '-expcterr', 'model_check_incomplete'], 'Test 458 with TRY_FIND_ABORT (and test using - instead of _).'). | |
| 4189 | cli_testcase(1799,[tickets,cbc,clpfd_tables],[ | |
| 4190 | '-evalf', 'deadline : BOOL --> 0..1 & (%d.(d : BOOL & deadline(d) > 0|deadline(d) - 1) /: BOOL <-> NATURAL)', | |
| 4191 | '-evalf', 'deadline : BOOL --> 0..2 & (%d.(d : BOOL & deadline(d) > 0|deadline(d) - 1) /: BOOL +-> NATURAL)', | |
| 4192 | '-evalt', 'deadline : BOOL --> 0..10 & (%d.(d : BOOL & deadline(d) >= 0|deadline(d) - 1) /: BOOL +-> NATURAL)', | |
| 4193 | '-evalf', 'deadline : BOOL --> 1..2 & (%d.(d : BOOL & deadline(d) > 1|deadline(d) - 2) /: BOOL <-> NATURAL)' | |
| 4194 | ], 'Check element/3 SICStus bug solved.'). | |
| 4195 | cli_testcase(1800,[tickets,disprover,cbc,clpfd_tables],[ | |
| 4196 | '../prob_examples/public_examples/EventBPrologPackages/Disprover/Tickets/LOCKR1_mch.pl', | |
| 4197 | '-expecterr', disprover_unsound, | |
| 4198 | '-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 | |
| 4199 | ], 'Check element/3 SICStus bug solved.'). % we still have issue with CHR and element/3 | |
| 4200 | cli_testcase(1801, [tickets,eventb_test,records], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4201 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/InitialisationByPredicate/TestBecomeSuch.mch', | |
| 4202 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/InitialisationByPredicate/TestBecomeSuch_mch.eventb', | |
| 4203 | '../prob_examples/public_examples/EventBPrologPackages/Tickets/InitialisationByPredicate/M0_v4_mch.eventb', % record detection | |
| 4204 | '-t' | |
| 4205 | ], 'Check that Event-B becomes_such works correctly, in particular with record detection.'). | |
| 4206 | cli_testcase(1802,[eventb_test,witnesses],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4207 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_mch.eventb', | |
| 4208 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_finite_unproven_mch.eventb', | |
| 4209 | '-t', '-mc', 500, '-opterr', model_check_incomplete | |
| 4210 | ], 'Check witness for removed abstract variable.'). | |
| 4211 | cli_testcase(1803,[eventb_test,witnesses,cbc],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4212 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_finite_unproven_mch.eventb', | |
| 4213 | '-cbc', 'all' | |
| 4214 | ], 'Check cbc invariant with witnesses.'). | |
| 4215 | cli_testcase(1804,[eventb_test,witnesses],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4216 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/NonDetAssign1_error_mch.eventb', | |
| 4217 | '-mc', 500, | |
| 4218 | '-expcterr', 'event_error:inc:action_not_executable' | |
| 4219 | ], 'Check witness error found.'). | |
| 4220 | cli_testcase(1805,[eventb_test,witnesses],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4221 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/Guard0_simerror_mch.eventb', | |
| 4222 | '-mc', 500, '-nodead', | |
| 4223 | '-expcterr', 'event_error:even_dec:simulation_error' | |
| 4224 | ], 'Check witness error found.'). | |
| 4225 | cli_testcase(1806,[eventb_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4226 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/VariantNegative_mch.eventb', | |
| 4227 | '-mc', 500, '-nodead', | |
| 4228 | '-expcterr', 'event_error:dec:variant_negative' | |
| 4229 | ], 'Check variant error found.'). | |
| 4230 | cli_testcase(1807,[eventb_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4231 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/VariantError_mch.eventb', | |
| 4232 | '-mc', 500, '-nodead', | |
| 4233 | '-expcterr', 'event_error:dec:invalid_variant' | |
| 4234 | ], 'Check variant error found.'). | |
| 4235 | cli_testcase(1808,[eventb_test],[ '-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4236 | '../prob_examples/public_examples/EventBPrologPackages/Tests/Witnesses/TheoremInGuardError_mch.eventb', | |
| 4237 | '-mc', 500, '-nodead', | |
| 4238 | '-expcterr', 'event_error:dec:invalid_theorem_in_guard' | |
| 4239 | ], 'Check variant error found.'). | |
| 4240 | cli_testcase(1809, [tickets,kodkod], [ | |
| 4241 | '../prob_examples/public_examples/B/Tickets/Kodkod7_QueensBug/Queen_BoardVersion.mch', | |
| 4242 | '../prob_examples/public_examples/B/Tickets/Kodkod7_QueensBug/Queen_BoardVersion_v2.mch', | |
| 4243 | '../prob_examples/public_examples/B/Tickets/Kodkod7_QueensBug/Queen_BoardVersion_v3.mch', | |
| 4244 | '-init' | |
| 4245 | ], 'check Kodkod bug fixed'). | |
| 4246 | cli_testcase(1810, [b_test,unicode,atelierb], | |
| 4247 | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4248 | '../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString.mch', '-assertions', | |
| 4249 | '-pp', '../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString_Internal.mch' | |
| 4250 | ],'Test unicode support.'). | |
| 4251 | cli_testcase(1811, [tickets,eventb_test,records], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4252 | '../prob_examples/public_examples/B/FeatureChecks/SheBang.mch', '-t' | |
| 4253 | ], 'Test parser accepts she-bang line starting with #!.'). | |
| 4254 | cli_testcase(1812, [smt_solver_integration], [ | |
| 4255 | '../prob_examples/public_examples/ProofObligations/GearDoor1_mch.pl', | |
| 4256 | '../prob_examples/public_examples/ProofObligations/GearsDoorsHandle3_mch.pl', | |
| 4257 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M2_mch.pl', | |
| 4258 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M20_mch.pl', | |
| 4259 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M3_mch.pl', | |
| 4260 | '../prob_examples/examples/ProofObligations/ABZ14_Mery/M30_mch.pl', | |
| 4261 | %'../prob_examples/public_examples/ProofObligations/Abrial_ABZ_Devel3/m1_true.pl', | |
| 4262 | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE' | |
| 4263 | %,'../prob_examples/examples/ProofObligations/ABZ14_Mery/M4_mch.pl' | |
| 4264 | ],'Check Disprover can prove all POs'). | |
| 4265 | cli_testcase(1813, [smt_solver_integration], [ | |
| 4266 | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_1_true.pl', | |
| 4267 | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE', | |
| 4268 | '-check_disprover_result', 7,0,0 | |
| 4269 | ],'Check Disprover can prove all POs; this test also checks register predicate works better'). | |
| 4270 | cli_testcase(1814, [smt_solver_integration], [ | |
| 4271 | '../prob_examples/examples/ProofObligations/Abrial_Ch4_Brp/brp_3_true.pl', | |
| 4272 | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE', | |
| 4273 | '-check_disprover_result', 60,0,0 | |
| 4274 | ],'Check Disprover can prove all POs; this test also checks register predicate works better'). | |
| 4275 | cli_testcase(1815, [smt_solver_integration], [ | |
| 4276 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest2_ctx.pl', | |
| 4277 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest3_ctx.pl', | |
| 4278 | '../prob_examples/public_examples/ProofObligations/DisproverDefSetTest4_ctx.pl', | |
| 4279 | '-p', 'DOUBLE_EVALUATION', 'FALSE', '-p','SMT_SUPPORTED_INTERPRETER','TRUE', | |
| 4280 | '-check_disprover_result', 0,0,2 | |
| 4281 | ],'Check Disprover cannot prove po'). | |
| 4282 | cli_testcase(1816, [b_test,external,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4283 | '../prob_examples/public_examples/B/ExternalFunctions/SubStringFunctions.mch', '-assertions', | |
| 4284 | '-evalt', 'INT_TO_DEC_STRING(101,2)="1.01"', | |
| 4285 | '-evalt', 'INT_TO_DEC_STRING(101,-2)="10100"', | |
| 4286 | '-evalt', 'INT_TO_DEC_STRING(-1001,2)="-10.01"', | |
| 4287 | '-evalt', 'INT_TO_DEC_STRING(-101,-2)="-10100"', | |
| 4288 | '-evalt', 'INT_TO_DEC_STRING(-101,3)="-0.101"', | |
| 4289 | '-evalt', 'STRING_CONTAINS_STRING("aabb","ab")', | |
| 4290 | '-evalt', 'STRING_CONTAINS_STRING("aabb","")', | |
| 4291 | '-evalf', 'STRING_CONTAINS_STRING("aabbab","bbb")' | |
| 4292 | ], 'Check substring and decimal string conversion external functions.'). | |
| 4293 | cli_testcase(1817, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CLPFD', 'FALSE', | |
| 4294 | '-evalt', '{x|x>10 & x<20 & x mod 5=0} = {15}', | |
| 4295 | '-evalt', 'x>10 & x<20', | |
| 4296 | '-evalt', 'x>18 & y<1024 & x<20 & y>1020' % does not work yet | |
| 4297 | %'-evalt', 'x>18 & (y<1024 & (x<20 & y>1020))' % no longer works | |
| 4298 | ], 'Test detection of intervals when CLPFD disabled'). | |
| 4299 | cli_testcase(1818, [cbc,union], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', '-p', 'CLPFD', 'FALSE', | |
| 4300 | '-evalt', 'UNION(x).(x:1..RANGE_LAMBDA|{x+1})=res & RANGE_LAMBDA:{10,11} & res = 2..11', | |
| 4301 | '-evalt', 'UNION(x).(x:1..12|{x+1})={2,3,4,5,6,7,8,9,10,11,12,13}', | |
| 4302 | '-evalt', 'UNION(x).(x:1..2|{x+y}) = 12..13', | |
| 4303 | '-evalt', '{y|UNION(x).(x:1..2|{x+y}) = 12..13} = {11}' | |
| 4304 | ], 'Test UNION translation for singleton set'). | |
| 4305 | cli_testcase(1819, [b_test,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4306 | '-evalt', ' "ab c " = \'\'\'ab c \'\'\' ', % "ab c " = '''ab c ''' | |
| 4307 | '-evalf', ' "ab c" = \'\'\'abc\'\'\' ', | |
| 4308 | '-evalf', ' "abc" = " abc" ', | |
| 4309 | '-evalt', ' "ab\'c" = "ab\\\'c" ', % a \' inside "..." is now one character | |
| 4310 | '-evalt', ' "ab\\\'c" /= "ab\\\\\'c" ', % "ab\'c" /= "ab\\'c" | |
| 4311 | '-evalf', ' "ab\'c" = "ab\\\\\'c" ', | |
| 4312 | '-evalt', ' "ab\\x" = "ab\\\\x" ', | |
| 4313 | '-evalt', ' "ab\\\"c" = \'\'\'ab"c\'\'\' ', % "ab\"c" = '''ab"c''' | |
| 4314 | '-evalt', ' "ab\'c" = \'\'\'ab\'c\'\'\' ' % "ab'c" = '''ab'c''' | |
| 4315 | ], 'Test alternate STRING literal form with three apostrophes'). | |
| 4316 | 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.'). | |
| 4317 | cli_testcase(1821, [cbc], ['../prob_examples/public_examples/B/TestCaseGeneration/BMC/CounterWrongInit.mch', '-cbc', 'INITIALISATION', '-strict', '-expcterr', 'cbc'], 'Check INITIALISATION counter-example found'). | |
| 4318 | cli_testcase(1822, [cbc], ['../prob_examples/public_examples/B/TestCaseGeneration/BMC/CounterWrongInit.mch', '-cbc', 'all', '-strict', '-expcterr', 'cbc'], 'Check INITIALISATION counter-example found'). | |
| 4319 | 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'). | |
| 4320 | cli_testcase(1824, [cbc], [ | |
| 4321 | '-evalt', '(not((3 = soda) <=> (soda > coins / coins & coins = coins)) & (coins : NATURAL & soda : NATURAL)) & coins /= 0 ', | |
| 4322 | '-evalt', '{x,y| y = x/x & x = y+y}= {(2,1)}', | |
| 4323 | '-evalt', '{x,y| y = x/x & x = y+y+100}= {(102,1)}' | |
| 4324 | ], 'Check propagation of division x/x'). | |
| 4325 | cli_testcase(1825, [cbc,wd], [ | |
| 4326 | '-eval', 'r = x/x & r<10 & x<1 & x>-1', | |
| 4327 | '-expcterr', 'well_definedness_error' | |
| 4328 | ], 'Check propagation of division x/x does not prevent WD error detection'). | |
| 4329 | cli_testcase(1826, [rules], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4330 | '../prob_examples/public_examples/Rules_Machines/SimpleRulesMachine.rmch', | |
| 4331 | '../prob_examples/public_examples/Rules_Machines/TestDependency.rmch', | |
| 4332 | '-t' | |
| 4333 | ], 'Check simple Rules machine'). | |
| 4334 | cli_testcase(1827, [cbc,wd], ['-p', 'STRING_AS_SEQUENCE', 'TRUE', | |
| 4335 | '-evalt', '"a" ^ x = "ab" ^ y & x^x = "bb"', | |
| 4336 | '-evalt', '{x,y|"a" ^ x = "ab" ^ y & x^x = "bb"} = {("b","")}', | |
| 4337 | '-evalt', '"a"^"b"^"c" = "abc"' | |
| 4338 | ], 'Check concat operator works on strings'). | |
| 4339 | cli_testcase(1828, [cbc,tickets,union,card], [ | |
| 4340 | '-evalt', '{x,s|union(s) = {} & x<:INTEGER & x:s} = { ({},{{}}) }', | |
| 4341 | '-evalt', 'union(s) = {} & x<:INTEGER & x:s', | |
| 4342 | '-evalt', 'union(s) = {} & x<:INTEGER & x:s & card(s)=1', | |
| 4343 | '-evalf', 'union(s) = {} & x<:INTEGER & x:s & card(s)=2', | |
| 4344 | '-evalf', 'union(s) = {} & x<:INTEGER & x:s & card(s)=3', | |
| 4345 | '-evalf', 'union(s) = {} & x<:INTEGER & x:s & card(s)>1', | |
| 4346 | '-evalf', 'union(s) = {} & s<:POW(1..2) & card(s)>1', | |
| 4347 | '-evalt', 'union(s) = {1} & s<:POW(1..2) & card(s)>1', | |
| 4348 | '-evalf', 'union(s) = {1} & s<:POW(1..2) & card(s)>2', | |
| 4349 | '-evalf', 'union(s) = {1} & s<:POW(1..2) & card(s)=3', | |
| 4350 | '-evalf', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)>2', | |
| 4351 | '-evalf', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)=3', | |
| 4352 | '-evalt', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)=2', | |
| 4353 | '-evalt', 'union(s) = {TRUE} & s<:POW(BOOL) & card(s)>1', | |
| 4354 | '-evalt', ' {s,x|x<:{2,3} & x:s & card(s)=2 & {2,3}:s & 2/: x} = {({{},{2,3}}|->{}),({{2,3},{3}}|->{3})}', | |
| 4355 | '-evalf', 'x<:{2,3} & s = {x} \\/ s2 & card(s)=3 & s2 = {{2,3},{2}} & 2:x' | |
| 4356 | ], 'Check card operator does not generate solutions with repeated entries'). | |
| 4357 | cli_testcase(1829, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4358 | '-p', 'DEFAULT_SETSIZE', 5, | |
| 4359 | '../prob_examples/public_examples/EventBPrologPackages/GraphColouring/Coloring_40_wo_axm9.eventb', | |
| 4360 | '-p', 'TIME_OUT', '5000', | |
| 4361 | '-t' | |
| 4362 | ], 'Check forall improvements'). | |
| 4363 | cli_testcase(1830, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4364 | '-evalt', '!y.(y>3 => !x.(x>2 => TRUE=TRUE))', | |
| 4365 | '-evalt', '!y.(y>3 => !x.(x>2 => 2>1))', | |
| 4366 | '-evalt', 'y:4..5 & !y.(y>3 => !x.(x>2 => 2>1))', | |
| 4367 | '-evalt', '{y|y:3..5 & !y.(y>3 => !x.(x>2 => 1<11))} = 3..5' | |
| 4368 | ], 'Check forall useless detection improvement'). | |
| 4369 | cli_testcase(1831, [tickets,while,rules], ['../prob_examples/public_examples/B/Tickets/Hansen34_compile2/FunctionWithWhileLoop.rmch', '-t' ], % increased time-out for jenkins | |
| 4370 | 'Check that compile issue solved when expanding Operation Calls with return parameters'). | |
| 4371 | cli_testcase(1832, [laws], ['../prob_examples/public_examples/B/Laws/BoolWithArithLaws.mch', '-mc', '100000', '-nodead', '-c', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE'], 'Various laws about BOOL datatype and boolean connectives; this times using arithmetic operators.'). | |
| 4372 | cli_testcase(1833, [laws], ['../prob_examples/public_examples/B/Laws/INTEGERSET_Laws.mch', '-mc', '100000', '-nodead', '-c', '-strict','-p', 'DOUBLE_EVALUATION', 'TRUE', '-assertions'], 'Various laws about BOOL datatype and boolean connectives; this times using arithmetic operators.'). | |
| 4373 | cli_testcase(1834, [performance_tests,b_test,codespeed], ['../prob_examples/public_examples/B/PerformanceTests/EnumeratedSetDetection.mch', | |
| 4374 | '-t', '-strict', '-p', 'CLPFD', 'TRUE', '-p', 'TIME_OUT', '1000'], | |
| 4375 | 'Test enumerated set detection'). | |
| 4376 | cli_testcase(1835, [tickets,'PROB-60'], ['../prob_examples/public_examples/B/Tester/NameClashes/scheduler0.mch', | |
| 4377 | '-p', 'STRICT_CLASH_CHECKING', 'TRUE', | |
| 4378 | '-init', '-expcterr', 'bmachine_static_checks'], | |
| 4379 | 'Test enumerated set detection'). | |
| 4380 | cli_testcase(1836, [tickets,'PROB-71'], [ | |
| 4381 | '../prob_examples/public_examples/B/Tickets/DefinitionCapture/DefCaptureAtelierB.mch', | |
| 4382 | '../prob_examples/public_examples/B/Tickets/DefinitionCapture/DefCapture.mch', | |
| 4383 | '-init', '-expcterr', 'definition_variable_capture'], | |
| 4384 | 'Test detection of variable capture'). | |
| 4385 | cli_testcase(1837, [tickets,'PROB-379',enabling], [ | |
| 4386 | '../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect.mch', | |
| 4387 | '-feasibility_analysis_csv', 1000, '../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect_feasibility.csv'], | |
| 4388 | 'Test that operation call treated in enabling condition'). | |
| 4389 | cli_testcase(1838, [cbc,card], [ | |
| 4390 | '-evalt', 'x \\/ y \\/ z = 1..10 & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x=1..8 & y={10}', | |
| 4391 | '-evalt', 'union({x,y,z}) = 1..10 & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & z=1..7 & y={8,10}', | |
| 4392 | '-evalt', 'x \\/ y \\/ z = BOOL & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={TRUE} & y={FALSE}', | |
| 4393 | '-evalt', 'x \\/ y \\/ z = {"a","b","c"} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={"a"} & y={"b"}', | |
| 4394 | '-evalt', 'x \\/ y \\/ z = {"a","b","c"} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={"a"} & y={"b"} & z=s', | |
| 4395 | '-evalf', 'x \\/ y \\/ z = {"a","b","c"} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={"a"} & y={"b"} & card(z)=2', | |
| 4396 | '-evalt', 'x \\/ y \\/ z = {{"a","b"},{"c"},{"d"}} & x/\\ y = {} & x /\\ z = {} & y /\\ z = {} & x={{"c"}} & z={{"d"}}' | |
| 4397 | ], 'Testing partition propagation (all_but_one_set_known).'). | |
| 4398 | cli_testcase(1839, [cbc], [ | |
| 4399 | '-evalt', '{r,t|{x| bool(x>2)=t & x<5}=r & t=TRUE} = {({3,4}|->TRUE)}', | |
| 4400 | '-evalt', '{r,t|{x| bool(x<=2)=t & x<5}=r & t=FALSE} = {({3,4}|->FALSE)}' | |
| 4401 | ], 'Testing bool simplification in b_compiler.'). | |
| 4402 | cli_testcase(1840, [latex, b_test], [ | |
| 4403 | '../prob_examples/public_examples/Latex/tests/ProBLatex.mch', '-init', '-animate', 5, | |
| 4404 | '-latex', '../prob_examples/public_examples/Latex/tests/prob_latex_doc_raw.tex', | |
| 4405 | '../prob_examples/public_examples/Latex/tests/prob_latex_doc.tex' | |
| 4406 | ], 'Testing Latex mode.'). | |
| 4407 | ||
| 4408 | cli_testcase(1841, [cbc], [ | |
| 4409 | '../prob_examples/public_examples/B/Benchmarks/scheduler.mch', | |
| 4410 | '../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', | |
| 4411 | '-cbc_redundant_invariants', 0, '-strict'], 'Test searching for redundant invariants'). | |
| 4412 | cli_testcase(1842, [cbc], [ | |
| 4413 | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', | |
| 4414 | '-expcterr', cbc_redundant_invariants, | |
| 4415 | '-cbc_redundant_invariants', 0, '-strict'], 'Test searching for redundant invariants'). | |
| 4416 | cli_testcase(1843, [cbc], [ | |
| 4417 | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', | |
| 4418 | '-cbc_redundant_invariants', 6, '-strict'], 'Test searching for redundant invariants'). | |
| 4419 | cli_testcase(1844, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/SetOperators/TestPartition.mch', | |
| 4420 | '../prob_examples/public_examples/B/FeatureChecks/SetOperators/TestPartition3.mch', | |
| 4421 | '../prob_examples/public_examples/B/FeatureChecks/SetOperators/TestPartition2.mch', | |
| 4422 | '../prob_examples/public_examples/B/Mathematical/LeaderElectionRing.mch', | |
| 4423 | '-t', '-strict'], 'Test B partition and other tests from Tcl/Tk regression tests'). | |
| 4424 | cli_testcase(1845, [cruise,b_test], ['../prob_examples/examples/B/ClearSy/spec_Cruise/Cruise1.ref', | |
| 4425 | '-t', '-mc', 100, '-expcterr', 'model_check_incomplete', | |
| 4426 | '-strict'], 'Test Cruise refinement machine'). | |
| 4427 | cli_testcase(1846, [csp_test], ['../prob_examples/public_examples/CSP/other/Kleine/coz-example.csp', | |
| 4428 | '-cc', 12886, 38955, '-mc', 20000, '-strict'], 'Test OZ CSP translation and possible CSP process detection'). | |
| 4429 | cli_testcase(1847, [execute,b_test,wd], ['../prob_examples/public_examples/B/Tester/Execute/execute_wd_error.mch', | |
| 4430 | '-execute', 20, '-expcterr', 'execute', '-expcterr', 'well_definedness_error', | |
| 4431 | '-nodead', '-nogoal', '-strict', '-goal', 'i=10', '-check_goal'], 'Test WD error caught'). | |
| 4432 | cli_testcase(1848, [cbc,records,card], [ | |
| 4433 | '-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)})', | |
| 4434 | '-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)})', | |
| 4435 | '-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})})', | |
| 4436 | '-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})})', | |
| 4437 | '-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})})', | |
| 4438 | '-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})})', | |
| 4439 | '-evalt', 'card({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:INTEGER,b:INTEGER,c:BOOL)}) = 2000000', | |
| 4440 | '-evalt', 'card({r|r\'a : 1..1000 & r\'b : 1..1000 & r:struct(a:INTEGER,b:NATURAL,c:BOOL)}) = 2000000' | |
| 4441 | ], 'Testing struct comprehension set detection in ast cleanup.'). | |
| 4442 | cli_testcase(1849, [proz,records], [ | |
| 4443 | '../prob_examples/public_examples/Z/Ledru/RoZ_simple/model.fuzz', | |
| 4444 | '../prob_examples/public_examples/Z/Ledru/RoZ_simple/model_internal_simplified.mch', '-p', 'ALLOW_COMPLEX_LETS', 'TRUE', | |
| 4445 | '-t', '-mc', 10, '-strict', '-expcterr', 'model_check_incomplete'], 'Test Z models with complex records,... work'). | |
| 4446 | cli_testcase(1850, [proz,b_test], [ | |
| 4447 | '../prob_examples/public_examples/Z/Ledru/RoZ_simple/model.tex', | |
| 4448 | '../prob_examples/public_examples/Z/Testcases/comsets.tex', | |
| 4449 | '../prob_examples/public_examples/Z/Testcases/distributed_concatenation.tex', | |
| 4450 | '../prob_examples/public_examples/Z/Testcases/compaction.tex', | |
| 4451 | '../prob_examples/public_examples/Z/Testcases/zrm_refcard_ops.tex', | |
| 4452 | '-t', '-mc', 10, '-nodead', '-strict', '-opterr', 'model_check_incomplete'], 'Test loading .tex file works'). | |
| 4453 | cli_testcase(1851, [cbc], [ | |
| 4454 | '-evalt_file', '../prob_examples/public_examples/Eval/synthesis/synthesis_constraint_restricted_domains_smaller_library.eval' | |
| 4455 | ], 'Test solving a complicated synthesis constraint'). | |
| 4456 | cli_testcase(1852, [b_test,refinement], [ | |
| 4457 | '../prob_examples/public_examples/B/RefinementChecking/Simple/Spec1_with_new_op_err.ref', | |
| 4458 | '-init','-expcterr', 'type_error', '-expcterr', 'load_main_file', '-strict'], 'Test ALLOW_NEW_OPERATIONS_IN_REFINEMENT preference'). | |
| 4459 | cli_testcase(1853, [b_test,refinement], [ | |
| 4460 | '../prob_examples/public_examples/B/RefinementChecking/Simple/Spec1_with_new_op.ref', | |
| 4461 | '-t', '-mc', 10, '-strict'], 'Test ALLOW_NEW_OPERATIONS_IN_REFINEMENT preference'). | |
| 4462 | cli_testcase(1854, [cbc,records], [ | |
| 4463 | '-evalt', 'union(ran(f)) <: 2..3 & f = %x.(x:n..(n+1)|{x}) & n:1..1500000', | |
| 4464 | '-evalt', 'union(ran(f)) : POW(2..3) & f = %x.(x:n..(n+1)|{x}) & n:1..1500000' | |
| 4465 | ], 'Testing ast cleanup improvement.'). | |
| 4466 | cli_testcase(1855, [slot,tickets], [ | |
| 4467 | '../prob_examples/examples/B/SlotTool/Ticket_11092017/Solver.mch', | |
| 4468 | '-init', | |
| 4469 | '-eval', 'UNSAT_CORE_SESSIONS({group3, group4})', | |
| 4470 | '-evalt', 'UNSAT_CORE_SESSIONS({group3, group4})={session3,session4}', '-strict'], | |
| 4471 | 'Test instantiate to any issue solved'). | |
| 4472 | cli_testcase(1856, [b_test,external,closure1], [ | |
| 4473 | '../prob_examples/public_examples/B/ExternalFunctions/UGraphsFunctions.mch', | |
| 4474 | '-init', '-assertions'], 'Test CLOSURE1 and SCCS external functions'). | |
| 4475 | cli_testcase(1857, ['PROB-403',tickets,b_test], [ | |
| 4476 | '../prob_examples/public_examples/B/Tickets/PROB-403/CONTEXT_JUST_SETS.mch', | |
| 4477 | %'../prob_examples/public_examples/B/Tickets/PROB-403/CONTEXT2.mch', % does not work yet: constants are set up multiple times: | |
| 4478 | '-t' ], | |
| 4479 | 'Check constants, sets, ... can be included multiple times without prefix'). | |
| 4480 | cli_testcase(1858, [proz,records], [ | |
| 4481 | '../prob_examples/public_examples/Z/Ledru/RoZ_constraint/model.zed', | |
| 4482 | %'../prob_examples/public_examples/Z/Ledru/RoZ/model.tex', | |
| 4483 | '-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'). | |
| 4484 | cli_testcase(1859, [b_test,external,strings,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4485 | '../prob_examples/public_examples/B/ExternalFunctions/SubStringFunctions.mch', | |
| 4486 | '-eval', 'STRING_TO_INT("1.1")', | |
| 4487 | '-expcterr', well_definedness_error | |
| 4488 | ], 'Check that error raised when converting float to int.'). | |
| 4489 | cli_testcase(1860, [b_test,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4490 | '../prob_examples/public_examples/B/PerformanceTests/CardPropagation/DeferredSetSurjectionTest.mch', | |
| 4491 | '-init' | |
| 4492 | ], 'Check that cardinality of deferred set adjusted for surjections.'). | |
| 4493 | cli_testcase(1861, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4494 | '-eval', '[11,22,33] /|\\ 4', | |
| 4495 | '-expcterr', well_definedness_error | |
| 4496 | ], 'Check wd error for prefix sequence.'). | |
| 4497 | cli_testcase(1862, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4498 | '-evalt', '{x,y|x:INTEGER & y=x+1} = r & r2 = r~ & res = r2[{22,23}] & SIGMA(xx).(xx:res|xx)=43', | |
| 4499 | '-evalt', '{x,y|x:INTEGER & y=x+1} = r & r2 = r~ & res = r2[{x}] & SIGMA(x).(x:res|x)=x-1 & x:{50,51}' | |
| 4500 | ], 'Check that relational inverse works on infinite set'). | |
| 4501 | cli_testcase(1863, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4502 | '-p', 'TRY_FIND_ABORT', 'TRUE', | |
| 4503 | '-eval', 'f : 1..2 +-> 3..4 & f(3) = 3', | |
| 4504 | '-expcterr', well_definedness_error | |
| 4505 | ], 'Check wd error for function application outside of domain.'). | |
| 4506 | cli_testcase(1864, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4507 | '-p', 'TRY_FIND_ABORT', 'TRUE', | |
| 4508 | '-eval', 'f : 1..2 --> 3..4 & f(3) = 3', % total function; hits another area of ProB source code | |
| 4509 | '-expcterr', well_definedness_error | |
| 4510 | ], 'Check wd error for function application outside of domain.'). | |
| 4511 | cli_testcase(1865, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4512 | '-evalt', 'idc = {x,y|x:INTEGER & y:INTEGER & y=x} & res = idc[{550}] & res = {550}', | |
| 4513 | '-evalt', 'idc = {x,y|x:INTEGER & y:NATURAL & y=x} & res = idc[{550}] & res = {550}', | |
| 4514 | %'-evalt', 'idc = {x,y|x:NATURAL & y:NATURAL & y=x} & res = idc[{550}] & res = {550}', | |
| 4515 | '-evalt', 'idc = {x,y|x:INTEGER & y:NATURAL & y=x} & res = idc[{-550}] & res={}', | |
| 4516 | '-evalt', 'idc = {x,y|x:INTEGER & y:INTEGER & y=x} & dom(idc)=INTEGER' | |
| 4517 | ], 'Check that id closures can be manipulated'). | |
| 4518 | cli_testcase(1866, [b_test,wd], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4519 | '-eval', '22 mod -3', | |
| 4520 | '-expcterr', well_definedness_error | |
| 4521 | ], 'Check wd error for modulo negative number.'). | |
| 4522 | cli_testcase(1867, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4523 | '-p', 'REMOVE_IMPLIED_CONSTRAINTS', 'TRUE', | |
| 4524 | '-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' | |
| 4525 | ], 'Exercise REMOVE_IMPLIED_CONSTRAINTS'). | |
| 4526 | cli_testcase(1868, [while,private], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4527 | '../prob_examples/examples/B/Thales/Ticket_closure_body_enum/ENV_Model.prob', | |
| 4528 | %'../prob_examples/examples/B/Thales/Ticket_closure_body_enum/src/test/environment/ENV_Model.mch', | |
| 4529 | '-t' | |
| 4530 | ], 'Check that closure body enumeration in while issue fixed.'). | |
| 4531 | cli_testcase(1869, [b_test], | |
| 4532 | [%'../prob_examples/public_examples/B/Benchmarks/scheduler.mch', % does not work with non-det | |
| 4533 | '../prob_examples/public_examples/B/Benchmarks/phonebook7.mch', | |
| 4534 | '-strict','-t', | |
| 4535 | '-p', 'MAX_OPERATIONS', 0], 'Check that trace replay works with MAX_OPERATIONS == 0'). | |
| 4536 | cli_testcase(1870, [b_test,while], | |
| 4537 | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4538 | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', | |
| 4539 | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain2.mch', | |
| 4540 | '../prob_examples/public_examples/B/Tester/OpCalls/SwitchParameters2.mch', | |
| 4541 | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain_v2/GetTrain2.mch', | |
| 4542 | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain_v2/GetTrain2_LargeVariant.mch', | |
| 4543 | '../prob_examples/public_examples/B/Tester/OpCalls/GetTrain_v2/GetTrain3.mch', | |
| 4544 | '../prob_examples/public_examples/B/Tester/OpCalls/ReadOutput/OpCallR.ref', | |
| 4545 | '-strict','-t'], 'Check that OpCalls can be used to assign output with same result variable name'). | |
| 4546 | cli_testcase(1871, [b_test], | |
| 4547 | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4548 | '../prob_examples/public_examples/B/Tester/OpCalls/ReadOutput/OpCallErrR.ref', '-mc', 10, '-nodead', | |
| 4549 | '-strict', '-expcterr', 'precondition_error' | |
| 4550 | ], 'Check that precondition_error on output variable previous value detected'). | |
| 4551 | cli_testcase(1872, [b_test,external,strings], [ | |
| 4552 | '../prob_examples/public_examples/B/ExternalFunctions/TestLibraryStrings.mch', | |
| 4553 | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', | |
| 4554 | '-init', '-assertions'], 'Test STRING_TO_ENUM and PRETTY_PRINT_TO_STRING external function'). | |
| 4555 | cli_testcase(1873, [b_test,external,rulesdsl], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4556 | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', | |
| 4557 | '../prob_examples/public_examples/Rules/CSV/RulesChemistry.rmch', '-t'], | |
| 4558 | 'Check Rules DSL example with CSV reading'). | |
| 4559 | cli_testcase(1874, [b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4560 | '-evalt', '%x.(x:NATURAL|x) : NATURAL --> NATURAL', | |
| 4561 | '-evalf', '%x.(x:NATURAL|x) : INTEGER --> NATURAL', | |
| 4562 | '-evalf', '%x.(x:NATURAL|x) : NATURAL1 --> NATURAL', | |
| 4563 | '-evalf', '%x.(x:NATURAL1|x) : NATURAL --> NATURAL', | |
| 4564 | '-evalt', '%x.(x:NATURAL|x+1) : NATURAL --> NATURAL', | |
| 4565 | '-evalt', '%x.(x:NATURAL|x+1) : NATURAL --> NATURAL1', | |
| 4566 | '-evalf', '%x.(x:NATURAL|x-1) : NATURAL --> NATURAL', | |
| 4567 | '-evalt', '%(x,y).(x:NATURAL&y:NATURAL|x+y) : NATURAL*NATURAL --> NATURAL', | |
| 4568 | '-evalf', '%(x,y).(x:NATURAL&y:NATURAL|x+y) : NATURAL*NATURAL --> NATURAL1', | |
| 4569 | '-evalt', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) --> (2..200)', | |
| 4570 | '-evalt', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) --> (1..10000)', | |
| 4571 | '-evalf', '%(x,y).(x:1..100 & y:1..100|x+y) : (1..100)*(1..100) --> (3..200)', | |
| 4572 | '-evalt', '%(x,y).(x:1..100 & y:1..100|x*y) : (1..100)*(1..100) --> (1..10000)', | |
| 4573 | '-evalf', '%(x,y).(x:1..100 & y:1..100|x*y) : (1..100)*(1..100) --> (2..10000)', | |
| 4574 | '-evalf', '%(x,y).(x:1..100 & y:1..101|x*y) : (1..100)*(1..101) --> (1..10000)', | |
| 4575 | % '-evalt', '%(x,y).(x:0..999 & y:0..999|(x*y) mod 1000) : (0..999)*(0..999) --> (0..999)', % slow due to expansion | |
| 4576 | '-evalt', '%(x,y).(x:0..9999 & y:0..9999|(x*y) mod 10000) : (0..9999)*(0..9999) --> (0..9999)' | |
| 4577 | % TO DO: | |
| 4578 | % {x|x:NATURAL*NATURAL & prj1(INTEGER,INTEGER)(x)=prj2(INTEGER,INTEGER)(x)} : NATURAL --> NATURAL % not detected as lambda | |
| 4579 | ], 'Check new symbolic total function range detection'). | |
| 4580 | cli_testcase(1875, [b_test,external], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4581 | '../prob_examples/public_examples/B/ExternalFunctions/TestBitLibrary.mch', | |
| 4582 | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', | |
| 4583 | '-init', '-assertions' | |
| 4584 | ], 'Check new bitwise external functions BAND, BOR, BXOR,...'). | |
| 4585 | cli_testcase(1876, [error_checks,b_test], ['../prob_examples/public_examples/B/ErrorMachines/TypeErrorUnusedDefinition.mch', | |
| 4586 | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', | |
| 4587 | '-expcterrpos', definition_type_error, 9, 21, | |
| 4588 | '-expcterrpos', definition_type_error, 10, 35, | |
| 4589 | '-expcterrpos', definition_type_error, 10, 39 | |
| 4590 | ], 'Check type error in unused DEFINITION detected'). | |
| 4591 | cli_testcase(1877, [b_test,external,random], [ | |
| 4592 | '../prob_examples/public_examples/B/ExternalFunctions/TestLibraryRandom.mch', | |
| 4593 | '-mc', 100, '-assertions'], 'Test random_subset, random_permutation'). | |
| 4594 | cli_testcase(1878, [tickets,private], [ | |
| 4595 | '../prob_examples/examples/B/Alstom/Ticket_Nov28_2017/scheduler_pb.mch', '-t', | |
| 4596 | '-p', 'SYMBOLIC', 'TRUE', | |
| 4597 | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, '-check_goal', | |
| 4598 | '-evalt', 'x:in_cmd_signals', | |
| 4599 | '-evalt', 'in_cmd_signals : t_signal --> t_color', '-p', 'TIME_OUT', '7000' | |
| 4600 | ], 'Test symbolic override works as expected'). | |
| 4601 | cli_testcase(1879, [b_test,closure1], ['../prob_examples/public_examples/B/Tickets/Hansen7/ClosureTest.mch', '-init', '-expecterr', 'virtual_time_out', '-expcterr', 'setup_constants_fails'], 'Check closure now infinite'). | |
| 4602 | cli_testcase(1880, [b_test,closure1], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4603 | '-evalt', '22|->22 : closure({})', | |
| 4604 | '-evalf', '22|->21 : closure({})', | |
| 4605 | '-evalt', '22|->22 : iterate({},0)', | |
| 4606 | '-evalt', '11|->66 : closure({11|->22,22|->33,22|->44,33|->55,33|->66})', | |
| 4607 | '-evalt', '{100|->100,11|->66} <: closure({11|->22,22|->33,22|->44,33|->55,33|->66})', | |
| 4608 | '-evalt', 'closure1({11|->22,22|->33,22|->44,33|->55,33|->66}) <: closure({11|->22,22|->33,22|->44,33|->55,33|->66})', | |
| 4609 | '-evalf', '33|->22 : closure({11|->22,22|->33,22|->44,33|->55,33|->66})' | |
| 4610 | ], 'Check some reflexive closure predicates'). | |
| 4611 | cli_testcase(1881, [cbc,symmetry_test], ['../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetTest1.mch', '-mc', '15', | |
| 4612 | '-nodead', | |
| 4613 | '-cc', '7', '6', '-strict' ], 'Check that static symmetry reduction works as expected'). | |
| 4614 | cli_testcase(1882, [b_test,closure1], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4615 | '-evalt', '!(x,y).(x:S & y:S => (x>y => x=y+2)) & S = {0,x} & x>0', | |
| 4616 | '-evalf', '!(x,y).(x:S & y:S => (x>y => x=y+2)) & S = {0,x,y} & x>y & y>0', | |
| 4617 | '-evalf', '!(x,y).(x:y & y<:1..2 => x>2)' | |
| 4618 | ], 'Test forall splitting'). | |
| 4619 | cli_testcase(1883, [b_test,closure1], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4620 | '-evalf', 'x: 1..n --> 1..n & closure1(x)[{1}] = {} & n=25', | |
| 4621 | '-evalt', 'x: 1..n --> 1..n & closure1(x)[{1}] = 3..n & n=7' | |
| 4622 | ], 'Check image for closure1 improvements'). | |
| 4623 | cli_testcase(1884, [b_test], ['../prob_examples/public_examples/B/FeatureChecks/DeferredSetAndConstants2.mch', '-mc', '5', | |
| 4624 | '-nodead', | |
| 4625 | '-cc', '3', '2', '-strict'], 'Check that enumerated set / partition detection works'). | |
| 4626 | cli_testcase(1885, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4627 | '-p', 'TRY_FIND_ABORT', 'FALSE', | |
| 4628 | '-evalf', 'f = %x.(x:1..90|100+x) & f(v)+f(w)+f(y)+f(z) < 400', | |
| 4629 | '-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', | |
| 4630 | '-evalt', 'v={1|->rec(a:11,b:22), 2|->rec(a:22,b:33)}& r={x|v(x)\'b = x}' | |
| 4631 | ], 'Test improved propagation for function application, also in combination with record field reduction in b_compiler'). | |
| 4632 | cli_testcase(1886,[private, data_validation,alstom,codespeed],[ | |
| 4633 | '../prob_examples/examples/B/Alstom/sgd_Jun11/vital_gradient_v3/vital_gradient_optimized.mch', | |
| 4634 | '-p', 'DATA_VALIDATION', 'TRUE', % data_validation_mode preference | |
| 4635 | '-p', 'CLPFD', 'TRUE', '-p', 'MAXINT', '2147483647', '-p', 'MININT', '-2147483648', '-p', 'TIME_OUT', '35000', '-t'], | |
| 4636 | 'test 1105 in DATA_VALIDATION mode'). | |
| 4637 | cli_testcase(1887, [b_test,symmetry_test], [ | |
| 4638 | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest1.mch', | |
| 4639 | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest2.mch', | |
| 4640 | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest3.mch', | |
| 4641 | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest4.mch', | |
| 4642 | '../prob_examples/public_examples/B/SymmetryReduction/StaticSymmetryReduction/DefSetPartTest5.mch', | |
| 4643 | '-mc', '1000', '-nodead', '-nogoal', '-assertions', '-strict'], 'Check that partition symmetry reduction works'). | |
| 4644 | cli_testcase(1888, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4645 | '-p', 'TRY_FIND_ABORT', 'FALSE', | |
| 4646 | '-eval', 'v = %x.(x:1..20|x+x) & y<4 & z=v(y) & (y:{-1,2}) & y /= 2', | |
| 4647 | '-expcterr', well_definedness_error | |
| 4648 | ], 'Test improved propagation for function application does not prevent finding WD problem'). | |
| 4649 | cli_testcase(1889, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4650 | '-p', 'TRY_FIND_ABORT', 'FALSE', | |
| 4651 | '-eval', 'v = %x.(x:1..20|x+x) & {y,z|y<4 & z=v(y) & (y:{-1,2})} =res', | |
| 4652 | '-expcterr', well_definedness_error | |
| 4653 | ], 'Test improved propagation for function application does not prevent finding WD problem'). | |
| 4654 | cli_testcase(1890, [private,data_validation], ['../prob_examples/examples/B/Systerel/C578/2013/machines_24092013/07_001.mch', | |
| 4655 | '-init' ,'-assertions', '-p', 'SYMBOLIC', 'TRUE', '-p', 'MEMO', 'TRUE', '-p', 'TIME_OUT', 39500, | |
| 4656 | '-p', 'DETECT_LAMBDAS', 'TRUE', | |
| 4657 | '-p', 'ENUMERATE_INFINITE_TYPES', 'FALSE', '-p', 'EXPAND_FORALL_UPTO', 0 ], 'Test 1161 with lambda detection'). | |
| 4658 | cli_testcase(1891, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4659 | '../prob_examples/public_examples/B/CBC/Tests/TestSequenceVariable.mch', | |
| 4660 | '-cbc', 'all', '-expcterr', cbc | |
| 4661 | ], 'Test cbc finds error with sequence type'). | |
| 4662 | cli_testcase(1892, [cbc,symmetry_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4663 | '../prob_examples/public_examples/B/CBC/Tests/TestPartitionStaticSymReduction.mch', | |
| 4664 | '-cbc', 'all' | |
| 4665 | ], 'Test static symmetry reduction works with cbc'). | |
| 4666 | cli_testcase(1893, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4667 | '-evalf', '{1,2}*(1..1000) = {}', | |
| 4668 | '-evalt', '{1,2}*(1..1000) /= {}', | |
| 4669 | '-evalf', '{1,2}*x = {} & x<:INTEGER & 22:x', | |
| 4670 | '-evalt', '{1,2}*x /= {} & x<:INTEGER & 22:x', | |
| 4671 | '-evalf', 'x*x = {} & x<:INTEGER & 22:x', | |
| 4672 | '-evalt', 'x*x /= {} & x<:INTEGER & 22:x' | |
| 4673 | ], 'Test improved detection of empty cartesian product closures'). | |
| 4674 | cli_testcase(1894, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4675 | '../prob_examples/public_examples/B/CBC/RiverCrossing_BMC.mch', | |
| 4676 | '-init', '-assertions', '-model-check', '-nogoal', '-nodead' | |
| 4677 | ], 'Test constraints solved quickly'). | |
| 4678 | cli_testcase(1895, [b_test,let], [ | |
| 4679 | '-evalt', '40 = LET i,j BE i=10 & j=i+20 IN i+j END' | |
| 4680 | ], 'ensure error in nested LET expression detected'). | |
| 4681 | cli_testcase(1896, [proz,let], [ '../prob_examples/public_examples/Z/Daniel/tests/let.tex', '-t', | |
| 4682 | '-mc', 2000, '-cc', 1839, 4195 | |
| 4683 | ], 'ensure Zed LETs treated correctly'). | |
| 4684 | cli_testcase(1897, [cbc,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4685 | '-evalt', 'card(%(x,y).(x:(1..10) --> BOOL&y:iseq(1..2)|1)) = 5120', | |
| 4686 | '-evalt', 'card(%(x,y).(x:(1..10) --> BOOL&y:(1..10) --> BOOL|1))>100', | |
| 4687 | '-evalt', 'card(%(x,y).(x:(1..10) --> BOOL&y:(1..10) +-> BOOL|1))>100', | |
| 4688 | '-evalt', 'card(%(x,y).(x:(1..10) -->> BOOL&y:(1..10) +->> BOOL|1))>100', | |
| 4689 | '-evalt', 'card(%(x,y).(x:(1..10) <-> BOOL&y:(1..10) >->> (2..11)|1))>100' | |
| 4690 | ], 'Test improved detection of cartesian product closures'). | |
| 4691 | cli_testcase(1898, [tickets,strings], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4692 | '-evalt', 'x = "a\\\\" & y="bcd"', | |
| 4693 | '-evalf', 'x = "a\\\\" & x="a"' | |
| 4694 | ], 'Test \\ at end of string (no pushback overflow)'). | |
| 4695 | cli_testcase(1899, [tickets,proz], [ '-p', 'MAX_OPERATIONS', 900, % TO DO: try and reduce the need for this high value | |
| 4696 | '../prob_examples/examples/Z/Patterns/forProB/ReturnHome ProZ v1.tex', | |
| 4697 | '-t', '-model-check'], | |
| 4698 | 'Ensure no timeouts'). | |
| 4699 | cli_testcase(1900, [tickets,proz], [ '-p', 'MAX_OPERATIONS', 1800, | |
| 4700 | '../prob_examples/examples/Z/Patterns/forProB/ReturnHome ProZ v2.tex', | |
| 4701 | '-t', '-model-check'], | |
| 4702 | 'Ensure no timeouts'). | |
| 4703 | cli_testcase(1901, [tickets], [ | |
| 4704 | '../prob_examples/public_examples/B/ErrorMachines/LET_Illegal.mch', | |
| 4705 | '-expcterrpos', type_error, 14, 35, '-expcterrpos', type_error, 14, 53, '-expcterr', load_main_file], | |
| 4706 | 'check illegal LET detected'). | |
| 4707 | cli_testcase(1902, [tickets], [ | |
| 4708 | '../prob_examples/examples/B/Alstom/Ticket_LET_Mar26_2018/essai.mch', | |
| 4709 | '-expcterrpos', type_error, 25, 5, '-expcterr', load_main_file], | |
| 4710 | 'check illegal LET detected and no infinite loop in typechecker'). | |
| 4711 | cli_testcase(1903, [b_test,infinite,total_function], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4712 | '-evalt', 'f = NATURAL1 * {22} & f: NATURAL1 --> NATURAL', | |
| 4713 | '-evalt', 'f = %x.(x:NATURAL1|x+1) & f: NATURAL1 --> NATURAL', | |
| 4714 | '-evalf', 'f = %x.(x:NATURAL|x+1) & f: NATURAL1 --> NATURAL', | |
| 4715 | '-evalt', 'f = /*@symbolic*/ {x|x:NATURAL1*INTEGER & prj2(INTEGER,INTEGER)(x)=prj1(INTEGER,INTEGER)(x)+1} & r = f(2)', | |
| 4716 | % '-evalt', 'f = /*@symbolic*/ {x|x:NATURAL1*INTEGER & prj2(INTEGER,INTEGER)(x)=prj1(INTEGER,INTEGER)(x)+1} & f: NATURAL1 --> NATURAL' % TODO | |
| 4717 | %'-evalf', 'f = NATURAL1 * {22,33} & f: NATURAL1 --> NATURAL' %% TO DO | |
| 4718 | '-evalt', ' %(x,z).(x:NATURAL & z:NATURAL|x+z) : (NATURAL*NATURAL)-->NATURAL', | |
| 4719 | '-evalt', ' %(x,z).(x:NATURAL & z:NATURAL|max({z,x,x/z,-x})) : (NATURAL*NATURAL)-->NATURAL' | |
| 4720 | %'-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 | |
| 4721 | ], 'Test symbolic treatment of total function'). | |
| 4722 | cli_testcase(1904,[enabling],[ | |
| 4723 | '../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6.mch', | |
| 4724 | '-t', | |
| 4725 | '-read_write_matrix_csv', '../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6_rw_matrix.csv' | |
| 4726 | ], 'Check read-write-matrix with nested operation calls.'). | |
| 4727 | cli_testcase(1905, [b_test,infinite,total_function,card], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4728 | '-p', 'CLPFD', 'FALSE', '-p', 'DISPROVER_MODE', 'TRUE', | |
| 4729 | '-evalt', 'card({x|x > 2 & x mod 2 =0 & x<=10})=4', | |
| 4730 | '-evalt', '{x|x > 2 & x mod 2 =0 & x<=10} = {4,6,8,10}', | |
| 4731 | '-evalt', '{x|x > 2 & x mod 2 =0 & x<10} = {4,6,8}', | |
| 4732 | '-evalt', '{x|x >= 2 & x mod 2 =0 & x<10} = {2,4,6,8}', | |
| 4733 | '-evalt', '{x|x : NATURAL & x mod 2 = 0 & x <= 10} = {0,2,4,6,8,10}', | |
| 4734 | '-evalt', '{x|x : NATURAL1 & x mod 2 = 0 & x <= 10} = {2,4,6,8,10}' | |
| 4735 | ], 'Test improved integer enumeration in non-CLPFD mode'). | |
| 4736 | cli_testcase(1906, [b_test,while], | |
| 4737 | ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4738 | '-p', 'TYPE_CHECK_DEFINITIONS', 'TRUE', | |
| 4739 | '../prob_examples/examples/B/SupervisoryControl/obs1/DES_12_3_Prop4_H_Fig8b_PartitionV1.mch', | |
| 4740 | '-strict','-t'], 'Check that type checking definitions not confounded by parameter/variable A clash'). | |
| 4741 | cli_testcase(1907,[csp_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4742 | '../prob_examples/public_examples/CSP/Tickets/WilliamsCSPB/AirportsCtrl.csp', | |
| 4743 | '-t', '-strict'], 'Testing example with src_span_operator.'). | |
| 4744 | cli_testcase(1908,[csp_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4745 | '../prob_examples/examples/B/ASTD/Library/Library_2_1.csp', | |
| 4746 | '-t', '-mc', 90, '-strict'], 'Test state space finite using new [] normalisation rule.'). | |
| 4747 | cli_testcase(1909, [ltl,xtl], ['../prob_examples/public_examples/XTL/BauerZiege.P', | |
| 4748 | '-ltlformulat', 'G not(deadlock)', | |
| 4749 | '-ltlformulaf', 'G not(e(move))', | |
| 4750 | '-ltlformulaf', 'G not({unsafe})'], 'Test XTL LTL example'). | |
| 4751 | cli_testcase(1910, [b_test,pragmas], [ | |
| 4752 | '../prob_examples/public_examples/B/Pragmas/package_pragma/a/aa/Machine_A.mch', | |
| 4753 | '-init'], 'Test package pragme with dot'). | |
| 4754 | cli_testcase(1911, [tickets,tla,wd], [ | |
| 4755 | '../prob_examples/public_examples/TLA/Thales/PingPong/scn_1_node.tla', | |
| 4756 | '../prob_examples/public_examples/TLA/Thales/PingPong_ASSERT/scn_1_node.tla', | |
| 4757 | '-t', '-mc', 40], 'Check no wd errors thrown'). | |
| 4758 | cli_testcase(1912, [cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4759 | '-evalf', 'NATURAL \\{1} \\ {2} = NATURAL \\ {3} \\ {1}', | |
| 4760 | '-evalt', 'NATURAL \\{1} \\ {2} = NATURAL \\ {2} \\ {1}', | |
| 4761 | '-evalt', 'NATURAL \\{12} \\ {22} = NATURAL \\ {22} \\ {12}', | |
| 4762 | '-evalt', 'NATURAL1 \\{12} \\ {22} = NATURAL1 \\ {22} \\ {12}', | |
| 4763 | '-evalt', 'NATURAL \\{0} \\ {2} = NATURAL \\ {2} \\ {0}', | |
| 4764 | '-evalt', 'NATURAL \\{0} \\ {1} = NATURAL \\ {1} \\ {0}', | |
| 4765 | '-evalf', 'NATURAL \\{0} \\ {2} = NATURAL \\ {1} \\ {0}', | |
| 4766 | '-evalf', 'NATURAL \\{0} \\ {1} = NATURAL \\ {2} \\ {0}', | |
| 4767 | '-evalt', 'NATURAL1 \\{12} \\ {22} = NATURAL \\ {22} \\ {12} \\ {0}', | |
| 4768 | '-evalf', 'NATURAL1 \\{12} = NATURAL \\{12}', | |
| 4769 | '-evalf', '{x|x>22 & x<100} = {y|y>=k}', | |
| 4770 | '-evalt', '{x|x>22} = {y|y>=k}', | |
| 4771 | '-evalt', '{x|x>22} = {x|x>=k}', | |
| 4772 | '-evalt', '{x|x>22 & x<100} = {y|y>=k & y<m}', | |
| 4773 | '-evalt', '{x,y|x>22&y>100} = /*@symbolic*/ {y1,x1|x1>k & y1>m}', | |
| 4774 | '-evalf', 'NATURAL1 = NATURAL - {1}', | |
| 4775 | '-evalt', 'NATURAL1 = NATURAL - {0}', | |
| 4776 | '-evalt', 'NATURAL1 = NATURAL1 - {0}', | |
| 4777 | '-evalf', '{x|x>0 & x mod 22 = 0 & x < 1000} = NATURAL' | |
| 4778 | %'-evalf', '{x|x>0 & x mod 22 = 0 & x < 1000} = NATURAL \\{12}' % commented out for the moment; conflict with 1081 | |
| 4779 | ], 'ensure symbolic treatment of equality'). | |
| 4780 | cli_testcase(1913, [cbc], [ | |
| 4781 | '-evalf', '{x|x>0 & x mod 22 = 0} = NATURAL \\{12}', | |
| 4782 | '-evalf', '{x|x>0 & x mod 2 = 0} = {x|x>0 & x mod 3 = 0}', | |
| 4783 | '-evalt', '{x|x>0 & x /= 22} = {x|x>0 & (x = 22 => x>22)}', | |
| 4784 | '-evalf', 'NATURAL1 \\{12} = INTEGER \\{12}' | |
| 4785 | ], 'ensure symbolic treatment of equality'). | |
| 4786 | cli_testcase(1914, [cbc,sequences], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4787 | '-evalt', 'x:iseq(50001..50002) & y:1..100005 & SIGMA(yy).(yy:1..size(x)|x(yy)) = y & y>50002', | |
| 4788 | '-evalt', 'x:iseq(50001..50002) & y:1..100005 & SIGMA(yy).(yy:dom(x)|x(yy)) = y & y>50002', | |
| 4789 | '-evalt', 'x:iseq(80001..80002) & y:1..100005 & SIGMA(yy).(yy:dom(x)|x(yy)) = y' | |
| 4790 | ], 'ensure earlier enumeration of iseq'). | |
| 4791 | cli_testcase(1915, [cbc,private,enabling,wd], ['../prob_examples/examples/B/Alstom/etcs/actions_scn_f6_372_bis.mch', | |
| 4792 | '-feasibility_analysis_csv', 1000, '../prob_examples/examples/B/Alstom/etcs/actions_feasibility.csv' | |
| 4793 | ], 'Check that feasibility can be shown without wd errors'). | |
| 4794 | cli_testcase(1916,[cbc],[ | |
| 4795 | '../prob_examples/public_examples/EventBPrologPackages/Advance/CAN_Bus/CB3FSMM_mch_v2.eventb', | |
| 4796 | '-cbc', 'T2ReleaseBus', '-expcterr', 'cbc' | |
| 4797 | ], 'Check invariant violation found despite use of unproven finite() in invariant'). | |
| 4798 | cli_testcase(1917, [b_test], ['-strict', '../prob_examples/public_examples/B/FeatureChecks/DeferredSetMaxCardWithUnion.mch', '-init' ,'-assertions'], 'check enumerated set detected despite use of subsidiary identifier'). | |
| 4799 | cli_testcase(1918, [refinement], ['../prob_examples/public_examples/B/EventB_AtelierB/SimpleCounter1.ref', | |
| 4800 | '-t', '-mc', 100, '-cc', 10, 28, | |
| 4801 | '-strict'], 'Test ref keyword for Atelier-B Event-B model'). | |
| 4802 | cli_testcase(1919, [external], ['../prob_examples/public_examples/B/ExternalFunctions/SORT_External.mch', | |
| 4803 | '-assertions', '-t'], 'test SORT and SQUASH external functions'). | |
| 4804 | cli_testcase(1920,[while, codespeed],[ | |
| 4805 | '../prob_examples/public_examples/B/PerformanceTests/While/LiftExec.mch','-strict', | |
| 4806 | '-init', '-property', 'LIM=500', '-p', 'TIME_OUT', 2500, | |
| 4807 | '-animate', 1, | |
| 4808 | '-goal', 'counter=LIM', '-check_goal' ], 'Performance of while loop'). | |
| 4809 | cli_testcase(1921,[wd, error_checks],[ | |
| 4810 | '../prob_examples/public_examples/B/ErrorMachines/WD_SetCompr_Error.mch', '-strict', | |
| 4811 | '-init', '-expcterr', well_definedness_error, | |
| 4812 | '-expcterr', 'setup_constants_fails' | |
| 4813 | ], 'Check error detected and no constants found'). | |
| 4814 | cli_testcase(1922,[wd, tickets],[ | |
| 4815 | '../prob_examples/public_examples/B/Tickets/VBF_DB_EnumWarning/Ticket.mch', '-strict', | |
| 4816 | '-init' | |
| 4817 | ], 'Check no enum warning raised due to large CLPFD interval but small fd_size'). | |
| 4818 | cli_testcase(1923, [tickets,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4819 | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, | |
| 4820 | '-evalt', 'x <: INT - {0}', | |
| 4821 | '-evalf', '{0,1,2} <: INT - {0}', | |
| 4822 | '-evalt', '{-2147483647,1,2,2147483647} <: INT - {0}', | |
| 4823 | '-evalf', '{2147483648} <: INT - {0}' | |
| 4824 | ], 'ensure symbolic treatment of set difference'). | |
| 4825 | cli_testcase(1924,[tickets,while],[ | |
| 4826 | '../prob_examples/public_examples/B/Tester/OpCalls/ParaClash/Call1.mch', '-strict', | |
| 4827 | '-t' | |
| 4828 | ], 'Check no issue with compilation of operation calls with id clashes'). | |
| 4829 | cli_testcase(1925,[tickets,while],[ | |
| 4830 | '../prob_examples/public_examples/B/Tester/OpCalls/ParaClash/Call1_Clash.mch', '-strict', | |
| 4831 | '-expcterr', bmachine_static_checks, % Warnings about variable clashes | |
| 4832 | '-t' | |
| 4833 | ], 'Check no issue with compilation of operation calls with id clashes'). | |
| 4834 | cli_testcase(1926,[alloy],[ | |
| 4835 | '../prob_examples/public_examples/Alloy/SimpleTests/Join_Binary.als', | |
| 4836 | '../prob_examples/public_examples/Alloy/SimpleTests/Join_Complex.als', | |
| 4837 | '../prob_examples/public_examples/Alloy/SimpleTests/Quantifiers.als', | |
| 4838 | '../prob_examples/public_examples/Alloy/SimpleTests/Comprehension.als', | |
| 4839 | '../prob_examples/public_examples/Alloy/SimpleTests/CartesianProduct.als', | |
| 4840 | '../prob_examples/public_examples/Alloy/SimpleTests/Restrictions.als', | |
| 4841 | '../prob_examples/public_examples/Alloy/SimpleTests/EmptyAssert.als', | |
| 4842 | '../prob_examples/public_examples/Alloy/SimpleTests/EmptyPred.als', | |
| 4843 | '../prob_examples/public_examples/Alloy/SimpleTests/Arithmetic.als', | |
| 4844 | '../prob_examples/public_examples/Alloy/SimpleTests/TestUtilBool.als', | |
| 4845 | '../prob_examples/public_examples/Alloy/Puzzles/harry-potter.als', | |
| 4846 | '../prob_examples/public_examples/Alloy/Puzzles/queens.als', | |
| 4847 | '../prob_examples/public_examples/Alloy/Puzzles/queens_with_pred.als', | |
| 4848 | '-strict', '-t' | |
| 4849 | ], 'Check Alloy translation'). | |
| 4850 | cli_testcase(1927,[alloy,cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4851 | '../prob_examples/public_examples/Alloy/alloy_models/toys/grandpa.als', | |
| 4852 | '../prob_examples/public_examples/Alloy/alloy_models/toys/grandpa.als', | |
| 4853 | '-cbc_sequence', run0, | |
| 4854 | '-expcterr', 'cbc_sequence_no_solution_found', | |
| 4855 | '-strict'], 'Test Alloy model and *no* solution for run0'). | |
| 4856 | cli_testcase(1928,[alloy,cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4857 | '../prob_examples/public_examples/Alloy/SimpleTests/multiplicity_birthday_test.als', | |
| 4858 | '-t', '-mc', 100, '-cc', 3, 3, % 3 nodes: root, setup_constants, init | |
| 4859 | '-strict'], 'Test Alloy models have exactly one solution'). | |
| 4860 | cli_testcase(1929,[alloy,cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4861 | '../prob_examples/public_examples/Alloy/laws/orderings.als', | |
| 4862 | '-cbc_sequence', check0, | |
| 4863 | '-strict'], 'Test Alloy model and solution for run0 found'). | |
| 4864 | cli_testcase(1930,[alloy,cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4865 | '../prob_examples/public_examples/Alloy/alloy_models/systems/lists.als', | |
| 4866 | '-cbc_sequence', run0, | |
| 4867 | '-strict'], 'Test Alloy model and solution for run0 found'). | |
| 4868 | cli_testcase(1931,[b_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4869 | '../prob_examples/public_examples/B/FeatureChecks/DEFINITIONS/VariableListAsDEFINITION.mch', | |
| 4870 | '-init'], 'Try using DEFINITION as variable list'). | |
| 4871 | cli_testcase(1932,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4872 | '../private_examples/Thales/Hansen_CSV_Loop/CSV_Input.rmch', | |
| 4873 | '-execute_all', '-animate_stats', '-p', 'CLPFD', 'TRUE'], 'Ensure complex set unification due to partial sequence skeleton is avoided'). | |
| 4874 | /* requires new parser: */ | |
| 4875 | cli_testcase(1933, [union,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4876 | '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, | |
| 4877 | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x,x+100}) & 100:r', | |
| 4878 | '-evalf', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x,x+100}) & -100:r', | |
| 4879 | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x+1}) & 1:r & 0/:r', | |
| 4880 | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x+2,x+3}) & 2:r & 1/:r', | |
| 4881 | '-evalt', 'r = /*@symbolic*/ {u|#x.(x : NATURAL & u : {x |-> x * x,x |-> x + x})} & 10|->20 : r', | |
| 4882 | '-evalt', '!y.(y:10..12 => #x.(x : NATURAL & y|->2*y : {x |-> x * x,x |-> x + x}))', | |
| 4883 | '-evalf', '!y.(y:10..12 => #x.(x : NATURAL & y|->3*y : {x |-> x * x,x |-> x + x}))', | |
| 4884 | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x|->x*x, x|->x+x}) & r[10..11]=x', | |
| 4885 | '-evalt', 'r = /*@symbolic*/ UNION(x).(x:NATURAL|{x|->x*x, x|->x+x}) & r[10..11]={20,22,100,121}', | |
| 4886 | '-evalt', '{u,v|u=10|->v & #x.(x : NATURAL & u : {x |-> x * x,x |-> x + x})} = {((10|->20)|->20),((10|->100)|->100)}' | |
| 4887 | ], 'ensure symbolic treatment of UNION'). | |
| 4888 | cli_testcase(1934,[cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4889 | '../prob_examples/public_examples/B/Tester/TestProjection.mch', | |
| 4890 | '-assertions'], 'Ensure projection onto static assertion filters out unrelated constant'). | |
| 4891 | cli_testcase(1935,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4892 | '../private_examples/Thales/Hansen_EnumerationProblem/Runner_EnumerationProblem.rmch', | |
| 4893 | '-execute_all', '-animate_stats', | |
| 4894 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4895 | '-p', 'TRY_FIND_ABORT', 'TRUE', '-p', 'DATA_VALIDATION', 'TRUE', | |
| 4896 | '-silent', '-noinv'], 'Ensure no time-out in COMP_CSVRecords'). | |
| 4897 | cli_testcase(1936,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4898 | '../private_examples/Thales/Hansen_EnumerationProblem/Runner_EnumerationProblem.rmch', | |
| 4899 | '-execute_all', '-animate_stats', | |
| 4900 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4901 | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'DATA_VALIDATION', 'TRUE', | |
| 4902 | '-silent', '-noinv'], 'Ensure no time-out in COMP_CSVRecords (TRY_FIND_ABORT=FALSE)'). | |
| 4903 | 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'). | |
| 4904 | cli_testcase(1938, [laws,strings,external], ['../prob_examples/public_examples/B/Laws/StringLiteralTests.mch', '-assertions', '-strict'], 'Some tests about the STRING literals'). | |
| 4905 | cli_testcase(1939, [union,infinite], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4906 | '-p', 'MAXINT', 127, '-p', 'MININT', -128, | |
| 4907 | '-evalt', 'x = INTEGER \\ {1000} & !v.(v:x => v/=1000)', | |
| 4908 | '-evalf', 'x = INTEGER \\ {1000} & !v.(v:x => v>2000)', | |
| 4909 | '-evalt', 'x = INTEGER \\ {10} & x \\/ {11} = res & res=x' | |
| 4910 | ], 'Test for not-member closures'). | |
| 4911 | cli_testcase(1940, [tickets,pragmas], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4912 | '-aa', 2, 0, 0, % check that label pragmas respected | |
| 4913 | '-properties', | |
| 4914 | '../prob_examples/public_examples/B/Tickets/Pragmas/LabelBoolPragmaDisappears.mch' | |
| 4915 | ], 'Test label pragma respected by assertions'). | |
| 4916 | cli_testcase(1941, [refinement,b_test], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4917 | '-init', | |
| 4918 | '-dot', invariant, '../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1_invariant.dot', | |
| 4919 | '../prob_examples/public_examples/B/RefinementChecking/LinkingInvariants/M1.ref' | |
| 4920 | ], 'Test one invariant copied from abstract machine'). | |
| 4921 | cli_testcase(1942, [error_checks], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4922 | '../prob_examples/examples/B/Satpathy/SystemOnChip/Router.mch', '-t' | |
| 4923 | ], 'Check no bmachine_static_checks for disjunction in invariant'). | |
| 4924 | cli_testcase(1943, [b_test,external], ['../prob_examples/public_examples/B/ExternalFunctions/TestLibraryRegexp.mch', '-assertions'], 'Test Regular Expression Library'). | |
| 4925 | cli_testcase(1944,[eventb_test],[ | |
| 4926 | '../prob_examples/public_examples/EventBPrologPackages/TreeFileSysContPerm/FMCH02.eventb', | |
| 4927 | '-t', '-p', 'DEFAULT_SETSIZE', 2 | |
| 4928 | ], 'Check Event-B model with complicated properties (and axiomatized transitive closure)'). | |
| 4929 | cli_testcase(1945,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4930 | '../private_examples/ClearSy/N_ITERa_avec_DV_sans_DV/rule_avec_DV.mch', | |
| 4931 | '-execute_all', '-animate_stats', | |
| 4932 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4933 | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'DATA_VALIDATION', 'TRUE', | |
| 4934 | '-silent', '-noinv'], 'Ensure no problem with caval__rule__2__ALL set comprehension and lifting out of exists quantifier'). | |
| 4935 | cli_testcase(1946,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4936 | '../private_examples/ClearSy/N_ITERa_avec_DV_sans_DV/rule_avec_DV.mch', | |
| 4937 | '-execute_all', '-animate_stats', | |
| 4938 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4939 | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'LIFT_EXISTS', 'TRUE', | |
| 4940 | '-silent', '-noinv'], 'Ensure no problem with caval__rule__2__ALL set comprehension and lifting out of exists quantifier'). | |
| 4941 | cli_testcase(1947, [smt_solver_integration], [ | |
| 4942 | '../prob_examples/public_examples/B/Tickets/Z3/Aufgabe2.mch', '-init', '-vv', | |
| 4943 | '-evalt', ':z3 x:liefert', | |
| 4944 | '-evalt', ':z3 x:bes', | |
| 4945 | '-evalt', ':z3 x|->a3:liefert', | |
| 4946 | '-evalf', ':z3 l2|->a3:liefert', | |
| 4947 | '-evalt', ':z3 x:liefert[{l1}]', | |
| 4948 | '-evalt', ':z3 x:liefert[{l1}] & k|->b : bes & x:b', % takes 220 ms ! | |
| 4949 | '-evalf', ':z3 x:liefert[{l1}] & k|->b : bes & x:b & k /= k2 & x /= a1 & k /= k3' | |
| 4950 | ], 'some constraints that should be solved by z3; check ticket with ProB state'). | |
| 4951 | cli_testcase(1948, [infinite,tickets], [ | |
| 4952 | '../prob_examples/public_examples/B/Tickets/Hansen36_Lambda/TestBugly.mch', '-init', | |
| 4953 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4954 | '-p', 'TRY_FIND_ABORT', 'FALSE', '-p', 'TRACE_INFO', 'TRUE', | |
| 4955 | '-mc', 100, '-nodead' | |
| 4956 | ], 'check nested function calls cause no problem'). | |
| 4957 | cli_testcase(1949, [b_test], [ | |
| 4958 | '-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)}' | |
| 4959 | ], 'test ELSIF for expressions'). | |
| 4960 | cli_testcase(1950,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4961 | '../private_examples/ClearSy/Well_def_1.9.0_b5/Err/rule_SSO_SLOT_MSG_ID_SET_SSO/rule.mch', | |
| 4962 | '-execute_all', '-animate_stats', | |
| 4963 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4964 | '-p', 'DATA_VALIDATION', 'TRUE', | |
| 4965 | '-p', 'COMPRESSION', 'TRUE', | |
| 4966 | '-silent'], 'Ensure wd-problem solved'). | |
| 4967 | cli_testcase(1951,[wd,tickets],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4968 | '../prob_examples/examples/B/ClearSy/Tickets/Well_def_1.9.0_b5/rule_bugly.mch', | |
| 4969 | '-execute_all', '-animate_stats', | |
| 4970 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4971 | '-p', 'DATA_VALIDATION', 'TRUE', | |
| 4972 | '-p', 'COMPRESSION', 'TRUE', | |
| 4973 | '-silent'], 'Ensure wd-problem solved (BUGLY version of test 1950)'). | |
| 4974 | cli_testcase(1952,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4975 | '../private_examples/ClearSy/ComparePv10Pv11/DebugPv10/rule_Test__RGP_71237__RI_091/rule.mch', | |
| 4976 | '../private_examples/ClearSy/ComparePv10Pv11/DebugPv11/rule_Test__RGP_71237__RI_091/rule.mch', | |
| 4977 | '-execute', 9, '-animate_stats', '-silent', | |
| 4978 | '-p', 'CLPFD', 'FALSE', '-p', 'TIME_OUT', 1000, | |
| 4979 | '-p', 'DATA_VALIDATION', 'TRUE', | |
| 4980 | '-p', 'COMPRESSION', 'TRUE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, | |
| 4981 | '-silent'], 'Ensure in_domain delay solved'). | |
| 4982 | cli_testcase(1953,[b_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4983 | '../prob_examples/public_examples/B/NewSyntax/CallOperationInExprSimple.mch', | |
| 4984 | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', | |
| 4985 | '-t', '-assertions', | |
| 4986 | '-evalt', 'Double(33)=66', | |
| 4987 | '-evalt', 'Double(Double(33))=132', | |
| 4988 | '-evalf', 'Double(3)=3', | |
| 4989 | '-evalt', 'Divisors(17)=2' | |
| 4990 | ], 'Test calling operations in expressions'). | |
| 4991 | cli_testcase(1954,[b_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4992 | '../prob_examples/public_examples/B/NewSyntax/CallOperationInExpr_Compile.mch', | |
| 4993 | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', | |
| 4994 | '-t' | |
| 4995 | ], 'Test calling operations in expressions with closure compilation'). | |
| 4996 | cli_testcase(1955,[b_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 4997 | '../prob_examples/public_examples/B/Tester/LogXML/WD_Error.mch', | |
| 4998 | '-execute_all', '-logxml', '../prob_examples/public_examples/B/Tester/LogXML/problog.xml', | |
| 4999 | '-expcterr', well_definedness_error | |
| 5000 | ], 'Test generation of locations in xml file'). | |
| 5001 | % 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 ! | |
| 5002 | cli_testcase(1956, [b_test,infinite,total_function], [ | |
| 5003 | '-evalf', '%(x,z).(x:NATURAL & z:NATURAL1|min({z,x,x/z,-x})) : (NATURAL*NATURAL1)-->NATURAL' % raises enum warning; but finds counter example | |
| 5004 | ], 'Test symbolic treatment of total function'). | |
| 5005 | cli_testcase(1957,[private_source_not_available],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5006 | '../private_examples/Thales/Hansen_Compile/Main_StringToIPV4.mch', | |
| 5007 | '-execute', 4, '-animate_stats', '-silent', '-expcterr', deadlock, | |
| 5008 | '-p', 'CLPFD', 'FALSE', '-p', 'MAXINT', 2147483647, '-p', 'MININT', -2147483647, | |
| 5009 | '-silent'], 'Ensure compilation of operation_call_in_expr with op(.) identifiers in read info solved'). | |
| 5010 | cli_testcase(1958, [b_test,cbc], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5011 | '-evalt', '{x|1..x <: {1,2,3,5} & x>1} = 2..3', | |
| 5012 | '-evalt', 'card({x|1..x <: {1,2,3,5} & x>1}) = 2', | |
| 5013 | '-evalt', '{ss | ss <: 0..0 & ss /= {} & ss=0..max(ss)} = {{0}}', | |
| 5014 | '-evalt', '{ss | ss <: 0..2 & ss /= {} & ss=0..max(ss)} = {{0},{0,1},{0,1,2}}' | |
| 5015 | %'-evalt', '{x,y|x..y <: {10,12,13,15} & y>x} = 12..13', % requires CHR | |
| 5016 | ], 'Ensure improved treatment of interval subset'). | |
| 5017 | cli_testcase(1959, [b_test,cbc], [ | |
| 5018 | '-evalt', '/*@symbolic */ {z|z>3 & z mod 3 =0} <: {x|x>5 & x mod 3=0}', | |
| 5019 | '-evalf', '/*@symbolic */ {z|z>3 & z mod 3 =0} <: {x|x>6 & x mod 3=0}', | |
| 5020 | '-evalt', '/*@symbolic */ {z|z>3 & z mod 3 =0} <: {x|x>1}', | |
| 5021 | '-evalf', '{z|z:seq(BOOL) & 1|->TRUE:z} <: {z|z:seq(BOOL) & 1|->FALSE:z}', | |
| 5022 | '-evalt', '/*@symbolic */ {z,v|z:seq(BOOL) & 1|->TRUE:z & v>2} <: /*@symbolic */ {v,z|v:seq(BOOL) & 1|->TRUE:v & z>1}', | |
| 5023 | '-evalf', '/*@symbolic */ {z,v|z:seq(BOOL) & 1|->TRUE:z & v>2} <: /*@symbolic */ {v,z|v:seq(BOOL) & 1|->TRUE:v & z>3}', | |
| 5024 | '-evalt', '{z|z>3 & z mod 3 =0} <: NATURAL' | |
| 5025 | ], 'Ensure improved symbolic treatment of subset'). | |
| 5026 | cli_testcase(1960,[b_test],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5027 | '../prob_examples/public_examples/B/NewSyntax/OperationWithAssert.mch', | |
| 5028 | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', | |
| 5029 | '-assertions' | |
| 5030 | ], 'Test calling operations with assertions inside expressions'). | |
| 5031 | cli_testcase(1961,[refinement],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5032 | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main1.ref', | |
| 5033 | '-mc', 1000 | |
| 5034 | ], 'Check that abstract events not copied to refinement machine, as they are refined.'). | |
| 5035 | cli_testcase(1962,[alloy,cbc],['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5036 | '../prob_examples/public_examples/Alloy/laws/SetLaws_Scope2.als', | |
| 5037 | '-cbc_sequence', check0, | |
| 5038 | '-expcterr', 'cbc_sequence_no_solution_found', | |
| 5039 | '-strict'], 'Test Alloy laws and *no* solution for check0'). | |
| 5040 | cli_testcase(1963, [b_test,cruise,codespeed], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5041 | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch', '-mc', '1400', '-cc', '1361', '1360', '-strict', '-nodead', '-p', 'MAX_INITIALISATIONS', 5, | |
| 5042 | '-p', 'SAFETY_MODEL_CHECK', 'TRUE'], 'Complete Model Check of Cruise Controller with SAFETY_MODEL_CHECK'). | |
| 5043 | cli_testcase(1964, [refinement], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5044 | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main1_v2.ref', | |
| 5045 | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main2_v2.ref', | |
| 5046 | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main2_v3.ref', | |
| 5047 | '-strict','-mc', '1000'], 'Check invariants copied correctly'). | |
| 5048 | cli_testcase(1965, [refinement], ['-p', 'STRICT_RAISE_ENUM_WARNINGS', 'TRUE', | |
| 5049 | '../prob_examples/public_examples/B/RefinementChecking/AtelierB_EventB/Main1_err.ref', | |
| 5050 | '-expcterr', 'invariant_violation', '-strict', | |
| 5051 | '-mc', '1000'], 'Check invariants copied correctly'). | |
| 5052 | cli_testcase(1966, [wd], [ | |
| 5053 | '../prob_examples/public_examples/B/Tickets/Hansen37_WD_Exists/WD_Exists.rmch', | |
| 5054 | '-expcterr', well_definedness_error, '-expcterr', animate, | |
| 5055 | '-animate', 3], 'Check WD error inside negated existential quantifier detected'). | |
| 5056 | cli_testcase(1967, [b_test,infinite,total_function,wd], [ | |
| 5057 | '-eval', '%(x,z).(x:NATURAL & z:NATURAL|min({z,x,x/z,-x})) : (NATURAL*NATURAL)-->NATURAL', % raises enum warning; but finds counter example | |
| 5058 | '-expcterr', well_definedness_error, | |
| 5059 | '-expcterr', eval_string_time_out | |
| 5060 | ], 'Test wd error found due to division by 0'). | |
| 5061 | cli_testcase(1968, [b_test,infinite], ['../prob_examples/public_examples/B/FunctionalProgramming/MemoizationTests.mch', '-assertions'], 'Check function memoization works'). | |
| 5062 | cli_testcase(1969, [b_test], ['../prob_examples/public_examples/B/NewSyntax/ExpressionsWithOperations/TopologyOpExpr.mch', | |
| 5063 | '-p', 'ALLOW_OPERATION_CALLS_IN_EXPRESSIONS', 'TRUE', | |
| 5064 | '-t', '-assertions'], 'Check local operations called in expressions'). | |
| 5065 | ||
| 5066 | ||
| 5067 | /* | |
| 5068 | cli_testcase(1693, [tickets], [ | |
| 5069 | %'-evalt', '{x|x:1..n} = {y,y+1}' % does not work yet | |
| 5070 | ], 'test comprehension set propagation'). | |
| 5071 | */ | |
| 5072 | ||
| 5073 | ||
| 5074 | % /Users/leuschel/git_root/prob_examples/public_examples/B/Simple/UpCounter.mch -ctlformula 'AG {c<mx}' -p MAXINT 10 | |
| 5075 | % store counter example | |
| 5076 | ||
| 5077 | % sicstus -l src/test_runner.pl --goal "id(690-694)." | |
| 5078 | % INSERT NEW TESTCASES ABOVE THIS LINE; cli_testcase is sorted in ascending order | |
| 5079 | % ---------------------------------------------------------------------- | |
| 5080 | ||
| 5081 | % ---------------------------------------------------------------------- | |
| 5082 | % ---------------------------------------------------------------------- | |
| 5083 | ||
| 5084 | % ---------------------------------------------------------------------- | |
| 5085 | % IF A NEW TESTCASE REQUIRES CHECKING OUTPUT, ADD NEW LINE(S) BELOW | |
| 5086 | % cli_testcase_diff_check_output is sorted in descending order | |
| 5087 | ||
| 5088 | 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'). | |
| 5089 | 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'). | |
| 5090 | ||
| 5091 | cli_testcase_diff_check_output(1915,'../prob_examples/examples/B/Alstom/etcs/actions_feasibility.csv', | |
| 5092 | '../prob_examples/examples/B/Alstom/etcs/actions_feasibility_saved.csv'). | |
| 5093 | cli_testcase_diff_check_output(1904,'../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6_rw_matrix.csv', | |
| 5094 | '../prob_examples/examples/B/ASTD/wetransfer-545a33/Case_Study_Handmade/TRAIN_CONTROL_M6_rw_matrix_saved.csv'). | |
| 5095 | cli_testcase_diff_check_output(1840,'../prob_examples/public_examples/Latex/tests/prob_latex_doc.tex', | |
| 5096 | '../prob_examples/public_examples/Latex/tests/prob_latex_doc_saved.tex'). | |
| 5097 | cli_testcase_diff_check_output(1837,'../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect_feasibility.csv', | |
| 5098 | '../prob_examples/public_examples/B/CBC/Enabling/OpCallSelect_feasibility_saved.csv'). | |
| 5099 | cli_testcase_diff_check_output(1810,'../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString_Internal.mch', | |
| 5100 | '../prob_examples/public_examples/B/Tickets/UnicodeSupport/TestUmlauteInString_Internal_Saved.mch'). | |
| 5101 | cli_testcase_diff_check_output(1797,'../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_rw_matrix.csv', | |
| 5102 | '../prob_examples/public_examples/B/Ivo/BenchmarksPOR/Concurrent_Program_Development/conc_4_rw_matrix_saved.csv'). | |
| 5103 | cli_testcase_diff_check_output(1793,'../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2_enabling.csv', | |
| 5104 | '../prob_examples/examples/B/Amira_Genisys/ConferenceReviewSystem/Functional_Simplified_v2_enabling_saved.csv'). | |
| 5105 | 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'). | |
| 5106 | 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'). | |
| 5107 | 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'). | |
| 5108 | 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'). | |
| 5109 | 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'). | |
| 5110 | 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'). | |
| 5111 | %cli_testcase_diff_check_output(1665,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records_internal.mch', | |
| 5112 | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Records_internal_saved.mch'). | |
| 5113 | 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'). | |
| 5114 | 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'). | |
| 5115 | 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'). | |
| 5116 | 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'). | |
| 5117 | 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'). | |
| 5118 | 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'). | |
| 5119 | 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'). | |
| 5120 | 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'). | |
| 5121 | 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'). | |
| 5122 | 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'). | |
| 5123 | 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'). | |
| 5124 | 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'). | |
| 5125 | 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'). | |
| 5126 | 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'). | |
| 5127 | 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'). | |
| 5128 | % the provided counter-example varies for test 1366: | |
| 5129 | %cli_testcase_diff_check_output(1366,'../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2_his.txt', | |
| 5130 | % '../prob_examples/public_examples/B/SymbolicModelChecking/TimingExampleSimpler_v2_his_saved.txt'). | |
| 5131 | cli_testcase_diff_check_output(1364,'../prob_examples/public_examples/B/Demo/scheduler_his.txt', | |
| 5132 | '../prob_examples/public_examples/B/Demo/scheduler_his_ctl_saved.txt'). | |
| 5133 | cli_testcase_diff_check_output(1363,'../prob_examples/public_examples/B/Simple/UpCounter_his.txt', | |
| 5134 | '../prob_examples/public_examples/B/Simple/UpCounter_his_ctl20_saved.txt'). | |
| 5135 | cli_testcase_diff_check_output(1360,'../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck_feasibility.csv', | |
| 5136 | '../prob_examples/public_examples/B/CBC/FeasibilityOperationCheck_feasibility_saved.csv'). | |
| 5137 | cli_testcase_diff_check_output(1358,'../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition_feasibility.csv', | |
| 5138 | '../prob_examples/examples/EventBPrologPackages/Savary/R08_ByteArray_enum_partition_feasibility_saved.csv'). | |
| 5139 | cli_testcase_diff_check_output(1357,'../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_cbc_tests.xml', | |
| 5140 | '../prob_examples/public_examples/B/Benchmarks/Cruise_finite1_cbc_tests_saved.xml'). | |
| 5141 | cli_testcase_diff_check_output(1341,'../prob_examples/public_examples/B/Demo/Bakery0_all_paths.xml', | |
| 5142 | '../prob_examples/public_examples/B/Demo/Bakery0_all_paths_saved.xml'). | |
| 5143 | %cli_testcase_diff_check_output(1339,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/GenericUsageOfSquare_internal.mch', | |
| 5144 | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/GenericUsageOfSquare_internal_saved.mch'). | |
| 5145 | 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'). | |
| 5146 | 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'). | |
| 5147 | cli_testcase_diff_check_output(1196,'../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr.csv','../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_saved.csv'). | |
| 5148 | 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'). | |
| 5149 | 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'). | |
| 5150 | 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'). | |
| 5151 | 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'). | |
| 5152 | 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'). | |
| 5153 | 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'). | |
| 5154 | 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'). | |
| 5155 | 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'). | |
| 5156 | 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'). | |
| 5157 | 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'). | |
| 5158 | 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'). | |
| 5159 | 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'). | |
| 5160 | 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'). | |
| 5161 | cli_testcase_diff_check_output(977,'../prob_examples/public_examples/B/Ivo/BridgeTransitions_por.cov','../prob_examples/public_examples/B/Ivo/BridgeTransitions.cov'). | |
| 5162 | 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'). | |
| 5163 | 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'). | |
| 5164 | 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'). | |
| 5165 | 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'). | |
| 5166 | %cli_testcase_diff_check_output(957,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/DifferentUnitNotations_internal.mch', | |
| 5167 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/DifferentUnitNotations_internal_saved.mch'). | |
| 5168 | cli_testcase_diff_check_output(944,'../prob_examples/public_examples/Eval/evalout.dot','../prob_examples/public_examples/Eval/evalout_saved.dot'). | |
| 5169 | %cli_testcase_diff_check_output(942,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Case_internal.mch', | |
| 5170 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Case_internal_saved.mch'). | |
| 5171 | cli_testcase_diff_check_output(894,'../prob_examples/public_examples/B/Daniel/minienabling_analysis.csv', | |
| 5172 | '../prob_examples/public_examples/B/Daniel/minienabling_analysis_saved.csv'). | |
| 5173 | %cli_testcase_diff_check_output(881,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Choice_internal.mch', | |
| 5174 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/Choice_internal_saved.mch'). | |
| 5175 | %cli_testcase_diff_check_output(865,'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_no_unicode.csp', | |
| 5176 | %'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_no_unicode_saved.csp'). | |
| 5177 | %cli_testcase_diff_check_output(864,'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_unicode.csp', | |
| 5178 | %'../prob_examples/public_examples/CSP/mydemos/OtherCoverageTests/TestingUnicodeFeatures_unicode_saved.csp'). | |
| 5179 | cli_testcase_diff_check_output(808,'../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_state_graph.dot', | |
| 5180 | '../prob_examples/public_examples/B/Benchmarks/CarlaTravelAgencyErr_state_graph_saved.dot'). | |
| 5181 | cli_testcase_diff_check_output(767,'../prob_examples/examples/B/Siemens/BAC9_ZC/pas_as_env_inv_ld_sptxt.txt', | |
| 5182 | '../prob_examples/examples/B/Siemens/BAC9_ZC/pas_as_env_inv_ld_sptxt_saved.txt'). | |
| 5183 | %cli_testcase_diff_check_output(707,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m3_internal.mch', | |
| 5184 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m3_internal_saved.mch'). | |
| 5185 | %cli_testcase_diff_check_output(706,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m2_internal.mch', | |
| 5186 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m2_internal_saved.mch'). | |
| 5187 | %cli_testcase_diff_check_output(705,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m1_internal.mch', | |
| 5188 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m1_internal_saved.mch'). | |
| 5189 | %cli_testcase_diff_check_output(704,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m0_internal.mch', | |
| 5190 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_nuclear/C_m0_internal_saved.mch'). | |
| 5191 | %cli_testcase_diff_check_output(701,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m1_internal.mch', | |
| 5192 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m1_internal_saved.mch'). | |
| 5193 | %cli_testcase_diff_check_output(700,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m0_internal.mch', | |
| 5194 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/Abrial_Hybrid/hybrid_train/T_m0_internal_saved.mch'). | |
| 5195 | %cli_testcase_diff_check_output(696,'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnitsUnsat_internal.mch', | |
| 5196 | %'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnitsUnsat_internal_saved.mch'). | |
| 5197 | %cli_testcase_diff_check_output(695,'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnits_internal.mch', | |
| 5198 | %'../prob_examples/public_examples/B/PragmasUnits/InferenceTests/InvolvedConstraintUnits_internal_saved.mch'). | |
| 5199 | %cli_testcase_diff_check_output(686,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SequenceOperations_internal.mch', | |
| 5200 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SequenceOperations_internal_saved.mch'). | |
| 5201 | %cli_testcase_diff_check_output(683,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/AdditionConversion_internal.mch', | |
| 5202 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/AdditionConversion_internal_saved.mch'). | |
| 5203 | %cli_testcase_diff_check_output(681,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IntegerOperations_internal.mch', | |
| 5204 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IntegerOperations_internal_saved.mch'). | |
| 5205 | %cli_testcase_diff_check_output(680,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel_i_internal.mch', | |
| 5206 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel_i_internal_saved.mch'). | |
| 5207 | %cli_testcase_diff_check_output(679,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel0_internal.mch', | |
| 5208 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/fuel0_internal_saved.mch'). | |
| 5209 | %cli_testcase_diff_check_output(678,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_i_internal.mch', | |
| 5210 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_i_internal_saved.mch'). | |
| 5211 | %cli_testcase_diff_check_output(677,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_internal.mch', | |
| 5212 | %'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/FuelLevel/ctx_internal_saved.mch'). | |
| 5213 | %cli_testcase_diff_check_output(676,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/UserDefinedAlias_internal.mch', | |
| 5214 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/UserDefinedAlias_internal_saved.mch'). | |
| 5215 | %cli_testcase_diff_check_output(675,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IfTypeAndClash_internal.mch', | |
| 5216 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IfTypeAndClash_internal_saved.mch'). | |
| 5217 | %cli_testcase_diff_check_output(673,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IrregularConversions_internal.mch', | |
| 5218 | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/IrregularConversions_internal_saved.mch'). | |
| 5219 | %cli_testcase_diff_check_output(667,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/System_internal.mch', | |
| 5220 | % '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/System_internal_saved.mch'). | |
| 5221 | %cli_testcase_diff_check_output(666,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/TrafficLight_internal.mch', | |
| 5222 | % '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/TrafficLight_internal_saved.mch'). | |
| 5223 | %cli_testcase_diff_check_output(665,'../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/Car_internal.mch', | |
| 5224 | % '../prob_examples/public_examples/B/PragmasUnits/CaseStudies/TrafficLightWarning/Car_internal_saved.mch'). | |
| 5225 | %cli_testcase_diff_check_output(662,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/KnownExponent_internal.mch', | |
| 5226 | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/KnownExponent_internal_saved.mch'). | |
| 5227 | %cli_testcase_diff_check_output(661,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/MultiplicationConversion_internal.mch', | |
| 5228 | %'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/MultiplicationConversion_internal_saved.mch'). | |
| 5229 | %cli_testcase_diff_check_output(657,'../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SimpleCorrectUsage_internal.mch', | |
| 5230 | % '../prob_examples/public_examples/B/PragmasUnits/InternalRepresentationTests/SimpleCorrectUsage_internal_saved.mch'). | |
| 5231 | cli_testcase_diff_check_output(634,'../prob_examples/public_examples/B/Kodkod/Loop_statespace.dot', | |
| 5232 | '../prob_examples/public_examples/B/Kodkod/Loop_statespace_saved.dot'). | |
| 5233 | cli_testcase_diff_check_output(616,'../prob_examples/public_examples/B/Tester/Partition_internal.mch', | |
| 5234 | '../prob_examples/public_examples/B/Tester/Partition_internal_saved.mch'). | |
| 5235 | cli_testcase_diff_check_output(613,'../prob_examples/public_examples/B/Pragmas/AssertionPragmas_internal.mch', | |
| 5236 | '../prob_examples/public_examples/B/Pragmas/AssertionPragmas_internal_saved.mch'). | |
| 5237 | cli_testcase_diff_check_output(540,'../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter_results.xml', | |
| 5238 | '../prob_examples/public_examples/B/TestCaseGeneration/SimpleCounter_results_saved.xml'). | |
| 5239 | ||
| 5240 | 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'). | |
| 5241 | 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'). | |
| 5242 | 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'). | |
| 5243 | 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'). | |
| 5244 | ||
| 5245 | ||
| 5246 | 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'). | |
| 5247 | 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'). | |
| 5248 | 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'). | |
| 5249 | 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'). | |
| 5250 | 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'). | |
| 5251 | 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'). | |
| 5252 | 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'). | |
| 5253 | 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'). | |
| 5254 | 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'). | |
| 5255 | 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'). | |
| 5256 | 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'). | |
| 5257 | 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'). | |
| 5258 | 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'). | |
| 5259 | 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'). | |
| 5260 | 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'). | |
| 5261 | 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'). | |
| 5262 | 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'). | |
| 5263 | ||
| 5264 | 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'). | |
| 5265 | 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 | |
| 5266 | 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'). | |
| 5267 | 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'). | |
| 5268 | 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'). | |
| 5269 | 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'). | |
| 5270 | 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'). | |
| 5271 | 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'). | |
| 5272 | 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'). | |
| 5273 | 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'). | |
| 5274 | 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'). | |
| 5275 | 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'). | |
| 5276 | 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'). | |
| 5277 | 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'). | |
| 5278 | 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'). | |
| 5279 | 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'). | |
| 5280 | 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'). | |
| 5281 | 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'). | |
| 5282 | 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'). | |
| 5283 | 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'). | |
| 5284 | 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'). | |
| 5285 | 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'). | |
| 5286 | 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'). | |
| 5287 | 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'). | |
| 5288 | 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'). | |
| 5289 | ||
| 5290 | % specify that a testcase output file should not be deleted before running the tests | |
| 5291 | cli_testcase_do_not_delete(584,'../prob_examples/public_examples/TLA/ErrorTests/GraphIso_tla.mch'). | |
| 5292 | ||
| 5293 | % declaration of additinoal testcase files; in order to be able to generate archives | |
| 5294 | % of standalone tests | |
| 5295 | extra_testcase_file(305,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS0.def'). | |
| 5296 | extra_testcase_file(306,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS1.def'). | |
| 5297 | extra_testcase_file(307,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS.def'). | |
| 5298 | extra_testcase_file(465,'../prob_examples/public_examples/B/Simple/UpCounter_saved10.P'). | |
| 5299 | extra_testcase_file(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsRR.ref'). | |
| 5300 | extra_testcase_file(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/TownsR.ref'). | |
| 5301 | extra_testcase_file(472,'../prob_examples/public_examples/B/SchneiderBook/Chapter12/Towns.mch'). | |
| 5302 | extra_testcase_file(475,'../prob_examples/public_examples/B/Laws/REPL_UNIT_TESTS2.def'). | |
| 5303 | ||
| 5304 | % use | |
| 5305 | % sicstus -l src/test_runner.pl --goal "run_last_test, halt ; halt." | |
| 5306 | % or | |
| 5307 | % make runlast | |
| 5308 | % to just run last test case | |
| 5309 | % use | |
| 5310 | % sicstus -l src/test_runner.pl --goal "id(ID), halt ; halt." | |
| 5311 | % to run a specific test |