About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16240.571 | 3600000.00 | 11819274.00 | 55105.60 | FFFTFTFFFTFFTF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156700605.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700605
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 37K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.3K May 11 18:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 11 18:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 11 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 11M May 12 08:13 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-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-15
=== Now, execution of the tool begins
BK_START 1621329821445
Running Version 0
[2021-05-18 09:23:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 09:23:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 09:23:44] [INFO ] Load time of PNML (sax parser for PT used): 686 ms
[2021-05-18 09:23:44] [INFO ] Transformed 5568 places.
[2021-05-18 09:23:44] [INFO ] Transformed 7799 transitions.
[2021-05-18 09:23:44] [INFO ] Parsed PT model containing 5568 places and 7799 transitions in 762 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 65 out of 5568 places. Attempting structural reductions.
Starting structural reductions, 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 1612 places :
Symmetric choice reduction at 1 with 1612 rule applications. Total rules 1644 place count 3924 transition count 6187
Iterating global reduction 1 with 1612 rules applied. Total rules applied 3256 place count 3924 transition count 6187
Discarding 1413 places :
Symmetric choice reduction at 1 with 1413 rule applications. Total rules 4669 place count 2511 transition count 4774
Iterating global reduction 1 with 1413 rules applied. Total rules applied 6082 place count 2511 transition count 4774
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 6297 place count 2296 transition count 3484
Iterating global reduction 1 with 215 rules applied. Total rules applied 6512 place count 2296 transition count 3484
Applied a total of 6512 rules in 1179 ms. Remains 2296 /5568 variables (removed 3272) and now considering 3484/7799 (removed 4315) transitions.
[2021-05-18 09:23:45] [INFO ] Flow matrix only has 3212 transitions (discarded 272 similar events)
// Phase 1: matrix 3212 rows 2296 cols
[2021-05-18 09:23:45] [INFO ] Computed 541 place invariants in 178 ms
[2021-05-18 09:23:48] [INFO ] Implicit Places using invariants in 2747 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 30, 38, 47, 58, 71, 86, 102, 118, 120, 122, 124, 126, 128, 130, 143, 154, 163, 170, 175, 178, 205, 212, 215, 216, 217, 218, 219, 220, 221, 224, 229, 236, 245, 256, 269, 283, 297, 298, 299, 300, 301, 302, 303, 314, 323, 330, 335, 338, 340, 367, 374, 377, 378, 379, 380, 381, 384, 388, 391, 396, 403, 423, 435, 447, 448, 449, 450, 451, 452, 453, 462, 469, 474, 477, 479, 481, 508, 515, 518, 519, 520, 521, 522, 523, 524, 526, 528, 531, 536, 543, 552, 562, 572, 573, 574, 575, 576, 577, 578, 585, 591, 594, 596, 598, 600, 627, 634, 637, 638, 639, 640, 643, 645, 649, 651, 654, 659, 668, 684, 685, 687, 688, 689, 690, 698, 701, 703, 705, 707, 709, 736, 743, 747, 748, 750, 751, 752, 756, 760, 762, 764, 767, 772, 778, 784, 785, 786, 787, 788, 789, 790, 793, 795, 797, 799, 802, 804, 831, 838, 841, 842, 843, 844, 846, 847, 849, 852, 854, 856, 858, 864, 868, 872, 874, 875, 876, 877, 878, 880, 882, 884, 886, 890, 892, 919, 926, 929, 930, 931, 932, 933, 934, 935, 937, 939, 941, 943, 945, 947, 949, 952, 953, 954, 955, 956, 957, 958, 960, 962, 964, 966, 968, 970, 999, 1003, 1007, 1008, 1009, 1010, 1011, 1012, 1017, 1019, 1021, 1023, 1025, 1027, 1029, 1032, 1033, 1035, 1036, 1037, 1038, 1042, 1044, 1046, 1048, 1050, 1052, 1079, 1086, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1097, 1099, 1101, 1103, 1105, 1107, 1109, 1112, 1114, 1115, 1116, 1117, 1118, 1120, 1122, 1124, 1126, 1128, 1133, 1167, 1170, 1171, 1174, 1175, 1176, 1178, 1180, 1182, 1184, 1186, 1188, 1196, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1210, 1212, 1214, 1216, 1218, 1220, 1247, 1254, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1265, 1267, 1269, 1271, 1273, 1276, 1281, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1299, 1302, 1304, 1306, 1308, 1310, 1337, 1344, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1355, 1357, 1359, 1361, 1364, 1369, 1376, 1386, 1387, 1388, 1389, 1390, 1391, 1400, 1405, 1408, 1410, 1412, 1414, 1441, 1448, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1459, 1461, 1463, 1466, 1471, 1478, 1487, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1513, 1520, 1525, 1528, 1531, 1533, 1560, 1567, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1578, 1580, 1583, 1588, 1595, 1604, 1616, 1629, 1630, 1631, 1632, 1633, 1634, 1635, 1646, 1655, 1662, 1667, 1670, 1672, 1699, 1706, 1709, 1710, 1711, 1712, 1714, 1715, 1717, 1720, 1728, 1736, 1745, 1756, 1769, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1803, 1814, 1824, 1831, 1836, 1839, 1866, 1868, 1872, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1884, 1889, 1896, 1905, 1916, 1929, 1944, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1982, 1995, 2006, 2015, 2022, 2027, 2055]
Discarding 477 places :
Implicit Place search using SMT only with invariants took 2801 ms to find 477 implicit places.
[2021-05-18 09:23:48] [INFO ] Flow matrix only has 3212 transitions (discarded 272 similar events)
// Phase 1: matrix 3212 rows 1819 cols
[2021-05-18 09:23:48] [INFO ] Computed 64 place invariants in 49 ms
[2021-05-18 09:23:50] [INFO ] Dead Transitions using invariants and state equation in 1738 ms returned []
Starting structural reductions, iteration 1 : 1819/5568 places, 3484/7799 transitions.
Discarding 177 places :
Symmetric choice reduction at 0 with 177 rule applications. Total rules 177 place count 1642 transition count 3307
Iterating global reduction 0 with 177 rules applied. Total rules applied 354 place count 1642 transition count 3307
Discarding 176 places :
Symmetric choice reduction at 0 with 176 rule applications. Total rules 530 place count 1466 transition count 3131
Iterating global reduction 0 with 176 rules applied. Total rules applied 706 place count 1466 transition count 3131
Discarding 176 places :
Symmetric choice reduction at 0 with 176 rule applications. Total rules 882 place count 1290 transition count 2955
Iterating global reduction 0 with 176 rules applied. Total rules applied 1058 place count 1290 transition count 2955
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1077 place count 1271 transition count 2841
Iterating global reduction 0 with 19 rules applied. Total rules applied 1096 place count 1271 transition count 2841
Applied a total of 1096 rules in 287 ms. Remains 1271 /1819 variables (removed 548) and now considering 2841/3484 (removed 643) transitions.
[2021-05-18 09:23:50] [INFO ] Flow matrix only has 2569 transitions (discarded 272 similar events)
// Phase 1: matrix 2569 rows 1271 cols
[2021-05-18 09:23:50] [INFO ] Computed 64 place invariants in 27 ms
[2021-05-18 09:23:51] [INFO ] Implicit Places using invariants in 995 ms returned []
[2021-05-18 09:23:51] [INFO ] Flow matrix only has 2569 transitions (discarded 272 similar events)
// Phase 1: matrix 2569 rows 1271 cols
[2021-05-18 09:23:51] [INFO ] Computed 64 place invariants in 27 ms
[2021-05-18 09:23:52] [INFO ] State equation strengthened by 1025 read => feed constraints.
[2021-05-18 09:24:14] [INFO ] Implicit Places using invariants and state equation in 23125 ms returned []
Implicit Place search using SMT with State Equation took 24123 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1271/5568 places, 2841/7799 transitions.
[2021-05-18 09:24:14] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-18 09:24:14] [INFO ] Flatten gal took : 286 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C06-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 09:24:15] [INFO ] Flatten gal took : 168 ms
[2021-05-18 09:24:15] [INFO ] Input system was already deterministic with 2841 transitions.
Incomplete random walk after 100000 steps, including 1604 resets, run finished after 907 ms. (steps per millisecond=110 ) properties (out of 24) seen :11
Running SMT prover for 13 properties.
[2021-05-18 09:24:16] [INFO ] Flow matrix only has 2569 transitions (discarded 272 similar events)
// Phase 1: matrix 2569 rows 1271 cols
[2021-05-18 09:24:16] [INFO ] Computed 64 place invariants in 23 ms
[2021-05-18 09:24:16] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-18 09:24:16] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2021-05-18 09:24:16] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:17] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2021-05-18 09:24:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:24:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2021-05-18 09:24:17] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:18] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2021-05-18 09:24:18] [INFO ] State equation strengthened by 1025 read => feed constraints.
[2021-05-18 09:24:20] [INFO ] [Nat]Added 1025 Read/Feed constraints in 2059 ms returned sat
[2021-05-18 09:24:20] [INFO ] Deduced a trap composed of 242 places in 573 ms of which 4 ms to minimize.
[2021-05-18 09:24:21] [INFO ] Deduced a trap composed of 274 places in 642 ms of which 2 ms to minimize.
[2021-05-18 09:24:22] [INFO ] Deduced a trap composed of 271 places in 515 ms of which 2 ms to minimize.
[2021-05-18 09:24:23] [INFO ] Deduced a trap composed of 286 places in 510 ms of which 2 ms to minimize.
[2021-05-18 09:24:23] [INFO ] Deduced a trap composed of 289 places in 581 ms of which 2 ms to minimize.
[2021-05-18 09:24:24] [INFO ] Deduced a trap composed of 295 places in 511 ms of which 1 ms to minimize.
[2021-05-18 09:24:25] [INFO ] Deduced a trap composed of 283 places in 522 ms of which 1 ms to minimize.
[2021-05-18 09:24:26] [INFO ] Deduced a trap composed of 297 places in 511 ms of which 1 ms to minimize.
[2021-05-18 09:24:26] [INFO ] Deduced a trap composed of 379 places in 501 ms of which 1 ms to minimize.
[2021-05-18 09:24:27] [INFO ] Deduced a trap composed of 320 places in 502 ms of which 1 ms to minimize.
[2021-05-18 09:24:28] [INFO ] Deduced a trap composed of 318 places in 509 ms of which 1 ms to minimize.
[2021-05-18 09:24:29] [INFO ] Deduced a trap composed of 334 places in 512 ms of which 1 ms to minimize.
[2021-05-18 09:24:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 10477 ms
[2021-05-18 09:24:30] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 163 ms.
[2021-05-18 09:24:33] [INFO ] Added : 96 causal constraints over 20 iterations in 2558 ms. Result :sat
[2021-05-18 09:24:33] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2021-05-18 09:24:33] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 13 ms returned sat
[2021-05-18 09:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:34] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2021-05-18 09:24:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:24:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:24:34] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:35] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2021-05-18 09:24:36] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1061 ms returned sat
[2021-05-18 09:24:36] [INFO ] Deduced a trap composed of 246 places in 517 ms of which 1 ms to minimize.
[2021-05-18 09:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 877 ms
[2021-05-18 09:24:37] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 151 ms.
[2021-05-18 09:24:39] [INFO ] Added : 104 causal constraints over 21 iterations in 2835 ms. Result :sat
[2021-05-18 09:24:40] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:24:40] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 12 ms returned sat
[2021-05-18 09:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:40] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2021-05-18 09:24:41] [INFO ] [Real]Added 1025 Read/Feed constraints in 384 ms returned sat
[2021-05-18 09:24:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:24:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:24:41] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:42] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2021-05-18 09:24:42] [INFO ] [Nat]Added 1025 Read/Feed constraints in 817 ms returned sat
[2021-05-18 09:24:43] [INFO ] Deduced a trap composed of 329 places in 572 ms of which 1 ms to minimize.
[2021-05-18 09:24:44] [INFO ] Deduced a trap composed of 261 places in 523 ms of which 1 ms to minimize.
[2021-05-18 09:24:44] [INFO ] Deduced a trap composed of 378 places in 537 ms of which 1 ms to minimize.
[2021-05-18 09:24:45] [INFO ] Deduced a trap composed of 261 places in 528 ms of which 2 ms to minimize.
[2021-05-18 09:24:46] [INFO ] Deduced a trap composed of 264 places in 523 ms of which 1 ms to minimize.
[2021-05-18 09:24:46] [INFO ] Deduced a trap composed of 277 places in 536 ms of which 1 ms to minimize.
[2021-05-18 09:24:47] [INFO ] Deduced a trap composed of 275 places in 554 ms of which 1 ms to minimize.
[2021-05-18 09:24:48] [INFO ] Deduced a trap composed of 282 places in 557 ms of which 1 ms to minimize.
[2021-05-18 09:24:48] [INFO ] Deduced a trap composed of 272 places in 535 ms of which 2 ms to minimize.
[2021-05-18 09:24:49] [INFO ] Deduced a trap composed of 252 places in 561 ms of which 1 ms to minimize.
[2021-05-18 09:24:50] [INFO ] Deduced a trap composed of 393 places in 549 ms of which 1 ms to minimize.
[2021-05-18 09:24:51] [INFO ] Deduced a trap composed of 402 places in 547 ms of which 1 ms to minimize.
[2021-05-18 09:24:51] [INFO ] Deduced a trap composed of 401 places in 572 ms of which 1 ms to minimize.
[2021-05-18 09:24:52] [INFO ] Deduced a trap composed of 353 places in 531 ms of which 1 ms to minimize.
[2021-05-18 09:24:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9596 ms
[2021-05-18 09:24:52] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 140 ms.
[2021-05-18 09:24:55] [INFO ] Added : 140 causal constraints over 28 iterations in 3429 ms. Result :sat
[2021-05-18 09:24:56] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:24:56] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:56] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2021-05-18 09:24:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:24:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2021-05-18 09:24:57] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 10 ms returned sat
[2021-05-18 09:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:24:57] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2021-05-18 09:24:58] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1239 ms returned sat
[2021-05-18 09:24:59] [INFO ] Deduced a trap composed of 345 places in 563 ms of which 1 ms to minimize.
[2021-05-18 09:25:00] [INFO ] Deduced a trap composed of 126 places in 553 ms of which 1 ms to minimize.
[2021-05-18 09:25:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1374 ms
[2021-05-18 09:25:00] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 134 ms.
[2021-05-18 09:25:02] [INFO ] Added : 83 causal constraints over 17 iterations in 2097 ms. Result :sat
[2021-05-18 09:25:02] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:25:02] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:03] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2021-05-18 09:25:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:25:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:25:03] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 10 ms returned sat
[2021-05-18 09:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:04] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2021-05-18 09:25:05] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1414 ms returned sat
[2021-05-18 09:25:05] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 128 ms.
[2021-05-18 09:25:09] [INFO ] Deduced a trap composed of 387 places in 543 ms of which 1 ms to minimize.
[2021-05-18 09:25:09] [INFO ] Deduced a trap composed of 379 places in 540 ms of which 1 ms to minimize.
[2021-05-18 09:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1345 ms
[2021-05-18 09:25:10] [INFO ] Added : 122 causal constraints over 26 iterations in 4712 ms. Result :sat
[2021-05-18 09:25:10] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:25:10] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:11] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2021-05-18 09:25:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:25:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:25:11] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:12] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2021-05-18 09:25:13] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1911 ms returned sat
[2021-05-18 09:25:14] [INFO ] Deduced a trap composed of 311 places in 561 ms of which 2 ms to minimize.
[2021-05-18 09:25:15] [INFO ] Deduced a trap composed of 168 places in 555 ms of which 1 ms to minimize.
[2021-05-18 09:25:16] [INFO ] Deduced a trap composed of 177 places in 555 ms of which 1 ms to minimize.
[2021-05-18 09:25:17] [INFO ] Deduced a trap composed of 179 places in 582 ms of which 4 ms to minimize.
[2021-05-18 09:25:18] [INFO ] Deduced a trap composed of 181 places in 553 ms of which 1 ms to minimize.
[2021-05-18 09:25:18] [INFO ] Deduced a trap composed of 132 places in 556 ms of which 1 ms to minimize.
[2021-05-18 09:25:20] [INFO ] Deduced a trap composed of 133 places in 571 ms of which 1 ms to minimize.
[2021-05-18 09:25:21] [INFO ] Deduced a trap composed of 175 places in 599 ms of which 1 ms to minimize.
[2021-05-18 09:25:22] [INFO ] Deduced a trap composed of 183 places in 578 ms of which 2 ms to minimize.
[2021-05-18 09:25:23] [INFO ] Deduced a trap composed of 188 places in 561 ms of which 1 ms to minimize.
[2021-05-18 09:25:26] [INFO ] Deduced a trap composed of 150 places in 542 ms of which 1 ms to minimize.
[2021-05-18 09:25:26] [INFO ] Deduced a trap composed of 158 places in 574 ms of which 1 ms to minimize.
[2021-05-18 09:25:27] [INFO ] Deduced a trap composed of 146 places in 602 ms of which 1 ms to minimize.
[2021-05-18 09:25:28] [INFO ] Deduced a trap composed of 161 places in 562 ms of which 2 ms to minimize.
[2021-05-18 09:25:29] [INFO ] Deduced a trap composed of 303 places in 560 ms of which 1 ms to minimize.
[2021-05-18 09:25:30] [INFO ] Deduced a trap composed of 121 places in 554 ms of which 1 ms to minimize.
[2021-05-18 09:25:30] [INFO ] Deduced a trap composed of 151 places in 560 ms of which 1 ms to minimize.
[2021-05-18 09:25:31] [INFO ] Deduced a trap composed of 145 places in 555 ms of which 1 ms to minimize.
[2021-05-18 09:25:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-18 09:25:31] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2021-05-18 09:25:31] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:32] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2021-05-18 09:25:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:25:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:25:32] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:33] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2021-05-18 09:25:34] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1535 ms returned sat
[2021-05-18 09:25:35] [INFO ] Deduced a trap composed of 382 places in 523 ms of which 1 ms to minimize.
[2021-05-18 09:25:35] [INFO ] Deduced a trap composed of 202 places in 556 ms of which 1 ms to minimize.
[2021-05-18 09:25:36] [INFO ] Deduced a trap composed of 137 places in 538 ms of which 1 ms to minimize.
[2021-05-18 09:25:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1924 ms
[2021-05-18 09:25:36] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 134 ms.
[2021-05-18 09:25:39] [INFO ] Added : 108 causal constraints over 22 iterations in 2650 ms. Result :sat
[2021-05-18 09:25:39] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2021-05-18 09:25:39] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 12 ms returned sat
[2021-05-18 09:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:40] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2021-05-18 09:25:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:25:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2021-05-18 09:25:40] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:40] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2021-05-18 09:25:41] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1090 ms returned sat
[2021-05-18 09:25:42] [INFO ] Deduced a trap composed of 270 places in 508 ms of which 1 ms to minimize.
[2021-05-18 09:25:43] [INFO ] Deduced a trap composed of 262 places in 505 ms of which 1 ms to minimize.
[2021-05-18 09:25:43] [INFO ] Deduced a trap composed of 257 places in 509 ms of which 1 ms to minimize.
[2021-05-18 09:25:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2002 ms
[2021-05-18 09:25:44] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 133 ms.
[2021-05-18 09:25:45] [INFO ] Added : 73 causal constraints over 15 iterations in 1878 ms. Result :sat
[2021-05-18 09:25:45] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:25:45] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:46] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2021-05-18 09:25:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:25:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:25:46] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:47] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2021-05-18 09:25:49] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1473 ms returned sat
[2021-05-18 09:25:49] [INFO ] Deduced a trap composed of 381 places in 541 ms of which 8 ms to minimize.
[2021-05-18 09:25:50] [INFO ] Deduced a trap composed of 149 places in 565 ms of which 1 ms to minimize.
[2021-05-18 09:25:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1332 ms
[2021-05-18 09:25:50] [INFO ] Computed and/alt/rep : 2174/4092/2174 causal constraints (skipped 378 transitions) in 130 ms.
[2021-05-18 09:25:56] [INFO ] Added : 246 causal constraints over 50 iterations in 5800 ms. Result :sat
[2021-05-18 09:25:56] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned unsat
[2021-05-18 09:25:56] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2021-05-18 09:25:56] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:57] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2021-05-18 09:25:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:25:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2021-05-18 09:25:57] [INFO ] [Nat]Absence check using 31 positive and 33 generalized place invariants in 10 ms returned sat
[2021-05-18 09:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:25:58] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2021-05-18 09:26:00] [INFO ] [Nat]Added 1025 Read/Feed constraints in 1893 ms returned sat
[2021-05-18 09:26:00] [INFO ] Deduced a trap composed of 220 places in 548 ms of which 2 ms to minimize.
[2021-05-18 09:26:01] [INFO ] Deduced a trap composed of 247 places in 541 ms of which 1 ms to minimize.
[2021-05-18 09:26:02] [INFO ] Deduced a trap composed of 257 places in 536 ms of which 1 ms to minimize.
[2021-05-18 09:26:03] [INFO ] Deduced a trap composed of 253 places in 543 ms of which 1 ms to minimize.
[2021-05-18 09:26:04] [INFO ] Deduced a trap composed of 324 places in 543 ms of which 1 ms to minimize.
[2021-05-18 09:26:04] [INFO ] Deduced a trap composed of 175 places in 559 ms of which 1 ms to minimize.
[2021-05-18 09:26:05] [INFO ] Deduced a trap composed of 153 places in 574 ms of which 1 ms to minimize.
[2021-05-18 09:26:06] [INFO ] Deduced a trap composed of 153 places in 557 ms of which 1 ms to minimize.
[2021-05-18 09:26:07] [INFO ] Deduced a trap composed of 132 places in 557 ms of which 1 ms to minimize.
[2021-05-18 09:26:07] [INFO ] Deduced a trap composed of 280 places in 535 ms of which 2 ms to minimize.
[2021-05-18 09:26:08] [INFO ] Deduced a trap composed of 279 places in 546 ms of which 1 ms to minimize.
[2021-05-18 09:26:09] [INFO ] Deduced a trap composed of 268 places in 533 ms of which 1 ms to minimize.
[2021-05-18 09:26:09] [INFO ] Deduced a trap composed of 281 places in 527 ms of which 1 ms to minimize.
[2021-05-18 09:26:10] [INFO ] Deduced a trap composed of 159 places in 568 ms of which 1 ms to minimize.
[2021-05-18 09:26:11] [INFO ] Deduced a trap composed of 159 places in 537 ms of which 1 ms to minimize.
[2021-05-18 09:26:11] [INFO ] Deduced a trap composed of 151 places in 570 ms of which 1 ms to minimize.
[2021-05-18 09:26:12] [INFO ] Deduced a trap composed of 284 places in 535 ms of which 1 ms to minimize.
[2021-05-18 09:26:13] [INFO ] Deduced a trap composed of 276 places in 541 ms of which 1 ms to minimize.
[2021-05-18 09:26:13] [INFO ] Deduced a trap composed of 268 places in 541 ms of which 1 ms to minimize.
[2021-05-18 09:26:14] [INFO ] Deduced a trap composed of 297 places in 550 ms of which 1 ms to minimize.
[2021-05-18 09:26:16] [INFO ] Deduced a trap composed of 281 places in 537 ms of which 1 ms to minimize.
[2021-05-18 09:26:17] [INFO ] Deduced a trap composed of 160 places in 552 ms of which 1 ms to minimize.
[2021-05-18 09:26:17] [INFO ] Deduced a trap composed of 299 places in 543 ms of which 1 ms to minimize.
[2021-05-18 09:26:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2021-05-18 09:26:18] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2021-05-18 09:26:18] [INFO ] [Real]Absence check using 31 positive and 33 generalized place invariants in 11 ms returned sat
[2021-05-18 09:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:26:18] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2021-05-18 09:26:18] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2021-05-18 09:26:24] [INFO ] Initial state test concluded for 1 properties.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1247 transition count 2772
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1247 transition count 2772
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 1232 transition count 2727
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 1232 transition count 2727
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 1224 transition count 2679
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 1224 transition count 2679
Applied a total of 94 rules in 386 ms. Remains 1224 /1271 variables (removed 47) and now considering 2679/2841 (removed 162) transitions.
[2021-05-18 09:26:24] [INFO ] Flow matrix only has 2407 transitions (discarded 272 similar events)
// Phase 1: matrix 2407 rows 1224 cols
[2021-05-18 09:26:24] [INFO ] Computed 64 place invariants in 20 ms
[2021-05-18 09:26:26] [INFO ] Implicit Places using invariants in 1122 ms returned [289, 311, 440, 441, 464, 472, 499, 500, 541, 555, 591, 598, 608, 637, 648, 657, 658, 925]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1124 ms to find 18 implicit places.
[2021-05-18 09:26:26] [INFO ] Flow matrix only has 2407 transitions (discarded 272 similar events)
// Phase 1: matrix 2407 rows 1206 cols
[2021-05-18 09:26:26] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:26:27] [INFO ] Dead Transitions using invariants and state equation in 1123 ms returned []
Starting structural reductions, iteration 1 : 1206/1271 places, 2679/2841 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1192 transition count 2665
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1192 transition count 2665
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1178 transition count 2651
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1178 transition count 2651
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1164 transition count 2637
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1164 transition count 2637
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 1153 transition count 2571
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 1153 transition count 2571
Applied a total of 106 rules in 180 ms. Remains 1153 /1206 variables (removed 53) and now considering 2571/2679 (removed 108) transitions.
[2021-05-18 09:26:27] [INFO ] Flow matrix only has 2299 transitions (discarded 272 similar events)
// Phase 1: matrix 2299 rows 1153 cols
[2021-05-18 09:26:27] [INFO ] Computed 46 place invariants in 17 ms
[2021-05-18 09:26:28] [INFO ] Implicit Places using invariants in 953 ms returned []
[2021-05-18 09:26:28] [INFO ] Flow matrix only has 2299 transitions (discarded 272 similar events)
// Phase 1: matrix 2299 rows 1153 cols
[2021-05-18 09:26:28] [INFO ] Computed 46 place invariants in 17 ms
[2021-05-18 09:26:28] [INFO ] State equation strengthened by 855 read => feed constraints.
[2021-05-18 09:26:43] [INFO ] Implicit Places using invariants and state equation in 15195 ms returned []
Implicit Place search using SMT with State Equation took 16149 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1153/1271 places, 2571/2841 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s696 1) (GEQ s716 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-00 finished in 19162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1271 transition count 2818
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1248 transition count 2818
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 46 place count 1248 transition count 2799
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 84 place count 1229 transition count 2799
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 99 place count 1214 transition count 2739
Iterating global reduction 2 with 15 rules applied. Total rules applied 114 place count 1214 transition count 2739
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 1214 transition count 2738
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1213 transition count 2738
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 1207 transition count 2702
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 1207 transition count 2702
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 192 place count 1175 transition count 2670
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 200 place count 1167 transition count 2662
Iterating global reduction 2 with 8 rules applied. Total rules applied 208 place count 1167 transition count 2662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 215 place count 1160 transition count 2620
Iterating global reduction 2 with 7 rules applied. Total rules applied 222 place count 1160 transition count 2620
Applied a total of 222 rules in 560 ms. Remains 1160 /1271 variables (removed 111) and now considering 2620/2841 (removed 221) transitions.
[2021-05-18 09:26:44] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1160 cols
[2021-05-18 09:26:44] [INFO ] Computed 64 place invariants in 32 ms
[2021-05-18 09:26:45] [INFO ] Implicit Places using invariants in 992 ms returned [262, 284, 412, 413, 436, 444, 468, 509, 523, 556, 562, 572, 598, 608, 616, 617, 704, 874]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 994 ms to find 18 implicit places.
[2021-05-18 09:26:45] [INFO ] Redundant transitions in 158 ms returned []
[2021-05-18 09:26:45] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1142 cols
[2021-05-18 09:26:45] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:26:46] [INFO ] Dead Transitions using invariants and state equation in 1106 ms returned []
Starting structural reductions, iteration 1 : 1142/1271 places, 2620/2841 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1135 transition count 2613
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1135 transition count 2613
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1128 transition count 2606
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1128 transition count 2606
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 1124 transition count 2582
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 1124 transition count 2582
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 50 place count 1117 transition count 2575
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 1110 transition count 2568
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 1110 transition count 2568
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 1103 transition count 2526
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 1103 transition count 2526
Applied a total of 78 rules in 427 ms. Remains 1103 /1142 variables (removed 39) and now considering 2526/2620 (removed 94) transitions.
[2021-05-18 09:26:46] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1103 cols
[2021-05-18 09:26:46] [INFO ] Computed 46 place invariants in 36 ms
[2021-05-18 09:26:47] [INFO ] Implicit Places using invariants in 904 ms returned []
[2021-05-18 09:26:47] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1103 cols
[2021-05-18 09:26:47] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:26:48] [INFO ] State equation strengthened by 860 read => feed constraints.
[2021-05-18 09:26:48] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1103/1271 places, 2526/2841 transitions.
Stuttering acceptance computed with spot in 7570 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s457 1) (GEQ s485 1)), p0:(GEQ s1078 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-01 finished in 12665 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0 U p1) U (p2 U (!p0 U p3)))||X(X(G(p4)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1250 transition count 2790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1250 transition count 2790
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 1235 transition count 2740
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 1235 transition count 2740
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 1228 transition count 2698
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 1228 transition count 2698
Applied a total of 86 rules in 219 ms. Remains 1228 /1271 variables (removed 43) and now considering 2698/2841 (removed 143) transitions.
[2021-05-18 09:26:56] [INFO ] Flow matrix only has 2426 transitions (discarded 272 similar events)
// Phase 1: matrix 2426 rows 1228 cols
[2021-05-18 09:26:56] [INFO ] Computed 64 place invariants in 26 ms
[2021-05-18 09:26:57] [INFO ] Implicit Places using invariants in 998 ms returned [289, 311, 441, 442, 465, 473, 500, 501, 559, 595, 602, 612, 641, 652, 661, 662, 753, 928]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 18 implicit places.
[2021-05-18 09:26:57] [INFO ] Flow matrix only has 2426 transitions (discarded 272 similar events)
// Phase 1: matrix 2426 rows 1210 cols
[2021-05-18 09:26:57] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:26:58] [INFO ] Dead Transitions using invariants and state equation in 1123 ms returned []
Starting structural reductions, iteration 1 : 1210/1271 places, 2698/2841 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1196 transition count 2684
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1196 transition count 2684
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1182 transition count 2670
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1182 transition count 2670
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1168 transition count 2656
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1168 transition count 2656
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 1157 transition count 2590
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 1157 transition count 2590
Applied a total of 106 rules in 266 ms. Remains 1157 /1210 variables (removed 53) and now considering 2590/2698 (removed 108) transitions.
[2021-05-18 09:26:58] [INFO ] Flow matrix only has 2318 transitions (discarded 272 similar events)
// Phase 1: matrix 2318 rows 1157 cols
[2021-05-18 09:26:58] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:26:59] [INFO ] Implicit Places using invariants in 896 ms returned []
[2021-05-18 09:26:59] [INFO ] Flow matrix only has 2318 transitions (discarded 272 similar events)
// Phase 1: matrix 2318 rows 1157 cols
[2021-05-18 09:26:59] [INFO ] Computed 46 place invariants in 16 ms
[2021-05-18 09:27:00] [INFO ] State equation strengthened by 870 read => feed constraints.
[2021-05-18 09:27:14] [INFO ] Implicit Places using invariants and state equation in 15060 ms returned []
Implicit Place search using SMT with State Equation took 15957 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1157/1271 places, 2590/2841 transitions.
Stuttering acceptance computed with spot in 591 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p1) p2 (NOT p4)) (AND (NOT p1) p3 (NOT p4))), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), true, (NOT p1), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-02 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(OR (AND p3 p0 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 9}], [{ cond=(OR (AND (NOT p3) p0 p4) (AND (NOT p3) p1 p4)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1) p4), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1) p4), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1) p4), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=5 dest: 12}, { cond=(OR (AND (NOT p3) p0 (NOT p4)) (AND (NOT p3) p1 (NOT p4))), acceptance={} source=5 dest: 13}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1) (NOT p4)), acceptance={} source=5 dest: 14}], [{ cond=(AND (NOT p3) p2 p4), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p4), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p2) p4), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p4)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=6 dest: 14}], [{ cond=(AND p0 (NOT p1) p4), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p4), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p4)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0) p4), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) p0 p4), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p3) p0 (NOT p4)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=8 dest: 12}], [{ cond=p4, acceptance={} source=9 dest: 9}, { cond=(NOT p4), acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=12 dest: 10}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=12 dest: 12}], [{ cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={0} source=13 dest: 11}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=13 dest: 12}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=13 dest: 13}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={0} source=13 dest: 14}], [{ cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=14 dest: 10}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=14 dest: 12}, { cond=(AND (NOT p3) p2), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p3:(AND (GEQ s416 1) (GEQ s1129 1)), p0:(OR (LT s779 1) (LT s1141 1)), p1:(AND (GEQ s952 1) (GEQ s1144 1)), p2:(AND (GEQ s397 1) (GEQ s612 1)), p4:(GEQ s528 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 2 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-02 finished in 19194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1271 transition count 2818
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1248 transition count 2818
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 46 place count 1248 transition count 2797
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 88 place count 1227 transition count 2797
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 105 place count 1210 transition count 2735
Iterating global reduction 2 with 17 rules applied. Total rules applied 122 place count 1210 transition count 2735
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 122 place count 1210 transition count 2734
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 1209 transition count 2734
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 1201 transition count 2691
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 1201 transition count 2691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 1200 transition count 2685
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 1200 transition count 2685
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 202 place count 1170 transition count 2655
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 210 place count 1162 transition count 2647
Iterating global reduction 2 with 8 rules applied. Total rules applied 218 place count 1162 transition count 2647
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 1155 transition count 2605
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 1155 transition count 2605
Applied a total of 232 rules in 534 ms. Remains 1155 /1271 variables (removed 116) and now considering 2605/2841 (removed 236) transitions.
[2021-05-18 09:27:16] [INFO ] Flow matrix only has 2333 transitions (discarded 272 similar events)
// Phase 1: matrix 2333 rows 1155 cols
[2021-05-18 09:27:16] [INFO ] Computed 64 place invariants in 18 ms
[2021-05-18 09:27:16] [INFO ] Implicit Places using invariants in 962 ms returned [262, 284, 410, 411, 434, 442, 465, 466, 504, 518, 551, 557, 567, 593, 603, 611, 612, 700, 870]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 964 ms to find 19 implicit places.
[2021-05-18 09:27:17] [INFO ] Redundant transitions in 119 ms returned []
[2021-05-18 09:27:17] [INFO ] Flow matrix only has 2333 transitions (discarded 272 similar events)
// Phase 1: matrix 2333 rows 1136 cols
[2021-05-18 09:27:17] [INFO ] Computed 45 place invariants in 19 ms
[2021-05-18 09:27:18] [INFO ] Dead Transitions using invariants and state equation in 1071 ms returned []
Starting structural reductions, iteration 1 : 1136/1271 places, 2605/2841 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1128 transition count 2597
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1128 transition count 2597
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1120 transition count 2589
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1120 transition count 2589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1116 transition count 2565
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1116 transition count 2565
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 54 place count 1109 transition count 2558
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 1102 transition count 2551
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 1102 transition count 2551
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1094 transition count 2503
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1094 transition count 2503
Applied a total of 84 rules in 423 ms. Remains 1094 /1136 variables (removed 42) and now considering 2503/2605 (removed 102) transitions.
[2021-05-18 09:27:18] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1094 cols
[2021-05-18 09:27:18] [INFO ] Computed 45 place invariants in 17 ms
[2021-05-18 09:27:19] [INFO ] Implicit Places using invariants in 853 ms returned []
[2021-05-18 09:27:19] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1094 cols
[2021-05-18 09:27:19] [INFO ] Computed 45 place invariants in 16 ms
[2021-05-18 09:27:20] [INFO ] State equation strengthened by 845 read => feed constraints.
[2021-05-18 09:27:20] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1094/1271 places, 2503/2841 transitions.
Stuttering acceptance computed with spot in 7090 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s153 1) (LT s629 1) (LT s632 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2279 reset in 624 ms.
Product exploration explored 100000 steps with 2279 reset in 581 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2278 reset in 530 ms.
Product exploration explored 100000 steps with 2281 reset in 559 ms.
[2021-05-18 09:27:30] [INFO ] Flatten gal took : 77 ms
[2021-05-18 09:27:30] [INFO ] Flatten gal took : 73 ms
[2021-05-18 09:27:30] [INFO ] Time to serialize gal into /tmp/LTL1160020894878230082.gal : 34 ms
[2021-05-18 09:27:30] [INFO ] Time to serialize properties into /tmp/LTL14794847841361885898.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1160020894878230082.gal, -t, CGAL, -LTL, /tmp/LTL14794847841361885898.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1160020894878230082.gal -t CGAL -LTL /tmp/LTL14794847841361885898.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((Node1AsksIsThereANodeMaster<1)||(Node12IsActive<1))||(Node12IsTheNodeMaster<1))"))))
Formula 0 simplified : !GF"(((Node1AsksIsThereANodeMaster<1)||(Node12IsActive<1))||(Node12IsTheNodeMaster<1))"
Detected timeout of ITS tools.
[2021-05-18 09:27:45] [INFO ] Flatten gal took : 68 ms
[2021-05-18 09:27:45] [INFO ] Applying decomposition
[2021-05-18 09:27:45] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5487541390504202853.txt, -o, /tmp/graph5487541390504202853.bin, -w, /tmp/graph5487541390504202853.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5487541390504202853.bin, -l, -1, -v, -w, /tmp/graph5487541390504202853.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:27:45] [INFO ] Decomposing Gal with order
[2021-05-18 09:27:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:27:46] [INFO ] Removed a total of 2212 redundant transitions.
[2021-05-18 09:27:46] [INFO ] Flatten gal took : 648 ms
[2021-05-18 09:27:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1415 labels/synchronizations in 181 ms.
[2021-05-18 09:27:46] [INFO ] Time to serialize gal into /tmp/LTL18150211541036508773.gal : 57 ms
[2021-05-18 09:27:46] [INFO ] Time to serialize properties into /tmp/LTL6752379735242500404.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18150211541036508773.gal, -t, CGAL, -LTL, /tmp/LTL6752379735242500404.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18150211541036508773.gal -t CGAL -LTL /tmp/LTL6752379735242500404.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u0.Node1AsksIsThereANodeMaster<1)||(u0.Node12IsActive<1))||(u0.Node12IsTheNodeMaster<1))"))))
Formula 0 simplified : !GF"(((u0.Node1AsksIsThereANodeMaster<1)||(u0.Node12IsActive<1))||(u0.Node12IsTheNodeMaster<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8657723513764307470
[2021-05-18 09:28:02] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8657723513764307470
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8657723513764307470]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8657723513764307470] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8657723513764307470] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-03 finished in 47844 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1247 transition count 2772
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1247 transition count 2772
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 1232 transition count 2722
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 1232 transition count 2722
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 1225 transition count 2680
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 1225 transition count 2680
Applied a total of 92 rules in 243 ms. Remains 1225 /1271 variables (removed 46) and now considering 2680/2841 (removed 161) transitions.
[2021-05-18 09:28:03] [INFO ] Flow matrix only has 2408 transitions (discarded 272 similar events)
// Phase 1: matrix 2408 rows 1225 cols
[2021-05-18 09:28:03] [INFO ] Computed 64 place invariants in 18 ms
[2021-05-18 09:28:04] [INFO ] Implicit Places using invariants in 1138 ms returned [314, 443, 444, 467, 475, 502, 503, 544, 558, 594, 601, 611, 640, 651, 660, 661, 752, 926]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1139 ms to find 18 implicit places.
[2021-05-18 09:28:04] [INFO ] Flow matrix only has 2408 transitions (discarded 272 similar events)
// Phase 1: matrix 2408 rows 1207 cols
[2021-05-18 09:28:04] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:28:05] [INFO ] Dead Transitions using invariants and state equation in 1102 ms returned []
Starting structural reductions, iteration 1 : 1207/1271 places, 2680/2841 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1193 transition count 2666
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1193 transition count 2666
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1179 transition count 2652
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1179 transition count 2652
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1165 transition count 2638
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1165 transition count 2638
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 1154 transition count 2572
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 1154 transition count 2572
Applied a total of 106 rules in 298 ms. Remains 1154 /1207 variables (removed 53) and now considering 2572/2680 (removed 108) transitions.
[2021-05-18 09:28:06] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2021-05-18 09:28:06] [INFO ] Computed 46 place invariants in 16 ms
[2021-05-18 09:28:07] [INFO ] Implicit Places using invariants in 872 ms returned []
[2021-05-18 09:28:07] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2021-05-18 09:28:07] [INFO ] Computed 46 place invariants in 15 ms
[2021-05-18 09:28:07] [INFO ] State equation strengthened by 855 read => feed constraints.
[2021-05-18 09:28:18] [INFO ] Implicit Places using invariants and state equation in 11367 ms returned []
Implicit Place search using SMT with State Equation took 12249 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1154/1271 places, 2572/2841 transitions.
Stuttering acceptance computed with spot in 1700 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s108 1) (GEQ s483 1)), p1:(GEQ s290 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-04 finished in 16767 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X((G(p1) U (p2&&G(p1))))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1248 transition count 2773
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1248 transition count 2773
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 1234 transition count 2734
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 1234 transition count 2734
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 1226 transition count 2686
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 1226 transition count 2686
Applied a total of 90 rules in 216 ms. Remains 1226 /1271 variables (removed 45) and now considering 2686/2841 (removed 155) transitions.
[2021-05-18 09:28:20] [INFO ] Flow matrix only has 2414 transitions (discarded 272 similar events)
// Phase 1: matrix 2414 rows 1226 cols
[2021-05-18 09:28:20] [INFO ] Computed 64 place invariants in 22 ms
[2021-05-18 09:28:21] [INFO ] Implicit Places using invariants in 1045 ms returned [289, 311, 440, 441, 464, 472, 499, 500, 541, 593, 600, 641, 652, 661, 662, 753, 927]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1055 ms to find 17 implicit places.
[2021-05-18 09:28:21] [INFO ] Flow matrix only has 2414 transitions (discarded 272 similar events)
// Phase 1: matrix 2414 rows 1209 cols
[2021-05-18 09:28:21] [INFO ] Computed 47 place invariants in 20 ms
[2021-05-18 09:28:22] [INFO ] Dead Transitions using invariants and state equation in 1225 ms returned []
Starting structural reductions, iteration 1 : 1209/1271 places, 2686/2841 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1196 transition count 2673
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1196 transition count 2673
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1183 transition count 2660
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1183 transition count 2660
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1170 transition count 2647
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1170 transition count 2647
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 88 place count 1160 transition count 2587
Iterating global reduction 0 with 10 rules applied. Total rules applied 98 place count 1160 transition count 2587
Applied a total of 98 rules in 298 ms. Remains 1160 /1209 variables (removed 49) and now considering 2587/2686 (removed 99) transitions.
[2021-05-18 09:28:22] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1160 cols
[2021-05-18 09:28:22] [INFO ] Computed 47 place invariants in 17 ms
[2021-05-18 09:28:23] [INFO ] Implicit Places using invariants in 943 ms returned []
[2021-05-18 09:28:23] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1160 cols
[2021-05-18 09:28:23] [INFO ] Computed 47 place invariants in 18 ms
[2021-05-18 09:28:24] [INFO ] State equation strengthened by 865 read => feed constraints.
[2021-05-18 09:28:38] [INFO ] Implicit Places using invariants and state equation in 14926 ms returned []
Implicit Place search using SMT with State Equation took 15880 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1160/1271 places, 2587/2841 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-05 automaton TGBA [mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s582 1) (LT s590 1)), p1:(OR (LT s536 1) (LT s540 1)), p2:(OR (LT s582 1) (LT s590 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1605 reset in 522 ms.
Product exploration explored 100000 steps with 1605 reset in 640 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1605 reset in 454 ms.
Product exploration explored 100000 steps with 1604 reset in 471 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1160/1160 places, 2587/2587 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1160 transition count 2587
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 22 place count 1160 transition count 2587
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 34 place count 1160 transition count 2587
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 1150 transition count 2577
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 1150 transition count 2577
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 73 place count 1150 transition count 2577
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1148 transition count 2575
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1148 transition count 2575
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 77 rules in 716 ms. Remains 1148 /1160 variables (removed 12) and now considering 2575/2587 (removed 12) transitions.
[2021-05-18 09:28:42] [INFO ] Redundant transitions in 61 ms returned []
[2021-05-18 09:28:42] [INFO ] Flow matrix only has 2303 transitions (discarded 272 similar events)
// Phase 1: matrix 2303 rows 1148 cols
[2021-05-18 09:28:42] [INFO ] Computed 47 place invariants in 18 ms
[2021-05-18 09:28:43] [INFO ] Dead Transitions using invariants and state equation in 1125 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1148/1160 places, 2575/2587 transitions.
Product exploration explored 100000 steps with 2270 reset in 617 ms.
Product exploration explored 100000 steps with 2269 reset in 610 ms.
[2021-05-18 09:28:44] [INFO ] Flatten gal took : 74 ms
[2021-05-18 09:28:44] [INFO ] Flatten gal took : 75 ms
[2021-05-18 09:28:44] [INFO ] Time to serialize gal into /tmp/LTL6687384238596400484.gal : 9 ms
[2021-05-18 09:28:55] [INFO ] Time to serialize properties into /tmp/LTL1384754827353600111.ltl : 10377 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6687384238596400484.gal, -t, CGAL, -LTL, /tmp/LTL1384754827353600111.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6687384238596400484.gal -t CGAL -LTL /tmp/LTL1384754827353600111.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(LeafSetOfRx2IsSentToNode8<1))")||(X((G("((Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(LeafSetOfRx1IsSentToNode6<1))"))U(("((Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(LeafSetOfRx2IsSentToNode8<1))")&&(G("((Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(LeafSetOfRx1IsSentToNode6<1))")))))))))
Formula 0 simplified : !FG("((Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(LeafSetOfRx2IsSentToNode8<1))" | X(G"((Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(LeafSetOfRx1IsSentToNode6<1))" U ("((Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(LeafSetOfRx2IsSentToNode8<1))" & G"((Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(LeafSetOfRx1IsSentToNode6<1))")))
Detected timeout of ITS tools.
[2021-05-18 09:29:10] [INFO ] Flatten gal took : 72 ms
[2021-05-18 09:29:10] [INFO ] Applying decomposition
[2021-05-18 09:29:10] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8124143806645000561.txt, -o, /tmp/graph8124143806645000561.bin, -w, /tmp/graph8124143806645000561.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8124143806645000561.bin, -l, -1, -v, -w, /tmp/graph8124143806645000561.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:29:12] [INFO ] Decomposing Gal with order
[2021-05-18 09:29:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:29:12] [INFO ] Removed a total of 2846 redundant transitions.
[2021-05-18 09:29:12] [INFO ] Flatten gal took : 181 ms
[2021-05-18 09:29:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1215 labels/synchronizations in 78 ms.
[2021-05-18 09:29:13] [INFO ] Time to serialize gal into /tmp/LTL4122173970845689595.gal : 310 ms
[2021-05-18 09:29:13] [INFO ] Time to serialize properties into /tmp/LTL14557233962359394858.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4122173970845689595.gal, -t, CGAL, -LTL, /tmp/LTL14557233962359394858.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4122173970845689595.gal -t CGAL -LTL /tmp/LTL14557233962359394858.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i4.u17.Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(i4.u99.LeafSetOfRx2IsSentToNode8<1))")||(X((G("((i4.u191.Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(i4.u95.LeafSetOfRx1IsSentToNode6<1))"))U(("((i4.u17.Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(i4.u99.LeafSetOfRx2IsSentToNode8<1))")&&(G("((i4.u191.Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(i4.u95.LeafSetOfRx1IsSentToNode6<1))")))))))))
Formula 0 simplified : !FG("((i4.u17.Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(i4.u99.LeafSetOfRx2IsSentToNode8<1))" | X(G"((i4.u191.Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(i4.u95.LeafSetOfRx1IsSentToNode6<1))" U ("((i4.u17.Node8HasAskedItsLeafSetToRx2ToReplaceNode10<1)||(i4.u99.LeafSetOfRx2IsSentToNode8<1))" & G"((i4.u191.Node6HasAskedItsLeafSetToRx1ToReplaceNode14<1)||(i4.u95.LeafSetOfRx1IsSentToNode6<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15441645226343354600
[2021-05-18 09:29:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15441645226343354600
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15441645226343354600]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15441645226343354600] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15441645226343354600] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-05 finished in 69084 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1 U X(X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1248 transition count 2783
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1248 transition count 2783
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 1232 transition count 2732
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 1232 transition count 2732
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 1224 transition count 2684
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 1224 transition count 2684
Applied a total of 94 rules in 174 ms. Remains 1224 /1271 variables (removed 47) and now considering 2684/2841 (removed 157) transitions.
[2021-05-18 09:29:31] [INFO ] Flow matrix only has 2412 transitions (discarded 272 similar events)
// Phase 1: matrix 2412 rows 1224 cols
[2021-05-18 09:29:31] [INFO ] Computed 64 place invariants in 72 ms
[2021-05-18 09:29:32] [INFO ] Implicit Places using invariants in 1314 ms returned [290, 312, 441, 442, 473, 500, 501, 543, 557, 593, 600, 610, 639, 659, 660, 751, 925]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1317 ms to find 17 implicit places.
[2021-05-18 09:29:32] [INFO ] Flow matrix only has 2412 transitions (discarded 272 similar events)
// Phase 1: matrix 2412 rows 1207 cols
[2021-05-18 09:29:32] [INFO ] Computed 47 place invariants in 18 ms
[2021-05-18 09:29:33] [INFO ] Dead Transitions using invariants and state equation in 1157 ms returned []
Starting structural reductions, iteration 1 : 1207/1271 places, 2684/2841 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1192 transition count 2669
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1192 transition count 2669
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1177 transition count 2654
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1177 transition count 2654
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1162 transition count 2639
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1162 transition count 2639
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 102 place count 1150 transition count 2567
Iterating global reduction 0 with 12 rules applied. Total rules applied 114 place count 1150 transition count 2567
Applied a total of 114 rules in 246 ms. Remains 1150 /1207 variables (removed 57) and now considering 2567/2684 (removed 117) transitions.
[2021-05-18 09:29:34] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1150 cols
[2021-05-18 09:29:34] [INFO ] Computed 47 place invariants in 18 ms
[2021-05-18 09:29:34] [INFO ] Implicit Places using invariants in 879 ms returned []
[2021-05-18 09:29:34] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1150 cols
[2021-05-18 09:29:34] [INFO ] Computed 47 place invariants in 17 ms
[2021-05-18 09:29:35] [INFO ] State equation strengthened by 855 read => feed constraints.
[2021-05-18 09:29:50] [INFO ] Implicit Places using invariants and state equation in 16025 ms returned []
Implicit Place search using SMT with State Equation took 16914 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1150/1271 places, 2567/2841 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 2}], [{ cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 5}, { cond=p0, acceptance={1} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s457 1) (GEQ s458 1) (GEQ s606 1)) (AND (GEQ s16 1) (GEQ s1113 1))), p1:(OR (LT s507 1) (LT s1131 1)), p2:(AND (GEQ s291 1) (GEQ s718 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-07 finished in 21990 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1247 transition count 2772
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1247 transition count 2772
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 1232 transition count 2722
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 1232 transition count 2722
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 1225 transition count 2680
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 1225 transition count 2680
Applied a total of 92 rules in 156 ms. Remains 1225 /1271 variables (removed 46) and now considering 2680/2841 (removed 161) transitions.
[2021-05-18 09:29:51] [INFO ] Flow matrix only has 2408 transitions (discarded 272 similar events)
// Phase 1: matrix 2408 rows 1225 cols
[2021-05-18 09:29:51] [INFO ] Computed 64 place invariants in 19 ms
[2021-05-18 09:29:52] [INFO ] Implicit Places using invariants in 1007 ms returned [289, 311, 440, 441, 464, 502, 503, 544, 558, 594, 601, 611, 640, 651, 660, 661, 752, 926]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 18 implicit places.
[2021-05-18 09:29:52] [INFO ] Flow matrix only has 2408 transitions (discarded 272 similar events)
// Phase 1: matrix 2408 rows 1207 cols
[2021-05-18 09:29:52] [INFO ] Computed 46 place invariants in 17 ms
[2021-05-18 09:29:53] [INFO ] Dead Transitions using invariants and state equation in 1128 ms returned []
Starting structural reductions, iteration 1 : 1207/1271 places, 2680/2841 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1193 transition count 2666
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1193 transition count 2666
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1179 transition count 2652
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1179 transition count 2652
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1165 transition count 2638
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1165 transition count 2638
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 95 place count 1154 transition count 2572
Iterating global reduction 0 with 11 rules applied. Total rules applied 106 place count 1154 transition count 2572
Applied a total of 106 rules in 148 ms. Remains 1154 /1207 variables (removed 53) and now considering 2572/2680 (removed 108) transitions.
[2021-05-18 09:29:53] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2021-05-18 09:29:53] [INFO ] Computed 46 place invariants in 14 ms
[2021-05-18 09:29:54] [INFO ] Implicit Places using invariants in 870 ms returned []
[2021-05-18 09:29:54] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2021-05-18 09:29:54] [INFO ] Computed 46 place invariants in 24 ms
[2021-05-18 09:29:55] [INFO ] State equation strengthened by 855 read => feed constraints.
[2021-05-18 09:30:09] [INFO ] Implicit Places using invariants and state equation in 15298 ms returned []
Implicit Place search using SMT with State Equation took 16177 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1154/1271 places, 2572/2841 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s470 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 491 steps with 7 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-08 finished in 18728 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1246 transition count 2771
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1246 transition count 2771
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 66 place count 1230 transition count 2720
Iterating global reduction 0 with 16 rules applied. Total rules applied 82 place count 1230 transition count 2720
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1222 transition count 2672
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1222 transition count 2672
Applied a total of 98 rules in 119 ms. Remains 1222 /1271 variables (removed 49) and now considering 2672/2841 (removed 169) transitions.
[2021-05-18 09:30:10] [INFO ] Flow matrix only has 2400 transitions (discarded 272 similar events)
// Phase 1: matrix 2400 rows 1222 cols
[2021-05-18 09:30:10] [INFO ] Computed 64 place invariants in 27 ms
[2021-05-18 09:30:11] [INFO ] Implicit Places using invariants in 1031 ms returned [289, 311, 440, 441, 464, 472, 499, 500, 541, 555, 591, 598, 608, 637, 648, 657, 658, 749, 923]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1038 ms to find 19 implicit places.
[2021-05-18 09:30:11] [INFO ] Flow matrix only has 2400 transitions (discarded 272 similar events)
// Phase 1: matrix 2400 rows 1203 cols
[2021-05-18 09:30:11] [INFO ] Computed 45 place invariants in 16 ms
[2021-05-18 09:30:12] [INFO ] Dead Transitions using invariants and state equation in 1125 ms returned []
Starting structural reductions, iteration 1 : 1203/1271 places, 2672/2841 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1188 transition count 2657
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1188 transition count 2657
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1173 transition count 2642
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1173 transition count 2642
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1158 transition count 2627
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1158 transition count 2627
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 102 place count 1146 transition count 2555
Iterating global reduction 0 with 12 rules applied. Total rules applied 114 place count 1146 transition count 2555
Applied a total of 114 rules in 156 ms. Remains 1146 /1203 variables (removed 57) and now considering 2555/2672 (removed 117) transitions.
[2021-05-18 09:30:12] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1146 cols
[2021-05-18 09:30:12] [INFO ] Computed 45 place invariants in 16 ms
[2021-05-18 09:30:13] [INFO ] Implicit Places using invariants in 897 ms returned []
[2021-05-18 09:30:13] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1146 cols
[2021-05-18 09:30:13] [INFO ] Computed 45 place invariants in 16 ms
[2021-05-18 09:30:13] [INFO ] State equation strengthened by 845 read => feed constraints.
[2021-05-18 09:30:26] [INFO ] Implicit Places using invariants and state equation in 13530 ms returned []
Implicit Place search using SMT with State Equation took 14428 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1146/1271 places, 2555/2841 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, (NOT p0), true, true, true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-11 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s340 1) (LT s606 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-11 finished in 17001 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1247 transition count 2777
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1247 transition count 2777
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1231 transition count 2726
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1231 transition count 2726
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 1223 transition count 2678
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 1223 transition count 2678
Applied a total of 96 rules in 135 ms. Remains 1223 /1271 variables (removed 48) and now considering 2678/2841 (removed 163) transitions.
[2021-05-18 09:30:27] [INFO ] Flow matrix only has 2406 transitions (discarded 272 similar events)
// Phase 1: matrix 2406 rows 1223 cols
[2021-05-18 09:30:27] [INFO ] Computed 64 place invariants in 20 ms
[2021-05-18 09:30:28] [INFO ] Implicit Places using invariants in 1000 ms returned [289, 311, 440, 441, 464, 472, 499, 500, 541, 555, 591, 598, 608, 637, 648, 657, 658, 749, 923]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 19 implicit places.
[2021-05-18 09:30:28] [INFO ] Flow matrix only has 2406 transitions (discarded 272 similar events)
// Phase 1: matrix 2406 rows 1204 cols
[2021-05-18 09:30:28] [INFO ] Computed 45 place invariants in 15 ms
[2021-05-18 09:30:29] [INFO ] Dead Transitions using invariants and state equation in 1115 ms returned []
Starting structural reductions, iteration 1 : 1204/1271 places, 2678/2841 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1189 transition count 2663
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1189 transition count 2663
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1174 transition count 2648
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1174 transition count 2648
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1159 transition count 2633
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1159 transition count 2633
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 102 place count 1147 transition count 2561
Iterating global reduction 0 with 12 rules applied. Total rules applied 114 place count 1147 transition count 2561
Applied a total of 114 rules in 152 ms. Remains 1147 /1204 variables (removed 57) and now considering 2561/2678 (removed 117) transitions.
[2021-05-18 09:30:29] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2021-05-18 09:30:29] [INFO ] Computed 45 place invariants in 16 ms
[2021-05-18 09:30:30] [INFO ] Implicit Places using invariants in 892 ms returned []
[2021-05-18 09:30:30] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2021-05-18 09:30:30] [INFO ] Computed 45 place invariants in 24 ms
[2021-05-18 09:30:30] [INFO ] State equation strengthened by 850 read => feed constraints.
[2021-05-18 09:30:47] [INFO ] Implicit Places using invariants and state equation in 17185 ms returned []
Implicit Place search using SMT with State Equation took 18077 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1147/1271 places, 2561/2841 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s872 1) (LT s1104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 746 steps with 11 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-13 finished in 20563 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1271 transition count 2819
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1249 transition count 2819
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 44 place count 1249 transition count 2801
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 80 place count 1231 transition count 2801
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 94 place count 1217 transition count 2742
Iterating global reduction 2 with 14 rules applied. Total rules applied 108 place count 1217 transition count 2742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 108 place count 1217 transition count 2741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 1216 transition count 2741
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 1211 transition count 2716
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 1211 transition count 2716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 1210 transition count 2710
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 1210 transition count 2710
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 184 place count 1179 transition count 2679
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 1172 transition count 2672
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 1172 transition count 2672
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 204 place count 1166 transition count 2636
Iterating global reduction 2 with 6 rules applied. Total rules applied 210 place count 1166 transition count 2636
Applied a total of 210 rules in 358 ms. Remains 1166 /1271 variables (removed 105) and now considering 2636/2841 (removed 205) transitions.
[2021-05-18 09:30:47] [INFO ] Flow matrix only has 2364 transitions (discarded 272 similar events)
// Phase 1: matrix 2364 rows 1166 cols
[2021-05-18 09:30:47] [INFO ] Computed 64 place invariants in 21 ms
[2021-05-18 09:30:48] [INFO ] Implicit Places using invariants in 981 ms returned [262, 284, 438, 446, 471, 513, 527, 560, 579, 605, 615, 623, 624, 711, 881]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 983 ms to find 15 implicit places.
[2021-05-18 09:30:48] [INFO ] Redundant transitions in 66 ms returned []
[2021-05-18 09:30:48] [INFO ] Flow matrix only has 2364 transitions (discarded 272 similar events)
// Phase 1: matrix 2364 rows 1151 cols
[2021-05-18 09:30:48] [INFO ] Computed 49 place invariants in 18 ms
[2021-05-18 09:30:49] [INFO ] Dead Transitions using invariants and state equation in 1095 ms returned []
Starting structural reductions, iteration 1 : 1151/1271 places, 2636/2841 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1147 transition count 2632
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1147 transition count 2632
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1143 transition count 2628
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1143 transition count 2628
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1139 transition count 2604
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1139 transition count 2604
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 38 place count 1132 transition count 2597
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 1125 transition count 2590
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 1125 transition count 2590
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1120 transition count 2560
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1120 transition count 2560
Applied a total of 62 rules in 272 ms. Remains 1120 /1151 variables (removed 31) and now considering 2560/2636 (removed 76) transitions.
[2021-05-18 09:30:50] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2021-05-18 09:30:50] [INFO ] Computed 49 place invariants in 18 ms
[2021-05-18 09:30:51] [INFO ] Implicit Places using invariants in 889 ms returned []
[2021-05-18 09:30:51] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1120 cols
[2021-05-18 09:30:51] [INFO ] Computed 49 place invariants in 17 ms
[2021-05-18 09:30:51] [INFO ] State equation strengthened by 880 read => feed constraints.
[2021-05-18 09:30:52] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1120/1271 places, 2560/2841 transitions.
Stuttering acceptance computed with spot in 2030 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s411 1) (GEQ s454 1) (OR (GEQ s553 1) (AND (GEQ s467 1) (GEQ s494 1)))) (AND (OR (LT s426 1) (LT s452 1)) (OR (LT s400 1) (LT s1030 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2273 reset in 693 ms.
Product exploration explored 100000 steps with 2273 reset in 667 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2272 reset in 557 ms.
Product exploration explored 100000 steps with 2274 reset in 585 ms.
[2021-05-18 09:30:56] [INFO ] Flatten gal took : 63 ms
[2021-05-18 09:30:56] [INFO ] Flatten gal took : 65 ms
[2021-05-18 09:30:56] [INFO ] Time to serialize gal into /tmp/LTL2933321802145874585.gal : 8 ms
[2021-05-18 09:30:56] [INFO ] Time to serialize properties into /tmp/LTL11302892827985129418.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2933321802145874585.gal, -t, CGAL, -LTL, /tmp/LTL11302892827985129418.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2933321802145874585.gal -t CGAL -LTL /tmp/LTL11302892827985129418.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((((Node4HasAskedItsLeafSetToLx5ToReplaceNode2>=1)&&(LeafSetOfLx5IsSentToNode4>=1))&&((Node8HasTheLeafSetOfLx0ToReplaceNode1>=1)||((Node5HasAskedItsLeafSetToLx3ToReplaceNode2>=1)&&(LeafSetOfLx3IsSentToNode5>=1))))||(((Node4HasAskedItsLeafSetToLx4ToReplaceNode7<1)||(LeafSetOfLx4IsSentToNode4<1))&&((Node4NotifyThatHeIsActive<1)||(Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9<1))))"))))
Formula 0 simplified : !FG"((((Node4HasAskedItsLeafSetToLx5ToReplaceNode2>=1)&&(LeafSetOfLx5IsSentToNode4>=1))&&((Node8HasTheLeafSetOfLx0ToReplaceNode1>=1)||((Node5HasAskedItsLeafSetToLx3ToReplaceNode2>=1)&&(LeafSetOfLx3IsSentToNode5>=1))))||(((Node4HasAskedItsLeafSetToLx4ToReplaceNode7<1)||(LeafSetOfLx4IsSentToNode4<1))&&((Node4NotifyThatHeIsActive<1)||(Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9<1))))"
Detected timeout of ITS tools.
[2021-05-18 09:31:12] [INFO ] Flatten gal took : 64 ms
[2021-05-18 09:31:12] [INFO ] Applying decomposition
[2021-05-18 09:31:12] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14253039364108428976.txt, -o, /tmp/graph14253039364108428976.bin, -w, /tmp/graph14253039364108428976.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14253039364108428976.bin, -l, -1, -v, -w, /tmp/graph14253039364108428976.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:31:12] [INFO ] Decomposing Gal with order
[2021-05-18 09:31:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:31:12] [INFO ] Removed a total of 2343 redundant transitions.
[2021-05-18 09:31:12] [INFO ] Flatten gal took : 297 ms
[2021-05-18 09:31:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1348 labels/synchronizations in 71 ms.
[2021-05-18 09:31:12] [INFO ] Time to serialize gal into /tmp/LTL4616730751988867500.gal : 18 ms
[2021-05-18 09:31:12] [INFO ] Time to serialize properties into /tmp/LTL5549667588732339905.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4616730751988867500.gal, -t, CGAL, -LTL, /tmp/LTL5549667588732339905.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4616730751988867500.gal -t CGAL -LTL /tmp/LTL5549667588732339905.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i16.i0.i5.u68.Node4HasAskedItsLeafSetToLx5ToReplaceNode2>=1)&&(i16.i0.i5.u68.LeafSetOfLx5IsSentToNode4>=1))&&((i16.i0.i3.u169.Node8HasTheLeafSetOfLx0ToReplaceNode1>=1)||((i16.i0.i2.u76.Node5HasAskedItsLeafSetToLx3ToReplaceNode2>=1)&&(i16.i0.i2.u76.LeafSetOfLx3IsSentToNode5>=1))))||(((i16.i0.i4.u67.Node4HasAskedItsLeafSetToLx4ToReplaceNode7<1)||(i16.i0.i4.u67.LeafSetOfLx4IsSentToNode4<1))&&((i12.u57.Node4NotifyThatHeIsActive<1)||(u148.Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9<1))))"))))
Formula 0 simplified : !FG"((((i16.i0.i5.u68.Node4HasAskedItsLeafSetToLx5ToReplaceNode2>=1)&&(i16.i0.i5.u68.LeafSetOfLx5IsSentToNode4>=1))&&((i16.i0.i3.u169.Node8HasTheLeafSetOfLx0ToReplaceNode1>=1)||((i16.i0.i2.u76.Node5HasAskedItsLeafSetToLx3ToReplaceNode2>=1)&&(i16.i0.i2.u76.LeafSetOfLx3IsSentToNode5>=1))))||(((i16.i0.i4.u67.Node4HasAskedItsLeafSetToLx4ToReplaceNode7<1)||(i16.i0.i4.u67.LeafSetOfLx4IsSentToNode4<1))&&((i12.u57.Node4NotifyThatHeIsActive<1)||(u148.Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9<1))))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1310922746212900932
[2021-05-18 09:31:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1310922746212900932
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1310922746212900932]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1310922746212900932] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1310922746212900932] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-14 finished in 41295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1271/1271 places, 2841/2841 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1271 transition count 2818
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1248 transition count 2818
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 46 place count 1248 transition count 2797
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 88 place count 1227 transition count 2797
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 104 place count 1211 transition count 2741
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 1211 transition count 2741
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 1211 transition count 2740
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 1210 transition count 2740
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 1202 transition count 2697
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 1202 transition count 2697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 1201 transition count 2691
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 1201 transition count 2691
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 202 place count 1170 transition count 2660
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 210 place count 1162 transition count 2652
Iterating global reduction 2 with 8 rules applied. Total rules applied 218 place count 1162 transition count 2652
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 1155 transition count 2610
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 1155 transition count 2610
Applied a total of 232 rules in 328 ms. Remains 1155 /1271 variables (removed 116) and now considering 2610/2841 (removed 231) transitions.
[2021-05-18 09:31:29] [INFO ] Flow matrix only has 2338 transitions (discarded 272 similar events)
// Phase 1: matrix 2338 rows 1155 cols
[2021-05-18 09:31:29] [INFO ] Computed 64 place invariants in 21 ms
[2021-05-18 09:31:30] [INFO ] Implicit Places using invariants in 1687 ms returned [262, 284, 410, 411, 434, 442, 465, 466, 504, 519, 552, 558, 568, 594, 604, 612, 613, 700, 870]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1698 ms to find 19 implicit places.
[2021-05-18 09:31:30] [INFO ] Redundant transitions in 64 ms returned []
[2021-05-18 09:31:30] [INFO ] Flow matrix only has 2338 transitions (discarded 272 similar events)
// Phase 1: matrix 2338 rows 1136 cols
[2021-05-18 09:31:30] [INFO ] Computed 45 place invariants in 20 ms
[2021-05-18 09:31:32] [INFO ] Dead Transitions using invariants and state equation in 1827 ms returned []
Starting structural reductions, iteration 1 : 1136/1271 places, 2610/2841 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1128 transition count 2602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1128 transition count 2602
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1120 transition count 2594
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1120 transition count 2594
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1116 transition count 2570
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1116 transition count 2570
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 54 place count 1109 transition count 2563
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 1102 transition count 2556
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 1102 transition count 2556
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1094 transition count 2508
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1094 transition count 2508
Applied a total of 84 rules in 283 ms. Remains 1094 /1136 variables (removed 42) and now considering 2508/2610 (removed 102) transitions.
[2021-05-18 09:31:32] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2021-05-18 09:31:32] [INFO ] Computed 45 place invariants in 22 ms
[2021-05-18 09:31:33] [INFO ] Implicit Places using invariants in 980 ms returned []
[2021-05-18 09:31:33] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2021-05-18 09:31:33] [INFO ] Computed 45 place invariants in 24 ms
[2021-05-18 09:31:34] [INFO ] State equation strengthened by 850 read => feed constraints.
[2021-05-18 09:31:34] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1094/1271 places, 2508/2841 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s486 1) (GEQ s1064 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-15 finished in 6143 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9128332205359572836
[2021-05-18 09:31:34] [INFO ] Too many transitions (2841) to apply POR reductions. Disabling POR matrices.
[2021-05-18 09:31:34] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9128332205359572836
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9128332205359572836]
[2021-05-18 09:31:35] [INFO ] Applying decomposition
[2021-05-18 09:31:35] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13630311472842813859.txt, -o, /tmp/graph13630311472842813859.bin, -w, /tmp/graph13630311472842813859.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13630311472842813859.bin, -l, -1, -v, -w, /tmp/graph13630311472842813859.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:31:35] [INFO ] Decomposing Gal with order
[2021-05-18 09:31:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:31:35] [INFO ] Removed a total of 3389 redundant transitions.
[2021-05-18 09:31:35] [INFO ] Flatten gal took : 245 ms
[2021-05-18 09:31:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1778 labels/synchronizations in 201 ms.
[2021-05-18 09:31:36] [INFO ] Time to serialize gal into /tmp/LTLFireability17590519289779290955.gal : 99 ms
[2021-05-18 09:31:36] [INFO ] Time to serialize properties into /tmp/LTLFireability10264687306253507280.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability17590519289779290955.gal, -t, CGAL, -LTL, /tmp/LTLFireability10264687306253507280.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability17590519289779290955.gal -t CGAL -LTL /tmp/LTLFireability10264687306253507280.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F("(((i0.u41.Node1AsksIsThereANodeMaster<1)||(i0.u131.Node12IsActive<1))||(i0.u12.Node12IsTheNodeMaster<1))"))))
Formula 0 simplified : !GF"(((i0.u41.Node1AsksIsThereANodeMaster<1)||(i0.u131.Node12IsActive<1))||(i0.u12.Node12IsTheNodeMaster<1))"
Compilation finished in 26990 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9128332205359572836]
Link finished in 57 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((X(([]((LTLAPp2==true)) U ((LTLAPp3==true)&&[]((LTLAPp2==true)))))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((X(([]((LTLAPp2==true)) U ((LTLAPp3==true)&&[]((LTLAPp2==true)))))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
Detected timeout of ITS tools.
[2021-05-18 09:54:21] [INFO ] Flatten gal took : 5337 ms
[2021-05-18 09:54:21] [INFO ] Time to serialize gal into /tmp/LTLFireability16601171430596745312.gal : 40 ms
[2021-05-18 09:54:21] [INFO ] Time to serialize properties into /tmp/LTLFireability4566331970063447406.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16601171430596745312.gal, -t, CGAL, -LTL, /tmp/LTLFireability4566331970063447406.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16601171430596745312.gal -t CGAL -LTL /tmp/LTLFireability4566331970063447406.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(F("(((Node1AsksIsThereANodeMaster<1)||(Node12IsActive<1))||(Node12IsTheNodeMaster<1))"))))
Formula 0 simplified : !GF"(((Node1AsksIsThereANodeMaster<1)||(Node12IsActive<1))||(Node12IsTheNodeMaster<1))"
LTSmin run took 1162172 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((X(([]((LTLAPp2==true)) U ((LTLAPp3==true)&&[]((LTLAPp2==true)))))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
LTSmin run took 618898 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9128332205359572836]
Detected timeout of ITS tools.
[2021-05-18 10:17:00] [INFO ] Flatten gal took : 333 ms
[2021-05-18 10:17:01] [INFO ] Input system was already deterministic with 2841 transitions.
[2021-05-18 10:17:01] [INFO ] Transformed 1271 places.
[2021-05-18 10:17:01] [INFO ] Transformed 2841 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 10:17:32] [INFO ] Time to serialize gal into /tmp/LTLFireability14037812707546346204.gal : 25 ms
[2021-05-18 10:17:32] [INFO ] Time to serialize properties into /tmp/LTLFireability2830343265536593196.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability14037812707546346204.gal, -t, CGAL, -LTL, /tmp/LTLFireability2830343265536593196.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability14037812707546346204.gal -t CGAL -LTL /tmp/LTLFireability2830343265536593196.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(!("((((((Node5HasAskedItsLeafSetToLx3ToReplaceNode2<1)||(LeafSetOfLx3IsSentToNode5<1))&&(Node8HasTheLeafSetOfLx0ToReplaceNode1<1))||(Node4HasAskedItsLeafSetToLx5ToReplaceNode2<1))||(LeafSetOfLx5IsSentToNode4<1))&&(((Node4HasAskedItsLeafSetToLx4ToReplaceNode7>=1)&&(LeafSetOfLx4IsSentToNode4>=1))||((Node4NotifyThatHeIsActive>=1)&&(Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9>=1))))")))))
Formula 0 simplified : !FG!"((((((Node5HasAskedItsLeafSetToLx3ToReplaceNode2<1)||(LeafSetOfLx3IsSentToNode5<1))&&(Node8HasTheLeafSetOfLx0ToReplaceNode1<1))||(Node4HasAskedItsLeafSetToLx5ToReplaceNode2<1))||(LeafSetOfLx5IsSentToNode4<1))&&(((Node4HasAskedItsLeafSetToLx4ToReplaceNode7>=1)&&(LeafSetOfLx4IsSentToNode4>=1))||((Node4NotifyThatHeIsActive>=1)&&(Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9>=1))))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156700605"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;