Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419400788.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r233-tall-167856419400788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 13K Feb 26 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 02:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 02:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 5 18:22 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 1679613274993

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 23:14:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 23:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:14:36] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2023-03-23 23:14:36] [INFO ] Transformed 6222 places.
[2023-03-23 23:14:36] [INFO ] Transformed 8685 transitions.
[2023-03-23 23:14:36] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 545 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 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 1881 places :
Symmetric choice reduction at 1 with 1881 rule applications. Total rules 1915 place count 4307 transition count 6804
Iterating global reduction 1 with 1881 rules applied. Total rules applied 3796 place count 4307 transition count 6804
Discarding 1655 places :
Symmetric choice reduction at 1 with 1655 rule applications. Total rules 5451 place count 2652 transition count 5149
Iterating global reduction 1 with 1655 rules applied. Total rules applied 7106 place count 2652 transition count 5149
Discarding 223 places :
Symmetric choice reduction at 1 with 223 rule applications. Total rules 7329 place count 2429 transition count 3588
Iterating global reduction 1 with 223 rules applied. Total rules applied 7552 place count 2429 transition count 3588
Applied a total of 7552 rules in 1226 ms. Remains 2429 /6222 variables (removed 3793) and now considering 3588/8685 (removed 5097) transitions.
[2023-03-23 23:14:38] [INFO ] Flow matrix only has 3316 transitions (discarded 272 similar events)
// Phase 1: matrix 3316 rows 2429 cols
[2023-03-23 23:14:38] [INFO ] Computed 577 place invariants in 146 ms
[2023-03-23 23:14:42] [INFO ] Implicit Places using invariants in 3378 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, 181, 212, 219, 222, 223, 224, 225, 226, 227, 228, 229, 232, 237, 244, 253, 264, 277, 291, 305, 307, 308, 309, 310, 311, 312, 323, 332, 339, 344, 350, 352, 390, 393, 396, 397, 398, 399, 400, 401, 405, 408, 413, 420, 429, 440, 453, 465, 466, 467, 468, 469, 470, 471, 472, 481, 488, 493, 496, 498, 500, 531, 538, 541, 542, 543, 544, 545, 546, 547, 548, 550, 552, 555, 560, 567, 576, 586, 596, 597, 598, 599, 600, 601, 602, 603, 610, 615, 618, 620, 622, 624, 655, 662, 665, 666, 667, 668, 669, 670, 671, 672, 674, 676, 678, 681, 686, 693, 701, 709, 710, 711, 712, 713, 714, 715, 716, 721, 724, 726, 728, 730, 732, 763, 770, 773, 774, 775, 776, 777, 778, 779, 782, 784, 786, 788, 791, 796, 802, 808, 810, 811, 812, 814, 815, 820, 822, 827, 829, 831, 833, 864, 871, 874, 875, 876, 877, 878, 879, 880, 881, 883, 885, 887, 889, 891, 894, 898, 902, 903, 904, 905, 906, 907, 908, 909, 911, 913, 915, 917, 919, 921, 952, 959, 962, 964, 965, 966, 967, 968, 969, 971, 973, 975, 977, 982, 984, 986, 989, 990, 991, 992, 993, 994, 995, 996, 998, 1000, 1002, 1004, 1006, 1008, 1039, 1041, 1045, 1048, 1049, 1050, 1051, 1052, 1054, 1055, 1057, 1062, 1064, 1066, 1068, 1070, 1072, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1084, 1086, 1089, 1091, 1093, 1095, 1126, 1133, 1136, 1138, 1139, 1140, 1141, 1142, 1143, 1145, 1150, 1152, 1154, 1156, 1158, 1160, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1172, 1174, 1176, 1178, 1180, 1182, 1213, 1220, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1245, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1260, 1262, 1264, 1266, 1268, 1270, 1301, 1308, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1320, 1322, 1324, 1326, 1328, 1331, 1336, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1355, 1358, 1360, 1362, 1364, 1367, 1398, 1405, 1408, 1410, 1411, 1412, 1413, 1415, 1420, 1422, 1427, 1429, 1432, 1437, 1444, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1467, 1472, 1475, 1477, 1479, 1481, 1512, 1519, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1531, 1533, 1535, 1538, 1543, 1550, 1559, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1586, 1593, 1598, 1601, 1603, 1605, 1636, 1643, 1646, 1647, 1648, 1650, 1651, 1652, 1653, 1655, 1660, 1663, 1668, 1675, 1684, 1695, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1726, 1735, 1742, 1747, 1750, 1752, 1790, 1793, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1802, 1805, 1810, 1817, 1826, 1837, 1850, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1885, 1896, 1905, 1912, 1920, 1951, 1953, 1957, 1960, 1961, 1962, 1963, 1964, 1965, 1967, 1970, 1975, 1982, 1993, 2004, 2017, 2032, 2049, 2050, 2051, 2052, 2053, 2054, 2055, 2056, 2071, 2084, 2095, 2104, 2111, 2116, 2148]
Discarding 515 places :
Implicit Place search using SMT only with invariants took 3559 ms to find 515 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1914/6222 places, 3588/8685 transitions.
Discarding 213 places :
Symmetric choice reduction at 0 with 213 rule applications. Total rules 213 place count 1701 transition count 3375
Iterating global reduction 0 with 213 rules applied. Total rules applied 426 place count 1701 transition count 3375
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 638 place count 1489 transition count 3163
Iterating global reduction 0 with 212 rules applied. Total rules applied 850 place count 1489 transition count 3163
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 1062 place count 1277 transition count 2951
Iterating global reduction 0 with 212 rules applied. Total rules applied 1274 place count 1277 transition count 2951
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 1296 place count 1255 transition count 2797
Iterating global reduction 0 with 22 rules applied. Total rules applied 1318 place count 1255 transition count 2797
Applied a total of 1318 rules in 281 ms. Remains 1255 /1914 variables (removed 659) and now considering 2797/3588 (removed 791) transitions.
[2023-03-23 23:14:42] [INFO ] Flow matrix only has 2525 transitions (discarded 272 similar events)
// Phase 1: matrix 2525 rows 1255 cols
[2023-03-23 23:14:42] [INFO ] Computed 62 place invariants in 37 ms
[2023-03-23 23:14:43] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2023-03-23 23:14:43] [INFO ] Flow matrix only has 2525 transitions (discarded 272 similar events)
[2023-03-23 23:14:43] [INFO ] Invariant cache hit.
[2023-03-23 23:14:44] [INFO ] State equation strengthened by 980 read => feed constraints.
[2023-03-23 23:14:53] [INFO ] Implicit Places using invariants and state equation in 9837 ms returned []
Implicit Place search using SMT with State Equation took 10860 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1255/6222 places, 2797/8685 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15927 ms. Remains : 1255/6222 places, 2797/8685 transitions.
Support contains 39 out of 1255 places after structural reductions.
[2023-03-23 23:14:53] [INFO ] Flatten gal took : 203 ms
[2023-03-23 23:14:53] [INFO ] Flatten gal took : 133 ms
[2023-03-23 23:14:53] [INFO ] Input system was already deterministic with 2797 transitions.
Support contains 37 out of 1255 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2023-03-23 23:14:54] [INFO ] Flow matrix only has 2525 transitions (discarded 272 similar events)
[2023-03-23 23:14:54] [INFO ] Invariant cache hit.
[2023-03-23 23:14:55] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 23:14:55] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-23 23:14:57] [INFO ] After 1916ms SMT Verify possible using state equation in real domain returned unsat :3 sat :5 real:7
[2023-03-23 23:14:57] [INFO ] State equation strengthened by 980 read => feed constraints.
[2023-03-23 23:14:58] [INFO ] After 713ms SMT Verify possible using 980 Read/Feed constraints in real domain returned unsat :3 sat :0 real:12
[2023-03-23 23:14:58] [INFO ] After 3460ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:12
[2023-03-23 23:14:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 23:14:58] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-23 23:15:00] [INFO ] After 1736ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :12
[2023-03-23 23:15:07] [INFO ] After 6378ms SMT Verify possible using 980 Read/Feed constraints in natural domain returned unsat :5 sat :10
[2023-03-23 23:15:07] [INFO ] Deduced a trap composed of 363 places in 593 ms of which 7 ms to minimize.
[2023-03-23 23:15:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 763 ms
[2023-03-23 23:15:09] [INFO ] Deduced a trap composed of 170 places in 573 ms of which 2 ms to minimize.
[2023-03-23 23:15:09] [INFO ] Deduced a trap composed of 365 places in 635 ms of which 2 ms to minimize.
[2023-03-23 23:15:10] [INFO ] Deduced a trap composed of 167 places in 560 ms of which 2 ms to minimize.
[2023-03-23 23:15:11] [INFO ] Deduced a trap composed of 422 places in 583 ms of which 15 ms to minimize.
[2023-03-23 23:15:11] [INFO ] Deduced a trap composed of 166 places in 566 ms of which 1 ms to minimize.
[2023-03-23 23:15:12] [INFO ] Deduced a trap composed of 230 places in 585 ms of which 1 ms to minimize.
[2023-03-23 23:15:13] [INFO ] Deduced a trap composed of 172 places in 575 ms of which 2 ms to minimize.
[2023-03-23 23:15:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4953 ms
[2023-03-23 23:15:14] [INFO ] Deduced a trap composed of 253 places in 547 ms of which 2 ms to minimize.
[2023-03-23 23:15:15] [INFO ] Deduced a trap composed of 268 places in 518 ms of which 3 ms to minimize.
[2023-03-23 23:15:16] [INFO ] Deduced a trap composed of 274 places in 509 ms of which 1 ms to minimize.
[2023-03-23 23:15:16] [INFO ] Deduced a trap composed of 275 places in 529 ms of which 1 ms to minimize.
[2023-03-23 23:15:17] [INFO ] Deduced a trap composed of 305 places in 524 ms of which 3 ms to minimize.
[2023-03-23 23:15:18] [INFO ] Deduced a trap composed of 355 places in 530 ms of which 2 ms to minimize.
[2023-03-23 23:15:18] [INFO ] Deduced a trap composed of 392 places in 551 ms of which 1 ms to minimize.
[2023-03-23 23:15:19] [INFO ] Deduced a trap composed of 321 places in 510 ms of which 1 ms to minimize.
[2023-03-23 23:15:19] [INFO ] Deduced a trap composed of 272 places in 513 ms of which 1 ms to minimize.
[2023-03-23 23:15:20] [INFO ] Deduced a trap composed of 261 places in 528 ms of which 1 ms to minimize.
[2023-03-23 23:15:21] [INFO ] Deduced a trap composed of 274 places in 509 ms of which 1 ms to minimize.
[2023-03-23 23:15:21] [INFO ] Deduced a trap composed of 293 places in 513 ms of which 1 ms to minimize.
[2023-03-23 23:15:22] [INFO ] Deduced a trap composed of 272 places in 494 ms of which 1 ms to minimize.
[2023-03-23 23:15:22] [INFO ] Deduced a trap composed of 298 places in 505 ms of which 1 ms to minimize.
[2023-03-23 23:15:23] [INFO ] Deduced a trap composed of 308 places in 511 ms of which 2 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-23 23:15:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:15:23] [INFO ] After 25312ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:12
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 13 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1255 transition count 2770
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1228 transition count 2770
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 54 place count 1228 transition count 2754
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 86 place count 1212 transition count 2754
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 1209 transition count 2733
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 1209 transition count 2733
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 150 place count 1180 transition count 2704
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 1174 transition count 2698
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 1174 transition count 2698
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 168 place count 1168 transition count 2656
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 1168 transition count 2656
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 307 place count 1168 transition count 3387
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 440 place count 1035 transition count 3387
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 449 place count 1035 transition count 3387
Applied a total of 449 rules in 764 ms. Remains 1035 /1255 variables (removed 220) and now considering 3387/2797 (removed -590) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 765 ms. Remains : 1035/1255 places, 3387/2797 transitions.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-23 23:15:25] [INFO ] Flow matrix only has 3001 transitions (discarded 386 similar events)
// Phase 1: matrix 3001 rows 1035 cols
[2023-03-23 23:15:25] [INFO ] Computed 62 place invariants in 35 ms
[2023-03-23 23:15:25] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 23:15:25] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-23 23:15:27] [INFO ] After 1540ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:3
[2023-03-23 23:15:27] [INFO ] State equation strengthened by 1790 read => feed constraints.
[2023-03-23 23:15:28] [INFO ] After 939ms SMT Verify possible using 1790 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 23:15:28] [INFO ] After 2899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 23:15:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-23 23:15:28] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-23 23:15:29] [INFO ] After 1286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 23:15:33] [INFO ] After 3454ms SMT Verify possible using 1790 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 23:15:33] [INFO ] Deduced a trap composed of 192 places in 478 ms of which 1 ms to minimize.
[2023-03-23 23:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 713 ms
[2023-03-23 23:15:35] [INFO ] Deduced a trap composed of 218 places in 483 ms of which 1 ms to minimize.
[2023-03-23 23:15:35] [INFO ] Deduced a trap composed of 114 places in 545 ms of which 1 ms to minimize.
[2023-03-23 23:15:36] [INFO ] Deduced a trap composed of 83 places in 547 ms of which 1 ms to minimize.
[2023-03-23 23:15:36] [INFO ] Deduced a trap composed of 223 places in 556 ms of which 1 ms to minimize.
[2023-03-23 23:15:37] [INFO ] Deduced a trap composed of 84 places in 523 ms of which 1 ms to minimize.
[2023-03-23 23:15:38] [INFO ] Deduced a trap composed of 91 places in 518 ms of which 1 ms to minimize.
[2023-03-23 23:15:39] [INFO ] Deduced a trap composed of 205 places in 477 ms of which 1 ms to minimize.
[2023-03-23 23:15:39] [INFO ] Deduced a trap composed of 99 places in 555 ms of which 1 ms to minimize.
[2023-03-23 23:15:40] [INFO ] Deduced a trap composed of 99 places in 526 ms of which 1 ms to minimize.
[2023-03-23 23:15:41] [INFO ] Deduced a trap composed of 195 places in 472 ms of which 1 ms to minimize.
[2023-03-23 23:15:41] [INFO ] Deduced a trap composed of 84 places in 535 ms of which 1 ms to minimize.
[2023-03-23 23:15:42] [INFO ] Deduced a trap composed of 208 places in 459 ms of which 1 ms to minimize.
[2023-03-23 23:15:42] [INFO ] Deduced a trap composed of 174 places in 503 ms of which 1 ms to minimize.
[2023-03-23 23:15:43] [INFO ] Deduced a trap composed of 95 places in 537 ms of which 1 ms to minimize.
[2023-03-23 23:15:44] [INFO ] Deduced a trap composed of 97 places in 514 ms of which 1 ms to minimize.
[2023-03-23 23:15:44] [INFO ] Deduced a trap composed of 88 places in 533 ms of which 1 ms to minimize.
[2023-03-23 23:15:45] [INFO ] Deduced a trap composed of 90 places in 521 ms of which 1 ms to minimize.
[2023-03-23 23:15:46] [INFO ] Deduced a trap composed of 105 places in 508 ms of which 1 ms to minimize.
[2023-03-23 23:15:46] [INFO ] Deduced a trap composed of 90 places in 527 ms of which 1 ms to minimize.
[2023-03-23 23:15:47] [INFO ] Deduced a trap composed of 91 places in 529 ms of which 1 ms to minimize.
[2023-03-23 23:15:48] [INFO ] Deduced a trap composed of 83 places in 530 ms of which 1 ms to minimize.
[2023-03-23 23:15:48] [INFO ] Deduced a trap composed of 94 places in 549 ms of which 4 ms to minimize.
[2023-03-23 23:15:49] [INFO ] Deduced a trap composed of 91 places in 515 ms of which 1 ms to minimize.
[2023-03-23 23:15:50] [INFO ] Deduced a trap composed of 98 places in 530 ms of which 1 ms to minimize.
[2023-03-23 23:15:50] [INFO ] Deduced a trap composed of 184 places in 479 ms of which 1 ms to minimize.
[2023-03-23 23:15:51] [INFO ] Deduced a trap composed of 187 places in 482 ms of which 1 ms to minimize.
[2023-03-23 23:15:52] [INFO ] Deduced a trap composed of 82 places in 525 ms of which 2 ms to minimize.
[2023-03-23 23:15:52] [INFO ] Deduced a trap composed of 92 places in 526 ms of which 1 ms to minimize.
[2023-03-23 23:15:53] [INFO ] Deduced a trap composed of 103 places in 521 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-23 23:15:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:15:53] [INFO ] After 25276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 26 ms.
Support contains 11 out of 1035 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1035/1035 places, 3387/3387 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 1035 transition count 3386
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1034 transition count 3386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1033 transition count 3385
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1033 transition count 3385
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1033 transition count 3385
Applied a total of 5 rules in 250 ms. Remains 1033 /1035 variables (removed 2) and now considering 3385/3387 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 1033/1035 places, 3385/3387 transitions.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 61386 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{5=1}
Probabilistic random walk after 61386 steps, saw 25956 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :1
Running SMT prover for 7 properties.
[2023-03-23 23:15:57] [INFO ] Flow matrix only has 2999 transitions (discarded 386 similar events)
// Phase 1: matrix 2999 rows 1033 cols
[2023-03-23 23:15:57] [INFO ] Computed 62 place invariants in 32 ms
[2023-03-23 23:15:57] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 23:15:57] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-23 23:15:59] [INFO ] After 1642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 23:15:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 23:15:59] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-23 23:16:00] [INFO ] After 1370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 23:16:00] [INFO ] State equation strengthened by 1790 read => feed constraints.
[2023-03-23 23:16:03] [INFO ] After 2465ms SMT Verify possible using 1790 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 23:16:03] [INFO ] Deduced a trap composed of 204 places in 471 ms of which 1 ms to minimize.
[2023-03-23 23:16:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 686 ms
[2023-03-23 23:16:04] [INFO ] Deduced a trap composed of 85 places in 511 ms of which 1 ms to minimize.
[2023-03-23 23:16:05] [INFO ] Deduced a trap composed of 88 places in 536 ms of which 1 ms to minimize.
[2023-03-23 23:16:06] [INFO ] Deduced a trap composed of 234 places in 483 ms of which 5 ms to minimize.
[2023-03-23 23:16:06] [INFO ] Deduced a trap composed of 78 places in 539 ms of which 1 ms to minimize.
[2023-03-23 23:16:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2656 ms
[2023-03-23 23:16:08] [INFO ] Deduced a trap composed of 156 places in 443 ms of which 1 ms to minimize.
[2023-03-23 23:16:08] [INFO ] Deduced a trap composed of 205 places in 430 ms of which 1 ms to minimize.
[2023-03-23 23:16:09] [INFO ] Deduced a trap composed of 225 places in 420 ms of which 1 ms to minimize.
[2023-03-23 23:16:09] [INFO ] Deduced a trap composed of 241 places in 413 ms of which 1 ms to minimize.
[2023-03-23 23:16:10] [INFO ] Deduced a trap composed of 211 places in 439 ms of which 1 ms to minimize.
[2023-03-23 23:16:10] [INFO ] Deduced a trap composed of 240 places in 421 ms of which 1 ms to minimize.
[2023-03-23 23:16:11] [INFO ] Deduced a trap composed of 240 places in 432 ms of which 1 ms to minimize.
[2023-03-23 23:16:11] [INFO ] Deduced a trap composed of 242 places in 431 ms of which 1 ms to minimize.
[2023-03-23 23:16:12] [INFO ] Deduced a trap composed of 239 places in 435 ms of which 1 ms to minimize.
[2023-03-23 23:16:13] [INFO ] Deduced a trap composed of 162 places in 463 ms of which 12 ms to minimize.
[2023-03-23 23:16:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5863 ms
[2023-03-23 23:16:14] [INFO ] Deduced a trap composed of 163 places in 476 ms of which 2 ms to minimize.
[2023-03-23 23:16:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 703 ms
[2023-03-23 23:16:15] [INFO ] After 14266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2095 ms.
[2023-03-23 23:16:17] [INFO ] After 18080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 10 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 3385/3385 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 1033 transition count 3384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1032 transition count 3384
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1032 transition count 3384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1031 transition count 3383
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1031 transition count 3383
Applied a total of 5 rules in 222 ms. Remains 1031 /1033 variables (removed 2) and now considering 3383/3385 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 1031/1033 places, 3383/3385 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 62847 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62847 steps, saw 26563 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 23:16:20] [INFO ] Flow matrix only has 2997 transitions (discarded 386 similar events)
// Phase 1: matrix 2997 rows 1031 cols
[2023-03-23 23:16:20] [INFO ] Computed 62 place invariants in 37 ms
[2023-03-23 23:16:21] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 23:16:21] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-23 23:16:22] [INFO ] After 1290ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-23 23:16:22] [INFO ] State equation strengthened by 1790 read => feed constraints.
[2023-03-23 23:16:23] [INFO ] After 338ms SMT Verify possible using 1790 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 23:16:23] [INFO ] After 2010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 23:16:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-23 23:16:23] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-23 23:16:24] [INFO ] After 1464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 23:16:27] [INFO ] After 2822ms SMT Verify possible using 1790 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 23:16:28] [INFO ] Deduced a trap composed of 221 places in 462 ms of which 1 ms to minimize.
[2023-03-23 23:16:29] [INFO ] Deduced a trap composed of 85 places in 537 ms of which 1 ms to minimize.
[2023-03-23 23:16:29] [INFO ] Deduced a trap composed of 80 places in 516 ms of which 0 ms to minimize.
[2023-03-23 23:16:30] [INFO ] Deduced a trap composed of 98 places in 547 ms of which 1 ms to minimize.
[2023-03-23 23:16:31] [INFO ] Deduced a trap composed of 111 places in 516 ms of which 1 ms to minimize.
[2023-03-23 23:16:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3174 ms
[2023-03-23 23:16:32] [INFO ] Deduced a trap composed of 195 places in 474 ms of which 1 ms to minimize.
[2023-03-23 23:16:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 620 ms
[2023-03-23 23:16:33] [INFO ] Deduced a trap composed of 176 places in 471 ms of which 1 ms to minimize.
[2023-03-23 23:16:34] [INFO ] Deduced a trap composed of 181 places in 459 ms of which 1 ms to minimize.
[2023-03-23 23:16:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1229 ms
[2023-03-23 23:16:35] [INFO ] Deduced a trap composed of 158 places in 460 ms of which 1 ms to minimize.
[2023-03-23 23:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 627 ms
[2023-03-23 23:16:35] [INFO ] After 10359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1420 ms.
[2023-03-23 23:16:36] [INFO ] After 13595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 1031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1031/1031 places, 3383/3383 transitions.
Applied a total of 0 rules in 88 ms. Remains 1031 /1031 variables (removed 0) and now considering 3383/3383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1031/1031 places, 3383/3383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1031/1031 places, 3383/3383 transitions.
Applied a total of 0 rules in 98 ms. Remains 1031 /1031 variables (removed 0) and now considering 3383/3383 (removed 0) transitions.
[2023-03-23 23:16:36] [INFO ] Flow matrix only has 2997 transitions (discarded 386 similar events)
[2023-03-23 23:16:36] [INFO ] Invariant cache hit.
[2023-03-23 23:16:37] [INFO ] Implicit Places using invariants in 1147 ms returned [200, 231, 238, 406, 422, 423, 464, 513, 591, 691, 759, 851]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1150 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1019/1031 places, 3383/3383 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1015 transition count 3379
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1015 transition count 3379
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1011 transition count 3375
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1011 transition count 3375
Applied a total of 16 rules in 167 ms. Remains 1011 /1019 variables (removed 8) and now considering 3375/3383 (removed 8) transitions.
[2023-03-23 23:16:38] [INFO ] Flow matrix only has 2989 transitions (discarded 386 similar events)
// Phase 1: matrix 2989 rows 1011 cols
[2023-03-23 23:16:38] [INFO ] Computed 50 place invariants in 26 ms
[2023-03-23 23:16:39] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-23 23:16:39] [INFO ] Flow matrix only has 2989 transitions (discarded 386 similar events)
[2023-03-23 23:16:39] [INFO ] Invariant cache hit.
[2023-03-23 23:16:39] [INFO ] State equation strengthened by 1790 read => feed constraints.
[2023-03-23 23:16:55] [INFO ] Implicit Places using invariants and state equation in 16395 ms returned []
Implicit Place search using SMT with State Equation took 17386 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1011/1031 places, 3375/3383 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18802 ms. Remains : 1011/1031 places, 3375/3383 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 423 stabilizing places and 1164 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&((p0 U (p2||G(p0)))||p1)))))'
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1241 transition count 2765
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1241 transition count 2765
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 1230 transition count 2748
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 1230 transition count 2748
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 1220 transition count 2678
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 1220 transition count 2678
Applied a total of 70 rules in 210 ms. Remains 1220 /1255 variables (removed 35) and now considering 2678/2797 (removed 119) transitions.
[2023-03-23 23:16:55] [INFO ] Flow matrix only has 2406 transitions (discarded 272 similar events)
// Phase 1: matrix 2406 rows 1220 cols
[2023-03-23 23:16:55] [INFO ] Computed 62 place invariants in 27 ms
[2023-03-23 23:16:56] [INFO ] Implicit Places using invariants in 1012 ms returned [256, 292, 301, 497, 519, 570, 595, 622, 711, 712, 828, 907, 1011, 1022]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1014 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1206/1255 places, 2678/2797 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1196 transition count 2668
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1196 transition count 2668
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1186 transition count 2658
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1186 transition count 2658
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1176 transition count 2648
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1176 transition count 2648
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1168 transition count 2592
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1168 transition count 2592
Applied a total of 76 rules in 263 ms. Remains 1168 /1206 variables (removed 38) and now considering 2592/2678 (removed 86) transitions.
[2023-03-23 23:16:57] [INFO ] Flow matrix only has 2320 transitions (discarded 272 similar events)
// Phase 1: matrix 2320 rows 1168 cols
[2023-03-23 23:16:57] [INFO ] Computed 48 place invariants in 31 ms
[2023-03-23 23:16:58] [INFO ] Implicit Places using invariants in 939 ms returned []
[2023-03-23 23:16:58] [INFO ] Flow matrix only has 2320 transitions (discarded 272 similar events)
[2023-03-23 23:16:58] [INFO ] Invariant cache hit.
[2023-03-23 23:16:58] [INFO ] State equation strengthened by 848 read => feed constraints.
[2023-03-23 23:17:06] [INFO ] Implicit Places using invariants and state equation in 8815 ms returned []
Implicit Place search using SMT with State Equation took 9756 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1168/1255 places, 2592/2797 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11244 ms. Remains : 1168/1255 places, 2592/2797 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), true, (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s512 1) (LT s520 1)), p1:(OR (LT s512 1) (LT s520 1)), p2:(AND (NOT (AND (GEQ s148 1) (GEQ s1134 1))) (NOT (AND (GEQ s512 1) (GEQ s520 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1180 steps with 16 reset in 29 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 finished in 11618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1240 transition count 2758
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1240 transition count 2758
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1229 transition count 2741
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1229 transition count 2741
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 1219 transition count 2671
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 1219 transition count 2671
Applied a total of 72 rules in 222 ms. Remains 1219 /1255 variables (removed 36) and now considering 2671/2797 (removed 126) transitions.
[2023-03-23 23:17:07] [INFO ] Flow matrix only has 2399 transitions (discarded 272 similar events)
// Phase 1: matrix 2399 rows 1219 cols
[2023-03-23 23:17:07] [INFO ] Computed 62 place invariants in 30 ms
[2023-03-23 23:17:08] [INFO ] Implicit Places using invariants in 1038 ms returned [255, 291, 300, 496, 517, 518, 567, 592, 619, 708, 709, 825, 904, 1008]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1205/1255 places, 2671/2797 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1195 transition count 2661
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1195 transition count 2661
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1185 transition count 2651
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1185 transition count 2651
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1175 transition count 2641
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1175 transition count 2641
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1167 transition count 2585
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1167 transition count 2585
Applied a total of 76 rules in 272 ms. Remains 1167 /1205 variables (removed 38) and now considering 2585/2671 (removed 86) transitions.
[2023-03-23 23:17:08] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
// Phase 1: matrix 2313 rows 1167 cols
[2023-03-23 23:17:08] [INFO ] Computed 48 place invariants in 23 ms
[2023-03-23 23:17:09] [INFO ] Implicit Places using invariants in 934 ms returned []
[2023-03-23 23:17:09] [INFO ] Flow matrix only has 2313 transitions (discarded 272 similar events)
[2023-03-23 23:17:09] [INFO ] Invariant cache hit.
[2023-03-23 23:17:10] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:17:19] [INFO ] Implicit Places using invariants and state equation in 10167 ms returned [1150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1166/1255 places, 2585/2797 transitions.
Applied a total of 0 rules in 49 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 12689 ms. Remains : 1166/1255 places, 2585/2797 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s999 1) (GEQ s1108 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 finished in 12913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X((p0 U (X(p1)||G(p0)))))) U p2))'
Support contains 5 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1255 transition count 2768
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1226 transition count 2768
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 58 place count 1226 transition count 2748
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 98 place count 1206 transition count 2748
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 1200 transition count 2724
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 1200 transition count 2724
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 1197 transition count 2709
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 1197 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 1196 transition count 2702
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 1196 transition count 2702
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 1168 transition count 2674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 182 place count 1160 transition count 2666
Iterating global reduction 2 with 8 rules applied. Total rules applied 190 place count 1160 transition count 2666
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 198 place count 1152 transition count 2610
Iterating global reduction 2 with 8 rules applied. Total rules applied 206 place count 1152 transition count 2610
Applied a total of 206 rules in 580 ms. Remains 1152 /1255 variables (removed 103) and now considering 2610/2797 (removed 187) transitions.
[2023-03-23 23:17:20] [INFO ] Flow matrix only has 2338 transitions (discarded 272 similar events)
// Phase 1: matrix 2338 rows 1152 cols
[2023-03-23 23:17:20] [INFO ] Computed 62 place invariants in 24 ms
[2023-03-23 23:17:21] [INFO ] Implicit Places using invariants in 984 ms returned [225, 260, 463, 484, 485, 530, 553, 579, 665, 666, 778, 856, 959, 969]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 986 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1138/1255 places, 2610/2797 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1134 transition count 2606
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1134 transition count 2606
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1130 transition count 2602
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1130 transition count 2602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1129 transition count 2595
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1129 transition count 2595
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 30 place count 1123 transition count 2589
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 1117 transition count 2583
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 1117 transition count 2583
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 1110 transition count 2534
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 1110 transition count 2534
Applied a total of 56 rules in 429 ms. Remains 1110 /1138 variables (removed 28) and now considering 2534/2610 (removed 76) transitions.
[2023-03-23 23:17:22] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1110 cols
[2023-03-23 23:17:22] [INFO ] Computed 48 place invariants in 30 ms
[2023-03-23 23:17:23] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-23 23:17:23] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2023-03-23 23:17:23] [INFO ] Invariant cache hit.
[2023-03-23 23:17:23] [INFO ] State equation strengthened by 848 read => feed constraints.
[2023-03-23 23:17:31] [INFO ] Implicit Places using invariants and state equation in 8613 ms returned []
Implicit Place search using SMT with State Equation took 9614 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1255 places, 2534/2797 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11610 ms. Remains : 1110/1255 places, 2534/2797 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s549 1) (GEQ s1089 1))) (GEQ s547 1) (GEQ s581 1)), p0:(LT s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6913 steps with 134 reset in 127 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03 finished in 11858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1240 transition count 2758
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1240 transition count 2758
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1229 transition count 2735
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1229 transition count 2735
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1220 transition count 2672
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1220 transition count 2672
Applied a total of 70 rules in 218 ms. Remains 1220 /1255 variables (removed 35) and now considering 2672/2797 (removed 125) transitions.
[2023-03-23 23:17:32] [INFO ] Flow matrix only has 2400 transitions (discarded 272 similar events)
// Phase 1: matrix 2400 rows 1220 cols
[2023-03-23 23:17:32] [INFO ] Computed 62 place invariants in 29 ms
[2023-03-23 23:17:33] [INFO ] Implicit Places using invariants in 1038 ms returned [294, 303, 499, 520, 521, 570, 595, 622, 711, 712, 828, 907, 1011, 1022]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1206/1255 places, 2672/2797 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1196 transition count 2662
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1196 transition count 2662
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1186 transition count 2652
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1186 transition count 2652
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1176 transition count 2642
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1176 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1168 transition count 2586
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1168 transition count 2586
Applied a total of 76 rules in 277 ms. Remains 1168 /1206 variables (removed 38) and now considering 2586/2672 (removed 86) transitions.
[2023-03-23 23:17:33] [INFO ] Flow matrix only has 2314 transitions (discarded 272 similar events)
// Phase 1: matrix 2314 rows 1168 cols
[2023-03-23 23:17:33] [INFO ] Computed 48 place invariants in 20 ms
[2023-03-23 23:17:34] [INFO ] Implicit Places using invariants in 928 ms returned []
[2023-03-23 23:17:34] [INFO ] Flow matrix only has 2314 transitions (discarded 272 similar events)
[2023-03-23 23:17:34] [INFO ] Invariant cache hit.
[2023-03-23 23:17:35] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:17:42] [INFO ] Implicit Places using invariants and state equation in 7538 ms returned []
Implicit Place search using SMT with State Equation took 8479 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1168/1255 places, 2586/2797 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10019 ms. Remains : 1168/1255 places, 2586/2797 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 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:(GEQ s288 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-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 finished in 10136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(X((p1&&X((X(X(F(p2)))||G(p1))))))))))'
Support contains 3 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1241 transition count 2759
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1241 transition count 2759
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1231 transition count 2737
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1231 transition count 2737
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 1223 transition count 2681
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 1223 transition count 2681
Applied a total of 64 rules in 217 ms. Remains 1223 /1255 variables (removed 32) and now considering 2681/2797 (removed 116) transitions.
[2023-03-23 23:17:42] [INFO ] Flow matrix only has 2409 transitions (discarded 272 similar events)
// Phase 1: matrix 2409 rows 1223 cols
[2023-03-23 23:17:42] [INFO ] Computed 62 place invariants in 22 ms
[2023-03-23 23:17:43] [INFO ] Implicit Places using invariants in 1001 ms returned [255, 291, 300, 496, 517, 570, 595, 622, 712, 831, 910, 1014, 1025]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1003 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1210/1255 places, 2681/2797 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1201 transition count 2672
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1201 transition count 2672
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1193 transition count 2664
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1193 transition count 2664
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1185 transition count 2656
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1185 transition count 2656
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1179 transition count 2614
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1179 transition count 2614
Applied a total of 62 rules in 265 ms. Remains 1179 /1210 variables (removed 31) and now considering 2614/2681 (removed 67) transitions.
[2023-03-23 23:17:43] [INFO ] Flow matrix only has 2342 transitions (discarded 272 similar events)
// Phase 1: matrix 2342 rows 1179 cols
[2023-03-23 23:17:43] [INFO ] Computed 49 place invariants in 29 ms
[2023-03-23 23:17:44] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-23 23:17:44] [INFO ] Flow matrix only has 2342 transitions (discarded 272 similar events)
[2023-03-23 23:17:44] [INFO ] Invariant cache hit.
[2023-03-23 23:17:45] [INFO ] State equation strengthened by 860 read => feed constraints.
[2023-03-23 23:17:55] [INFO ] Implicit Places using invariants and state equation in 10319 ms returned []
Implicit Place search using SMT with State Equation took 11270 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1179/1255 places, 2614/2797 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12756 ms. Remains : 1179/1255 places, 2614/2797 transitions.
Stuttering acceptance computed with spot in 816 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 10}, { cond=p0, acceptance={} source=3 dest: 11}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 9}, { cond=p1, acceptance={} source=8 dest: 12}], [{ cond=(NOT p2), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p1), acceptance={} source=10 dest: 4}, { cond=p1, acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 13}, { cond=(AND p0 p1), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 12}], [{ cond=true, acceptance={} source=13 dest: 8}], [{ cond=(NOT p0), acceptance={} source=14 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={} source=14 dest: 16}, { cond=(AND p0 p1), acceptance={} source=14 dest: 17}], [{ cond=true, acceptance={} source=15 dest: 12}], [{ cond=(NOT p0), acceptance={} source=16 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={} source=16 dest: 19}, { cond=(AND p0 p1), acceptance={} source=16 dest: 20}], [{ cond=(NOT p0), acceptance={} source=17 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={} source=17 dest: 19}, { cond=(AND p0 p1), acceptance={} source=17 dest: 20}], [{ cond=(NOT p2), acceptance={} source=18 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=19 dest: 18}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=19 dest: 19}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=19 dest: 20}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=20 dest: 18}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=20 dest: 19}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=20 dest: 20}]], initial=0, aps=[p0:(GEQ s694 1), p1:(GEQ s1138 1), p2:(LT s514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 finished in 13641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1255 transition count 2768
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1226 transition count 2768
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 58 place count 1226 transition count 2748
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 98 place count 1206 transition count 2748
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 1199 transition count 2717
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 1199 transition count 2717
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 1196 transition count 2702
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 1196 transition count 2702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 1195 transition count 2695
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 1195 transition count 2695
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 178 place count 1166 transition count 2666
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 1158 transition count 2658
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 1158 transition count 2658
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 202 place count 1150 transition count 2602
Iterating global reduction 2 with 8 rules applied. Total rules applied 210 place count 1150 transition count 2602
Applied a total of 210 rules in 450 ms. Remains 1150 /1255 variables (removed 105) and now considering 2602/2797 (removed 195) transitions.
[2023-03-23 23:17:56] [INFO ] Flow matrix only has 2330 transitions (discarded 272 similar events)
// Phase 1: matrix 2330 rows 1150 cols
[2023-03-23 23:17:56] [INFO ] Computed 62 place invariants in 22 ms
[2023-03-23 23:17:57] [INFO ] Implicit Places using invariants in 980 ms returned [225, 260, 268, 460, 481, 482, 527, 578, 663, 664, 776, 854, 957, 967]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 982 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1136/1255 places, 2602/2797 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1131 transition count 2597
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1131 transition count 2597
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1126 transition count 2592
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1126 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1124 transition count 2578
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1124 transition count 2578
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 34 place count 1119 transition count 2573
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1114 transition count 2568
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1114 transition count 2568
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1108 transition count 2526
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1108 transition count 2526
Applied a total of 56 rules in 413 ms. Remains 1108 /1136 variables (removed 28) and now considering 2526/2602 (removed 76) transitions.
[2023-03-23 23:17:57] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1108 cols
[2023-03-23 23:17:57] [INFO ] Computed 48 place invariants in 25 ms
[2023-03-23 23:17:58] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-03-23 23:17:58] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
[2023-03-23 23:17:58] [INFO ] Invariant cache hit.
[2023-03-23 23:17:59] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:18:08] [INFO ] Implicit Places using invariants and state equation in 9489 ms returned [1099]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10404 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1255 places, 2526/2797 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 1107 transition count 2525
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 1106 transition count 2525
Applied a total of 2 rules in 90 ms. Remains 1106 /1107 variables (removed 1) and now considering 2525/2526 (removed 1) transitions.
[2023-03-23 23:18:08] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2023-03-23 23:18:08] [INFO ] Computed 47 place invariants in 27 ms
[2023-03-23 23:18:09] [INFO ] Implicit Places using invariants in 894 ms returned []
[2023-03-23 23:18:09] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2023-03-23 23:18:09] [INFO ] Invariant cache hit.
[2023-03-23 23:18:09] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:18:19] [INFO ] Implicit Places using invariants and state equation in 10098 ms returned []
Implicit Place search using SMT with State Equation took 10994 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1106/1255 places, 2525/2797 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 23334 ms. Remains : 1106/1255 places, 2525/2797 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s539 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1956 reset in 571 ms.
Product exploration explored 100000 steps with 1955 reset in 624 ms.
Computed a total of 291 stabilizing places and 909 stable transitions
Computed a total of 291 stabilizing places and 909 stable transitions
Detected a total of 291/1106 stabilizing places and 909/2525 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80739 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80739 steps, saw 34152 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:18:23] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2023-03-23 23:18:23] [INFO ] Invariant cache hit.
[2023-03-23 23:18:23] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 23:18:23] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 23:18:24] [INFO ] After 669ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 23:18:24] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:18:24] [INFO ] After 118ms SMT Verify possible using 842 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:18:24] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:18:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 23:18:24] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 23:18:25] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:18:25] [INFO ] After 153ms SMT Verify possible using 842 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:18:26] [INFO ] Deduced a trap composed of 254 places in 422 ms of which 1 ms to minimize.
[2023-03-23 23:18:26] [INFO ] Deduced a trap composed of 184 places in 387 ms of which 1 ms to minimize.
[2023-03-23 23:18:27] [INFO ] Deduced a trap composed of 275 places in 429 ms of which 1 ms to minimize.
[2023-03-23 23:18:27] [INFO ] Deduced a trap composed of 215 places in 401 ms of which 1 ms to minimize.
[2023-03-23 23:18:28] [INFO ] Deduced a trap composed of 246 places in 437 ms of which 1 ms to minimize.
[2023-03-23 23:18:28] [INFO ] Deduced a trap composed of 181 places in 401 ms of which 1 ms to minimize.
[2023-03-23 23:18:29] [INFO ] Deduced a trap composed of 208 places in 428 ms of which 1 ms to minimize.
[2023-03-23 23:18:29] [INFO ] Deduced a trap composed of 210 places in 424 ms of which 1 ms to minimize.
[2023-03-23 23:18:30] [INFO ] Deduced a trap composed of 248 places in 429 ms of which 1 ms to minimize.
[2023-03-23 23:18:30] [INFO ] Deduced a trap composed of 224 places in 404 ms of which 1 ms to minimize.
[2023-03-23 23:18:31] [INFO ] Deduced a trap composed of 209 places in 424 ms of which 1 ms to minimize.
[2023-03-23 23:18:31] [INFO ] Deduced a trap composed of 199 places in 426 ms of which 1 ms to minimize.
[2023-03-23 23:18:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6036 ms
[2023-03-23 23:18:31] [INFO ] After 6239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-23 23:18:31] [INFO ] After 7129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1106 transition count 4000
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 973 transition count 4000
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 973 transition count 4000
Applied a total of 267 rules in 311 ms. Remains 973 /1106 variables (removed 133) and now considering 4000/2525 (removed -1475) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 973/1106 places, 4000/2525 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72034 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72034 steps, saw 30194 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:18:35] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
// Phase 1: matrix 3602 rows 973 cols
[2023-03-23 23:18:35] [INFO ] Computed 47 place invariants in 30 ms
[2023-03-23 23:18:35] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 23:18:35] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 23:18:36] [INFO ] After 869ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 23:18:36] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:18:36] [INFO ] After 254ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:18:36] [INFO ] After 1278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:18:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 23:18:36] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 23:18:37] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:18:38] [INFO ] After 298ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:18:38] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-23 23:18:38] [INFO ] After 1551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 4000/4000 transitions.
Applied a total of 0 rules in 109 ms. Remains 973 /973 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 973/973 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 4000/4000 transitions.
Applied a total of 0 rules in 102 ms. Remains 973 /973 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2023-03-23 23:18:38] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2023-03-23 23:18:38] [INFO ] Invariant cache hit.
[2023-03-23 23:18:39] [INFO ] Implicit Places using invariants in 1095 ms returned []
[2023-03-23 23:18:39] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2023-03-23 23:18:39] [INFO ] Invariant cache hit.
[2023-03-23 23:18:40] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:19:00] [INFO ] Implicit Places using invariants and state equation in 20856 ms returned []
Implicit Place search using SMT with State Equation took 21952 ms to find 0 implicit places.
[2023-03-23 23:19:00] [INFO ] Redundant transitions in 297 ms returned []
[2023-03-23 23:19:00] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2023-03-23 23:19:00] [INFO ] Invariant cache hit.
[2023-03-23 23:19:02] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23765 ms. Remains : 973/973 places, 4000/4000 transitions.
Graph (trivial) has 1051 edges and 973 vertex of which 17 / 973 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 4566 edges and 957 vertex of which 943 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 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 t1229.t1450 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 926 transition count 3231
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 829 transition count 3038
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 733 transition count 2870
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 661 transition count 2728
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 591 transition count 2608
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 541 transition count 2510
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 493 transition count 2430
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 461 transition count 2368
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 431 transition count 2320
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 413 transition count 2286
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 397 transition count 2262
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 389 transition count 2248
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 383 transition count 2240
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 380 transition count 2238
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 13 Pre rules applied. Total rules applied 1640 place count 380 transition count 2225
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 1666 place count 367 transition count 2225
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1950 place count 83 transition count 333
Iterating global reduction 14 with 284 rules applied. Total rules applied 2234 place count 83 transition count 333
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 254 rules applied. Total rules applied 2488 place count 83 transition count 79
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2496 place count 75 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2496 place count 75 transition count 78
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 2498 place count 74 transition count 78
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2510 place count 62 transition count 61
Iterating global reduction 16 with 12 rules applied. Total rules applied 2522 place count 62 transition count 61
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2527 place count 57 transition count 56
Iterating global reduction 16 with 5 rules applied. Total rules applied 2532 place count 57 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2536 place count 55 transition count 54
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2537 place count 54 transition count 52
Iterating global reduction 16 with 1 rules applied. Total rules applied 2538 place count 54 transition count 52
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 16 with 13 rules applied. Total rules applied 2551 place count 54 transition count 39
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 16 with 13 rules applied. Total rules applied 2564 place count 41 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2565 place count 41 transition count 39
Applied a total of 2565 rules in 492 ms. Remains 41 /973 variables (removed 932) and now considering 39/4000 (removed 3961) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 41 cols
[2023-03-23 23:19:02] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-23 23:19:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 23:19:02] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 9 ms returned sat
[2023-03-23 23:19:02] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:19:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 23:19:02] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2023-03-23 23:19:02] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:19:02] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 23:19:02] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Applied a total of 0 rules in 83 ms. Remains 1106 /1106 variables (removed 0) and now considering 2525/2525 (removed 0) transitions.
[2023-03-23 23:19:03] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2023-03-23 23:19:03] [INFO ] Computed 47 place invariants in 31 ms
[2023-03-23 23:19:04] [INFO ] Implicit Places using invariants in 931 ms returned []
[2023-03-23 23:19:04] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2023-03-23 23:19:04] [INFO ] Invariant cache hit.
[2023-03-23 23:19:04] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:19:13] [INFO ] Implicit Places using invariants and state equation in 9680 ms returned []
Implicit Place search using SMT with State Equation took 10612 ms to find 0 implicit places.
[2023-03-23 23:19:13] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-23 23:19:13] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2023-03-23 23:19:13] [INFO ] Invariant cache hit.
[2023-03-23 23:19:14] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11820 ms. Remains : 1106/1106 places, 2525/2525 transitions.
Computed a total of 291 stabilizing places and 909 stable transitions
Computed a total of 291 stabilizing places and 909 stable transitions
Detected a total of 291/1106 stabilizing places and 909/2525 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 194 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80669 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80669 steps, saw 34125 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:19:18] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2023-03-23 23:19:18] [INFO ] Invariant cache hit.
[2023-03-23 23:19:18] [INFO ] [Real]Absence check using 31 positive place invariants in 29 ms returned sat
[2023-03-23 23:19:18] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-23 23:19:19] [INFO ] After 671ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 23:19:19] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:19:19] [INFO ] After 122ms SMT Verify possible using 842 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:19:19] [INFO ] After 967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:19:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 23:19:19] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-23 23:19:20] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:19:20] [INFO ] After 156ms SMT Verify possible using 842 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:19:20] [INFO ] Deduced a trap composed of 254 places in 434 ms of which 1 ms to minimize.
[2023-03-23 23:19:21] [INFO ] Deduced a trap composed of 184 places in 392 ms of which 1 ms to minimize.
[2023-03-23 23:19:21] [INFO ] Deduced a trap composed of 275 places in 453 ms of which 1 ms to minimize.
[2023-03-23 23:19:22] [INFO ] Deduced a trap composed of 215 places in 411 ms of which 1 ms to minimize.
[2023-03-23 23:19:22] [INFO ] Deduced a trap composed of 246 places in 441 ms of which 1 ms to minimize.
[2023-03-23 23:19:23] [INFO ] Deduced a trap composed of 181 places in 419 ms of which 1 ms to minimize.
[2023-03-23 23:19:23] [INFO ] Deduced a trap composed of 208 places in 425 ms of which 1 ms to minimize.
[2023-03-23 23:19:24] [INFO ] Deduced a trap composed of 210 places in 458 ms of which 1 ms to minimize.
[2023-03-23 23:19:24] [INFO ] Deduced a trap composed of 248 places in 439 ms of which 1 ms to minimize.
[2023-03-23 23:19:25] [INFO ] Deduced a trap composed of 224 places in 412 ms of which 1 ms to minimize.
[2023-03-23 23:19:25] [INFO ] Deduced a trap composed of 209 places in 427 ms of which 1 ms to minimize.
[2023-03-23 23:19:26] [INFO ] Deduced a trap composed of 199 places in 428 ms of which 1 ms to minimize.
[2023-03-23 23:19:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6174 ms
[2023-03-23 23:19:26] [INFO ] After 6386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-23 23:19:26] [INFO ] After 7295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1106 transition count 4000
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 973 transition count 4000
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 973 transition count 4000
Applied a total of 267 rules in 311 ms. Remains 973 /1106 variables (removed 133) and now considering 4000/2525 (removed -1475) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 973/1106 places, 4000/2525 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68952 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68952 steps, saw 28893 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 23:19:30] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
// Phase 1: matrix 3602 rows 973 cols
[2023-03-23 23:19:30] [INFO ] Computed 47 place invariants in 32 ms
[2023-03-23 23:19:30] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 23:19:30] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 23:19:31] [INFO ] After 903ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 23:19:31] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:19:31] [INFO ] After 256ms SMT Verify possible using 2450 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:19:31] [INFO ] After 1320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:19:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 23:19:31] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-23 23:19:32] [INFO ] After 899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:19:32] [INFO ] After 307ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 23:19:32] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-23 23:19:32] [INFO ] After 1586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 4000/4000 transitions.
Applied a total of 0 rules in 109 ms. Remains 973 /973 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 973/973 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 4000/4000 transitions.
Applied a total of 0 rules in 104 ms. Remains 973 /973 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2023-03-23 23:19:33] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2023-03-23 23:19:33] [INFO ] Invariant cache hit.
[2023-03-23 23:19:34] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2023-03-23 23:19:34] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2023-03-23 23:19:34] [INFO ] Invariant cache hit.
[2023-03-23 23:19:35] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-23 23:19:55] [INFO ] Implicit Places using invariants and state equation in 20907 ms returned []
Implicit Place search using SMT with State Equation took 22027 ms to find 0 implicit places.
[2023-03-23 23:19:55] [INFO ] Redundant transitions in 183 ms returned []
[2023-03-23 23:19:55] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2023-03-23 23:19:55] [INFO ] Invariant cache hit.
[2023-03-23 23:19:56] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23719 ms. Remains : 973/973 places, 4000/4000 transitions.
Graph (trivial) has 1051 edges and 973 vertex of which 17 / 973 are part of one of the 1 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4566 edges and 957 vertex of which 943 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 t1229.t1450 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 926 transition count 3231
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 829 transition count 3038
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 733 transition count 2870
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 661 transition count 2728
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 591 transition count 2608
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 541 transition count 2510
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 493 transition count 2430
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 461 transition count 2368
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 431 transition count 2320
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 413 transition count 2286
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 397 transition count 2262
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 389 transition count 2248
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 383 transition count 2240
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 380 transition count 2238
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 13 Pre rules applied. Total rules applied 1640 place count 380 transition count 2225
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 1666 place count 367 transition count 2225
Discarding 284 places :
Symmetric choice reduction at 14 with 284 rule applications. Total rules 1950 place count 83 transition count 333
Iterating global reduction 14 with 284 rules applied. Total rules applied 2234 place count 83 transition count 333
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 14 with 254 rules applied. Total rules applied 2488 place count 83 transition count 79
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 2496 place count 75 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2496 place count 75 transition count 78
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 2498 place count 74 transition count 78
Discarding 12 places :
Symmetric choice reduction at 16 with 12 rule applications. Total rules 2510 place count 62 transition count 61
Iterating global reduction 16 with 12 rules applied. Total rules applied 2522 place count 62 transition count 61
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2527 place count 57 transition count 56
Iterating global reduction 16 with 5 rules applied. Total rules applied 2532 place count 57 transition count 56
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 2536 place count 55 transition count 54
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2537 place count 54 transition count 52
Iterating global reduction 16 with 1 rules applied. Total rules applied 2538 place count 54 transition count 52
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 16 with 13 rules applied. Total rules applied 2551 place count 54 transition count 39
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 16 with 13 rules applied. Total rules applied 2564 place count 41 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2565 place count 41 transition count 39
Applied a total of 2565 rules in 371 ms. Remains 41 /973 variables (removed 932) and now considering 39/4000 (removed 3961) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 41 cols
[2023-03-23 23:19:57] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-23 23:19:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 23:19:57] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-23 23:19:57] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 23:19:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-23 23:19:57] [INFO ] [Nat]Absence check using 2 positive and 14 generalized place invariants in 2 ms returned sat
[2023-03-23 23:19:57] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 23:19:57] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 23:19:57] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1954 reset in 492 ms.
Product exploration explored 100000 steps with 1957 reset in 518 ms.
Support contains 1 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Applied a total of 0 rules in 75 ms. Remains 1106 /1106 variables (removed 0) and now considering 2525/2525 (removed 0) transitions.
[2023-03-23 23:19:58] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2023-03-23 23:19:58] [INFO ] Computed 47 place invariants in 27 ms
[2023-03-23 23:19:59] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-23 23:19:59] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2023-03-23 23:19:59] [INFO ] Invariant cache hit.
[2023-03-23 23:20:00] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:20:09] [INFO ] Implicit Places using invariants and state equation in 10050 ms returned []
Implicit Place search using SMT with State Equation took 10954 ms to find 0 implicit places.
[2023-03-23 23:20:09] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-23 23:20:09] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2023-03-23 23:20:09] [INFO ] Invariant cache hit.
[2023-03-23 23:20:10] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12180 ms. Remains : 1106/1106 places, 2525/2525 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 finished in 135153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 5 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 2797/2797 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1240 transition count 2758
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1240 transition count 2758
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1229 transition count 2735
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1229 transition count 2735
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1220 transition count 2672
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1220 transition count 2672
Applied a total of 70 rules in 219 ms. Remains 1220 /1255 variables (removed 35) and now considering 2672/2797 (removed 125) transitions.
[2023-03-23 23:20:11] [INFO ] Flow matrix only has 2400 transitions (discarded 272 similar events)
// Phase 1: matrix 2400 rows 1220 cols
[2023-03-23 23:20:11] [INFO ] Computed 62 place invariants in 24 ms
[2023-03-23 23:20:12] [INFO ] Implicit Places using invariants in 996 ms returned [255, 291, 300, 496, 517, 518, 567, 592, 619, 708, 828, 1022]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1208/1255 places, 2672/2797 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1198 transition count 2662
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1198 transition count 2662
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1188 transition count 2652
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1188 transition count 2652
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1178 transition count 2642
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1178 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1170 transition count 2586
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1170 transition count 2586
Applied a total of 76 rules in 262 ms. Remains 1170 /1208 variables (removed 38) and now considering 2586/2672 (removed 86) transitions.
[2023-03-23 23:20:12] [INFO ] Flow matrix only has 2314 transitions (discarded 272 similar events)
// Phase 1: matrix 2314 rows 1170 cols
[2023-03-23 23:20:12] [INFO ] Computed 50 place invariants in 33 ms
[2023-03-23 23:20:13] [INFO ] Implicit Places using invariants in 944 ms returned []
[2023-03-23 23:20:13] [INFO ] Flow matrix only has 2314 transitions (discarded 272 similar events)
[2023-03-23 23:20:13] [INFO ] Invariant cache hit.
[2023-03-23 23:20:14] [INFO ] State equation strengthened by 842 read => feed constraints.
[2023-03-23 23:20:23] [INFO ] Implicit Places using invariants and state equation in 9773 ms returned [1153]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10722 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1169/1255 places, 2586/2797 transitions.
Applied a total of 0 rules in 48 ms. Remains 1169 /1169 variables (removed 0) and now considering 2586/2586 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12253 ms. Remains : 1169/1255 places, 2586/2797 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 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: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s683 1), p1:(OR (LT s2 1) (LT s871 1) (LT s975 1) (LT s976 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 200 steps with 2 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 finished in 12373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-23 23:20:23] [INFO ] Flatten gal took : 115 ms
[2023-03-23 23:20:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-23 23:20:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1255 places, 2797 transitions and 12361 arcs took 20 ms.
Total runtime 347274 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1304/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12

BK_STOP 1679613625547

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12
ltl formula formula --ltl=/tmp/1304/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1255 places, 2797 transitions and 12361 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.100 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
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 r233-tall-167856419400788"
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 ;