Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716629682912

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 09:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 09:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:34:44] [INFO ] Load time of PNML (sax parser for PT used): 421 ms
[2024-05-25 09:34:44] [INFO ] Transformed 6876 places.
[2024-05-25 09:34:45] [INFO ] Transformed 9571 transitions.
[2024-05-25 09:34:45] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 722 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 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 2154 places :
Symmetric choice reduction at 1 with 2154 rule applications. Total rules 2190 place count 4686 transition count 7417
Iterating global reduction 1 with 2154 rules applied. Total rules applied 4344 place count 4686 transition count 7417
Discarding 1889 places :
Symmetric choice reduction at 1 with 1889 rule applications. Total rules 6233 place count 2797 transition count 5528
Iterating global reduction 1 with 1889 rules applied. Total rules applied 8122 place count 2797 transition count 5528
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 8337 place count 2582 transition count 3808
Iterating global reduction 1 with 215 rules applied. Total rules applied 8552 place count 2582 transition count 3808
Applied a total of 8552 rules in 1354 ms. Remains 2582 /6876 variables (removed 4294) and now considering 3808/9571 (removed 5763) transitions.
[2024-05-25 09:34:46] [INFO ] Flow matrix only has 3536 transitions (discarded 272 similar events)
// Phase 1: matrix 3536 rows 2582 cols
[2024-05-25 09:34:46] [INFO ] Computed 613 invariants in 166 ms
[2024-05-25 09:34:49] [INFO ] Implicit Places using invariants in 2836 ms returned [4, 8, 12, 14, 18, 20, 22, 24, 26, 28, 33, 40, 49, 63, 76, 91, 107, 123, 125, 127, 131, 133, 135, 137, 139, 152, 165, 174, 181, 186, 189, 224, 231, 234, 235, 236, 237, 238, 239, 240, 241, 242, 245, 250, 257, 266, 277, 290, 304, 318, 319, 320, 321, 322, 323, 324, 325, 326, 337, 346, 353, 358, 361, 363, 398, 405, 408, 409, 410, 411, 412, 413, 414, 415, 416, 418, 422, 427, 434, 443, 454, 466, 478, 479, 480, 481, 482, 483, 484, 485, 486, 495, 502, 507, 510, 512, 514, 549, 556, 559, 560, 561, 562, 563, 564, 566, 567, 571, 573, 576, 581, 588, 597, 607, 617, 618, 619, 620, 621, 622, 623, 624, 625, 632, 637, 640, 642, 644, 646, 681, 688, 691, 692, 693, 694, 695, 696, 697, 698, 699, 701, 703, 706, 709, 714, 721, 729, 737, 738, 739, 740, 741, 742, 743, 744, 745, 750, 753, 755, 757, 759, 761, 796, 803, 806, 807, 808, 809, 811, 812, 813, 814, 818, 820, 822, 824, 827, 832, 838, 844, 845, 846, 847, 848, 849, 850, 851, 852, 855, 857, 859, 861, 863, 865, 907, 910, 911, 912, 913, 914, 915, 916, 917, 918, 920, 922, 924, 928, 931, 935, 939, 940, 941, 942, 943, 945, 946, 947, 949, 951, 953, 955, 959, 961, 996, 1003, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1016, 1018, 1020, 1022, 1024, 1026, 1028, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1039, 1042, 1047, 1049, 1051, 1053, 1055, 1090, 1092, 1096, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1109, 1111, 1113, 1115, 1117, 1119, 1121, 1124, 1125, 1126, 1128, 1129, 1130, 1131, 1132, 1134, 1136, 1138, 1140, 1144, 1146, 1181, 1188, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1201, 1203, 1205, 1207, 1209, 1211, 1213, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1271, 1278, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1291, 1293, 1295, 1297, 1299, 1301, 1304, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1320, 1322, 1324, 1326, 1328, 1330, 1365, 1372, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1385, 1387, 1389, 1391, 1393, 1396, 1401, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1421, 1424, 1426, 1428, 1430, 1432, 1467, 1474, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1485, 1487, 1489, 1491, 1496, 1499, 1504, 1511, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1535, 1540, 1543, 1545, 1547, 1549, 1584, 1591, 1594, 1595, 1597, 1598, 1599, 1600, 1601, 1602, 1605, 1607, 1609, 1612, 1618, 1628, 1637, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1656, 1667, 1674, 1679, 1682, 1684, 1687, 1722, 1729, 1732, 1733, 1734, 1735, 1736, 1737, 1739, 1740, 1742, 1744, 1747, 1752, 1759, 1770, 1781, 1794, 1795, 1797, 1798, 1800, 1801, 1802, 1813, 1822, 1829, 1837, 1842, 1844, 1879, 1886, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897, 1899, 1903, 1908, 1915, 1924, 1935, 1948, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1971, 1984, 1995, 2004, 2011, 2018, 2021, 2056, 2058, 2062, 2065, 2067, 2068, 2069, 2070, 2071, 2072, 2073, 2076, 2084, 2091, 2100, 2111, 2124, 2139, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2163, 2164, 2179, 2192, 2203, 2212, 2219, 2224, 2261]
Discarding 547 places :
Implicit Place search using SMT only with invariants took 2880 ms to find 547 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2035/6876 places, 3808/9571 transitions.
Discarding 241 places :
Symmetric choice reduction at 0 with 241 rule applications. Total rules 241 place count 1794 transition count 3567
Iterating global reduction 0 with 241 rules applied. Total rules applied 482 place count 1794 transition count 3567
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 720 place count 1556 transition count 3329
Iterating global reduction 0 with 238 rules applied. Total rules applied 958 place count 1556 transition count 3329
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 1196 place count 1318 transition count 3091
Iterating global reduction 0 with 238 rules applied. Total rules applied 1434 place count 1318 transition count 3091
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1449 place count 1303 transition count 2971
Iterating global reduction 0 with 15 rules applied. Total rules applied 1464 place count 1303 transition count 2971
Applied a total of 1464 rules in 301 ms. Remains 1303 /2035 variables (removed 732) and now considering 2971/3808 (removed 837) transitions.
[2024-05-25 09:34:49] [INFO ] Flow matrix only has 2699 transitions (discarded 272 similar events)
// Phase 1: matrix 2699 rows 1303 cols
[2024-05-25 09:34:49] [INFO ] Computed 66 invariants in 65 ms
[2024-05-25 09:34:50] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2024-05-25 09:34:50] [INFO ] Flow matrix only has 2699 transitions (discarded 272 similar events)
[2024-05-25 09:34:50] [INFO ] Invariant cache hit.
[2024-05-25 09:34:51] [INFO ] State equation strengthened by 1112 read => feed constraints.
[2024-05-25 09:35:04] [INFO ] Implicit Places using invariants and state equation in 13682 ms returned []
Implicit Place search using SMT with State Equation took 14810 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1303/6876 places, 2971/9571 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19352 ms. Remains : 1303/6876 places, 2971/9571 transitions.
Support contains 69 out of 1303 places after structural reductions.
[2024-05-25 09:35:05] [INFO ] Flatten gal took : 379 ms
[2024-05-25 09:35:05] [INFO ] Flatten gal took : 166 ms
[2024-05-25 09:35:05] [INFO ] Input system was already deterministic with 2971 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 33) seen :10
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-05-25 09:35:06] [INFO ] Flow matrix only has 2699 transitions (discarded 272 similar events)
[2024-05-25 09:35:06] [INFO ] Invariant cache hit.
[2024-05-25 09:35:07] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-25 09:35:07] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 8 ms returned sat
[2024-05-25 09:35:10] [INFO ] After 2468ms SMT Verify possible using state equation in real domain returned unsat :4 sat :1 real:16
[2024-05-25 09:35:10] [INFO ] State equation strengthened by 1112 read => feed constraints.
[2024-05-25 09:35:10] [INFO ] After 160ms SMT Verify possible using 1112 Read/Feed constraints in real domain returned unsat :4 sat :0 real:17
[2024-05-25 09:35:10] [INFO ] After 3817ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:17
[2024-05-25 09:35:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-25 09:35:10] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-25 09:35:14] [INFO ] After 2862ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :17
[2024-05-25 09:35:19] [INFO ] After 4959ms SMT Verify possible using 1112 Read/Feed constraints in natural domain returned unsat :5 sat :16
[2024-05-25 09:35:19] [INFO ] Deduced a trap composed of 494 places in 655 ms of which 6 ms to minimize.
[2024-05-25 09:35:20] [INFO ] Deduced a trap composed of 264 places in 740 ms of which 2 ms to minimize.
[2024-05-25 09:35:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1631 ms
[2024-05-25 09:35:21] [INFO ] Deduced a trap composed of 423 places in 602 ms of which 3 ms to minimize.
[2024-05-25 09:35:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 746 ms
[2024-05-25 09:35:22] [INFO ] Deduced a trap composed of 316 places in 588 ms of which 1 ms to minimize.
[2024-05-25 09:35:23] [INFO ] Deduced a trap composed of 437 places in 594 ms of which 2 ms to minimize.
[2024-05-25 09:35:24] [INFO ] Deduced a trap composed of 477 places in 625 ms of which 1 ms to minimize.
[2024-05-25 09:35:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2121 ms
[2024-05-25 09:35:25] [INFO ] Deduced a trap composed of 416 places in 611 ms of which 1 ms to minimize.
[2024-05-25 09:35:25] [INFO ] Deduced a trap composed of 342 places in 558 ms of which 1 ms to minimize.
[2024-05-25 09:35:26] [INFO ] Deduced a trap composed of 304 places in 583 ms of which 1 ms to minimize.
[2024-05-25 09:35:27] [INFO ] Deduced a trap composed of 233 places in 554 ms of which 1 ms to minimize.
[2024-05-25 09:35:28] [INFO ] Deduced a trap composed of 370 places in 605 ms of which 1 ms to minimize.
[2024-05-25 09:35:28] [INFO ] Deduced a trap composed of 398 places in 612 ms of which 1 ms to minimize.
[2024-05-25 09:35:29] [INFO ] Deduced a trap composed of 353 places in 593 ms of which 2 ms to minimize.
[2024-05-25 09:35:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5085 ms
[2024-05-25 09:35:30] [INFO ] Deduced a trap composed of 345 places in 577 ms of which 2 ms to minimize.
[2024-05-25 09:35:31] [INFO ] Deduced a trap composed of 404 places in 566 ms of which 2 ms to minimize.
[2024-05-25 09:35:31] [INFO ] Deduced a trap composed of 402 places in 572 ms of which 1 ms to minimize.
[2024-05-25 09:35:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2092 ms
[2024-05-25 09:35:32] [INFO ] Deduced a trap composed of 141 places in 625 ms of which 2 ms to minimize.
[2024-05-25 09:35:33] [INFO ] Deduced a trap composed of 210 places in 588 ms of which 1 ms to minimize.
[2024-05-25 09:35:34] [INFO ] Deduced a trap composed of 216 places in 619 ms of which 2 ms to minimize.
[2024-05-25 09:35:35] [INFO ] Deduced a trap composed of 398 places in 599 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 09:35:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:35:35] [INFO ] After 25385ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:17
Fused 21 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 30 out of 1303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1303 transition count 2948
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1280 transition count 2948
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 46 place count 1280 transition count 2922
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 98 place count 1254 transition count 2922
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 1240 transition count 2873
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 1240 transition count 2873
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 126 place count 1240 transition count 2871
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 1238 transition count 2871
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 139 place count 1229 transition count 2820
Iterating global reduction 2 with 9 rules applied. Total rules applied 148 place count 1229 transition count 2820
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 1226 transition count 2796
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 1226 transition count 2796
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 208 place count 1199 transition count 2769
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 1196 transition count 2766
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 1196 transition count 2766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 217 place count 1193 transition count 2742
Iterating global reduction 2 with 3 rules applied. Total rules applied 220 place count 1193 transition count 2742
Free-agglomeration rule (complex) applied 137 times.
Iterating global reduction 2 with 137 rules applied. Total rules applied 357 place count 1193 transition count 4334
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 2 with 137 rules applied. Total rules applied 494 place count 1056 transition count 4334
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 504 place count 1056 transition count 4334
Applied a total of 504 rules in 1083 ms. Remains 1056 /1303 variables (removed 247) and now considering 4334/2971 (removed -1363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1100 ms. Remains : 1056/1303 places, 4334/2971 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-25 09:35:38] [INFO ] Flow matrix only has 3950 transitions (discarded 384 similar events)
// Phase 1: matrix 3950 rows 1056 cols
[2024-05-25 09:35:38] [INFO ] Computed 66 invariants in 37 ms
[2024-05-25 09:35:38] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-25 09:35:38] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-25 09:35:41] [INFO ] After 2578ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:12
[2024-05-25 09:35:41] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:35:42] [INFO ] After 399ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-25 09:35:42] [INFO ] After 3634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-25 09:35:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-25 09:35:42] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 16 ms returned sat
[2024-05-25 09:35:44] [INFO ] After 2118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-25 09:35:51] [INFO ] After 6824ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-25 09:35:52] [INFO ] Deduced a trap composed of 210 places in 539 ms of which 2 ms to minimize.
[2024-05-25 09:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 737 ms
[2024-05-25 09:35:54] [INFO ] Deduced a trap composed of 160 places in 513 ms of which 1 ms to minimize.
[2024-05-25 09:35:54] [INFO ] Deduced a trap composed of 196 places in 527 ms of which 1 ms to minimize.
[2024-05-25 09:35:55] [INFO ] Deduced a trap composed of 170 places in 523 ms of which 1 ms to minimize.
[2024-05-25 09:35:56] [INFO ] Deduced a trap composed of 159 places in 525 ms of which 1 ms to minimize.
[2024-05-25 09:35:56] [INFO ] Deduced a trap composed of 189 places in 531 ms of which 3 ms to minimize.
[2024-05-25 09:35:57] [INFO ] Deduced a trap composed of 179 places in 539 ms of which 1 ms to minimize.
[2024-05-25 09:35:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4202 ms
[2024-05-25 09:35:59] [INFO ] Deduced a trap composed of 131 places in 510 ms of which 1 ms to minimize.
[2024-05-25 09:35:59] [INFO ] Deduced a trap composed of 128 places in 516 ms of which 2 ms to minimize.
[2024-05-25 09:36:00] [INFO ] Deduced a trap composed of 146 places in 519 ms of which 1 ms to minimize.
[2024-05-25 09:36:01] [INFO ] Deduced a trap composed of 162 places in 541 ms of which 1 ms to minimize.
[2024-05-25 09:36:02] [INFO ] Deduced a trap composed of 154 places in 532 ms of which 1 ms to minimize.
[2024-05-25 09:36:03] [INFO ] Deduced a trap composed of 135 places in 526 ms of which 1 ms to minimize.
[2024-05-25 09:36:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4866 ms
[2024-05-25 09:36:04] [INFO ] Deduced a trap composed of 138 places in 522 ms of which 2 ms to minimize.
[2024-05-25 09:36:04] [INFO ] Deduced a trap composed of 112 places in 517 ms of which 2 ms to minimize.
[2024-05-25 09:36:05] [INFO ] Deduced a trap composed of 124 places in 506 ms of which 1 ms to minimize.
[2024-05-25 09:36:06] [INFO ] Deduced a trap composed of 135 places in 511 ms of which 1 ms to minimize.
[2024-05-25 09:36:07] [INFO ] Deduced a trap composed of 130 places in 568 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 09:36:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:36:07] [INFO ] After 25168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 14 ms.
Support contains 25 out of 1056 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1056/1056 places, 4334/4334 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1056 transition count 4332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1054 transition count 4332
Applied a total of 4 rules in 268 ms. Remains 1054 /1056 variables (removed 2) and now considering 4332/4334 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1054/1056 places, 4332/4334 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) 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 12) seen :0
Interrupted probabilistic random walk after 56332 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56332 steps, saw 23857 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 12 properties.
[2024-05-25 09:36:12] [INFO ] Flow matrix only has 3948 transitions (discarded 384 similar events)
// Phase 1: matrix 3948 rows 1054 cols
[2024-05-25 09:36:12] [INFO ] Computed 66 invariants in 35 ms
[2024-05-25 09:36:12] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-25 09:36:12] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 9 ms returned sat
[2024-05-25 09:36:14] [INFO ] After 2799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-25 09:36:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 59 ms returned sat
[2024-05-25 09:36:15] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 8 ms returned sat
[2024-05-25 09:36:17] [INFO ] After 2277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-25 09:36:17] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:36:23] [INFO ] After 5463ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-25 09:36:23] [INFO ] Deduced a trap composed of 171 places in 519 ms of which 1 ms to minimize.
[2024-05-25 09:36:24] [INFO ] Deduced a trap composed of 138 places in 581 ms of which 1 ms to minimize.
[2024-05-25 09:36:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1369 ms
[2024-05-25 09:36:25] [INFO ] Deduced a trap composed of 201 places in 522 ms of which 1 ms to minimize.
[2024-05-25 09:36:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 692 ms
[2024-05-25 09:36:27] [INFO ] Deduced a trap composed of 245 places in 532 ms of which 1 ms to minimize.
[2024-05-25 09:36:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 714 ms
[2024-05-25 09:36:28] [INFO ] Deduced a trap composed of 219 places in 547 ms of which 1 ms to minimize.
[2024-05-25 09:36:29] [INFO ] Deduced a trap composed of 205 places in 580 ms of which 1 ms to minimize.
[2024-05-25 09:36:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1435 ms
[2024-05-25 09:36:30] [INFO ] Deduced a trap composed of 80 places in 622 ms of which 1 ms to minimize.
[2024-05-25 09:36:31] [INFO ] Deduced a trap composed of 140 places in 611 ms of which 1 ms to minimize.
[2024-05-25 09:36:31] [INFO ] Deduced a trap composed of 141 places in 516 ms of which 1 ms to minimize.
[2024-05-25 09:36:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2346 ms
[2024-05-25 09:36:32] [INFO ] Deduced a trap composed of 286 places in 508 ms of which 1 ms to minimize.
[2024-05-25 09:36:34] [INFO ] Deduced a trap composed of 114 places in 607 ms of which 1 ms to minimize.
[2024-05-25 09:36:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1926 ms
[2024-05-25 09:36:35] [INFO ] Deduced a trap composed of 91 places in 631 ms of which 1 ms to minimize.
[2024-05-25 09:36:36] [INFO ] Deduced a trap composed of 105 places in 602 ms of which 3 ms to minimize.
[2024-05-25 09:36:36] [INFO ] Deduced a trap composed of 112 places in 596 ms of which 1 ms to minimize.
[2024-05-25 09:36:37] [INFO ] Deduced a trap composed of 85 places in 618 ms of which 1 ms to minimize.
[2024-05-25 09:36:38] [INFO ] Deduced a trap composed of 86 places in 608 ms of which 1 ms to minimize.
[2024-05-25 09:36:39] [INFO ] Deduced a trap composed of 108 places in 605 ms of which 1 ms to minimize.
[2024-05-25 09:36:40] [INFO ] Deduced a trap composed of 92 places in 619 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 09:36:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:36:40] [INFO ] After 25498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 59 ms.
Support contains 23 out of 1054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1054/1054 places, 4332/4332 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1054 transition count 4331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1053 transition count 4331
Applied a total of 2 rules in 350 ms. Remains 1053 /1054 variables (removed 1) and now considering 4331/4332 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 1053/1054 places, 4331/4332 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 59177 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59177 steps, saw 25029 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 11 properties.
[2024-05-25 09:36:44] [INFO ] Flow matrix only has 3947 transitions (discarded 384 similar events)
// Phase 1: matrix 3947 rows 1053 cols
[2024-05-25 09:36:45] [INFO ] Computed 66 invariants in 40 ms
[2024-05-25 09:36:45] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-25 09:36:45] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2024-05-25 09:36:47] [INFO ] After 1993ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:4
[2024-05-25 09:36:47] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:36:49] [INFO ] After 1606ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-25 09:36:49] [INFO ] After 4241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-25 09:36:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2024-05-25 09:36:49] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2024-05-25 09:36:51] [INFO ] After 1972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-25 09:36:57] [INFO ] After 5538ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-25 09:36:58] [INFO ] Deduced a trap composed of 180 places in 526 ms of which 10 ms to minimize.
[2024-05-25 09:36:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 698 ms
[2024-05-25 09:36:59] [INFO ] Deduced a trap composed of 199 places in 570 ms of which 1 ms to minimize.
[2024-05-25 09:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 768 ms
[2024-05-25 09:37:00] [INFO ] Deduced a trap composed of 190 places in 533 ms of which 1 ms to minimize.
[2024-05-25 09:37:01] [INFO ] Deduced a trap composed of 199 places in 558 ms of which 1 ms to minimize.
[2024-05-25 09:37:02] [INFO ] Deduced a trap composed of 213 places in 518 ms of which 1 ms to minimize.
[2024-05-25 09:37:02] [INFO ] Deduced a trap composed of 223 places in 556 ms of which 1 ms to minimize.
[2024-05-25 09:37:03] [INFO ] Deduced a trap composed of 216 places in 567 ms of which 1 ms to minimize.
[2024-05-25 09:37:04] [INFO ] Deduced a trap composed of 212 places in 566 ms of which 2 ms to minimize.
[2024-05-25 09:37:05] [INFO ] Deduced a trap composed of 254 places in 530 ms of which 3 ms to minimize.
[2024-05-25 09:37:06] [INFO ] Deduced a trap composed of 172 places in 543 ms of which 1 ms to minimize.
[2024-05-25 09:37:06] [INFO ] Deduced a trap composed of 174 places in 519 ms of which 10 ms to minimize.
[2024-05-25 09:37:07] [INFO ] Deduced a trap composed of 194 places in 484 ms of which 9 ms to minimize.
[2024-05-25 09:37:08] [INFO ] Deduced a trap composed of 187 places in 546 ms of which 2 ms to minimize.
[2024-05-25 09:37:08] [INFO ] Deduced a trap composed of 160 places in 504 ms of which 1 ms to minimize.
[2024-05-25 09:37:09] [INFO ] Deduced a trap composed of 225 places in 517 ms of which 1 ms to minimize.
[2024-05-25 09:37:10] [INFO ] Deduced a trap composed of 241 places in 531 ms of which 0 ms to minimize.
[2024-05-25 09:37:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 10326 ms
[2024-05-25 09:37:11] [INFO ] Deduced a trap composed of 132 places in 524 ms of which 1 ms to minimize.
[2024-05-25 09:37:11] [INFO ] Deduced a trap composed of 150 places in 531 ms of which 1 ms to minimize.
[2024-05-25 09:37:12] [INFO ] Deduced a trap composed of 157 places in 538 ms of which 1 ms to minimize.
[2024-05-25 09:37:13] [INFO ] Deduced a trap composed of 158 places in 497 ms of which 1 ms to minimize.
[2024-05-25 09:37:14] [INFO ] Deduced a trap composed of 186 places in 518 ms of which 1 ms to minimize.
[2024-05-25 09:37:14] [INFO ] Deduced a trap composed of 147 places in 530 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 09:37:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:37:14] [INFO ] After 25382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 29 ms.
Support contains 22 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 4331/4331 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 1053 transition count 4330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1052 transition count 4330
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1052 transition count 4330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1051 transition count 4329
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1051 transition count 4329
Applied a total of 5 rules in 272 ms. Remains 1051 /1053 variables (removed 2) and now considering 4329/4331 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 1051/1053 places, 4329/4331 transitions.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 471 stabilizing places and 1338 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2891
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2891
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1263 transition count 2812
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1263 transition count 2812
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 1256 transition count 2756
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 1256 transition count 2756
Applied a total of 94 rules in 160 ms. Remains 1256 /1303 variables (removed 47) and now considering 2756/2971 (removed 215) transitions.
[2024-05-25 09:37:15] [INFO ] Flow matrix only has 2484 transitions (discarded 272 similar events)
// Phase 1: matrix 2484 rows 1256 cols
[2024-05-25 09:37:15] [INFO ] Computed 66 invariants in 35 ms
[2024-05-25 09:37:16] [INFO ] Implicit Places using invariants in 1257 ms returned [12, 106, 392, 506, 537, 549, 559, 614, 772, 806, 843, 888, 889, 993, 1046]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1263 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1303 places, 2756/2971 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1228 transition count 2743
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1228 transition count 2743
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1215 transition count 2730
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1215 transition count 2730
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1202 transition count 2717
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1202 transition count 2717
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 1190 transition count 2621
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 1190 transition count 2621
Applied a total of 102 rules in 194 ms. Remains 1190 /1241 variables (removed 51) and now considering 2621/2756 (removed 135) transitions.
[2024-05-25 09:37:16] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
// Phase 1: matrix 2349 rows 1190 cols
[2024-05-25 09:37:17] [INFO ] Computed 51 invariants in 42 ms
[2024-05-25 09:37:17] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-05-25 09:37:17] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
[2024-05-25 09:37:17] [INFO ] Invariant cache hit.
[2024-05-25 09:37:18] [INFO ] State equation strengthened by 860 read => feed constraints.
[2024-05-25 09:37:27] [INFO ] Implicit Places using invariants and state equation in 9187 ms returned []
Implicit Place search using SMT with State Equation took 10175 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1190/1303 places, 2621/2971 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11794 ms. Remains : 1190/1303 places, 2621/2971 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s467 1) (GEQ s651 1)), p1:(LT s699 1), p2:(GEQ s569 1)], 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 80 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 finished in 12156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2817
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1252 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1252 transition count 2745
Applied a total of 102 rules in 183 ms. Remains 1252 /1303 variables (removed 51) and now considering 2745/2971 (removed 226) transitions.
[2024-05-25 09:37:27] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1252 cols
[2024-05-25 09:37:27] [INFO ] Computed 66 invariants in 31 ms
[2024-05-25 09:37:28] [INFO ] Implicit Places using invariants in 1092 ms returned [12, 106, 508, 539, 551, 561, 588, 613, 717, 768, 802, 839, 884, 885, 989, 1042]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1111 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1236/1303 places, 2745/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1222 transition count 2731
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1222 transition count 2731
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1208 transition count 2717
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1208 transition count 2717
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1194 transition count 2703
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1194 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1181 transition count 2599
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1181 transition count 2599
Applied a total of 110 rules in 200 ms. Remains 1181 /1236 variables (removed 55) and now considering 2599/2745 (removed 146) transitions.
[2024-05-25 09:37:28] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2024-05-25 09:37:28] [INFO ] Computed 50 invariants in 19 ms
[2024-05-25 09:37:29] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-25 09:37:29] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
[2024-05-25 09:37:29] [INFO ] Invariant cache hit.
[2024-05-25 09:37:30] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:37:40] [INFO ] Implicit Places using invariants and state equation in 10278 ms returned [1162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11257 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1180/1303 places, 2599/2971 transitions.
Applied a total of 0 rules in 38 ms. Remains 1180 /1180 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12791 ms. Remains : 1180/1303 places, 2599/2971 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s387 1) (GEQ s443 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 finished in 12916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2825
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2825
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 1253 transition count 2753
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 1253 transition count 2753
Applied a total of 100 rules in 163 ms. Remains 1253 /1303 variables (removed 50) and now considering 2753/2971 (removed 218) transitions.
[2024-05-25 09:37:40] [INFO ] Flow matrix only has 2481 transitions (discarded 272 similar events)
// Phase 1: matrix 2481 rows 1253 cols
[2024-05-25 09:37:40] [INFO ] Computed 66 invariants in 33 ms
[2024-05-25 09:37:41] [INFO ] Implicit Places using invariants in 1038 ms returned [12, 394, 509, 540, 552, 562, 589, 614, 718, 769, 803, 840, 885, 886, 990, 1043]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2753/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1223 transition count 2739
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1223 transition count 2739
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1209 transition count 2725
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1209 transition count 2725
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1195 transition count 2711
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1195 transition count 2711
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1182 transition count 2607
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1182 transition count 2607
Applied a total of 110 rules in 195 ms. Remains 1182 /1237 variables (removed 55) and now considering 2607/2753 (removed 146) transitions.
[2024-05-25 09:37:41] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2024-05-25 09:37:41] [INFO ] Computed 50 invariants in 23 ms
[2024-05-25 09:37:42] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-25 09:37:42] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-25 09:37:42] [INFO ] Invariant cache hit.
[2024-05-25 09:37:43] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:37:50] [INFO ] Implicit Places using invariants and state equation in 7740 ms returned []
Implicit Place search using SMT with State Equation took 8703 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1303 places, 2607/2971 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10108 ms. Remains : 1182/1303 places, 2607/2971 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s454 1) (LT s1119 1)), p0:(OR (LT s134 1) (LT s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1207 reset in 572 ms.
Product exploration explored 100000 steps with 1205 reset in 495 ms.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:37:52] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-25 09:37:52] [INFO ] Invariant cache hit.
[2024-05-25 09:37:52] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2024-05-25 09:37:52] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 12 ms returned sat
[2024-05-25 09:37:53] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:37:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-25 09:37:53] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 17 ms returned sat
[2024-05-25 09:37:54] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:37:54] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:37:54] [INFO ] After 182ms SMT Verify possible using 853 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:37:55] [INFO ] Deduced a trap composed of 210 places in 498 ms of which 1 ms to minimize.
[2024-05-25 09:37:55] [INFO ] Deduced a trap composed of 73 places in 485 ms of which 1 ms to minimize.
[2024-05-25 09:37:56] [INFO ] Deduced a trap composed of 91 places in 494 ms of which 1 ms to minimize.
[2024-05-25 09:37:56] [INFO ] Deduced a trap composed of 108 places in 511 ms of which 1 ms to minimize.
[2024-05-25 09:37:57] [INFO ] Deduced a trap composed of 112 places in 496 ms of which 1 ms to minimize.
[2024-05-25 09:37:58] [INFO ] Deduced a trap composed of 144 places in 488 ms of which 1 ms to minimize.
[2024-05-25 09:37:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3642 ms
[2024-05-25 09:37:58] [INFO ] After 3883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-25 09:37:58] [INFO ] After 4957ms 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 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 2607/2607 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 1182 transition count 2576
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1151 transition count 2576
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1151 transition count 2560
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1135 transition count 2560
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1134 transition count 2552
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1134 transition count 2552
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
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 132 place count 1116 transition count 2534
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 265 place count 1116 transition count 4277
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 398 place count 983 transition count 4277
Applied a total of 398 rules in 340 ms. Remains 983 /1182 variables (removed 199) and now considering 4277/2607 (removed -1670) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 983/1182 places, 4277/2607 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 67886 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67886 steps, saw 28615 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:38:01] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2024-05-25 09:38:01] [INFO ] Computed 50 invariants in 23 ms
[2024-05-25 09:38:02] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2024-05-25 09:38:02] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 9 ms returned sat
[2024-05-25 09:38:03] [INFO ] After 1081ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:38:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2024-05-25 09:38:03] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 12 ms returned sat
[2024-05-25 09:38:04] [INFO ] After 963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:38:04] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:38:04] [INFO ] After 394ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:38:05] [INFO ] Deduced a trap composed of 58 places in 577 ms of which 1 ms to minimize.
[2024-05-25 09:38:06] [INFO ] Deduced a trap composed of 159 places in 558 ms of which 1 ms to minimize.
[2024-05-25 09:38:07] [INFO ] Deduced a trap composed of 154 places in 582 ms of which 1 ms to minimize.
[2024-05-25 09:38:07] [INFO ] Deduced a trap composed of 74 places in 584 ms of which 1 ms to minimize.
[2024-05-25 09:38:09] [INFO ] Deduced a trap composed of 58 places in 587 ms of which 1 ms to minimize.
[2024-05-25 09:38:11] [INFO ] Deduced a trap composed of 86 places in 582 ms of which 1 ms to minimize.
[2024-05-25 09:38:12] [INFO ] Deduced a trap composed of 98 places in 560 ms of which 0 ms to minimize.
[2024-05-25 09:38:12] [INFO ] Deduced a trap composed of 90 places in 572 ms of which 1 ms to minimize.
[2024-05-25 09:38:14] [INFO ] Deduced a trap composed of 73 places in 583 ms of which 1 ms to minimize.
[2024-05-25 09:38:15] [INFO ] Deduced a trap composed of 65 places in 587 ms of which 1 ms to minimize.
[2024-05-25 09:38:15] [INFO ] Deduced a trap composed of 80 places in 594 ms of which 1 ms to minimize.
[2024-05-25 09:38:16] [INFO ] Deduced a trap composed of 83 places in 567 ms of which 1 ms to minimize.
[2024-05-25 09:38:17] [INFO ] Deduced a trap composed of 79 places in 572 ms of which 1 ms to minimize.
[2024-05-25 09:38:18] [INFO ] Deduced a trap composed of 72 places in 562 ms of which 1 ms to minimize.
[2024-05-25 09:38:19] [INFO ] Deduced a trap composed of 81 places in 563 ms of which 1 ms to minimize.
[2024-05-25 09:38:20] [INFO ] Deduced a trap composed of 66 places in 569 ms of which 1 ms to minimize.
[2024-05-25 09:38:21] [INFO ] Deduced a trap composed of 98 places in 560 ms of which 1 ms to minimize.
[2024-05-25 09:38:22] [INFO ] Deduced a trap composed of 83 places in 585 ms of which 1 ms to minimize.
[2024-05-25 09:38:22] [INFO ] Deduced a trap composed of 87 places in 568 ms of which 1 ms to minimize.
[2024-05-25 09:38:23] [INFO ] Deduced a trap composed of 86 places in 576 ms of which 1 ms to minimize.
[2024-05-25 09:38:24] [INFO ] Deduced a trap composed of 89 places in 547 ms of which 1 ms to minimize.
[2024-05-25 09:38:25] [INFO ] Deduced a trap composed of 78 places in 587 ms of which 1 ms to minimize.
[2024-05-25 09:38:26] [INFO ] Deduced a trap composed of 87 places in 572 ms of which 1 ms to minimize.
[2024-05-25 09:38:26] [INFO ] Deduced a trap composed of 154 places in 577 ms of which 1 ms to minimize.
[2024-05-25 09:38:27] [INFO ] Deduced a trap composed of 61 places in 595 ms of which 1 ms to minimize.
[2024-05-25 09:38:28] [INFO ] Deduced a trap composed of 80 places in 566 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 09:38:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:38:28] [INFO ] After 25476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 115 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 107 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-25 09:38:28] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-25 09:38:28] [INFO ] Invariant cache hit.
[2024-05-25 09:38:29] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2024-05-25 09:38:29] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-25 09:38:29] [INFO ] Invariant cache hit.
[2024-05-25 09:38:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:38:53] [INFO ] Implicit Places using invariants and state equation in 23544 ms returned []
Implicit Place search using SMT with State Equation took 24739 ms to find 0 implicit places.
[2024-05-25 09:38:53] [INFO ] Redundant transitions in 330 ms returned []
[2024-05-25 09:38:53] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-25 09:38:53] [INFO ] Invariant cache hit.
[2024-05-25 09:38:55] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26776 ms. Remains : 983/983 places, 4277/4277 transitions.
Graph (trivial) has 1054 edges and 983 vertex of which 17 / 983 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 4853 edges and 967 vertex of which 953 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 t1266.t1509 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 936 transition count 3508
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 839 transition count 3315
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 743 transition count 3147
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 671 transition count 3005
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 601 transition count 2885
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 551 transition count 2787
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 503 transition count 2707
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 471 transition count 2645
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 441 transition count 2597
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 423 transition count 2563
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 407 transition count 2539
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 399 transition count 2525
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 393 transition count 2517
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 390 transition count 2515
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 16 Pre rules applied. Total rules applied 1640 place count 390 transition count 2499
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 1672 place count 374 transition count 2499
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1956 place count 90 transition count 339
Iterating global reduction 14 with 284 rules applied. Total rules applied 2240 place count 90 transition count 339
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 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 14 with 254 rules applied. Total rules applied 2494 place count 90 transition count 85
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2502 place count 82 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2502 place count 82 transition count 84
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 2504 place count 81 transition count 84
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2516 place count 69 transition count 67
Iterating global reduction 16 with 12 rules applied. Total rules applied 2528 place count 69 transition count 67
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2533 place count 64 transition count 62
Iterating global reduction 16 with 5 rules applied. Total rules applied 2538 place count 64 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2542 place count 62 transition count 60
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2543 place count 61 transition count 58
Iterating global reduction 16 with 1 rules applied. Total rules applied 2544 place count 61 transition count 58
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 16 with 15 rules applied. Total rules applied 2559 place count 61 transition count 43
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 16 with 15 rules applied. Total rules applied 2574 place count 46 transition count 43
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2575 place count 46 transition count 43
Applied a total of 2575 rules in 507 ms. Remains 46 /983 variables (removed 937) and now considering 43/4277 (removed 4234) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 46 cols
[2024-05-25 09:38:55] [INFO ] Computed 19 invariants in 0 ms
[2024-05-25 09:38:56] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 09:38:56] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 09:38:56] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:38:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:56] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-25 09:38:56] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:38:56] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-25 09:38:56] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 342 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 42 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2024-05-25 09:38:56] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2024-05-25 09:38:56] [INFO ] Computed 50 invariants in 23 ms
[2024-05-25 09:38:57] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-05-25 09:38:57] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-25 09:38:57] [INFO ] Invariant cache hit.
[2024-05-25 09:38:58] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:39:05] [INFO ] Implicit Places using invariants and state equation in 7638 ms returned []
Implicit Place search using SMT with State Equation took 8548 ms to find 0 implicit places.
[2024-05-25 09:39:05] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-25 09:39:05] [INFO ] Invariant cache hit.
[2024-05-25 09:39:06] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9655 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3707 steps, including 44 resets, run visited all 2 properties in 57 ms. (steps per millisecond=65 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1205 reset in 392 ms.
Product exploration explored 100000 steps with 1203 reset in 418 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1182 transition count 2607
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 1182 transition count 2607
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 1182 transition count 2607
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 1167 transition count 2592
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 1167 transition count 2592
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 1167 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 97 rules in 644 ms. Remains 1166 /1182 variables (removed 16) and now considering 2591/2607 (removed 16) transitions.
[2024-05-25 09:39:09] [INFO ] Redundant transitions in 203 ms returned []
[2024-05-25 09:39:09] [INFO ] Flow matrix only has 2319 transitions (discarded 272 similar events)
// Phase 1: matrix 2319 rows 1166 cols
[2024-05-25 09:39:09] [INFO ] Computed 50 invariants in 21 ms
[2024-05-25 09:39:10] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1166/1182 places, 2591/2607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2163 ms. Remains : 1166/1182 places, 2591/2607 transitions.
Built C files in :
/tmp/ltsmin5562737371014645131
[2024-05-25 09:39:10] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5562737371014645131
Running compilation step : cd /tmp/ltsmin5562737371014645131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5562737371014645131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5562737371014645131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 93 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2024-05-25 09:39:14] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2024-05-25 09:39:14] [INFO ] Computed 50 invariants in 16 ms
[2024-05-25 09:39:15] [INFO ] Implicit Places using invariants in 1215 ms returned []
[2024-05-25 09:39:15] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-25 09:39:15] [INFO ] Invariant cache hit.
[2024-05-25 09:39:16] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:39:23] [INFO ] Implicit Places using invariants and state equation in 7751 ms returned []
Implicit Place search using SMT with State Equation took 8970 ms to find 0 implicit places.
[2024-05-25 09:39:23] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-25 09:39:23] [INFO ] Invariant cache hit.
[2024-05-25 09:39:24] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10141 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Built C files in :
/tmp/ltsmin4427880983047834797
[2024-05-25 09:39:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4427880983047834797
Running compilation step : cd /tmp/ltsmin4427880983047834797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4427880983047834797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4427880983047834797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 09:39:27] [INFO ] Flatten gal took : 182 ms
[2024-05-25 09:39:27] [INFO ] Flatten gal took : 142 ms
[2024-05-25 09:39:27] [INFO ] Time to serialize gal into /tmp/LTL2692522660084205183.gal : 18 ms
[2024-05-25 09:39:27] [INFO ] Time to serialize properties into /tmp/LTL2774566561545253201.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2692522660084205183.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6181184714706950766.hoa' '-atoms' '/tmp/LTL2774566561545253201.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2774566561545253201.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6181184714706950766.hoa
Detected timeout of ITS tools.
[2024-05-25 09:39:42] [INFO ] Flatten gal took : 75 ms
[2024-05-25 09:39:43] [INFO ] Flatten gal took : 73 ms
[2024-05-25 09:39:43] [INFO ] Time to serialize gal into /tmp/LTL7467344338587417093.gal : 12 ms
[2024-05-25 09:39:43] [INFO ] Time to serialize properties into /tmp/LTL10516570726580784290.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7467344338587417093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10516570726580784290.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))")))||(G("((Node4ManageTheCrashOfNode3<1)...204
Formula 0 simplified : XX(GF!"((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))" & F!"((Node4ManageTheCrashOfNode3<1)||(Lx0I...192
Detected timeout of ITS tools.
[2024-05-25 09:39:58] [INFO ] Flatten gal took : 153 ms
[2024-05-25 09:39:58] [INFO ] Applying decomposition
[2024-05-25 09:39:58] [INFO ] Flatten gal took : 103 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11095106697642001077.txt' '-o' '/tmp/graph11095106697642001077.bin' '-w' '/tmp/graph11095106697642001077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11095106697642001077.bin' '-l' '-1' '-v' '-w' '/tmp/graph11095106697642001077.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:39:58] [INFO ] Decomposing Gal with order
[2024-05-25 09:39:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:39:59] [INFO ] Removed a total of 1898 redundant transitions.
[2024-05-25 09:39:59] [INFO ] Flatten gal took : 395 ms
[2024-05-25 09:39:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1032 labels/synchronizations in 159 ms.
[2024-05-25 09:39:59] [INFO ] Time to serialize gal into /tmp/LTL17466929870394343557.gal : 29 ms
[2024-05-25 09:39:59] [INFO ] Time to serialize properties into /tmp/LTL7083204080350495188.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17466929870394343557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7083204080350495188.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i2.i0.i0.u16.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i2.i0.i0.u177.LeafSetOfRx3IsSentToNode0<1))")))||(G("((i2...258
Formula 0 simplified : XX(GF!"((i2.i0.i0.u16.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i2.i0.i0.u177.LeafSetOfRx3IsSentToNode0<1))" & F!"((i2.i1.i0....246
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6121551611701522644
[2024-05-25 09:40:14] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6121551611701522644
Running compilation step : cd /tmp/ltsmin6121551611701522644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6121551611701522644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6121551611701522644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 157363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2891
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2891
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1263 transition count 2819
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1263 transition count 2819
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 1255 transition count 2755
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 1255 transition count 2755
Applied a total of 96 rules in 191 ms. Remains 1255 /1303 variables (removed 48) and now considering 2755/2971 (removed 216) transitions.
[2024-05-25 09:40:17] [INFO ] Flow matrix only has 2483 transitions (discarded 272 similar events)
// Phase 1: matrix 2483 rows 1255 cols
[2024-05-25 09:40:17] [INFO ] Computed 66 invariants in 30 ms
[2024-05-25 09:40:18] [INFO ] Implicit Places using invariants in 1012 ms returned [109, 395, 509, 540, 552, 591, 616, 720, 771, 805, 842, 887, 888, 992, 1045]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1240/1303 places, 2755/2971 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1227 transition count 2742
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1227 transition count 2742
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1214 transition count 2729
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1214 transition count 2729
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1201 transition count 2716
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1201 transition count 2716
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 1189 transition count 2620
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 1189 transition count 2620
Applied a total of 102 rules in 189 ms. Remains 1189 /1240 variables (removed 51) and now considering 2620/2755 (removed 135) transitions.
[2024-05-25 09:40:19] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1189 cols
[2024-05-25 09:40:19] [INFO ] Computed 51 invariants in 32 ms
[2024-05-25 09:40:20] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-05-25 09:40:20] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
[2024-05-25 09:40:20] [INFO ] Invariant cache hit.
[2024-05-25 09:40:20] [INFO ] State equation strengthened by 860 read => feed constraints.
[2024-05-25 09:40:30] [INFO ] Implicit Places using invariants and state equation in 10162 ms returned []
Implicit Place search using SMT with State Equation took 11130 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1189/1303 places, 2620/2971 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12526 ms. Remains : 1189/1303 places, 2620/2971 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s555 1) (GEQ s559 1)), p0:(GEQ s49 1)], 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 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 finished in 12664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 1230 transition count 2842
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 1230 transition count 2842
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 146 place count 1230 transition count 2839
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 1227 transition count 2839
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1213 transition count 2748
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1213 transition count 2748
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 236 place count 1185 transition count 2720
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 242 place count 1179 transition count 2714
Iterating global reduction 2 with 6 rules applied. Total rules applied 248 place count 1179 transition count 2714
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 254 place count 1173 transition count 2666
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 1173 transition count 2666
Applied a total of 260 rules in 502 ms. Remains 1173 /1303 variables (removed 130) and now considering 2666/2971 (removed 305) transitions.
[2024-05-25 09:40:30] [INFO ] Flow matrix only has 2394 transitions (discarded 272 similar events)
// Phase 1: matrix 2394 rows 1173 cols
[2024-05-25 09:40:30] [INFO ] Computed 66 invariants in 39 ms
[2024-05-25 09:40:31] [INFO ] Implicit Places using invariants in 994 ms returned [9, 95, 355, 466, 496, 507, 517, 542, 565, 664, 713, 747, 781, 827, 930, 981]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 996 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1157/1303 places, 2666/2971 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1148 transition count 2657
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1148 transition count 2657
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1139 transition count 2648
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1139 transition count 2648
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 1131 transition count 2584
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 1131 transition count 2584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 1126 transition count 2579
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1121 transition count 2574
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1121 transition count 2574
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 1116 transition count 2534
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 1116 transition count 2534
Applied a total of 82 rules in 357 ms. Remains 1116 /1157 variables (removed 41) and now considering 2534/2666 (removed 132) transitions.
[2024-05-25 09:40:32] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2024-05-25 09:40:32] [INFO ] Computed 50 invariants in 21 ms
[2024-05-25 09:40:33] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-05-25 09:40:33] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 09:40:33] [INFO ] Invariant cache hit.
[2024-05-25 09:40:33] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:40:41] [INFO ] Implicit Places using invariants and state equation in 8644 ms returned []
Implicit Place search using SMT with State Equation took 9584 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1303 places, 2534/2971 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11440 ms. Remains : 1116/1303 places, 2534/2971 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s344 1) (LT s755 1)), p0:(OR (LT s824 1) (LT s828 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1710 reset in 553 ms.
Product exploration explored 100000 steps with 1710 reset in 562 ms.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1116 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-25 09:40:43] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-25 09:40:43] [INFO ] Invariant cache hit.
[2024-05-25 09:40:43] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2024-05-25 09:40:43] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:40:43] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 12 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 finished in 13215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(p2))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2818
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2818
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1254 transition count 2754
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1254 transition count 2754
Applied a total of 98 rules in 181 ms. Remains 1254 /1303 variables (removed 49) and now considering 2754/2971 (removed 217) transitions.
[2024-05-25 09:40:43] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1254 cols
[2024-05-25 09:40:43] [INFO ] Computed 66 invariants in 38 ms
[2024-05-25 09:40:44] [INFO ] Implicit Places using invariants in 1070 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 768, 803, 840, 885, 886, 990, 1043]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1072 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2754/2971 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1222 transition count 2739
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1222 transition count 2739
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1207 transition count 2724
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1207 transition count 2724
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1192 transition count 2709
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1192 transition count 2709
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 1178 transition count 2597
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 1178 transition count 2597
Applied a total of 118 rules in 218 ms. Remains 1178 /1237 variables (removed 59) and now considering 2597/2754 (removed 157) transitions.
[2024-05-25 09:40:45] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1178 cols
[2024-05-25 09:40:45] [INFO ] Computed 49 invariants in 26 ms
[2024-05-25 09:40:46] [INFO ] Implicit Places using invariants in 927 ms returned []
[2024-05-25 09:40:46] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2024-05-25 09:40:46] [INFO ] Invariant cache hit.
[2024-05-25 09:40:46] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:40:53] [INFO ] Implicit Places using invariants and state equation in 7605 ms returned []
Implicit Place search using SMT with State Equation took 8552 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1303 places, 2597/2971 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10030 ms. Remains : 1178/1303 places, 2597/2971 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s1142 1), p0:(AND (GEQ s510 1) (GEQ s523 1)), p2:(AND (GEQ s738 1) (GEQ s1133 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 finished in 10206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p1||G(F(p2))))||p0))))'
Support contains 8 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2817
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1252 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1252 transition count 2745
Applied a total of 102 rules in 190 ms. Remains 1252 /1303 variables (removed 51) and now considering 2745/2971 (removed 226) transitions.
[2024-05-25 09:40:54] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1252 cols
[2024-05-25 09:40:54] [INFO ] Computed 66 invariants in 29 ms
[2024-05-25 09:40:55] [INFO ] Implicit Places using invariants in 1032 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 766, 800, 884, 885, 989, 1042]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1035 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1236/1303 places, 2745/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1222 transition count 2731
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1222 transition count 2731
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1208 transition count 2717
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1208 transition count 2717
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1194 transition count 2703
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1194 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1181 transition count 2599
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1181 transition count 2599
Applied a total of 110 rules in 228 ms. Remains 1181 /1236 variables (removed 55) and now considering 2599/2745 (removed 146) transitions.
[2024-05-25 09:40:55] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2024-05-25 09:40:55] [INFO ] Computed 50 invariants in 22 ms
[2024-05-25 09:40:56] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-25 09:40:56] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
[2024-05-25 09:40:56] [INFO ] Invariant cache hit.
[2024-05-25 09:40:57] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:41:05] [INFO ] Implicit Places using invariants and state equation in 9364 ms returned [1162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10313 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1180/1303 places, 2599/2971 transitions.
Applied a total of 0 rules in 40 ms. Remains 1180 /1180 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11807 ms. Remains : 1180/1303 places, 2599/2971 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s443 1) (LT s787 1) (LT s790 1)), p1:(AND (GEQ s642 1) (GEQ s645 1) (GEQ s985 1)), p2:(AND (GEQ s819 1) (GEQ s874 1))], 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 1206 reset in 446 ms.
Product exploration explored 100000 steps with 1203 reset in 470 ms.
Computed a total of 348 stabilizing places and 966 stable transitions
Computed a total of 348 stabilizing places and 966 stable transitions
Detected a total of 348/1180 stabilizing places and 966/2599 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 1305 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 119 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 72148 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72148 steps, saw 31201 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:41:11] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1180 cols
[2024-05-25 09:41:11] [INFO ] Computed 49 invariants in 25 ms
[2024-05-25 09:41:12] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:41:12] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:41:12] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:41:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:41:12] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:41:13] [INFO ] After 1251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:41:13] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:41:14] [INFO ] After 1091ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:41:16] [INFO ] Deduced a trap composed of 126 places in 494 ms of which 1 ms to minimize.
[2024-05-25 09:41:16] [INFO ] Deduced a trap composed of 113 places in 477 ms of which 1 ms to minimize.
[2024-05-25 09:41:17] [INFO ] Deduced a trap composed of 111 places in 478 ms of which 1 ms to minimize.
[2024-05-25 09:41:18] [INFO ] Deduced a trap composed of 112 places in 495 ms of which 1 ms to minimize.
[2024-05-25 09:41:18] [INFO ] Deduced a trap composed of 115 places in 482 ms of which 1 ms to minimize.
[2024-05-25 09:41:19] [INFO ] Deduced a trap composed of 134 places in 479 ms of which 1 ms to minimize.
[2024-05-25 09:41:19] [INFO ] Deduced a trap composed of 119 places in 469 ms of which 1 ms to minimize.
[2024-05-25 09:41:20] [INFO ] Deduced a trap composed of 106 places in 478 ms of which 1 ms to minimize.
[2024-05-25 09:41:21] [INFO ] Deduced a trap composed of 293 places in 489 ms of which 1 ms to minimize.
[2024-05-25 09:41:22] [INFO ] Deduced a trap composed of 302 places in 509 ms of which 3 ms to minimize.
[2024-05-25 09:41:22] [INFO ] Deduced a trap composed of 115 places in 504 ms of which 1 ms to minimize.
[2024-05-25 09:41:23] [INFO ] Deduced a trap composed of 106 places in 505 ms of which 1 ms to minimize.
[2024-05-25 09:41:23] [INFO ] Deduced a trap composed of 142 places in 504 ms of which 1 ms to minimize.
[2024-05-25 09:41:24] [INFO ] Deduced a trap composed of 137 places in 504 ms of which 1 ms to minimize.
[2024-05-25 09:41:25] [INFO ] Deduced a trap composed of 120 places in 509 ms of which 1 ms to minimize.
[2024-05-25 09:41:25] [INFO ] Deduced a trap composed of 334 places in 507 ms of which 2 ms to minimize.
[2024-05-25 09:41:26] [INFO ] Deduced a trap composed of 339 places in 503 ms of which 1 ms to minimize.
[2024-05-25 09:41:27] [INFO ] Deduced a trap composed of 135 places in 481 ms of which 1 ms to minimize.
[2024-05-25 09:41:28] [INFO ] Deduced a trap composed of 146 places in 460 ms of which 1 ms to minimize.
[2024-05-25 09:41:28] [INFO ] Deduced a trap composed of 137 places in 485 ms of which 1 ms to minimize.
[2024-05-25 09:41:29] [INFO ] Deduced a trap composed of 104 places in 523 ms of which 1 ms to minimize.
[2024-05-25 09:41:30] [INFO ] Deduced a trap composed of 107 places in 509 ms of which 1 ms to minimize.
[2024-05-25 09:41:30] [INFO ] Deduced a trap composed of 124 places in 501 ms of which 1 ms to minimize.
[2024-05-25 09:41:31] [INFO ] Deduced a trap composed of 78 places in 502 ms of which 1 ms to minimize.
[2024-05-25 09:41:32] [INFO ] Deduced a trap composed of 139 places in 516 ms of which 1 ms to minimize.
[2024-05-25 09:41:32] [INFO ] Deduced a trap composed of 374 places in 509 ms of which 1 ms to minimize.
[2024-05-25 09:41:33] [INFO ] Deduced a trap composed of 146 places in 495 ms of which 1 ms to minimize.
[2024-05-25 09:41:34] [INFO ] Deduced a trap composed of 134 places in 474 ms of which 1 ms to minimize.
[2024-05-25 09:41:34] [INFO ] Deduced a trap composed of 117 places in 459 ms of which 1 ms to minimize.
[2024-05-25 09:41:35] [INFO ] Deduced a trap composed of 134 places in 451 ms of which 2 ms to minimize.
[2024-05-25 09:41:36] [INFO ] Deduced a trap composed of 142 places in 484 ms of which 1 ms to minimize.
[2024-05-25 09:41:36] [INFO ] Deduced a trap composed of 129 places in 493 ms of which 2 ms to minimize.
[2024-05-25 09:41:37] [INFO ] Deduced a trap composed of 93 places in 505 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 09:41:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:41:37] [INFO ] After 25328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 1180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1180/1180 places, 2599/2599 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 1180 transition count 2567
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1148 transition count 2567
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 64 place count 1148 transition count 2551
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1132 transition count 2551
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 128 place count 1116 transition count 2535
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 2 with 119 rules applied. Total rules applied 247 place count 1116 transition count 4292
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 2 with 119 rules applied. Total rules applied 366 place count 997 transition count 4292
Applied a total of 366 rules in 287 ms. Remains 997 /1180 variables (removed 183) and now considering 4292/2599 (removed -1693) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 997/1180 places, 4292/2599 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 60580 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60580 steps, saw 25570 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:41:41] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
// Phase 1: matrix 3908 rows 997 cols
[2024-05-25 09:41:41] [INFO ] Computed 49 invariants in 49 ms
[2024-05-25 09:41:41] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:41:41] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:41:41] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:41:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:41:42] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:41:44] [INFO ] After 2838ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:41:44] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:41:47] [INFO ] After 2093ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:41:48] [INFO ] Deduced a trap composed of 89 places in 583 ms of which 1 ms to minimize.
[2024-05-25 09:41:49] [INFO ] Deduced a trap composed of 95 places in 577 ms of which 1 ms to minimize.
[2024-05-25 09:41:49] [INFO ] Deduced a trap composed of 92 places in 590 ms of which 0 ms to minimize.
[2024-05-25 09:41:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2241 ms
[2024-05-25 09:41:51] [INFO ] After 6096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2251 ms.
[2024-05-25 09:41:53] [INFO ] After 11469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 124 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 997/997 places, 4292/4292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 121 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
[2024-05-25 09:41:53] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-25 09:41:53] [INFO ] Invariant cache hit.
[2024-05-25 09:41:54] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2024-05-25 09:41:54] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-25 09:41:54] [INFO ] Invariant cache hit.
[2024-05-25 09:41:55] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:42:15] [INFO ] Implicit Places using invariants and state equation in 20597 ms returned []
Implicit Place search using SMT with State Equation took 21710 ms to find 0 implicit places.
[2024-05-25 09:42:15] [INFO ] Redundant transitions in 221 ms returned []
[2024-05-25 09:42:15] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-25 09:42:15] [INFO ] Invariant cache hit.
[2024-05-25 09:42:17] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23613 ms. Remains : 997/997 places, 4292/4292 transitions.
Graph (trivial) has 993 edges and 997 vertex of which 15 / 997 are part of one of the 1 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 231 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 623 transitions.
Graph (complete) has 4932 edges and 983 vertex of which 969 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 t1266.t1509 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 952 transition count 3598
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 1 with 174 rules applied. Total rules applied 247 place count 883 transition count 3493
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 112 rules applied. Total rules applied 359 place count 831 transition count 3433
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 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 3 with 39 rules applied. Total rules applied 398 place count 807 transition count 3418
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 416 place count 800 transition count 3407
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 425 place count 791 transition count 3407
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 425 place count 791 transition count 3392
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 455 place count 776 transition count 3392
Discarding 197 places :
Symmetric choice reduction at 6 with 197 rule applications. Total rules 652 place count 579 transition count 1910
Iterating global reduction 6 with 197 rules applied. Total rules applied 849 place count 579 transition count 1910
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 6 with 149 rules applied. Total rules applied 998 place count 579 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 999 place count 578 transition count 1757
Iterating global reduction 7 with 1 rules applied. Total rules applied 1000 place count 578 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1001 place count 577 transition count 1756
Iterating global reduction 7 with 1 rules applied. Total rules applied 1002 place count 577 transition count 1756
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 7 with 800 rules applied. Total rules applied 1802 place count 177 transition count 1356
Drop transitions removed 342 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 368 transitions.
Iterating post reduction 7 with 368 rules applied. Total rules applied 2170 place count 177 transition count 988
Discarding 59 places :
Symmetric choice reduction at 8 with 59 rule applications. Total rules 2229 place count 118 transition count 438
Iterating global reduction 8 with 59 rules applied. Total rules applied 2288 place count 118 transition count 438
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 2317 place count 118 transition count 409
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2319 place count 116 transition count 397
Iterating global reduction 9 with 2 rules applied. Total rules applied 2321 place count 116 transition count 397
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2323 place count 114 transition count 395
Iterating global reduction 9 with 2 rules applied. Total rules applied 2325 place count 114 transition count 395
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 9 with 52 rules applied. Total rules applied 2377 place count 114 transition count 343
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2403 place count 88 transition count 135
Iterating global reduction 9 with 26 rules applied. Total rules applied 2429 place count 88 transition count 135
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 2450 place count 88 transition count 114
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2455 place count 83 transition count 97
Iterating global reduction 10 with 5 rules applied. Total rules applied 2460 place count 83 transition count 97
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2463 place count 80 transition count 94
Iterating global reduction 10 with 3 rules applied. Total rules applied 2466 place count 80 transition count 94
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2472 place count 80 transition count 88
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2474 place count 78 transition count 83
Iterating global reduction 10 with 2 rules applied. Total rules applied 2476 place count 78 transition count 83
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2478 place count 76 transition count 81
Iterating global reduction 10 with 2 rules applied. Total rules applied 2480 place count 76 transition count 81
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2482 place count 76 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2484 place count 74 transition count 79
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 2502 place count 74 transition count 61
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 2520 place count 56 transition count 61
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 2521 place count 55 transition count 58
Iterating global reduction 12 with 1 rules applied. Total rules applied 2522 place count 55 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2523 place count 55 transition count 58
Applied a total of 2523 rules in 761 ms. Remains 55 /997 variables (removed 942) and now considering 58/4292 (removed 4234) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 58 rows 55 cols
[2024-05-25 09:42:17] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 09:42:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:42:17] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 8 ms returned sat
[2024-05-25 09:42:17] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:42:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:42:17] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 09:42:17] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:42:18] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-25 09:42:18] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 151 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1180/1180 places, 2599/2599 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 1180 transition count 2567
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1148 transition count 2567
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 64 place count 1148 transition count 2551
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 1132 transition count 2551
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 128 place count 1116 transition count 2535
Applied a total of 128 rules in 154 ms. Remains 1116 /1180 variables (removed 64) and now considering 2535/2599 (removed 64) transitions.
[2024-05-25 09:42:18] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-25 09:42:18] [INFO ] Computed 49 invariants in 30 ms
[2024-05-25 09:42:19] [INFO ] Implicit Places using invariants in 904 ms returned []
[2024-05-25 09:42:19] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-25 09:42:19] [INFO ] Invariant cache hit.
[2024-05-25 09:42:20] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:42:28] [INFO ] Implicit Places using invariants and state equation in 9139 ms returned []
Implicit Place search using SMT with State Equation took 10045 ms to find 0 implicit places.
[2024-05-25 09:42:28] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-25 09:42:28] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-25 09:42:28] [INFO ] Invariant cache hit.
[2024-05-25 09:42:29] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1116/1180 places, 2535/2599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11265 ms. Remains : 1116/1180 places, 2535/2599 transitions.
Computed a total of 299 stabilizing places and 917 stable transitions
Computed a total of 299 stabilizing places and 917 stable transitions
Detected a total of 299/1116 stabilizing places and 917/2535 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 70470 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70470 steps, saw 29962 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:42:33] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-25 09:42:33] [INFO ] Invariant cache hit.
[2024-05-25 09:42:33] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:42:33] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2024-05-25 09:42:33] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:42:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-25 09:42:34] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:42:35] [INFO ] After 1154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:42:35] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:42:36] [INFO ] After 812ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:42:36] [INFO ] Deduced a trap composed of 105 places in 434 ms of which 1 ms to minimize.
[2024-05-25 09:42:37] [INFO ] Deduced a trap composed of 107 places in 452 ms of which 1 ms to minimize.
[2024-05-25 09:42:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1133 ms
[2024-05-25 09:42:38] [INFO ] Deduced a trap composed of 121 places in 462 ms of which 1 ms to minimize.
[2024-05-25 09:42:38] [INFO ] Deduced a trap composed of 80 places in 430 ms of which 1 ms to minimize.
[2024-05-25 09:42:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1128 ms
[2024-05-25 09:42:38] [INFO ] After 3675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 672 ms.
[2024-05-25 09:42:39] [INFO ] After 5796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1116 transition count 4292
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 997 transition count 4292
Applied a total of 238 rules in 228 ms. Remains 997 /1116 variables (removed 119) and now considering 4292/2535 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 997/1116 places, 4292/2535 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 60582 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60582 steps, saw 25571 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:42:43] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
// Phase 1: matrix 3908 rows 997 cols
[2024-05-25 09:42:43] [INFO ] Computed 49 invariants in 109 ms
[2024-05-25 09:42:43] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 09:42:43] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:42:43] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:42:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:42:44] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:42:46] [INFO ] After 2834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:42:47] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:42:49] [INFO ] After 2213ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:42:50] [INFO ] Deduced a trap composed of 89 places in 591 ms of which 1 ms to minimize.
[2024-05-25 09:42:51] [INFO ] Deduced a trap composed of 95 places in 595 ms of which 0 ms to minimize.
[2024-05-25 09:42:51] [INFO ] Deduced a trap composed of 92 places in 576 ms of which 1 ms to minimize.
[2024-05-25 09:42:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2275 ms
[2024-05-25 09:42:53] [INFO ] After 6328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2327 ms.
[2024-05-25 09:42:55] [INFO ] After 11783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 115 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 997/997 places, 4292/4292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 115 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
[2024-05-25 09:42:55] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-25 09:42:55] [INFO ] Invariant cache hit.
[2024-05-25 09:42:57] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-05-25 09:42:57] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-25 09:42:57] [INFO ] Invariant cache hit.
[2024-05-25 09:42:57] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:43:17] [INFO ] Implicit Places using invariants and state equation in 20052 ms returned []
Implicit Place search using SMT with State Equation took 21195 ms to find 0 implicit places.
[2024-05-25 09:43:17] [INFO ] Redundant transitions in 207 ms returned []
[2024-05-25 09:43:17] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-25 09:43:17] [INFO ] Invariant cache hit.
[2024-05-25 09:43:18] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22959 ms. Remains : 997/997 places, 4292/4292 transitions.
Graph (trivial) has 993 edges and 997 vertex of which 15 / 997 are part of one of the 1 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 231 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 623 transitions.
Graph (complete) has 4932 edges and 983 vertex of which 969 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 t1266.t1509 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 952 transition count 3598
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 1 with 174 rules applied. Total rules applied 247 place count 883 transition count 3493
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 112 rules applied. Total rules applied 359 place count 831 transition count 3433
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 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 3 with 39 rules applied. Total rules applied 398 place count 807 transition count 3418
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 416 place count 800 transition count 3407
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 425 place count 791 transition count 3407
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 425 place count 791 transition count 3392
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 455 place count 776 transition count 3392
Discarding 197 places :
Symmetric choice reduction at 6 with 197 rule applications. Total rules 652 place count 579 transition count 1910
Iterating global reduction 6 with 197 rules applied. Total rules applied 849 place count 579 transition count 1910
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 6 with 149 rules applied. Total rules applied 998 place count 579 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 999 place count 578 transition count 1757
Iterating global reduction 7 with 1 rules applied. Total rules applied 1000 place count 578 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1001 place count 577 transition count 1756
Iterating global reduction 7 with 1 rules applied. Total rules applied 1002 place count 577 transition count 1756
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 7 with 800 rules applied. Total rules applied 1802 place count 177 transition count 1356
Drop transitions removed 342 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 368 transitions.
Iterating post reduction 7 with 368 rules applied. Total rules applied 2170 place count 177 transition count 988
Discarding 59 places :
Symmetric choice reduction at 8 with 59 rule applications. Total rules 2229 place count 118 transition count 438
Iterating global reduction 8 with 59 rules applied. Total rules applied 2288 place count 118 transition count 438
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 2317 place count 118 transition count 409
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2319 place count 116 transition count 397
Iterating global reduction 9 with 2 rules applied. Total rules applied 2321 place count 116 transition count 397
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2323 place count 114 transition count 395
Iterating global reduction 9 with 2 rules applied. Total rules applied 2325 place count 114 transition count 395
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 9 with 52 rules applied. Total rules applied 2377 place count 114 transition count 343
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2403 place count 88 transition count 135
Iterating global reduction 9 with 26 rules applied. Total rules applied 2429 place count 88 transition count 135
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 2450 place count 88 transition count 114
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2455 place count 83 transition count 97
Iterating global reduction 10 with 5 rules applied. Total rules applied 2460 place count 83 transition count 97
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2463 place count 80 transition count 94
Iterating global reduction 10 with 3 rules applied. Total rules applied 2466 place count 80 transition count 94
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2472 place count 80 transition count 88
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2474 place count 78 transition count 83
Iterating global reduction 10 with 2 rules applied. Total rules applied 2476 place count 78 transition count 83
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2478 place count 76 transition count 81
Iterating global reduction 10 with 2 rules applied. Total rules applied 2480 place count 76 transition count 81
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2482 place count 76 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2484 place count 74 transition count 79
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 2502 place count 74 transition count 61
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 2520 place count 56 transition count 61
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 2521 place count 55 transition count 58
Iterating global reduction 12 with 1 rules applied. Total rules applied 2522 place count 55 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2523 place count 55 transition count 58
Applied a total of 2523 rules in 734 ms. Remains 55 /997 variables (removed 942) and now considering 58/4292 (removed 4234) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 58 rows 55 cols
[2024-05-25 09:43:19] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 09:43:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:43:19] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 09:43:19] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:43:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:43:19] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 09:43:19] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:43:19] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-25 09:43:19] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1713 reset in 501 ms.
Product exploration explored 100000 steps with 1713 reset in 524 ms.
Built C files in :
/tmp/ltsmin8585893743065540598
[2024-05-25 09:43:21] [INFO ] Too many transitions (2535) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:43:21] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8585893743065540598
Running compilation step : cd /tmp/ltsmin8585893743065540598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8585893743065540598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8585893743065540598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Applied a total of 0 rules in 77 ms. Remains 1116 /1116 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2024-05-25 09:43:24] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-25 09:43:24] [INFO ] Computed 49 invariants in 20 ms
[2024-05-25 09:43:25] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-25 09:43:25] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-25 09:43:25] [INFO ] Invariant cache hit.
[2024-05-25 09:43:25] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:43:33] [INFO ] Implicit Places using invariants and state equation in 8672 ms returned []
Implicit Place search using SMT with State Equation took 9538 ms to find 0 implicit places.
[2024-05-25 09:43:33] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-25 09:43:33] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-25 09:43:33] [INFO ] Invariant cache hit.
[2024-05-25 09:43:34] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10703 ms. Remains : 1116/1116 places, 2535/2535 transitions.
Built C files in :
/tmp/ltsmin3125505571949745541
[2024-05-25 09:43:34] [INFO ] Too many transitions (2535) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:43:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3125505571949745541
Running compilation step : cd /tmp/ltsmin3125505571949745541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3125505571949745541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3125505571949745541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 09:43:38] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:43:38] [INFO ] Flatten gal took : 59 ms
[2024-05-25 09:43:38] [INFO ] Time to serialize gal into /tmp/LTL16447378860811308134.gal : 12 ms
[2024-05-25 09:43:38] [INFO ] Time to serialize properties into /tmp/LTL14681510279364546063.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16447378860811308134.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1730578157631521556.hoa' '-atoms' '/tmp/LTL14681510279364546063.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14681510279364546063.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1730578157631521556.hoa
Detected timeout of ITS tools.
[2024-05-25 09:43:53] [INFO ] Flatten gal took : 54 ms
[2024-05-25 09:43:53] [INFO ] Flatten gal took : 54 ms
[2024-05-25 09:43:53] [INFO ] Time to serialize gal into /tmp/LTL7113201770150857928.gal : 10 ms
[2024-05-25 09:43:53] [INFO ] Time to serialize properties into /tmp/LTL725661770458033822.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7113201770150857928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL725661770458033822.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))")||(("(Node14IsTheNodeMaster<1)")||(F(("(((Node11IsActive>=1)&&(Node11I...314
Formula 0 simplified : XF(!"((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))" & !"(Node14IsTheNodeMaster<1)" & G(!"(((Node11IsActive>=1)&&(Node11IsThe...300
Detected timeout of ITS tools.
[2024-05-25 09:44:08] [INFO ] Flatten gal took : 52 ms
[2024-05-25 09:44:08] [INFO ] Applying decomposition
[2024-05-25 09:44:08] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8490574077670468714.txt' '-o' '/tmp/graph8490574077670468714.bin' '-w' '/tmp/graph8490574077670468714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8490574077670468714.bin' '-l' '-1' '-v' '-w' '/tmp/graph8490574077670468714.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:44:08] [INFO ] Decomposing Gal with order
[2024-05-25 09:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:44:08] [INFO ] Removed a total of 3360 redundant transitions.
[2024-05-25 09:44:08] [INFO ] Flatten gal took : 143 ms
[2024-05-25 09:44:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1050 labels/synchronizations in 112 ms.
[2024-05-25 09:44:09] [INFO ] Time to serialize gal into /tmp/LTL2254359291052567219.gal : 17 ms
[2024-05-25 09:44:09] [INFO ] Time to serialize properties into /tmp/LTL13035563055315879204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2254359291052567219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13035563055315879204.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i1.u74.Node4AsksIsThereANodeMaster<1)||(i1.u128.Node14IsActive<1))")||(("(i1.u1.Node14IsTheNodeMaster<1)")||(F(("(((i1.u100...387
Formula 0 simplified : XF(!"((i1.u74.Node4AsksIsThereANodeMaster<1)||(i1.u128.Node14IsActive<1))" & !"(i1.u1.Node14IsTheNodeMaster<1)" & G(!"(((i1.u100.Nod...373
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14778988775278472028
[2024-05-25 09:44:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14778988775278472028
Running compilation step : cd /tmp/ltsmin14778988775278472028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14778988775278472028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14778988775278472028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 finished in 213406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 52 place count 1277 transition count 2916
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 110 place count 1248 transition count 2916
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 129 place count 1229 transition count 2848
Iterating global reduction 2 with 19 rules applied. Total rules applied 148 place count 1229 transition count 2848
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 148 place count 1229 transition count 2844
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 1225 transition count 2844
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 1213 transition count 2769
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 1213 transition count 2769
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1210 transition count 2745
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1210 transition count 2745
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 240 place count 1183 transition count 2718
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 1177 transition count 2712
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 1177 transition count 2712
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 1171 transition count 2664
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 1171 transition count 2664
Applied a total of 264 rules in 407 ms. Remains 1171 /1303 variables (removed 132) and now considering 2664/2971 (removed 307) transitions.
[2024-05-25 09:44:28] [INFO ] Flow matrix only has 2392 transitions (discarded 272 similar events)
// Phase 1: matrix 2392 rows 1171 cols
[2024-05-25 09:44:28] [INFO ] Computed 66 invariants in 35 ms
[2024-05-25 09:44:29] [INFO ] Implicit Places using invariants in 1012 ms returned [9, 94, 354, 465, 495, 506, 516, 541, 564, 663, 712, 746, 780, 825, 826, 926, 977]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1154/1303 places, 2664/2971 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1144 transition count 2654
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1144 transition count 2654
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1134 transition count 2644
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1134 transition count 2644
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 1125 transition count 2572
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 1125 transition count 2572
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1120 transition count 2567
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 1115 transition count 2562
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 1115 transition count 2562
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1110 transition count 2522
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1110 transition count 2522
Applied a total of 88 rules in 350 ms. Remains 1110 /1154 variables (removed 44) and now considering 2522/2664 (removed 142) transitions.
[2024-05-25 09:44:29] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2024-05-25 09:44:29] [INFO ] Computed 49 invariants in 29 ms
[2024-05-25 09:44:30] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-25 09:44:30] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-25 09:44:30] [INFO ] Invariant cache hit.
[2024-05-25 09:44:31] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-25 09:44:38] [INFO ] Implicit Places using invariants and state equation in 7842 ms returned []
Implicit Place search using SMT with State Equation took 8741 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1303 places, 2522/2971 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10514 ms. Remains : 1110/1303 places, 2522/2971 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-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:(AND (GEQ s1058 1) (GEQ s1088 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 11072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F(p1)))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2810
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 1253 transition count 2746
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 1253 transition count 2746
Applied a total of 100 rules in 183 ms. Remains 1253 /1303 variables (removed 50) and now considering 2746/2971 (removed 225) transitions.
[2024-05-25 09:44:38] [INFO ] Flow matrix only has 2474 transitions (discarded 272 similar events)
// Phase 1: matrix 2474 rows 1253 cols
[2024-05-25 09:44:38] [INFO ] Computed 66 invariants in 41 ms
[2024-05-25 09:44:39] [INFO ] Implicit Places using invariants in 1043 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 766, 800, 837, 882, 883, 987]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2746/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1223 transition count 2732
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1223 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1209 transition count 2718
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1209 transition count 2718
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 1196 transition count 2705
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 1196 transition count 2705
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 1184 transition count 2609
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 1184 transition count 2609
Applied a total of 106 rules in 225 ms. Remains 1184 /1237 variables (removed 53) and now considering 2609/2746 (removed 137) transitions.
[2024-05-25 09:44:39] [INFO ] Flow matrix only has 2337 transitions (discarded 272 similar events)
// Phase 1: matrix 2337 rows 1184 cols
[2024-05-25 09:44:39] [INFO ] Computed 50 invariants in 26 ms
[2024-05-25 09:44:40] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-25 09:44:40] [INFO ] Flow matrix only has 2337 transitions (discarded 272 similar events)
[2024-05-25 09:44:40] [INFO ] Invariant cache hit.
[2024-05-25 09:44:41] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:44:50] [INFO ] Implicit Places using invariants and state equation in 9851 ms returned [1165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10807 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1183/1303 places, 2609/2971 transitions.
Applied a total of 0 rules in 44 ms. Remains 1183 /1183 variables (removed 0) and now considering 2609/2609 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12306 ms. Remains : 1183/1303 places, 2609/2971 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (LT s439 1) (LT s1138 1)), p1:(AND (LT s994 1) (GEQ s726 1) (GEQ s978 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 finished in 12602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2810
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 1253 transition count 2746
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 1253 transition count 2746
Applied a total of 100 rules in 175 ms. Remains 1253 /1303 variables (removed 50) and now considering 2746/2971 (removed 225) transitions.
[2024-05-25 09:44:51] [INFO ] Flow matrix only has 2474 transitions (discarded 272 similar events)
// Phase 1: matrix 2474 rows 1253 cols
[2024-05-25 09:44:51] [INFO ] Computed 66 invariants in 40 ms
[2024-05-25 09:44:52] [INFO ] Implicit Places using invariants in 1067 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 803, 840, 885, 886, 990, 1043]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1069 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2746/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1223 transition count 2732
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1223 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1209 transition count 2718
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1209 transition count 2718
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1195 transition count 2704
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1195 transition count 2704
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1182 transition count 2600
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1182 transition count 2600
Applied a total of 110 rules in 237 ms. Remains 1182 /1237 variables (removed 55) and now considering 2600/2746 (removed 146) transitions.
[2024-05-25 09:44:52] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1182 cols
[2024-05-25 09:44:52] [INFO ] Computed 50 invariants in 23 ms
[2024-05-25 09:44:53] [INFO ] Implicit Places using invariants in 965 ms returned []
[2024-05-25 09:44:53] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
[2024-05-25 09:44:53] [INFO ] Invariant cache hit.
[2024-05-25 09:44:54] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:45:03] [INFO ] Implicit Places using invariants and state equation in 10281 ms returned [1163]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1303 places, 2600/2971 transitions.
Applied a total of 0 rules in 44 ms. Remains 1181 /1181 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12785 ms. Remains : 1181/1303 places, 2600/2971 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s750 1)], 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][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-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 finished in 12954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2818
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2818
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1254 transition count 2754
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1254 transition count 2754
Applied a total of 98 rules in 182 ms. Remains 1254 /1303 variables (removed 49) and now considering 2754/2971 (removed 217) transitions.
[2024-05-25 09:45:04] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1254 cols
[2024-05-25 09:45:04] [INFO ] Computed 66 invariants in 37 ms
[2024-05-25 09:45:05] [INFO ] Implicit Places using invariants in 1032 ms returned [12, 106, 394, 508, 539, 551, 561, 588, 613, 717, 768, 802, 839, 884, 885, 990, 1043]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1034 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2754/2971 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1222 transition count 2739
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1222 transition count 2739
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1207 transition count 2724
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1207 transition count 2724
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1192 transition count 2709
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1192 transition count 2709
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 1178 transition count 2597
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 1178 transition count 2597
Applied a total of 118 rules in 213 ms. Remains 1178 /1237 variables (removed 59) and now considering 2597/2754 (removed 157) transitions.
[2024-05-25 09:45:05] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1178 cols
[2024-05-25 09:45:05] [INFO ] Computed 49 invariants in 41 ms
[2024-05-25 09:45:06] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-25 09:45:06] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
[2024-05-25 09:45:06] [INFO ] Invariant cache hit.
[2024-05-25 09:45:07] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:45:16] [INFO ] Implicit Places using invariants and state equation in 10104 ms returned []
Implicit Place search using SMT with State Equation took 11064 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1303 places, 2597/2971 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12494 ms. Remains : 1178/1303 places, 2597/2971 transitions.
Stuttering acceptance computed with spot in 162 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s880 1) (GEQ s1118 1) (GEQ s1148 1)) (AND (GEQ s880 1) (GEQ s1118 1))), p0:(AND (GEQ s880 1) (GEQ s1118 1)), p2:(AND (GEQ s489 1) (GEQ s1...], 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 1204 reset in 427 ms.
Product exploration explored 100000 steps with 1205 reset in 479 ms.
Computed a total of 346 stabilizing places and 964 stable transitions
Computed a total of 346 stabilizing places and 964 stable transitions
Detected a total of 346/1178 stabilizing places and 964/2597 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (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 15 factoid took 305 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 1425 steps, including 17 resets, run visited all 2 properties in 15 ms. (steps per millisecond=95 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 15 factoid took 489 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1178 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 : 1178/1178 places, 2597/2597 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 1178 transition count 2566
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1147 transition count 2566
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1147 transition count 2550
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1131 transition count 2550
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
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 130 place count 1113 transition count 2532
Applied a total of 130 rules in 143 ms. Remains 1113 /1178 variables (removed 65) and now considering 2532/2597 (removed 65) transitions.
[2024-05-25 09:45:18] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-25 09:45:18] [INFO ] Computed 49 invariants in 27 ms
[2024-05-25 09:45:19] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-25 09:45:19] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-25 09:45:19] [INFO ] Invariant cache hit.
[2024-05-25 09:45:20] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:45:27] [INFO ] Implicit Places using invariants and state equation in 7774 ms returned []
Implicit Place search using SMT with State Equation took 8619 ms to find 0 implicit places.
[2024-05-25 09:45:27] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-25 09:45:27] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-25 09:45:27] [INFO ] Invariant cache hit.
[2024-05-25 09:45:28] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1113/1178 places, 2532/2597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9889 ms. Remains : 1113/1178 places, 2532/2597 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 1649 steps, including 28 resets, run visited all 2 properties in 27 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1713 reset in 516 ms.
Product exploration explored 100000 steps with 1712 reset in 542 ms.
Built C files in :
/tmp/ltsmin3285754125207050226
[2024-05-25 09:45:30] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:45:30] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3285754125207050226
Running compilation step : cd /tmp/ltsmin3285754125207050226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3285754125207050226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3285754125207050226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 207 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2024-05-25 09:45:33] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2024-05-25 09:45:33] [INFO ] Computed 49 invariants in 34 ms
[2024-05-25 09:45:34] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-25 09:45:34] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-25 09:45:34] [INFO ] Invariant cache hit.
[2024-05-25 09:45:35] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-25 09:45:43] [INFO ] Implicit Places using invariants and state equation in 8799 ms returned []
Implicit Place search using SMT with State Equation took 9698 ms to find 0 implicit places.
[2024-05-25 09:45:43] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-25 09:45:43] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-25 09:45:43] [INFO ] Invariant cache hit.
[2024-05-25 09:45:44] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1110/1113 places, 2522/2532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10994 ms. Remains : 1110/1113 places, 2522/2532 transitions.
Built C files in :
/tmp/ltsmin12121906670796837478
[2024-05-25 09:45:44] [INFO ] Too many transitions (2522) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:45:44] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12121906670796837478
Running compilation step : cd /tmp/ltsmin12121906670796837478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12121906670796837478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12121906670796837478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 09:45:47] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:45:47] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:45:47] [INFO ] Time to serialize gal into /tmp/LTL536831990471821534.gal : 11 ms
[2024-05-25 09:45:47] [INFO ] Time to serialize properties into /tmp/LTL17633923216342136004.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL536831990471821534.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3936548335431952521.hoa' '-atoms' '/tmp/LTL17633923216342136004.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL17633923216342136004.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3936548335431952521.hoa
Detected timeout of ITS tools.
[2024-05-25 09:46:02] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:46:02] [INFO ] Flatten gal took : 58 ms
[2024-05-25 09:46:02] [INFO ] Time to serialize gal into /tmp/LTL17761219340584319108.gal : 10 ms
[2024-05-25 09:46:02] [INFO ] Time to serialize properties into /tmp/LTL17927989093606792281.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17761219340584319108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17927989093606792281.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((Node15ManageTheCrashOfNode2<1)||(Lx...583
Formula 0 simplified : G(F!"((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtThe...567
Detected timeout of ITS tools.
[2024-05-25 09:46:17] [INFO ] Flatten gal took : 57 ms
[2024-05-25 09:46:17] [INFO ] Applying decomposition
[2024-05-25 09:46:18] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11073303456058769969.txt' '-o' '/tmp/graph11073303456058769969.bin' '-w' '/tmp/graph11073303456058769969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11073303456058769969.bin' '-l' '-1' '-v' '-w' '/tmp/graph11073303456058769969.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:46:18] [INFO ] Decomposing Gal with order
[2024-05-25 09:46:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:46:18] [INFO ] Removed a total of 2277 redundant transitions.
[2024-05-25 09:46:18] [INFO ] Flatten gal took : 469 ms
[2024-05-25 09:46:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1009 labels/synchronizations in 121 ms.
[2024-05-25 09:46:18] [INFO ] Time to serialize gal into /tmp/LTL493183311795571485.gal : 32 ms
[2024-05-25 09:46:18] [INFO ] Time to serialize properties into /tmp/LTL4410342331554560279.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL493183311795571485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4410342331554560279.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.i2.i0.u19.Node15ManageTheCrashOfNode2<1)||(i3.i2.i0.u157.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((i3.i2.i0...745
Formula 0 simplified : G(F!"((i3.i2.i0.u19.Node15ManageTheCrashOfNode2<1)||(i3.i2.i0.u157.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((i3.i2.i0.u19.Nod...729
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2713078733661059360
[2024-05-25 09:46:34] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2713078733661059360
Running compilation step : cd /tmp/ltsmin2713078733661059360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2713078733661059360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2713078733661059360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 93259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(!p1)) U ((X(!p1)&&p2)||G((!p0&&X(!p1)))))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1280 transition count 2906
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1280 transition count 2906
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 63 place count 1263 transition count 2833
Iterating global reduction 0 with 17 rules applied. Total rules applied 80 place count 1263 transition count 2833
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 1254 transition count 2761
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 1254 transition count 2761
Applied a total of 98 rules in 183 ms. Remains 1254 /1303 variables (removed 49) and now considering 2761/2971 (removed 210) transitions.
[2024-05-25 09:46:37] [INFO ] Flow matrix only has 2489 transitions (discarded 272 similar events)
// Phase 1: matrix 2489 rows 1254 cols
[2024-05-25 09:46:37] [INFO ] Computed 66 invariants in 33 ms
[2024-05-25 09:46:38] [INFO ] Implicit Places using invariants in 1059 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 718, 769, 803, 841, 886, 887, 991, 1044]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1074 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2761/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1224 transition count 2747
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1224 transition count 2747
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1210 transition count 2733
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1210 transition count 2733
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1196 transition count 2719
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1196 transition count 2719
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1183 transition count 2615
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1183 transition count 2615
Applied a total of 110 rules in 227 ms. Remains 1183 /1238 variables (removed 55) and now considering 2615/2761 (removed 146) transitions.
[2024-05-25 09:46:38] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
// Phase 1: matrix 2343 rows 1183 cols
[2024-05-25 09:46:38] [INFO ] Computed 50 invariants in 25 ms
[2024-05-25 09:46:39] [INFO ] Implicit Places using invariants in 978 ms returned []
[2024-05-25 09:46:39] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
[2024-05-25 09:46:39] [INFO ] Invariant cache hit.
[2024-05-25 09:46:40] [INFO ] State equation strengthened by 860 read => feed constraints.
[2024-05-25 09:46:49] [INFO ] Implicit Places using invariants and state equation in 10115 ms returned [1139]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1303 places, 2615/2971 transitions.
Applied a total of 0 rules in 41 ms. Remains 1182 /1182 variables (removed 0) and now considering 2615/2615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12633 ms. Remains : 1182/1303 places, 2615/2971 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s791 1) (GEQ s1156 1))) (NOT (AND (GEQ s593 1) (GEQ s597 1)))), p0:(AND (GEQ s593 1) (GEQ s597 1)), p1:(AND (GEQ s562 1) (GEQ s1156...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1335 ms.
Product exploration explored 100000 steps with 50000 reset in 1351 ms.
Computed a total of 350 stabilizing places and 982 stable transitions
Computed a total of 350 stabilizing places and 982 stable transitions
Detected a total of 350/1182 stabilizing places and 982/2615 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (OR p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 1019 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 finished in 16582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 126 place count 1231 transition count 2850
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 1231 transition count 2850
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 144 place count 1231 transition count 2847
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 1228 transition count 2847
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 161 place count 1217 transition count 2780
Iterating global reduction 2 with 11 rules applied. Total rules applied 172 place count 1217 transition count 2780
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 1214 transition count 2756
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 1214 transition count 2756
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 234 place count 1186 transition count 2728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 1180 transition count 2722
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 1180 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 252 place count 1174 transition count 2674
Iterating global reduction 2 with 6 rules applied. Total rules applied 258 place count 1174 transition count 2674
Applied a total of 258 rules in 414 ms. Remains 1174 /1303 variables (removed 129) and now considering 2674/2971 (removed 297) transitions.
[2024-05-25 09:46:54] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1174 cols
[2024-05-25 09:46:54] [INFO ] Computed 66 invariants in 33 ms
[2024-05-25 09:46:55] [INFO ] Implicit Places using invariants in 1003 ms returned [9, 358, 470, 500, 511, 521, 546, 569, 668, 717, 751, 785, 830, 831, 931, 982]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1158/1303 places, 2674/2971 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1150 transition count 2666
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1150 transition count 2666
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1142 transition count 2658
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1142 transition count 2658
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1135 transition count 2602
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1135 transition count 2602
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1129 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1123 transition count 2590
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1123 transition count 2590
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 1117 transition count 2542
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 1117 transition count 2542
Applied a total of 82 rules in 335 ms. Remains 1117 /1158 variables (removed 41) and now considering 2542/2674 (removed 132) transitions.
[2024-05-25 09:46:55] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2024-05-25 09:46:55] [INFO ] Computed 50 invariants in 23 ms
[2024-05-25 09:46:56] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-05-25 09:46:56] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:46:56] [INFO ] Invariant cache hit.
[2024-05-25 09:46:57] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:47:05] [INFO ] Implicit Places using invariants and state equation in 8901 ms returned []
Implicit Place search using SMT with State Equation took 9835 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1117/1303 places, 2542/2971 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11605 ms. Remains : 1117/1303 places, 2542/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s418 1) (LT s1071 1)), p0:(OR (LT s118 1) (LT s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1711 reset in 485 ms.
Product exploration explored 100000 steps with 1708 reset in 510 ms.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 9716 steps, including 165 resets, run visited all 2 properties in 67 ms. (steps per millisecond=145 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 45 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-25 09:47:07] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:47:07] [INFO ] Invariant cache hit.
[2024-05-25 09:47:08] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-25 09:47:08] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:47:08] [INFO ] Invariant cache hit.
[2024-05-25 09:47:09] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:47:17] [INFO ] Implicit Places using invariants and state equation in 8891 ms returned []
Implicit Place search using SMT with State Equation took 9887 ms to find 0 implicit places.
[2024-05-25 09:47:17] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:47:17] [INFO ] Invariant cache hit.
[2024-05-25 09:47:18] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11018 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-25 09:47:18] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:47:18] [INFO ] Invariant cache hit.
[2024-05-25 09:47:18] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2024-05-25 09:47:18] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2024-05-25 09:47:19] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:47:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-25 09:47:19] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2024-05-25 09:47:20] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:47:20] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:47:20] [INFO ] After 216ms SMT Verify possible using 853 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:47:20] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-25 09:47:21] [INFO ] After 1339ms 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 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 2542/2542 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 1117 transition count 2541
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 1116 transition count 2541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1115 transition count 2540
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1115 transition count 2540
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1114 transition count 2532
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1114 transition count 2532
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 0 with 132 rules applied. Total rules applied 138 place count 1114 transition count 4276
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 0 with 132 rules applied. Total rules applied 270 place count 982 transition count 4276
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 982 transition count 4276
Applied a total of 271 rules in 412 ms. Remains 982 /1117 variables (removed 135) and now considering 4276/2542 (removed -1734) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 982/1117 places, 4276/2542 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68472 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68472 steps, saw 28871 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:47:24] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 982 cols
[2024-05-25 09:47:24] [INFO ] Computed 50 invariants in 26 ms
[2024-05-25 09:47:24] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:47:24] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 13 ms returned sat
[2024-05-25 09:47:25] [INFO ] After 949ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 09:47:25] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:47:26] [INFO ] After 312ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:47:26] [INFO ] After 1455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:47:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:47:26] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 09:47:27] [INFO ] After 907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:47:27] [INFO ] After 412ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:47:27] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-25 09:47:27] [INFO ] After 1718ms 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 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 109 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 982/982 places, 4276/4276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 108 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2024-05-25 09:47:28] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
[2024-05-25 09:47:28] [INFO ] Invariant cache hit.
[2024-05-25 09:47:29] [INFO ] Implicit Places using invariants in 1193 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1212 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4276/4276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4274
Applied a total of 4 rules in 186 ms. Remains 979 /981 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
[2024-05-25 09:47:29] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
// Phase 1: matrix 3876 rows 979 cols
[2024-05-25 09:47:29] [INFO ] Computed 49 invariants in 29 ms
[2024-05-25 09:47:30] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2024-05-25 09:47:30] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:47:30] [INFO ] Invariant cache hit.
[2024-05-25 09:47:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:47:52] [INFO ] Implicit Places using invariants and state equation in 21789 ms returned []
Implicit Place search using SMT with State Equation took 23005 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4274/4276 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24511 ms. Remains : 979/982 places, 4274/4276 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70806 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70806 steps, saw 29845 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:47:55] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:47:55] [INFO ] Invariant cache hit.
[2024-05-25 09:47:55] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:47:55] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:47:56] [INFO ] After 913ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 09:47:56] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:47:57] [INFO ] After 334ms SMT Verify possible using 2722 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:47:57] [INFO ] After 1409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:47:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:47:57] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:47:58] [INFO ] After 1008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:47:58] [INFO ] After 512ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:47:58] [INFO ] After 658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-05-25 09:47:59] [INFO ] After 1919ms 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 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 111 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 104 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2024-05-25 09:47:59] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:47:59] [INFO ] Invariant cache hit.
[2024-05-25 09:48:00] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-25 09:48:00] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:48:00] [INFO ] Invariant cache hit.
[2024-05-25 09:48:01] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:48:20] [INFO ] Implicit Places using invariants and state equation in 20127 ms returned []
Implicit Place search using SMT with State Equation took 21273 ms to find 0 implicit places.
[2024-05-25 09:48:20] [INFO ] Redundant transitions in 216 ms returned []
[2024-05-25 09:48:20] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:48:20] [INFO ] Invariant cache hit.
[2024-05-25 09:48:22] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23085 ms. Remains : 979/979 places, 4274/4274 transitions.
Graph (trivial) has 1053 edges and 979 vertex of which 17 / 979 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 4839 edges and 963 vertex of which 949 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 t1266.t1509 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 932 transition count 3505
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 835 transition count 3312
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 739 transition count 3144
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 667 transition count 3002
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 597 transition count 2882
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 547 transition count 2784
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 499 transition count 2704
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 467 transition count 2642
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 437 transition count 2594
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 419 transition count 2560
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 403 transition count 2536
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 395 transition count 2522
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 389 transition count 2514
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 386 transition count 2512
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 16 Pre rules applied. Total rules applied 1640 place count 386 transition count 2496
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 1672 place count 370 transition count 2496
Discarding 285 places :
Symmetric choice reduction at 14 with 285 rule applications. Total rules 1957 place count 85 transition count 328
Iterating global reduction 14 with 285 rules applied. Total rules applied 2242 place count 85 transition count 328
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 14 with 266 rules applied. Total rules applied 2508 place count 85 transition count 62
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 2521 place count 72 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2521 place count 72 transition count 61
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 2523 place count 71 transition count 61
Discarding 13 places :
Symmetric choice reduction at 16 with 13 rule applications. Total rules 2536 place count 58 transition count 48
Iterating global reduction 16 with 13 rules applied. Total rules applied 2549 place count 58 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2551 place count 57 transition count 47
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2559 place count 57 transition count 39
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 2567 place count 49 transition count 39
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 17 with 8 rules applied. Total rules applied 2575 place count 49 transition count 39
Applied a total of 2575 rules in 393 ms. Remains 49 /979 variables (removed 930) and now considering 39/4274 (removed 4235) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 49 cols
[2024-05-25 09:48:22] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 09:48:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 09:48:22] [INFO ] [Real]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 09:48:22] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:48:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 09:48:22] [INFO ] [Nat]Absence check using 2 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 09:48:22] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:48:22] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 09:48:22] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1711 reset in 469 ms.
Product exploration explored 100000 steps with 1711 reset in 487 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 73 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-25 09:48:24] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-25 09:48:24] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2024-05-25 09:48:24] [INFO ] Computed 50 invariants in 27 ms
[2024-05-25 09:48:25] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1130 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin1166895609954093943
[2024-05-25 09:48:25] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1166895609954093943
Running compilation step : cd /tmp/ltsmin1166895609954093943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1166895609954093943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1166895609954093943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 44 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-25 09:48:28] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:48:28] [INFO ] Invariant cache hit.
[2024-05-25 09:48:29] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-25 09:48:29] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:48:29] [INFO ] Invariant cache hit.
[2024-05-25 09:48:30] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-25 09:48:38] [INFO ] Implicit Places using invariants and state equation in 8620 ms returned []
Implicit Place search using SMT with State Equation took 9535 ms to find 0 implicit places.
[2024-05-25 09:48:38] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-25 09:48:38] [INFO ] Invariant cache hit.
[2024-05-25 09:48:39] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10601 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin6746586937688883388
[2024-05-25 09:48:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6746586937688883388
Running compilation step : cd /tmp/ltsmin6746586937688883388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6746586937688883388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6746586937688883388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 09:48:42] [INFO ] Flatten gal took : 48 ms
[2024-05-25 09:48:42] [INFO ] Flatten gal took : 49 ms
[2024-05-25 09:48:42] [INFO ] Time to serialize gal into /tmp/LTL2563177660295461998.gal : 10 ms
[2024-05-25 09:48:42] [INFO ] Time to serialize properties into /tmp/LTL1800284587490927736.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2563177660295461998.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15129074939280533668.hoa' '-atoms' '/tmp/LTL1800284587490927736.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1800284587490927736.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15129074939280533668.hoa
Detected timeout of ITS tools.
[2024-05-25 09:48:57] [INFO ] Flatten gal took : 47 ms
[2024-05-25 09:48:57] [INFO ] Flatten gal took : 79 ms
[2024-05-25 09:48:57] [INFO ] Time to serialize gal into /tmp/LTL919177922830436233.gal : 9 ms
[2024-05-25 09:48:57] [INFO ] Time to serialize properties into /tmp/LTL14258270890111139774.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL919177922830436233.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14258270890111139774.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))")))||(G("((Node4ManageTheCrashOfNode3<1)...204
Formula 0 simplified : XX(GF!"((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))" & F!"((Node4ManageTheCrashOfNode3<1)||(Lx0I...192
Detected timeout of ITS tools.
[2024-05-25 09:49:12] [INFO ] Flatten gal took : 51 ms
[2024-05-25 09:49:12] [INFO ] Applying decomposition
[2024-05-25 09:49:12] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5492246800254331402.txt' '-o' '/tmp/graph5492246800254331402.bin' '-w' '/tmp/graph5492246800254331402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5492246800254331402.bin' '-l' '-1' '-v' '-w' '/tmp/graph5492246800254331402.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:49:13] [INFO ] Decomposing Gal with order
[2024-05-25 09:49:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:49:13] [INFO ] Removed a total of 2287 redundant transitions.
[2024-05-25 09:49:13] [INFO ] Flatten gal took : 196 ms
[2024-05-25 09:49:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1226 labels/synchronizations in 48 ms.
[2024-05-25 09:49:13] [INFO ] Time to serialize gal into /tmp/LTL13632216046138286499.gal : 15 ms
[2024-05-25 09:49:13] [INFO ] Time to serialize properties into /tmp/LTL10343555787711273482.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13632216046138286499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10343555787711273482.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i18.i2.u20.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i18.i2.u20.LeafSetOfRx3IsSentToNode0<1))")))||(G("((i18.i0....249
Formula 0 simplified : XX(GF!"((i18.i2.u20.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i18.i2.u20.LeafSetOfRx3IsSentToNode0<1))" & F!"((i18.i0.u17.Nod...237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11794721639476375642
[2024-05-25 09:49:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11794721639476375642
Running compilation step : cd /tmp/ltsmin11794721639476375642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11794721639476375642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11794721639476375642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 157734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p1||G(F(p2))))||p0))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 1230 transition count 2842
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 1230 transition count 2842
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 146 place count 1230 transition count 2839
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 1227 transition count 2839
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1213 transition count 2748
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1213 transition count 2748
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 232 place count 1187 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 238 place count 1181 transition count 2716
Iterating global reduction 2 with 6 rules applied. Total rules applied 244 place count 1181 transition count 2716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 250 place count 1175 transition count 2668
Iterating global reduction 2 with 6 rules applied. Total rules applied 256 place count 1175 transition count 2668
Applied a total of 256 rules in 396 ms. Remains 1175 /1303 variables (removed 128) and now considering 2668/2971 (removed 303) transitions.
[2024-05-25 09:49:32] [INFO ] Flow matrix only has 2396 transitions (discarded 272 similar events)
// Phase 1: matrix 2396 rows 1175 cols
[2024-05-25 09:49:32] [INFO ] Computed 66 invariants in 28 ms
[2024-05-25 09:49:33] [INFO ] Implicit Places using invariants in 947 ms returned [9, 95, 355, 466, 496, 507, 517, 542, 565, 665, 714, 748, 830, 831, 932, 983]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 950 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1159/1303 places, 2668/2971 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1151 transition count 2660
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1151 transition count 2660
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1143 transition count 2652
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1143 transition count 2652
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1136 transition count 2596
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1136 transition count 2596
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 58 place count 1130 transition count 2590
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1124 transition count 2584
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1124 transition count 2584
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 1118 transition count 2536
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 1118 transition count 2536
Applied a total of 82 rules in 341 ms. Remains 1118 /1159 variables (removed 41) and now considering 2536/2668 (removed 132) transitions.
[2024-05-25 09:49:33] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-25 09:49:33] [INFO ] Computed 50 invariants in 28 ms
[2024-05-25 09:49:34] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-25 09:49:34] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-25 09:49:34] [INFO ] Invariant cache hit.
[2024-05-25 09:49:34] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:49:42] [INFO ] Implicit Places using invariants and state equation in 8401 ms returned []
Implicit Place search using SMT with State Equation took 9290 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1118/1303 places, 2536/2971 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 10978 ms. Remains : 1118/1303 places, 2536/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s408 1) (LT s743 1) (LT s746 1)), p1:(AND (GEQ s600 1) (GEQ s603 1) (GEQ s940 1)), p2:(AND (GEQ s775 1) (GEQ s830 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1712 reset in 478 ms.
Product exploration explored 100000 steps with 1717 reset in 499 ms.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1118 stabilizing places and 918/2536 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 74089 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74089 steps, saw 31485 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:49:47] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-25 09:49:47] [INFO ] Invariant cache hit.
[2024-05-25 09:49:48] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 09:49:48] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:49:49] [INFO ] After 1402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:49:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 09:49:49] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:49:50] [INFO ] After 1356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:49:50] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:49:51] [INFO ] After 967ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:49:52] [INFO ] Deduced a trap composed of 85 places in 417 ms of which 1 ms to minimize.
[2024-05-25 09:49:53] [INFO ] Deduced a trap composed of 90 places in 425 ms of which 1 ms to minimize.
[2024-05-25 09:49:53] [INFO ] Deduced a trap composed of 101 places in 443 ms of which 1 ms to minimize.
[2024-05-25 09:49:54] [INFO ] Deduced a trap composed of 141 places in 473 ms of which 1 ms to minimize.
[2024-05-25 09:49:54] [INFO ] Deduced a trap composed of 114 places in 444 ms of which 0 ms to minimize.
[2024-05-25 09:49:55] [INFO ] Deduced a trap composed of 88 places in 452 ms of which 1 ms to minimize.
[2024-05-25 09:49:55] [INFO ] Deduced a trap composed of 84 places in 456 ms of which 1 ms to minimize.
[2024-05-25 09:49:56] [INFO ] Deduced a trap composed of 126 places in 453 ms of which 1 ms to minimize.
[2024-05-25 09:49:56] [INFO ] Deduced a trap composed of 82 places in 431 ms of which 1 ms to minimize.
[2024-05-25 09:49:57] [INFO ] Deduced a trap composed of 96 places in 416 ms of which 1 ms to minimize.
[2024-05-25 09:49:57] [INFO ] Deduced a trap composed of 134 places in 407 ms of which 1 ms to minimize.
[2024-05-25 09:49:58] [INFO ] Deduced a trap composed of 101 places in 411 ms of which 1 ms to minimize.
[2024-05-25 09:49:59] [INFO ] Deduced a trap composed of 92 places in 426 ms of which 1 ms to minimize.
[2024-05-25 09:49:59] [INFO ] Deduced a trap composed of 80 places in 426 ms of which 1 ms to minimize.
[2024-05-25 09:49:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7788 ms
[2024-05-25 09:50:00] [INFO ] Deduced a trap composed of 120 places in 401 ms of which 1 ms to minimize.
[2024-05-25 09:50:01] [INFO ] Deduced a trap composed of 89 places in 450 ms of which 1 ms to minimize.
[2024-05-25 09:50:01] [INFO ] Deduced a trap composed of 88 places in 445 ms of which 1 ms to minimize.
[2024-05-25 09:50:02] [INFO ] Deduced a trap composed of 175 places in 445 ms of which 1 ms to minimize.
[2024-05-25 09:50:02] [INFO ] Deduced a trap composed of 142 places in 437 ms of which 1 ms to minimize.
[2024-05-25 09:50:03] [INFO ] Deduced a trap composed of 93 places in 431 ms of which 1 ms to minimize.
[2024-05-25 09:50:04] [INFO ] Deduced a trap composed of 118 places in 459 ms of which 0 ms to minimize.
[2024-05-25 09:50:04] [INFO ] Deduced a trap composed of 96 places in 431 ms of which 1 ms to minimize.
[2024-05-25 09:50:05] [INFO ] Deduced a trap composed of 93 places in 458 ms of which 0 ms to minimize.
[2024-05-25 09:50:05] [INFO ] Deduced a trap composed of 92 places in 443 ms of which 1 ms to minimize.
[2024-05-25 09:50:06] [INFO ] Deduced a trap composed of 101 places in 472 ms of which 1 ms to minimize.
[2024-05-25 09:50:06] [INFO ] Deduced a trap composed of 119 places in 435 ms of which 1 ms to minimize.
[2024-05-25 09:50:07] [INFO ] Deduced a trap composed of 104 places in 456 ms of which 1 ms to minimize.
[2024-05-25 09:50:07] [INFO ] Deduced a trap composed of 135 places in 459 ms of which 1 ms to minimize.
[2024-05-25 09:50:08] [INFO ] Deduced a trap composed of 108 places in 434 ms of which 1 ms to minimize.
[2024-05-25 09:50:09] [INFO ] Deduced a trap composed of 122 places in 448 ms of which 1 ms to minimize.
[2024-05-25 09:50:09] [INFO ] Deduced a trap composed of 122 places in 430 ms of which 1 ms to minimize.
[2024-05-25 09:50:10] [INFO ] Deduced a trap composed of 116 places in 484 ms of which 1 ms to minimize.
[2024-05-25 09:50:10] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 1 ms to minimize.
[2024-05-25 09:50:11] [INFO ] Deduced a trap composed of 90 places in 480 ms of which 1 ms to minimize.
[2024-05-25 09:50:11] [INFO ] Deduced a trap composed of 96 places in 443 ms of which 1 ms to minimize.
[2024-05-25 09:50:12] [INFO ] Deduced a trap composed of 93 places in 473 ms of which 1 ms to minimize.
[2024-05-25 09:50:13] [INFO ] Deduced a trap composed of 108 places in 462 ms of which 1 ms to minimize.
[2024-05-25 09:50:13] [INFO ] Deduced a trap composed of 90 places in 490 ms of which 1 ms to minimize.
[2024-05-25 09:50:14] [INFO ] Deduced a trap composed of 160 places in 464 ms of which 1 ms to minimize.
[2024-05-25 09:50:14] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 13824 ms
[2024-05-25 09:50:14] [INFO ] After 23366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-25 09:50:14] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1118 transition count 4293
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 999 transition count 4293
Applied a total of 238 rules in 195 ms. Remains 999 /1118 variables (removed 119) and now considering 4293/2536 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 999/1118 places, 4293/2536 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 62588 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62588 steps, saw 26402 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:50:18] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
// Phase 1: matrix 3909 rows 999 cols
[2024-05-25 09:50:18] [INFO ] Computed 50 invariants in 32 ms
[2024-05-25 09:50:18] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:50:18] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2024-05-25 09:50:18] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:50:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2024-05-25 09:50:18] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-25 09:50:21] [INFO ] After 2616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:50:21] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:50:23] [INFO ] After 2290ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:50:24] [INFO ] Deduced a trap composed of 98 places in 562 ms of which 1 ms to minimize.
[2024-05-25 09:50:25] [INFO ] Deduced a trap composed of 79 places in 587 ms of which 1 ms to minimize.
[2024-05-25 09:50:26] [INFO ] Deduced a trap composed of 84 places in 557 ms of which 1 ms to minimize.
[2024-05-25 09:50:26] [INFO ] Deduced a trap composed of 77 places in 570 ms of which 1 ms to minimize.
[2024-05-25 09:50:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3068 ms
[2024-05-25 09:50:28] [INFO ] Deduced a trap composed of 85 places in 566 ms of which 0 ms to minimize.
[2024-05-25 09:50:29] [INFO ] Deduced a trap composed of 81 places in 561 ms of which 1 ms to minimize.
[2024-05-25 09:50:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2280 ms
[2024-05-25 09:50:30] [INFO ] After 8646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 966 ms.
[2024-05-25 09:50:31] [INFO ] After 12507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 112 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 999/999 places, 4293/4293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 135 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-25 09:50:31] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-25 09:50:31] [INFO ] Invariant cache hit.
[2024-05-25 09:50:32] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-25 09:50:32] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-25 09:50:32] [INFO ] Invariant cache hit.
[2024-05-25 09:50:33] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:50:52] [INFO ] Implicit Places using invariants and state equation in 20057 ms returned []
Implicit Place search using SMT with State Equation took 21210 ms to find 0 implicit places.
[2024-05-25 09:50:52] [INFO ] Redundant transitions in 205 ms returned []
[2024-05-25 09:50:52] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-25 09:50:52] [INFO ] Invariant cache hit.
[2024-05-25 09:50:54] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23022 ms. Remains : 999/999 places, 4293/4293 transitions.
Graph (trivial) has 994 edges and 999 vertex of which 15 / 999 are part of one of the 1 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 231 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 623 transitions.
Graph (complete) has 4934 edges and 985 vertex of which 971 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 t1266.t1509 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 954 transition count 3599
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 1 with 174 rules applied. Total rules applied 247 place count 885 transition count 3494
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 112 rules applied. Total rules applied 359 place count 833 transition count 3434
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 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 3 with 39 rules applied. Total rules applied 398 place count 809 transition count 3419
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 416 place count 802 transition count 3408
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 425 place count 793 transition count 3408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 425 place count 793 transition count 3392
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 457 place count 777 transition count 3392
Discarding 197 places :
Symmetric choice reduction at 6 with 197 rule applications. Total rules 654 place count 580 transition count 1910
Iterating global reduction 6 with 197 rules applied. Total rules applied 851 place count 580 transition count 1910
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 6 with 149 rules applied. Total rules applied 1000 place count 580 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1001 place count 579 transition count 1757
Iterating global reduction 7 with 1 rules applied. Total rules applied 1002 place count 579 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1003 place count 578 transition count 1756
Iterating global reduction 7 with 1 rules applied. Total rules applied 1004 place count 578 transition count 1756
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Deduced a syphon composed of 400 places in 0 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 7 with 800 rules applied. Total rules applied 1804 place count 178 transition count 1356
Drop transitions removed 342 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 368 transitions.
Iterating post reduction 7 with 368 rules applied. Total rules applied 2172 place count 178 transition count 988
Discarding 59 places :
Symmetric choice reduction at 8 with 59 rule applications. Total rules 2231 place count 119 transition count 438
Iterating global reduction 8 with 59 rules applied. Total rules applied 2290 place count 119 transition count 438
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 2319 place count 119 transition count 409
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2321 place count 117 transition count 397
Iterating global reduction 9 with 2 rules applied. Total rules applied 2323 place count 117 transition count 397
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2325 place count 115 transition count 395
Iterating global reduction 9 with 2 rules applied. Total rules applied 2327 place count 115 transition count 395
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 9 with 52 rules applied. Total rules applied 2379 place count 115 transition count 343
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2405 place count 89 transition count 135
Iterating global reduction 9 with 26 rules applied. Total rules applied 2431 place count 89 transition count 135
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 2452 place count 89 transition count 114
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2457 place count 84 transition count 97
Iterating global reduction 10 with 5 rules applied. Total rules applied 2462 place count 84 transition count 97
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2465 place count 81 transition count 94
Iterating global reduction 10 with 3 rules applied. Total rules applied 2468 place count 81 transition count 94
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2474 place count 81 transition count 88
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2476 place count 79 transition count 83
Iterating global reduction 10 with 2 rules applied. Total rules applied 2478 place count 79 transition count 83
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2480 place count 77 transition count 81
Iterating global reduction 10 with 2 rules applied. Total rules applied 2482 place count 77 transition count 81
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2484 place count 77 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2486 place count 75 transition count 79
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 2504 place count 75 transition count 61
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 2522 place count 57 transition count 61
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 2523 place count 56 transition count 58
Iterating global reduction 12 with 1 rules applied. Total rules applied 2524 place count 56 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2525 place count 56 transition count 58
Applied a total of 2525 rules in 731 ms. Remains 56 /999 variables (removed 943) and now considering 58/4293 (removed 4235) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 58 rows 56 cols
[2024-05-25 09:50:54] [INFO ] Computed 20 invariants in 0 ms
[2024-05-25 09:50:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:50:54] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 09:50:54] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:50:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:50:54] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 09:50:55] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:50:55] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-25 09:50:55] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 155 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Applied a total of 0 rules in 86 ms. Remains 1118 /1118 variables (removed 0) and now considering 2536/2536 (removed 0) transitions.
[2024-05-25 09:50:55] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-25 09:50:55] [INFO ] Computed 50 invariants in 18 ms
[2024-05-25 09:50:56] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-25 09:50:56] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-25 09:50:56] [INFO ] Invariant cache hit.
[2024-05-25 09:50:57] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:51:04] [INFO ] Implicit Places using invariants and state equation in 8124 ms returned []
Implicit Place search using SMT with State Equation took 8993 ms to find 0 implicit places.
[2024-05-25 09:51:04] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-25 09:51:04] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-25 09:51:04] [INFO ] Invariant cache hit.
[2024-05-25 09:51:05] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10184 ms. Remains : 1118/1118 places, 2536/2536 transitions.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1118 stabilizing places and 918/2536 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 74975 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74975 steps, saw 31858 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:51:09] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-25 09:51:09] [INFO ] Invariant cache hit.
[2024-05-25 09:51:09] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:51:09] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:51:10] [INFO ] After 1441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:51:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:51:10] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 09:51:12] [INFO ] After 1234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:51:12] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:51:13] [INFO ] After 888ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:51:13] [INFO ] Deduced a trap composed of 85 places in 430 ms of which 1 ms to minimize.
[2024-05-25 09:51:14] [INFO ] Deduced a trap composed of 90 places in 419 ms of which 1 ms to minimize.
[2024-05-25 09:51:14] [INFO ] Deduced a trap composed of 101 places in 452 ms of which 1 ms to minimize.
[2024-05-25 09:51:15] [INFO ] Deduced a trap composed of 141 places in 461 ms of which 1 ms to minimize.
[2024-05-25 09:51:16] [INFO ] Deduced a trap composed of 114 places in 468 ms of which 1 ms to minimize.
[2024-05-25 09:51:16] [INFO ] Deduced a trap composed of 88 places in 448 ms of which 1 ms to minimize.
[2024-05-25 09:51:17] [INFO ] Deduced a trap composed of 84 places in 461 ms of which 1 ms to minimize.
[2024-05-25 09:51:17] [INFO ] Deduced a trap composed of 126 places in 498 ms of which 1 ms to minimize.
[2024-05-25 09:51:18] [INFO ] Deduced a trap composed of 82 places in 438 ms of which 1 ms to minimize.
[2024-05-25 09:51:18] [INFO ] Deduced a trap composed of 96 places in 449 ms of which 1 ms to minimize.
[2024-05-25 09:51:19] [INFO ] Deduced a trap composed of 134 places in 416 ms of which 1 ms to minimize.
[2024-05-25 09:51:19] [INFO ] Deduced a trap composed of 101 places in 438 ms of which 1 ms to minimize.
[2024-05-25 09:51:20] [INFO ] Deduced a trap composed of 92 places in 428 ms of which 1 ms to minimize.
[2024-05-25 09:51:21] [INFO ] Deduced a trap composed of 80 places in 474 ms of which 1 ms to minimize.
[2024-05-25 09:51:21] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7848 ms
[2024-05-25 09:51:22] [INFO ] Deduced a trap composed of 120 places in 402 ms of which 1 ms to minimize.
[2024-05-25 09:51:22] [INFO ] Deduced a trap composed of 89 places in 476 ms of which 1 ms to minimize.
[2024-05-25 09:51:23] [INFO ] Deduced a trap composed of 88 places in 464 ms of which 2 ms to minimize.
[2024-05-25 09:51:23] [INFO ] Deduced a trap composed of 175 places in 483 ms of which 1 ms to minimize.
[2024-05-25 09:51:24] [INFO ] Deduced a trap composed of 142 places in 471 ms of which 2 ms to minimize.
[2024-05-25 09:51:24] [INFO ] Deduced a trap composed of 93 places in 461 ms of which 1 ms to minimize.
[2024-05-25 09:51:25] [INFO ] Deduced a trap composed of 118 places in 487 ms of which 1 ms to minimize.
[2024-05-25 09:51:26] [INFO ] Deduced a trap composed of 96 places in 481 ms of which 1 ms to minimize.
[2024-05-25 09:51:26] [INFO ] Deduced a trap composed of 93 places in 484 ms of which 1 ms to minimize.
[2024-05-25 09:51:27] [INFO ] Deduced a trap composed of 92 places in 493 ms of which 1 ms to minimize.
[2024-05-25 09:51:28] [INFO ] Deduced a trap composed of 101 places in 482 ms of which 1 ms to minimize.
[2024-05-25 09:51:28] [INFO ] Deduced a trap composed of 119 places in 469 ms of which 1 ms to minimize.
[2024-05-25 09:51:29] [INFO ] Deduced a trap composed of 104 places in 494 ms of which 1 ms to minimize.
[2024-05-25 09:51:29] [INFO ] Deduced a trap composed of 135 places in 493 ms of which 1 ms to minimize.
[2024-05-25 09:51:30] [INFO ] Deduced a trap composed of 108 places in 487 ms of which 1 ms to minimize.
[2024-05-25 09:51:30] [INFO ] Deduced a trap composed of 122 places in 451 ms of which 1 ms to minimize.
[2024-05-25 09:51:31] [INFO ] Deduced a trap composed of 122 places in 459 ms of which 1 ms to minimize.
[2024-05-25 09:51:32] [INFO ] Deduced a trap composed of 116 places in 472 ms of which 3 ms to minimize.
[2024-05-25 09:51:32] [INFO ] Deduced a trap composed of 95 places in 454 ms of which 1 ms to minimize.
[2024-05-25 09:51:33] [INFO ] Deduced a trap composed of 90 places in 467 ms of which 1 ms to minimize.
[2024-05-25 09:51:33] [INFO ] Deduced a trap composed of 96 places in 454 ms of which 1 ms to minimize.
[2024-05-25 09:51:34] [INFO ] Deduced a trap composed of 93 places in 477 ms of which 4 ms to minimize.
[2024-05-25 09:51:34] [INFO ] Deduced a trap composed of 108 places in 428 ms of which 2 ms to minimize.
[2024-05-25 09:51:35] [INFO ] Deduced a trap composed of 90 places in 468 ms of which 1 ms to minimize.
[2024-05-25 09:51:36] [INFO ] Deduced a trap composed of 160 places in 489 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 09:51:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:51:36] [INFO ] After 25346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1118 transition count 4293
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 999 transition count 4293
Applied a total of 238 rules in 195 ms. Remains 999 /1118 variables (removed 119) and now considering 4293/2536 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 999/1118 places, 4293/2536 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 60850 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60850 steps, saw 25674 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 09:51:39] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
// Phase 1: matrix 3909 rows 999 cols
[2024-05-25 09:51:39] [INFO ] Computed 50 invariants in 26 ms
[2024-05-25 09:51:40] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2024-05-25 09:51:40] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-25 09:51:40] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:51:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2024-05-25 09:51:40] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-25 09:51:43] [INFO ] After 2787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:51:43] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:51:45] [INFO ] After 2291ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 09:51:46] [INFO ] Deduced a trap composed of 98 places in 547 ms of which 1 ms to minimize.
[2024-05-25 09:51:47] [INFO ] Deduced a trap composed of 79 places in 581 ms of which 1 ms to minimize.
[2024-05-25 09:51:47] [INFO ] Deduced a trap composed of 84 places in 581 ms of which 1 ms to minimize.
[2024-05-25 09:51:48] [INFO ] Deduced a trap composed of 77 places in 547 ms of which 0 ms to minimize.
[2024-05-25 09:51:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3029 ms
[2024-05-25 09:51:50] [INFO ] Deduced a trap composed of 85 places in 556 ms of which 2 ms to minimize.
[2024-05-25 09:51:51] [INFO ] Deduced a trap composed of 81 places in 556 ms of which 1 ms to minimize.
[2024-05-25 09:51:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2241 ms
[2024-05-25 09:51:51] [INFO ] After 8574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 946 ms.
[2024-05-25 09:51:52] [INFO ] After 12595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 108 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 999/999 places, 4293/4293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 115 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-25 09:51:53] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-25 09:51:53] [INFO ] Invariant cache hit.
[2024-05-25 09:51:54] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2024-05-25 09:51:54] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-25 09:51:54] [INFO ] Invariant cache hit.
[2024-05-25 09:51:54] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:52:15] [INFO ] Implicit Places using invariants and state equation in 20924 ms returned []
Implicit Place search using SMT with State Equation took 22018 ms to find 0 implicit places.
[2024-05-25 09:52:15] [INFO ] Redundant transitions in 206 ms returned []
[2024-05-25 09:52:15] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-25 09:52:15] [INFO ] Invariant cache hit.
[2024-05-25 09:52:16] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23761 ms. Remains : 999/999 places, 4293/4293 transitions.
Graph (trivial) has 994 edges and 999 vertex of which 15 / 999 are part of one of the 1 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 231 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 623 transitions.
Graph (complete) has 4934 edges and 985 vertex of which 971 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 t1266.t1509 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 954 transition count 3599
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 1 with 174 rules applied. Total rules applied 247 place count 885 transition count 3494
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 112 rules applied. Total rules applied 359 place count 833 transition count 3434
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 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 3 with 39 rules applied. Total rules applied 398 place count 809 transition count 3419
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 416 place count 802 transition count 3408
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 425 place count 793 transition count 3408
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 425 place count 793 transition count 3392
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 457 place count 777 transition count 3392
Discarding 197 places :
Symmetric choice reduction at 6 with 197 rule applications. Total rules 654 place count 580 transition count 1910
Iterating global reduction 6 with 197 rules applied. Total rules applied 851 place count 580 transition count 1910
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 6 with 149 rules applied. Total rules applied 1000 place count 580 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1001 place count 579 transition count 1757
Iterating global reduction 7 with 1 rules applied. Total rules applied 1002 place count 579 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1003 place count 578 transition count 1756
Iterating global reduction 7 with 1 rules applied. Total rules applied 1004 place count 578 transition count 1756
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 7 with 800 rules applied. Total rules applied 1804 place count 178 transition count 1356
Drop transitions removed 342 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 368 transitions.
Iterating post reduction 7 with 368 rules applied. Total rules applied 2172 place count 178 transition count 988
Discarding 59 places :
Symmetric choice reduction at 8 with 59 rule applications. Total rules 2231 place count 119 transition count 438
Iterating global reduction 8 with 59 rules applied. Total rules applied 2290 place count 119 transition count 438
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 2319 place count 119 transition count 409
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2321 place count 117 transition count 397
Iterating global reduction 9 with 2 rules applied. Total rules applied 2323 place count 117 transition count 397
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2325 place count 115 transition count 395
Iterating global reduction 9 with 2 rules applied. Total rules applied 2327 place count 115 transition count 395
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 9 with 52 rules applied. Total rules applied 2379 place count 115 transition count 343
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 2405 place count 89 transition count 135
Iterating global reduction 9 with 26 rules applied. Total rules applied 2431 place count 89 transition count 135
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 2452 place count 89 transition count 114
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2457 place count 84 transition count 97
Iterating global reduction 10 with 5 rules applied. Total rules applied 2462 place count 84 transition count 97
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2465 place count 81 transition count 94
Iterating global reduction 10 with 3 rules applied. Total rules applied 2468 place count 81 transition count 94
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2474 place count 81 transition count 88
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2476 place count 79 transition count 83
Iterating global reduction 10 with 2 rules applied. Total rules applied 2478 place count 79 transition count 83
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2480 place count 77 transition count 81
Iterating global reduction 10 with 2 rules applied. Total rules applied 2482 place count 77 transition count 81
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2484 place count 77 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2486 place count 75 transition count 79
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 2504 place count 75 transition count 61
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 2522 place count 57 transition count 61
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 2523 place count 56 transition count 58
Iterating global reduction 12 with 1 rules applied. Total rules applied 2524 place count 56 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2525 place count 56 transition count 58
Applied a total of 2525 rules in 718 ms. Remains 56 /999 variables (removed 943) and now considering 58/4293 (removed 4235) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 58 rows 56 cols
[2024-05-25 09:52:17] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 09:52:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 09:52:17] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 09:52:17] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 09:52:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:52:17] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-25 09:52:17] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 09:52:17] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-25 09:52:17] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1712 reset in 473 ms.
Product exploration explored 100000 steps with 1713 reset in 492 ms.
Built C files in :
/tmp/ltsmin4855169475639638702
[2024-05-25 09:52:19] [INFO ] Too many transitions (2536) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:52:19] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4855169475639638702
Running compilation step : cd /tmp/ltsmin4855169475639638702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4855169475639638702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4855169475639638702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Applied a total of 0 rules in 67 ms. Remains 1118 /1118 variables (removed 0) and now considering 2536/2536 (removed 0) transitions.
[2024-05-25 09:52:22] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-25 09:52:22] [INFO ] Computed 50 invariants in 26 ms
[2024-05-25 09:52:23] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-05-25 09:52:23] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-25 09:52:23] [INFO ] Invariant cache hit.
[2024-05-25 09:52:23] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:52:31] [INFO ] Implicit Places using invariants and state equation in 8210 ms returned []
Implicit Place search using SMT with State Equation took 9157 ms to find 0 implicit places.
[2024-05-25 09:52:31] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-25 09:52:31] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-25 09:52:31] [INFO ] Invariant cache hit.
[2024-05-25 09:52:32] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10304 ms. Remains : 1118/1118 places, 2536/2536 transitions.
Built C files in :
/tmp/ltsmin3251990720588648957
[2024-05-25 09:52:32] [INFO ] Too many transitions (2536) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:52:32] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3251990720588648957
Running compilation step : cd /tmp/ltsmin3251990720588648957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3251990720588648957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3251990720588648957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 09:52:35] [INFO ] Flatten gal took : 50 ms
[2024-05-25 09:52:35] [INFO ] Flatten gal took : 50 ms
[2024-05-25 09:52:35] [INFO ] Time to serialize gal into /tmp/LTL12827856257840907919.gal : 9 ms
[2024-05-25 09:52:35] [INFO ] Time to serialize properties into /tmp/LTL5421198216295760837.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12827856257840907919.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12606202251829234896.hoa' '-atoms' '/tmp/LTL5421198216295760837.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5421198216295760837.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12606202251829234896.hoa
Detected timeout of ITS tools.
[2024-05-25 09:52:50] [INFO ] Flatten gal took : 48 ms
[2024-05-25 09:52:50] [INFO ] Flatten gal took : 50 ms
[2024-05-25 09:52:50] [INFO ] Time to serialize gal into /tmp/LTL4756059932894024273.gal : 8 ms
[2024-05-25 09:52:50] [INFO ] Time to serialize properties into /tmp/LTL1825748174941039355.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4756059932894024273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1825748174941039355.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))")||(("(Node14IsTheNodeMaster<1)")||(F(("(((Node11IsActive>=1)&&(Node11I...314
Formula 0 simplified : XF(!"((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))" & !"(Node14IsTheNodeMaster<1)" & G(!"(((Node11IsActive>=1)&&(Node11IsThe...300
Detected timeout of ITS tools.
[2024-05-25 09:53:05] [INFO ] Flatten gal took : 52 ms
[2024-05-25 09:53:05] [INFO ] Applying decomposition
[2024-05-25 09:53:06] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3000661006726775466.txt' '-o' '/tmp/graph3000661006726775466.bin' '-w' '/tmp/graph3000661006726775466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3000661006726775466.bin' '-l' '-1' '-v' '-w' '/tmp/graph3000661006726775466.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:53:06] [INFO ] Decomposing Gal with order
[2024-05-25 09:53:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:53:06] [INFO ] Removed a total of 2239 redundant transitions.
[2024-05-25 09:53:06] [INFO ] Flatten gal took : 164 ms
[2024-05-25 09:53:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1048 labels/synchronizations in 47 ms.
[2024-05-25 09:53:06] [INFO ] Time to serialize gal into /tmp/LTL12697581326816682785.gal : 15 ms
[2024-05-25 09:53:06] [INFO ] Time to serialize properties into /tmp/LTL9587007483342955129.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12697581326816682785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9587007483342955129.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u0.Node4AsksIsThereANodeMaster<1)||(u0.Node14IsActive<1))")||(("(u0.Node14IsTheNodeMaster<1)")||(F(("(((u0.Node11IsActive>=...356
Formula 0 simplified : XF(!"((u0.Node4AsksIsThereANodeMaster<1)||(u0.Node14IsActive<1))" & !"(u0.Node14IsTheNodeMaster<1)" & G(!"(((u0.Node11IsActive>=1)&&...342
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4599994581892417667
[2024-05-25 09:53:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4599994581892417667
Running compilation step : cd /tmp/ltsmin4599994581892417667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4599994581892417667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4599994581892417667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 finished in 233142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Stuttering acceptance computed with spot in 131 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 126 place count 1231 transition count 2850
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 1231 transition count 2850
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 144 place count 1231 transition count 2846
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 1227 transition count 2846
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 1214 transition count 2756
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 1214 transition count 2756
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 234 place count 1186 transition count 2728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 1180 transition count 2722
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 1180 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 252 place count 1174 transition count 2674
Iterating global reduction 2 with 6 rules applied. Total rules applied 258 place count 1174 transition count 2674
Applied a total of 258 rules in 366 ms. Remains 1174 /1303 variables (removed 129) and now considering 2674/2971 (removed 297) transitions.
[2024-05-25 09:53:25] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1174 cols
[2024-05-25 09:53:25] [INFO ] Computed 66 invariants in 34 ms
[2024-05-25 09:53:26] [INFO ] Implicit Places using invariants in 959 ms returned [9, 94, 357, 468, 498, 509, 519, 544, 567, 666, 715, 749, 783, 828, 829, 930, 981]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 987 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1157/1303 places, 2674/2971 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1147 transition count 2664
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1147 transition count 2664
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1137 transition count 2654
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1137 transition count 2654
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 1128 transition count 2582
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 1128 transition count 2582
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1123 transition count 2577
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 1118 transition count 2572
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 1118 transition count 2572
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1113 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1113 transition count 2532
Applied a total of 88 rules in 318 ms. Remains 1113 /1157 variables (removed 44) and now considering 2532/2674 (removed 142) transitions.
[2024-05-25 09:53:26] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-25 09:53:26] [INFO ] Computed 49 invariants in 27 ms
[2024-05-25 09:53:27] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-25 09:53:27] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-25 09:53:27] [INFO ] Invariant cache hit.
[2024-05-25 09:53:28] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:53:35] [INFO ] Implicit Places using invariants and state equation in 8457 ms returned []
Implicit Place search using SMT with State Equation took 9371 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1113/1303 places, 2532/2971 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11042 ms. Remains : 1113/1303 places, 2532/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s833 1) (GEQ s1069 1) (GEQ s1096 1)) (AND (GEQ s833 1) (GEQ s1069 1))), p0:(AND (GEQ s833 1) (GEQ s1069 1)), p2:(AND (GEQ s453 1) (GEQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1710 reset in 467 ms.
Product exploration explored 100000 steps with 1713 reset in 493 ms.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (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 15 factoid took 278 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 76538 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76538 steps, saw 32566 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 09:53:40] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-25 09:53:40] [INFO ] Invariant cache hit.
[2024-05-25 09:53:40] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:53:40] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-25 09:53:40] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:53:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:53:40] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:53:41] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:53:41] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:53:41] [INFO ] After 164ms SMT Verify possible using 846 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 09:53:42] [INFO ] Deduced a trap composed of 227 places in 425 ms of which 1 ms to minimize.
[2024-05-25 09:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 539 ms
[2024-05-25 09:53:42] [INFO ] After 1129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2024-05-25 09:53:42] [INFO ] After 2157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 137 place count 1110 transition count 4274
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 268 place count 979 transition count 4274
Applied a total of 268 rules in 331 ms. Remains 979 /1113 variables (removed 134) and now considering 4274/2532 (removed -1742) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 979/1113 places, 4274/2532 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 66132 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66132 steps, saw 27892 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-25 09:53:46] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
// Phase 1: matrix 3876 rows 979 cols
[2024-05-25 09:53:46] [INFO ] Computed 49 invariants in 24 ms
[2024-05-25 09:53:46] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 09:53:46] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:53:47] [INFO ] After 1229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:53:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:53:47] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2024-05-25 09:53:48] [INFO ] After 1151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:53:48] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:53:49] [INFO ] After 347ms SMT Verify possible using 2722 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-25 09:53:49] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-25 09:53:49] [INFO ] After 2257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 114 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 106 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2024-05-25 09:53:50] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:53:50] [INFO ] Invariant cache hit.
[2024-05-25 09:53:51] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2024-05-25 09:53:51] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:53:51] [INFO ] Invariant cache hit.
[2024-05-25 09:53:52] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:54:11] [INFO ] Implicit Places using invariants and state equation in 20016 ms returned []
Implicit Place search using SMT with State Equation took 21226 ms to find 0 implicit places.
[2024-05-25 09:54:11] [INFO ] Redundant transitions in 204 ms returned []
[2024-05-25 09:54:11] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2024-05-25 09:54:11] [INFO ] Invariant cache hit.
[2024-05-25 09:54:12] [INFO ] Dead Transitions using invariants and state equation in 1509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23063 ms. Remains : 979/979 places, 4274/4274 transitions.
Graph (trivial) has 1051 edges and 979 vertex of which 17 / 979 are part of one of the 1 SCC in 0 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 4839 edges and 963 vertex of which 949 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 t1266.t1509 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 932 transition count 3505
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 835 transition count 3312
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 739 transition count 3144
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 667 transition count 3002
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 597 transition count 2882
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 547 transition count 2784
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 499 transition count 2704
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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 93 rules applied. Total rules applied 1428 place count 467 transition count 2643
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1503 place count 438 transition count 2597
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 49 rules applied. Total rules applied 1552 place count 421 transition count 2565
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 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 10 with 37 rules applied. Total rules applied 1589 place count 406 transition count 2543
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 19 rules applied. Total rules applied 1608 place count 399 transition count 2531
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 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 12 with 11 rules applied. Total rules applied 1619 place count 394 transition count 2525
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 3 rules applied. Total rules applied 1622 place count 393 transition count 2523
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1624 place count 392 transition count 2522
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 16 Pre rules applied. Total rules applied 1624 place count 392 transition count 2506
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 15 with 32 rules applied. Total rules applied 1656 place count 376 transition count 2506
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1940 place count 92 transition count 346
Iterating global reduction 15 with 284 rules applied. Total rules applied 2224 place count 92 transition count 346
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 264 rules applied. Total rules applied 2488 place count 92 transition count 82
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2501 place count 80 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2502 place count 79 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2502 place count 79 transition count 80
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2504 place count 78 transition count 80
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2516 place count 66 transition count 68
Iterating global reduction 18 with 12 rules applied. Total rules applied 2528 place count 66 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2536 place count 62 transition count 64
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 2539 place count 62 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2540 place count 62 transition count 60
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 19 with 9 rules applied. Total rules applied 2549 place count 62 transition count 51
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 19 with 9 rules applied. Total rules applied 2558 place count 53 transition count 51
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 20 with 8 rules applied. Total rules applied 2566 place count 53 transition count 51
Applied a total of 2566 rules in 380 ms. Remains 53 /979 variables (removed 926) and now considering 51/4274 (removed 4223) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 51 rows 53 cols
[2024-05-25 09:54:13] [INFO ] Computed 19 invariants in 0 ms
[2024-05-25 09:54:13] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:54:13] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 09:54:13] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 09:54:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-25 09:54:13] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 09:54:13] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 09:54:13] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 09:54:13] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1113 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 : 1113/1113 places, 2532/2532 transitions.
Applied a total of 0 rules in 66 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2024-05-25 09:54:13] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-25 09:54:14] [INFO ] Computed 49 invariants in 24 ms
[2024-05-25 09:54:14] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-25 09:54:14] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-25 09:54:14] [INFO ] Invariant cache hit.
[2024-05-25 09:54:15] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-25 09:54:23] [INFO ] Implicit Places using invariants and state equation in 8362 ms returned []
Implicit Place search using SMT with State Equation took 9285 ms to find 0 implicit places.
[2024-05-25 09:54:23] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-25 09:54:23] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-25 09:54:23] [INFO ] Invariant cache hit.
[2024-05-25 09:54:24] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10443 ms. Remains : 1113/1113 places, 2532/2532 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Finished random walk after 1552 steps, including 26 resets, run visited all 2 properties in 22 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1713 reset in 552 ms.
Product exploration explored 100000 steps with 1713 reset in 508 ms.
Built C files in :
/tmp/ltsmin3039353140456378007
[2024-05-25 09:54:26] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:54:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3039353140456378007
Running compilation step : cd /tmp/ltsmin3039353140456378007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3039353140456378007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3039353140456378007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 199 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2024-05-25 09:54:29] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2024-05-25 09:54:29] [INFO ] Computed 49 invariants in 25 ms
[2024-05-25 09:54:30] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-25 09:54:30] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-25 09:54:30] [INFO ] Invariant cache hit.
[2024-05-25 09:54:31] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-25 09:54:37] [INFO ] Implicit Places using invariants and state equation in 7499 ms returned []
Implicit Place search using SMT with State Equation took 8494 ms to find 0 implicit places.
[2024-05-25 09:54:37] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-25 09:54:37] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-25 09:54:37] [INFO ] Invariant cache hit.
[2024-05-25 09:54:38] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1110/1113 places, 2522/2532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9806 ms. Remains : 1110/1113 places, 2522/2532 transitions.
Built C files in :
/tmp/ltsmin384293158654586084
[2024-05-25 09:54:38] [INFO ] Too many transitions (2522) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:54:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin384293158654586084
Running compilation step : cd /tmp/ltsmin384293158654586084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin384293158654586084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin384293158654586084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 09:54:42] [INFO ] Flatten gal took : 49 ms
[2024-05-25 09:54:42] [INFO ] Flatten gal took : 49 ms
[2024-05-25 09:54:42] [INFO ] Time to serialize gal into /tmp/LTL15895378961934164090.gal : 19 ms
[2024-05-25 09:54:42] [INFO ] Time to serialize properties into /tmp/LTL11550248832152581824.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15895378961934164090.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15196093373585798979.hoa' '-atoms' '/tmp/LTL11550248832152581824.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11550248832152581824.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15196093373585798979.hoa
Detected timeout of ITS tools.
[2024-05-25 09:54:57] [INFO ] Flatten gal took : 51 ms
[2024-05-25 09:54:57] [INFO ] Flatten gal took : 51 ms
[2024-05-25 09:54:57] [INFO ] Time to serialize gal into /tmp/LTL12815348863510420902.gal : 72 ms
[2024-05-25 09:54:57] [INFO ] Time to serialize properties into /tmp/LTL7871469205927723870.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12815348863510420902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7871469205927723870.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((Node15ManageTheCrashOfNode2<1)||(Lx...583
Formula 0 simplified : G(F!"((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtThe...567
Detected timeout of ITS tools.
[2024-05-25 09:55:12] [INFO ] Flatten gal took : 64 ms
[2024-05-25 09:55:12] [INFO ] Applying decomposition
[2024-05-25 09:55:12] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6097570453811248059.txt' '-o' '/tmp/graph6097570453811248059.bin' '-w' '/tmp/graph6097570453811248059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6097570453811248059.bin' '-l' '-1' '-v' '-w' '/tmp/graph6097570453811248059.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:55:12] [INFO ] Decomposing Gal with order
[2024-05-25 09:55:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:55:12] [INFO ] Removed a total of 3115 redundant transitions.
[2024-05-25 09:55:12] [INFO ] Flatten gal took : 176 ms
[2024-05-25 09:55:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1173 labels/synchronizations in 64 ms.
[2024-05-25 09:55:13] [INFO ] Time to serialize gal into /tmp/LTL14793979457335996730.gal : 16 ms
[2024-05-25 09:55:13] [INFO ] Time to serialize properties into /tmp/LTL4486153891893424357.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14793979457335996730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4486153891893424357.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i18.u160.Node15ManageTheCrashOfNode2<1)||(i18.u19.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((i18.u160.Node15Man...701
Formula 0 simplified : G(F!"((i18.u160.Node15ManageTheCrashOfNode2<1)||(i18.u19.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((i18.u160.Node15ManageTheCr...685
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6950913766754726261
[2024-05-25 09:55:28] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6950913766754726261
Running compilation step : cd /tmp/ltsmin6950913766754726261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6950913766754726261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin6950913766754726261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 126587 ms.
[2024-05-25 09:55:31] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3562385702900482923
[2024-05-25 09:55:31] [INFO ] Too many transitions (2971) to apply POR reductions. Disabling POR matrices.
[2024-05-25 09:55:31] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3562385702900482923
[2024-05-25 09:55:31] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin3562385702900482923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 09:55:31] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph693841967911685521.txt' '-o' '/tmp/graph693841967911685521.bin' '-w' '/tmp/graph693841967911685521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph693841967911685521.bin' '-l' '-1' '-v' '-w' '/tmp/graph693841967911685521.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:55:31] [INFO ] Decomposing Gal with order
[2024-05-25 09:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:55:31] [INFO ] Removed a total of 2487 redundant transitions.
[2024-05-25 09:55:31] [INFO ] Flatten gal took : 237 ms
[2024-05-25 09:55:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1499 labels/synchronizations in 138 ms.
[2024-05-25 09:55:32] [INFO ] Time to serialize gal into /tmp/LTLFireability14307204314127839595.gal : 18 ms
[2024-05-25 09:55:32] [INFO ] Time to serialize properties into /tmp/LTLFireability13584864760296953945.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14307204314127839595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13584864760296953945.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(X((F(G("((i3.i7.u17.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i3.i7.u38.LeafSetOfRx3IsSentToNode0<1))")))||(G("((i10.i4.u8...246
Formula 0 simplified : XX(GF!"((i3.i7.u17.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i3.i7.u38.LeafSetOfRx3IsSentToNode0<1))" & F!"((i10.i4.u88.Node4...234
Compilation finished in 6991 ms.
Running link step : cd /tmp/ltsmin3562385702900482923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin3562385702900482923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin3562385702900482923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3562385702900482923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>(((LTLAPp3==true)||[](<>((LTLAPp4==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 10:22:30] [INFO ] Flatten gal took : 692 ms
[2024-05-25 10:22:31] [INFO ] Time to serialize gal into /tmp/LTLFireability3685836846374737332.gal : 80 ms
[2024-05-25 10:22:31] [INFO ] Time to serialize properties into /tmp/LTLFireability14713487622630323003.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3685836846374737332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14713487622630323003.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))")))||(G("((Node4ManageTheCrashOfNode3<1)...204
Formula 0 simplified : XX(GF!"((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))" & F!"((Node4ManageTheCrashOfNode3<1)||(Lx0I...192
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7696776 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15826380 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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