Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350700034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717196014163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:53:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:53:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:53:35] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2024-05-31 22:53:35] [INFO ] Transformed 5568 places.
[2024-05-31 22:53:35] [INFO ] Transformed 7799 transitions.
[2024-05-31 22:53:35] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 200 out of 5568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1586 places :
Symmetric choice reduction at 1 with 1586 rule applications. Total rules 1618 place count 3950 transition count 6213
Iterating global reduction 1 with 1586 rules applied. Total rules applied 3204 place count 3950 transition count 6213
Discarding 1371 places :
Symmetric choice reduction at 1 with 1371 rule applications. Total rules 4575 place count 2579 transition count 4842
Iterating global reduction 1 with 1371 rules applied. Total rules applied 5946 place count 2579 transition count 4842
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 6114 place count 2411 transition count 3834
Iterating global reduction 1 with 168 rules applied. Total rules applied 6282 place count 2411 transition count 3834
Applied a total of 6282 rules in 1020 ms. Remains 2411 /5568 variables (removed 3157) and now considering 3834/7799 (removed 3965) transitions.
[2024-05-31 22:53:37] [INFO ] Flow matrix only has 3562 transitions (discarded 272 similar events)
// Phase 1: matrix 3562 rows 2411 cols
[2024-05-31 22:53:37] [INFO ] Computed 541 invariants in 187 ms
[2024-05-31 22:53:39] [INFO ] Implicit Places using invariants in 2752 ms returned [4, 8, 12, 16, 18, 22, 24, 32, 39, 48, 59, 72, 90, 108, 126, 130, 132, 134, 136, 152, 163, 172, 179, 184, 187, 223, 226, 227, 228, 229, 230, 231, 232, 235, 240, 247, 257, 268, 281, 295, 309, 310, 311, 312, 313, 314, 315, 326, 335, 343, 348, 351, 353, 381, 388, 391, 393, 394, 395, 397, 399, 402, 407, 414, 423, 437, 452, 464, 465, 466, 467, 468, 469, 470, 479, 486, 491, 494, 497, 499, 526, 533, 536, 537, 538, 543, 547, 549, 552, 560, 567, 578, 590, 602, 603, 605, 606, 613, 618, 621, 630, 632, 634, 661, 668, 672, 674, 675, 676, 677, 679, 681, 684, 687, 692, 712, 720, 722, 723, 724, 725, 726, 734, 737, 739, 741, 743, 745, 772, 779, 782, 784, 785, 786, 788, 790, 792, 794, 796, 800, 807, 816, 822, 824, 825, 826, 827, 828, 831, 836, 838, 840, 842, 844, 871, 878, 881, 884, 885, 886, 887, 888, 892, 894, 896, 898, 900, 904, 908, 912, 913, 914, 915, 916, 917, 918, 920, 922, 924, 926, 928, 930, 957, 964, 967, 971, 972, 973, 977, 982, 986, 989, 992, 999, 1002, 1003, 1004, 1005, 1006, 1008, 1010, 1014, 1016, 1018, 1020, 1022, 1051, 1055, 1060, 1061, 1063, 1064, 1069, 1073, 1075, 1079, 1082, 1084, 1086, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1098, 1100, 1102, 1105, 1107, 1109, 1143, 1146, 1147, 1148, 1150, 1152, 1159, 1161, 1164, 1166, 1169, 1171, 1173, 1176, 1180, 1181, 1182, 1187, 1189, 1191, 1195, 1197, 1202, 1229, 1236, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1247, 1249, 1251, 1254, 1256, 1261, 1266, 1269, 1271, 1272, 1277, 1281, 1283, 1285, 1292, 1319, 1326, 1329, 1330, 1332, 1335, 1337, 1341, 1343, 1345, 1351, 1354, 1362, 1372, 1373, 1374, 1375, 1383, 1386, 1388, 1390, 1395, 1397, 1433, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1444, 1446, 1448, 1450, 1453, 1465, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1487, 1492, 1495, 1497, 1499, 1502, 1536, 1540, 1541, 1542, 1544, 1545, 1549, 1553, 1555, 1558, 1563, 1570, 1579, 1590, 1591, 1593, 1595, 1596, 1605, 1617, 1622, 1625, 1627, 1630, 1657, 1664, 1667, 1668, 1669, 1670, 1671, 1673, 1675, 1677, 1683, 1688, 1695, 1704, 1715, 1728, 1729, 1731, 1732, 1734, 1746, 1762, 1769, 1772, 1777, 1804, 1814, 1815, 1816, 1817, 1818, 1820, 1822, 1825, 1830, 1839, 1848, 1859, 1872, 1887, 1888, 1890, 1891, 1892, 1893, 1909, 1920, 1929, 1937, 1942, 1945, 1972, 1974, 1978, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1990, 1995, 2002, 2011, 2022, 2035, 2050, 2067, 2068, 2070, 2072, 2073, 2088, 2104, 2117, 2126, 2136, 2142, 2170]
[2024-05-31 22:53:39] [INFO ] Actually due to overlaps returned [381, 526, 661, 772, 871, 957, 1229, 1319, 1657, 1804, 1972, 2170, 4, 12, 16, 18, 22, 72, 90, 126, 130, 132, 134, 152, 163, 223, 226, 227, 228, 229, 230, 231, 268, 281, 309, 310, 311, 312, 313, 314, 326, 335, 388, 391, 393, 394, 395, 423, 437, 464, 465, 466, 467, 468, 469, 479, 486, 533, 536, 537, 538, 567, 578, 602, 603, 605, 613, 618, 668, 672, 674, 675, 676, 692, 720, 722, 723, 724, 725, 734, 737, 779, 782, 784, 785, 786, 800, 807, 822, 824, 825, 826, 827, 831, 836, 878, 881, 884, 885, 886, 887, 900, 904, 912, 913, 914, 915, 916, 917, 920, 922, 964, 967, 971, 972, 1002, 1003, 1004, 1005, 1006, 1010, 1014, 1051, 1055, 1060, 1061, 1063, 1084, 1089, 1090, 1091, 1092, 1093, 1094, 1098, 1100, 1143, 1146, 1147, 1148, 1150, 1171, 1173, 1176, 1180, 1181, 1187, 1189, 1236, 1239, 1240, 1241, 1242, 1243, 1244, 1261, 1266, 1269, 1271, 1277, 1326, 1329, 1330, 1332, 1354, 1362, 1372, 1373, 1374, 1386, 1433, 1436, 1437, 1438, 1439, 1440, 1441, 1465, 1474, 1475, 1476, 1477, 1478, 1479, 1492, 1536, 1540, 1541, 1542, 1544, 1570, 1579, 1590, 1591, 1593, 1595, 1617, 1622, 1664, 1667, 1668, 1669, 1670, 1671, 1704, 1715, 1728, 1729, 1731, 1732, 1762, 1814, 1815, 1816, 1817, 1818, 1859, 1872, 1887, 1888, 1890, 1891, 1892, 1920, 1929, 1974, 1978, 1981, 1982, 1983, 1984, 1985, 1986, 2035, 2050, 2067, 2068, 2070, 2072, 2104, 2117]
Discarding 241 places :
Implicit Place search using SMT only with invariants took 2807 ms to find 241 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2170/5568 places, 3834/7799 transitions.
Discarding 141 places :
Symmetric choice reduction at 0 with 141 rule applications. Total rules 141 place count 2029 transition count 3693
Iterating global reduction 0 with 141 rules applied. Total rules applied 282 place count 2029 transition count 3693
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 422 place count 1889 transition count 3553
Iterating global reduction 0 with 140 rules applied. Total rules applied 562 place count 1889 transition count 3553
Discarding 138 places :
Symmetric choice reduction at 0 with 138 rule applications. Total rules 700 place count 1751 transition count 3415
Iterating global reduction 0 with 138 rules applied. Total rules applied 838 place count 1751 transition count 3415
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 845 place count 1744 transition count 3373
Iterating global reduction 0 with 7 rules applied. Total rules applied 852 place count 1744 transition count 3373
Applied a total of 852 rules in 366 ms. Remains 1744 /2170 variables (removed 426) and now considering 3373/3834 (removed 461) transitions.
[2024-05-31 22:53:40] [INFO ] Flow matrix only has 3101 transitions (discarded 272 similar events)
// Phase 1: matrix 3101 rows 1744 cols
[2024-05-31 22:53:40] [INFO ] Computed 300 invariants in 68 ms
[2024-05-31 22:53:41] [INFO ] Implicit Places using invariants in 1349 ms returned [7, 19, 27, 34, 43, 54, 101, 125, 159, 166, 171, 174, 212, 215, 220, 227, 237, 273, 287, 313, 318, 321, 323, 345, 347, 350, 355, 362, 398, 409, 428, 431, 434, 436, 455, 459, 461, 464, 472, 500, 513, 526, 535, 537, 539, 564, 566, 568, 571, 574, 598, 607, 618, 620, 622, 624, 644, 646, 648, 650, 652, 670, 677, 685, 687, 689, 691, 710, 714, 716, 718, 720, 728, 731, 735, 737, 739, 741, 757, 761, 766, 770, 773, 776, 783, 787, 793, 795, 797, 799, 821, 826, 830, 832, 836, 839, 842, 845, 849, 852, 854, 856, 876, 883, 885, 888, 890, 893, 901, 908, 912, 914, 919, 939, 941, 943, 945, 948, 950, 962, 970, 972, 974, 981, 1001, 1003, 1007, 1009, 1011, 1017, 1036, 1044, 1048, 1050, 1055, 1057, 1082, 1084, 1086, 1088, 1090, 1093, 1112, 1119, 1126, 1128, 1130, 1133, 1147, 1151, 1155, 1157, 1160, 1165, 1192, 1201, 1219, 1221, 1224, 1244, 1246, 1248, 1254, 1259, 1266, 1299, 1311, 1333, 1336, 1341, 1361, 1363, 1366, 1371, 1380, 1389, 1427, 1443, 1469, 1474, 1477, 1489, 1492, 1497, 1504, 1513, 1524, 1569, 1584, 1620, 1630, 1636]
Discarding 192 places :
Implicit Place search using SMT only with invariants took 1358 ms to find 192 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1552/5568 places, 3373/7799 transitions.
Applied a total of 0 rules in 46 ms. Remains 1552 /1552 variables (removed 0) and now considering 3373/3373 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5619 ms. Remains : 1552/5568 places, 3373/7799 transitions.
Support contains 200 out of 1552 places after structural reductions.
[2024-05-31 22:53:42] [INFO ] Flatten gal took : 243 ms
[2024-05-31 22:53:42] [INFO ] Flatten gal took : 175 ms
[2024-05-31 22:53:42] [INFO ] Input system was already deterministic with 3373 transitions.
RANDOM walk for 40000 steps (640 resets) in 2711 ms. (14 steps per ms) remains 39/90 properties
BEST_FIRST walk for 4002 steps (16 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (16 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (16 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (16 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4000 steps (16 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (16 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (16 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (16 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (16 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (16 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (16 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (16 resets) in 56 ms. (70 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (16 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (16 resets) in 65 ms. (60 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (16 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (16 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (16 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (16 resets) in 28 ms. (137 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4000 steps (16 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (16 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (16 resets) in 70 ms. (56 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
[2024-05-31 22:53:44] [INFO ] Flow matrix only has 3101 transitions (discarded 272 similar events)
// Phase 1: matrix 3101 rows 1552 cols
[2024-05-31 22:53:44] [INFO ] Computed 108 invariants in 28 ms
[2024-05-31 22:53:44] [INFO ] State equation strengthened by 1303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 2 (OVERLAPS) 1304/1400 variables, 21/23 constraints. Problems are: Problem set: 11 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1400 variables, 4/27 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1400 variables, 0/27 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 2/1402 variables, 2/29 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 0/29 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 141/1543 variables, 70/99 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1543 variables, 0/99 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 8/1551 variables, 8/107 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1551 variables, 0/107 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/1552 variables, 1/108 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1552 variables, 0/108 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 3101/4653 variables, 1552/1660 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4653 variables, 1303/2963 constraints. Problems are: Problem set: 11 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4653/4653 variables, and 2963 constraints, problems are : Problem set: 11 solved, 26 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 1552/1552 constraints, ReadFeed: 1303/1303 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1330/1387 variables, 20/21 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-31 22:53:49] [INFO ] Deduced a trap composed of 305 places in 300 ms of which 37 ms to minimize.
[2024-05-31 22:53:50] [INFO ] Deduced a trap composed of 665 places in 832 ms of which 12 ms to minimize.
[2024-05-31 22:53:51] [INFO ] Deduced a trap composed of 466 places in 751 ms of which 8 ms to minimize.
[2024-05-31 22:53:52] [INFO ] Deduced a trap composed of 461 places in 689 ms of which 8 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 673 places in 689 ms of which 9 ms to minimize.
[2024-05-31 22:53:53] [INFO ] Deduced a trap composed of 468 places in 651 ms of which 8 ms to minimize.
[2024-05-31 22:53:54] [INFO ] Deduced a trap composed of 696 places in 662 ms of which 8 ms to minimize.
SMT process timed out in 10305ms, After SMT, problems are : Problem set: 11 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1552 transition count 3333
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 1512 transition count 3333
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 80 place count 1512 transition count 3284
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 1463 transition count 3284
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 213 place count 1428 transition count 3164
Iterating global reduction 2 with 35 rules applied. Total rules applied 248 place count 1428 transition count 3164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 248 place count 1428 transition count 3162
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 1426 transition count 3162
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 267 place count 1411 transition count 3077
Iterating global reduction 2 with 15 rules applied. Total rules applied 282 place count 1411 transition count 3077
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 348 place count 1378 transition count 3044
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 377 place count 1349 transition count 3015
Iterating global reduction 2 with 29 rules applied. Total rules applied 406 place count 1349 transition count 3015
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 1325 transition count 2871
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 1325 transition count 2871
Free-agglomeration rule (complex) applied 150 times.
Iterating global reduction 2 with 150 rules applied. Total rules applied 604 place count 1325 transition count 3676
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 754 place count 1175 transition count 3676
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 3 with 41 rules applied. Total rules applied 795 place count 1175 transition count 3676
Applied a total of 795 rules in 1010 ms. Remains 1175 /1552 variables (removed 377) and now considering 3676/3373 (removed -303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1011 ms. Remains : 1175/1552 places, 3676/3373 transitions.
RANDOM walk for 40000 steps (1035 resets) in 1229 ms. (32 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4001 steps (16 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (16 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (16 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (16 resets) in 74 ms. (53 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (16 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (16 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (16 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (16 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (16 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (16 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (16 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (16 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (16 resets) in 19 ms. (200 steps per ms) remains 21/22 properties
[2024-05-31 22:53:56] [INFO ] Flow matrix only has 3291 transitions (discarded 385 similar events)
// Phase 1: matrix 3291 rows 1175 cols
[2024-05-31 22:53:56] [INFO ] Computed 108 invariants in 29 ms
[2024-05-31 22:53:56] [INFO ] State equation strengthened by 1983 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 990/1031 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:53:56] [INFO ] Deduced a trap composed of 189 places in 137 ms of which 3 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 222 places in 520 ms of which 6 ms to minimize.
[2024-05-31 22:53:57] [INFO ] Deduced a trap composed of 226 places in 503 ms of which 5 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 206 places in 483 ms of which 5 ms to minimize.
[2024-05-31 22:53:58] [INFO ] Deduced a trap composed of 229 places in 493 ms of which 5 ms to minimize.
[2024-05-31 22:53:59] [INFO ] Deduced a trap composed of 382 places in 498 ms of which 6 ms to minimize.
[2024-05-31 22:53:59] [INFO ] Deduced a trap composed of 405 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 428 places in 494 ms of which 5 ms to minimize.
[2024-05-31 22:54:00] [INFO ] Deduced a trap composed of 217 places in 510 ms of which 6 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 247 places in 508 ms of which 5 ms to minimize.
[2024-05-31 22:54:01] [INFO ] Deduced a trap composed of 215 places in 495 ms of which 6 ms to minimize.
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 378 places in 507 ms of which 6 ms to minimize.
[2024-05-31 22:54:02] [INFO ] Deduced a trap composed of 363 places in 516 ms of which 6 ms to minimize.
[2024-05-31 22:54:03] [INFO ] Deduced a trap composed of 252 places in 244 ms of which 4 ms to minimize.
[2024-05-31 22:54:03] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 4 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 230 places in 537 ms of which 6 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 263 places in 233 ms of which 4 ms to minimize.
[2024-05-31 22:54:04] [INFO ] Deduced a trap composed of 314 places in 235 ms of which 4 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 236 places in 563 ms of which 6 ms to minimize.
[2024-05-31 22:54:05] [INFO ] Deduced a trap composed of 296 places in 530 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1031 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:54:06] [INFO ] Deduced a trap composed of 254 places in 501 ms of which 5 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 247 places in 506 ms of which 6 ms to minimize.
[2024-05-31 22:54:07] [INFO ] Deduced a trap composed of 215 places in 512 ms of which 6 ms to minimize.
[2024-05-31 22:54:08] [INFO ] Deduced a trap composed of 516 places in 425 ms of which 5 ms to minimize.
[2024-05-31 22:54:08] [INFO ] Deduced a trap composed of 614 places in 387 ms of which 6 ms to minimize.
[2024-05-31 22:54:09] [INFO ] Deduced a trap composed of 243 places in 585 ms of which 6 ms to minimize.
[2024-05-31 22:54:09] [INFO ] Deduced a trap composed of 398 places in 549 ms of which 6 ms to minimize.
[2024-05-31 22:54:10] [INFO ] Deduced a trap composed of 461 places in 573 ms of which 7 ms to minimize.
[2024-05-31 22:54:10] [INFO ] Deduced a trap composed of 218 places in 561 ms of which 7 ms to minimize.
[2024-05-31 22:54:11] [INFO ] Deduced a trap composed of 316 places in 556 ms of which 6 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 273 places in 557 ms of which 6 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 427 places in 209 ms of which 4 ms to minimize.
[2024-05-31 22:54:12] [INFO ] Deduced a trap composed of 377 places in 539 ms of which 6 ms to minimize.
[2024-05-31 22:54:13] [INFO ] Deduced a trap composed of 253 places in 530 ms of which 6 ms to minimize.
[2024-05-31 22:54:13] [INFO ] Deduced a trap composed of 255 places in 496 ms of which 6 ms to minimize.
[2024-05-31 22:54:14] [INFO ] Deduced a trap composed of 257 places in 527 ms of which 5 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 249 places in 511 ms of which 6 ms to minimize.
[2024-05-31 22:54:15] [INFO ] Deduced a trap composed of 259 places in 541 ms of which 6 ms to minimize.
[2024-05-31 22:54:16] [INFO ] Deduced a trap composed of 222 places in 533 ms of which 7 ms to minimize.
[2024-05-31 22:54:16] [INFO ] Deduced a trap composed of 256 places in 562 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1031 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:54:17] [INFO ] Deduced a trap composed of 399 places in 496 ms of which 5 ms to minimize.
[2024-05-31 22:54:18] [INFO ] Deduced a trap composed of 402 places in 483 ms of which 6 ms to minimize.
[2024-05-31 22:54:18] [INFO ] Deduced a trap composed of 195 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:54:19] [INFO ] Deduced a trap composed of 219 places in 488 ms of which 7 ms to minimize.
[2024-05-31 22:54:19] [INFO ] Deduced a trap composed of 208 places in 485 ms of which 5 ms to minimize.
[2024-05-31 22:54:20] [INFO ] Deduced a trap composed of 211 places in 494 ms of which 5 ms to minimize.
[2024-05-31 22:54:20] [INFO ] Deduced a trap composed of 214 places in 492 ms of which 6 ms to minimize.
[2024-05-31 22:54:21] [INFO ] Deduced a trap composed of 204 places in 490 ms of which 6 ms to minimize.
[2024-05-31 22:54:21] [INFO ] Deduced a trap composed of 231 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:54:22] [INFO ] Deduced a trap composed of 422 places in 503 ms of which 8 ms to minimize.
[2024-05-31 22:54:22] [INFO ] Deduced a trap composed of 425 places in 505 ms of which 5 ms to minimize.
[2024-05-31 22:54:23] [INFO ] Deduced a trap composed of 425 places in 474 ms of which 5 ms to minimize.
[2024-05-31 22:54:23] [INFO ] Deduced a trap composed of 206 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:54:24] [INFO ] Deduced a trap composed of 445 places in 479 ms of which 6 ms to minimize.
[2024-05-31 22:54:24] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 3 ms to minimize.
[2024-05-31 22:54:24] [INFO ] Deduced a trap composed of 236 places in 226 ms of which 3 ms to minimize.
[2024-05-31 22:54:24] [INFO ] Deduced a trap composed of 314 places in 245 ms of which 4 ms to minimize.
[2024-05-31 22:54:25] [INFO ] Deduced a trap composed of 322 places in 234 ms of which 3 ms to minimize.
[2024-05-31 22:54:25] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 4 ms to minimize.
[2024-05-31 22:54:25] [INFO ] Deduced a trap composed of 194 places in 226 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1031 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:54:26] [INFO ] Deduced a trap composed of 217 places in 491 ms of which 6 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 230 places in 456 ms of which 6 ms to minimize.
[2024-05-31 22:54:27] [INFO ] Deduced a trap composed of 315 places in 545 ms of which 6 ms to minimize.
[2024-05-31 22:54:28] [INFO ] Deduced a trap composed of 218 places in 538 ms of which 6 ms to minimize.
[2024-05-31 22:54:28] [INFO ] Deduced a trap composed of 210 places in 526 ms of which 6 ms to minimize.
[2024-05-31 22:54:29] [INFO ] Deduced a trap composed of 213 places in 521 ms of which 5 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 220 places in 526 ms of which 6 ms to minimize.
[2024-05-31 22:54:30] [INFO ] Deduced a trap composed of 202 places in 510 ms of which 6 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 200 places in 498 ms of which 8 ms to minimize.
[2024-05-31 22:54:31] [INFO ] Deduced a trap composed of 224 places in 505 ms of which 6 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 217 places in 521 ms of which 6 ms to minimize.
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 211 places in 511 ms of which 6 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 324 places in 577 ms of which 6 ms to minimize.
[2024-05-31 22:54:33] [INFO ] Deduced a trap composed of 253 places in 527 ms of which 6 ms to minimize.
[2024-05-31 22:54:34] [INFO ] Deduced a trap composed of 194 places in 517 ms of which 5 ms to minimize.
[2024-05-31 22:54:35] [INFO ] Deduced a trap composed of 255 places in 509 ms of which 6 ms to minimize.
[2024-05-31 22:54:35] [INFO ] Deduced a trap composed of 270 places in 491 ms of which 6 ms to minimize.
[2024-05-31 22:54:36] [INFO ] Deduced a trap composed of 222 places in 505 ms of which 6 ms to minimize.
[2024-05-31 22:54:36] [INFO ] Deduced a trap composed of 360 places in 415 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1031 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:54:37] [INFO ] Deduced a trap composed of 392 places in 541 ms of which 6 ms to minimize.
[2024-05-31 22:54:38] [INFO ] Deduced a trap composed of 208 places in 538 ms of which 6 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 575 places in 512 ms of which 6 ms to minimize.
[2024-05-31 22:54:39] [INFO ] Deduced a trap composed of 207 places in 549 ms of which 7 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 203 places in 514 ms of which 5 ms to minimize.
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 266 places in 526 ms of which 6 ms to minimize.
[2024-05-31 22:54:41] [INFO ] Deduced a trap composed of 208 places in 493 ms of which 5 ms to minimize.
SMT process timed out in 45372ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 1175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1175/1175 places, 3676/3676 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1175 transition count 3673
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1172 transition count 3673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1171 transition count 3672
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1171 transition count 3672
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1171 transition count 3667
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1166 transition count 3667
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 1166 transition count 3667
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 24 place count 1163 transition count 3664
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 1163 transition count 3664
Applied a total of 27 rules in 368 ms. Remains 1163 /1175 variables (removed 12) and now considering 3664/3676 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 1163/1175 places, 3664/3676 transitions.
RANDOM walk for 40000 steps (1063 resets) in 757 ms. (52 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
[2024-05-31 22:54:42] [INFO ] Flow matrix only has 3278 transitions (discarded 386 similar events)
// Phase 1: matrix 3278 rows 1163 cols
[2024-05-31 22:54:42] [INFO ] Computed 108 invariants in 29 ms
[2024-05-31 22:54:42] [INFO ] State equation strengthened by 1983 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 997/1033 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:54:42] [INFO ] Deduced a trap composed of 189 places in 156 ms of which 3 ms to minimize.
[2024-05-31 22:54:43] [INFO ] Deduced a trap composed of 199 places in 582 ms of which 9 ms to minimize.
[2024-05-31 22:54:43] [INFO ] Deduced a trap composed of 406 places in 577 ms of which 7 ms to minimize.
[2024-05-31 22:54:44] [INFO ] Deduced a trap composed of 197 places in 585 ms of which 6 ms to minimize.
[2024-05-31 22:54:44] [INFO ] Deduced a trap composed of 186 places in 587 ms of which 7 ms to minimize.
[2024-05-31 22:54:45] [INFO ] Deduced a trap composed of 227 places in 589 ms of which 6 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 426 places in 575 ms of which 6 ms to minimize.
[2024-05-31 22:54:46] [INFO ] Deduced a trap composed of 222 places in 587 ms of which 6 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 431 places in 522 ms of which 6 ms to minimize.
[2024-05-31 22:54:47] [INFO ] Deduced a trap composed of 451 places in 528 ms of which 6 ms to minimize.
[2024-05-31 22:54:48] [INFO ] Deduced a trap composed of 248 places in 509 ms of which 6 ms to minimize.
[2024-05-31 22:54:48] [INFO ] Deduced a trap composed of 426 places in 528 ms of which 5 ms to minimize.
[2024-05-31 22:54:49] [INFO ] Deduced a trap composed of 191 places in 532 ms of which 6 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 457 places in 525 ms of which 6 ms to minimize.
[2024-05-31 22:54:50] [INFO ] Deduced a trap composed of 512 places in 595 ms of which 6 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 537 places in 573 ms of which 6 ms to minimize.
[2024-05-31 22:54:51] [INFO ] Deduced a trap composed of 426 places in 531 ms of which 6 ms to minimize.
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 233 places in 597 ms of which 6 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 227 places in 610 ms of which 7 ms to minimize.
[2024-05-31 22:54:53] [INFO ] Deduced a trap composed of 479 places in 616 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1033 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:54:54] [INFO ] Deduced a trap composed of 216 places in 586 ms of which 6 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 238 places in 573 ms of which 6 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 246 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 227 places in 606 ms of which 7 ms to minimize.
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 240 places in 547 ms of which 7 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 399 places in 531 ms of which 6 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 233 places in 530 ms of which 6 ms to minimize.
[2024-05-31 22:54:58] [INFO ] Deduced a trap composed of 237 places in 583 ms of which 6 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 230 places in 532 ms of which 6 ms to minimize.
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 439 places in 522 ms of which 6 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 202 places in 521 ms of which 5 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 247 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:55:01] [INFO ] Deduced a trap composed of 532 places in 539 ms of which 7 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 562 places in 537 ms of which 6 ms to minimize.
[2024-05-31 22:55:02] [INFO ] Deduced a trap composed of 374 places in 577 ms of which 6 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 228 places in 586 ms of which 6 ms to minimize.
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 205 places in 578 ms of which 6 ms to minimize.
[2024-05-31 22:55:04] [INFO ] Deduced a trap composed of 279 places in 592 ms of which 6 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 278 places in 591 ms of which 6 ms to minimize.
[2024-05-31 22:55:05] [INFO ] Deduced a trap composed of 234 places in 587 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:06] [INFO ] Deduced a trap composed of 255 places in 600 ms of which 6 ms to minimize.
[2024-05-31 22:55:07] [INFO ] Deduced a trap composed of 273 places in 615 ms of which 6 ms to minimize.
[2024-05-31 22:55:07] [INFO ] Deduced a trap composed of 301 places in 593 ms of which 6 ms to minimize.
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 271 places in 597 ms of which 6 ms to minimize.
[2024-05-31 22:55:08] [INFO ] Deduced a trap composed of 428 places in 590 ms of which 7 ms to minimize.
[2024-05-31 22:55:09] [INFO ] Deduced a trap composed of 468 places in 593 ms of which 6 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 305 places in 589 ms of which 6 ms to minimize.
[2024-05-31 22:55:10] [INFO ] Deduced a trap composed of 230 places in 592 ms of which 7 ms to minimize.
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 314 places in 585 ms of which 6 ms to minimize.
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 279 places in 549 ms of which 8 ms to minimize.
[2024-05-31 22:55:12] [INFO ] Deduced a trap composed of 242 places in 592 ms of which 6 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 247 places in 536 ms of which 7 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 192 places in 581 ms of which 6 ms to minimize.
[2024-05-31 22:55:14] [INFO ] Deduced a trap composed of 254 places in 580 ms of which 6 ms to minimize.
[2024-05-31 22:55:15] [INFO ] Deduced a trap composed of 289 places in 610 ms of which 7 ms to minimize.
[2024-05-31 22:55:15] [INFO ] Deduced a trap composed of 307 places in 591 ms of which 7 ms to minimize.
[2024-05-31 22:55:16] [INFO ] Deduced a trap composed of 227 places in 589 ms of which 7 ms to minimize.
[2024-05-31 22:55:16] [INFO ] Deduced a trap composed of 229 places in 591 ms of which 6 ms to minimize.
[2024-05-31 22:55:17] [INFO ] Deduced a trap composed of 253 places in 591 ms of which 7 ms to minimize.
[2024-05-31 22:55:18] [INFO ] Deduced a trap composed of 443 places in 504 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:18] [INFO ] Deduced a trap composed of 451 places in 560 ms of which 6 ms to minimize.
[2024-05-31 22:55:19] [INFO ] Deduced a trap composed of 205 places in 534 ms of which 6 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 251 places in 557 ms of which 6 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 215 places in 608 ms of which 7 ms to minimize.
[2024-05-31 22:55:20] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:55:21] [INFO ] Deduced a trap composed of 251 places in 589 ms of which 7 ms to minimize.
[2024-05-31 22:55:22] [INFO ] Deduced a trap composed of 228 places in 541 ms of which 6 ms to minimize.
[2024-05-31 22:55:22] [INFO ] Deduced a trap composed of 199 places in 475 ms of which 6 ms to minimize.
[2024-05-31 22:55:23] [INFO ] Deduced a trap composed of 385 places in 598 ms of which 6 ms to minimize.
[2024-05-31 22:55:23] [INFO ] Deduced a trap composed of 201 places in 545 ms of which 6 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 471 places in 519 ms of which 6 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 602 places in 452 ms of which 6 ms to minimize.
[2024-05-31 22:55:25] [INFO ] Deduced a trap composed of 221 places in 545 ms of which 7 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 261 places in 530 ms of which 6 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 303 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 220 places in 530 ms of which 6 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 235 places in 535 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1033 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 177 places in 531 ms of which 6 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 258 places in 547 ms of which 8 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 457 places in 537 ms of which 6 ms to minimize.
[2024-05-31 22:55:30] [INFO ] Deduced a trap composed of 537 places in 595 ms of which 7 ms to minimize.
[2024-05-31 22:55:31] [INFO ] Deduced a trap composed of 477 places in 602 ms of which 6 ms to minimize.
[2024-05-31 22:55:32] [INFO ] Deduced a trap composed of 562 places in 598 ms of which 6 ms to minimize.
[2024-05-31 22:55:32] [INFO ] Deduced a trap composed of 499 places in 614 ms of which 6 ms to minimize.
[2024-05-31 22:55:33] [INFO ] Deduced a trap composed of 418 places in 596 ms of which 7 ms to minimize.
[2024-05-31 22:55:34] [INFO ] Deduced a trap composed of 366 places in 592 ms of which 6 ms to minimize.
[2024-05-31 22:55:34] [INFO ] Deduced a trap composed of 235 places in 589 ms of which 6 ms to minimize.
[2024-05-31 22:55:35] [INFO ] Deduced a trap composed of 259 places in 591 ms of which 6 ms to minimize.
[2024-05-31 22:55:36] [INFO ] Deduced a trap composed of 295 places in 609 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1033 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 280 places in 590 ms of which 6 ms to minimize.
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 201 places in 585 ms of which 6 ms to minimize.
[2024-05-31 22:55:38] [INFO ] Deduced a trap composed of 196 places in 581 ms of which 6 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 238 places in 529 ms of which 6 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 244 places in 528 ms of which 6 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 199 places in 526 ms of which 5 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 199 places in 550 ms of which 6 ms to minimize.
[2024-05-31 22:55:41] [INFO ] Deduced a trap composed of 275 places in 537 ms of which 6 ms to minimize.
[2024-05-31 22:55:41] [INFO ] Deduced a trap composed of 221 places in 537 ms of which 6 ms to minimize.
[2024-05-31 22:55:42] [INFO ] Deduced a trap composed of 668 places in 526 ms of which 6 ms to minimize.
[2024-05-31 22:55:42] [INFO ] Deduced a trap composed of 699 places in 526 ms of which 6 ms to minimize.
[2024-05-31 22:55:43] [INFO ] Deduced a trap composed of 696 places in 528 ms of which 6 ms to minimize.
[2024-05-31 22:55:44] [INFO ] Deduced a trap composed of 718 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:55:44] [INFO ] Deduced a trap composed of 251 places in 541 ms of which 6 ms to minimize.
[2024-05-31 22:55:45] [INFO ] Deduced a trap composed of 233 places in 530 ms of which 6 ms to minimize.
[2024-05-31 22:55:45] [INFO ] Deduced a trap composed of 331 places in 521 ms of which 6 ms to minimize.
[2024-05-31 22:55:46] [INFO ] Deduced a trap composed of 313 places in 524 ms of which 5 ms to minimize.
[2024-05-31 22:55:46] [INFO ] Deduced a trap composed of 253 places in 537 ms of which 6 ms to minimize.
[2024-05-31 22:55:47] [INFO ] Deduced a trap composed of 235 places in 532 ms of which 6 ms to minimize.
[2024-05-31 22:55:47] [INFO ] Deduced a trap composed of 309 places in 534 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1033 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:48] [INFO ] Deduced a trap composed of 204 places in 530 ms of which 7 ms to minimize.
[2024-05-31 22:55:49] [INFO ] Deduced a trap composed of 593 places in 524 ms of which 6 ms to minimize.
[2024-05-31 22:55:50] [INFO ] Deduced a trap composed of 217 places in 527 ms of which 6 ms to minimize.
[2024-05-31 22:55:50] [INFO ] Deduced a trap composed of 175 places in 606 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1033 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:52] [INFO ] Deduced a trap composed of 189 places in 607 ms of which 6 ms to minimize.
[2024-05-31 22:55:53] [INFO ] Deduced a trap composed of 249 places in 549 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1033 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:54] [INFO ] Deduced a trap composed of 230 places in 524 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1033 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1033 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 4/1037 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 22:55:57] [INFO ] Deduced a trap composed of 308 places in 620 ms of which 6 ms to minimize.
SMT process timed out in 75434ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 1163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1163/1163 places, 3664/3664 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1163 transition count 3663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1162 transition count 3663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1161 transition count 3662
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1161 transition count 3662
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1161 transition count 3661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1160 transition count 3661
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 1160 transition count 3661
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 1159 transition count 3660
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 1159 transition count 3660
Applied a total of 9 rules in 362 ms. Remains 1159 /1163 variables (removed 4) and now considering 3660/3664 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 1159/1163 places, 3660/3664 transitions.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:55:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 22:55:58] [INFO ] Flatten gal took : 104 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:55:58] [INFO ] Flatten gal took : 101 ms
[2024-05-31 22:55:58] [INFO ] Input system was already deterministic with 3373 transitions.
Support contains 130 out of 1552 places (down from 132) after GAL structural reductions.
Computed a total of 720 stabilizing places and 1740 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 1479 transition count 3210
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 1479 transition count 3210
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 197 place count 1428 transition count 3079
Iterating global reduction 0 with 51 rules applied. Total rules applied 248 place count 1428 transition count 3079
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 277 place count 1399 transition count 2905
Iterating global reduction 0 with 29 rules applied. Total rules applied 306 place count 1399 transition count 2905
Applied a total of 306 rules in 205 ms. Remains 1399 /1552 variables (removed 153) and now considering 2905/3373 (removed 468) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 1399/1552 places, 2905/3373 transitions.
[2024-05-31 22:55:58] [INFO ] Flatten gal took : 70 ms
[2024-05-31 22:55:58] [INFO ] Flatten gal took : 77 ms
[2024-05-31 22:55:58] [INFO ] Input system was already deterministic with 2905 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 1479 transition count 3210
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 1479 transition count 3210
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 196 place count 1429 transition count 3065
Iterating global reduction 0 with 50 rules applied. Total rules applied 246 place count 1429 transition count 3065
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 271 place count 1404 transition count 2915
Iterating global reduction 0 with 25 rules applied. Total rules applied 296 place count 1404 transition count 2915
Applied a total of 296 rules in 212 ms. Remains 1404 /1552 variables (removed 148) and now considering 2915/3373 (removed 458) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 1404/1552 places, 2915/3373 transitions.
[2024-05-31 22:55:59] [INFO ] Flatten gal took : 72 ms
[2024-05-31 22:55:59] [INFO ] Flatten gal took : 81 ms
[2024-05-31 22:55:59] [INFO ] Input system was already deterministic with 2915 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 1473 transition count 3194
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 1473 transition count 3194
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 213 place count 1418 transition count 3034
Iterating global reduction 0 with 55 rules applied. Total rules applied 268 place count 1418 transition count 3034
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 296 place count 1390 transition count 2866
Iterating global reduction 0 with 28 rules applied. Total rules applied 324 place count 1390 transition count 2866
Applied a total of 324 rules in 233 ms. Remains 1390 /1552 variables (removed 162) and now considering 2866/3373 (removed 507) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 1390/1552 places, 2866/3373 transitions.
[2024-05-31 22:55:59] [INFO ] Flatten gal took : 66 ms
[2024-05-31 22:55:59] [INFO ] Flatten gal took : 73 ms
[2024-05-31 22:55:59] [INFO ] Input system was already deterministic with 2866 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 1473 transition count 3199
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 1473 transition count 3199
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 214 place count 1417 transition count 3038
Iterating global reduction 0 with 56 rules applied. Total rules applied 270 place count 1417 transition count 3038
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 299 place count 1388 transition count 2864
Iterating global reduction 0 with 29 rules applied. Total rules applied 328 place count 1388 transition count 2864
Applied a total of 328 rules in 197 ms. Remains 1388 /1552 variables (removed 164) and now considering 2864/3373 (removed 509) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 1388/1552 places, 2864/3373 transitions.
[2024-05-31 22:56:00] [INFO ] Flatten gal took : 67 ms
[2024-05-31 22:56:00] [INFO ] Flatten gal took : 72 ms
[2024-05-31 22:56:00] [INFO ] Input system was already deterministic with 2864 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 1476 transition count 3202
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 1476 transition count 3202
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 206 place count 1422 transition count 3048
Iterating global reduction 0 with 54 rules applied. Total rules applied 260 place count 1422 transition count 3048
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 288 place count 1394 transition count 2880
Iterating global reduction 0 with 28 rules applied. Total rules applied 316 place count 1394 transition count 2880
Applied a total of 316 rules in 205 ms. Remains 1394 /1552 variables (removed 158) and now considering 2880/3373 (removed 493) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 1394/1552 places, 2880/3373 transitions.
[2024-05-31 22:56:00] [INFO ] Flatten gal took : 65 ms
[2024-05-31 22:56:00] [INFO ] Flatten gal took : 72 ms
[2024-05-31 22:56:00] [INFO ] Input system was already deterministic with 2880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 1476 transition count 3207
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 1476 transition count 3207
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 206 place count 1422 transition count 3053
Iterating global reduction 0 with 54 rules applied. Total rules applied 260 place count 1422 transition count 3053
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 288 place count 1394 transition count 2885
Iterating global reduction 0 with 28 rules applied. Total rules applied 316 place count 1394 transition count 2885
Applied a total of 316 rules in 226 ms. Remains 1394 /1552 variables (removed 158) and now considering 2885/3373 (removed 488) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 1394/1552 places, 2885/3373 transitions.
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 65 ms
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 71 ms
[2024-05-31 22:56:01] [INFO ] Input system was already deterministic with 2885 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 1472 transition count 3193
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 1472 transition count 3193
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 216 place count 1416 transition count 3032
Iterating global reduction 0 with 56 rules applied. Total rules applied 272 place count 1416 transition count 3032
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 301 place count 1387 transition count 2858
Iterating global reduction 0 with 29 rules applied. Total rules applied 330 place count 1387 transition count 2858
Applied a total of 330 rules in 197 ms. Remains 1387 /1552 variables (removed 165) and now considering 2858/3373 (removed 515) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 1387/1552 places, 2858/3373 transitions.
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 60 ms
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 84 ms
[2024-05-31 22:56:01] [INFO ] Input system was already deterministic with 2858 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 1483 transition count 3214
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 1483 transition count 3214
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 186 place count 1435 transition count 3071
Iterating global reduction 0 with 48 rules applied. Total rules applied 234 place count 1435 transition count 3071
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 257 place count 1412 transition count 2933
Iterating global reduction 0 with 23 rules applied. Total rules applied 280 place count 1412 transition count 2933
Applied a total of 280 rules in 195 ms. Remains 1412 /1552 variables (removed 140) and now considering 2933/3373 (removed 440) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 1412/1552 places, 2933/3373 transitions.
[2024-05-31 22:56:02] [INFO ] Flatten gal took : 61 ms
[2024-05-31 22:56:02] [INFO ] Flatten gal took : 68 ms
[2024-05-31 22:56:02] [INFO ] Input system was already deterministic with 2933 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 1477 transition count 3208
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 1477 transition count 3208
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 203 place count 1424 transition count 3055
Iterating global reduction 0 with 53 rules applied. Total rules applied 256 place count 1424 transition count 3055
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 284 place count 1396 transition count 2887
Iterating global reduction 0 with 28 rules applied. Total rules applied 312 place count 1396 transition count 2887
Applied a total of 312 rules in 193 ms. Remains 1396 /1552 variables (removed 156) and now considering 2887/3373 (removed 486) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 1396/1552 places, 2887/3373 transitions.
[2024-05-31 22:56:02] [INFO ] Flatten gal took : 60 ms
[2024-05-31 22:56:02] [INFO ] Flatten gal took : 67 ms
[2024-05-31 22:56:02] [INFO ] Input system was already deterministic with 2887 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 1552 transition count 3330
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 1509 transition count 3330
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 86 place count 1509 transition count 3275
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 196 place count 1454 transition count 3275
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 242 place count 1408 transition count 3129
Iterating global reduction 2 with 46 rules applied. Total rules applied 288 place count 1408 transition count 3129
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 288 place count 1408 transition count 3126
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 294 place count 1405 transition count 3126
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 316 place count 1383 transition count 2999
Iterating global reduction 2 with 22 rules applied. Total rules applied 338 place count 1383 transition count 2999
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 408 place count 1348 transition count 2964
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 440 place count 1316 transition count 2932
Iterating global reduction 2 with 32 rules applied. Total rules applied 472 place count 1316 transition count 2932
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 499 place count 1289 transition count 2770
Iterating global reduction 2 with 27 rules applied. Total rules applied 526 place count 1289 transition count 2770
Applied a total of 526 rules in 515 ms. Remains 1289 /1552 variables (removed 263) and now considering 2770/3373 (removed 603) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 515 ms. Remains : 1289/1552 places, 2770/3373 transitions.
[2024-05-31 22:56:03] [INFO ] Flatten gal took : 55 ms
[2024-05-31 22:56:03] [INFO ] Flatten gal took : 59 ms
[2024-05-31 22:56:03] [INFO ] Input system was already deterministic with 2770 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 1479 transition count 3210
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 1479 transition count 3210
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 197 place count 1428 transition count 3054
Iterating global reduction 0 with 51 rules applied. Total rules applied 248 place count 1428 transition count 3054
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 272 place count 1404 transition count 2910
Iterating global reduction 0 with 24 rules applied. Total rules applied 296 place count 1404 transition count 2910
Applied a total of 296 rules in 227 ms. Remains 1404 /1552 variables (removed 148) and now considering 2910/3373 (removed 463) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 1404/1552 places, 2910/3373 transitions.
[2024-05-31 22:56:03] [INFO ] Flatten gal took : 64 ms
[2024-05-31 22:56:04] [INFO ] Flatten gal took : 74 ms
[2024-05-31 22:56:04] [INFO ] Input system was already deterministic with 2910 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 1472 transition count 3193
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 1472 transition count 3193
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 216 place count 1416 transition count 3032
Iterating global reduction 0 with 56 rules applied. Total rules applied 272 place count 1416 transition count 3032
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 301 place count 1387 transition count 2858
Iterating global reduction 0 with 29 rules applied. Total rules applied 330 place count 1387 transition count 2858
Applied a total of 330 rules in 198 ms. Remains 1387 /1552 variables (removed 165) and now considering 2858/3373 (removed 515) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 1387/1552 places, 2858/3373 transitions.
[2024-05-31 22:56:04] [INFO ] Flatten gal took : 88 ms
[2024-05-31 22:56:04] [INFO ] Flatten gal took : 68 ms
[2024-05-31 22:56:04] [INFO ] Input system was already deterministic with 2858 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 3373/3373 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 1476 transition count 3207
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 1476 transition count 3207
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 206 place count 1422 transition count 3053
Iterating global reduction 0 with 54 rules applied. Total rules applied 260 place count 1422 transition count 3053
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 288 place count 1394 transition count 2885
Iterating global reduction 0 with 28 rules applied. Total rules applied 316 place count 1394 transition count 2885
Applied a total of 316 rules in 197 ms. Remains 1394 /1552 variables (removed 158) and now considering 2885/3373 (removed 488) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 1394/1552 places, 2885/3373 transitions.
[2024-05-31 22:56:04] [INFO ] Flatten gal took : 61 ms
[2024-05-31 22:56:05] [INFO ] Flatten gal took : 67 ms
[2024-05-31 22:56:05] [INFO ] Input system was already deterministic with 2885 transitions.
[2024-05-31 22:56:05] [INFO ] Flatten gal took : 74 ms
[2024-05-31 22:56:05] [INFO ] Flatten gal took : 103 ms
[2024-05-31 22:56:05] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 22:56:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1552 places, 3373 transitions and 14685 arcs took 18 ms.
Total runtime 150089 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-00
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-01
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-02
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-03
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-04
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-05
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-06
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-07
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-08
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-09
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-10
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-12
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-13

BK_STOP 1717196165744

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1168/ctl_0_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1168/ctl_1_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1168/ctl_2_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1168/ctl_3_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1168/ctl_4_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1168/ctl_5_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1168/ctl_6_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1168/ctl_7_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1168/ctl_8_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1168/ctl_9_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1168/ctl_10_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1168/ctl_11_
ctl formula name MultiCrashLeafsetExtension-PT-S16C06-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1168/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350700034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;