fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654371900028
Last Updated
July 7, 2024

About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S16C07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
917.451 356209.00 406907.00 1677.60 TFTFFFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.7M 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-S16C07-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716627957024

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-S16C07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 09:05:58] [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:05:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:05:58] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2024-05-25 09:05:58] [INFO ] Transformed 6222 places.
[2024-05-25 09:05:59] [INFO ] Transformed 8685 transitions.
[2024-05-25 09:05:59] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 554 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 6222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 6188 transition count 8685
Discarding 1883 places :
Symmetric choice reduction at 1 with 1883 rule applications. Total rules 1917 place count 4305 transition count 6802
Iterating global reduction 1 with 1883 rules applied. Total rules applied 3800 place count 4305 transition count 6802
Discarding 1647 places :
Symmetric choice reduction at 1 with 1647 rule applications. Total rules 5447 place count 2658 transition count 5155
Iterating global reduction 1 with 1647 rules applied. Total rules applied 7094 place count 2658 transition count 5155
Discarding 218 places :
Symmetric choice reduction at 1 with 218 rule applications. Total rules 7312 place count 2440 transition count 3629
Iterating global reduction 1 with 218 rules applied. Total rules applied 7530 place count 2440 transition count 3629
Applied a total of 7530 rules in 1182 ms. Remains 2440 /6222 variables (removed 3782) and now considering 3629/8685 (removed 5056) transitions.
[2024-05-25 09:06:00] [INFO ] Flow matrix only has 3357 transitions (discarded 272 similar events)
// Phase 1: matrix 3357 rows 2440 cols
[2024-05-25 09:06:00] [INFO ] Computed 577 invariants in 187 ms
[2024-05-25 09:06:04] [INFO ] Implicit Places using invariants in 3578 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 26, 31, 38, 47, 58, 71, 86, 102, 118, 120, 122, 124, 126, 128, 130, 132, 145, 156, 165, 172, 177, 180, 211, 218, 221, 222, 223, 224, 225, 226, 227, 228, 231, 236, 243, 252, 263, 276, 290, 304, 305, 306, 307, 308, 309, 310, 311, 322, 331, 338, 343, 346, 348, 386, 389, 390, 391, 392, 393, 394, 395, 396, 398, 401, 406, 413, 422, 433, 445, 457, 458, 459, 460, 462, 463, 464, 473, 480, 485, 488, 490, 495, 526, 533, 536, 537, 538, 539, 540, 541, 542, 543, 545, 547, 550, 555, 562, 571, 581, 591, 592, 593, 594, 595, 596, 597, 598, 605, 610, 613, 615, 617, 619, 650, 657, 660, 661, 662, 663, 664, 665, 666, 667, 669, 671, 673, 676, 681, 688, 696, 704, 705, 706, 707, 708, 709, 710, 711, 716, 719, 721, 723, 725, 727, 758, 765, 768, 769, 770, 771, 772, 773, 774, 775, 777, 779, 781, 783, 786, 791, 797, 804, 805, 806, 807, 808, 809, 810, 816, 818, 820, 822, 824, 826, 857, 864, 867, 868, 869, 870, 872, 873, 874, 878, 880, 882, 884, 886, 889, 893, 897, 898, 899, 900, 901, 902, 903, 904, 906, 908, 910, 912, 914, 916, 947, 954, 957, 958, 959, 960, 961, 962, 963, 964, 966, 968, 970, 972, 974, 976, 978, 981, 982, 983, 984, 986, 987, 988, 990, 992, 994, 996, 998, 1003, 1034, 1036, 1040, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1052, 1054, 1056, 1058, 1060, 1062, 1064, 1067, 1068, 1069, 1070, 1072, 1073, 1074, 1076, 1078, 1080, 1082, 1086, 1088, 1119, 1126, 1129, 1130, 1132, 1133, 1134, 1135, 1136, 1138, 1140, 1145, 1147, 1149, 1151, 1153, 1156, 1157, 1158, 1159, 1161, 1162, 1163, 1165, 1170, 1172, 1174, 1176, 1178, 1209, 1216, 1219, 1220, 1221, 1222, 1223, 1224, 1226, 1228, 1230, 1232, 1234, 1238, 1240, 1243, 1248, 1249, 1250, 1251, 1252, 1254, 1255, 1260, 1262, 1264, 1266, 1268, 1270, 1301, 1308, 1311, 1312, 1313, 1315, 1316, 1317, 1318, 1320, 1322, 1324, 1328, 1330, 1333, 1338, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1357, 1360, 1362, 1364, 1366, 1368, 1399, 1406, 1409, 1410, 1413, 1415, 1416, 1418, 1420, 1426, 1428, 1431, 1438, 1445, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1468, 1473, 1476, 1478, 1480, 1482, 1513, 1520, 1523, 1524, 1526, 1527, 1528, 1529, 1530, 1532, 1534, 1536, 1539, 1544, 1553, 1562, 1573, 1575, 1576, 1577, 1578, 1579, 1580, 1591, 1598, 1603, 1606, 1608, 1610, 1641, 1648, 1651, 1652, 1653, 1654, 1655, 1656, 1657, 1658, 1660, 1662, 1665, 1670, 1677, 1686, 1698, 1711, 1712, 1713, 1714, 1715, 1716, 1718, 1730, 1739, 1746, 1751, 1756, 1758, 1789, 1796, 1799, 1800, 1801, 1802, 1803, 1805, 1806, 1808, 1811, 1816, 1823, 1832, 1846, 1859, 1874, 1875, 1877, 1878, 1879, 1880, 1881, 1894, 1905, 1914, 1923, 1928, 1931, 1962, 1964, 1968, 1971, 1972, 1973, 1975, 1976, 1977, 1981, 1986, 1993, 2002, 2015, 2028, 2043, 2060, 2061, 2062, 2063, 2064, 2065, 2066, 2067, 2082, 2095, 2106, 2115, 2122, 2127, 2159]
Discarding 509 places :
Implicit Place search using SMT only with invariants took 3610 ms to find 509 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1931/6222 places, 3629/8685 transitions.
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 205 place count 1726 transition count 3424
Iterating global reduction 0 with 205 rules applied. Total rules applied 410 place count 1726 transition count 3424
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 615 place count 1521 transition count 3219
Iterating global reduction 0 with 205 rules applied. Total rules applied 820 place count 1521 transition count 3219
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 1025 place count 1316 transition count 3014
Iterating global reduction 0 with 205 rules applied. Total rules applied 1230 place count 1316 transition count 3014
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1245 place count 1301 transition count 2909
Iterating global reduction 0 with 15 rules applied. Total rules applied 1260 place count 1301 transition count 2909
Applied a total of 1260 rules in 286 ms. Remains 1301 /1931 variables (removed 630) and now considering 2909/3629 (removed 720) transitions.
[2024-05-25 09:06:04] [INFO ] Flow matrix only has 2637 transitions (discarded 272 similar events)
// Phase 1: matrix 2637 rows 1301 cols
[2024-05-25 09:06:04] [INFO ] Computed 68 invariants in 42 ms
[2024-05-25 09:06:05] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-25 09:06:05] [INFO ] Flow matrix only has 2637 transitions (discarded 272 similar events)
[2024-05-25 09:06:05] [INFO ] Invariant cache hit.
[2024-05-25 09:06:06] [INFO ] State equation strengthened by 1052 read => feed constraints.
[2024-05-25 09:06:18] [INFO ] Implicit Places using invariants and state equation in 13314 ms returned []
Implicit Place search using SMT with State Equation took 14307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1301/6222 places, 2909/8685 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19386 ms. Remains : 1301/6222 places, 2909/8685 transitions.
Support contains 62 out of 1301 places after structural reductions.
[2024-05-25 09:06:19] [INFO ] Flatten gal took : 309 ms
[2024-05-25 09:06:19] [INFO ] Flatten gal took : 128 ms
[2024-05-25 09:06:19] [INFO ] Input system was already deterministic with 2909 transitions.
Support contains 59 out of 1301 places (down from 62) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 29) seen :7
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 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 12 ms. (steps per millisecond=83 ) 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 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-25 09:06:20] [INFO ] Flow matrix only has 2637 transitions (discarded 272 similar events)
[2024-05-25 09:06:20] [INFO ] Invariant cache hit.
[2024-05-25 09:06:21] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2024-05-25 09:06:21] [INFO ] [Real]Absence check using 31 positive and 37 generalized place invariants in 15 ms returned sat
[2024-05-25 09:06:24] [INFO ] After 2718ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:16
[2024-05-25 09:06:24] [INFO ] State equation strengthened by 1052 read => feed constraints.
[2024-05-25 09:06:24] [INFO ] After 185ms SMT Verify possible using 1052 Read/Feed constraints in real domain returned unsat :2 sat :0 real:17
[2024-05-25 09:06:24] [INFO ] After 3943ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2024-05-25 09:06:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 36 ms returned sat
[2024-05-25 09:06:24] [INFO ] [Nat]Absence check using 31 positive and 37 generalized place invariants in 14 ms returned sat
[2024-05-25 09:06:27] [INFO ] After 2374ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2024-05-25 09:06:33] [INFO ] After 6050ms SMT Verify possible using 1052 Read/Feed constraints in natural domain returned unsat :4 sat :15
[2024-05-25 09:06:34] [INFO ] Deduced a trap composed of 255 places in 540 ms of which 7 ms to minimize.
[2024-05-25 09:06:35] [INFO ] Deduced a trap composed of 280 places in 551 ms of which 2 ms to minimize.
[2024-05-25 09:06:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1436 ms
[2024-05-25 09:06:36] [INFO ] Deduced a trap composed of 392 places in 584 ms of which 2 ms to minimize.
[2024-05-25 09:06:37] [INFO ] Deduced a trap composed of 341 places in 616 ms of which 2 ms to minimize.
[2024-05-25 09:06:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1427 ms
[2024-05-25 09:06:37] [INFO ] Deduced a trap composed of 370 places in 577 ms of which 4 ms to minimize.
[2024-05-25 09:06:38] [INFO ] Deduced a trap composed of 188 places in 571 ms of which 2 ms to minimize.
[2024-05-25 09:06:39] [INFO ] Deduced a trap composed of 202 places in 535 ms of which 1 ms to minimize.
[2024-05-25 09:06:39] [INFO ] Deduced a trap composed of 184 places in 567 ms of which 1 ms to minimize.
[2024-05-25 09:06:40] [INFO ] Deduced a trap composed of 202 places in 578 ms of which 1 ms to minimize.
[2024-05-25 09:06:41] [INFO ] Deduced a trap composed of 178 places in 578 ms of which 1 ms to minimize.
[2024-05-25 09:06:41] [INFO ] Deduced a trap composed of 411 places in 576 ms of which 1 ms to minimize.
[2024-05-25 09:06:42] [INFO ] Deduced a trap composed of 367 places in 581 ms of which 1 ms to minimize.
[2024-05-25 09:06:43] [INFO ] Deduced a trap composed of 175 places in 574 ms of which 2 ms to minimize.
[2024-05-25 09:06:43] [INFO ] Deduced a trap composed of 194 places in 591 ms of which 1 ms to minimize.
[2024-05-25 09:06:44] [INFO ] Deduced a trap composed of 197 places in 566 ms of which 1 ms to minimize.
[2024-05-25 09:06:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7294 ms
[2024-05-25 09:06:46] [INFO ] Deduced a trap composed of 131 places in 559 ms of which 1 ms to minimize.
[2024-05-25 09:06:47] [INFO ] Deduced a trap composed of 130 places in 563 ms of which 1 ms to minimize.
[2024-05-25 09:06:47] [INFO ] Deduced a trap composed of 141 places in 535 ms of which 1 ms to minimize.
[2024-05-25 09:06:48] [INFO ] Deduced a trap composed of 337 places in 565 ms of which 1 ms to minimize.
[2024-05-25 09:06:49] [INFO ] Deduced a trap composed of 145 places in 560 ms of which 2 ms to minimize.
[2024-05-25 09:06:49] [INFO ] Deduced a trap composed of 140 places in 561 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:06:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:06:49] [INFO ] After 25305ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:17
Fused 19 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 29 out of 1301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1301/1301 places, 2909/2909 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1301 transition count 2889
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1281 transition count 2889
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 40 place count 1281 transition count 2866
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 86 place count 1258 transition count 2866
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 1250 transition count 2852
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 1250 transition count 2852
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 102 place count 1250 transition count 2850
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 1248 transition count 2850
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 1242 transition count 2808
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 1242 transition count 2808
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 174 place count 1214 transition count 2780
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1211 transition count 2777
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1211 transition count 2777
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1208 transition count 2756
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1208 transition count 2756
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 2 with 135 rules applied. Total rules applied 321 place count 1208 transition count 3701
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 456 place count 1073 transition count 3701
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 468 place count 1073 transition count 3701
Applied a total of 468 rules in 870 ms. Remains 1073 /1301 variables (removed 228) and now considering 3701/2909 (removed -792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 871 ms. Remains : 1073/1301 places, 3701/2909 transitions.
Incomplete random walk after 10000 steps, including 227 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 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 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 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 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 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 29 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-25 09:06:51] [INFO ] Flow matrix only has 3324 transitions (discarded 377 similar events)
// Phase 1: matrix 3324 rows 1073 cols
[2024-05-25 09:06:51] [INFO ] Computed 68 invariants in 31 ms
[2024-05-25 09:06:52] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-25 09:06:52] [INFO ] [Real]Absence check using 33 positive and 35 generalized place invariants in 7 ms returned sat
[2024-05-25 09:06:52] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-25 09:06:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 09:06:52] [INFO ] [Nat]Absence check using 33 positive and 35 generalized place invariants in 7 ms returned sat
[2024-05-25 09:06:54] [INFO ] After 2061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-25 09:06:54] [INFO ] State equation strengthened by 2072 read => feed constraints.
[2024-05-25 09:06:59] [INFO ] After 4363ms SMT Verify possible using 2072 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-25 09:07:00] [INFO ] Deduced a trap composed of 187 places in 495 ms of which 1 ms to minimize.
[2024-05-25 09:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 657 ms
[2024-05-25 09:07:01] [INFO ] Deduced a trap composed of 237 places in 509 ms of which 1 ms to minimize.
[2024-05-25 09:07:01] [INFO ] Deduced a trap composed of 90 places in 578 ms of which 1 ms to minimize.
[2024-05-25 09:07:02] [INFO ] Deduced a trap composed of 87 places in 551 ms of which 1 ms to minimize.
[2024-05-25 09:07:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1965 ms
[2024-05-25 09:07:03] [INFO ] Deduced a trap composed of 211 places in 485 ms of which 1 ms to minimize.
[2024-05-25 09:07:04] [INFO ] Deduced a trap composed of 111 places in 586 ms of which 1 ms to minimize.
[2024-05-25 09:07:04] [INFO ] Deduced a trap composed of 95 places in 586 ms of which 1 ms to minimize.
[2024-05-25 09:07:05] [INFO ] Deduced a trap composed of 130 places in 542 ms of which 1 ms to minimize.
[2024-05-25 09:07:06] [INFO ] Deduced a trap composed of 120 places in 556 ms of which 1 ms to minimize.
[2024-05-25 09:07:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3381 ms
[2024-05-25 09:07:07] [INFO ] Deduced a trap composed of 93 places in 578 ms of which 1 ms to minimize.
[2024-05-25 09:07:08] [INFO ] Deduced a trap composed of 180 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:07:08] [INFO ] Deduced a trap composed of 193 places in 446 ms of which 1 ms to minimize.
[2024-05-25 09:07:09] [INFO ] Deduced a trap composed of 187 places in 461 ms of which 1 ms to minimize.
[2024-05-25 09:07:10] [INFO ] Deduced a trap composed of 222 places in 460 ms of which 1 ms to minimize.
[2024-05-25 09:07:10] [INFO ] Deduced a trap composed of 220 places in 479 ms of which 1 ms to minimize.
[2024-05-25 09:07:11] [INFO ] Deduced a trap composed of 263 places in 449 ms of which 2 ms to minimize.
[2024-05-25 09:07:11] [INFO ] Deduced a trap composed of 213 places in 483 ms of which 2 ms to minimize.
[2024-05-25 09:07:12] [INFO ] Deduced a trap composed of 165 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:07:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5599 ms
[2024-05-25 09:07:13] [INFO ] Deduced a trap composed of 99 places in 526 ms of which 1 ms to minimize.
[2024-05-25 09:07:14] [INFO ] Deduced a trap composed of 92 places in 552 ms of which 1 ms to minimize.
[2024-05-25 09:07:14] [INFO ] Deduced a trap composed of 88 places in 542 ms of which 1 ms to minimize.
[2024-05-25 09:07:15] [INFO ] Deduced a trap composed of 85 places in 554 ms of which 1 ms to minimize.
[2024-05-25 09:07:16] [INFO ] Deduced a trap composed of 200 places in 555 ms of which 1 ms to minimize.
[2024-05-25 09:07:17] [INFO ] Deduced a trap composed of 89 places in 559 ms of which 1 ms to minimize.
[2024-05-25 09:07:18] [INFO ] Deduced a trap composed of 2 places in 618 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:07:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:07:18] [INFO ] After 25645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 23 out of 1073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1073/1073 places, 3701/3701 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 0 with 2 rules applied. Total rules applied 2 place count 1073 transition count 3699
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1071 transition count 3699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1071 transition count 3698
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1070 transition count 3698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1069 transition count 3697
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1069 transition count 3697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1068 transition count 3696
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 24 place count 1068 transition count 3682
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 38 place count 1054 transition count 3682
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 1054 transition count 3682
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 43 place count 1052 transition count 3680
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 1052 transition count 3680
Applied a total of 45 rules in 550 ms. Remains 1052 /1073 variables (removed 21) and now considering 3680/3701 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 1052/1073 places, 3680/3701 transitions.
Incomplete random walk after 10000 steps, including 233 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 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 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 63309 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{3=1, 9=1}
Probabilistic random walk after 63309 steps, saw 26926 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :2
Running SMT prover for 9 properties.
[2024-05-25 09:07:22] [INFO ] Flow matrix only has 3289 transitions (discarded 391 similar events)
// Phase 1: matrix 3289 rows 1052 cols
[2024-05-25 09:07:22] [INFO ] Computed 68 invariants in 33 ms
[2024-05-25 09:07:23] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 09:07:23] [INFO ] [Real]Absence check using 33 positive and 35 generalized place invariants in 8 ms returned sat
[2024-05-25 09:07:25] [INFO ] After 1955ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2024-05-25 09:07:25] [INFO ] State equation strengthened by 2072 read => feed constraints.
[2024-05-25 09:07:25] [INFO ] After 225ms SMT Verify possible using 2072 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 09:07:25] [INFO ] After 2592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 09:07:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 09:07:25] [INFO ] [Nat]Absence check using 33 positive and 35 generalized place invariants in 6 ms returned sat
[2024-05-25 09:07:27] [INFO ] After 1726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-25 09:07:31] [INFO ] After 4096ms SMT Verify possible using 2072 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-25 09:07:32] [INFO ] Deduced a trap composed of 173 places in 458 ms of which 1 ms to minimize.
[2024-05-25 09:07:32] [INFO ] Deduced a trap composed of 146 places in 452 ms of which 1 ms to minimize.
[2024-05-25 09:07:33] [INFO ] Deduced a trap composed of 184 places in 446 ms of which 1 ms to minimize.
[2024-05-25 09:07:33] [INFO ] Deduced a trap composed of 169 places in 432 ms of which 1 ms to minimize.
[2024-05-25 09:07:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2392 ms
[2024-05-25 09:07:35] [INFO ] Deduced a trap composed of 173 places in 449 ms of which 1 ms to minimize.
[2024-05-25 09:07:35] [INFO ] Deduced a trap composed of 106 places in 525 ms of which 1 ms to minimize.
[2024-05-25 09:07:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1428 ms
[2024-05-25 09:07:37] [INFO ] Deduced a trap composed of 174 places in 459 ms of which 1 ms to minimize.
[2024-05-25 09:07:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 609 ms
[2024-05-25 09:07:39] [INFO ] Deduced a trap composed of 203 places in 460 ms of which 1 ms to minimize.
[2024-05-25 09:07:39] [INFO ] Deduced a trap composed of 80 places in 512 ms of which 1 ms to minimize.
[2024-05-25 09:07:40] [INFO ] Deduced a trap composed of 119 places in 510 ms of which 1 ms to minimize.
[2024-05-25 09:07:40] [INFO ] Deduced a trap composed of 95 places in 525 ms of which 2 ms to minimize.
[2024-05-25 09:07:41] [INFO ] Deduced a trap composed of 93 places in 523 ms of which 1 ms to minimize.
[2024-05-25 09:07:42] [INFO ] Deduced a trap composed of 110 places in 572 ms of which 1 ms to minimize.
[2024-05-25 09:07:43] [INFO ] Deduced a trap composed of 81 places in 520 ms of which 1 ms to minimize.
[2024-05-25 09:07:44] [INFO ] Deduced a trap composed of 114 places in 522 ms of which 1 ms to minimize.
[2024-05-25 09:07:45] [INFO ] Deduced a trap composed of 83 places in 522 ms of which 0 ms to minimize.
[2024-05-25 09:07:49] [INFO ] Deduced a trap composed of 117 places in 550 ms of which 1 ms to minimize.
[2024-05-25 09:07:50] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 11790 ms
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.refineResultsWithTraps(DeadlockTester.java:772)
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:07:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:07:50] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 33 ms.
Support contains 18 out of 1052 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1052/1052 places, 3680/3680 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 1052 transition count 3679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1051 transition count 3679
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1051 transition count 3678
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1050 transition count 3678
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1049 transition count 3677
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1049 transition count 3677
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1049 transition count 3677
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1048 transition count 3676
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1048 transition count 3676
Applied a total of 10 rules in 262 ms. Remains 1048 /1052 variables (removed 4) and now considering 3676/3680 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 1048/1052 places, 3676/3680 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 64748 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64748 steps, saw 27539 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-25 09:07:54] [INFO ] Flow matrix only has 3285 transitions (discarded 391 similar events)
// Phase 1: matrix 3285 rows 1048 cols
[2024-05-25 09:07:54] [INFO ] Computed 68 invariants in 28 ms
[2024-05-25 09:07:54] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2024-05-25 09:07:54] [INFO ] [Real]Absence check using 31 positive and 37 generalized place invariants in 12 ms returned sat
[2024-05-25 09:07:56] [INFO ] After 2093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 09:07:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 09:07:56] [INFO ] [Nat]Absence check using 31 positive and 37 generalized place invariants in 12 ms returned sat
[2024-05-25 09:07:58] [INFO ] After 1641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-25 09:07:58] [INFO ] State equation strengthened by 2072 read => feed constraints.
[2024-05-25 09:08:02] [INFO ] After 4112ms SMT Verify possible using 2072 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-25 09:08:03] [INFO ] Deduced a trap composed of 157 places in 443 ms of which 1 ms to minimize.
[2024-05-25 09:08:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 645 ms
[2024-05-25 09:08:05] [INFO ] Deduced a trap composed of 96 places in 521 ms of which 5 ms to minimize.
[2024-05-25 09:08:06] [INFO ] Deduced a trap composed of 105 places in 509 ms of which 0 ms to minimize.
[2024-05-25 09:08:07] [INFO ] Deduced a trap composed of 99 places in 510 ms of which 2 ms to minimize.
[2024-05-25 09:08:07] [INFO ] Deduced a trap composed of 97 places in 546 ms of which 5 ms to minimize.
[2024-05-25 09:08:08] [INFO ] Deduced a trap composed of 175 places in 467 ms of which 1 ms to minimize.
[2024-05-25 09:08:09] [INFO ] Deduced a trap composed of 92 places in 536 ms of which 1 ms to minimize.
[2024-05-25 09:08:09] [INFO ] Deduced a trap composed of 91 places in 508 ms of which 1 ms to minimize.
[2024-05-25 09:08:10] [INFO ] Deduced a trap composed of 101 places in 519 ms of which 1 ms to minimize.
[2024-05-25 09:08:10] [INFO ] Deduced a trap composed of 81 places in 514 ms of which 0 ms to minimize.
[2024-05-25 09:08:11] [INFO ] Deduced a trap composed of 93 places in 522 ms of which 1 ms to minimize.
[2024-05-25 09:08:12] [INFO ] Deduced a trap composed of 81 places in 505 ms of which 2 ms to minimize.
[2024-05-25 09:08:13] [INFO ] Deduced a trap composed of 217 places in 461 ms of which 1 ms to minimize.
[2024-05-25 09:08:14] [INFO ] Deduced a trap composed of 182 places in 452 ms of which 1 ms to minimize.
[2024-05-25 09:08:15] [INFO ] Deduced a trap composed of 94 places in 511 ms of which 1 ms to minimize.
[2024-05-25 09:08:16] [INFO ] Deduced a trap composed of 96 places in 508 ms of which 0 ms to minimize.
[2024-05-25 09:08:16] [INFO ] Deduced a trap composed of 114 places in 541 ms of which 1 ms to minimize.
[2024-05-25 09:08:17] [INFO ] Deduced a trap composed of 84 places in 524 ms of which 1 ms to minimize.
[2024-05-25 09:08:18] [INFO ] Deduced a trap composed of 102 places in 515 ms of which 1 ms to minimize.
[2024-05-25 09:08:18] [INFO ] Deduced a trap composed of 96 places in 517 ms of which 1 ms to minimize.
[2024-05-25 09:08:19] [INFO ] Deduced a trap composed of 98 places in 510 ms of which 1 ms to minimize.
[2024-05-25 09:08:19] [INFO ] Deduced a trap composed of 108 places in 508 ms of which 1 ms to minimize.
[2024-05-25 09:08:20] [INFO ] Deduced a trap composed of 181 places in 449 ms of which 1 ms to minimize.
[2024-05-25 09:08:21] [INFO ] Deduced a trap composed of 87 places in 513 ms of which 1 ms to minimize.
[2024-05-25 09:08:22] [INFO ] Deduced a trap composed of 2 places in 570 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:08:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 09:08:22] [INFO ] After 25597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 18 out of 1048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 3676/3676 transitions.
Applied a total of 0 rules in 98 ms. Remains 1048 /1048 variables (removed 0) and now considering 3676/3676 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1048/1048 places, 3676/3676 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 3676/3676 transitions.
Applied a total of 0 rules in 93 ms. Remains 1048 /1048 variables (removed 0) and now considering 3676/3676 (removed 0) transitions.
[2024-05-25 09:08:22] [INFO ] Flow matrix only has 3285 transitions (discarded 391 similar events)
[2024-05-25 09:08:22] [INFO ] Invariant cache hit.
[2024-05-25 09:08:23] [INFO ] Implicit Places using invariants in 999 ms returned [234, 286, 422, 473, 512, 521, 538, 548, 565, 596, 597, 598, 641, 669, 828, 874, 875]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1010 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1031/1048 places, 3676/3676 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1021 transition count 3666
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1021 transition count 3666
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1011 transition count 3656
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1011 transition count 3656
Applied a total of 40 rules in 158 ms. Remains 1011 /1031 variables (removed 20) and now considering 3656/3676 (removed 20) transitions.
[2024-05-25 09:08:23] [INFO ] Flow matrix only has 3265 transitions (discarded 391 similar events)
// Phase 1: matrix 3265 rows 1011 cols
[2024-05-25 09:08:23] [INFO ] Computed 51 invariants in 25 ms
[2024-05-25 09:08:24] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-05-25 09:08:24] [INFO ] Flow matrix only has 3265 transitions (discarded 391 similar events)
[2024-05-25 09:08:24] [INFO ] Invariant cache hit.
[2024-05-25 09:08:25] [INFO ] State equation strengthened by 2072 read => feed constraints.
[2024-05-25 09:08:41] [INFO ] Implicit Places using invariants and state equation in 16792 ms returned []
Implicit Place search using SMT with State Equation took 17737 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1011/1048 places, 3656/3676 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18998 ms. Remains : 1011/1048 places, 3656/3676 transitions.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 469 stabilizing places and 1276 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)||G(p1))))'
Support contains 4 out of 1301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1301/1301 places, 2909/2909 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 0 with 24 rules applied. Total rules applied 24 place count 1301 transition count 2885
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1277 transition count 2885
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 1277 transition count 2858
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 102 place count 1250 transition count 2858
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 114 place count 1238 transition count 2840
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 1238 transition count 2840
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 126 place count 1238 transition count 2834
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 138 place count 1232 transition count 2834
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 148 place count 1222 transition count 2764
Iterating global reduction 2 with 10 rules applied. Total rules applied 158 place count 1222 transition count 2764
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 212 place count 1195 transition count 2737
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 219 place count 1188 transition count 2730
Iterating global reduction 2 with 7 rules applied. Total rules applied 226 place count 1188 transition count 2730
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 233 place count 1181 transition count 2681
Iterating global reduction 2 with 7 rules applied. Total rules applied 240 place count 1181 transition count 2681
Applied a total of 240 rules in 439 ms. Remains 1181 /1301 variables (removed 120) and now considering 2681/2909 (removed 228) transitions.
[2024-05-25 09:08:42] [INFO ] Flow matrix only has 2409 transitions (discarded 272 similar events)
// Phase 1: matrix 2409 rows 1181 cols
[2024-05-25 09:08:42] [INFO ] Computed 68 invariants in 23 ms
[2024-05-25 09:08:43] [INFO ] Implicit Places using invariants in 1041 ms returned [257, 317, 477, 495, 532, 555, 572, 582, 600, 613, 632, 669, 670, 671, 758, 836, 879, 937, 989, 990]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1161/1301 places, 2681/2909 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1148 transition count 2668
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1148 transition count 2668
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1135 transition count 2655
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1135 transition count 2655
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 1125 transition count 2585
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 1125 transition count 2585
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 82 place count 1120 transition count 2580
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 1115 transition count 2575
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 1115 transition count 2575
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 1109 transition count 2533
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 1109 transition count 2533
Applied a total of 104 rules in 415 ms. Remains 1109 /1161 variables (removed 52) and now considering 2533/2681 (removed 148) transitions.
[2024-05-25 09:08:43] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1109 cols
[2024-05-25 09:08:43] [INFO ] Computed 48 invariants in 22 ms
[2024-05-25 09:08:44] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-25 09:08:44] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2024-05-25 09:08:44] [INFO ] Invariant cache hit.
[2024-05-25 09:08:45] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 09:08:53] [INFO ] Implicit Places using invariants and state equation in 8671 ms returned []
Implicit Place search using SMT with State Equation took 9547 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1109/1301 places, 2533/2909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11448 ms. Remains : 1109/1301 places, 2533/2909 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 157 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s701 1) (LT s743 1)), p1:(OR (LT s783 1) (LT s1103 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1954 reset in 667 ms.
Product exploration explored 100000 steps with 1954 reset in 639 ms.
Computed a total of 294 stabilizing places and 917 stable transitions
Computed a total of 294 stabilizing places and 917 stable transitions
Detected a total of 294/1109 stabilizing places and 917/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 191 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 09:08:54] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2024-05-25 09:08:54] [INFO ] Invariant cache hit.
[2024-05-25 09:08:55] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 09:08:55] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 09:08:55] [INFO ] After 745ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-25 09:08:55] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 09:08:56] [INFO ] After 127ms SMT Verify possible using 848 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-25 09:08:56] [INFO ] After 1067ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-25 09:08:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 09:08:56] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-25 09:08:56] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 09:08:56] [INFO ] After 132ms SMT Verify possible using 848 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-25 09:08:57] [INFO ] Deduced a trap composed of 241 places in 418 ms of which 1 ms to minimize.
[2024-05-25 09:08:57] [INFO ] Deduced a trap composed of 250 places in 410 ms of which 1 ms to minimize.
[2024-05-25 09:08:58] [INFO ] Deduced a trap composed of 235 places in 393 ms of which 1 ms to minimize.
[2024-05-25 09:08:58] [INFO ] Deduced a trap composed of 240 places in 412 ms of which 1 ms to minimize.
[2024-05-25 09:08:59] [INFO ] Deduced a trap composed of 251 places in 394 ms of which 1 ms to minimize.
[2024-05-25 09:08:59] [INFO ] Deduced a trap composed of 275 places in 412 ms of which 1 ms to minimize.
[2024-05-25 09:09:00] [INFO ] Deduced a trap composed of 243 places in 380 ms of which 1 ms to minimize.
[2024-05-25 09:09:00] [INFO ] Deduced a trap composed of 219 places in 425 ms of which 1 ms to minimize.
[2024-05-25 09:09:01] [INFO ] Deduced a trap composed of 246 places in 425 ms of which 1 ms to minimize.
[2024-05-25 09:09:01] [INFO ] Deduced a trap composed of 271 places in 410 ms of which 1 ms to minimize.
[2024-05-25 09:09:02] [INFO ] Deduced a trap composed of 271 places in 417 ms of which 1 ms to minimize.
[2024-05-25 09:09:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5491 ms
[2024-05-25 09:09:02] [INFO ] After 5671ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-25 09:09:02] [INFO ] After 6583ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1109/1109 places, 2533/2533 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1109 transition count 4002
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 976 transition count 4002
Applied a total of 266 rules in 207 ms. Remains 976 /1109 variables (removed 133) and now considering 4002/2533 (removed -1469) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 976/1109 places, 4002/2533 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 74885 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74885 steps, saw 31475 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:09:06] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2024-05-25 09:09:06] [INFO ] Computed 48 invariants in 34 ms
[2024-05-25 09:09:06] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:09:06] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 09:09:07] [INFO ] After 925ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 09:09:07] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2024-05-25 09:09:07] [INFO ] After 237ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:09:07] [INFO ] After 1325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:09:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-25 09:09:07] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-25 09:09:08] [INFO ] After 923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 09:09:08] [INFO ] After 401ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 09:09:09] [INFO ] Deduced a trap composed of 145 places in 457 ms of which 1 ms to minimize.
[2024-05-25 09:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 658 ms
[2024-05-25 09:09:09] [INFO ] After 1124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-25 09:09:09] [INFO ] After 2284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 99 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 98 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2024-05-25 09:09:09] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2024-05-25 09:09:09] [INFO ] Invariant cache hit.
[2024-05-25 09:09:10] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2024-05-25 09:09:10] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2024-05-25 09:09:10] [INFO ] Invariant cache hit.
[2024-05-25 09:09:11] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2024-05-25 09:09:34] [INFO ] Implicit Places using invariants and state equation in 23624 ms returned []
Implicit Place search using SMT with State Equation took 24703 ms to find 0 implicit places.
[2024-05-25 09:09:34] [INFO ] Redundant transitions in 293 ms returned []
[2024-05-25 09:09:34] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2024-05-25 09:09:34] [INFO ] Invariant cache hit.
[2024-05-25 09:09:36] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26404 ms. Remains : 976/976 places, 4002/4002 transitions.
Graph (trivial) has 1052 edges and 976 vertex of which 17 / 976 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 4567 edges and 960 vertex of which 946 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 t1205.t1418 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 929 transition count 3233
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 832 transition count 3040
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 736 transition count 2872
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 664 transition count 2730
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 594 transition count 2610
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 544 transition count 2512
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 496 transition count 2432
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 464 transition count 2370
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 434 transition count 2322
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 416 transition count 2288
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 400 transition count 2264
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 392 transition count 2250
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 386 transition count 2242
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 383 transition count 2240
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 14 Pre rules applied. Total rules applied 1640 place count 383 transition count 2226
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 14 with 28 rules applied. Total rules applied 1668 place count 369 transition count 2226
Discarding 283 places :
Symmetric choice reduction at 14 with 283 rule applications. Total rules 1951 place count 86 transition count 341
Iterating global reduction 14 with 283 rules applied. Total rules applied 2234 place count 86 transition count 341
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 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 253 rules applied. Total rules applied 2487 place count 86 transition count 88
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2495 place count 78 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2495 place count 78 transition count 87
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 2497 place count 77 transition count 87
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2509 place count 65 transition count 70
Iterating global reduction 16 with 12 rules applied. Total rules applied 2521 place count 65 transition count 70
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2526 place count 60 transition count 65
Iterating global reduction 16 with 5 rules applied. Total rules applied 2531 place count 60 transition count 65
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 2535 place count 58 transition count 63
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2536 place count 57 transition count 61
Iterating global reduction 16 with 1 rules applied. Total rules applied 2537 place count 57 transition count 61
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2543 place count 57 transition count 55
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2549 place count 51 transition count 55
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 17 with 8 rules applied. Total rules applied 2557 place count 51 transition count 55
Applied a total of 2557 rules in 408 ms. Remains 51 /976 variables (removed 925) and now considering 55/4002 (removed 3947) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 55 rows 51 cols
[2024-05-25 09:09:36] [INFO ] Computed 17 invariants in 3 ms
[2024-05-25 09:09:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 09:09:36] [INFO ] [Real]Absence check using 2 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-25 09:09:36] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 09:09:36] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 09:09:36] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 236 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 finished in 55387 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))&&(G(p2)||X(p1)))))'
Support contains 4 out of 1301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1301/1301 places, 2909/2909 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1282 transition count 2878
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1282 transition count 2878
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 1266 transition count 2796
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 1266 transition count 2796
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 1261 transition count 2761
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 1261 transition count 2761
Applied a total of 80 rules in 192 ms. Remains 1261 /1301 variables (removed 40) and now considering 2761/2909 (removed 148) transitions.
[2024-05-25 09:09:37] [INFO ] Flow matrix only has 2489 transitions (discarded 272 similar events)
// Phase 1: matrix 2489 rows 1261 cols
[2024-05-25 09:09:37] [INFO ] Computed 68 invariants in 39 ms
[2024-05-25 09:09:38] [INFO ] Implicit Places using invariants in 1056 ms returned [287, 348, 512, 532, 571, 596, 628, 649, 662, 684, 723, 725, 783, 817, 897, 941, 999, 1054, 1055]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1068 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1301 places, 2761/2909 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1225 transition count 2744
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1225 transition count 2744
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1208 transition count 2727
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1208 transition count 2727
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1191 transition count 2710
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1191 transition count 2710
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 117 place count 1176 transition count 2605
Iterating global reduction 0 with 15 rules applied. Total rules applied 132 place count 1176 transition count 2605
Applied a total of 132 rules in 236 ms. Remains 1176 /1242 variables (removed 66) and now considering 2605/2761 (removed 156) transitions.
[2024-05-25 09:09:38] [INFO ] Flow matrix only has 2333 transitions (discarded 272 similar events)
// Phase 1: matrix 2333 rows 1176 cols
[2024-05-25 09:09:38] [INFO ] Computed 49 invariants in 24 ms
[2024-05-25 09:09:39] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-25 09:09:39] [INFO ] Flow matrix only has 2333 transitions (discarded 272 similar events)
[2024-05-25 09:09:39] [INFO ] Invariant cache hit.
[2024-05-25 09:09:40] [INFO ] State equation strengthened by 854 read => feed constraints.
[2024-05-25 09:09:49] [INFO ] Implicit Places using invariants and state equation in 9750 ms returned [1159]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10661 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1175/1301 places, 2605/2909 transitions.
Applied a total of 0 rules in 57 ms. Remains 1175 /1175 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12216 ms. Remains : 1175/1301 places, 2605/2909 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 1}], [{ cond=(NOT p0), acceptance={} source=10 dest: 0}, { cond=p0, acceptance={} source=10 dest: 10}]], initial=2, aps=[p2:(LT s600 1), p1:(LT s692 1), p0:(OR (LT s496 1) (LT s617 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1013 ms.
Product exploration explored 100000 steps with 50000 reset in 996 ms.
Computed a total of 343 stabilizing places and 972 stable transitions
Computed a total of 343 stabilizing places and 972 stable transitions
Detected a total of 343/1175 stabilizing places and 972/2605 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 17 ms. Reduced automaton from 11 states, 31 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 finished in 14658 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 4 out of 1301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1301/1301 places, 2909/2909 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1281 transition count 2877
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1281 transition count 2877
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1264 transition count 2800
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1264 transition count 2800
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 1257 transition count 2751
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 1257 transition count 2751
Applied a total of 88 rules in 183 ms. Remains 1257 /1301 variables (removed 44) and now considering 2751/2909 (removed 158) transitions.
[2024-05-25 09:09:51] [INFO ] Flow matrix only has 2479 transitions (discarded 272 similar events)
// Phase 1: matrix 2479 rows 1257 cols
[2024-05-25 09:09:51] [INFO ] Computed 68 invariants in 37 ms
[2024-05-25 09:09:52] [INFO ] Implicit Places using invariants in 991 ms returned [287, 348, 512, 532, 571, 596, 615, 625, 646, 659, 681, 720, 721, 722, 777, 893, 937, 995, 1050, 1051]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 993 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1301 places, 2751/2909 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1219 transition count 2733
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1219 transition count 2733
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1201 transition count 2715
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1201 transition count 2715
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1183 transition count 2697
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1183 transition count 2697
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 124 place count 1167 transition count 2585
Iterating global reduction 0 with 16 rules applied. Total rules applied 140 place count 1167 transition count 2585
Applied a total of 140 rules in 227 ms. Remains 1167 /1237 variables (removed 70) and now considering 2585/2751 (removed 166) transitions.
[2024-05-25 09:09:52] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
// Phase 1: matrix 2313 rows 1167 cols
[2024-05-25 09:09:53] [INFO ] Computed 48 invariants in 32 ms
[2024-05-25 09:09:53] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-25 09:09:53] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
[2024-05-25 09:09:53] [INFO ] Invariant cache hit.
[2024-05-25 09:09:54] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-25 09:10:03] [INFO ] Implicit Places using invariants and state equation in 9899 ms returned [1128]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10794 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1166/1301 places, 2585/2909 transitions.
Applied a total of 0 rules in 45 ms. Remains 1166 /1166 variables (removed 0) and now considering 2585/2585 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12244 ms. Remains : 1166/1301 places, 2585/2909 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03 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:(AND (GEQ s242 1) (GEQ s589 1) (OR (LT s768 1) (LT s785 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-S16C07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03 finished in 12376 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(F(((p0 U (p1&&X(p2)))||X(p3)))))'
Support contains 5 out of 1301 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1301/1301 places, 2909/2909 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1283 transition count 2879
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1283 transition count 2879
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 1268 transition count 2810
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 1268 transition count 2810
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 1262 transition count 2768
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 1262 transition count 2768
Applied a total of 78 rules in 188 ms. Remains 1262 /1301 variables (removed 39) and now considering 2768/2909 (removed 141) transitions.
[2024-05-25 09:10:04] [INFO ] Flow matrix only has 2496 transitions (discarded 272 similar events)
// Phase 1: matrix 2496 rows 1262 cols
[2024-05-25 09:10:04] [INFO ] Computed 68 invariants in 34 ms
[2024-05-25 09:10:05] [INFO ] Implicit Places using invariants in 1005 ms returned [287, 348, 535, 574, 599, 618, 628, 649, 662, 725, 726, 727, 782, 816, 942, 1000, 1055, 1056]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1244/1301 places, 2768/2909 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1228 transition count 2752
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1228 transition count 2752
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1212 transition count 2736
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1212 transition count 2736
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1196 transition count 2720
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1196 transition count 2720
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 110 place count 1182 transition count 2622
Iterating global reduction 0 with 14 rules applied. Total rules applied 124 place count 1182 transition count 2622
Applied a total of 124 rules in 245 ms. Remains 1182 /1244 variables (removed 62) and now considering 2622/2768 (removed 146) transitions.
[2024-05-25 09:10:05] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1182 cols
[2024-05-25 09:10:05] [INFO ] Computed 50 invariants in 25 ms
[2024-05-25 09:10:06] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-25 09:10:06] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
[2024-05-25 09:10:06] [INFO ] Invariant cache hit.
[2024-05-25 09:10:07] [INFO ] State equation strengthened by 866 read => feed constraints.
[2024-05-25 09:10:17] [INFO ] Implicit Places using invariants and state equation in 10893 ms returned []
Implicit Place search using SMT with State Equation took 11822 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1301 places, 2622/2909 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13264 ms. Remains : 1182/1301 places, 2622/2909 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}]], initial=2, aps=[p1:(GEQ s512 1), p3:(AND (GEQ s877 1) (GEQ s881 1)), p2:(AND (GEQ s657 1) (GEQ s682 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 finished in 13491 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(F(p0)))'
Support contains 2 out of 1301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1301/1301 places, 2909/2909 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1281 transition count 2877
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1281 transition count 2877
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 1264 transition count 2800
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 1264 transition count 2800
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 1257 transition count 2751
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 1257 transition count 2751
Applied a total of 88 rules in 192 ms. Remains 1257 /1301 variables (removed 44) and now considering 2751/2909 (removed 158) transitions.
[2024-05-25 09:10:17] [INFO ] Flow matrix only has 2479 transitions (discarded 272 similar events)
// Phase 1: matrix 2479 rows 1257 cols
[2024-05-25 09:10:17] [INFO ] Computed 68 invariants in 36 ms
[2024-05-25 09:10:18] [INFO ] Implicit Places using invariants in 1033 ms returned [287, 348, 512, 532, 571, 596, 615, 625, 646, 683, 722, 723, 724, 779, 813, 893, 937, 995, 1050, 1051]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 1035 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1301 places, 2751/2909 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1219 transition count 2733
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1219 transition count 2733
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1201 transition count 2715
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1201 transition count 2715
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1183 transition count 2697
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1183 transition count 2697
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 124 place count 1167 transition count 2585
Iterating global reduction 0 with 16 rules applied. Total rules applied 140 place count 1167 transition count 2585
Applied a total of 140 rules in 237 ms. Remains 1167 /1237 variables (removed 70) and now considering 2585/2751 (removed 166) transitions.
[2024-05-25 09:10:18] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
// Phase 1: matrix 2313 rows 1167 cols
[2024-05-25 09:10:18] [INFO ] Computed 48 invariants in 25 ms
[2024-05-25 09:10:19] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-25 09:10:19] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
[2024-05-25 09:10:19] [INFO ] Invariant cache hit.
[2024-05-25 09:10:20] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-25 09:10:29] [INFO ] Implicit Places using invariants and state equation in 10039 ms returned [1128]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10946 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1166/1301 places, 2585/2909 transitions.
Applied a total of 0 rules in 48 ms. Remains 1166 /1166 variables (removed 0) and now considering 2585/2585 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12459 ms. Remains : 1166/1301 places, 2585/2909 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s632 1) (GEQ s640 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][false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05 finished in 12554 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(p0))'
Support contains 2 out of 1301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1301/1301 places, 2909/2909 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1280 transition count 2876
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1280 transition count 2876
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 1262 transition count 2792
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 1262 transition count 2792
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 1255 transition count 2743
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 1255 transition count 2743
Applied a total of 92 rules in 199 ms. Remains 1255 /1301 variables (removed 46) and now considering 2743/2909 (removed 166) transitions.
[2024-05-25 09:10:30] [INFO ] Flow matrix only has 2471 transitions (discarded 272 similar events)
// Phase 1: matrix 2471 rows 1255 cols
[2024-05-25 09:10:30] [INFO ] Computed 68 invariants in 33 ms
[2024-05-25 09:10:31] [INFO ] Implicit Places using invariants in 993 ms returned [287, 348, 512, 532, 571, 596, 615, 625, 646, 659, 681, 720, 721, 722, 777, 811, 891, 935, 993, 1048, 1049]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 995 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1234/1301 places, 2743/2909 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1215 transition count 2724
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1215 transition count 2724
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1196 transition count 2705
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1196 transition count 2705
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1177 transition count 2686
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1177 transition count 2686
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 131 place count 1160 transition count 2567
Iterating global reduction 0 with 17 rules applied. Total rules applied 148 place count 1160 transition count 2567
Applied a total of 148 rules in 249 ms. Remains 1160 /1234 variables (removed 74) and now considering 2567/2743 (removed 176) transitions.
[2024-05-25 09:10:31] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1160 cols
[2024-05-25 09:10:31] [INFO ] Computed 47 invariants in 21 ms
[2024-05-25 09:10:32] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-25 09:10:32] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
[2024-05-25 09:10:32] [INFO ] Invariant cache hit.
[2024-05-25 09:10:33] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-25 09:10:41] [INFO ] Implicit Places using invariants and state equation in 9457 ms returned [1122, 1143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10365 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1158/1301 places, 2567/2909 transitions.
Applied a total of 0 rules in 47 ms. Remains 1158 /1158 variables (removed 0) and now considering 2567/2567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11856 ms. Remains : 1158/1301 places, 2567/2909 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s585 1) (GEQ s636 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09 finished in 11980 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 1301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1301/1301 places, 2909/2909 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 0 with 24 rules applied. Total rules applied 24 place count 1301 transition count 2885
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1277 transition count 2885
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 1277 transition count 2858
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 102 place count 1250 transition count 2858
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 115 place count 1237 transition count 2833
Iterating global reduction 2 with 13 rules applied. Total rules applied 128 place count 1237 transition count 2833
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 128 place count 1237 transition count 2827
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 1231 transition count 2827
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 151 place count 1220 transition count 2750
Iterating global reduction 2 with 11 rules applied. Total rules applied 162 place count 1220 transition count 2750
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 216 place count 1193 transition count 2723
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 1186 transition count 2716
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 1186 transition count 2716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 236 place count 1180 transition count 2674
Iterating global reduction 2 with 6 rules applied. Total rules applied 242 place count 1180 transition count 2674
Applied a total of 242 rules in 399 ms. Remains 1180 /1301 variables (removed 121) and now considering 2674/2909 (removed 235) transitions.
[2024-05-25 09:10:42] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1180 cols
[2024-05-25 09:10:42] [INFO ] Computed 68 invariants in 34 ms
[2024-05-25 09:10:43] [INFO ] Implicit Places using invariants in 972 ms returned [257, 317, 477, 495, 532, 555, 572, 582, 600, 613, 632, 670, 671, 725, 759, 836, 878, 936, 988, 989]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 974 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1160/1301 places, 2674/2909 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1147 transition count 2661
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1147 transition count 2661
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1134 transition count 2648
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1134 transition count 2648
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 1123 transition count 2571
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 1123 transition count 2571
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 84 place count 1118 transition count 2566
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 1113 transition count 2561
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 1113 transition count 2561
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 1108 transition count 2526
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 1108 transition count 2526
Applied a total of 104 rules in 376 ms. Remains 1108 /1160 variables (removed 52) and now considering 2526/2674 (removed 148) transitions.
[2024-05-25 09:10:43] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1108 cols
[2024-05-25 09:10:43] [INFO ] Computed 48 invariants in 26 ms
[2024-05-25 09:10:44] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-05-25 09:10:44] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
[2024-05-25 09:10:44] [INFO ] Invariant cache hit.
[2024-05-25 09:10:45] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-25 09:10:53] [INFO ] Implicit Places using invariants and state equation in 9103 ms returned []
Implicit Place search using SMT with State Equation took 9974 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1301 places, 2526/2909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11723 ms. Remains : 1108/1301 places, 2526/2909 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 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 s643 1) (GEQ s681 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 49 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 finished in 11777 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)||G(p1)))'
Support contains 5 out of 1301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1301/1301 places, 2909/2909 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 0 with 24 rules applied. Total rules applied 24 place count 1301 transition count 2885
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1277 transition count 2885
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 48 place count 1277 transition count 2857
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 104 place count 1249 transition count 2857
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 1235 transition count 2831
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 1235 transition count 2831
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 132 place count 1235 transition count 2825
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 144 place count 1229 transition count 2825
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 155 place count 1218 transition count 2748
Iterating global reduction 2 with 11 rules applied. Total rules applied 166 place count 1218 transition count 2748
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 218 place count 1192 transition count 2722
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 1185 transition count 2715
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 1185 transition count 2715
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 239 place count 1178 transition count 2666
Iterating global reduction 2 with 7 rules applied. Total rules applied 246 place count 1178 transition count 2666
Applied a total of 246 rules in 373 ms. Remains 1178 /1301 variables (removed 123) and now considering 2666/2909 (removed 243) transitions.
[2024-05-25 09:10:54] [INFO ] Flow matrix only has 2394 transitions (discarded 272 similar events)
// Phase 1: matrix 2394 rows 1178 cols
[2024-05-25 09:10:54] [INFO ] Computed 68 invariants in 32 ms
[2024-05-25 09:10:55] [INFO ] Implicit Places using invariants in 969 ms returned [257, 317, 477, 495, 532, 555, 572, 582, 600, 613, 632, 669, 670, 671, 722, 756, 834, 876, 934, 986, 987]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 971 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1157/1301 places, 2666/2909 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1143 transition count 2652
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1143 transition count 2652
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1129 transition count 2638
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1129 transition count 2638
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 1118 transition count 2561
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 1118 transition count 2561
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 88 place count 1113 transition count 2556
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 1108 transition count 2551
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 1108 transition count 2551
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 1102 transition count 2509
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 1102 transition count 2509
Applied a total of 110 rules in 370 ms. Remains 1102 /1157 variables (removed 55) and now considering 2509/2666 (removed 157) transitions.
[2024-05-25 09:10:55] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1102 cols
[2024-05-25 09:10:55] [INFO ] Computed 47 invariants in 22 ms
[2024-05-25 09:10:56] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-05-25 09:10:56] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 09:10:56] [INFO ] Invariant cache hit.
[2024-05-25 09:10:57] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-25 09:11:03] [INFO ] Implicit Places using invariants and state equation in 7464 ms returned []
Implicit Place search using SMT with State Equation took 8317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1102/1301 places, 2509/2909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10033 ms. Remains : 1102/1301 places, 2509/2909 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s451 1) (GEQ s739 1) (GEQ s742 1)), p1:(AND (GEQ s330 1) (GEQ s403 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 finished in 10125 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)&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 1301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1301/1301 places, 2909/2909 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 1301 transition count 2886
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1278 transition count 2886
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 46 place count 1278 transition count 2859
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 100 place count 1251 transition count 2859
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 113 place count 1238 transition count 2834
Iterating global reduction 2 with 13 rules applied. Total rules applied 126 place count 1238 transition count 2834
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 126 place count 1238 transition count 2828
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 138 place count 1232 transition count 2828
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 148 place count 1222 transition count 2758
Iterating global reduction 2 with 10 rules applied. Total rules applied 158 place count 1222 transition count 2758
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 212 place count 1195 transition count 2731
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 218 place count 1189 transition count 2725
Iterating global reduction 2 with 6 rules applied. Total rules applied 224 place count 1189 transition count 2725
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 230 place count 1183 transition count 2683
Iterating global reduction 2 with 6 rules applied. Total rules applied 236 place count 1183 transition count 2683
Applied a total of 236 rules in 371 ms. Remains 1183 /1301 variables (removed 118) and now considering 2683/2909 (removed 226) transitions.
[2024-05-25 09:11:04] [INFO ] Flow matrix only has 2411 transitions (discarded 272 similar events)
// Phase 1: matrix 2411 rows 1183 cols
[2024-05-25 09:11:04] [INFO ] Computed 68 invariants in 31 ms
[2024-05-25 09:11:05] [INFO ] Implicit Places using invariants in 997 ms returned [257, 317, 477, 495, 532, 575, 585, 603, 616, 635, 672, 673, 674, 725, 759, 836, 939, 991, 992]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 999 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1164/1301 places, 2683/2909 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1152 transition count 2671
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1152 transition count 2671
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1140 transition count 2659
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1140 transition count 2659
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 1130 transition count 2589
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1130 transition count 2589
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 78 place count 1125 transition count 2584
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1120 transition count 2579
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1120 transition count 2579
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 1115 transition count 2544
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 1115 transition count 2544
Applied a total of 98 rules in 363 ms. Remains 1115 /1164 variables (removed 49) and now considering 2544/2683 (removed 139) transitions.
[2024-05-25 09:11:05] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
// Phase 1: matrix 2272 rows 1115 cols
[2024-05-25 09:11:05] [INFO ] Computed 49 invariants in 24 ms
[2024-05-25 09:11:06] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-25 09:11:06] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
[2024-05-25 09:11:06] [INFO ] Invariant cache hit.
[2024-05-25 09:11:07] [INFO ] State equation strengthened by 854 read => feed constraints.
[2024-05-25 09:11:15] [INFO ] Implicit Places using invariants and state equation in 8769 ms returned []
Implicit Place search using SMT with State Equation took 9643 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1115/1301 places, 2544/2909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11377 ms. Remains : 1115/1301 places, 2544/2909 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-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=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(LT s868 1), p2:(AND (NOT (AND (GEQ s605 1) (GEQ s908 1) (GEQ s549 1) (GEQ s553 1))) (NOT (AND (GEQ s605 1) (GEQ s908 1)))), p1:(AND (GEQ s605 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1955 reset in 544 ms.
Product exploration explored 100000 steps with 1957 reset in 536 ms.
Computed a total of 300 stabilizing places and 928 stable transitions
Computed a total of 300 stabilizing places and 928 stable transitions
Detected a total of 300/1115 stabilizing places and 928/2544 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2)), true, (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 146 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Finished random walk after 1900 steps, including 36 resets, run visited all 1 properties in 13 ms. (steps per millisecond=146 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2)), true, (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13 finished in 13010 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(p0)&&G((p1||X(G(p2))))))'
Support contains 7 out of 1301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1301/1301 places, 2909/2909 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1282 transition count 2884
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1282 transition count 2884
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 1265 transition count 2801
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 1265 transition count 2801
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1259 transition count 2759
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1259 transition count 2759
Applied a total of 84 rules in 208 ms. Remains 1259 /1301 variables (removed 42) and now considering 2759/2909 (removed 150) transitions.
[2024-05-25 09:11:17] [INFO ] Flow matrix only has 2487 transitions (discarded 272 similar events)
// Phase 1: matrix 2487 rows 1259 cols
[2024-05-25 09:11:17] [INFO ] Computed 68 invariants in 26 ms
[2024-05-25 09:11:18] [INFO ] Implicit Places using invariants in 965 ms returned [348, 512, 532, 599, 618, 628, 649, 662, 684, 723, 724, 725, 780, 814, 895, 939, 997, 1052]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 967 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1301 places, 2759/2909 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1223 transition count 2741
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1223 transition count 2741
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1205 transition count 2723
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1205 transition count 2723
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1187 transition count 2705
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1187 transition count 2705
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 124 place count 1171 transition count 2593
Iterating global reduction 0 with 16 rules applied. Total rules applied 140 place count 1171 transition count 2593
Applied a total of 140 rules in 267 ms. Remains 1171 /1241 variables (removed 70) and now considering 2593/2759 (removed 166) transitions.
[2024-05-25 09:11:18] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1171 cols
[2024-05-25 09:11:18] [INFO ] Computed 50 invariants in 30 ms
[2024-05-25 09:11:19] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-25 09:11:19] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2024-05-25 09:11:19] [INFO ] Invariant cache hit.
[2024-05-25 09:11:20] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-25 09:11:29] [INFO ] Implicit Places using invariants and state equation in 9938 ms returned []
Implicit Place search using SMT with State Equation took 10820 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1171/1301 places, 2593/2909 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12263 ms. Remains : 1171/1301 places, 2593/2909 transitions.
Stuttering acceptance computed with spot in 713 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s568 1), p0:(AND (GEQ s818 1) (GEQ s1119 1)), p2:(AND (GEQ s2 1) (GEQ s287 1) (GEQ s985 1) (GEQ s986 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 finished in 12997 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)||G((F(p1)&&F(G(p0))))))'
Support contains 6 out of 1301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1301/1301 places, 2909/2909 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 0 with 24 rules applied. Total rules applied 24 place count 1301 transition count 2885
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1277 transition count 2885
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 48 place count 1277 transition count 2860
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 98 place count 1252 transition count 2860
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 109 place count 1241 transition count 2837
Iterating global reduction 2 with 11 rules applied. Total rules applied 120 place count 1241 transition count 2837
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 120 place count 1241 transition count 2833
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 128 place count 1237 transition count 2833
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 136 place count 1229 transition count 2777
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 1229 transition count 2777
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
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 202 place count 1200 transition count 2748
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 209 place count 1193 transition count 2741
Iterating global reduction 2 with 7 rules applied. Total rules applied 216 place count 1193 transition count 2741
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 1186 transition count 2692
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 1186 transition count 2692
Applied a total of 230 rules in 378 ms. Remains 1186 /1301 variables (removed 115) and now considering 2692/2909 (removed 217) transitions.
[2024-05-25 09:11:30] [INFO ] Flow matrix only has 2420 transitions (discarded 272 similar events)
// Phase 1: matrix 2420 rows 1186 cols
[2024-05-25 09:11:30] [INFO ] Computed 68 invariants in 29 ms
[2024-05-25 09:11:31] [INFO ] Implicit Places using invariants in 967 ms returned [259, 319, 479, 537, 560, 577, 587, 620, 640, 677, 678, 679, 730, 764, 841, 883, 941, 994]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 969 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/1301 places, 2692/2909 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1157 transition count 2681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1157 transition count 2681
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1146 transition count 2670
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1146 transition count 2670
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 1138 transition count 2614
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 1138 transition count 2614
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 70 place count 1133 transition count 2609
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 1128 transition count 2604
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 1128 transition count 2604
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 1122 transition count 2562
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 1122 transition count 2562
Applied a total of 92 rules in 366 ms. Remains 1122 /1168 variables (removed 46) and now considering 2562/2692 (removed 130) transitions.
[2024-05-25 09:11:31] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1122 cols
[2024-05-25 09:11:31] [INFO ] Computed 50 invariants in 29 ms
[2024-05-25 09:11:32] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-25 09:11:32] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2024-05-25 09:11:32] [INFO ] Invariant cache hit.
[2024-05-25 09:11:33] [INFO ] State equation strengthened by 866 read => feed constraints.
[2024-05-25 09:11:41] [INFO ] Implicit Places using invariants and state equation in 9298 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10175 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1121/1301 places, 2562/2909 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 1121 transition count 2561
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 1120 transition count 2561
Applied a total of 2 rules in 80 ms. Remains 1120 /1121 variables (removed 1) and now considering 2561/2562 (removed 1) transitions.
[2024-05-25 09:11:41] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1120 cols
[2024-05-25 09:11:41] [INFO ] Computed 49 invariants in 29 ms
[2024-05-25 09:11:42] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-25 09:11:42] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-25 09:11:42] [INFO ] Invariant cache hit.
[2024-05-25 09:11:43] [INFO ] State equation strengthened by 866 read => feed constraints.
[2024-05-25 09:11:52] [INFO ] Implicit Places using invariants and state equation in 9354 ms returned []
Implicit Place search using SMT with State Equation took 10229 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1120/1301 places, 2561/2909 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 22200 ms. Remains : 1120/1301 places, 2561/2909 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s490 1) (GEQ s513 1)), p1:(OR (AND (GEQ s978 1) (GEQ s1077 1)) (AND (GEQ s593 1) (GEQ s609 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 finished in 22456 ms.
All properties solved by simple procedures.
Total runtime 353907 ms.

BK_STOP 1716628313233

--------------------
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-S16C07"
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-S16C07, 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-171654371900028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 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 ;