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-167856419400777.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-S16C06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400777
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 13K Feb 26 03:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K 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 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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.2M 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-S16C06-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679609389434

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 22:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 22:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:09:51] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2023-03-23 22:09:51] [INFO ] Transformed 5568 places.
[2023-03-23 22:09:51] [INFO ] Transformed 7799 transitions.
[2023-03-23 22:09:51] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 159 out of 5568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1575 places :
Symmetric choice reduction at 1 with 1575 rule applications. Total rules 1607 place count 3961 transition count 6224
Iterating global reduction 1 with 1575 rules applied. Total rules applied 3182 place count 3961 transition count 6224
Discarding 1332 places :
Symmetric choice reduction at 1 with 1332 rule applications. Total rules 4514 place count 2629 transition count 4892
Iterating global reduction 1 with 1332 rules applied. Total rules applied 5846 place count 2629 transition count 4892
Discarding 152 places :
Symmetric choice reduction at 1 with 152 rule applications. Total rules 5998 place count 2477 transition count 3980
Iterating global reduction 1 with 152 rules applied. Total rules applied 6150 place count 2477 transition count 3980
Applied a total of 6150 rules in 1105 ms. Remains 2477 /5568 variables (removed 3091) and now considering 3980/7799 (removed 3819) transitions.
[2023-03-23 22:09:52] [INFO ] Flow matrix only has 3708 transitions (discarded 272 similar events)
// Phase 1: matrix 3708 rows 2477 cols
[2023-03-23 22:09:53] [INFO ] Computed 541 place invariants in 185 ms
[2023-03-23 22:09:56] [INFO ] Implicit Places using invariants in 3566 ms returned [4, 8, 16, 18, 20, 22, 24, 31, 38, 47, 58, 71, 86, 105, 123, 125, 127, 129, 131, 133, 146, 157, 166, 173, 178, 181, 218, 223, 225, 226, 232, 237, 244, 253, 264, 277, 310, 313, 315, 316, 332, 341, 348, 356, 359, 361, 388, 395, 398, 399, 400, 401, 402, 404, 406, 409, 414, 424, 433, 444, 456, 471, 472, 473, 475, 486, 495, 500, 503, 507, 509, 536, 543, 546, 547, 548, 550, 551, 552, 554, 556, 562, 567, 574, 583, 593, 603, 604, 606, 608, 609, 616, 624, 627, 631, 633, 635, 662, 669, 672, 673, 674, 675, 676, 678, 682, 684, 686, 689, 694, 701, 709, 718, 720, 723, 728, 731, 736, 743, 747, 749, 776, 783, 786, 790, 791, 792, 793, 797, 801, 803, 805, 808, 813, 819, 825, 826, 827, 830, 831, 837, 839, 841, 843, 845, 847, 874, 881, 884, 885, 886, 887, 888, 889, 890, 892, 894, 898, 900, 903, 907, 911, 912, 915, 916, 917, 920, 925, 927, 929, 931, 935, 962, 969, 972, 973, 974, 975, 977, 978, 980, 982, 984, 986, 990, 992, 994, 997, 998, 999, 1000, 1002, 1003, 1006, 1008, 1010, 1013, 1015, 1019, 1046, 1048, 1052, 1055, 1056, 1061, 1066, 1071, 1077, 1080, 1082, 1086, 1088, 1091, 1094, 1095, 1096, 1097, 1103, 1105, 1107, 1109, 1111, 1113, 1140, 1147, 1152, 1153, 1156, 1161, 1166, 1168, 1170, 1172, 1174, 1178, 1182, 1183, 1186, 1187, 1189, 1191, 1193, 1198, 1203, 1208, 1237, 1244, 1247, 1249, 1250, 1254, 1258, 1260, 1264, 1271, 1273, 1276, 1282, 1283, 1286, 1287, 1293, 1297, 1299, 1301, 1306, 1311, 1338, 1345, 1348, 1350, 1351, 1353, 1354, 1356, 1360, 1364, 1366, 1373, 1376, 1381, 1388, 1389, 1394, 1399, 1402, 1407, 1413, 1418, 1422, 1451, 1458, 1461, 1463, 1464, 1465, 1467, 1469, 1471, 1476, 1478, 1481, 1489, 1505, 1506, 1507, 1509, 1510, 1511, 1521, 1526, 1529, 1534, 1536, 1538, 1565, 1572, 1575, 1576, 1577, 1578, 1581, 1586, 1589, 1593, 1596, 1601, 1608, 1617, 1631, 1633, 1635, 1646, 1657, 1663, 1666, 1670, 1672, 1702, 1709, 1715, 1717, 1718, 1720, 1722, 1727, 1734, 1743, 1755, 1769, 1782, 1785, 1786, 1787, 1788, 1799, 1810, 1817, 1822, 1825, 1827, 1856, 1863, 1869, 1871, 1872, 1879, 1884, 1889, 1897, 1908, 1919, 1934, 1949, 1950, 1952, 1953, 1955, 1970, 1981, 1993, 2000, 2005, 2008, 2035, 2037, 2041, 2044, 2046, 2047, 2048, 2050, 2053, 2058, 2068, 2079, 2090, 2103, 2118, 2135, 2136, 2137, 2142, 2162, 2176, 2187, 2196, 2203, 2208, 2236]
Discarding 410 places :
Implicit Place search using SMT only with invariants took 3732 ms to find 410 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2067/5568 places, 3980/7799 transitions.
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 106 place count 1961 transition count 3874
Iterating global reduction 0 with 106 rules applied. Total rules applied 212 place count 1961 transition count 3874
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 313 place count 1860 transition count 3773
Iterating global reduction 0 with 101 rules applied. Total rules applied 414 place count 1860 transition count 3773
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 514 place count 1760 transition count 3673
Iterating global reduction 0 with 100 rules applied. Total rules applied 614 place count 1760 transition count 3673
Applied a total of 614 rules in 254 ms. Remains 1760 /2067 variables (removed 307) and now considering 3673/3980 (removed 307) transitions.
[2023-03-23 22:09:56] [INFO ] Flow matrix only has 3401 transitions (discarded 272 similar events)
// Phase 1: matrix 3401 rows 1760 cols
[2023-03-23 22:09:56] [INFO ] Computed 131 place invariants in 75 ms
[2023-03-23 22:09:58] [INFO ] Implicit Places using invariants in 1568 ms returned []
[2023-03-23 22:09:58] [INFO ] Flow matrix only has 3401 transitions (discarded 272 similar events)
[2023-03-23 22:09:58] [INFO ] Invariant cache hit.
[2023-03-23 22:09:59] [INFO ] State equation strengthened by 1418 read => feed constraints.
[2023-03-23 22:10:22] [INFO ] Implicit Places using invariants and state equation in 23781 ms returned []
Implicit Place search using SMT with State Equation took 25369 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1760/5568 places, 3673/7799 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30463 ms. Remains : 1760/5568 places, 3673/7799 transitions.
Support contains 159 out of 1760 places after structural reductions.
[2023-03-23 22:10:22] [INFO ] Flatten gal took : 291 ms
[2023-03-23 22:10:22] [INFO ] Flatten gal took : 160 ms
[2023-03-23 22:10:23] [INFO ] Input system was already deterministic with 3673 transitions.
Support contains 157 out of 1760 places (down from 159) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 84) seen :15
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 69) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 68) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 67) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 66) seen :0
Running SMT prover for 66 properties.
[2023-03-23 22:10:24] [INFO ] Flow matrix only has 3401 transitions (discarded 272 similar events)
[2023-03-23 22:10:24] [INFO ] Invariant cache hit.
[2023-03-23 22:10:27] [INFO ] [Real]Absence check using 32 positive place invariants in 197 ms returned sat
[2023-03-23 22:10:27] [INFO ] [Real]Absence check using 32 positive and 99 generalized place invariants in 18 ms returned sat
[2023-03-23 22:10:27] [INFO ] After 2614ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:65
[2023-03-23 22:10:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 75 ms returned sat
[2023-03-23 22:10:29] [INFO ] [Nat]Absence check using 32 positive and 99 generalized place invariants in 18 ms returned sat
[2023-03-23 22:10:33] [INFO ] After 3129ms SMT Verify possible using state equation in natural domain returned unsat :53 sat :13
[2023-03-23 22:10:33] [INFO ] State equation strengthened by 1418 read => feed constraints.
[2023-03-23 22:10:37] [INFO ] After 4779ms SMT Verify possible using 1418 Read/Feed constraints in natural domain returned unsat :55 sat :11
[2023-03-23 22:10:40] [INFO ] Deduced a trap composed of 726 places in 1021 ms of which 8 ms to minimize.
[2023-03-23 22:10:41] [INFO ] Deduced a trap composed of 283 places in 1141 ms of which 2 ms to minimize.
[2023-03-23 22:10:42] [INFO ] Deduced a trap composed of 322 places in 1166 ms of which 3 ms to minimize.
[2023-03-23 22:10:43] [INFO ] Deduced a trap composed of 313 places in 986 ms of which 2 ms to minimize.
[2023-03-23 22:10:44] [INFO ] Deduced a trap composed of 313 places in 1025 ms of which 2 ms to minimize.
[2023-03-23 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 6032 ms
[2023-03-23 22:10:46] [INFO ] Deduced a trap composed of 387 places in 1004 ms of which 2 ms to minimize.
[2023-03-23 22:10:47] [INFO ] Deduced a trap composed of 441 places in 963 ms of which 1 ms to minimize.
[2023-03-23 22:10:49] [INFO ] Deduced a trap composed of 440 places in 921 ms of which 3 ms to minimize.
[2023-03-23 22:10:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3757 ms
[2023-03-23 22:10:50] [INFO ] Deduced a trap composed of 390 places in 994 ms of which 2 ms to minimize.
[2023-03-23 22:10:51] [INFO ] Deduced a trap composed of 426 places in 1011 ms of which 2 ms to minimize.
[2023-03-23 22:10:53] [INFO ] Deduced a trap composed of 335 places in 1032 ms of which 3 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.Application.startNoEx(Application.java:626)
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 22:10:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:10:53] [INFO ] After 25959ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:65
Fused 66 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 21 out of 1760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1760/1760 places, 3673/3673 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 0 with 50 rules applied. Total rules applied 50 place count 1760 transition count 3623
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 1710 transition count 3622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 1709 transition count 3622
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 102 place count 1709 transition count 3540
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 266 place count 1627 transition count 3540
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 326 place count 1567 transition count 3460
Iterating global reduction 3 with 60 rules applied. Total rules applied 386 place count 1567 transition count 3460
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 433 place count 1520 transition count 3228
Iterating global reduction 3 with 47 rules applied. Total rules applied 480 place count 1520 transition count 3228
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 119 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 562 place count 1479 transition count 3187
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 598 place count 1443 transition count 3151
Iterating global reduction 3 with 36 rules applied. Total rules applied 634 place count 1443 transition count 3151
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 666 place count 1411 transition count 2959
Iterating global reduction 3 with 32 rules applied. Total rules applied 698 place count 1411 transition count 2959
Free-agglomeration rule (complex) applied 174 times.
Iterating global reduction 3 with 174 rules applied. Total rules applied 872 place count 1411 transition count 3875
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 3 with 174 rules applied. Total rules applied 1046 place count 1237 transition count 3875
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 1125 place count 1237 transition count 3875
Applied a total of 1125 rules in 1631 ms. Remains 1237 /1760 variables (removed 523) and now considering 3875/3673 (removed -202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1633 ms. Remains : 1237/1760 places, 3875/3673 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-23 22:10:55] [INFO ] Flow matrix only has 3477 transitions (discarded 398 similar events)
// Phase 1: matrix 3477 rows 1237 cols
[2023-03-23 22:10:56] [INFO ] Computed 131 place invariants in 117 ms
[2023-03-23 22:10:56] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 22:10:56] [INFO ] [Nat]Absence check using 32 positive place invariants in 24 ms returned sat
[2023-03-23 22:10:56] [INFO ] [Nat]Absence check using 32 positive and 99 generalized place invariants in 18 ms returned sat
[2023-03-23 22:10:58] [INFO ] After 1679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 22:10:58] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-23 22:11:02] [INFO ] After 4117ms SMT Verify possible using 2143 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 22:11:03] [INFO ] Deduced a trap composed of 241 places in 650 ms of which 1 ms to minimize.
[2023-03-23 22:11:04] [INFO ] Deduced a trap composed of 296 places in 641 ms of which 1 ms to minimize.
[2023-03-23 22:11:05] [INFO ] Deduced a trap composed of 173 places in 675 ms of which 1 ms to minimize.
[2023-03-23 22:11:06] [INFO ] Deduced a trap composed of 267 places in 612 ms of which 1 ms to minimize.
[2023-03-23 22:11:06] [INFO ] Deduced a trap composed of 235 places in 640 ms of which 1 ms to minimize.
[2023-03-23 22:11:07] [INFO ] Deduced a trap composed of 285 places in 624 ms of which 2 ms to minimize.
[2023-03-23 22:11:08] [INFO ] Deduced a trap composed of 255 places in 653 ms of which 1 ms to minimize.
[2023-03-23 22:11:09] [INFO ] Deduced a trap composed of 301 places in 624 ms of which 1 ms to minimize.
[2023-03-23 22:11:10] [INFO ] Deduced a trap composed of 192 places in 651 ms of which 1 ms to minimize.
[2023-03-23 22:11:11] [INFO ] Deduced a trap composed of 243 places in 623 ms of which 1 ms to minimize.
[2023-03-23 22:11:12] [INFO ] Deduced a trap composed of 256 places in 646 ms of which 2 ms to minimize.
[2023-03-23 22:11:13] [INFO ] Deduced a trap composed of 234 places in 632 ms of which 1 ms to minimize.
[2023-03-23 22:11:13] [INFO ] Deduced a trap composed of 272 places in 641 ms of which 1 ms to minimize.
[2023-03-23 22:11:14] [INFO ] Deduced a trap composed of 226 places in 635 ms of which 1 ms to minimize.
[2023-03-23 22:11:15] [INFO ] Deduced a trap composed of 225 places in 628 ms of which 2 ms to minimize.
[2023-03-23 22:11:17] [INFO ] Deduced a trap composed of 280 places in 616 ms of which 1 ms to minimize.
[2023-03-23 22:11:18] [INFO ] Deduced a trap composed of 223 places in 631 ms of which 1 ms to minimize.
[2023-03-23 22:11:19] [INFO ] Deduced a trap composed of 238 places in 626 ms of which 1 ms to minimize.
[2023-03-23 22:11:20] [INFO ] Deduced a trap composed of 238 places in 626 ms of which 1 ms to minimize.
[2023-03-23 22:11:21] [INFO ] Deduced a trap composed of 269 places in 630 ms of which 1 ms to minimize.
[2023-03-23 22:11:22] [INFO ] Deduced a trap composed of 246 places in 655 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.Application.startNoEx(Application.java:626)
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 22:11:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:11:22] [INFO ] After 25593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 27 ms.
Support contains 15 out of 1237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1237/1237 places, 3875/3875 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1237 transition count 3873
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1235 transition count 3873
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 1235 transition count 3873
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 1231 transition count 3869
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 1231 transition count 3869
Applied a total of 17 rules in 358 ms. Remains 1231 /1237 variables (removed 6) and now considering 3869/3875 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 1231/1237 places, 3869/3875 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 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 39 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2023-03-23 22:11:23] [INFO ] Flow matrix only has 3471 transitions (discarded 398 similar events)
// Phase 1: matrix 3471 rows 1231 cols
[2023-03-23 22:11:23] [INFO ] Computed 131 place invariants in 35 ms
[2023-03-23 22:11:23] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 22:11:23] [INFO ] [Nat]Absence check using 32 positive place invariants in 22 ms returned sat
[2023-03-23 22:11:23] [INFO ] [Nat]Absence check using 32 positive and 99 generalized place invariants in 21 ms returned sat
[2023-03-23 22:11:25] [INFO ] After 1815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 22:11:25] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-23 22:11:29] [INFO ] After 3967ms SMT Verify possible using 2143 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 22:11:30] [INFO ] Deduced a trap composed of 259 places in 619 ms of which 1 ms to minimize.
[2023-03-23 22:11:31] [INFO ] Deduced a trap composed of 223 places in 629 ms of which 1 ms to minimize.
[2023-03-23 22:11:32] [INFO ] Deduced a trap composed of 243 places in 610 ms of which 4 ms to minimize.
[2023-03-23 22:11:33] [INFO ] Deduced a trap composed of 249 places in 637 ms of which 1 ms to minimize.
[2023-03-23 22:11:34] [INFO ] Deduced a trap composed of 230 places in 627 ms of which 1 ms to minimize.
[2023-03-23 22:11:35] [INFO ] Deduced a trap composed of 218 places in 657 ms of which 1 ms to minimize.
[2023-03-23 22:11:36] [INFO ] Deduced a trap composed of 252 places in 640 ms of which 1 ms to minimize.
[2023-03-23 22:11:37] [INFO ] Deduced a trap composed of 258 places in 637 ms of which 2 ms to minimize.
[2023-03-23 22:11:38] [INFO ] Deduced a trap composed of 232 places in 643 ms of which 1 ms to minimize.
[2023-03-23 22:11:39] [INFO ] Deduced a trap composed of 277 places in 654 ms of which 1 ms to minimize.
[2023-03-23 22:11:40] [INFO ] Deduced a trap composed of 254 places in 614 ms of which 2 ms to minimize.
[2023-03-23 22:11:41] [INFO ] Deduced a trap composed of 239 places in 627 ms of which 1 ms to minimize.
[2023-03-23 22:11:42] [INFO ] Deduced a trap composed of 224 places in 662 ms of which 1 ms to minimize.
[2023-03-23 22:11:43] [INFO ] Deduced a trap composed of 240 places in 612 ms of which 1 ms to minimize.
[2023-03-23 22:11:44] [INFO ] Deduced a trap composed of 269 places in 653 ms of which 2 ms to minimize.
[2023-03-23 22:11:45] [INFO ] Deduced a trap composed of 222 places in 615 ms of which 1 ms to minimize.
[2023-03-23 22:11:46] [INFO ] Deduced a trap composed of 226 places in 638 ms of which 1 ms to minimize.
[2023-03-23 22:11:47] [INFO ] Deduced a trap composed of 256 places in 643 ms of which 2 ms to minimize.
[2023-03-23 22:11:48] [INFO ] Deduced a trap composed of 252 places in 667 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.Application.startNoEx(Application.java:626)
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 22:11:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:11:48] [INFO ] After 25368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 22 ms.
Support contains 12 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 3869/3869 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1231 transition count 3866
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1228 transition count 3866
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 1228 transition count 3866
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 1225 transition count 3863
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 1225 transition count 3863
Applied a total of 15 rules in 229 ms. Remains 1225 /1231 variables (removed 6) and now considering 3863/3869 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 1225/1231 places, 3863/3869 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-23 22:11:49] [INFO ] Flow matrix only has 3465 transitions (discarded 398 similar events)
// Phase 1: matrix 3465 rows 1225 cols
[2023-03-23 22:11:49] [INFO ] Computed 131 place invariants in 32 ms
[2023-03-23 22:11:50] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 22:11:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 24 ms returned sat
[2023-03-23 22:11:50] [INFO ] [Nat]Absence check using 32 positive and 99 generalized place invariants in 16 ms returned sat
[2023-03-23 22:11:51] [INFO ] After 1323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 22:11:51] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-23 22:11:56] [INFO ] After 4575ms SMT Verify possible using 2143 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 22:11:57] [INFO ] Deduced a trap composed of 248 places in 654 ms of which 1 ms to minimize.
[2023-03-23 22:11:58] [INFO ] Deduced a trap composed of 143 places in 756 ms of which 1 ms to minimize.
[2023-03-23 22:11:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1683 ms
[2023-03-23 22:12:00] [INFO ] Deduced a trap composed of 109 places in 675 ms of which 2 ms to minimize.
[2023-03-23 22:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 916 ms
[2023-03-23 22:12:01] [INFO ] After 9936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2107 ms.
[2023-03-23 22:12:03] [INFO ] After 13737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 16 ms.
Support contains 10 out of 1225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1225/1225 places, 3863/3863 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1225 transition count 3897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1224 transition count 3897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1224 transition count 3897
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1223 transition count 3896
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1223 transition count 3896
Applied a total of 5 rules in 355 ms. Remains 1223 /1225 variables (removed 2) and now considering 3896/3863 (removed -33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 1223/1225 places, 3896/3863 transitions.
Successfully simplified 55 atomic propositions for a total of 16 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 22:12:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-23 22:12:04] [INFO ] Flatten gal took : 215 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 22:12:04] [INFO ] Flatten gal took : 218 ms
[2023-03-23 22:12:04] [INFO ] Input system was already deterministic with 3673 transitions.
Support contains 37 out of 1760 places (down from 50) after GAL structural reductions.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 928 stabilizing places and 2040 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 1760 transition count 3615
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 1702 transition count 3615
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 116 place count 1702 transition count 3531
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 284 place count 1618 transition count 3531
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 351 place count 1551 transition count 3444
Iterating global reduction 2 with 67 rules applied. Total rules applied 418 place count 1551 transition count 3444
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 470 place count 1499 transition count 3187
Iterating global reduction 2 with 52 rules applied. Total rules applied 522 place count 1499 transition count 3187
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 604 place count 1458 transition count 3146
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 646 place count 1416 transition count 3104
Iterating global reduction 2 with 42 rules applied. Total rules applied 688 place count 1416 transition count 3104
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 726 place count 1378 transition count 2876
Iterating global reduction 2 with 38 rules applied. Total rules applied 764 place count 1378 transition count 2876
Applied a total of 764 rules in 476 ms. Remains 1378 /1760 variables (removed 382) and now considering 2876/3673 (removed 797) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 476 ms. Remains : 1378/1760 places, 2876/3673 transitions.
[2023-03-23 22:12:05] [INFO ] Flatten gal took : 101 ms
[2023-03-23 22:12:05] [INFO ] Flatten gal took : 90 ms
[2023-03-23 22:12:05] [INFO ] Input system was already deterministic with 2876 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 112 place count 1648 transition count 3541
Iterating global reduction 0 with 112 rules applied. Total rules applied 224 place count 1648 transition count 3541
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 321 place count 1551 transition count 3239
Iterating global reduction 0 with 97 rules applied. Total rules applied 418 place count 1551 transition count 3239
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 465 place count 1504 transition count 2987
Iterating global reduction 0 with 47 rules applied. Total rules applied 512 place count 1504 transition count 2987
Applied a total of 512 rules in 185 ms. Remains 1504 /1760 variables (removed 256) and now considering 2987/3673 (removed 686) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 1504/1760 places, 2987/3673 transitions.
[2023-03-23 22:12:06] [INFO ] Flatten gal took : 118 ms
[2023-03-23 22:12:06] [INFO ] Flatten gal took : 101 ms
[2023-03-23 22:12:06] [INFO ] Input system was already deterministic with 2987 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 1760 transition count 3614
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 1701 transition count 3614
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 118 place count 1701 transition count 3530
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 286 place count 1617 transition count 3530
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 354 place count 1549 transition count 3442
Iterating global reduction 2 with 68 rules applied. Total rules applied 422 place count 1549 transition count 3442
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 475 place count 1496 transition count 3179
Iterating global reduction 2 with 53 rules applied. Total rules applied 528 place count 1496 transition count 3179
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 610 place count 1455 transition count 3138
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 653 place count 1412 transition count 3095
Iterating global reduction 2 with 43 rules applied. Total rules applied 696 place count 1412 transition count 3095
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 735 place count 1373 transition count 2861
Iterating global reduction 2 with 39 rules applied. Total rules applied 774 place count 1373 transition count 2861
Applied a total of 774 rules in 486 ms. Remains 1373 /1760 variables (removed 387) and now considering 2861/3673 (removed 812) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 499 ms. Remains : 1373/1760 places, 2861/3673 transitions.
[2023-03-23 22:12:07] [INFO ] Flatten gal took : 61 ms
[2023-03-23 22:12:07] [INFO ] Flatten gal took : 70 ms
[2023-03-23 22:12:07] [INFO ] Input system was already deterministic with 2861 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 111 place count 1649 transition count 3542
Iterating global reduction 0 with 111 rules applied. Total rules applied 222 place count 1649 transition count 3542
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 318 place count 1553 transition count 3241
Iterating global reduction 0 with 96 rules applied. Total rules applied 414 place count 1553 transition count 3241
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 460 place count 1507 transition count 2995
Iterating global reduction 0 with 46 rules applied. Total rules applied 506 place count 1507 transition count 2995
Applied a total of 506 rules in 216 ms. Remains 1507 /1760 variables (removed 253) and now considering 2995/3673 (removed 678) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 1507/1760 places, 2995/3673 transitions.
[2023-03-23 22:12:07] [INFO ] Flatten gal took : 96 ms
[2023-03-23 22:12:07] [INFO ] Flatten gal took : 76 ms
[2023-03-23 22:12:08] [INFO ] Input system was already deterministic with 2995 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 1760 transition count 3617
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 1704 transition count 3617
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 112 place count 1704 transition count 3533
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 280 place count 1620 transition count 3533
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 347 place count 1553 transition count 3446
Iterating global reduction 2 with 67 rules applied. Total rules applied 414 place count 1553 transition count 3446
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 466 place count 1501 transition count 3189
Iterating global reduction 2 with 52 rules applied. Total rules applied 518 place count 1501 transition count 3189
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 600 place count 1460 transition count 3148
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 640 place count 1420 transition count 3108
Iterating global reduction 2 with 40 rules applied. Total rules applied 680 place count 1420 transition count 3108
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 715 place count 1385 transition count 2898
Iterating global reduction 2 with 35 rules applied. Total rules applied 750 place count 1385 transition count 2898
Applied a total of 750 rules in 436 ms. Remains 1385 /1760 variables (removed 375) and now considering 2898/3673 (removed 775) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 437 ms. Remains : 1385/1760 places, 2898/3673 transitions.
[2023-03-23 22:12:08] [INFO ] Flatten gal took : 60 ms
[2023-03-23 22:12:08] [INFO ] Flatten gal took : 77 ms
[2023-03-23 22:12:08] [INFO ] Input system was already deterministic with 2898 transitions.
Incomplete random walk after 10000 steps, including 217 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 64606 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64606 steps, saw 28904 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 22:12:11] [INFO ] Flow matrix only has 2626 transitions (discarded 272 similar events)
// Phase 1: matrix 2626 rows 1385 cols
[2023-03-23 22:12:11] [INFO ] Computed 131 place invariants in 32 ms
[2023-03-23 22:12:12] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 22:12:12] [INFO ] [Nat]Absence check using 32 positive place invariants in 28 ms returned sat
[2023-03-23 22:12:12] [INFO ] [Nat]Absence check using 32 positive and 99 generalized place invariants in 17 ms returned sat
[2023-03-23 22:12:13] [INFO ] After 940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 22:12:13] [INFO ] State equation strengthened by 1018 read => feed constraints.
[2023-03-23 22:12:13] [INFO ] After 270ms SMT Verify possible using 1018 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 22:12:14] [INFO ] Deduced a trap composed of 267 places in 702 ms of which 1 ms to minimize.
[2023-03-23 22:12:15] [INFO ] Deduced a trap composed of 201 places in 674 ms of which 10 ms to minimize.
[2023-03-23 22:12:16] [INFO ] Deduced a trap composed of 287 places in 658 ms of which 2 ms to minimize.
[2023-03-23 22:12:16] [INFO ] Deduced a trap composed of 206 places in 690 ms of which 1 ms to minimize.
[2023-03-23 22:12:17] [INFO ] Deduced a trap composed of 171 places in 712 ms of which 2 ms to minimize.
[2023-03-23 22:12:18] [INFO ] Deduced a trap composed of 300 places in 682 ms of which 1 ms to minimize.
[2023-03-23 22:12:19] [INFO ] Deduced a trap composed of 169 places in 692 ms of which 2 ms to minimize.
[2023-03-23 22:12:20] [INFO ] Deduced a trap composed of 310 places in 671 ms of which 1 ms to minimize.
[2023-03-23 22:12:20] [INFO ] Deduced a trap composed of 193 places in 659 ms of which 2 ms to minimize.
[2023-03-23 22:12:21] [INFO ] Deduced a trap composed of 184 places in 664 ms of which 3 ms to minimize.
[2023-03-23 22:12:22] [INFO ] Deduced a trap composed of 209 places in 661 ms of which 2 ms to minimize.
[2023-03-23 22:12:23] [INFO ] Deduced a trap composed of 328 places in 656 ms of which 3 ms to minimize.
[2023-03-23 22:12:23] [INFO ] Deduced a trap composed of 234 places in 682 ms of which 13 ms to minimize.
[2023-03-23 22:12:24] [INFO ] Deduced a trap composed of 233 places in 695 ms of which 2 ms to minimize.
[2023-03-23 22:12:25] [INFO ] Deduced a trap composed of 177 places in 647 ms of which 2 ms to minimize.
[2023-03-23 22:12:26] [INFO ] Deduced a trap composed of 182 places in 677 ms of which 2 ms to minimize.
[2023-03-23 22:12:27] [INFO ] Deduced a trap composed of 189 places in 664 ms of which 1 ms to minimize.
[2023-03-23 22:12:28] [INFO ] Deduced a trap composed of 346 places in 677 ms of which 1 ms to minimize.
[2023-03-23 22:12:28] [INFO ] Deduced a trap composed of 176 places in 682 ms of which 1 ms to minimize.
[2023-03-23 22:12:29] [INFO ] Deduced a trap composed of 347 places in 661 ms of which 1 ms to minimize.
[2023-03-23 22:12:30] [INFO ] Deduced a trap composed of 199 places in 657 ms of which 1 ms to minimize.
[2023-03-23 22:12:31] [INFO ] Deduced a trap composed of 172 places in 665 ms of which 1 ms to minimize.
[2023-03-23 22:12:32] [INFO ] Deduced a trap composed of 206 places in 649 ms of which 1 ms to minimize.
[2023-03-23 22:12:32] [INFO ] Deduced a trap composed of 193 places in 656 ms of which 1 ms to minimize.
[2023-03-23 22:12:33] [INFO ] Deduced a trap composed of 194 places in 651 ms of which 2 ms to minimize.
[2023-03-23 22:12:34] [INFO ] Deduced a trap composed of 325 places in 672 ms of which 2 ms to minimize.
[2023-03-23 22:12:35] [INFO ] Deduced a trap composed of 158 places in 668 ms of which 1 ms to minimize.
[2023-03-23 22:12:35] [INFO ] Deduced a trap composed of 347 places in 659 ms of which 2 ms to minimize.
[2023-03-23 22:12:36] [INFO ] Deduced a trap composed of 309 places in 681 ms of which 1 ms to minimize.
[2023-03-23 22:12:37] [INFO ] Deduced a trap composed of 232 places in 685 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.Application.startNoEx(Application.java:669)
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 22:12:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:12:37] [INFO ] After 25248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 1385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1385/1385 places, 2898/2898 transitions.
Free-agglomeration rule (complex) applied 165 times.
Iterating global reduction 0 with 165 rules applied. Total rules applied 165 place count 1385 transition count 3858
Reduce places removed 165 places and 0 transitions.
Iterating post reduction 0 with 165 rules applied. Total rules applied 330 place count 1220 transition count 3858
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 1 with 80 rules applied. Total rules applied 410 place count 1220 transition count 3858
Applied a total of 410 rules in 305 ms. Remains 1220 /1385 variables (removed 165) and now considering 3858/2898 (removed -960) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 1220/1385 places, 3858/2898 transitions.
Finished random walk after 30200 steps, including 824 resets, run visited all 1 properties in 446 ms. (steps per millisecond=67 )
FORMULA MultiCrashLeafsetExtension-PT-S16C06-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 110 place count 1650 transition count 3543
Iterating global reduction 0 with 110 rules applied. Total rules applied 220 place count 1650 transition count 3543
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 316 place count 1554 transition count 3242
Iterating global reduction 0 with 96 rules applied. Total rules applied 412 place count 1554 transition count 3242
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 458 place count 1508 transition count 2996
Iterating global reduction 0 with 46 rules applied. Total rules applied 504 place count 1508 transition count 2996
Applied a total of 504 rules in 139 ms. Remains 1508 /1760 variables (removed 252) and now considering 2996/3673 (removed 677) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 1508/1760 places, 2996/3673 transitions.
[2023-03-23 22:12:38] [INFO ] Flatten gal took : 66 ms
[2023-03-23 22:12:38] [INFO ] Flatten gal took : 74 ms
[2023-03-23 22:12:38] [INFO ] Input system was already deterministic with 2996 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 109 place count 1651 transition count 3544
Iterating global reduction 0 with 109 rules applied. Total rules applied 218 place count 1651 transition count 3544
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 312 place count 1557 transition count 3255
Iterating global reduction 0 with 94 rules applied. Total rules applied 406 place count 1557 transition count 3255
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 452 place count 1511 transition count 3009
Iterating global reduction 0 with 46 rules applied. Total rules applied 498 place count 1511 transition count 3009
Applied a total of 498 rules in 140 ms. Remains 1511 /1760 variables (removed 249) and now considering 3009/3673 (removed 664) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 1511/1760 places, 3009/3673 transitions.
[2023-03-23 22:12:38] [INFO ] Flatten gal took : 63 ms
[2023-03-23 22:12:38] [INFO ] Flatten gal took : 71 ms
[2023-03-23 22:12:39] [INFO ] Input system was already deterministic with 3009 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 110 place count 1650 transition count 3543
Iterating global reduction 0 with 110 rules applied. Total rules applied 220 place count 1650 transition count 3543
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 315 place count 1555 transition count 3243
Iterating global reduction 0 with 95 rules applied. Total rules applied 410 place count 1555 transition count 3243
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 455 place count 1510 transition count 3003
Iterating global reduction 0 with 45 rules applied. Total rules applied 500 place count 1510 transition count 3003
Applied a total of 500 rules in 141 ms. Remains 1510 /1760 variables (removed 250) and now considering 3003/3673 (removed 670) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 1510/1760 places, 3003/3673 transitions.
[2023-03-23 22:12:39] [INFO ] Flatten gal took : 62 ms
[2023-03-23 22:12:39] [INFO ] Flatten gal took : 111 ms
[2023-03-23 22:12:39] [INFO ] Input system was already deterministic with 3003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Discarding 107 places :
Symmetric choice reduction at 0 with 107 rule applications. Total rules 107 place count 1653 transition count 3546
Iterating global reduction 0 with 107 rules applied. Total rules applied 214 place count 1653 transition count 3546
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 307 place count 1560 transition count 3258
Iterating global reduction 0 with 93 rules applied. Total rules applied 400 place count 1560 transition count 3258
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 444 place count 1516 transition count 3024
Iterating global reduction 0 with 44 rules applied. Total rules applied 488 place count 1516 transition count 3024
Applied a total of 488 rules in 141 ms. Remains 1516 /1760 variables (removed 244) and now considering 3024/3673 (removed 649) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 1516/1760 places, 3024/3673 transitions.
[2023-03-23 22:12:39] [INFO ] Flatten gal took : 64 ms
[2023-03-23 22:12:39] [INFO ] Flatten gal took : 72 ms
[2023-03-23 22:12:39] [INFO ] Input system was already deterministic with 3024 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1760/1760 places, 3673/3673 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 1760 transition count 3615
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 1702 transition count 3615
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 116 place count 1702 transition count 3532
Deduced a syphon composed of 83 places in 2 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 282 place count 1619 transition count 3532
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 349 place count 1552 transition count 3445
Iterating global reduction 2 with 67 rules applied. Total rules applied 416 place count 1552 transition count 3445
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 469 place count 1499 transition count 3182
Iterating global reduction 2 with 53 rules applied. Total rules applied 522 place count 1499 transition count 3182
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 604 place count 1458 transition count 3141
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 646 place count 1416 transition count 3099
Iterating global reduction 2 with 42 rules applied. Total rules applied 688 place count 1416 transition count 3099
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 726 place count 1378 transition count 2871
Iterating global reduction 2 with 38 rules applied. Total rules applied 764 place count 1378 transition count 2871
Applied a total of 764 rules in 317 ms. Remains 1378 /1760 variables (removed 382) and now considering 2871/3673 (removed 802) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 317 ms. Remains : 1378/1760 places, 2871/3673 transitions.
[2023-03-23 22:12:40] [INFO ] Flatten gal took : 54 ms
[2023-03-23 22:12:40] [INFO ] Flatten gal took : 62 ms
[2023-03-23 22:12:40] [INFO ] Input system was already deterministic with 2871 transitions.
[2023-03-23 22:12:40] [INFO ] Flatten gal took : 103 ms
[2023-03-23 22:12:40] [INFO ] Flatten gal took : 86 ms
[2023-03-23 22:12:40] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-23 22:12:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1760 places, 3673 transitions and 15765 arcs took 70 ms.
Total runtime 169635 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/762/ctl_0_ --ctl=/tmp/762/ctl_1_ --ctl=/tmp/762/ctl_2_ --ctl=/tmp/762/ctl_3_ --ctl=/tmp/762/ctl_4_ --ctl=/tmp/762/ctl_5_ --ctl=/tmp/762/ctl_6_ --ctl=/tmp/762/ctl_7_ --ctl=/tmp/762/ctl_8_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14840656 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16088672 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-S16C06"
export BK_EXAMINATION="CTLCardinality"
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-S16C06, examination is CTLCardinality"
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-167856419400777"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;