About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.367 | 3600000.00 | 12666117.00 | 50745.40 | ?FTTFFFTTFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821200699.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200699
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.5M
-rw-r--r-- 1 mcc users 14K Apr 29 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.3M May 10 09:34 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-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652834648655
Running Version 202205111006
[2022-05-18 00:44:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2022-05-18 00:44:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:44:10] [INFO ] Load time of PNML (sax parser for PT used): 460 ms
[2022-05-18 00:44:10] [INFO ] Transformed 6876 places.
[2022-05-18 00:44:10] [INFO ] Transformed 9571 transitions.
[2022-05-18 00:44:10] [INFO ] Parsed PT model containing 6876 places and 9571 transitions in 613 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 6876 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 2150 places :
Symmetric choice reduction at 1 with 2150 rule applications. Total rules 2186 place count 4690 transition count 7421
Iterating global reduction 1 with 2150 rules applied. Total rules applied 4336 place count 4690 transition count 7421
Discarding 1887 places :
Symmetric choice reduction at 1 with 1887 rule applications. Total rules 6223 place count 2803 transition count 5534
Iterating global reduction 1 with 1887 rules applied. Total rules applied 8110 place count 2803 transition count 5534
Discarding 218 places :
Symmetric choice reduction at 1 with 218 rule applications. Total rules 8328 place count 2585 transition count 3790
Iterating global reduction 1 with 218 rules applied. Total rules applied 8546 place count 2585 transition count 3790
Applied a total of 8546 rules in 1257 ms. Remains 2585 /6876 variables (removed 4291) and now considering 3790/9571 (removed 5781) transitions.
[2022-05-18 00:44:11] [INFO ] Flow matrix only has 3518 transitions (discarded 272 similar events)
// Phase 1: matrix 3518 rows 2585 cols
[2022-05-18 00:44:12] [INFO ] Computed 613 place invariants in 183 ms
[2022-05-18 00:44:16] [INFO ] Implicit Places using invariants in 4532 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 26, 28, 33, 40, 49, 60, 73, 88, 104, 120, 122, 124, 126, 128, 130, 132, 134, 136, 149, 160, 169, 176, 181, 184, 219, 226, 229, 230, 231, 232, 233, 234, 235, 236, 237, 240, 245, 252, 261, 272, 285, 299, 313, 314, 315, 316, 317, 318, 319, 320, 321, 332, 341, 348, 353, 356, 358, 393, 400, 403, 404, 405, 406, 407, 408, 409, 410, 411, 413, 417, 422, 429, 438, 449, 461, 473, 474, 475, 477, 478, 479, 480, 481, 492, 499, 504, 507, 509, 511, 546, 553, 556, 557, 558, 559, 560, 561, 562, 563, 564, 566, 568, 571, 576, 583, 592, 602, 612, 613, 614, 615, 616, 617, 618, 619, 620, 627, 632, 635, 637, 639, 641, 676, 683, 686, 687, 689, 690, 691, 692, 693, 694, 697, 699, 701, 707, 712, 719, 727, 735, 736, 737, 738, 739, 740, 741, 742, 743, 748, 751, 753, 755, 757, 759, 794, 801, 805, 806, 807, 808, 809, 810, 811, 812, 817, 819, 821, 823, 826, 831, 837, 843, 844, 845, 846, 847, 848, 849, 850, 851, 854, 856, 858, 860, 862, 864, 899, 906, 909, 910, 911, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 930, 934, 938, 939, 940, 941, 942, 943, 944, 945, 946, 948, 950, 953, 955, 957, 959, 994, 1001, 1004, 1005, 1006, 1007, 1008, 1009, 1011, 1012, 1014, 1016, 1018, 1020, 1025, 1027, 1029, 1032, 1033, 1038, 1039, 1040, 1041, 1045, 1050, 1052, 1054, 1056, 1058, 1096, 1098, 1102, 1105, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1115, 1117, 1119, 1121, 1123, 1127, 1129, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1142, 1144, 1146, 1148, 1150, 1152, 1187, 1194, 1197, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1207, 1209, 1211, 1213, 1218, 1220, 1222, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1235, 1237, 1239, 1241, 1243, 1247, 1282, 1289, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1302, 1304, 1306, 1308, 1310, 1312, 1315, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1328, 1331, 1336, 1338, 1340, 1342, 1344, 1379, 1386, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1399, 1401, 1403, 1405, 1407, 1410, 1415, 1423, 1424, 1425, 1426, 1427, 1428, 1431, 1438, 1441, 1443, 1445, 1449, 1451, 1486, 1493, 1496, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1506, 1508, 1510, 1514, 1517, 1522, 1529, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1553, 1558, 1561, 1563, 1565, 1567, 1602, 1609, 1612, 1613, 1614, 1615, 1616, 1617, 1618, 1619, 1620, 1622, 1624, 1626, 1629, 1634, 1641, 1650, 1661, 1662, 1663, 1664, 1665, 1667, 1669, 1682, 1690, 1695, 1698, 1700, 1702, 1737, 1744, 1747, 1748, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1757, 1759, 1762, 1767, 1774, 1783, 1794, 1807, 1808, 1809, 1810, 1812, 1813, 1814, 1815, 1826, 1835, 1842, 1847, 1852, 1854, 1889, 1896, 1899, 1900, 1901, 1902, 1903, 1904, 1905, 1906, 1907, 1909, 1912, 1917, 1924, 1933, 1944, 1957, 1972, 1973, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1993, 2004, 2013, 2025, 2028, 2063, 2065, 2069, 2072, 2073, 2074, 2075, 2076, 2077, 2078, 2079, 2080, 2083, 2088, 2095, 2104, 2115, 2128, 2143, 2160, 2161, 2162, 2163, 2164, 2165, 2166, 2167, 2168, 2183, 2196, 2207, 2216, 2223, 2228, 2264]
Discarding 546 places :
Implicit Place search using SMT only with invariants took 4576 ms to find 546 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2039/6876 places, 3790/9571 transitions.
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 238 place count 1801 transition count 3552
Iterating global reduction 0 with 238 rules applied. Total rules applied 476 place count 1801 transition count 3552
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 714 place count 1563 transition count 3314
Iterating global reduction 0 with 238 rules applied. Total rules applied 952 place count 1563 transition count 3314
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 1190 place count 1325 transition count 3076
Iterating global reduction 0 with 238 rules applied. Total rules applied 1428 place count 1325 transition count 3076
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1446 place count 1307 transition count 2932
Iterating global reduction 0 with 18 rules applied. Total rules applied 1464 place count 1307 transition count 2932
Applied a total of 1464 rules in 287 ms. Remains 1307 /2039 variables (removed 732) and now considering 2932/3790 (removed 858) transitions.
[2022-05-18 00:44:16] [INFO ] Flow matrix only has 2660 transitions (discarded 272 similar events)
// Phase 1: matrix 2660 rows 1307 cols
[2022-05-18 00:44:16] [INFO ] Computed 67 place invariants in 59 ms
[2022-05-18 00:44:17] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2022-05-18 00:44:17] [INFO ] Flow matrix only has 2660 transitions (discarded 272 similar events)
// Phase 1: matrix 2660 rows 1307 cols
[2022-05-18 00:44:17] [INFO ] Computed 67 place invariants in 52 ms
[2022-05-18 00:44:18] [INFO ] State equation strengthened by 1070 read => feed constraints.
[2022-05-18 00:44:29] [INFO ] Implicit Places using invariants and state equation in 11554 ms returned []
Implicit Place search using SMT with State Equation took 12647 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1307/6876 places, 2932/9571 transitions.
Finished structural reductions, in 2 iterations. Remains : 1307/6876 places, 2932/9571 transitions.
Support contains 28 out of 1307 places after structural reductions.
[2022-05-18 00:44:30] [INFO ] Flatten gal took : 206 ms
[2022-05-18 00:44:31] [INFO ] Flatten gal took : 146 ms
[2022-05-18 00:44:31] [INFO ] Input system was already deterministic with 2932 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-05-18 00:44:32] [INFO ] Flow matrix only has 2660 transitions (discarded 272 similar events)
// Phase 1: matrix 2660 rows 1307 cols
[2022-05-18 00:44:32] [INFO ] Computed 67 place invariants in 24 ms
[2022-05-18 00:44:33] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-18 00:44:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2022-05-18 00:44:33] [INFO ] [Nat]Absence check using 31 positive and 36 generalized place invariants in 19 ms returned sat
[2022-05-18 00:44:35] [INFO ] After 1416ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-05-18 00:44:35] [INFO ] State equation strengthened by 1070 read => feed constraints.
[2022-05-18 00:44:36] [INFO ] After 1433ms SMT Verify possible using 1070 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2022-05-18 00:44:38] [INFO ] Deduced a trap composed of 524 places in 605 ms of which 12 ms to minimize.
[2022-05-18 00:44:39] [INFO ] Deduced a trap composed of 199 places in 645 ms of which 6 ms to minimize.
[2022-05-18 00:44:40] [INFO ] Deduced a trap composed of 260 places in 628 ms of which 2 ms to minimize.
[2022-05-18 00:44:40] [INFO ] Deduced a trap composed of 226 places in 599 ms of which 2 ms to minimize.
[2022-05-18 00:44:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2851 ms
[2022-05-18 00:44:41] [INFO ] Deduced a trap composed of 511 places in 542 ms of which 1 ms to minimize.
[2022-05-18 00:44:42] [INFO ] Deduced a trap composed of 202 places in 566 ms of which 1 ms to minimize.
[2022-05-18 00:44:43] [INFO ] Deduced a trap composed of 203 places in 571 ms of which 1 ms to minimize.
[2022-05-18 00:44:43] [INFO ] Deduced a trap composed of 174 places in 591 ms of which 2 ms to minimize.
[2022-05-18 00:44:44] [INFO ] Deduced a trap composed of 200 places in 601 ms of which 2 ms to minimize.
[2022-05-18 00:44:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3357 ms
[2022-05-18 00:44:45] [INFO ] Deduced a trap composed of 305 places in 549 ms of which 1 ms to minimize.
[2022-05-18 00:44:45] [INFO ] Deduced a trap composed of 373 places in 550 ms of which 1 ms to minimize.
[2022-05-18 00:44:46] [INFO ] Deduced a trap composed of 319 places in 563 ms of which 1 ms to minimize.
[2022-05-18 00:44:47] [INFO ] Deduced a trap composed of 337 places in 589 ms of which 1 ms to minimize.
[2022-05-18 00:44:48] [INFO ] Deduced a trap composed of 344 places in 535 ms of which 2 ms to minimize.
[2022-05-18 00:44:48] [INFO ] Deduced a trap composed of 338 places in 504 ms of which 1 ms to minimize.
[2022-05-18 00:44:49] [INFO ] Deduced a trap composed of 351 places in 532 ms of which 1 ms to minimize.
[2022-05-18 00:44:49] [INFO ] Deduced a trap composed of 372 places in 537 ms of which 1 ms to minimize.
[2022-05-18 00:44:50] [INFO ] Deduced a trap composed of 351 places in 533 ms of which 1 ms to minimize.
[2022-05-18 00:44:51] [INFO ] Deduced a trap composed of 371 places in 559 ms of which 2 ms to minimize.
[2022-05-18 00:44:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6571 ms
[2022-05-18 00:44:52] [INFO ] Deduced a trap composed of 183 places in 595 ms of which 1 ms to minimize.
[2022-05-18 00:44:52] [INFO ] Deduced a trap composed of 183 places in 601 ms of which 1 ms to minimize.
[2022-05-18 00:44:53] [INFO ] Deduced a trap composed of 184 places in 583 ms of which 4 ms to minimize.
[2022-05-18 00:44:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2092 ms
[2022-05-18 00:44:53] [INFO ] After 18324ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 2490 ms.
[2022-05-18 00:44:56] [INFO ] After 22774ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 12 out of 1307 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1307 transition count 2904
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1279 transition count 2904
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 56 place count 1279 transition count 2879
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 106 place count 1254 transition count 2879
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 113 place count 1247 transition count 2851
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 1247 transition count 2851
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 1243 transition count 2826
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 1243 transition count 2826
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 1242 transition count 2818
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 1242 transition count 2818
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 200 place count 1207 transition count 2783
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 1202 transition count 2778
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 1202 transition count 2778
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 1197 transition count 2738
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 1197 transition count 2738
Free-agglomeration rule (complex) applied 152 times.
Iterating global reduction 2 with 152 rules applied. Total rules applied 372 place count 1197 transition count 4322
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 524 place count 1045 transition count 4322
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 541 place count 1045 transition count 4322
Applied a total of 541 rules in 1002 ms. Remains 1045 /1307 variables (removed 262) and now considering 4322/2932 (removed -1390) transitions.
Finished structural reductions, in 1 iterations. Remains : 1045/1307 places, 4322/2932 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 57652 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{6=1}
Probabilistic random walk after 57652 steps, saw 24542 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :1
Running SMT prover for 6 properties.
[2022-05-18 00:45:01] [INFO ] Flow matrix only has 3925 transitions (discarded 397 similar events)
// Phase 1: matrix 3925 rows 1045 cols
[2022-05-18 00:45:01] [INFO ] Computed 67 place invariants in 38 ms
[2022-05-18 00:45:01] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-18 00:45:01] [INFO ] [Nat]Absence check using 32 positive place invariants in 25 ms returned sat
[2022-05-18 00:45:01] [INFO ] [Nat]Absence check using 32 positive and 35 generalized place invariants in 8 ms returned sat
[2022-05-18 00:45:03] [INFO ] After 1345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-18 00:45:03] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:45:07] [INFO ] After 4064ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-18 00:45:08] [INFO ] Deduced a trap composed of 159 places in 498 ms of which 1 ms to minimize.
[2022-05-18 00:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2022-05-18 00:45:09] [INFO ] Deduced a trap composed of 164 places in 495 ms of which 0 ms to minimize.
[2022-05-18 00:45:10] [INFO ] Deduced a trap composed of 211 places in 492 ms of which 1 ms to minimize.
[2022-05-18 00:45:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1326 ms
[2022-05-18 00:45:11] [INFO ] Deduced a trap composed of 105 places in 574 ms of which 1 ms to minimize.
[2022-05-18 00:45:12] [INFO ] Deduced a trap composed of 103 places in 570 ms of which 1 ms to minimize.
[2022-05-18 00:45:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1441 ms
[2022-05-18 00:45:13] [INFO ] Deduced a trap composed of 156 places in 595 ms of which 1 ms to minimize.
[2022-05-18 00:45:14] [INFO ] Deduced a trap composed of 123 places in 569 ms of which 1 ms to minimize.
[2022-05-18 00:45:15] [INFO ] Deduced a trap composed of 161 places in 611 ms of which 1 ms to minimize.
[2022-05-18 00:45:16] [INFO ] Deduced a trap composed of 161 places in 568 ms of which 1 ms to minimize.
[2022-05-18 00:45:16] [INFO ] Deduced a trap composed of 93 places in 588 ms of which 1 ms to minimize.
[2022-05-18 00:45:17] [INFO ] Deduced a trap composed of 101 places in 574 ms of which 1 ms to minimize.
[2022-05-18 00:45:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4601 ms
[2022-05-18 00:45:18] [INFO ] Deduced a trap composed of 204 places in 488 ms of which 5 ms to minimize.
[2022-05-18 00:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 905 ms
[2022-05-18 00:45:19] [INFO ] After 16225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3783 ms.
[2022-05-18 00:45:23] [INFO ] After 21756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 10 out of 1045 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1045/1045 places, 4322/4322 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1045 transition count 4321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1044 transition count 4321
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1044 transition count 4321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1043 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1043 transition count 4320
Applied a total of 5 rules in 485 ms. Remains 1043 /1045 variables (removed 2) and now considering 4320/4322 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1045 places, 4320/4322 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 61659 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61659 steps, saw 26223 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
[2022-05-18 00:45:27] [INFO ] Flow matrix only has 3922 transitions (discarded 398 similar events)
// Phase 1: matrix 3922 rows 1043 cols
[2022-05-18 00:45:27] [INFO ] Computed 67 place invariants in 27 ms
[2022-05-18 00:45:27] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-18 00:45:28] [INFO ] [Nat]Absence check using 32 positive place invariants in 24 ms returned sat
[2022-05-18 00:45:28] [INFO ] [Nat]Absence check using 32 positive and 35 generalized place invariants in 7 ms returned sat
[2022-05-18 00:45:29] [INFO ] After 1436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-18 00:45:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:45:33] [INFO ] After 3290ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-18 00:45:34] [INFO ] Deduced a trap composed of 207 places in 504 ms of which 1 ms to minimize.
[2022-05-18 00:45:34] [INFO ] Deduced a trap composed of 205 places in 520 ms of which 0 ms to minimize.
[2022-05-18 00:45:35] [INFO ] Deduced a trap composed of 177 places in 517 ms of which 1 ms to minimize.
[2022-05-18 00:45:36] [INFO ] Deduced a trap composed of 224 places in 486 ms of which 2 ms to minimize.
[2022-05-18 00:45:37] [INFO ] Deduced a trap composed of 158 places in 507 ms of which 1 ms to minimize.
[2022-05-18 00:45:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4004 ms
[2022-05-18 00:45:38] [INFO ] Deduced a trap composed of 204 places in 536 ms of which 1 ms to minimize.
[2022-05-18 00:45:39] [INFO ] Deduced a trap composed of 132 places in 487 ms of which 1 ms to minimize.
[2022-05-18 00:45:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1406 ms
[2022-05-18 00:45:41] [INFO ] Deduced a trap composed of 271 places in 506 ms of which 1 ms to minimize.
[2022-05-18 00:45:42] [INFO ] Deduced a trap composed of 118 places in 590 ms of which 1 ms to minimize.
[2022-05-18 00:45:42] [INFO ] Deduced a trap composed of 171 places in 570 ms of which 1 ms to minimize.
[2022-05-18 00:45:43] [INFO ] Deduced a trap composed of 160 places in 575 ms of which 1 ms to minimize.
[2022-05-18 00:45:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2733 ms
[2022-05-18 00:45:46] [INFO ] Deduced a trap composed of 199 places in 468 ms of which 1 ms to minimize.
[2022-05-18 00:45:47] [INFO ] Deduced a trap composed of 204 places in 467 ms of which 1 ms to minimize.
[2022-05-18 00:45:47] [INFO ] Deduced a trap composed of 205 places in 525 ms of which 1 ms to minimize.
[2022-05-18 00:45:48] [INFO ] Deduced a trap composed of 155 places in 506 ms of which 1 ms to minimize.
[2022-05-18 00:45:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3015 ms
[2022-05-18 00:45:48] [INFO ] After 19037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3227 ms.
[2022-05-18 00:45:52] [INFO ] After 24045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 10 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1043/1043 places, 4320/4320 transitions.
Applied a total of 0 rules in 114 ms. Remains 1043 /1043 variables (removed 0) and now considering 4320/4320 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1043/1043 places, 4320/4320 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1043/1043 places, 4320/4320 transitions.
Applied a total of 0 rules in 118 ms. Remains 1043 /1043 variables (removed 0) and now considering 4320/4320 (removed 0) transitions.
[2022-05-18 00:45:52] [INFO ] Flow matrix only has 3922 transitions (discarded 398 similar events)
// Phase 1: matrix 3922 rows 1043 cols
[2022-05-18 00:45:52] [INFO ] Computed 67 place invariants in 32 ms
[2022-05-18 00:45:53] [INFO ] Implicit Places using invariants in 1228 ms returned [363, 404, 470, 471, 583, 605, 673, 674, 740, 857]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1232 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1033/1043 places, 4320/4320 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1030 transition count 4317
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1030 transition count 4317
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1027 transition count 4314
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1027 transition count 4314
Applied a total of 12 rules in 185 ms. Remains 1027 /1033 variables (removed 6) and now considering 4314/4320 (removed 6) transitions.
[2022-05-18 00:45:53] [INFO ] Flow matrix only has 3916 transitions (discarded 398 similar events)
// Phase 1: matrix 3916 rows 1027 cols
[2022-05-18 00:45:53] [INFO ] Computed 57 place invariants in 25 ms
[2022-05-18 00:45:54] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2022-05-18 00:45:54] [INFO ] Flow matrix only has 3916 transitions (discarded 398 similar events)
// Phase 1: matrix 3916 rows 1027 cols
[2022-05-18 00:45:54] [INFO ] Computed 57 place invariants in 34 ms
[2022-05-18 00:45:55] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:46:18] [INFO ] Implicit Places using invariants and state equation in 23995 ms returned []
Implicit Place search using SMT with State Equation took 25185 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1027/1043 places, 4314/4320 transitions.
Finished structural reductions, in 2 iterations. Remains : 1027/1043 places, 4314/4320 transitions.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 475 stabilizing places and 1299 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(X(G(p0))))))'
Support contains 2 out of 1307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1307 transition count 2900
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1275 transition count 2900
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 64 place count 1275 transition count 2875
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 114 place count 1250 transition count 2875
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 124 place count 1240 transition count 2844
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 1240 transition count 2844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 134 place count 1240 transition count 2842
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 1238 transition count 2842
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 145 place count 1231 transition count 2793
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 1231 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 1230 transition count 2785
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 1230 transition count 2785
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 220 place count 1197 transition count 2752
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 229 place count 1188 transition count 2743
Iterating global reduction 2 with 9 rules applied. Total rules applied 238 place count 1188 transition count 2743
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 247 place count 1179 transition count 2671
Iterating global reduction 2 with 9 rules applied. Total rules applied 256 place count 1179 transition count 2671
Applied a total of 256 rules in 397 ms. Remains 1179 /1307 variables (removed 128) and now considering 2671/2932 (removed 261) transitions.
[2022-05-18 00:46:19] [INFO ] Flow matrix only has 2399 transitions (discarded 272 similar events)
// Phase 1: matrix 2399 rows 1179 cols
[2022-05-18 00:46:19] [INFO ] Computed 67 place invariants in 38 ms
[2022-05-18 00:46:20] [INFO ] Implicit Places using invariants in 1064 ms returned [318, 413, 462, 525, 535, 536, 558, 583, 593, 622, 656, 657, 679, 760, 761, 973]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1067 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1163/1307 places, 2671/2932 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1155 transition count 2663
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1155 transition count 2663
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1147 transition count 2655
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1147 transition count 2655
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1142 transition count 2615
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1142 transition count 2615
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1135 transition count 2608
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 1128 transition count 2601
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 1128 transition count 2601
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 1122 transition count 2553
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 1122 transition count 2553
Applied a total of 82 rules in 319 ms. Remains 1122 /1163 variables (removed 41) and now considering 2553/2671 (removed 118) transitions.
[2022-05-18 00:46:20] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:46:20] [INFO ] Computed 51 place invariants in 17 ms
[2022-05-18 00:46:21] [INFO ] Implicit Places using invariants in 895 ms returned []
[2022-05-18 00:46:21] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:46:21] [INFO ] Computed 51 place invariants in 17 ms
[2022-05-18 00:46:22] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:46:30] [INFO ] Implicit Places using invariants and state equation in 8989 ms returned []
Implicit Place search using SMT with State Equation took 9886 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1122/1307 places, 2553/2932 transitions.
Finished structural reductions, in 2 iterations. Remains : 1122/1307 places, 2553/2932 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s525 s829)], 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 1711 reset in 652 ms.
Product exploration explored 100000 steps with 1712 reset in 529 ms.
Computed a total of 307 stabilizing places and 937 stable transitions
Computed a total of 307 stabilizing places and 937 stable transitions
Detected a total of 307/1122 stabilizing places and 937/2553 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 485 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35900 steps, run visited all 1 properties in 1157 ms. (steps per millisecond=31 )
Probabilistic random walk after 35900 steps, saw 15420 distinct states, run finished after 1157 ms. (steps per millisecond=31 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 1352 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 1122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1122/1122 places, 2553/2553 transitions.
Applied a total of 0 rules in 70 ms. Remains 1122 /1122 variables (removed 0) and now considering 2553/2553 (removed 0) transitions.
[2022-05-18 00:46:35] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:46:35] [INFO ] Computed 51 place invariants in 27 ms
[2022-05-18 00:46:36] [INFO ] Implicit Places using invariants in 902 ms returned []
[2022-05-18 00:46:36] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:46:36] [INFO ] Computed 51 place invariants in 17 ms
[2022-05-18 00:46:37] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:46:45] [INFO ] Implicit Places using invariants and state equation in 8938 ms returned []
Implicit Place search using SMT with State Equation took 9842 ms to find 0 implicit places.
[2022-05-18 00:46:45] [INFO ] Redundant transitions in 137 ms returned []
[2022-05-18 00:46:45] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:46:45] [INFO ] Computed 51 place invariants in 35 ms
[2022-05-18 00:46:46] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1122/1122 places, 2553/2553 transitions.
Computed a total of 307 stabilizing places and 937 stable transitions
Computed a total of 307 stabilizing places and 937 stable transitions
Detected a total of 307/1122 stabilizing places and 937/2553 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 793 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35900 steps, run visited all 1 properties in 1203 ms. (steps per millisecond=29 )
Probabilistic random walk after 35900 steps, saw 15420 distinct states, run finished after 1203 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 775 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1711 reset in 530 ms.
Product exploration explored 100000 steps with 1712 reset in 514 ms.
Built C files in :
/tmp/ltsmin518130517029395562
[2022-05-18 00:46:50] [INFO ] Too many transitions (2553) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:46:50] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin518130517029395562
Running compilation step : cd /tmp/ltsmin518130517029395562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin518130517029395562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin518130517029395562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1122/1122 places, 2553/2553 transitions.
Applied a total of 0 rules in 66 ms. Remains 1122 /1122 variables (removed 0) and now considering 2553/2553 (removed 0) transitions.
[2022-05-18 00:46:53] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:46:53] [INFO ] Computed 51 place invariants in 16 ms
[2022-05-18 00:46:54] [INFO ] Implicit Places using invariants in 923 ms returned []
[2022-05-18 00:46:54] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:46:54] [INFO ] Computed 51 place invariants in 16 ms
[2022-05-18 00:46:55] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:47:03] [INFO ] Implicit Places using invariants and state equation in 8756 ms returned []
Implicit Place search using SMT with State Equation took 9680 ms to find 0 implicit places.
[2022-05-18 00:47:03] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-18 00:47:03] [INFO ] Flow matrix only has 2281 transitions (discarded 272 similar events)
// Phase 1: matrix 2281 rows 1122 cols
[2022-05-18 00:47:03] [INFO ] Computed 51 place invariants in 21 ms
[2022-05-18 00:47:04] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1122/1122 places, 2553/2553 transitions.
Built C files in :
/tmp/ltsmin18296194054329619272
[2022-05-18 00:47:04] [INFO ] Too many transitions (2553) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:47:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18296194054329619272
Running compilation step : cd /tmp/ltsmin18296194054329619272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18296194054329619272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18296194054329619272;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 00:47:07] [INFO ] Flatten gal took : 186 ms
[2022-05-18 00:47:07] [INFO ] Flatten gal took : 159 ms
[2022-05-18 00:47:08] [INFO ] Time to serialize gal into /tmp/LTL1132960692723853670.gal : 33 ms
[2022-05-18 00:47:08] [INFO ] Time to serialize properties into /tmp/LTL15773233983574556642.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1132960692723853670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15773233983574556642.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1132960...267
Read 1 LTL properties
Checking formula 0 : !((F(F(X(X(G("(Node7HasTheLeafSetOfRx4ToReplaceNode9<=Node14HasAskedItsLeafSetToRx4ToReplaceNode13)")))))))
Formula 0 simplified : !FXXG"(Node7HasTheLeafSetOfRx4ToReplaceNode9<=Node14HasAskedItsLeafSetToRx4ToReplaceNode13)"
Detected timeout of ITS tools.
[2022-05-18 00:47:23] [INFO ] Flatten gal took : 75 ms
[2022-05-18 00:47:23] [INFO ] Applying decomposition
[2022-05-18 00:47:23] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2810137461039714405.txt' '-o' '/tmp/graph2810137461039714405.bin' '-w' '/tmp/graph2810137461039714405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2810137461039714405.bin' '-l' '-1' '-v' '-w' '/tmp/graph2810137461039714405.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:47:23] [INFO ] Decomposing Gal with order
[2022-05-18 00:47:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:47:23] [INFO ] Removed a total of 385 redundant transitions.
[2022-05-18 00:47:23] [INFO ] Flatten gal took : 192 ms
[2022-05-18 00:47:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-18 00:47:24] [INFO ] Time to serialize gal into /tmp/LTL2288687587572911050.gal : 28 ms
[2022-05-18 00:47:24] [INFO ] Time to serialize properties into /tmp/LTL17018784955565490088.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2288687587572911050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17018784955565490088.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2288687...267
Read 1 LTL properties
Checking formula 0 : !((F(F(X(X(G("(gu16.Node7HasTheLeafSetOfRx4ToReplaceNode9<=gu16.Node14HasAskedItsLeafSetToRx4ToReplaceNode13)")))))))
Formula 0 simplified : !FXXG"(gu16.Node7HasTheLeafSetOfRx4ToReplaceNode9<=gu16.Node14HasAskedItsLeafSetToRx4ToReplaceNode13)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9758526277099323772
[2022-05-18 00:47:39] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9758526277099323772
Running compilation step : cd /tmp/ltsmin9758526277099323772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9758526277099323772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9758526277099323772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-00 finished in 83466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(p0)||p1))))'
Support contains 4 out of 1307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1307 transition count 2902
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1277 transition count 2902
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 60 place count 1277 transition count 2877
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 110 place count 1252 transition count 2877
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 120 place count 1242 transition count 2853
Iterating global reduction 2 with 10 rules applied. Total rules applied 130 place count 1242 transition count 2853
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 130 place count 1242 transition count 2851
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 1240 transition count 2851
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 142 place count 1232 transition count 2794
Iterating global reduction 2 with 8 rules applied. Total rules applied 150 place count 1232 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 1231 transition count 2786
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 1231 transition count 2786
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 218 place count 1198 transition count 2753
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 1191 transition count 2746
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 1191 transition count 2746
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 239 place count 1184 transition count 2690
Iterating global reduction 2 with 7 rules applied. Total rules applied 246 place count 1184 transition count 2690
Applied a total of 246 rules in 457 ms. Remains 1184 /1307 variables (removed 123) and now considering 2690/2932 (removed 242) transitions.
[2022-05-18 00:47:42] [INFO ] Flow matrix only has 2418 transitions (discarded 272 similar events)
// Phase 1: matrix 2418 rows 1184 cols
[2022-05-18 00:47:43] [INFO ] Computed 67 place invariants in 22 ms
[2022-05-18 00:47:44] [INFO ] Implicit Places using invariants in 1056 ms returned [318, 466, 542, 543, 544, 562, 600, 629, 663, 664, 686, 767, 768, 845, 978]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1063 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1169/1307 places, 2690/2932 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1161 transition count 2682
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1161 transition count 2682
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1153 transition count 2674
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1153 transition count 2674
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1149 transition count 2642
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1149 transition count 2642
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 1143 transition count 2636
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 1137 transition count 2630
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 1137 transition count 2630
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 1131 transition count 2582
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 1131 transition count 2582
Applied a total of 76 rules in 343 ms. Remains 1131 /1169 variables (removed 38) and now considering 2582/2690 (removed 108) transitions.
[2022-05-18 00:47:44] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1131 cols
[2022-05-18 00:47:44] [INFO ] Computed 52 place invariants in 18 ms
[2022-05-18 00:47:45] [INFO ] Implicit Places using invariants in 918 ms returned []
[2022-05-18 00:47:45] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1131 cols
[2022-05-18 00:47:45] [INFO ] Computed 52 place invariants in 17 ms
[2022-05-18 00:47:46] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:47:53] [INFO ] Implicit Places using invariants and state equation in 8572 ms returned []
Implicit Place search using SMT with State Equation took 9491 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1131/1307 places, 2582/2932 transitions.
Finished structural reductions, in 2 iterations. Remains : 1131/1307 places, 2582/2932 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-04 automaton TGBA Formula[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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s531 s579), p1:(GT s419 s408)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1709 reset in 542 ms.
Product exploration explored 100000 steps with 1710 reset in 564 ms.
Computed a total of 316 stabilizing places and 966 stable transitions
Computed a total of 316 stabilizing places and 966 stable transitions
Detected a total of 316/1131 stabilizing places and 966/2582 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 2197 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 88225 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88225 steps, saw 37823 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:48:00] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1131 cols
[2022-05-18 00:48:00] [INFO ] Computed 52 place invariants in 25 ms
[2022-05-18 00:48:00] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:48:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-18 00:48:00] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-18 00:48:01] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:01] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:48:01] [INFO ] After 132ms SMT Verify possible using 881 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:02] [INFO ] Deduced a trap composed of 237 places in 400 ms of which 1 ms to minimize.
[2022-05-18 00:48:02] [INFO ] Deduced a trap composed of 275 places in 395 ms of which 1 ms to minimize.
[2022-05-18 00:48:03] [INFO ] Deduced a trap composed of 309 places in 403 ms of which 1 ms to minimize.
[2022-05-18 00:48:03] [INFO ] Deduced a trap composed of 279 places in 393 ms of which 0 ms to minimize.
[2022-05-18 00:48:03] [INFO ] Deduced a trap composed of 298 places in 393 ms of which 1 ms to minimize.
[2022-05-18 00:48:04] [INFO ] Deduced a trap composed of 305 places in 402 ms of which 1 ms to minimize.
[2022-05-18 00:48:04] [INFO ] Deduced a trap composed of 340 places in 409 ms of which 1 ms to minimize.
[2022-05-18 00:48:05] [INFO ] Deduced a trap composed of 288 places in 397 ms of which 1 ms to minimize.
[2022-05-18 00:48:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4050 ms
[2022-05-18 00:48:05] [INFO ] After 4266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-18 00:48:05] [INFO ] After 5219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1131/1131 places, 2582/2582 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1131 transition count 2581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1130 transition count 2581
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 1128 transition count 2572
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1128 transition count 2572
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1127 transition count 2564
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1127 transition count 2564
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 2 with 136 rules applied. Total rules applied 144 place count 1127 transition count 4283
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 280 place count 991 transition count 4283
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 283 place count 991 transition count 4283
Applied a total of 283 rules in 409 ms. Remains 991 /1131 variables (removed 140) and now considering 4283/2582 (removed -1701) transitions.
Finished structural reductions, in 1 iterations. Remains : 991/1131 places, 4283/2582 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 74000 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74000 steps, saw 31229 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:48:09] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 991 cols
[2022-05-18 00:48:09] [INFO ] Computed 52 place invariants in 26 ms
[2022-05-18 00:48:09] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:48:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-18 00:48:09] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-18 00:48:10] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:10] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:48:11] [INFO ] After 385ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:11] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-18 00:48:11] [INFO ] After 1826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 991 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 991/991 places, 4283/4283 transitions.
Applied a total of 0 rules in 112 ms. Remains 991 /991 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 991/991 places, 4283/4283 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 991/991 places, 4283/4283 transitions.
Applied a total of 0 rules in 116 ms. Remains 991 /991 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
[2022-05-18 00:48:11] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 991 cols
[2022-05-18 00:48:11] [INFO ] Computed 52 place invariants in 26 ms
[2022-05-18 00:48:12] [INFO ] Implicit Places using invariants in 1161 ms returned [358]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1165 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 990/991 places, 4283/4283 transitions.
Applied a total of 0 rules in 115 ms. Remains 990 /990 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 990/991 places, 4283/4283 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73550 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73550 steps, saw 31036 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:48:16] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:48:16] [INFO ] Computed 51 place invariants in 26 ms
[2022-05-18 00:48:16] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:48:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 00:48:16] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-18 00:48:17] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:17] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:48:17] [INFO ] After 408ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:18] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-18 00:48:18] [INFO ] After 1783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 990 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 990/990 places, 4283/4283 transitions.
Applied a total of 0 rules in 112 ms. Remains 990 /990 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 990/990 places, 4283/4283 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 990/990 places, 4283/4283 transitions.
Applied a total of 0 rules in 128 ms. Remains 990 /990 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
[2022-05-18 00:48:18] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:48:18] [INFO ] Computed 51 place invariants in 26 ms
[2022-05-18 00:48:19] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2022-05-18 00:48:19] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:48:19] [INFO ] Computed 51 place invariants in 19 ms
[2022-05-18 00:48:20] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:48:40] [INFO ] Implicit Places using invariants and state equation in 20940 ms returned []
Implicit Place search using SMT with State Equation took 22069 ms to find 0 implicit places.
[2022-05-18 00:48:40] [INFO ] Redundant transitions in 292 ms returned []
[2022-05-18 00:48:40] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:48:40] [INFO ] Computed 51 place invariants in 20 ms
[2022-05-18 00:48:42] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 990/990 places, 4283/4283 transitions.
Graph (trivial) has 1056 edges and 990 vertex of which 17 / 990 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4879 edges and 974 vertex of which 960 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1242.t1508 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 943 transition count 3514
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 846 transition count 3321
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 750 transition count 3153
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 678 transition count 3011
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 608 transition count 2891
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 558 transition count 2793
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 510 transition count 2713
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 478 transition count 2651
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 448 transition count 2603
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 430 transition count 2569
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 414 transition count 2545
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 406 transition count 2531
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 400 transition count 2523
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 397 transition count 2521
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 17 Pre rules applied. Total rules applied 1640 place count 397 transition count 2504
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1674 place count 380 transition count 2504
Discarding 282 places :
Symmetric choice reduction at 14 with 282 rule applications. Total rules 1956 place count 98 transition count 367
Iterating global reduction 14 with 282 rules applied. Total rules applied 2238 place count 98 transition count 367
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 237 rules applied. Total rules applied 2475 place count 98 transition count 130
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2482 place count 91 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2482 place count 91 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2484 place count 90 transition count 129
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2495 place count 79 transition count 102
Iterating global reduction 16 with 11 rules applied. Total rules applied 2506 place count 79 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 2511 place count 79 transition count 97
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 2515 place count 75 transition count 91
Iterating global reduction 17 with 4 rules applied. Total rules applied 2519 place count 75 transition count 91
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2520 place count 74 transition count 90
Iterating global reduction 17 with 1 rules applied. Total rules applied 2521 place count 74 transition count 90
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 2531 place count 69 transition count 85
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2532 place count 68 transition count 82
Iterating global reduction 17 with 1 rules applied. Total rules applied 2533 place count 68 transition count 82
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 17 with 14 rules applied. Total rules applied 2547 place count 68 transition count 68
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 17 with 14 rules applied. Total rules applied 2561 place count 54 transition count 68
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 18 with 6 rules applied. Total rules applied 2567 place count 54 transition count 68
Applied a total of 2567 rules in 484 ms. Remains 54 /990 variables (removed 936) and now considering 68/4283 (removed 4215) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 54 cols
[2022-05-18 00:48:42] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-18 00:48:42] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:48:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-18 00:48:42] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-18 00:48:42] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:42] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-18 00:48:42] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:48:42] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:48:42] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:48:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2065834669526234194.gal : 1 ms
[2022-05-18 00:48:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3199689223094708107.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11124914903647959154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2065834669526234194.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3199689223094708107.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3199689223094708107.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 41
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :41 after 92
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :92 after 162
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :162 after 355
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :355 after 3011
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3550,0.066157,5788,2,1654,12,5928,7,0,266,4329,0
Total reachable state count : 3550
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.067001,5788,2,383,12,5928,7,0,272,4329,0
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 369 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1131/1131 places, 2582/2582 transitions.
Applied a total of 0 rules in 36 ms. Remains 1131 /1131 variables (removed 0) and now considering 2582/2582 (removed 0) transitions.
[2022-05-18 00:48:43] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1131 cols
[2022-05-18 00:48:43] [INFO ] Computed 52 place invariants in 25 ms
[2022-05-18 00:48:44] [INFO ] Implicit Places using invariants in 871 ms returned []
[2022-05-18 00:48:44] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1131 cols
[2022-05-18 00:48:44] [INFO ] Computed 52 place invariants in 17 ms
[2022-05-18 00:48:45] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:48:53] [INFO ] Implicit Places using invariants and state equation in 9008 ms returned []
Implicit Place search using SMT with State Equation took 9879 ms to find 0 implicit places.
[2022-05-18 00:48:53] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1131 cols
[2022-05-18 00:48:53] [INFO ] Computed 52 place invariants in 21 ms
[2022-05-18 00:48:54] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1131/1131 places, 2582/2582 transitions.
Computed a total of 316 stabilizing places and 966 stable transitions
Computed a total of 316 stabilizing places and 966 stable transitions
Detected a total of 316/1131 stabilizing places and 966/2582 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 3395 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 89103 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89103 steps, saw 38183 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:49:00] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1131 cols
[2022-05-18 00:49:00] [INFO ] Computed 52 place invariants in 24 ms
[2022-05-18 00:49:00] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:49:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 00:49:01] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-18 00:49:01] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:01] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:49:01] [INFO ] After 135ms SMT Verify possible using 881 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:02] [INFO ] Deduced a trap composed of 237 places in 429 ms of which 1 ms to minimize.
[2022-05-18 00:49:02] [INFO ] Deduced a trap composed of 275 places in 417 ms of which 0 ms to minimize.
[2022-05-18 00:49:03] [INFO ] Deduced a trap composed of 309 places in 416 ms of which 1 ms to minimize.
[2022-05-18 00:49:03] [INFO ] Deduced a trap composed of 279 places in 407 ms of which 1 ms to minimize.
[2022-05-18 00:49:04] [INFO ] Deduced a trap composed of 298 places in 411 ms of which 1 ms to minimize.
[2022-05-18 00:49:04] [INFO ] Deduced a trap composed of 305 places in 410 ms of which 1 ms to minimize.
[2022-05-18 00:49:05] [INFO ] Deduced a trap composed of 340 places in 424 ms of which 1 ms to minimize.
[2022-05-18 00:49:05] [INFO ] Deduced a trap composed of 288 places in 408 ms of which 1 ms to minimize.
[2022-05-18 00:49:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4171 ms
[2022-05-18 00:49:06] [INFO ] After 4365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2022-05-18 00:49:06] [INFO ] After 5272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1131/1131 places, 2582/2582 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1131 transition count 2581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1130 transition count 2581
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 1128 transition count 2572
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1128 transition count 2572
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1127 transition count 2564
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1127 transition count 2564
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 2 with 136 rules applied. Total rules applied 144 place count 1127 transition count 4283
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 280 place count 991 transition count 4283
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 283 place count 991 transition count 4283
Applied a total of 283 rules in 401 ms. Remains 991 /1131 variables (removed 140) and now considering 4283/2582 (removed -1701) transitions.
Finished structural reductions, in 1 iterations. Remains : 991/1131 places, 4283/2582 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 74002 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74002 steps, saw 31229 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:49:09] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 991 cols
[2022-05-18 00:49:09] [INFO ] Computed 52 place invariants in 23 ms
[2022-05-18 00:49:10] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:49:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-18 00:49:10] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-18 00:49:11] [INFO ] After 998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:49:11] [INFO ] After 372ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:11] [INFO ] After 530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-18 00:49:11] [INFO ] After 1786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 991 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 991/991 places, 4283/4283 transitions.
Applied a total of 0 rules in 122 ms. Remains 991 /991 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 991/991 places, 4283/4283 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 991/991 places, 4283/4283 transitions.
Applied a total of 0 rules in 119 ms. Remains 991 /991 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
[2022-05-18 00:49:12] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 991 cols
[2022-05-18 00:49:12] [INFO ] Computed 52 place invariants in 26 ms
[2022-05-18 00:49:13] [INFO ] Implicit Places using invariants in 1139 ms returned [358]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1143 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 990/991 places, 4283/4283 transitions.
Applied a total of 0 rules in 113 ms. Remains 990 /990 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 990/991 places, 4283/4283 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73998 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73998 steps, saw 31228 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:49:16] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:49:16] [INFO ] Computed 51 place invariants in 19 ms
[2022-05-18 00:49:16] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:49:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-18 00:49:16] [INFO ] [Nat]Absence check using 31 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-18 00:49:17] [INFO ] After 920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:17] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:49:18] [INFO ] After 408ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:18] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-18 00:49:18] [INFO ] After 1740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 990 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 990/990 places, 4283/4283 transitions.
Applied a total of 0 rules in 122 ms. Remains 990 /990 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 990/990 places, 4283/4283 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 990/990 places, 4283/4283 transitions.
Applied a total of 0 rules in 111 ms. Remains 990 /990 variables (removed 0) and now considering 4283/4283 (removed 0) transitions.
[2022-05-18 00:49:18] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:49:18] [INFO ] Computed 51 place invariants in 24 ms
[2022-05-18 00:49:19] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2022-05-18 00:49:19] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:49:19] [INFO ] Computed 51 place invariants in 19 ms
[2022-05-18 00:49:20] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2022-05-18 00:49:40] [INFO ] Implicit Places using invariants and state equation in 20533 ms returned []
Implicit Place search using SMT with State Equation took 21640 ms to find 0 implicit places.
[2022-05-18 00:49:40] [INFO ] Redundant transitions in 206 ms returned []
[2022-05-18 00:49:40] [INFO ] Flow matrix only has 3885 transitions (discarded 398 similar events)
// Phase 1: matrix 3885 rows 990 cols
[2022-05-18 00:49:40] [INFO ] Computed 51 place invariants in 23 ms
[2022-05-18 00:49:41] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 990/990 places, 4283/4283 transitions.
Graph (trivial) has 1056 edges and 990 vertex of which 17 / 990 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4879 edges and 974 vertex of which 960 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1242.t1508 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 943 transition count 3514
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 846 transition count 3321
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 750 transition count 3153
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 678 transition count 3011
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 608 transition count 2891
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 558 transition count 2793
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 510 transition count 2713
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 478 transition count 2651
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 448 transition count 2603
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 430 transition count 2569
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 414 transition count 2545
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 406 transition count 2531
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 400 transition count 2523
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 397 transition count 2521
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 17 Pre rules applied. Total rules applied 1640 place count 397 transition count 2504
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1674 place count 380 transition count 2504
Discarding 282 places :
Symmetric choice reduction at 14 with 282 rule applications. Total rules 1956 place count 98 transition count 367
Iterating global reduction 14 with 282 rules applied. Total rules applied 2238 place count 98 transition count 367
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 237 rules applied. Total rules applied 2475 place count 98 transition count 130
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2482 place count 91 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2482 place count 91 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2484 place count 90 transition count 129
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2495 place count 79 transition count 102
Iterating global reduction 16 with 11 rules applied. Total rules applied 2506 place count 79 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 2511 place count 79 transition count 97
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 2515 place count 75 transition count 91
Iterating global reduction 17 with 4 rules applied. Total rules applied 2519 place count 75 transition count 91
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2520 place count 74 transition count 90
Iterating global reduction 17 with 1 rules applied. Total rules applied 2521 place count 74 transition count 90
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 2531 place count 69 transition count 85
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2532 place count 68 transition count 82
Iterating global reduction 17 with 1 rules applied. Total rules applied 2533 place count 68 transition count 82
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 17 with 14 rules applied. Total rules applied 2547 place count 68 transition count 68
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 17 with 14 rules applied. Total rules applied 2561 place count 54 transition count 68
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 18 with 6 rules applied. Total rules applied 2567 place count 54 transition count 68
Applied a total of 2567 rules in 379 ms. Remains 54 /990 variables (removed 936) and now considering 68/4283 (removed 4215) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 54 cols
[2022-05-18 00:49:42] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-18 00:49:42] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:49:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-18 00:49:42] [INFO ] [Nat]Absence check using 2 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-18 00:49:42] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:42] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-18 00:49:42] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:49:42] [INFO ] Flatten gal took : 8 ms
[2022-05-18 00:49:42] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:49:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7766196070665752453.gal : 1 ms
[2022-05-18 00:49:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18184892498110216526.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3116452507213885535;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7766196070665752453.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18184892498110216526.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18184892498110216526.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 41
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :41 after 92
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :92 after 162
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :162 after 355
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :355 after 3011
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3550,0.059531,5736,2,1654,12,5928,7,0,266,4329,0
Total reachable state count : 3550
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.060425,6000,2,383,12,5928,7,0,272,4329,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1678 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1711 reset in 495 ms.
Product exploration explored 100000 steps with 1707 reset in 510 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1131/1131 places, 2582/2582 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1131 transition count 2582
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1129 transition count 2573
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1129 transition count 2573
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1128 transition count 2565
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1128 transition count 2565
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 7 rules in 384 ms. Remains 1128 /1131 variables (removed 3) and now considering 2565/2582 (removed 17) transitions.
[2022-05-18 00:49:46] [INFO ] Redundant transitions in 79 ms returned []
[2022-05-18 00:49:46] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
// Phase 1: matrix 2293 rows 1128 cols
[2022-05-18 00:49:46] [INFO ] Computed 52 place invariants in 23 ms
[2022-05-18 00:49:47] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1128/1131 places, 2565/2582 transitions.
Finished structural reductions, in 1 iterations. Remains : 1128/1131 places, 2565/2582 transitions.
Product exploration explored 100000 steps with 1709 reset in 807 ms.
Product exploration explored 100000 steps with 1708 reset in 772 ms.
Built C files in :
/tmp/ltsmin5170139216024460400
[2022-05-18 00:49:49] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5170139216024460400
Running compilation step : cd /tmp/ltsmin5170139216024460400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5170139216024460400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5170139216024460400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1131/1131 places, 2582/2582 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1130 transition count 2574
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1130 transition count 2574
Applied a total of 2 rules in 79 ms. Remains 1130 /1131 variables (removed 1) and now considering 2574/2582 (removed 8) transitions.
[2022-05-18 00:49:52] [INFO ] Flow matrix only has 2302 transitions (discarded 272 similar events)
// Phase 1: matrix 2302 rows 1130 cols
[2022-05-18 00:49:52] [INFO ] Computed 52 place invariants in 23 ms
[2022-05-18 00:49:53] [INFO ] Implicit Places using invariants in 861 ms returned []
[2022-05-18 00:49:53] [INFO ] Flow matrix only has 2302 transitions (discarded 272 similar events)
// Phase 1: matrix 2302 rows 1130 cols
[2022-05-18 00:49:53] [INFO ] Computed 52 place invariants in 16 ms
[2022-05-18 00:49:54] [INFO ] State equation strengthened by 874 read => feed constraints.
[2022-05-18 00:50:01] [INFO ] Implicit Places using invariants and state equation in 8586 ms returned []
Implicit Place search using SMT with State Equation took 9448 ms to find 0 implicit places.
[2022-05-18 00:50:01] [INFO ] Flow matrix only has 2302 transitions (discarded 272 similar events)
// Phase 1: matrix 2302 rows 1130 cols
[2022-05-18 00:50:01] [INFO ] Computed 52 place invariants in 24 ms
[2022-05-18 00:50:03] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1130/1131 places, 2574/2582 transitions.
Finished structural reductions, in 1 iterations. Remains : 1130/1131 places, 2574/2582 transitions.
Built C files in :
/tmp/ltsmin15084207111855909280
[2022-05-18 00:50:03] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15084207111855909280
Running compilation step : cd /tmp/ltsmin15084207111855909280;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15084207111855909280;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15084207111855909280;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 00:50:06] [INFO ] Flatten gal took : 66 ms
[2022-05-18 00:50:06] [INFO ] Flatten gal took : 66 ms
[2022-05-18 00:50:06] [INFO ] Time to serialize gal into /tmp/LTL4996374847536507467.gal : 9 ms
[2022-05-18 00:50:06] [INFO ] Time to serialize properties into /tmp/LTL6771792866639043580.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4996374847536507467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6771792866639043580.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4996374...266
Read 1 LTL properties
Checking formula 0 : !((G(G((G("(Node7HasTheLeafSetOfLx6ToReplaceNode5<=Node9HasTheLeafSetOfLx1ToReplaceNode5)"))||("(Node4HasTheLeafSetOfLx2ToReplaceNode5...189
Formula 0 simplified : !G("(Node4HasTheLeafSetOfLx2ToReplaceNode5>Node4ManageTheCrashOfNode0)" | G"(Node7HasTheLeafSetOfLx6ToReplaceNode5<=Node9HasTheLeafS...179
Detected timeout of ITS tools.
[2022-05-18 00:50:21] [INFO ] Flatten gal took : 63 ms
[2022-05-18 00:50:21] [INFO ] Applying decomposition
[2022-05-18 00:50:21] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11208615061982043488.txt' '-o' '/tmp/graph11208615061982043488.bin' '-w' '/tmp/graph11208615061982043488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11208615061982043488.bin' '-l' '-1' '-v' '-w' '/tmp/graph11208615061982043488.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:50:21] [INFO ] Decomposing Gal with order
[2022-05-18 00:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:50:21] [INFO ] Removed a total of 135 redundant transitions.
[2022-05-18 00:50:21] [INFO ] Flatten gal took : 95 ms
[2022-05-18 00:50:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 6 ms.
[2022-05-18 00:50:21] [INFO ] Time to serialize gal into /tmp/LTL18121256352346788947.gal : 73 ms
[2022-05-18 00:50:22] [INFO ] Time to serialize properties into /tmp/LTL6872770752538953762.ltl : 69 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18121256352346788947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6872770752538953762.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1812125...267
Read 1 LTL properties
Checking formula 0 : !((G(G((G("(gu8.Node7HasTheLeafSetOfLx6ToReplaceNode5<=gu8.Node9HasTheLeafSetOfLx1ToReplaceNode5)"))||("(gu6.Node4HasTheLeafSetOfLx2To...205
Formula 0 simplified : !G("(gu6.Node4HasTheLeafSetOfLx2ToReplaceNode5>gu6.Node4ManageTheCrashOfNode0)" | G"(gu8.Node7HasTheLeafSetOfLx6ToReplaceNode5<=gu8....195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11820071021932841235
[2022-05-18 00:50:37] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11820071021932841235
Running compilation step : cd /tmp/ltsmin11820071021932841235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11820071021932841235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11820071021932841235;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-04 finished in 177561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(!p0)))))'
Support contains 2 out of 1307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1288 transition count 2892
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1288 transition count 2892
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 1272 transition count 2827
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 1272 transition count 2827
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 1263 transition count 2762
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 1263 transition count 2762
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1262 transition count 2754
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1262 transition count 2754
Applied a total of 90 rules in 198 ms. Remains 1262 /1307 variables (removed 45) and now considering 2754/2932 (removed 178) transitions.
[2022-05-18 00:50:40] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1262 cols
[2022-05-18 00:50:40] [INFO ] Computed 67 place invariants in 28 ms
[2022-05-18 00:50:41] [INFO ] Implicit Places using invariants in 1012 ms returned [353, 451, 502, 568, 579, 580, 606, 633, 643, 714, 715, 740, 823, 824, 904, 1039]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1246/1307 places, 2754/2932 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1231 transition count 2739
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1231 transition count 2739
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1216 transition count 2724
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1216 transition count 2724
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1201 transition count 2709
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1201 transition count 2709
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 1190 transition count 2621
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 1190 transition count 2621
Applied a total of 112 rules in 217 ms. Remains 1190 /1246 variables (removed 56) and now considering 2621/2754 (removed 133) transitions.
[2022-05-18 00:50:41] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
// Phase 1: matrix 2349 rows 1190 cols
[2022-05-18 00:50:41] [INFO ] Computed 51 place invariants in 26 ms
[2022-05-18 00:50:42] [INFO ] Implicit Places using invariants in 876 ms returned []
[2022-05-18 00:50:42] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
// Phase 1: matrix 2349 rows 1190 cols
[2022-05-18 00:50:42] [INFO ] Computed 51 place invariants in 29 ms
[2022-05-18 00:50:43] [INFO ] State equation strengthened by 860 read => feed constraints.
[2022-05-18 00:50:52] [INFO ] Implicit Places using invariants and state equation in 10079 ms returned [1145]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10962 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1189/1307 places, 2621/2932 transitions.
Applied a total of 0 rules in 36 ms. Remains 1189 /1189 variables (removed 0) and now considering 2621/2621 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1189/1307 places, 2621/2932 transitions.
Stuttering acceptance computed with spot in 104 ms :[p0, true, true, true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s647 s569)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-05 finished in 12554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&G(X(F(!p0))))))'
Support contains 2 out of 1307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1307 transition count 2901
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1276 transition count 2901
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 1276 transition count 2876
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 112 place count 1251 transition count 2876
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 1241 transition count 2845
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 1241 transition count 2845
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 132 place count 1241 transition count 2844
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 1240 transition count 2844
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 141 place count 1233 transition count 2788
Iterating global reduction 2 with 7 rules applied. Total rules applied 148 place count 1233 transition count 2788
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 216 place count 1199 transition count 2754
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 225 place count 1190 transition count 2745
Iterating global reduction 2 with 9 rules applied. Total rules applied 234 place count 1190 transition count 2745
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 243 place count 1181 transition count 2673
Iterating global reduction 2 with 9 rules applied. Total rules applied 252 place count 1181 transition count 2673
Applied a total of 252 rules in 325 ms. Remains 1181 /1307 variables (removed 126) and now considering 2673/2932 (removed 259) transitions.
[2022-05-18 00:50:52] [INFO ] Flow matrix only has 2401 transitions (discarded 272 similar events)
// Phase 1: matrix 2401 rows 1181 cols
[2022-05-18 00:50:52] [INFO ] Computed 67 place invariants in 29 ms
[2022-05-18 00:50:53] [INFO ] Implicit Places using invariants in 957 ms returned [319, 417, 466, 529, 539, 540, 541, 559, 584, 594, 623, 657, 658, 680, 761, 842, 975]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 959 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1164/1307 places, 2673/2932 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1157 transition count 2666
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1157 transition count 2666
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1150 transition count 2659
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1150 transition count 2659
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1148 transition count 2643
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1148 transition count 2643
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 50 place count 1139 transition count 2634
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 1130 transition count 2625
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 1130 transition count 2625
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 1120 transition count 2545
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 1120 transition count 2545
Applied a total of 88 rules in 292 ms. Remains 1120 /1164 variables (removed 44) and now considering 2545/2673 (removed 128) transitions.
[2022-05-18 00:50:54] [INFO ] Flow matrix only has 2273 transitions (discarded 272 similar events)
// Phase 1: matrix 2273 rows 1120 cols
[2022-05-18 00:50:54] [INFO ] Computed 50 place invariants in 16 ms
[2022-05-18 00:50:55] [INFO ] Implicit Places using invariants in 822 ms returned []
[2022-05-18 00:50:55] [INFO ] Flow matrix only has 2273 transitions (discarded 272 similar events)
// Phase 1: matrix 2273 rows 1120 cols
[2022-05-18 00:50:55] [INFO ] Computed 50 place invariants in 17 ms
[2022-05-18 00:50:55] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 00:51:04] [INFO ] Implicit Places using invariants and state equation in 9114 ms returned [1088]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9939 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1119/1307 places, 2545/2932 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1119 transition count 2544
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1118 transition count 2544
Applied a total of 2 rules in 71 ms. Remains 1118 /1119 variables (removed 1) and now considering 2544/2545 (removed 1) transitions.
[2022-05-18 00:51:04] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
// Phase 1: matrix 2272 rows 1118 cols
[2022-05-18 00:51:04] [INFO ] Computed 49 place invariants in 31 ms
[2022-05-18 00:51:05] [INFO ] Implicit Places using invariants in 855 ms returned []
[2022-05-18 00:51:05] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
// Phase 1: matrix 2272 rows 1118 cols
[2022-05-18 00:51:05] [INFO ] Computed 49 place invariants in 30 ms
[2022-05-18 00:51:05] [INFO ] State equation strengthened by 853 read => feed constraints.
[2022-05-18 00:51:13] [INFO ] Implicit Places using invariants and state equation in 8858 ms returned []
Implicit Place search using SMT with State Equation took 9725 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1118/1307 places, 2544/2932 transitions.
Finished structural reductions, in 3 iterations. Remains : 1118/1307 places, 2544/2932 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s405 s733)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-06 finished in 21430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||G(p1)))&&G(X(X(p1)))))'
Support contains 3 out of 1307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1287 transition count 2891
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1287 transition count 2891
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1270 transition count 2832
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1270 transition count 2832
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 85 place count 1259 transition count 2751
Iterating global reduction 0 with 11 rules applied. Total rules applied 96 place count 1259 transition count 2751
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 1258 transition count 2743
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 1258 transition count 2743
Applied a total of 98 rules in 178 ms. Remains 1258 /1307 variables (removed 49) and now considering 2743/2932 (removed 189) transitions.
[2022-05-18 00:51:14] [INFO ] Flow matrix only has 2471 transitions (discarded 272 similar events)
// Phase 1: matrix 2471 rows 1258 cols
[2022-05-18 00:51:14] [INFO ] Computed 67 place invariants in 30 ms
[2022-05-18 00:51:15] [INFO ] Implicit Places using invariants in 987 ms returned [353, 451, 502, 568, 578, 579, 580, 603, 630, 640, 672, 709, 736, 819, 820, 900, 1035]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 995 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1307 places, 2743/2932 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1225 transition count 2727
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1225 transition count 2727
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1209 transition count 2711
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1209 transition count 2711
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1193 transition count 2695
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1193 transition count 2695
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 108 place count 1181 transition count 2599
Iterating global reduction 0 with 12 rules applied. Total rules applied 120 place count 1181 transition count 2599
Applied a total of 120 rules in 174 ms. Remains 1181 /1241 variables (removed 60) and now considering 2599/2743 (removed 144) transitions.
[2022-05-18 00:51:15] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2022-05-18 00:51:15] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 00:51:16] [INFO ] Implicit Places using invariants in 875 ms returned []
[2022-05-18 00:51:16] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2022-05-18 00:51:16] [INFO ] Computed 50 place invariants in 18 ms
[2022-05-18 00:51:17] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 00:51:26] [INFO ] Implicit Places using invariants and state equation in 10050 ms returned [1137]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10928 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1180/1307 places, 2599/2932 transitions.
Applied a total of 0 rules in 36 ms. Remains 1180 /1180 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1180/1307 places, 2599/2932 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 1 s473), p0:(LEQ s677 s84)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-09 finished in 12542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 1307 transition count 2899
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1274 transition count 2899
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 66 place count 1274 transition count 2874
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 116 place count 1249 transition count 2874
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 126 place count 1239 transition count 2843
Iterating global reduction 2 with 10 rules applied. Total rules applied 136 place count 1239 transition count 2843
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 136 place count 1239 transition count 2842
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 1238 transition count 2842
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 145 place count 1231 transition count 2793
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 1231 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 1230 transition count 2785
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 1230 transition count 2785
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 222 place count 1196 transition count 2751
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 232 place count 1186 transition count 2741
Iterating global reduction 2 with 10 rules applied. Total rules applied 242 place count 1186 transition count 2741
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 252 place count 1176 transition count 2661
Iterating global reduction 2 with 10 rules applied. Total rules applied 262 place count 1176 transition count 2661
Applied a total of 262 rules in 366 ms. Remains 1176 /1307 variables (removed 131) and now considering 2661/2932 (removed 271) transitions.
[2022-05-18 00:51:26] [INFO ] Flow matrix only has 2389 transitions (discarded 272 similar events)
// Phase 1: matrix 2389 rows 1176 cols
[2022-05-18 00:51:27] [INFO ] Computed 67 place invariants in 33 ms
[2022-05-18 00:51:27] [INFO ] Implicit Places using invariants in 942 ms returned [319, 414, 463, 526, 536, 537, 538, 556, 581, 622, 656, 657, 679, 760, 761, 838, 971]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 946 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1159/1307 places, 2661/2932 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1152 transition count 2654
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1152 transition count 2654
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1145 transition count 2647
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1145 transition count 2647
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1142 transition count 2623
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1142 transition count 2623
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 52 place count 1133 transition count 2614
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1124 transition count 2605
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1124 transition count 2605
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 1115 transition count 2533
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 1115 transition count 2533
Applied a total of 88 rules in 303 ms. Remains 1115 /1159 variables (removed 44) and now considering 2533/2661 (removed 128) transitions.
[2022-05-18 00:51:28] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1115 cols
[2022-05-18 00:51:28] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 00:51:29] [INFO ] Implicit Places using invariants in 879 ms returned []
[2022-05-18 00:51:29] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1115 cols
[2022-05-18 00:51:29] [INFO ] Computed 50 place invariants in 21 ms
[2022-05-18 00:51:29] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 00:51:37] [INFO ] Implicit Places using invariants and state equation in 7934 ms returned []
Implicit Place search using SMT with State Equation took 8815 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1115/1307 places, 2533/2932 transitions.
Finished structural reductions, in 2 iterations. Remains : 1115/1307 places, 2533/2932 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s863 s575)], 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 61 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-11 finished in 10491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 1307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1289 transition count 2893
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1289 transition count 2893
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 1274 transition count 2843
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 1274 transition count 2843
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1264 transition count 2770
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1264 transition count 2770
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1263 transition count 2762
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1263 transition count 2762
Applied a total of 88 rules in 179 ms. Remains 1263 /1307 variables (removed 44) and now considering 2762/2932 (removed 170) transitions.
[2022-05-18 00:51:37] [INFO ] Flow matrix only has 2490 transitions (discarded 272 similar events)
// Phase 1: matrix 2490 rows 1263 cols
[2022-05-18 00:51:37] [INFO ] Computed 67 place invariants in 29 ms
[2022-05-18 00:51:38] [INFO ] Implicit Places using invariants in 955 ms returned [453, 504, 570, 580, 581, 582, 634, 644, 676, 712, 741, 824, 825, 905, 1040]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 956 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1248/1307 places, 2762/2932 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1234 transition count 2748
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1234 transition count 2748
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1220 transition count 2734
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1220 transition count 2734
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1206 transition count 2720
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1206 transition count 2720
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 1196 transition count 2640
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 1196 transition count 2640
Applied a total of 104 rules in 192 ms. Remains 1196 /1248 variables (removed 52) and now considering 2640/2762 (removed 122) transitions.
[2022-05-18 00:51:38] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1196 cols
[2022-05-18 00:51:38] [INFO ] Computed 52 place invariants in 26 ms
[2022-05-18 00:51:39] [INFO ] Implicit Places using invariants in 884 ms returned []
[2022-05-18 00:51:39] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1196 cols
[2022-05-18 00:51:39] [INFO ] Computed 52 place invariants in 20 ms
[2022-05-18 00:51:40] [INFO ] State equation strengthened by 874 read => feed constraints.
[2022-05-18 00:51:50] [INFO ] Implicit Places using invariants and state equation in 11409 ms returned []
Implicit Place search using SMT with State Equation took 12294 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1196/1307 places, 2640/2932 transitions.
Finished structural reductions, in 2 iterations. Remains : 1196/1307 places, 2640/2932 transitions.
Stuttering acceptance computed with spot in 464 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s591) (LEQ s679 s363)), p1:(LEQ s679 s363)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1293 ms.
Product exploration explored 100000 steps with 50000 reset in 1323 ms.
Computed a total of 364 stabilizing places and 1007 stable transitions
Computed a total of 364 stabilizing places and 1007 stable transitions
Detected a total of 364/1196 stabilizing places and 1007/2640 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 10 factoid took 159 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-12 finished in 16886 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(F(X((X(p0)||p1))))))) U !X(F(p2))))'
Support contains 5 out of 1307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1290 transition count 2901
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1290 transition count 2901
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 1275 transition count 2851
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 1275 transition count 2851
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 1265 transition count 2778
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 1265 transition count 2778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1264 transition count 2770
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1264 transition count 2770
Applied a total of 86 rules in 177 ms. Remains 1264 /1307 variables (removed 43) and now considering 2770/2932 (removed 162) transitions.
[2022-05-18 00:51:54] [INFO ] Flow matrix only has 2498 transitions (discarded 272 similar events)
// Phase 1: matrix 2498 rows 1264 cols
[2022-05-18 00:51:54] [INFO ] Computed 67 place invariants in 30 ms
[2022-05-18 00:51:55] [INFO ] Implicit Places using invariants in 993 ms returned [353, 451, 502, 569, 579, 581, 607, 634, 644, 676, 712, 713, 824, 906, 1041]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 995 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1249/1307 places, 2770/2932 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1235 transition count 2756
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1235 transition count 2756
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1221 transition count 2742
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1221 transition count 2742
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1207 transition count 2728
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1207 transition count 2728
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 1197 transition count 2648
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 1197 transition count 2648
Applied a total of 104 rules in 173 ms. Remains 1197 /1249 variables (removed 52) and now considering 2648/2770 (removed 122) transitions.
[2022-05-18 00:51:55] [INFO ] Flow matrix only has 2376 transitions (discarded 272 similar events)
// Phase 1: matrix 2376 rows 1197 cols
[2022-05-18 00:51:55] [INFO ] Computed 52 place invariants in 27 ms
[2022-05-18 00:51:56] [INFO ] Implicit Places using invariants in 892 ms returned []
[2022-05-18 00:51:56] [INFO ] Flow matrix only has 2376 transitions (discarded 272 similar events)
// Phase 1: matrix 2376 rows 1197 cols
[2022-05-18 00:51:56] [INFO ] Computed 52 place invariants in 17 ms
[2022-05-18 00:51:57] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:52:06] [INFO ] Implicit Places using invariants and state equation in 9901 ms returned []
Implicit Place search using SMT with State Equation took 10794 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1197/1307 places, 2648/2932 transitions.
Finished structural reductions, in 2 iterations. Remains : 1197/1307 places, 2648/2932 transitions.
Stuttering acceptance computed with spot in 126 ms :[p2, p2, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s513 s778), p1:(LEQ 1 s699), p0:(LEQ s542 s575)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25025 reset in 983 ms.
Product exploration explored 100000 steps with 24934 reset in 969 ms.
Computed a total of 365 stabilizing places and 1015 stable transitions
Computed a total of 365 stabilizing places and 1015 stable transitions
Detected a total of 365/1197 stabilizing places and 1015/2648 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 650 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR p2 (AND (NOT p0) (NOT p1))), p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-18 00:52:09] [INFO ] Flow matrix only has 2376 transitions (discarded 272 similar events)
// Phase 1: matrix 2376 rows 1197 cols
[2022-05-18 00:52:09] [INFO ] Computed 52 place invariants in 27 ms
[2022-05-18 00:52:09] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 00:52:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:52:09] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-18 00:52:10] [INFO ] After 751ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-18 00:52:10] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:52:10] [INFO ] After 270ms SMT Verify possible using 881 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-18 00:52:11] [INFO ] Deduced a trap composed of 337 places in 472 ms of which 2 ms to minimize.
[2022-05-18 00:52:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 600 ms
[2022-05-18 00:52:11] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-18 00:52:11] [INFO ] After 1936ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1197 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1197/1197 places, 2648/2648 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1197 transition count 2618
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1167 transition count 2618
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 60 place count 1167 transition count 2600
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 96 place count 1149 transition count 2600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1147 transition count 2591
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1147 transition count 2591
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 100 place count 1147 transition count 2590
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 1146 transition count 2590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1145 transition count 2582
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1145 transition count 2582
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 144 place count 1125 transition count 2562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 1124 transition count 2561
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 1124 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 1123 transition count 2553
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 1123 transition count 2553
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 2 with 134 rules applied. Total rules applied 282 place count 1123 transition count 4281
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 2 with 134 rules applied. Total rules applied 416 place count 989 transition count 4281
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 418 place count 989 transition count 4281
Applied a total of 418 rules in 568 ms. Remains 989 /1197 variables (removed 208) and now considering 4281/2648 (removed -1633) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/1197 places, 4281/2648 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37214 steps, run visited all 1 properties in 1486 ms. (steps per millisecond=25 )
Probabilistic random walk after 37214 steps, saw 15849 distinct states, run finished after 1486 ms. (steps per millisecond=25 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 786 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[p2]
Stuttering acceptance computed with spot in 32 ms :[p2]
[2022-05-18 00:52:14] [INFO ] Flow matrix only has 2376 transitions (discarded 272 similar events)
// Phase 1: matrix 2376 rows 1197 cols
[2022-05-18 00:52:14] [INFO ] Computed 52 place invariants in 18 ms
[2022-05-18 00:52:16] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2022-05-18 00:52:16] [INFO ] [Real]Absence check using 31 positive and 21 generalized place invariants in 35 ms returned sat
[2022-05-18 00:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:52:20] [INFO ] [Real]Absence check using state equation in 3553 ms returned sat
[2022-05-18 00:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:52:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 199 ms returned sat
[2022-05-18 00:52:22] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 14 ms returned sat
[2022-05-18 00:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:52:24] [INFO ] [Nat]Absence check using state equation in 2095 ms returned sat
[2022-05-18 00:52:24] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:52:24] [INFO ] [Nat]Added 881 Read/Feed constraints in 153 ms returned sat
[2022-05-18 00:52:25] [INFO ] Deduced a trap composed of 141 places in 482 ms of which 1 ms to minimize.
[2022-05-18 00:52:25] [INFO ] Deduced a trap composed of 145 places in 465 ms of which 1 ms to minimize.
[2022-05-18 00:52:26] [INFO ] Deduced a trap composed of 105 places in 461 ms of which 1 ms to minimize.
[2022-05-18 00:52:26] [INFO ] Deduced a trap composed of 112 places in 446 ms of which 1 ms to minimize.
[2022-05-18 00:52:27] [INFO ] Deduced a trap composed of 153 places in 471 ms of which 1 ms to minimize.
[2022-05-18 00:52:28] [INFO ] Deduced a trap composed of 152 places in 469 ms of which 1 ms to minimize.
[2022-05-18 00:52:28] [INFO ] Deduced a trap composed of 152 places in 462 ms of which 1 ms to minimize.
[2022-05-18 00:52:29] [INFO ] Deduced a trap composed of 116 places in 448 ms of which 1 ms to minimize.
[2022-05-18 00:52:29] [INFO ] Deduced a trap composed of 110 places in 477 ms of which 1 ms to minimize.
[2022-05-18 00:52:30] [INFO ] Deduced a trap composed of 142 places in 457 ms of which 1 ms to minimize.
[2022-05-18 00:52:31] [INFO ] Deduced a trap composed of 108 places in 466 ms of which 1 ms to minimize.
[2022-05-18 00:52:31] [INFO ] Deduced a trap composed of 121 places in 452 ms of which 1 ms to minimize.
[2022-05-18 00:52:32] [INFO ] Deduced a trap composed of 113 places in 453 ms of which 1 ms to minimize.
[2022-05-18 00:52:32] [INFO ] Deduced a trap composed of 110 places in 460 ms of which 0 ms to minimize.
[2022-05-18 00:52:33] [INFO ] Deduced a trap composed of 142 places in 456 ms of which 1 ms to minimize.
[2022-05-18 00:52:33] [INFO ] Deduced a trap composed of 108 places in 457 ms of which 1 ms to minimize.
[2022-05-18 00:52:34] [INFO ] Deduced a trap composed of 194 places in 452 ms of which 1 ms to minimize.
[2022-05-18 00:52:34] [INFO ] Deduced a trap composed of 122 places in 446 ms of which 1 ms to minimize.
[2022-05-18 00:52:35] [INFO ] Deduced a trap composed of 122 places in 475 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 00:52:35] [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 EG p2
Could not prove EG p2
Support contains 2 out of 1197 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1197/1197 places, 2648/2648 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 1197 transition count 2619
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1168 transition count 2619
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 58 place count 1168 transition count 2601
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 94 place count 1150 transition count 2601
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 136 place count 1129 transition count 2580
Applied a total of 136 rules in 128 ms. Remains 1129 /1197 variables (removed 68) and now considering 2580/2648 (removed 68) transitions.
[2022-05-18 00:52:35] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1129 cols
[2022-05-18 00:52:35] [INFO ] Computed 52 place invariants in 18 ms
[2022-05-18 00:52:36] [INFO ] Implicit Places using invariants in 850 ms returned []
[2022-05-18 00:52:36] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1129 cols
[2022-05-18 00:52:36] [INFO ] Computed 52 place invariants in 18 ms
[2022-05-18 00:52:37] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:52:45] [INFO ] Implicit Places using invariants and state equation in 9179 ms returned []
Implicit Place search using SMT with State Equation took 10032 ms to find 0 implicit places.
[2022-05-18 00:52:45] [INFO ] Redundant transitions in 86 ms returned []
[2022-05-18 00:52:45] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1129 cols
[2022-05-18 00:52:45] [INFO ] Computed 52 place invariants in 38 ms
[2022-05-18 00:52:46] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1129/1197 places, 2580/2648 transitions.
Finished structural reductions, in 1 iterations. Remains : 1129/1197 places, 2580/2648 transitions.
Computed a total of 314 stabilizing places and 964 stable transitions
Computed a total of 314 stabilizing places and 964 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[p2]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91284 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91284 steps, saw 38884 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:52:49] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1129 cols
[2022-05-18 00:52:49] [INFO ] Computed 52 place invariants in 24 ms
[2022-05-18 00:52:50] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 00:52:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:52:50] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-18 00:52:50] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 00:52:50] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:52:51] [INFO ] After 215ms SMT Verify possible using 881 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 00:52:51] [INFO ] Deduced a trap composed of 292 places in 398 ms of which 1 ms to minimize.
[2022-05-18 00:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2022-05-18 00:52:51] [INFO ] After 793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-18 00:52:51] [INFO ] After 1713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1129/1129 places, 2580/2580 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1129 transition count 2579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1128 transition count 2579
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 1125 transition count 2569
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 1125 transition count 2569
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1123 transition count 2553
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1123 transition count 2553
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 2 with 134 rules applied. Total rules applied 146 place count 1123 transition count 4281
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 2 with 134 rules applied. Total rules applied 280 place count 989 transition count 4281
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 283 place count 989 transition count 4281
Applied a total of 283 rules in 410 ms. Remains 989 /1129 variables (removed 140) and now considering 4281/2580 (removed -1701) transitions.
Finished structural reductions, in 1 iterations. Remains : 989/1129 places, 4281/2580 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37214 steps, run visited all 1 properties in 1448 ms. (steps per millisecond=25 )
Probabilistic random walk after 37214 steps, saw 15849 distinct states, run finished after 1448 ms. (steps per millisecond=25 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[p2]
Stuttering acceptance computed with spot in 30 ms :[p2]
[2022-05-18 00:52:54] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1129 cols
[2022-05-18 00:52:54] [INFO ] Computed 52 place invariants in 24 ms
[2022-05-18 00:52:56] [INFO ] [Real]Absence check using 31 positive place invariants in 43 ms returned sat
[2022-05-18 00:52:56] [INFO ] [Real]Absence check using 31 positive and 21 generalized place invariants in 12 ms returned sat
[2022-05-18 00:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:52:59] [INFO ] [Real]Absence check using state equation in 3378 ms returned sat
[2022-05-18 00:52:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:53:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 161 ms returned sat
[2022-05-18 00:53:02] [INFO ] [Nat]Absence check using 31 positive and 21 generalized place invariants in 15 ms returned sat
[2022-05-18 00:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:53:03] [INFO ] [Nat]Absence check using state equation in 1532 ms returned sat
[2022-05-18 00:53:03] [INFO ] State equation strengthened by 881 read => feed constraints.
[2022-05-18 00:53:03] [INFO ] [Nat]Added 881 Read/Feed constraints in 79 ms returned sat
[2022-05-18 00:53:04] [INFO ] Deduced a trap composed of 90 places in 435 ms of which 1 ms to minimize.
[2022-05-18 00:53:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 558 ms
[2022-05-18 00:53:04] [INFO ] Computed and/alt/rep : 1722/2696/1722 causal constraints (skipped 569 transitions) in 158 ms.
[2022-05-18 00:53:05] [INFO ] Added : 32 causal constraints over 8 iterations in 1243 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 26 ms :[p2]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-13 finished in 71597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p0)) U X(p1)))'
Support contains 3 out of 1307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1307/1307 places, 2932/2932 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1287 transition count 2898
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1287 transition count 2898
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 1269 transition count 2831
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 1269 transition count 2831
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 86 place count 1259 transition count 2758
Iterating global reduction 0 with 10 rules applied. Total rules applied 96 place count 1259 transition count 2758
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 1258 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 1258 transition count 2750
Applied a total of 98 rules in 184 ms. Remains 1258 /1307 variables (removed 49) and now considering 2750/2932 (removed 182) transitions.
[2022-05-18 00:53:05] [INFO ] Flow matrix only has 2478 transitions (discarded 272 similar events)
// Phase 1: matrix 2478 rows 1258 cols
[2022-05-18 00:53:05] [INFO ] Computed 67 place invariants in 28 ms
[2022-05-18 00:53:06] [INFO ] Implicit Places using invariants in 996 ms returned [354, 452, 503, 569, 579, 580, 581, 604, 631, 641, 673, 709, 710, 736, 819, 820, 900]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 999 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1307 places, 2750/2932 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1224 transition count 2733
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1224 transition count 2733
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1207 transition count 2716
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1207 transition count 2716
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1190 transition count 2699
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1190 transition count 2699
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 115 place count 1177 transition count 2595
Iterating global reduction 0 with 13 rules applied. Total rules applied 128 place count 1177 transition count 2595
Applied a total of 128 rules in 169 ms. Remains 1177 /1241 variables (removed 64) and now considering 2595/2750 (removed 155) transitions.
[2022-05-18 00:53:06] [INFO ] Flow matrix only has 2323 transitions (discarded 272 similar events)
// Phase 1: matrix 2323 rows 1177 cols
[2022-05-18 00:53:06] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-18 00:53:07] [INFO ] Implicit Places using invariants in 867 ms returned []
[2022-05-18 00:53:07] [INFO ] Flow matrix only has 2323 transitions (discarded 272 similar events)
// Phase 1: matrix 2323 rows 1177 cols
[2022-05-18 00:53:07] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-18 00:53:08] [INFO ] State equation strengthened by 846 read => feed constraints.
[2022-05-18 00:53:17] [INFO ] Implicit Places using invariants and state equation in 9778 ms returned []
Implicit Place search using SMT with State Equation took 10646 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1177/1307 places, 2595/2932 transitions.
Finished structural reductions, in 2 iterations. Remains : 1177/1307 places, 2595/2932 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s301), p0:(LEQ s971 s661)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-15 finished in 12098 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(X(G(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(p0)||p1))))'
[2022-05-18 00:53:17] [INFO ] Flatten gal took : 83 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1262344289373779101
[2022-05-18 00:53:17] [INFO ] Too many transitions (2932) to apply POR reductions. Disabling POR matrices.
[2022-05-18 00:53:18] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1262344289373779101
Running compilation step : cd /tmp/ltsmin1262344289373779101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 00:53:18] [INFO ] Applying decomposition
[2022-05-18 00:53:18] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8984900265840428638.txt' '-o' '/tmp/graph8984900265840428638.bin' '-w' '/tmp/graph8984900265840428638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8984900265840428638.bin' '-l' '-1' '-v' '-w' '/tmp/graph8984900265840428638.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:53:18] [INFO ] Decomposing Gal with order
[2022-05-18 00:53:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:53:18] [INFO ] Removed a total of 2196 redundant transitions.
[2022-05-18 00:53:18] [INFO ] Flatten gal took : 444 ms
[2022-05-18 00:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 83 ms.
[2022-05-18 00:53:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality1725638147439361521.gal : 14 ms
[2022-05-18 00:53:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality8341675671481664468.ltl : 495 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1725638147439361521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8341675671481664468.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((F(F(X(X(G("(gu87.Node7HasTheLeafSetOfRx4ToReplaceNode9<=gu87.Node14HasAskedItsLeafSetToRx4ToReplaceNode13)")))))))
Formula 0 simplified : !FXXG"(gu87.Node7HasTheLeafSetOfRx4ToReplaceNode9<=gu87.Node14HasAskedItsLeafSetToRx4ToReplaceNode13)"
Compilation finished in 6715 ms.
Running link step : cd /tmp/ltsmin1262344289373779101;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1262344289373779101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 01:16:26] [INFO ] Flatten gal took : 242 ms
[2022-05-18 01:16:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality10779011589805065959.gal : 84 ms
[2022-05-18 01:16:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality2480077923835960394.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10779011589805065959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2480077923835960394.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((F(F(X(X(G("(Node7HasTheLeafSetOfRx4ToReplaceNode9<=Node14HasAskedItsLeafSetToRx4ToReplaceNode13)")))))))
Formula 0 simplified : !FXXG"(Node7HasTheLeafSetOfRx4ToReplaceNode9<=Node14HasAskedItsLeafSetToRx4ToReplaceNode13)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin1262344289373779101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1262344289373779101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]([](([]((LTLAPp1==true))||(LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 700805 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin1262344289373779101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 01:39:32] [INFO ] Flatten gal took : 731 ms
[2022-05-18 01:39:33] [INFO ] Input system was already deterministic with 2932 transitions.
[2022-05-18 01:39:33] [INFO ] Transformed 1307 places.
[2022-05-18 01:39:33] [INFO ] Transformed 2932 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 01:40:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality11730311284458419753.gal : 9 ms
[2022-05-18 01:40:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality3309746125772520306.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11730311284458419753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3309746125772520306.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(F(X(X(G("(Node7HasTheLeafSetOfRx4ToReplaceNode9<=Node14HasAskedItsLeafSetToRx4ToReplaceNode13)")))))))
Formula 0 simplified : !FXXG"(Node7HasTheLeafSetOfRx4ToReplaceNode9<=Node14HasAskedItsLeafSetToRx4ToReplaceNode13)"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m
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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821200699"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;