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.r234-tall-167856420800769.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 marciexred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800769
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M 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-S16C05-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679590594854

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 16:56:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 16:56:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:56:36] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2023-03-23 16:56:36] [INFO ] Transformed 4914 places.
[2023-03-23 16:56:36] [INFO ] Transformed 6913 transitions.
[2023-03-23 16:56:36] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 166 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 4885 transition count 6913
Discarding 1310 places :
Symmetric choice reduction at 1 with 1310 rule applications. Total rules 1339 place count 3575 transition count 5603
Iterating global reduction 1 with 1310 rules applied. Total rules applied 2649 place count 3575 transition count 5603
Discarding 1098 places :
Symmetric choice reduction at 1 with 1098 rule applications. Total rules 3747 place count 2477 transition count 4505
Iterating global reduction 1 with 1098 rules applied. Total rules applied 4845 place count 2477 transition count 4505
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 4993 place count 2329 transition count 3765
Iterating global reduction 1 with 148 rules applied. Total rules applied 5141 place count 2329 transition count 3765
Applied a total of 5141 rules in 1505 ms. Remains 2329 /4914 variables (removed 2585) and now considering 3765/6913 (removed 3148) transitions.
[2023-03-23 16:56:38] [INFO ] Flow matrix only has 3493 transitions (discarded 272 similar events)
// Phase 1: matrix 3493 rows 2329 cols
[2023-03-23 16:56:38] [INFO ] Computed 506 place invariants in 220 ms
[2023-03-23 16:56:41] [INFO ] Implicit Places using invariants in 3296 ms returned [4, 9, 13, 23, 28, 39, 48, 62, 78, 93, 127, 129, 131, 133, 135, 148, 159, 168, 178, 183, 186, 209, 216, 221, 224, 225, 230, 238, 247, 258, 269, 282, 296, 311, 313, 315, 328, 342, 349, 354, 360, 363, 386, 393, 398, 399, 400, 401, 403, 406, 411, 418, 430, 441, 453, 465, 467, 470, 482, 489, 494, 499, 501, 505, 530, 541, 549, 551, 556, 563, 570, 583, 593, 603, 605, 606, 609, 619, 624, 627, 629, 631, 633, 656, 663, 666, 667, 668, 671, 675, 677, 679, 682, 687, 694, 706, 714, 715, 718, 719, 724, 729, 734, 736, 742, 765, 772, 775, 777, 779, 780, 782, 787, 789, 791, 794, 799, 808, 814, 815, 818, 819, 822, 826, 833, 837, 839, 862, 869, 872, 873, 874, 875, 876, 877, 879, 881, 883, 885, 887, 894, 900, 901, 902, 903, 905, 907, 909, 914, 917, 919, 944, 951, 954, 956, 959, 964, 969, 972, 974, 976, 980, 982, 985, 986, 987, 991, 996, 1000, 1002, 1004, 1006, 1008, 1031, 1033, 1037, 1041, 1042, 1044, 1045, 1049, 1051, 1056, 1058, 1060, 1062, 1064, 1067, 1068, 1069, 1071, 1072, 1074, 1076, 1080, 1082, 1084, 1089, 1112, 1119, 1122, 1123, 1126, 1128, 1132, 1134, 1136, 1141, 1143, 1145, 1147, 1150, 1151, 1155, 1157, 1162, 1166, 1168, 1170, 1173, 1199, 1206, 1210, 1211, 1212, 1213, 1214, 1216, 1218, 1220, 1222, 1226, 1228, 1231, 1239, 1241, 1244, 1248, 1255, 1260, 1262, 1266, 1289, 1296, 1300, 1301, 1303, 1304, 1308, 1310, 1312, 1316, 1318, 1321, 1329, 1337, 1338, 1339, 1342, 1349, 1352, 1356, 1358, 1360, 1363, 1389, 1396, 1399, 1401, 1403, 1404, 1406, 1408, 1414, 1416, 1421, 1426, 1433, 1442, 1444, 1445, 1446, 1447, 1455, 1460, 1463, 1465, 1467, 1472, 1496, 1503, 1509, 1510, 1511, 1515, 1518, 1523, 1526, 1531, 1540, 1551, 1562, 1564, 1567, 1576, 1583, 1591, 1594, 1596, 1598, 1623, 1630, 1636, 1638, 1643, 1646, 1651, 1656, 1663, 1675, 1686, 1699, 1700, 1701, 1703, 1704, 1715, 1725, 1734, 1739, 1742, 1744, 1767, 1774, 1778, 1779, 1780, 1781, 1782, 1785, 1788, 1793, 1800, 1809, 1821, 1837, 1852, 1854, 1855, 1857, 1870, 1881, 1890, 1897, 1905, 1908, 1933, 1935, 1939, 1945, 1946, 1947, 1950, 1958, 1967, 1979, 1990, 2003, 2018, 2035, 2036, 2037, 2038, 2040, 2055, 2068, 2081, 2090, 2099, 2104, 2128]
Discarding 381 places :
Implicit Place search using SMT only with invariants took 3336 ms to find 381 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1948/4914 places, 3765/6913 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 1866 transition count 3683
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 1866 transition count 3683
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 243 place count 1787 transition count 3604
Iterating global reduction 0 with 79 rules applied. Total rules applied 322 place count 1787 transition count 3604
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 395 place count 1714 transition count 3531
Iterating global reduction 0 with 73 rules applied. Total rules applied 468 place count 1714 transition count 3531
Applied a total of 468 rules in 176 ms. Remains 1714 /1948 variables (removed 234) and now considering 3531/3765 (removed 234) transitions.
[2023-03-23 16:56:41] [INFO ] Flow matrix only has 3259 transitions (discarded 272 similar events)
// Phase 1: matrix 3259 rows 1714 cols
[2023-03-23 16:56:41] [INFO ] Computed 125 place invariants in 60 ms
[2023-03-23 16:56:43] [INFO ] Implicit Places using invariants in 1437 ms returned []
[2023-03-23 16:56:43] [INFO ] Flow matrix only has 3259 transitions (discarded 272 similar events)
[2023-03-23 16:56:43] [INFO ] Invariant cache hit.
[2023-03-23 16:56:44] [INFO ] State equation strengthened by 1314 read => feed constraints.
[2023-03-23 16:57:07] [INFO ] Implicit Places using invariants and state equation in 23829 ms returned []
Implicit Place search using SMT with State Equation took 25276 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1714/4914 places, 3531/6913 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30297 ms. Remains : 1714/4914 places, 3531/6913 transitions.
Support contains 166 out of 1714 places after structural reductions.
[2023-03-23 16:57:07] [INFO ] Flatten gal took : 267 ms
[2023-03-23 16:57:07] [INFO ] Flatten gal took : 137 ms
[2023-03-23 16:57:07] [INFO ] Input system was already deterministic with 3531 transitions.
Support contains 157 out of 1714 places (down from 166) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 93) seen :23
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 70) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 69) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :1
Running SMT prover for 67 properties.
[2023-03-23 16:57:09] [INFO ] Flow matrix only has 3259 transitions (discarded 272 similar events)
[2023-03-23 16:57:09] [INFO ] Invariant cache hit.
[2023-03-23 16:57:11] [INFO ] [Real]Absence check using 32 positive place invariants in 33 ms returned sat
[2023-03-23 16:57:11] [INFO ] [Real]Absence check using 32 positive and 93 generalized place invariants in 27 ms returned sat
[2023-03-23 16:57:11] [INFO ] After 2230ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:64
[2023-03-23 16:57:13] [INFO ] [Nat]Absence check using 32 positive place invariants in 92 ms returned sat
[2023-03-23 16:57:13] [INFO ] [Nat]Absence check using 32 positive and 93 generalized place invariants in 32 ms returned sat
[2023-03-23 16:57:16] [INFO ] After 2774ms SMT Verify possible using state equation in natural domain returned unsat :55 sat :12
[2023-03-23 16:57:16] [INFO ] State equation strengthened by 1314 read => feed constraints.
[2023-03-23 16:57:21] [INFO ] After 4532ms SMT Verify possible using 1314 Read/Feed constraints in natural domain returned unsat :56 sat :11
[2023-03-23 16:57:22] [INFO ] Deduced a trap composed of 409 places in 923 ms of which 12 ms to minimize.
[2023-03-23 16:57:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1116 ms
[2023-03-23 16:57:23] [INFO ] Deduced a trap composed of 250 places in 949 ms of which 2 ms to minimize.
[2023-03-23 16:57:24] [INFO ] Deduced a trap composed of 278 places in 876 ms of which 2 ms to minimize.
[2023-03-23 16:57:26] [INFO ] Deduced a trap composed of 327 places in 811 ms of which 3 ms to minimize.
[2023-03-23 16:57:26] [INFO ] Deduced a trap composed of 274 places in 852 ms of which 2 ms to minimize.
[2023-03-23 16:57:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4167 ms
[2023-03-23 16:57:28] [INFO ] Deduced a trap composed of 376 places in 872 ms of which 2 ms to minimize.
[2023-03-23 16:57:30] [INFO ] Deduced a trap composed of 321 places in 856 ms of which 2 ms to minimize.
[2023-03-23 16:57:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2171 ms
[2023-03-23 16:57:32] [INFO ] Deduced a trap composed of 477 places in 867 ms of which 2 ms to minimize.
[2023-03-23 16:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1044 ms
[2023-03-23 16:57:33] [INFO ] Deduced a trap composed of 425 places in 906 ms of which 2 ms to minimize.
[2023-03-23 16:57:34] [INFO ] Deduced a trap composed of 409 places in 903 ms of which 2 ms to minimize.
[2023-03-23 16:57:35] [INFO ] Deduced a trap composed of 417 places in 874 ms of which 2 ms to minimize.
[2023-03-23 16:57:37] [INFO ] Deduced a trap composed of 414 places in 884 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 16:57:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 16:57:37] [INFO ] After 25670ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:64
Fused 67 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 23 out of 1714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Graph (complete) has 7248 edges and 1714 vertex of which 1713 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 1713 transition count 3489
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 1671 transition count 3489
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 85 place count 1671 transition count 3413
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 237 place count 1595 transition count 3413
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 304 place count 1528 transition count 3314
Iterating global reduction 2 with 67 rules applied. Total rules applied 371 place count 1528 transition count 3314
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 413 place count 1486 transition count 3116
Iterating global reduction 2 with 42 rules applied. Total rules applied 455 place count 1486 transition count 3116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 529 place count 1449 transition count 3079
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 559 place count 1419 transition count 3049
Iterating global reduction 2 with 30 rules applied. Total rules applied 589 place count 1419 transition count 3049
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 617 place count 1391 transition count 2909
Iterating global reduction 2 with 28 rules applied. Total rules applied 645 place count 1391 transition count 2909
Free-agglomeration rule (complex) applied 166 times.
Iterating global reduction 2 with 166 rules applied. Total rules applied 811 place count 1391 transition count 3635
Reduce places removed 166 places and 0 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 977 place count 1225 transition count 3635
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 1052 place count 1225 transition count 3635
Applied a total of 1052 rules in 1133 ms. Remains 1225 /1714 variables (removed 489) and now considering 3635/3531 (removed -104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1134 ms. Remains : 1225/1714 places, 3635/3531 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-23 16:57:39] [INFO ] Flow matrix only has 3247 transitions (discarded 388 similar events)
// Phase 1: matrix 3247 rows 1225 cols
[2023-03-23 16:57:39] [INFO ] Computed 124 place invariants in 41 ms
[2023-03-23 16:57:39] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 16:57:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 22 ms returned sat
[2023-03-23 16:57:40] [INFO ] [Nat]Absence check using 32 positive and 92 generalized place invariants in 17 ms returned sat
[2023-03-23 16:57:42] [INFO ] After 2137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 16:57:42] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 16:57:46] [INFO ] After 3980ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 16:57:47] [INFO ] Deduced a trap composed of 198 places in 587 ms of which 2 ms to minimize.
[2023-03-23 16:57:48] [INFO ] Deduced a trap composed of 198 places in 541 ms of which 1 ms to minimize.
[2023-03-23 16:57:48] [INFO ] Deduced a trap composed of 206 places in 579 ms of which 1 ms to minimize.
[2023-03-23 16:57:49] [INFO ] Deduced a trap composed of 205 places in 589 ms of which 1 ms to minimize.
[2023-03-23 16:57:50] [INFO ] Deduced a trap composed of 215 places in 588 ms of which 2 ms to minimize.
[2023-03-23 16:57:51] [INFO ] Deduced a trap composed of 147 places in 597 ms of which 1 ms to minimize.
[2023-03-23 16:57:51] [INFO ] Deduced a trap composed of 216 places in 566 ms of which 1 ms to minimize.
[2023-03-23 16:57:52] [INFO ] Deduced a trap composed of 215 places in 561 ms of which 1 ms to minimize.
[2023-03-23 16:57:53] [INFO ] Deduced a trap composed of 216 places in 563 ms of which 1 ms to minimize.
[2023-03-23 16:57:54] [INFO ] Deduced a trap composed of 207 places in 569 ms of which 2 ms to minimize.
[2023-03-23 16:57:54] [INFO ] Deduced a trap composed of 214 places in 570 ms of which 1 ms to minimize.
[2023-03-23 16:57:55] [INFO ] Deduced a trap composed of 192 places in 557 ms of which 1 ms to minimize.
[2023-03-23 16:57:56] [INFO ] Deduced a trap composed of 158 places in 590 ms of which 1 ms to minimize.
[2023-03-23 16:57:56] [INFO ] Deduced a trap composed of 221 places in 562 ms of which 2 ms to minimize.
[2023-03-23 16:57:57] [INFO ] Deduced a trap composed of 226 places in 551 ms of which 1 ms to minimize.
[2023-03-23 16:57:58] [INFO ] Deduced a trap composed of 199 places in 567 ms of which 1 ms to minimize.
[2023-03-23 16:57:59] [INFO ] Deduced a trap composed of 198 places in 542 ms of which 1 ms to minimize.
[2023-03-23 16:57:59] [INFO ] Deduced a trap composed of 207 places in 557 ms of which 2 ms to minimize.
[2023-03-23 16:58:00] [INFO ] Deduced a trap composed of 201 places in 557 ms of which 1 ms to minimize.
[2023-03-23 16:58:00] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 13680 ms
[2023-03-23 16:58:01] [INFO ] Deduced a trap composed of 246 places in 552 ms of which 1 ms to minimize.
[2023-03-23 16:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 994 ms
[2023-03-23 16:58:03] [INFO ] Deduced a trap composed of 227 places in 572 ms of which 1 ms to minimize.
[2023-03-23 16:58:04] [INFO ] Deduced a trap composed of 231 places in 549 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 16:58:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 16:58:04] [INFO ] After 25121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 12 ms.
Support contains 19 out of 1225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1225/1225 places, 3635/3635 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1225 transition count 3633
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1223 transition count 3633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1222 transition count 3632
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1222 transition count 3632
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1222 transition count 3632
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1220 transition count 3630
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1220 transition count 3630
Applied a total of 12 rules in 262 ms. Remains 1220 /1225 variables (removed 5) and now considering 3630/3635 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 1220/1225 places, 3630/3635 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 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 39 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 57962 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{7=1}
Probabilistic random walk after 57962 steps, saw 25163 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :1
Running SMT prover for 8 properties.
[2023-03-23 16:58:09] [INFO ] Flow matrix only has 3242 transitions (discarded 388 similar events)
// Phase 1: matrix 3242 rows 1220 cols
[2023-03-23 16:58:09] [INFO ] Computed 124 place invariants in 40 ms
[2023-03-23 16:58:09] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 16:58:09] [INFO ] [Nat]Absence check using 32 positive place invariants in 22 ms returned sat
[2023-03-23 16:58:09] [INFO ] [Nat]Absence check using 32 positive and 92 generalized place invariants in 22 ms returned sat
[2023-03-23 16:58:12] [INFO ] After 2253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 16:58:12] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 16:58:15] [INFO ] After 3821ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 16:58:16] [INFO ] Deduced a trap composed of 213 places in 568 ms of which 5 ms to minimize.
[2023-03-23 16:58:17] [INFO ] Deduced a trap composed of 139 places in 562 ms of which 1 ms to minimize.
[2023-03-23 16:58:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1927 ms
[2023-03-23 16:58:19] [INFO ] Deduced a trap composed of 185 places in 573 ms of which 1 ms to minimize.
[2023-03-23 16:58:19] [INFO ] Deduced a trap composed of 197 places in 588 ms of which 1 ms to minimize.
[2023-03-23 16:58:20] [INFO ] Deduced a trap composed of 151 places in 565 ms of which 2 ms to minimize.
[2023-03-23 16:58:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2250 ms
[2023-03-23 16:58:21] [INFO ] Deduced a trap composed of 131 places in 578 ms of which 2 ms to minimize.
[2023-03-23 16:58:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 854 ms
[2023-03-23 16:58:24] [INFO ] Deduced a trap composed of 214 places in 570 ms of which 2 ms to minimize.
[2023-03-23 16:58:24] [INFO ] Deduced a trap composed of 187 places in 555 ms of which 1 ms to minimize.
[2023-03-23 16:58:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1532 ms
[2023-03-23 16:58:26] [INFO ] Deduced a trap composed of 178 places in 591 ms of which 1 ms to minimize.
[2023-03-23 16:58:26] [INFO ] Deduced a trap composed of 132 places in 677 ms of which 1 ms to minimize.
[2023-03-23 16:58:27] [INFO ] Deduced a trap composed of 140 places in 682 ms of which 1 ms to minimize.
[2023-03-23 16:58:28] [INFO ] Deduced a trap composed of 135 places in 671 ms of which 1 ms to minimize.
[2023-03-23 16:58:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3054 ms
[2023-03-23 16:58:29] [INFO ] After 17230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3484 ms.
[2023-03-23 16:58:32] [INFO ] After 23420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 7 ms.
Support contains 17 out of 1220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1220/1220 places, 3630/3630 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1220 transition count 3629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1219 transition count 3629
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1218 transition count 3628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1217 transition count 3627
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1217 transition count 3627
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1217 transition count 3627
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 1216 transition count 3626
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 1216 transition count 3626
Applied a total of 9 rules in 287 ms. Remains 1216 /1220 variables (removed 4) and now considering 3626/3630 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 1216/1220 places, 3626/3630 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 60302 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60302 steps, saw 26187 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-23 16:58:36] [INFO ] Flow matrix only has 3238 transitions (discarded 388 similar events)
// Phase 1: matrix 3238 rows 1216 cols
[2023-03-23 16:58:36] [INFO ] Computed 124 place invariants in 29 ms
[2023-03-23 16:58:37] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 16:58:37] [INFO ] [Nat]Absence check using 32 positive place invariants in 23 ms returned sat
[2023-03-23 16:58:37] [INFO ] [Nat]Absence check using 32 positive and 92 generalized place invariants in 23 ms returned sat
[2023-03-23 16:58:39] [INFO ] After 1991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 16:58:39] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 16:58:44] [INFO ] After 4548ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 16:58:45] [INFO ] Deduced a trap composed of 200 places in 555 ms of which 1 ms to minimize.
[2023-03-23 16:58:46] [INFO ] Deduced a trap composed of 228 places in 535 ms of which 1 ms to minimize.
[2023-03-23 16:58:47] [INFO ] Deduced a trap composed of 224 places in 554 ms of which 1 ms to minimize.
[2023-03-23 16:58:47] [INFO ] Deduced a trap composed of 218 places in 583 ms of which 3 ms to minimize.
[2023-03-23 16:58:48] [INFO ] Deduced a trap composed of 230 places in 554 ms of which 1 ms to minimize.
[2023-03-23 16:58:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4136 ms
[2023-03-23 16:58:51] [INFO ] Deduced a trap composed of 146 places in 567 ms of which 1 ms to minimize.
[2023-03-23 16:58:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 897 ms
[2023-03-23 16:58:52] [INFO ] Deduced a trap composed of 155 places in 589 ms of which 1 ms to minimize.
[2023-03-23 16:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 944 ms
[2023-03-23 16:58:54] [INFO ] Deduced a trap composed of 157 places in 567 ms of which 1 ms to minimize.
[2023-03-23 16:58:55] [INFO ] Deduced a trap composed of 152 places in 665 ms of which 1 ms to minimize.
[2023-03-23 16:58:56] [INFO ] Deduced a trap composed of 158 places in 688 ms of which 4 ms to minimize.
[2023-03-23 16:58:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2242 ms
[2023-03-23 16:58:57] [INFO ] Deduced a trap composed of 139 places in 661 ms of which 1 ms to minimize.
[2023-03-23 16:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 819 ms
[2023-03-23 16:58:57] [INFO ] After 18220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3440 ms.
[2023-03-23 16:59:01] [INFO ] After 24089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 8 ms.
Support contains 17 out of 1216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1216/1216 places, 3626/3626 transitions.
Applied a total of 0 rules in 92 ms. Remains 1216 /1216 variables (removed 0) and now considering 3626/3626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1216/1216 places, 3626/3626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1216/1216 places, 3626/3626 transitions.
Applied a total of 0 rules in 87 ms. Remains 1216 /1216 variables (removed 0) and now considering 3626/3626 (removed 0) transitions.
[2023-03-23 16:59:01] [INFO ] Flow matrix only has 3238 transitions (discarded 388 similar events)
[2023-03-23 16:59:01] [INFO ] Invariant cache hit.
[2023-03-23 16:59:02] [INFO ] Implicit Places using invariants in 1256 ms returned [7, 8, 9, 10, 74, 88, 144, 145, 207, 208, 254, 255, 302, 303, 304, 338, 340, 342, 343, 344, 380, 381, 408, 436, 437, 442, 460, 461, 477, 478, 482, 504, 508, 509, 526, 527, 538, 539, 557, 558, 588, 589, 598, 599, 600, 620, 630, 631, 632, 633, 653, 654, 668, 669, 691, 692, 713, 737, 738, 770, 771, 772, 805, 806, 807, 848, 888, 940, 988, 989, 990]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 1260 ms to find 71 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1145/1216 places, 3626/3626 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1090 transition count 3571
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1090 transition count 3571
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 165 place count 1035 transition count 3516
Iterating global reduction 0 with 55 rules applied. Total rules applied 220 place count 1035 transition count 3516
Applied a total of 220 rules in 141 ms. Remains 1035 /1145 variables (removed 110) and now considering 3516/3626 (removed 110) transitions.
[2023-03-23 16:59:02] [INFO ] Flow matrix only has 3128 transitions (discarded 388 similar events)
// Phase 1: matrix 3128 rows 1035 cols
[2023-03-23 16:59:02] [INFO ] Computed 53 place invariants in 29 ms
[2023-03-23 16:59:03] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2023-03-23 16:59:03] [INFO ] Flow matrix only has 3128 transitions (discarded 388 similar events)
[2023-03-23 16:59:03] [INFO ] Invariant cache hit.
[2023-03-23 16:59:04] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 16:59:23] [INFO ] Implicit Places using invariants and state equation in 19408 ms returned []
Implicit Place search using SMT with State Equation took 20451 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1035/1216 places, 3516/3626 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21941 ms. Remains : 1035/1216 places, 3516/3626 transitions.
Successfully simplified 56 atomic propositions for a total of 16 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 16:59:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-23 16:59:23] [INFO ] Flatten gal took : 96 ms
[2023-03-23 16:59:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 16:59:23] [INFO ] Flatten gal took : 103 ms
[2023-03-23 16:59:23] [INFO ] Input system was already deterministic with 3531 transitions.
Support contains 38 out of 1714 places (down from 58) after GAL structural reductions.
Computed a total of 882 stabilizing places and 1898 stable transitions
Graph (complete) has 10567 edges and 1714 vertex of which 1713 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Starting structural reductions in LTL mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1713 transition count 3531
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 109 place count 1605 transition count 3391
Iterating global reduction 1 with 108 rules applied. Total rules applied 217 place count 1605 transition count 3391
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 302 place count 1520 transition count 3142
Iterating global reduction 1 with 85 rules applied. Total rules applied 387 place count 1520 transition count 3142
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 426 place count 1481 transition count 2959
Iterating global reduction 1 with 39 rules applied. Total rules applied 465 place count 1481 transition count 2959
Applied a total of 465 rules in 182 ms. Remains 1481 /1714 variables (removed 233) and now considering 2959/3531 (removed 572) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 1481/1714 places, 2959/3531 transitions.
[2023-03-23 16:59:23] [INFO ] Flatten gal took : 73 ms
[2023-03-23 16:59:23] [INFO ] Flatten gal took : 84 ms
[2023-03-23 16:59:24] [INFO ] Input system was already deterministic with 2959 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1713 transition count 3531
Discarding 113 places :
Symmetric choice reduction at 1 with 113 rule applications. Total rules 114 place count 1600 transition count 3378
Iterating global reduction 1 with 113 rules applied. Total rules applied 227 place count 1600 transition count 3378
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 314 place count 1513 transition count 3127
Iterating global reduction 1 with 87 rules applied. Total rules applied 401 place count 1513 transition count 3127
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 442 place count 1472 transition count 2934
Iterating global reduction 1 with 41 rules applied. Total rules applied 483 place count 1472 transition count 2934
Applied a total of 483 rules in 183 ms. Remains 1472 /1714 variables (removed 242) and now considering 2934/3531 (removed 597) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 1472/1714 places, 2934/3531 transitions.
[2023-03-23 16:59:24] [INFO ] Flatten gal took : 67 ms
[2023-03-23 16:59:24] [INFO ] Flatten gal took : 73 ms
[2023-03-23 16:59:24] [INFO ] Input system was already deterministic with 2934 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1713 transition count 3531
Discarding 110 places :
Symmetric choice reduction at 1 with 110 rule applications. Total rules 111 place count 1603 transition count 3381
Iterating global reduction 1 with 110 rules applied. Total rules applied 221 place count 1603 transition count 3381
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 305 place count 1519 transition count 3133
Iterating global reduction 1 with 84 rules applied. Total rules applied 389 place count 1519 transition count 3133
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 428 place count 1480 transition count 2950
Iterating global reduction 1 with 39 rules applied. Total rules applied 467 place count 1480 transition count 2950
Applied a total of 467 rules in 194 ms. Remains 1480 /1714 variables (removed 234) and now considering 2950/3531 (removed 581) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 1480/1714 places, 2950/3531 transitions.
[2023-03-23 16:59:24] [INFO ] Flatten gal took : 64 ms
[2023-03-23 16:59:24] [INFO ] Flatten gal took : 68 ms
[2023-03-23 16:59:25] [INFO ] Input system was already deterministic with 2950 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Graph (complete) has 10567 edges and 1714 vertex of which 1713 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 1713 transition count 3482
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 1664 transition count 3482
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 99 place count 1664 transition count 3405
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 253 place count 1587 transition count 3405
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 330 place count 1510 transition count 3288
Iterating global reduction 2 with 77 rules applied. Total rules applied 407 place count 1510 transition count 3288
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 457 place count 1460 transition count 3062
Iterating global reduction 2 with 50 rules applied. Total rules applied 507 place count 1460 transition count 3062
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 581 place count 1423 transition count 3025
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 616 place count 1388 transition count 2990
Iterating global reduction 2 with 35 rules applied. Total rules applied 651 place count 1388 transition count 2990
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 685 place count 1354 transition count 2820
Iterating global reduction 2 with 34 rules applied. Total rules applied 719 place count 1354 transition count 2820
Applied a total of 719 rules in 493 ms. Remains 1354 /1714 variables (removed 360) and now considering 2820/3531 (removed 711) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 495 ms. Remains : 1354/1714 places, 2820/3531 transitions.
[2023-03-23 16:59:25] [INFO ] Flatten gal took : 53 ms
[2023-03-23 16:59:25] [INFO ] Flatten gal took : 59 ms
[2023-03-23 16:59:25] [INFO ] Input system was already deterministic with 2820 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1713 transition count 3531
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 108 place count 1606 transition count 3388
Iterating global reduction 1 with 107 rules applied. Total rules applied 215 place count 1606 transition count 3388
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 298 place count 1523 transition count 3137
Iterating global reduction 1 with 83 rules applied. Total rules applied 381 place count 1523 transition count 3137
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 417 place count 1487 transition count 2969
Iterating global reduction 1 with 36 rules applied. Total rules applied 453 place count 1487 transition count 2969
Applied a total of 453 rules in 183 ms. Remains 1487 /1714 variables (removed 227) and now considering 2969/3531 (removed 562) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 1487/1714 places, 2969/3531 transitions.
[2023-03-23 16:59:26] [INFO ] Flatten gal took : 62 ms
[2023-03-23 16:59:26] [INFO ] Flatten gal took : 67 ms
[2023-03-23 16:59:26] [INFO ] Input system was already deterministic with 2969 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1713 transition count 3531
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 108 place count 1606 transition count 3384
Iterating global reduction 1 with 107 rules applied. Total rules applied 215 place count 1606 transition count 3384
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 297 place count 1524 transition count 3146
Iterating global reduction 1 with 82 rules applied. Total rules applied 379 place count 1524 transition count 3146
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 417 place count 1486 transition count 2964
Iterating global reduction 1 with 38 rules applied. Total rules applied 455 place count 1486 transition count 2964
Applied a total of 455 rules in 181 ms. Remains 1486 /1714 variables (removed 228) and now considering 2964/3531 (removed 567) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 1486/1714 places, 2964/3531 transitions.
[2023-03-23 16:59:26] [INFO ] Flatten gal took : 61 ms
[2023-03-23 16:59:26] [INFO ] Flatten gal took : 68 ms
[2023-03-23 16:59:26] [INFO ] Input system was already deterministic with 2964 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1714/1714 places, 3531/3531 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1713 transition count 3531
Discarding 110 places :
Symmetric choice reduction at 1 with 110 rule applications. Total rules 111 place count 1603 transition count 3389
Iterating global reduction 1 with 110 rules applied. Total rules applied 221 place count 1603 transition count 3389
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 307 place count 1517 transition count 3139
Iterating global reduction 1 with 86 rules applied. Total rules applied 393 place count 1517 transition count 3139
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 432 place count 1478 transition count 2956
Iterating global reduction 1 with 39 rules applied. Total rules applied 471 place count 1478 transition count 2956
Applied a total of 471 rules in 181 ms. Remains 1478 /1714 variables (removed 236) and now considering 2956/3531 (removed 575) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 1478/1714 places, 2956/3531 transitions.
[2023-03-23 16:59:27] [INFO ] Flatten gal took : 60 ms
[2023-03-23 16:59:27] [INFO ] Flatten gal took : 65 ms
[2023-03-23 16:59:27] [INFO ] Input system was already deterministic with 2956 transitions.
[2023-03-23 16:59:27] [INFO ] Flatten gal took : 77 ms
[2023-03-23 16:59:27] [INFO ] Flatten gal took : 81 ms
[2023-03-23 16:59:27] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-23 16:59:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1714 places, 3531 transitions and 15215 arcs took 22 ms.
Total runtime 171204 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 1714 NrTr: 3531 NrArc: 15215)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.540sec

net check time: 0m 0.002sec

init dd package: 0m 2.700sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10053924 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16093248 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.067sec

22027 47504 75768 90368 93041 104038 119574 141917 169258 186797 189761 246438 340761 440995 534798 567892 600953 641002 698153

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-S16C05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r234-tall-167856420800769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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