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-162124156700621.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-S16C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700621
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 53K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 197K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 39K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 12 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 12 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:59 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:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 11 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:55 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 13M 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-S16C08-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-15

=== Now, execution of the tool begins

BK_START 1621337052673

Running Version 0
[2021-05-18 11:24:14] [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 11:24:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:24:14] [INFO ] Load time of PNML (sax parser for PT used): 546 ms
[2021-05-18 11:24:14] [INFO ] Transformed 6876 places.
[2021-05-18 11:24:14] [INFO ] Transformed 9571 transitions.
[2021-05-18 11:24:14] [INFO ] Parsed PT model containing 6876 places and 9571 transitions in 649 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 11:24:14] [INFO ] Initial state test concluded for 2 properties.
Support contains 62 out of 6876 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 6840 transition count 9571
Discarding 2155 places :
Symmetric choice reduction at 1 with 2155 rule applications. Total rules 2191 place count 4685 transition count 7416
Iterating global reduction 1 with 2155 rules applied. Total rules applied 4346 place count 4685 transition count 7416
Discarding 1891 places :
Symmetric choice reduction at 1 with 1891 rule applications. Total rules 6237 place count 2794 transition count 5525
Iterating global reduction 1 with 1891 rules applied. Total rules applied 8128 place count 2794 transition count 5525
Discarding 218 places :
Symmetric choice reduction at 1 with 218 rule applications. Total rules 8346 place count 2576 transition count 3781
Iterating global reduction 1 with 218 rules applied. Total rules applied 8564 place count 2576 transition count 3781
Applied a total of 8564 rules in 1397 ms. Remains 2576 /6876 variables (removed 4300) and now considering 3781/9571 (removed 5790) transitions.
[2021-05-18 11:24:16] [INFO ] Flow matrix only has 3509 transitions (discarded 272 similar events)
// Phase 1: matrix 3509 rows 2576 cols
[2021-05-18 11:24:16] [INFO ] Computed 613 place invariants in 297 ms
[2021-05-18 11:24:19] [INFO ] Implicit Places using invariants in 3348 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 28, 33, 40, 49, 60, 73, 91, 107, 123, 127, 129, 131, 133, 135, 137, 139, 154, 165, 174, 181, 186, 189, 224, 231, 234, 235, 236, 237, 238, 239, 240, 241, 242, 245, 250, 257, 266, 277, 290, 304, 318, 319, 321, 322, 323, 324, 325, 326, 337, 346, 355, 360, 363, 365, 400, 407, 410, 411, 412, 413, 414, 415, 416, 417, 418, 420, 423, 428, 435, 444, 455, 467, 479, 480, 481, 482, 483, 484, 485, 486, 487, 496, 503, 508, 511, 513, 515, 550, 557, 560, 561, 562, 563, 564, 566, 567, 568, 573, 575, 578, 583, 592, 601, 611, 621, 622, 623, 625, 626, 627, 628, 629, 636, 641, 646, 648, 650, 652, 687, 694, 697, 698, 699, 700, 702, 703, 704, 705, 707, 711, 713, 716, 721, 728, 736, 744, 745, 746, 747, 748, 749, 750, 751, 752, 757, 760, 762, 764, 766, 768, 803, 810, 813, 814, 815, 816, 817, 818, 819, 820, 821, 823, 825, 827, 829, 832, 837, 843, 849, 850, 852, 853, 854, 855, 856, 857, 860, 862, 864, 866, 868, 872, 907, 914, 917, 918, 919, 920, 921, 922, 923, 924, 925, 927, 929, 931, 933, 939, 943, 947, 948, 949, 950, 951, 952, 953, 954, 955, 957, 959, 961, 963, 965, 967, 1002, 1009, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1022, 1024, 1026, 1028, 1030, 1032, 1034, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1047, 1049, 1051, 1053, 1055, 1058, 1095, 1099, 1102, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1112, 1114, 1118, 1120, 1122, 1124, 1126, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1139, 1141, 1143, 1145, 1147, 1149, 1184, 1191, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1204, 1206, 1208, 1210, 1212, 1214, 1216, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1274, 1281, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1294, 1296, 1298, 1300, 1302, 1304, 1307, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1323, 1325, 1327, 1329, 1331, 1333, 1368, 1375, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1388, 1390, 1392, 1394, 1396, 1399, 1404, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1424, 1427, 1429, 1431, 1433, 1435, 1470, 1477, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1490, 1492, 1494, 1497, 1500, 1505, 1512, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1536, 1541, 1544, 1546, 1548, 1550, 1586, 1593, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1604, 1609, 1611, 1613, 1616, 1621, 1628, 1637, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1655, 1656, 1665, 1672, 1677, 1680, 1682, 1684, 1719, 1726, 1729, 1730, 1731, 1732, 1734, 1736, 1737, 1742, 1747, 1751, 1756, 1763, 1772, 1783, 1796, 1797, 1798, 1800, 1801, 1802, 1803, 1804, 1815, 1826, 1833, 1838, 1841, 1843, 1878, 1885, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1898, 1901, 1906, 1913, 1922, 1933, 1946, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1982, 1993, 2002, 2009, 2014, 2017, 2052, 2054, 2058, 2061, 2062, 2063, 2064, 2065, 2066, 2067, 2068, 2069, 2072, 2077, 2085, 2094, 2105, 2119, 2134, 2151, 2152, 2153, 2154, 2155, 2156, 2157, 2158, 2159, 2174, 2187, 2198, 2207, 2214, 2219, 2255]
Discarding 550 places :
Implicit Place search using SMT only with invariants took 3384 ms to find 550 implicit places.
[2021-05-18 11:24:19] [INFO ] Flow matrix only has 3509 transitions (discarded 272 similar events)
// Phase 1: matrix 3509 rows 2026 cols
[2021-05-18 11:24:20] [INFO ] Computed 63 place invariants in 77 ms
[2021-05-18 11:24:21] [INFO ] Dead Transitions using invariants and state equation in 1989 ms returned []
Starting structural reductions, iteration 1 : 2026/6876 places, 3781/9571 transitions.
Discarding 244 places :
Symmetric choice reduction at 0 with 244 rule applications. Total rules 244 place count 1782 transition count 3537
Iterating global reduction 0 with 244 rules applied. Total rules applied 488 place count 1782 transition count 3537
Discarding 244 places :
Symmetric choice reduction at 0 with 244 rule applications. Total rules 732 place count 1538 transition count 3293
Iterating global reduction 0 with 244 rules applied. Total rules applied 976 place count 1538 transition count 3293
Discarding 244 places :
Symmetric choice reduction at 0 with 244 rule applications. Total rules 1220 place count 1294 transition count 3049
Iterating global reduction 0 with 244 rules applied. Total rules applied 1464 place count 1294 transition count 3049
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 1485 place count 1273 transition count 2881
Iterating global reduction 0 with 21 rules applied. Total rules applied 1506 place count 1273 transition count 2881
Applied a total of 1506 rules in 283 ms. Remains 1273 /2026 variables (removed 753) and now considering 2881/3781 (removed 900) transitions.
[2021-05-18 11:24:22] [INFO ] Flow matrix only has 2609 transitions (discarded 272 similar events)
// Phase 1: matrix 2609 rows 1273 cols
[2021-05-18 11:24:22] [INFO ] Computed 63 place invariants in 34 ms
[2021-05-18 11:24:23] [INFO ] Implicit Places using invariants in 967 ms returned []
[2021-05-18 11:24:23] [INFO ] Flow matrix only has 2609 transitions (discarded 272 similar events)
// Phase 1: matrix 2609 rows 1273 cols
[2021-05-18 11:24:23] [INFO ] Computed 63 place invariants in 29 ms
[2021-05-18 11:24:24] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2021-05-18 11:24:47] [INFO ] Implicit Places using invariants and state equation in 24026 ms returned []
Implicit Place search using SMT with State Equation took 24995 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1273/6876 places, 2881/9571 transitions.
[2021-05-18 11:24:47] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-18 11:24:47] [INFO ] Flatten gal took : 222 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C08-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 11:24:47] [INFO ] Flatten gal took : 143 ms
[2021-05-18 11:24:48] [INFO ] Input system was already deterministic with 2881 transitions.
Incomplete random walk after 100000 steps, including 1207 resets, run finished after 940 ms. (steps per millisecond=106 ) properties (out of 27) seen :14
Running SMT prover for 13 properties.
[2021-05-18 11:24:49] [INFO ] Flow matrix only has 2609 transitions (discarded 272 similar events)
// Phase 1: matrix 2609 rows 1273 cols
[2021-05-18 11:24:49] [INFO ] Computed 63 place invariants in 30 ms
[2021-05-18 11:24:49] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:24:49] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 24 ms returned sat
[2021-05-18 11:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:24:49] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2021-05-18 11:24:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:24:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2021-05-18 11:24:50] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 22 ms returned sat
[2021-05-18 11:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:24:51] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2021-05-18 11:24:51] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2021-05-18 11:24:52] [INFO ] [Nat]Added 1066 Read/Feed constraints in 1804 ms returned sat
[2021-05-18 11:24:53] [INFO ] Deduced a trap composed of 356 places in 601 ms of which 5 ms to minimize.
[2021-05-18 11:24:55] [INFO ] Deduced a trap composed of 338 places in 713 ms of which 1 ms to minimize.
[2021-05-18 11:24:56] [INFO ] Deduced a trap composed of 110 places in 617 ms of which 1 ms to minimize.
[2021-05-18 11:24:58] [INFO ] Deduced a trap composed of 422 places in 559 ms of which 2 ms to minimize.
[2021-05-18 11:24:59] [INFO ] Deduced a trap composed of 360 places in 628 ms of which 1 ms to minimize.
[2021-05-18 11:25:00] [INFO ] Deduced a trap composed of 398 places in 568 ms of which 1 ms to minimize.
[2021-05-18 11:25:01] [INFO ] Deduced a trap composed of 354 places in 564 ms of which 1 ms to minimize.
[2021-05-18 11:25:04] [INFO ] Deduced a trap composed of 387 places in 531 ms of which 2 ms to minimize.
[2021-05-18 11:25:05] [INFO ] Deduced a trap composed of 354 places in 557 ms of which 1 ms to minimize.
[2021-05-18 11:25:05] [INFO ] Deduced a trap composed of 312 places in 573 ms of which 1 ms to minimize.
[2021-05-18 11:25:06] [INFO ] Deduced a trap composed of 390 places in 528 ms of which 1 ms to minimize.
[2021-05-18 11:25:07] [INFO ] Deduced a trap composed of 345 places in 545 ms of which 1 ms to minimize.
[2021-05-18 11:25:07] [INFO ] Deduced a trap composed of 387 places in 540 ms of which 1 ms to minimize.
[2021-05-18 11:25:08] [INFO ] Deduced a trap composed of 381 places in 551 ms of which 1 ms to minimize.
[2021-05-18 11:25:09] [INFO ] Deduced a trap composed of 356 places in 615 ms of which 1 ms to minimize.
[2021-05-18 11:25:10] [INFO ] Deduced a trap composed of 371 places in 620 ms of which 1 ms to minimize.
[2021-05-18 11:25:10] [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 0
[2021-05-18 11:25:10] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned unsat
[2021-05-18 11:25:10] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2021-05-18 11:25:10] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 23 ms returned sat
[2021-05-18 11:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:25:11] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2021-05-18 11:25:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:25:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2021-05-18 11:25:11] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 22 ms returned sat
[2021-05-18 11:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:25:12] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2021-05-18 11:25:14] [INFO ] [Nat]Added 1066 Read/Feed constraints in 1865 ms returned sat
[2021-05-18 11:25:14] [INFO ] Computed and/alt/rep : 2208/4220/2208 causal constraints (skipped 384 transitions) in 137 ms.
[2021-05-18 11:25:21] [INFO ] Added : 277 causal constraints over 56 iterations in 6842 ms. Result :sat
[2021-05-18 11:25:21] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:25:21] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 23 ms returned sat
[2021-05-18 11:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:25:22] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2021-05-18 11:25:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:25:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:25:22] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 21 ms returned sat
[2021-05-18 11:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:25:23] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2021-05-18 11:25:25] [INFO ] [Nat]Added 1066 Read/Feed constraints in 2525 ms returned sat
[2021-05-18 11:25:26] [INFO ] Deduced a trap composed of 301 places in 549 ms of which 1 ms to minimize.
[2021-05-18 11:25:27] [INFO ] Deduced a trap composed of 127 places in 594 ms of which 1 ms to minimize.
[2021-05-18 11:25:28] [INFO ] Deduced a trap composed of 374 places in 590 ms of which 2 ms to minimize.
[2021-05-18 11:25:29] [INFO ] Deduced a trap composed of 150 places in 594 ms of which 1 ms to minimize.
[2021-05-18 11:25:30] [INFO ] Deduced a trap composed of 321 places in 580 ms of which 1 ms to minimize.
[2021-05-18 11:25:31] [INFO ] Deduced a trap composed of 149 places in 616 ms of which 1 ms to minimize.
[2021-05-18 11:25:31] [INFO ] Deduced a trap composed of 476 places in 569 ms of which 1 ms to minimize.
[2021-05-18 11:25:32] [INFO ] Deduced a trap composed of 163 places in 580 ms of which 1 ms to minimize.
[2021-05-18 11:25:33] [INFO ] Deduced a trap composed of 134 places in 580 ms of which 2 ms to minimize.
[2021-05-18 11:25:33] [INFO ] Deduced a trap composed of 165 places in 592 ms of which 1 ms to minimize.
[2021-05-18 11:25:34] [INFO ] Deduced a trap composed of 150 places in 607 ms of which 1 ms to minimize.
[2021-05-18 11:25:35] [INFO ] Deduced a trap composed of 455 places in 565 ms of which 1 ms to minimize.
[2021-05-18 11:25:36] [INFO ] Deduced a trap composed of 145 places in 583 ms of which 1 ms to minimize.
[2021-05-18 11:25:36] [INFO ] Deduced a trap composed of 137 places in 562 ms of which 1 ms to minimize.
[2021-05-18 11:25:37] [INFO ] Deduced a trap composed of 370 places in 557 ms of which 1 ms to minimize.
[2021-05-18 11:25:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 11977 ms
[2021-05-18 11:25:37] [INFO ] Computed and/alt/rep : 2208/4220/2208 causal constraints (skipped 384 transitions) in 114 ms.
[2021-05-18 11:25:43] [INFO ] Deduced a trap composed of 2 places in 658 ms of which 1 ms to minimize.
[2021-05-18 11:25:43] [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 3
[2021-05-18 11:25:43] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 11:25:43] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 8 ms returned unsat
[2021-05-18 11:25:43] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:25:43] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 23 ms returned sat
[2021-05-18 11:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:25:44] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2021-05-18 11:25:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:25:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:25:44] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 21 ms returned sat
[2021-05-18 11:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:25:44] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2021-05-18 11:25:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 11:25:48] [INFO ] [Nat]Added 1066 Read/Feed constraints in 3303 ms returned sat
[2021-05-18 11:25:48] [INFO ] Deduced a trap composed of 319 places in 532 ms of which 1 ms to minimize.
[2021-05-18 11:25:49] [INFO ] Deduced a trap composed of 404 places in 541 ms of which 2 ms to minimize.
[2021-05-18 11:25:50] [INFO ] Deduced a trap composed of 398 places in 558 ms of which 5 ms to minimize.
[2021-05-18 11:25:50] [INFO ] Deduced a trap composed of 318 places in 527 ms of which 1 ms to minimize.
[2021-05-18 11:25:51] [INFO ] Deduced a trap composed of 339 places in 511 ms of which 1 ms to minimize.
[2021-05-18 11:25:52] [INFO ] Deduced a trap composed of 362 places in 505 ms of which 1 ms to minimize.
[2021-05-18 11:25:53] [INFO ] Deduced a trap composed of 420 places in 553 ms of which 1 ms to minimize.
[2021-05-18 11:25:53] [INFO ] Deduced a trap composed of 415 places in 539 ms of which 1 ms to minimize.
[2021-05-18 11:25:54] [INFO ] Deduced a trap composed of 310 places in 522 ms of which 1 ms to minimize.
[2021-05-18 11:25:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6789 ms
[2021-05-18 11:25:55] [INFO ] Computed and/alt/rep : 2208/4220/2208 causal constraints (skipped 384 transitions) in 134 ms.
[2021-05-18 11:26:00] [INFO ] Added : 137 causal constraints over 28 iterations in 5504 ms. Result :sat
[2021-05-18 11:26:00] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-18 11:26:00] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 11:26:00] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 22 ms returned sat
[2021-05-18 11:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:01] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2021-05-18 11:26:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:26:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2021-05-18 11:26:01] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 21 ms returned sat
[2021-05-18 11:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:02] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2021-05-18 11:26:04] [INFO ] [Nat]Added 1066 Read/Feed constraints in 1959 ms returned sat
[2021-05-18 11:26:05] [INFO ] Deduced a trap composed of 188 places in 565 ms of which 1 ms to minimize.
[2021-05-18 11:26:05] [INFO ] Deduced a trap composed of 174 places in 562 ms of which 1 ms to minimize.
[2021-05-18 11:26:06] [INFO ] Deduced a trap composed of 143 places in 597 ms of which 1 ms to minimize.
[2021-05-18 11:26:07] [INFO ] Deduced a trap composed of 175 places in 566 ms of which 1 ms to minimize.
[2021-05-18 11:26:08] [INFO ] Deduced a trap composed of 162 places in 550 ms of which 1 ms to minimize.
[2021-05-18 11:26:09] [INFO ] Deduced a trap composed of 147 places in 559 ms of which 1 ms to minimize.
[2021-05-18 11:26:10] [INFO ] Deduced a trap composed of 145 places in 570 ms of which 1 ms to minimize.
[2021-05-18 11:26:10] [INFO ] Deduced a trap composed of 187 places in 566 ms of which 1 ms to minimize.
[2021-05-18 11:26:11] [INFO ] Deduced a trap composed of 206 places in 561 ms of which 1 ms to minimize.
[2021-05-18 11:26:13] [INFO ] Deduced a trap composed of 178 places in 593 ms of which 2 ms to minimize.
[2021-05-18 11:26:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8718 ms
[2021-05-18 11:26:13] [INFO ] Computed and/alt/rep : 2208/4220/2208 causal constraints (skipped 384 transitions) in 134 ms.
[2021-05-18 11:26:21] [INFO ] Added : 280 causal constraints over 56 iterations in 8406 ms. Result :unknown
[2021-05-18 11:26:21] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:26:21] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 23 ms returned sat
[2021-05-18 11:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:22] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2021-05-18 11:26:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:26:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:26:22] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 21 ms returned sat
[2021-05-18 11:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:23] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2021-05-18 11:26:25] [INFO ] [Nat]Added 1066 Read/Feed constraints in 1703 ms returned sat
[2021-05-18 11:26:25] [INFO ] Deduced a trap composed of 276 places in 524 ms of which 1 ms to minimize.
[2021-05-18 11:26:26] [INFO ] Deduced a trap composed of 267 places in 522 ms of which 2 ms to minimize.
[2021-05-18 11:26:27] [INFO ] Deduced a trap composed of 300 places in 521 ms of which 1 ms to minimize.
[2021-05-18 11:26:28] [INFO ] Deduced a trap composed of 274 places in 509 ms of which 1 ms to minimize.
[2021-05-18 11:26:29] [INFO ] Deduced a trap composed of 152 places in 579 ms of which 2 ms to minimize.
[2021-05-18 11:26:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4292 ms
[2021-05-18 11:26:29] [INFO ] Computed and/alt/rep : 2208/4220/2208 causal constraints (skipped 384 transitions) in 135 ms.
[2021-05-18 11:26:33] [INFO ] Added : 129 causal constraints over 26 iterations in 3824 ms. Result :sat
[2021-05-18 11:26:33] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:26:33] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 24 ms returned sat
[2021-05-18 11:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:34] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2021-05-18 11:26:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:26:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 11:26:34] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 21 ms returned sat
[2021-05-18 11:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:35] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2021-05-18 11:26:37] [INFO ] [Nat]Added 1066 Read/Feed constraints in 2556 ms returned sat
[2021-05-18 11:26:38] [INFO ] Deduced a trap composed of 473 places in 552 ms of which 8 ms to minimize.
[2021-05-18 11:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 695 ms
[2021-05-18 11:26:38] [INFO ] Computed and/alt/rep : 2208/4220/2208 causal constraints (skipped 384 transitions) in 137 ms.
[2021-05-18 11:26:41] [INFO ] Added : 92 causal constraints over 19 iterations in 3001 ms. Result :sat
[2021-05-18 11:26:41] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-18 11:26:41] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 11:26:41] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 23 ms returned sat
[2021-05-18 11:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:42] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2021-05-18 11:26:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:26:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2021-05-18 11:26:43] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 21 ms returned sat
[2021-05-18 11:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:26:43] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2021-05-18 11:26:44] [INFO ] [Nat]Added 1066 Read/Feed constraints in 239 ms returned unsat
[2021-05-18 11:26:44] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2021-05-18 11:26:44] [INFO ] Initial state test concluded for 2 properties.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X((p0 U (p1||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1254 transition count 2820
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1254 transition count 2820
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 1241 transition count 2751
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 1241 transition count 2751
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 1236 transition count 2711
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 1236 transition count 2711
Applied a total of 74 rules in 224 ms. Remains 1236 /1273 variables (removed 37) and now considering 2711/2881 (removed 170) transitions.
[2021-05-18 11:26:44] [INFO ] Flow matrix only has 2439 transitions (discarded 272 similar events)
// Phase 1: matrix 2439 rows 1236 cols
[2021-05-18 11:26:44] [INFO ] Computed 63 place invariants in 39 ms
[2021-05-18 11:26:45] [INFO ] Implicit Places using invariants in 1145 ms returned [17, 104, 264, 396, 437, 467, 537, 561, 601, 608, 767, 834, 835, 880]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1149 ms to find 14 implicit places.
[2021-05-18 11:26:45] [INFO ] Flow matrix only has 2439 transitions (discarded 272 similar events)
// Phase 1: matrix 2439 rows 1222 cols
[2021-05-18 11:26:45] [INFO ] Computed 49 place invariants in 23 ms
[2021-05-18 11:26:46] [INFO ] Dead Transitions using invariants and state equation in 1128 ms returned []
Starting structural reductions, iteration 1 : 1222/1273 places, 2711/2881 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1210 transition count 2699
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1210 transition count 2699
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1198 transition count 2687
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1198 transition count 2687
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1186 transition count 2675
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1186 transition count 2675
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1175 transition count 2587
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1175 transition count 2587
Applied a total of 94 rules in 281 ms. Remains 1175 /1222 variables (removed 47) and now considering 2587/2711 (removed 124) transitions.
[2021-05-18 11:26:47] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1175 cols
[2021-05-18 11:26:47] [INFO ] Computed 49 place invariants in 22 ms
[2021-05-18 11:26:48] [INFO ] Implicit Places using invariants in 923 ms returned []
[2021-05-18 11:26:48] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1175 cols
[2021-05-18 11:26:48] [INFO ] Computed 49 place invariants in 35 ms
[2021-05-18 11:26:48] [INFO ] State equation strengthened by 856 read => feed constraints.
[2021-05-18 11:26:59] [INFO ] Implicit Places using invariants and state equation in 11507 ms returned []
Implicit Place search using SMT with State Equation took 12432 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1175/1273 places, 2587/2881 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s440 1) (LT s965 1)), p1:(AND (OR (LT s568 1) (LT s1155 1)) (OR (LT s440 1) (LT s965 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1167 ms.
Product exploration explored 100000 steps with 50000 reset in 1069 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 1094 ms.
Product exploration explored 100000 steps with 50000 reset in 1098 ms.
[2021-05-18 11:27:04] [INFO ] Flatten gal took : 110 ms
[2021-05-18 11:27:04] [INFO ] Flatten gal took : 108 ms
[2021-05-18 11:27:04] [INFO ] Time to serialize gal into /tmp/LTL3178873885354518643.gal : 47 ms
[2021-05-18 11:27:04] [INFO ] Time to serialize properties into /tmp/LTL6833961407936467189.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/LTL3178873885354518643.gal, -t, CGAL, -LTL, /tmp/LTL6833961407936467189.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/LTL3178873885354518643.gal -t CGAL -LTL /tmp/LTL6833961407936467189.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(("((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))")U(("(((Node7ManageTheCrashOfNode15<1)||(Rx6IsAtTheRightExtremityOfTheLeafSet<1))&&((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1)))")||(G("((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))")))))&&("((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))"))))
Formula 0 simplified : !F("((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))" & X("((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))" U ("(((Node7ManageTheCrashOfNode15<1)||(Rx6IsAtTheRightExtremityOfTheLeafSet<1))&&((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1)))" | G"((Node4NotifyThatHeIsActive<1)||(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))")))
Detected timeout of ITS tools.
[2021-05-18 11:27:20] [INFO ] Flatten gal took : 112 ms
[2021-05-18 11:27:20] [INFO ] Applying decomposition
[2021-05-18 11:27:20] [INFO ] Flatten gal took : 92 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/graph4875963946265039698.txt, -o, /tmp/graph4875963946265039698.bin, -w, /tmp/graph4875963946265039698.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/graph4875963946265039698.bin, -l, -1, -v, -w, /tmp/graph4875963946265039698.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 11:27:28] [INFO ] Decomposing Gal with order
[2021-05-18 11:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:27:29] [INFO ] Removed a total of 1873 redundant transitions.
[2021-05-18 11:27:29] [INFO ] Flatten gal took : 370 ms
[2021-05-18 11:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1071 labels/synchronizations in 133 ms.
[2021-05-18 11:27:29] [INFO ] Time to serialize gal into /tmp/LTL12654502544190702060.gal : 21 ms
[2021-05-18 11:27:29] [INFO ] Time to serialize properties into /tmp/LTL795571483419534859.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/LTL12654502544190702060.gal, -t, CGAL, -LTL, /tmp/LTL795571483419534859.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/LTL12654502544190702060.gal -t CGAL -LTL /tmp/LTL795571483419534859.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((X(("((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))")U(("(((i2.i1.i4.u99.Node7ManageTheCrashOfNode15<1)||(i2.i1.i6.u40.Rx6IsAtTheRightExtremityOfTheLeafSet<1))&&((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1)))")||(G("((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))")))))&&("((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))"))))
Formula 0 simplified : !F("((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))" & X("((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))" U ("(((i2.i1.i4.u99.Node7ManageTheCrashOfNode15<1)||(i2.i1.i6.u40.Rx6IsAtTheRightExtremityOfTheLeafSet<1))&&((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1)))" | G"((i8.u80.Node4NotifyThatHeIsActive<1)||(i13.u152.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15535375012200611346
[2021-05-18 11:27:44] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15535375012200611346
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/ltsmin15535375012200611346]
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/ltsmin15535375012200611346] 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/ltsmin15535375012200611346] 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-S16C08-01 finished in 61280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p0 U (G(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1255 transition count 2821
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1255 transition count 2821
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1243 transition count 2753
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1243 transition count 2753
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1239 transition count 2721
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1239 transition count 2721
Applied a total of 68 rules in 213 ms. Remains 1239 /1273 variables (removed 34) and now considering 2721/2881 (removed 160) transitions.
[2021-05-18 11:27:45] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
// Phase 1: matrix 2449 rows 1239 cols
[2021-05-18 11:27:45] [INFO ] Computed 63 place invariants in 33 ms
[2021-05-18 11:27:46] [INFO ] Implicit Places using invariants in 1096 ms returned [107, 267, 399, 440, 470, 540, 564, 603, 610, 770, 837, 838, 883]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1114 ms to find 13 implicit places.
[2021-05-18 11:27:46] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
// Phase 1: matrix 2449 rows 1226 cols
[2021-05-18 11:27:46] [INFO ] Computed 50 place invariants in 25 ms
[2021-05-18 11:27:48] [INFO ] Dead Transitions using invariants and state equation in 1226 ms returned []
Starting structural reductions, iteration 1 : 1226/1273 places, 2721/2881 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1215 transition count 2710
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1215 transition count 2710
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1204 transition count 2699
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1204 transition count 2699
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1193 transition count 2688
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1193 transition count 2688
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1183 transition count 2608
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1183 transition count 2608
Applied a total of 86 rules in 299 ms. Remains 1183 /1226 variables (removed 43) and now considering 2608/2721 (removed 113) transitions.
[2021-05-18 11:27:48] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1183 cols
[2021-05-18 11:27:48] [INFO ] Computed 50 place invariants in 20 ms
[2021-05-18 11:27:49] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2021-05-18 11:27:49] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1183 cols
[2021-05-18 11:27:49] [INFO ] Computed 50 place invariants in 28 ms
[2021-05-18 11:27:50] [INFO ] State equation strengthened by 870 read => feed constraints.
[2021-05-18 11:28:05] [INFO ] Implicit Places using invariants and state equation in 16123 ms returned []
Implicit Place search using SMT with State Equation took 17130 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1183/1273 places, 2608/2881 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut4513709228260848729.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10610 ms :[false, (NOT p0), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s729 1) (GEQ s1148 1)), p1:(OR (AND (GEQ s246 1) (GEQ s650 1)) (AND (GEQ s729 1) (GEQ s1148 1))), p2:(GEQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-02 finished in 30620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G((F(p1)||p0)))&&(G(p2) U X(G(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1256 transition count 2815
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1256 transition count 2815
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1246 transition count 2763
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1246 transition count 2763
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1242 transition count 2731
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1242 transition count 2731
Applied a total of 62 rules in 243 ms. Remains 1242 /1273 variables (removed 31) and now considering 2731/2881 (removed 150) transitions.
[2021-05-18 11:28:16] [INFO ] Flow matrix only has 2459 transitions (discarded 272 similar events)
// Phase 1: matrix 2459 rows 1242 cols
[2021-05-18 11:28:16] [INFO ] Computed 63 place invariants in 24 ms
[2021-05-18 11:28:17] [INFO ] Implicit Places using invariants in 1087 ms returned [17, 104, 398, 439, 469, 539, 563, 602, 770, 838, 886]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1093 ms to find 11 implicit places.
[2021-05-18 11:28:17] [INFO ] Flow matrix only has 2459 transitions (discarded 272 similar events)
// Phase 1: matrix 2459 rows 1231 cols
[2021-05-18 11:28:17] [INFO ] Computed 52 place invariants in 20 ms
[2021-05-18 11:28:18] [INFO ] Dead Transitions using invariants and state equation in 1373 ms returned []
Starting structural reductions, iteration 1 : 1231/1273 places, 2731/2881 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1222 transition count 2722
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1222 transition count 2722
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1213 transition count 2713
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1213 transition count 2713
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1204 transition count 2704
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1204 transition count 2704
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 1196 transition count 2640
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 1196 transition count 2640
Applied a total of 70 rules in 289 ms. Remains 1196 /1231 variables (removed 35) and now considering 2640/2731 (removed 91) transitions.
[2021-05-18 11:28:19] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1196 cols
[2021-05-18 11:28:19] [INFO ] Computed 52 place invariants in 57 ms
[2021-05-18 11:28:20] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2021-05-18 11:28:20] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1196 cols
[2021-05-18 11:28:20] [INFO ] Computed 52 place invariants in 24 ms
[2021-05-18 11:28:21] [INFO ] State equation strengthened by 891 read => feed constraints.
[2021-05-18 11:28:35] [INFO ] Implicit Places using invariants and state equation in 15361 ms returned []
Implicit Place search using SMT with State Equation took 16405 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1196/1273 places, 2640/2881 transitions.
Stuttering acceptance computed with spot in 4269 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1)), true, (AND (NOT p2) p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-05 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p3), acceptance={} source=7 dest: 6}, { cond=(AND p2 p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s588 1) (GEQ s602 1)), p0:(OR (LT s588 1) (LT s602 1)), p1:(LT s812 1), p3:(OR (LT s287 1) (LT s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17320 steps with 208 reset in 110 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-05 finished in 23809 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1254 transition count 2813
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1254 transition count 2813
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1242 transition count 2752
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1242 transition count 2752
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1237 transition count 2712
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1237 transition count 2712
Applied a total of 72 rules in 245 ms. Remains 1237 /1273 variables (removed 36) and now considering 2712/2881 (removed 169) transitions.
[2021-05-18 11:28:40] [INFO ] Flow matrix only has 2440 transitions (discarded 272 similar events)
// Phase 1: matrix 2440 rows 1237 cols
[2021-05-18 11:28:40] [INFO ] Computed 63 place invariants in 24 ms
[2021-05-18 11:28:41] [INFO ] Implicit Places using invariants in 1088 ms returned [17, 104, 264, 396, 469, 539, 563, 602, 609, 768, 835, 836, 881]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1092 ms to find 13 implicit places.
[2021-05-18 11:28:41] [INFO ] Flow matrix only has 2440 transitions (discarded 272 similar events)
// Phase 1: matrix 2440 rows 1224 cols
[2021-05-18 11:28:41] [INFO ] Computed 50 place invariants in 19 ms
[2021-05-18 11:28:42] [INFO ] Dead Transitions using invariants and state equation in 1203 ms returned []
Starting structural reductions, iteration 1 : 1224/1273 places, 2712/2881 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1213 transition count 2701
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1213 transition count 2701
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1202 transition count 2690
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1202 transition count 2690
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1191 transition count 2679
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1191 transition count 2679
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1181 transition count 2599
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1181 transition count 2599
Applied a total of 86 rules in 276 ms. Remains 1181 /1224 variables (removed 43) and now considering 2599/2712 (removed 113) transitions.
[2021-05-18 11:28:42] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2021-05-18 11:28:42] [INFO ] Computed 50 place invariants in 19 ms
[2021-05-18 11:28:43] [INFO ] Implicit Places using invariants in 967 ms returned []
[2021-05-18 11:28:43] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2021-05-18 11:28:43] [INFO ] Computed 50 place invariants in 19 ms
[2021-05-18 11:28:44] [INFO ] State equation strengthened by 863 read => feed constraints.
[2021-05-18 11:28:57] [INFO ] Implicit Places using invariants and state equation in 13973 ms returned []
Implicit Place search using SMT with State Equation took 14941 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1181/1273 places, 2599/2881 transitions.
Stuttering acceptance computed with spot in 2656 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-06 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s437 1) (LT s443 1)) (OR (LT s650 1) (LT s1020 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1662 steps with 19 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-06 finished in 20441 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1273 transition count 2852
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2852
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 58 place count 1244 transition count 2828
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 106 place count 1220 transition count 2828
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 1206 transition count 2772
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 1206 transition count 2772
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 134 place count 1206 transition count 2768
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 142 place count 1202 transition count 2768
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 150 place count 1194 transition count 2704
Iterating global reduction 2 with 8 rules applied. Total rules applied 158 place count 1194 transition count 2704
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 208 place count 1169 transition count 2679
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 213 place count 1164 transition count 2674
Iterating global reduction 2 with 5 rules applied. Total rules applied 218 place count 1164 transition count 2674
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 223 place count 1159 transition count 2634
Iterating global reduction 2 with 5 rules applied. Total rules applied 228 place count 1159 transition count 2634
Applied a total of 228 rules in 573 ms. Remains 1159 /1273 variables (removed 114) and now considering 2634/2881 (removed 247) transitions.
[2021-05-18 11:29:00] [INFO ] Flow matrix only has 2362 transitions (discarded 272 similar events)
// Phase 1: matrix 2362 rows 1159 cols
[2021-05-18 11:29:01] [INFO ] Computed 63 place invariants in 28 ms
[2021-05-18 11:29:02] [INFO ] Implicit Places using invariants in 1016 ms returned [9, 94, 230, 357, 398, 425, 493, 515, 553, 559, 713, 778, 779, 824]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 14 implicit places.
[2021-05-18 11:29:02] [INFO ] Redundant transitions in 146 ms returned []
[2021-05-18 11:29:02] [INFO ] Flow matrix only has 2362 transitions (discarded 272 similar events)
// Phase 1: matrix 2362 rows 1145 cols
[2021-05-18 11:29:02] [INFO ] Computed 49 place invariants in 21 ms
[2021-05-18 11:29:03] [INFO ] Dead Transitions using invariants and state equation in 1158 ms returned []
Starting structural reductions, iteration 1 : 1145/1273 places, 2634/2881 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1137 transition count 2626
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1137 transition count 2626
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1129 transition count 2618
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1129 transition count 2618
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1122 transition count 2562
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1122 transition count 2562
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1118 transition count 2558
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1114 transition count 2554
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1114 transition count 2554
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1110 transition count 2522
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1110 transition count 2522
Applied a total of 70 rules in 456 ms. Remains 1110 /1145 variables (removed 35) and now considering 2522/2634 (removed 112) transitions.
[2021-05-18 11:29:03] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2021-05-18 11:29:03] [INFO ] Computed 49 place invariants in 21 ms
[2021-05-18 11:29:04] [INFO ] Implicit Places using invariants in 898 ms returned []
[2021-05-18 11:29:04] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2021-05-18 11:29:04] [INFO ] Computed 49 place invariants in 28 ms
[2021-05-18 11:29:05] [INFO ] State equation strengthened by 856 read => feed constraints.
[2021-05-18 11:29:05] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1110/1273 places, 2522/2881 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut590541946811123980.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10193 ms :[false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s642 1) (LT s1070 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 1712 reset in 566 ms.
Product exploration explored 100000 steps with 1713 reset in 577 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1713 reset in 546 ms.
Product exploration explored 100000 steps with 1715 reset in 567 ms.
[2021-05-18 11:29:18] [INFO ] Flatten gal took : 70 ms
[2021-05-18 11:29:18] [INFO ] Flatten gal took : 78 ms
[2021-05-18 11:29:18] [INFO ] Time to serialize gal into /tmp/LTL3651933797208722633.gal : 11 ms
[2021-05-18 11:29:18] [INFO ] Time to serialize properties into /tmp/LTL17814665740406081397.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/LTL3651933797208722633.gal, -t, CGAL, -LTL, /tmp/LTL17814665740406081397.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/LTL3651933797208722633.gal -t CGAL -LTL /tmp/LTL17814665740406081397.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node12ManageTheCrashOfNode4<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"))))
Formula 0 simplified : !FG"((Node12ManageTheCrashOfNode4<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
[2021-05-18 11:29:33] [INFO ] Flatten gal took : 66 ms
[2021-05-18 11:29:33] [INFO ] Applying decomposition
[2021-05-18 11:29:33] [INFO ] Flatten gal took : 67 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/graph5748094041778347391.txt, -o, /tmp/graph5748094041778347391.bin, -w, /tmp/graph5748094041778347391.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/graph5748094041778347391.bin, -l, -1, -v, -w, /tmp/graph5748094041778347391.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 11:29:34] [INFO ] Decomposing Gal with order
[2021-05-18 11:29:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:29:34] [INFO ] Removed a total of 2252 redundant transitions.
[2021-05-18 11:29:34] [INFO ] Flatten gal took : 373 ms
[2021-05-18 11:29:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1429 labels/synchronizations in 143 ms.
[2021-05-18 11:29:34] [INFO ] Time to serialize gal into /tmp/LTL9795078825462069603.gal : 15 ms
[2021-05-18 11:29:34] [INFO ] Time to serialize properties into /tmp/LTL9466113575251865077.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/LTL9795078825462069603.gal, -t, CGAL, -LTL, /tmp/LTL9466113575251865077.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/LTL9795078825462069603.gal -t CGAL -LTL /tmp/LTL9466113575251865077.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i16.u91.Node12ManageTheCrashOfNode4<1)||(i16.u18.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"))))
Formula 0 simplified : !FG"((i16.u91.Node12ManageTheCrashOfNode4<1)||(i16.u18.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12333738257025045662
[2021-05-18 11:29:49] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12333738257025045662
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/ltsmin12333738257025045662]
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/ltsmin12333738257025045662] 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/ltsmin12333738257025045662] 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-S16C08-07 finished in 50459 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1254 transition count 2813
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1254 transition count 2813
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1242 transition count 2752
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1242 transition count 2752
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1237 transition count 2712
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1237 transition count 2712
Applied a total of 72 rules in 226 ms. Remains 1237 /1273 variables (removed 36) and now considering 2712/2881 (removed 169) transitions.
[2021-05-18 11:29:52] [INFO ] Flow matrix only has 2440 transitions (discarded 272 similar events)
// Phase 1: matrix 2440 rows 1237 cols
[2021-05-18 11:29:52] [INFO ] Computed 63 place invariants in 24 ms
[2021-05-18 11:29:53] [INFO ] Implicit Places using invariants in 1081 ms returned [17, 104, 264, 396, 437, 467, 563, 602, 609, 768, 835, 836, 881]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 13 implicit places.
[2021-05-18 11:29:53] [INFO ] Flow matrix only has 2440 transitions (discarded 272 similar events)
// Phase 1: matrix 2440 rows 1224 cols
[2021-05-18 11:29:53] [INFO ] Computed 50 place invariants in 32 ms
[2021-05-18 11:29:54] [INFO ] Dead Transitions using invariants and state equation in 1393 ms returned []
Starting structural reductions, iteration 1 : 1224/1273 places, 2712/2881 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1213 transition count 2701
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1213 transition count 2701
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1202 transition count 2690
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1202 transition count 2690
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1191 transition count 2679
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1191 transition count 2679
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1181 transition count 2599
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1181 transition count 2599
Applied a total of 86 rules in 276 ms. Remains 1181 /1224 variables (removed 43) and now considering 2599/2712 (removed 113) transitions.
[2021-05-18 11:29:54] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2021-05-18 11:29:54] [INFO ] Computed 50 place invariants in 20 ms
[2021-05-18 11:29:55] [INFO ] Implicit Places using invariants in 938 ms returned []
[2021-05-18 11:29:55] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2021-05-18 11:29:55] [INFO ] Computed 50 place invariants in 19 ms
[2021-05-18 11:29:56] [INFO ] State equation strengthened by 863 read => feed constraints.
[2021-05-18 11:30:09] [INFO ] Implicit Places using invariants and state equation in 13660 ms returned []
Implicit Place search using SMT with State Equation took 14600 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1181/1273 places, 2599/2881 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s522 1) (GEQ s525 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 80 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-09 finished in 18794 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1273 transition count 2852
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2852
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 58 place count 1244 transition count 2828
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 106 place count 1220 transition count 2828
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 120 place count 1206 transition count 2772
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 1206 transition count 2772
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 134 place count 1206 transition count 2768
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 142 place count 1202 transition count 2768
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 150 place count 1194 transition count 2704
Iterating global reduction 2 with 8 rules applied. Total rules applied 158 place count 1194 transition count 2704
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 208 place count 1169 transition count 2679
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 213 place count 1164 transition count 2674
Iterating global reduction 2 with 5 rules applied. Total rules applied 218 place count 1164 transition count 2674
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 223 place count 1159 transition count 2634
Iterating global reduction 2 with 5 rules applied. Total rules applied 228 place count 1159 transition count 2634
Applied a total of 228 rules in 450 ms. Remains 1159 /1273 variables (removed 114) and now considering 2634/2881 (removed 247) transitions.
[2021-05-18 11:30:10] [INFO ] Flow matrix only has 2362 transitions (discarded 272 similar events)
// Phase 1: matrix 2362 rows 1159 cols
[2021-05-18 11:30:10] [INFO ] Computed 63 place invariants in 28 ms
[2021-05-18 11:30:11] [INFO ] Implicit Places using invariants in 1037 ms returned [9, 94, 230, 357, 398, 425, 493, 515, 553, 559, 712, 777, 778, 824]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 14 implicit places.
[2021-05-18 11:30:11] [INFO ] Redundant transitions in 61 ms returned []
[2021-05-18 11:30:11] [INFO ] Flow matrix only has 2362 transitions (discarded 272 similar events)
// Phase 1: matrix 2362 rows 1145 cols
[2021-05-18 11:30:11] [INFO ] Computed 49 place invariants in 36 ms
[2021-05-18 11:30:12] [INFO ] Dead Transitions using invariants and state equation in 1282 ms returned []
Starting structural reductions, iteration 1 : 1145/1273 places, 2634/2881 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1137 transition count 2626
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1137 transition count 2626
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1129 transition count 2618
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1129 transition count 2618
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1122 transition count 2562
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1122 transition count 2562
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 1118 transition count 2558
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1114 transition count 2554
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1114 transition count 2554
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1110 transition count 2522
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1110 transition count 2522
Applied a total of 70 rules in 445 ms. Remains 1110 /1145 variables (removed 35) and now considering 2522/2634 (removed 112) transitions.
[2021-05-18 11:30:12] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2021-05-18 11:30:12] [INFO ] Computed 49 place invariants in 19 ms
[2021-05-18 11:30:13] [INFO ] Implicit Places using invariants in 957 ms returned []
[2021-05-18 11:30:13] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2021-05-18 11:30:13] [INFO ] Computed 49 place invariants in 20 ms
[2021-05-18 11:30:14] [INFO ] State equation strengthened by 856 read => feed constraints.
[2021-05-18 11:30:14] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1110/1273 places, 2522/2881 transitions.
Stuttering acceptance computed with spot in 10488 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s746 1) (GEQ s1077 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-10 finished in 15619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1254 transition count 2813
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1254 transition count 2813
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1242 transition count 2745
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1242 transition count 2745
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1238 transition count 2713
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1238 transition count 2713
Applied a total of 70 rules in 231 ms. Remains 1238 /1273 variables (removed 35) and now considering 2713/2881 (removed 168) transitions.
[2021-05-18 11:30:25] [INFO ] Flow matrix only has 2441 transitions (discarded 272 similar events)
// Phase 1: matrix 2441 rows 1238 cols
[2021-05-18 11:30:25] [INFO ] Computed 63 place invariants in 29 ms
[2021-05-18 11:30:26] [INFO ] Implicit Places using invariants in 1067 ms returned [17, 104, 264, 396, 437, 467, 537, 561, 600, 607, 766, 833, 882]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1069 ms to find 13 implicit places.
[2021-05-18 11:30:26] [INFO ] Flow matrix only has 2441 transitions (discarded 272 similar events)
// Phase 1: matrix 2441 rows 1225 cols
[2021-05-18 11:30:26] [INFO ] Computed 50 place invariants in 25 ms
[2021-05-18 11:30:27] [INFO ] Dead Transitions using invariants and state equation in 1192 ms returned []
Starting structural reductions, iteration 1 : 1225/1273 places, 2713/2881 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1214 transition count 2702
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1214 transition count 2702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1203 transition count 2691
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1203 transition count 2691
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1192 transition count 2680
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1192 transition count 2680
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1182 transition count 2600
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1182 transition count 2600
Applied a total of 86 rules in 277 ms. Remains 1182 /1225 variables (removed 43) and now considering 2600/2713 (removed 113) transitions.
[2021-05-18 11:30:28] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1182 cols
[2021-05-18 11:30:28] [INFO ] Computed 50 place invariants in 20 ms
[2021-05-18 11:30:29] [INFO ] Implicit Places using invariants in 964 ms returned []
[2021-05-18 11:30:29] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1182 cols
[2021-05-18 11:30:29] [INFO ] Computed 50 place invariants in 20 ms
[2021-05-18 11:30:29] [INFO ] State equation strengthened by 863 read => feed constraints.
[2021-05-18 11:30:43] [INFO ] Implicit Places using invariants and state equation in 14953 ms returned []
Implicit Place search using SMT with State Equation took 15918 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1182/1273 places, 2600/2881 transitions.
Stuttering acceptance computed with spot in 1275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s190 1) (LT s984 1) (LT s985 1)), p1:(GEQ s799 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1044 ms.
Product exploration explored 100000 steps with 50000 reset in 1020 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 997 ms.
Product exploration explored 100000 steps with 50000 reset in 1023 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1182/1182 places, 2600/2600 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1182 transition count 2600
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 1182 transition count 2601
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 1182 transition count 2601
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 1167 transition count 2586
Deduced a syphon composed of 32 places in 2 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 1167 transition count 2586
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 1167 transition count 2586
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 1165 transition count 2584
Deduced a syphon composed of 48 places in 2 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 1165 transition count 2584
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 99 rules in 599 ms. Remains 1165 /1182 variables (removed 17) and now considering 2584/2600 (removed 16) transitions.
[2021-05-18 11:30:50] [INFO ] Redundant transitions in 85 ms returned []
[2021-05-18 11:30:50] [INFO ] Flow matrix only has 2312 transitions (discarded 272 similar events)
// Phase 1: matrix 2312 rows 1165 cols
[2021-05-18 11:30:50] [INFO ] Computed 50 place invariants in 26 ms
[2021-05-18 11:30:51] [INFO ] Dead Transitions using invariants and state equation in 1228 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1165/1182 places, 2584/2600 transitions.
Product exploration explored 100000 steps with 50000 reset in 1085 ms.
Product exploration explored 100000 steps with 50000 reset in 1082 ms.
[2021-05-18 11:30:53] [INFO ] Flatten gal took : 73 ms
[2021-05-18 11:30:53] [INFO ] Flatten gal took : 74 ms
[2021-05-18 11:30:53] [INFO ] Time to serialize gal into /tmp/LTL4117025773299010072.gal : 9 ms
[2021-05-18 11:31:03] [INFO ] Time to serialize properties into /tmp/LTL11294157447186885416.ltl : 9978 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/LTL4117025773299010072.gal, -t, CGAL, -LTL, /tmp/LTL11294157447186885416.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/LTL4117025773299010072.gal -t CGAL -LTL /tmp/LTL11294157447186885416.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(((Node1AsksIsThereANodeMaster<1)||(Node16IsActive<1))||(Node16IsTheNodeMaster<1))"))||(X(F("(Node14HasTheLeafSetOfLx6ToReplaceNode1>=1)"))))))
Formula 0 simplified : !X(F"(((Node1AsksIsThereANodeMaster<1)||(Node16IsActive<1))||(Node16IsTheNodeMaster<1))" | XF"(Node14HasTheLeafSetOfLx6ToReplaceNode1>=1)")
Detected timeout of ITS tools.
[2021-05-18 11:31:19] [INFO ] Flatten gal took : 74 ms
[2021-05-18 11:31:19] [INFO ] Applying decomposition
[2021-05-18 11:31:19] [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/graph11464766783024020397.txt, -o, /tmp/graph11464766783024020397.bin, -w, /tmp/graph11464766783024020397.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/graph11464766783024020397.bin, -l, -1, -v, -w, /tmp/graph11464766783024020397.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 11:31:25] [INFO ] Decomposing Gal with order
[2021-05-18 11:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:31:25] [INFO ] Removed a total of 1886 redundant transitions.
[2021-05-18 11:31:25] [INFO ] Flatten gal took : 170 ms
[2021-05-18 11:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1036 labels/synchronizations in 43 ms.
[2021-05-18 11:31:25] [INFO ] Time to serialize gal into /tmp/LTL12345925919188002520.gal : 306 ms
[2021-05-18 11:31:25] [INFO ] Time to serialize properties into /tmp/LTL484132226695964135.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/LTL12345925919188002520.gal, -t, CGAL, -LTL, /tmp/LTL484132226695964135.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/LTL12345925919188002520.gal -t CGAL -LTL /tmp/LTL484132226695964135.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i0.u0.Node1AsksIsThereANodeMaster<1)||(i0.u0.Node16IsActive<1))||(i0.u0.Node16IsTheNodeMaster<1))"))||(X(F("(i1.i2.i9.u186.Node14HasTheLeafSetOfLx6ToReplaceNode1>=1)"))))))
Formula 0 simplified : !X(F"(((i0.u0.Node1AsksIsThereANodeMaster<1)||(i0.u0.Node16IsActive<1))||(i0.u0.Node16IsTheNodeMaster<1))" | XF"(i1.i2.i9.u186.Node14HasTheLeafSetOfLx6ToReplaceNode1>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16611206450455829737
[2021-05-18 11:31:40] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16611206450455829737
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/ltsmin16611206450455829737]
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/ltsmin16611206450455829737] 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/ltsmin16611206450455829737] 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-S16C08-11 finished in 76610 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p1 U (p2||G(p1)))||p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 1273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1273/1273 places, 2881/2881 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1253 transition count 2812
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1253 transition count 2812
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 1240 transition count 2743
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 1240 transition count 2743
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 1235 transition count 2703
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 1235 transition count 2703
Applied a total of 76 rules in 238 ms. Remains 1235 /1273 variables (removed 38) and now considering 2703/2881 (removed 178) transitions.
[2021-05-18 11:31:45] [INFO ] Flow matrix only has 2431 transitions (discarded 272 similar events)
// Phase 1: matrix 2431 rows 1235 cols
[2021-05-18 11:31:45] [INFO ] Computed 63 place invariants in 31 ms
[2021-05-18 11:31:45] [INFO ] Implicit Places using invariants in 962 ms returned [17, 104, 264, 396, 437, 467, 537, 607, 766, 833, 834, 879]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 973 ms to find 12 implicit places.
[2021-05-18 11:31:45] [INFO ] Flow matrix only has 2431 transitions (discarded 272 similar events)
// Phase 1: matrix 2431 rows 1223 cols
[2021-05-18 11:31:46] [INFO ] Computed 51 place invariants in 42 ms
[2021-05-18 11:31:47] [INFO ] Dead Transitions using invariants and state equation in 1297 ms returned []
Starting structural reductions, iteration 1 : 1223/1273 places, 2703/2881 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1211 transition count 2691
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1211 transition count 2691
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1199 transition count 2679
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1199 transition count 2679
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 1188 transition count 2668
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 1188 transition count 2668
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 1178 transition count 2588
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 1178 transition count 2588
Applied a total of 90 rules in 213 ms. Remains 1178 /1223 variables (removed 45) and now considering 2588/2703 (removed 115) transitions.
[2021-05-18 11:31:47] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1178 cols
[2021-05-18 11:31:47] [INFO ] Computed 51 place invariants in 21 ms
[2021-05-18 11:31:48] [INFO ] Implicit Places using invariants in 868 ms returned []
[2021-05-18 11:31:48] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1178 cols
[2021-05-18 11:31:48] [INFO ] Computed 51 place invariants in 20 ms
[2021-05-18 11:31:49] [INFO ] State equation strengthened by 856 read => feed constraints.
[2021-05-18 11:31:59] [INFO ] Implicit Places using invariants and state equation in 10905 ms returned []
Implicit Place search using SMT with State Equation took 11774 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1178/1273 places, 2588/2881 transitions.
Stuttering acceptance computed with spot in 7243 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (LT s486 1) (LT s1126 1)) (OR (LT s648 1) (LT s1047 1))), p1:(OR (LT s648 1) (LT s1047 1)), p0:(OR (AND (GEQ s2 1) (GEQ s535 1) (GEQ s536 1) (GEQ s574 1)) (AND (GEQ s486 1) (GEQ s1126 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1207 reset in 606 ms.
Product exploration explored 100000 steps with 1206 reset in 608 ms.
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 1205 reset in 562 ms.
Product exploration explored 100000 steps with 1204 reset in 571 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Support contains 8 out of 1178 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1178/1178 places, 2588/2588 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1178 transition count 2588
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 32 place count 1178 transition count 2588
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 1178 transition count 2588
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 1162 transition count 2572
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 1162 transition count 2572
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 97 place count 1162 transition count 2572
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 97 rules in 191 ms. Remains 1162 /1178 variables (removed 16) and now considering 2572/2588 (removed 16) transitions.
[2021-05-18 11:32:09] [INFO ] Redundant transitions in 86 ms returned []
[2021-05-18 11:32:09] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1162 cols
[2021-05-18 11:32:09] [INFO ] Computed 51 place invariants in 25 ms
[2021-05-18 11:32:10] [INFO ] Dead Transitions using invariants and state equation in 1226 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1162/1178 places, 2572/2588 transitions.
Product exploration explored 100000 steps with 1711 reset in 1046 ms.
Product exploration explored 100000 steps with 1714 reset in 911 ms.
[2021-05-18 11:32:12] [INFO ] Flatten gal took : 77 ms
[2021-05-18 11:32:12] [INFO ] Flatten gal took : 77 ms
[2021-05-18 11:32:26] [INFO ] Time to serialize gal into /tmp/LTL13751037323488151126.gal : 1968 ms
[2021-05-18 11:32:26] [INFO ] Time to serialize properties into /tmp/LTL16540291367655045350.ltl : 80 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/LTL13751037323488151126.gal, -t, CGAL, -LTL, /tmp/LTL16540291367655045350.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/LTL13751037323488151126.gal -t CGAL -LTL /tmp/LTL16540291367655045350.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((NodesCanDetectThatNode11HasCrashed<1)||(Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))")U(("(((RequestOfNode4IsSentToLx4<1)||(Lx4IsActiveAndNotInTheLeafSet<1))&&((NodesCanDetectThatNode11HasCrashed<1)||(Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)))")||(G("((NodesCanDetectThatNode11HasCrashed<1)||(Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))"))))||("((((ThereIsAMasterInTheLeafSet>=1)&&(Node6WantsToManageTheCrashOfNode7>=1))&&(Node6HasDetectedCrashOfNode7>=1))&&(NoNodeManageTheCrashOfNode7>=1))"))||("((RequestOfNode4IsSentToLx4>=1)&&(Lx4IsActiveAndNotInTheLeafSet>=1))")))))
Formula 0 simplified : !XG("((((ThereIsAMasterInTheLeafSet>=1)&&(Node6WantsToManageTheCrashOfNode7>=1))&&(Node6HasDetectedCrashOfNode7>=1))&&(NoNodeManageTheCrashOfNode7>=1))" | "((RequestOfNode4IsSentToLx4>=1)&&(Lx4IsActiveAndNotInTheLeafSet>=1))" | ("((NodesCanDetectThatNode11HasCrashed<1)||(Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))" U ("(((RequestOfNode4IsSentToLx4<1)||(Lx4IsActiveAndNotInTheLeafSet<1))&&((NodesCanDetectThatNode11HasCrashed<1)||(Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)))" | G"((NodesCanDetectThatNode11HasCrashed<1)||(Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))")))
Detected timeout of ITS tools.
[2021-05-18 11:32:41] [INFO ] Flatten gal took : 93 ms
[2021-05-18 11:32:41] [INFO ] Applying decomposition
[2021-05-18 11:32:41] [INFO ] Flatten gal took : 71 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/graph9984068540095529182.txt, -o, /tmp/graph9984068540095529182.bin, -w, /tmp/graph9984068540095529182.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/graph9984068540095529182.bin, -l, -1, -v, -w, /tmp/graph9984068540095529182.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 11:32:42] [INFO ] Decomposing Gal with order
[2021-05-18 11:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:32:42] [INFO ] Removed a total of 3044 redundant transitions.
[2021-05-18 11:32:42] [INFO ] Flatten gal took : 177 ms
[2021-05-18 11:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1191 labels/synchronizations in 84 ms.
[2021-05-18 11:32:46] [INFO ] Time to serialize gal into /tmp/LTL8287260678781064839.gal : 3833 ms
[2021-05-18 11:32:46] [INFO ] Time to serialize properties into /tmp/LTL6157388172023902575.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/LTL8287260678781064839.gal, -t, CGAL, -LTL, /tmp/LTL6157388172023902575.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/LTL8287260678781064839.gal -t CGAL -LTL /tmp/LTL6157388172023902575.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((i6.u82.NodesCanDetectThatNode11HasCrashed<1)||(u174.Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))")U(("(((i2.i0.i0.i1.u187.RequestOfNode4IsSentToLx4<1)||(i2.i0.i0.i1.u186.Lx4IsActiveAndNotInTheLeafSet<1))&&((i6.u82.NodesCanDetectThatNode11HasCrashed<1)||(u174.Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)))")||(G("((i6.u82.NodesCanDetectThatNode11HasCrashed<1)||(u174.Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))"))))||("((((i1.u14.ThereIsAMasterInTheLeafSet>=1)&&(i1.u97.Node6WantsToManageTheCrashOfNode7>=1))&&(i14.u99.Node6HasDetectedCrashOfNode7>=1))&&(i1.u14.NoNodeManageTheCrashOfNode7>=1))"))||("((i2.i0.i0.i1.u187.RequestOfNode4IsSentToLx4>=1)&&(i2.i0.i0.i1.u186.Lx4IsActiveAndNotInTheLeafSet>=1))")))))
Formula 0 simplified : !XG("((((i1.u14.ThereIsAMasterInTheLeafSet>=1)&&(i1.u97.Node6WantsToManageTheCrashOfNode7>=1))&&(i14.u99.Node6HasDetectedCrashOfNode7>=1))&&(i1.u14.NoNodeManageTheCrashOfNode7>=1))" | "((i2.i0.i0.i1.u187.RequestOfNode4IsSentToLx4>=1)&&(i2.i0.i0.i1.u186.Lx4IsActiveAndNotInTheLeafSet>=1))" | ("((i6.u82.NodesCanDetectThatNode11HasCrashed<1)||(u174.Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))" U ("(((i2.i0.i0.i1.u187.RequestOfNode4IsSentToLx4<1)||(i2.i0.i0.i1.u186.Lx4IsActiveAndNotInTheLeafSet<1))&&((i6.u82.NodesCanDetectThatNode11HasCrashed<1)||(u174.Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)))" | G"((i6.u82.NodesCanDetectThatNode11HasCrashed<1)||(u174.Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17324181800556769871
[2021-05-18 11:33:01] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17324181800556769871
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/ltsmin17324181800556769871]
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/ltsmin17324181800556769871] 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/ltsmin17324181800556769871] 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-S16C08-13 finished in 80537 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6295325807822746186
[2021-05-18 11:33:02] [INFO ] Too many transitions (2881) to apply POR reductions. Disabling POR matrices.
[2021-05-18 11:33:02] [INFO ] Applying decomposition
[2021-05-18 11:33:02] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6295325807822746186
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/ltsmin6295325807822746186]
[2021-05-18 11:33:02] [INFO ] Flatten gal took : 114 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/graph18126151901444149430.txt, -o, /tmp/graph18126151901444149430.bin, -w, /tmp/graph18126151901444149430.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/graph18126151901444149430.bin, -l, -1, -v, -w, /tmp/graph18126151901444149430.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 11:33:05] [INFO ] Decomposing Gal with order
[2021-05-18 11:33:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:33:05] [INFO ] Removed a total of 3525 redundant transitions.
[2021-05-18 11:33:05] [INFO ] Flatten gal took : 193 ms
[2021-05-18 11:33:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1392 labels/synchronizations in 73 ms.
[2021-05-18 11:33:06] [INFO ] Time to serialize gal into /tmp/LTLFireability5167959011438455190.gal : 19 ms
[2021-05-18 11:33:06] [INFO ] Time to serialize properties into /tmp/LTLFireability3282962034352765613.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/LTLFireability5167959011438455190.gal, -t, CGAL, -LTL, /tmp/LTLFireability3282962034352765613.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/LTLFireability5167959011438455190.gal -t CGAL -LTL /tmp/LTLFireability3282962034352765613.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((F((!("((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))&&(X((G(F(!("((((i0.u122.Node11IsActive>=1)&&(i0.u54.Node14DontAnswerToAnyNode>=1))&&(i8.u88.Node4NotifyThatHeIsActive>=1))&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))&&((!("((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))U(("((!((i10.u111.Node7ManageTheCrashOfNode15>=1)&&(i10.u35.Rx6IsAtTheRightExtremityOfTheLeafSet>=1)))&&(!((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))))")||(G(!("((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))))))))
Formula 0 simplified : !F(!"((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" & X(GF!"((((i0.u122.Node11IsActive>=1)&&(i0.u54.Node14DontAnswerToAnyNode>=1))&&(i8.u88.Node4NotifyThatHeIsActive>=1))&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" & (!"((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" U ("((!((i10.u111.Node7ManageTheCrashOfNode15>=1)&&(i10.u35.Rx6IsAtTheRightExtremityOfTheLeafSet>=1)))&&(!((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))))" | G!"((i8.u88.Node4NotifyThatHeIsActive>=1)&&(i3.u178.Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))
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/ltsmin6295325807822746186] killed by timeout after 27 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/ltsmin6295325807822746186] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-18 11:56:14] [INFO ] Flatten gal took : 1201 ms
[2021-05-18 11:56:14] [INFO ] Time to serialize gal into /tmp/LTLFireability3289198153844322621.gal : 93 ms
[2021-05-18 11:56:14] [INFO ] Time to serialize properties into /tmp/LTLFireability17210534775456791557.ltl : 13 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/LTLFireability3289198153844322621.gal, -t, CGAL, -LTL, /tmp/LTLFireability17210534775456791557.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/LTLFireability3289198153844322621.gal -t CGAL -LTL /tmp/LTLFireability17210534775456791557.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 4 LTL properties
Checking formula 0 : !((F((!("((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))&&(X((G(F(!("((((Node11IsActive>=1)&&(Node14DontAnswerToAnyNode>=1))&&(Node4NotifyThatHeIsActive>=1))&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))&&((!("((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))U(("((!((Node7ManageTheCrashOfNode15>=1)&&(Rx6IsAtTheRightExtremityOfTheLeafSet>=1)))&&(!((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))))")||(G(!("((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))))))))
Formula 0 simplified : !F(!"((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" & X(GF!"((((Node11IsActive>=1)&&(Node14DontAnswerToAnyNode>=1))&&(Node4NotifyThatHeIsActive>=1))&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" & (!"((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" U ("((!((Node7ManageTheCrashOfNode15>=1)&&(Rx6IsAtTheRightExtremityOfTheLeafSet>=1)))&&(!((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))))" | G!"((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))
Detected timeout of ITS tools.
[2021-05-18 12:19:12] [INFO ] Flatten gal took : 743 ms
[2021-05-18 12:19:13] [INFO ] Input system was already deterministic with 2881 transitions.
[2021-05-18 12:19:13] [INFO ] Transformed 1273 places.
[2021-05-18 12:19:14] [INFO ] Transformed 2881 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 12:19:44] [INFO ] Time to serialize gal into /tmp/LTLFireability16256991093802283974.gal : 12 ms
[2021-05-18 12:19:44] [INFO ] Time to serialize properties into /tmp/LTLFireability3656765506872416242.ltl : 2 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/LTLFireability16256991093802283974.gal, -t, CGAL, -LTL, /tmp/LTLFireability3656765506872416242.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/LTLFireability16256991093802283974.gal -t CGAL -LTL /tmp/LTLFireability3656765506872416242.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((!("((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))&&(X((G(F(!("((((Node11IsActive>=1)&&(Node14DontAnswerToAnyNode>=1))&&(Node4NotifyThatHeIsActive>=1))&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))&&((!("((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))U(("((!((Node7ManageTheCrashOfNode15>=1)&&(Rx6IsAtTheRightExtremityOfTheLeafSet>=1)))&&(!((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))))")||(G(!("((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))"))))))))))
Formula 0 simplified : !F(!"((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" & X(GF!"((((Node11IsActive>=1)&&(Node14DontAnswerToAnyNode>=1))&&(Node4NotifyThatHeIsActive>=1))&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" & (!"((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))" U ("((!((Node7ManageTheCrashOfNode15>=1)&&(Rx6IsAtTheRightExtremityOfTheLeafSet>=1)))&&(!((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=1))))" | G!"((Node4NotifyThatHeIsActive>=1)&&(Node15ThinksNode4ShouldBeNodeMasterToReplaceNode12>=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-S16C08"
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-S16C08, 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-162124156700621"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;