About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6121.428 | 3600000.00 | 3663276.00 | 9393.40 | ??T???????????FF | normal |
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-167856420800770.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800770
=====================================================================
--------------------
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-CTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679590849978
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=CTLFireability
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 17:00:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 17:00:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 17:00:51] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2023-03-23 17:00:51] [INFO ] Transformed 4914 places.
[2023-03-23 17:00:51] [INFO ] Transformed 6913 transitions.
[2023-03-23 17:00:51] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 159 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1329 places :
Symmetric choice reduction at 1 with 1329 rule applications. Total rules 1359 place count 3555 transition count 5584
Iterating global reduction 1 with 1329 rules applied. Total rules applied 2688 place count 3555 transition count 5584
Discarding 1157 places :
Symmetric choice reduction at 1 with 1157 rule applications. Total rules 3845 place count 2398 transition count 4427
Iterating global reduction 1 with 1157 rules applied. Total rules applied 5002 place count 2398 transition count 4427
Discarding 189 places :
Symmetric choice reduction at 1 with 189 rule applications. Total rules 5191 place count 2209 transition count 3482
Iterating global reduction 1 with 189 rules applied. Total rules applied 5380 place count 2209 transition count 3482
Applied a total of 5380 rules in 878 ms. Remains 2209 /4914 variables (removed 2705) and now considering 3482/6913 (removed 3431) transitions.
[2023-03-23 17:00:52] [INFO ] Flow matrix only has 3210 transitions (discarded 272 similar events)
// Phase 1: matrix 3210 rows 2209 cols
[2023-03-23 17:00:53] [INFO ] Computed 505 place invariants in 162 ms
[2023-03-23 17:00:55] [INFO ] Implicit Places using invariants in 2361 ms returned [4, 8, 12, 16, 20, 22, 29, 36, 45, 56, 69, 84, 102, 118, 120, 122, 124, 128, 141, 152, 164, 171, 177, 180, 203, 210, 213, 214, 215, 216, 217, 218, 221, 226, 233, 242, 253, 280, 294, 295, 296, 297, 298, 299, 311, 320, 328, 333, 336, 338, 361, 368, 371, 372, 373, 374, 375, 376, 378, 381, 386, 393, 402, 413, 425, 437, 439, 440, 441, 442, 453, 460, 465, 468, 470, 472, 495, 502, 505, 506, 508, 509, 510, 512, 514, 518, 525, 532, 541, 551, 561, 564, 565, 566, 576, 582, 586, 588, 590, 593, 623, 626, 627, 628, 629, 631, 636, 638, 642, 645, 650, 657, 665, 673, 674, 675, 678, 683, 689, 691, 693, 695, 700, 723, 730, 734, 735, 736, 737, 738, 742, 744, 746, 748, 751, 756, 762, 768, 770, 771, 773, 776, 778, 783, 785, 787, 791, 814, 821, 824, 825, 826, 827, 829, 834, 836, 838, 840, 842, 845, 849, 854, 855, 856, 857, 858, 861, 863, 865, 867, 870, 875, 901, 908, 911, 912, 913, 914, 915, 916, 918, 922, 924, 927, 929, 931, 934, 935, 937, 938, 939, 941, 943, 948, 950, 952, 954, 977, 979, 983, 986, 987, 988, 989, 990, 991, 993, 995, 997, 999, 1001, 1003, 1005, 1008, 1009, 1010, 1011, 1013, 1015, 1017, 1019, 1021, 1023, 1025, 1058, 1061, 1063, 1065, 1066, 1071, 1073, 1077, 1079, 1081, 1083, 1085, 1088, 1089, 1092, 1093, 1095, 1102, 1104, 1106, 1108, 1110, 1133, 1140, 1143, 1144, 1145, 1146, 1147, 1148, 1150, 1152, 1154, 1156, 1158, 1160, 1163, 1169, 1170, 1171, 1173, 1177, 1179, 1182, 1187, 1189, 1191, 1223, 1226, 1227, 1229, 1230, 1231, 1233, 1235, 1237, 1239, 1241, 1244, 1251, 1258, 1259, 1260, 1262, 1263, 1270, 1273, 1275, 1278, 1280, 1282, 1312, 1315, 1316, 1317, 1318, 1319, 1320, 1322, 1324, 1326, 1328, 1331, 1336, 1352, 1353, 1355, 1356, 1357, 1364, 1369, 1372, 1374, 1376, 1378, 1404, 1411, 1414, 1416, 1417, 1418, 1419, 1421, 1423, 1425, 1431, 1436, 1443, 1452, 1463, 1467, 1468, 1477, 1489, 1492, 1496, 1501, 1527, 1534, 1537, 1538, 1540, 1541, 1542, 1544, 1546, 1549, 1554, 1561, 1570, 1584, 1597, 1598, 1599, 1600, 1601, 1602, 1614, 1623, 1631, 1636, 1639, 1641, 1664, 1671, 1674, 1675, 1676, 1677, 1678, 1679, 1681, 1684, 1689, 1696, 1705, 1716, 1729, 1744, 1745, 1746, 1747, 1748, 1749, 1762, 1773, 1782, 1789, 1794, 1797, 1820, 1822, 1826, 1829, 1830, 1831, 1832, 1833, 1834, 1837, 1842, 1849, 1859, 1870, 1884, 1899, 1916, 1917, 1918, 1920, 1921, 1939, 1952, 1963, 1972, 1979, 1984, 2008]
Discarding 422 places :
Implicit Place search using SMT only with invariants took 2399 ms to find 422 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1787/4914 places, 3482/6913 transitions.
Discarding 129 places :
Symmetric choice reduction at 0 with 129 rule applications. Total rules 129 place count 1658 transition count 3353
Iterating global reduction 0 with 129 rules applied. Total rules applied 258 place count 1658 transition count 3353
Discarding 126 places :
Symmetric choice reduction at 0 with 126 rule applications. Total rules 384 place count 1532 transition count 3227
Iterating global reduction 0 with 126 rules applied. Total rules applied 510 place count 1532 transition count 3227
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 632 place count 1410 transition count 3105
Iterating global reduction 0 with 122 rules applied. Total rules applied 754 place count 1410 transition count 3105
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 760 place count 1404 transition count 3075
Iterating global reduction 0 with 6 rules applied. Total rules applied 766 place count 1404 transition count 3075
Applied a total of 766 rules in 423 ms. Remains 1404 /1787 variables (removed 383) and now considering 3075/3482 (removed 407) transitions.
[2023-03-23 17:00:55] [INFO ] Flow matrix only has 2803 transitions (discarded 272 similar events)
// Phase 1: matrix 2803 rows 1404 cols
[2023-03-23 17:00:55] [INFO ] Computed 83 place invariants in 32 ms
[2023-03-23 17:00:56] [INFO ] Implicit Places using invariants in 987 ms returned []
[2023-03-23 17:00:56] [INFO ] Flow matrix only has 2803 transitions (discarded 272 similar events)
[2023-03-23 17:00:56] [INFO ] Invariant cache hit.
[2023-03-23 17:00:57] [INFO ] State equation strengthened by 1126 read => feed constraints.
[2023-03-23 17:01:09] [INFO ] Implicit Places using invariants and state equation in 12670 ms returned []
Implicit Place search using SMT with State Equation took 13664 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1404/4914 places, 3075/6913 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17365 ms. Remains : 1404/4914 places, 3075/6913 transitions.
Support contains 159 out of 1404 places after structural reductions.
[2023-03-23 17:01:09] [INFO ] Flatten gal took : 246 ms
[2023-03-23 17:01:10] [INFO ] Flatten gal took : 137 ms
[2023-03-23 17:01:10] [INFO ] Input system was already deterministic with 3075 transitions.
Support contains 145 out of 1404 places (down from 159) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 75) seen :25
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 50) 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 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) 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 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) 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 45) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Running SMT prover for 43 properties.
[2023-03-23 17:01:11] [INFO ] Flow matrix only has 2803 transitions (discarded 272 similar events)
[2023-03-23 17:01:11] [INFO ] Invariant cache hit.
[2023-03-23 17:01:12] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 17:01:12] [INFO ] [Real]Absence check using 31 positive and 52 generalized place invariants in 47 ms returned sat
[2023-03-23 17:01:14] [INFO ] After 882ms SMT Verify possible using state equation in real domain returned unsat :8 sat :2 real:33
[2023-03-23 17:01:14] [INFO ] State equation strengthened by 1126 read => feed constraints.
[2023-03-23 17:01:15] [INFO ] After 393ms SMT Verify possible using 1126 Read/Feed constraints in real domain returned unsat :8 sat :0 real:35
[2023-03-23 17:01:15] [INFO ] After 3511ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:35
[2023-03-23 17:01:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 17:01:15] [INFO ] [Nat]Absence check using 31 positive and 52 generalized place invariants in 37 ms returned sat
[2023-03-23 17:01:21] [INFO ] After 4439ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :35
[2023-03-23 17:01:30] [INFO ] After 9534ms SMT Verify possible using 1126 Read/Feed constraints in natural domain returned unsat :13 sat :30
[2023-03-23 17:01:31] [INFO ] Deduced a trap composed of 496 places in 670 ms of which 11 ms to minimize.
[2023-03-23 17:01:32] [INFO ] Deduced a trap composed of 175 places in 695 ms of which 2 ms to minimize.
[2023-03-23 17:01:32] [INFO ] Deduced a trap composed of 173 places in 652 ms of which 2 ms to minimize.
[2023-03-23 17:01:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2330 ms
[2023-03-23 17:01:33] [INFO ] Deduced a trap composed of 387 places in 631 ms of which 5 ms to minimize.
[2023-03-23 17:01:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 806 ms
[2023-03-23 17:01:35] [INFO ] Deduced a trap composed of 316 places in 652 ms of which 2 ms to minimize.
[2023-03-23 17:01:36] [INFO ] Deduced a trap composed of 409 places in 624 ms of which 2 ms to minimize.
[2023-03-23 17:01:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1592 ms
[2023-03-23 17:01:37] [INFO ] Deduced a trap composed of 237 places in 589 ms of which 1 ms to minimize.
[2023-03-23 17:01:37] [INFO ] Deduced a trap composed of 293 places in 579 ms of which 1 ms to minimize.
[2023-03-23 17:01:38] [INFO ] Deduced a trap composed of 326 places in 605 ms of which 1 ms to minimize.
[2023-03-23 17:01:39] [INFO ] Deduced a trap composed of 301 places in 646 ms of which 1 ms to minimize.
[2023-03-23 17:01:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3043 ms
[2023-03-23 17:01:40] [INFO ] Deduced a trap composed of 426 places in 648 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 17:01:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:01:40] [INFO ] After 25539ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0 real:35
Fused 43 Parikh solutions to 30 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 54 out of 1404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1404 transition count 3056
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1385 transition count 3056
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 38 place count 1385 transition count 3025
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 100 place count 1354 transition count 3025
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 126 place count 1328 transition count 2955
Iterating global reduction 2 with 26 rules applied. Total rules applied 152 place count 1328 transition count 2955
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 152 place count 1328 transition count 2953
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 1326 transition count 2953
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 1314 transition count 2905
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 1314 transition count 2905
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 182 place count 1312 transition count 2895
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 1312 transition count 2895
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 246 place count 1281 transition count 2864
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 257 place count 1270 transition count 2853
Iterating global reduction 2 with 11 rules applied. Total rules applied 268 place count 1270 transition count 2853
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 278 place count 1260 transition count 2803
Iterating global reduction 2 with 10 rules applied. Total rules applied 288 place count 1260 transition count 2803
Free-agglomeration rule (complex) applied 115 times.
Iterating global reduction 2 with 115 rules applied. Total rules applied 403 place count 1260 transition count 2688
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 2 with 115 rules applied. Total rules applied 518 place count 1145 transition count 2688
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 541 place count 1145 transition count 2688
Applied a total of 541 rules in 835 ms. Remains 1145 /1404 variables (removed 259) and now considering 2688/3075 (removed 387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 836 ms. Remains : 1145/1404 places, 2688/3075 transitions.
Incomplete random walk after 10000 steps, including 290 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-23 17:01:41] [INFO ] Flow matrix only has 2303 transitions (discarded 385 similar events)
// Phase 1: matrix 2303 rows 1145 cols
[2023-03-23 17:01:41] [INFO ] Computed 83 place invariants in 29 ms
[2023-03-23 17:01:42] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 17:01:42] [INFO ] [Real]Absence check using 33 positive and 50 generalized place invariants in 13 ms returned sat
[2023-03-23 17:01:45] [INFO ] After 2715ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:25
[2023-03-23 17:01:45] [INFO ] State equation strengthened by 998 read => feed constraints.
[2023-03-23 17:01:45] [INFO ] After 142ms SMT Verify possible using 998 Read/Feed constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-23 17:01:45] [INFO ] After 3872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-23 17:01:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-23 17:01:46] [INFO ] [Nat]Absence check using 33 positive and 50 generalized place invariants in 13 ms returned sat
[2023-03-23 17:01:49] [INFO ] After 2827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-23 17:01:56] [INFO ] After 7164ms SMT Verify possible using 998 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-23 17:01:57] [INFO ] Deduced a trap composed of 233 places in 476 ms of which 1 ms to minimize.
[2023-03-23 17:01:58] [INFO ] Deduced a trap composed of 190 places in 463 ms of which 1 ms to minimize.
[2023-03-23 17:01:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1139 ms
[2023-03-23 17:02:00] [INFO ] Deduced a trap composed of 208 places in 433 ms of which 1 ms to minimize.
[2023-03-23 17:02:00] [INFO ] Deduced a trap composed of 123 places in 440 ms of which 1 ms to minimize.
[2023-03-23 17:02:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1070 ms
[2023-03-23 17:02:01] [INFO ] Deduced a trap composed of 137 places in 456 ms of which 2 ms to minimize.
[2023-03-23 17:02:02] [INFO ] Deduced a trap composed of 168 places in 437 ms of which 1 ms to minimize.
[2023-03-23 17:02:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1085 ms
[2023-03-23 17:02:03] [INFO ] Deduced a trap composed of 232 places in 467 ms of which 1 ms to minimize.
[2023-03-23 17:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 889 ms
[2023-03-23 17:02:04] [INFO ] Deduced a trap composed of 165 places in 439 ms of which 1 ms to minimize.
[2023-03-23 17:02:05] [INFO ] Deduced a trap composed of 184 places in 434 ms of which 1 ms to minimize.
[2023-03-23 17:02:05] [INFO ] Deduced a trap composed of 168 places in 430 ms of which 1 ms to minimize.
[2023-03-23 17:02:06] [INFO ] Deduced a trap composed of 200 places in 429 ms of which 1 ms to minimize.
[2023-03-23 17:02:06] [INFO ] Deduced a trap composed of 205 places in 436 ms of which 1 ms to minimize.
[2023-03-23 17:02:07] [INFO ] Deduced a trap composed of 195 places in 439 ms of which 1 ms to minimize.
[2023-03-23 17:02:08] [INFO ] Deduced a trap composed of 146 places in 443 ms of which 1 ms to minimize.
[2023-03-23 17:02:08] [INFO ] Deduced a trap composed of 210 places in 442 ms of which 1 ms to minimize.
[2023-03-23 17:02:09] [INFO ] Deduced a trap composed of 227 places in 438 ms of which 1 ms to minimize.
[2023-03-23 17:02:09] [INFO ] Deduced a trap composed of 170 places in 437 ms of which 1 ms to minimize.
[2023-03-23 17:02:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6375 ms
[2023-03-23 17:02:11] [INFO ] Deduced a trap composed of 2 places in 537 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 17:02:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:02:11] [INFO ] After 25557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:26
Parikh walk visited 0 properties in 32 ms.
Support contains 49 out of 1145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1145/1145 places, 2688/2688 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 1145 transition count 2685
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1142 transition count 2685
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1142 transition count 2684
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1141 transition count 2684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1140 transition count 2683
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1140 transition count 2683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 1139 transition count 2678
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1139 transition count 2678
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 1139 transition count 2678
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 1136 transition count 2675
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 1136 transition count 2675
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 1133 transition count 2660
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 1133 transition count 2660
Applied a total of 28 rules in 250 ms. Remains 1133 /1145 variables (removed 12) and now considering 2660/2688 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1133/1145 places, 2660/2688 transitions.
Incomplete random walk after 10000 steps, including 290 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 60952 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{2=1, 8=1, 18=1, 20=1}
Probabilistic random walk after 60952 steps, saw 26862 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :4
Running SMT prover for 20 properties.
[2023-03-23 17:02:15] [INFO ] Flow matrix only has 2275 transitions (discarded 385 similar events)
// Phase 1: matrix 2275 rows 1133 cols
[2023-03-23 17:02:15] [INFO ] Computed 83 place invariants in 21 ms
[2023-03-23 17:02:15] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 17:02:15] [INFO ] [Real]Absence check using 33 positive and 50 generalized place invariants in 19 ms returned sat
[2023-03-23 17:02:18] [INFO ] After 2218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:18
[2023-03-23 17:02:18] [INFO ] State equation strengthened by 982 read => feed constraints.
[2023-03-23 17:02:18] [INFO ] After 251ms SMT Verify possible using 982 Read/Feed constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-23 17:02:18] [INFO ] After 3309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-23 17:02:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-23 17:02:18] [INFO ] [Nat]Absence check using 33 positive and 50 generalized place invariants in 13 ms returned sat
[2023-03-23 17:02:21] [INFO ] After 2262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-23 17:02:27] [INFO ] After 6296ms SMT Verify possible using 982 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-23 17:02:28] [INFO ] Deduced a trap composed of 182 places in 434 ms of which 1 ms to minimize.
[2023-03-23 17:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 556 ms
[2023-03-23 17:02:29] [INFO ] Deduced a trap composed of 167 places in 440 ms of which 1 ms to minimize.
[2023-03-23 17:02:29] [INFO ] Deduced a trap composed of 153 places in 416 ms of which 1 ms to minimize.
[2023-03-23 17:02:30] [INFO ] Deduced a trap composed of 174 places in 445 ms of which 1 ms to minimize.
[2023-03-23 17:02:30] [INFO ] Deduced a trap composed of 160 places in 415 ms of which 2 ms to minimize.
[2023-03-23 17:02:31] [INFO ] Deduced a trap composed of 156 places in 445 ms of which 4 ms to minimize.
[2023-03-23 17:02:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2682 ms
[2023-03-23 17:02:32] [INFO ] Deduced a trap composed of 224 places in 419 ms of which 1 ms to minimize.
[2023-03-23 17:02:32] [INFO ] Deduced a trap composed of 141 places in 454 ms of which 1 ms to minimize.
[2023-03-23 17:02:33] [INFO ] Deduced a trap composed of 140 places in 471 ms of which 1 ms to minimize.
[2023-03-23 17:02:33] [INFO ] Deduced a trap composed of 140 places in 456 ms of which 1 ms to minimize.
[2023-03-23 17:02:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2107 ms
[2023-03-23 17:02:34] [INFO ] Deduced a trap composed of 145 places in 459 ms of which 2 ms to minimize.
[2023-03-23 17:02:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 583 ms
[2023-03-23 17:02:36] [INFO ] Deduced a trap composed of 123 places in 455 ms of which 1 ms to minimize.
[2023-03-23 17:02:36] [INFO ] Deduced a trap composed of 152 places in 458 ms of which 1 ms to minimize.
[2023-03-23 17:02:37] [INFO ] Deduced a trap composed of 201 places in 459 ms of which 1 ms to minimize.
[2023-03-23 17:02:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1730 ms
[2023-03-23 17:02:38] [INFO ] Deduced a trap composed of 157 places in 401 ms of which 1 ms to minimize.
[2023-03-23 17:02:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 575 ms
[2023-03-23 17:02:39] [INFO ] Deduced a trap composed of 202 places in 456 ms of which 1 ms to minimize.
[2023-03-23 17:02:40] [INFO ] Deduced a trap composed of 206 places in 461 ms of which 1 ms to minimize.
[2023-03-23 17:02:41] [INFO ] Deduced a trap composed of 225 places in 459 ms of which 1 ms to minimize.
[2023-03-23 17:02:41] [INFO ] Deduced a trap composed of 241 places in 455 ms of which 1 ms to minimize.
[2023-03-23 17:02:42] [INFO ] Deduced a trap composed of 186 places in 457 ms of which 1 ms to minimize.
[2023-03-23 17:02:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3428 ms
[2023-03-23 17:02:43] [INFO ] After 22008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-23 17:02:43] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 42 ms.
Support contains 33 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2660/2660 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 1133 transition count 2659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1132 transition count 2659
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1132 transition count 2658
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2658
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 1127 transition count 2642
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1127 transition count 2642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 1126 transition count 2637
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 1126 transition count 2637
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 47 place count 1126 transition count 3496
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 80 place count 1093 transition count 3496
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 1093 transition count 3496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 1092 transition count 3495
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 1092 transition count 3495
Applied a total of 84 rules in 323 ms. Remains 1092 /1133 variables (removed 41) and now considering 3495/2660 (removed -835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 1092/1133 places, 3495/2660 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 62929 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62929 steps, saw 26917 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 20 properties.
[2023-03-23 17:02:47] [INFO ] Flow matrix only has 3109 transitions (discarded 386 similar events)
// Phase 1: matrix 3109 rows 1092 cols
[2023-03-23 17:02:47] [INFO ] Computed 83 place invariants in 29 ms
[2023-03-23 17:02:47] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-23 17:02:47] [INFO ] [Real]Absence check using 33 positive and 50 generalized place invariants in 21 ms returned sat
[2023-03-23 17:02:51] [INFO ] After 2838ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:18
[2023-03-23 17:02:51] [INFO ] State equation strengthened by 1858 read => feed constraints.
[2023-03-23 17:02:51] [INFO ] After 426ms SMT Verify possible using 1858 Read/Feed constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-23 17:02:51] [INFO ] After 4052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-23 17:02:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2023-03-23 17:02:51] [INFO ] [Nat]Absence check using 33 positive and 50 generalized place invariants in 16 ms returned sat
[2023-03-23 17:02:55] [INFO ] After 2794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-23 17:03:01] [INFO ] After 6276ms SMT Verify possible using 1858 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-23 17:03:02] [INFO ] Deduced a trap composed of 170 places in 475 ms of which 1 ms to minimize.
[2023-03-23 17:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 619 ms
[2023-03-23 17:03:03] [INFO ] Deduced a trap composed of 214 places in 471 ms of which 1 ms to minimize.
[2023-03-23 17:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 629 ms
[2023-03-23 17:03:04] [INFO ] Deduced a trap composed of 161 places in 446 ms of which 1 ms to minimize.
[2023-03-23 17:03:04] [INFO ] Deduced a trap composed of 172 places in 463 ms of which 1 ms to minimize.
[2023-03-23 17:03:05] [INFO ] Deduced a trap composed of 179 places in 443 ms of which 1 ms to minimize.
[2023-03-23 17:03:05] [INFO ] Deduced a trap composed of 201 places in 460 ms of which 1 ms to minimize.
[2023-03-23 17:03:06] [INFO ] Deduced a trap composed of 219 places in 502 ms of which 8 ms to minimize.
[2023-03-23 17:03:07] [INFO ] Deduced a trap composed of 180 places in 472 ms of which 1 ms to minimize.
[2023-03-23 17:03:07] [INFO ] Deduced a trap composed of 140 places in 443 ms of which 1 ms to minimize.
[2023-03-23 17:03:08] [INFO ] Deduced a trap composed of 176 places in 449 ms of which 1 ms to minimize.
[2023-03-23 17:03:08] [INFO ] Deduced a trap composed of 185 places in 490 ms of which 1 ms to minimize.
[2023-03-23 17:03:09] [INFO ] Deduced a trap composed of 136 places in 437 ms of which 1 ms to minimize.
[2023-03-23 17:03:10] [INFO ] Deduced a trap composed of 143 places in 470 ms of which 1 ms to minimize.
[2023-03-23 17:03:10] [INFO ] Deduced a trap composed of 155 places in 493 ms of which 1 ms to minimize.
[2023-03-23 17:03:11] [INFO ] Deduced a trap composed of 155 places in 463 ms of which 2 ms to minimize.
[2023-03-23 17:03:11] [INFO ] Deduced a trap composed of 144 places in 467 ms of which 3 ms to minimize.
[2023-03-23 17:03:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8350 ms
[2023-03-23 17:03:13] [INFO ] Deduced a trap composed of 90 places in 556 ms of which 1 ms to minimize.
[2023-03-23 17:03:14] [INFO ] Deduced a trap composed of 105 places in 566 ms of which 2 ms to minimize.
[2023-03-23 17:03:14] [INFO ] Deduced a trap composed of 97 places in 570 ms of which 4 ms to minimize.
[2023-03-23 17:03:15] [INFO ] Deduced a trap composed of 98 places in 567 ms of which 1 ms to minimize.
[2023-03-23 17:03:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2661 ms
[2023-03-23 17:03:16] [INFO ] Deduced a trap composed of 173 places in 549 ms of which 1 ms to minimize.
[2023-03-23 17:03:16] [INFO ] Deduced a trap composed of 175 places in 519 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 17:03:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:03:16] [INFO ] After 25287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Parikh walk visited 0 properties in 47 ms.
Support contains 33 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 3495/3495 transitions.
Applied a total of 0 rules in 81 ms. Remains 1092 /1092 variables (removed 0) and now considering 3495/3495 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1092/1092 places, 3495/3495 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 3495/3495 transitions.
Applied a total of 0 rules in 81 ms. Remains 1092 /1092 variables (removed 0) and now considering 3495/3495 (removed 0) transitions.
[2023-03-23 17:03:17] [INFO ] Flow matrix only has 3109 transitions (discarded 386 similar events)
[2023-03-23 17:03:17] [INFO ] Invariant cache hit.
[2023-03-23 17:03:18] [INFO ] Implicit Places using invariants in 1182 ms returned [7, 8, 180, 289, 318, 352, 353, 371, 406, 430, 446, 467, 477, 496, 503, 537, 544, 545, 554, 555, 583, 597, 604, 618, 631, 651, 658, 681, 709, 710, 711, 724, 743]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1187 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1059/1092 places, 3495/3495 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1042 transition count 3478
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1042 transition count 3478
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1025 transition count 3461
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1025 transition count 3461
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 69 place count 1025 transition count 3460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 70 place count 1024 transition count 3460
Applied a total of 70 rules in 200 ms. Remains 1024 /1059 variables (removed 35) and now considering 3460/3495 (removed 35) transitions.
[2023-03-23 17:03:18] [INFO ] Flow matrix only has 3074 transitions (discarded 386 similar events)
// Phase 1: matrix 3074 rows 1024 cols
[2023-03-23 17:03:18] [INFO ] Computed 50 place invariants in 19 ms
[2023-03-23 17:03:19] [INFO ] Implicit Places using invariants in 958 ms returned []
[2023-03-23 17:03:19] [INFO ] Flow matrix only has 3074 transitions (discarded 386 similar events)
[2023-03-23 17:03:19] [INFO ] Invariant cache hit.
[2023-03-23 17:03:20] [INFO ] State equation strengthened by 1858 read => feed constraints.
[2023-03-23 17:03:38] [INFO ] Implicit Places using invariants and state equation in 19349 ms returned []
Implicit Place search using SMT with State Equation took 20309 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1024/1092 places, 3460/3495 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21778 ms. Remains : 1024/1092 places, 3460/3495 transitions.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
[2023-03-23 17:03:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-23 17:03:38] [INFO ] Flatten gal took : 148 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 17:03:39] [INFO ] Flatten gal took : 144 ms
[2023-03-23 17:03:39] [INFO ] Input system was already deterministic with 3075 transitions.
Support contains 102 out of 1404 places (down from 108) after GAL structural reductions.
Computed a total of 572 stabilizing places and 1442 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1349 transition count 2956
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1349 transition count 2956
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 146 place count 1313 transition count 2868
Iterating global reduction 0 with 36 rules applied. Total rules applied 182 place count 1313 transition count 2868
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 203 place count 1292 transition count 2763
Iterating global reduction 0 with 21 rules applied. Total rules applied 224 place count 1292 transition count 2763
Applied a total of 224 rules in 131 ms. Remains 1292 /1404 variables (removed 112) and now considering 2763/3075 (removed 312) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 1292/1404 places, 2763/3075 transitions.
[2023-03-23 17:03:39] [INFO ] Flatten gal took : 70 ms
[2023-03-23 17:03:39] [INFO ] Flatten gal took : 67 ms
[2023-03-23 17:03:39] [INFO ] Input system was already deterministic with 2763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 1350 transition count 2965
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 1350 transition count 2965
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 145 place count 1313 transition count 2876
Iterating global reduction 0 with 37 rules applied. Total rules applied 182 place count 1313 transition count 2876
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 204 place count 1291 transition count 2766
Iterating global reduction 0 with 22 rules applied. Total rules applied 226 place count 1291 transition count 2766
Applied a total of 226 rules in 143 ms. Remains 1291 /1404 variables (removed 113) and now considering 2766/3075 (removed 309) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 1291/1404 places, 2766/3075 transitions.
[2023-03-23 17:03:39] [INFO ] Flatten gal took : 62 ms
[2023-03-23 17:03:40] [INFO ] Flatten gal took : 69 ms
[2023-03-23 17:03:40] [INFO ] Input system was already deterministic with 2766 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1404 transition count 3048
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1377 transition count 3048
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 54 place count 1377 transition count 3012
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 126 place count 1341 transition count 3012
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 163 place count 1304 transition count 2907
Iterating global reduction 2 with 37 rules applied. Total rules applied 200 place count 1304 transition count 2907
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 200 place count 1304 transition count 2905
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 1302 transition count 2905
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 221 place count 1285 transition count 2832
Iterating global reduction 2 with 17 rules applied. Total rules applied 238 place count 1285 transition count 2832
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 240 place count 1283 transition count 2822
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 1283 transition count 2822
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 308 place count 1250 transition count 2789
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 327 place count 1231 transition count 2770
Iterating global reduction 2 with 19 rules applied. Total rules applied 346 place count 1231 transition count 2770
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 364 place count 1213 transition count 2680
Iterating global reduction 2 with 18 rules applied. Total rules applied 382 place count 1213 transition count 2680
Applied a total of 382 rules in 464 ms. Remains 1213 /1404 variables (removed 191) and now considering 2680/3075 (removed 395) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 464 ms. Remains : 1213/1404 places, 2680/3075 transitions.
[2023-03-23 17:03:40] [INFO ] Flatten gal took : 52 ms
[2023-03-23 17:03:40] [INFO ] Flatten gal took : 57 ms
[2023-03-23 17:03:40] [INFO ] Input system was already deterministic with 2680 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 374 steps, run visited all 1 properties in 14 ms. (steps per millisecond=26 )
Probabilistic random walk after 374 steps, saw 244 distinct states, run finished after 14 ms. (steps per millisecond=26 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 1347 transition count 2950
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 1347 transition count 2950
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 151 place count 1310 transition count 2861
Iterating global reduction 0 with 37 rules applied. Total rules applied 188 place count 1310 transition count 2861
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 210 place count 1288 transition count 2751
Iterating global reduction 0 with 22 rules applied. Total rules applied 232 place count 1288 transition count 2751
Applied a total of 232 rules in 133 ms. Remains 1288 /1404 variables (removed 116) and now considering 2751/3075 (removed 324) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 1288/1404 places, 2751/3075 transitions.
[2023-03-23 17:03:41] [INFO ] Flatten gal took : 61 ms
[2023-03-23 17:03:41] [INFO ] Flatten gal took : 83 ms
[2023-03-23 17:03:41] [INFO ] Input system was already deterministic with 2751 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1354 transition count 2969
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1354 transition count 2969
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 133 place count 1321 transition count 2892
Iterating global reduction 0 with 33 rules applied. Total rules applied 166 place count 1321 transition count 2892
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 186 place count 1301 transition count 2792
Iterating global reduction 0 with 20 rules applied. Total rules applied 206 place count 1301 transition count 2792
Applied a total of 206 rules in 168 ms. Remains 1301 /1404 variables (removed 103) and now considering 2792/3075 (removed 283) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 1301/1404 places, 2792/3075 transitions.
[2023-03-23 17:03:41] [INFO ] Flatten gal took : 60 ms
[2023-03-23 17:03:41] [INFO ] Flatten gal took : 67 ms
[2023-03-23 17:03:41] [INFO ] Input system was already deterministic with 2792 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1349 transition count 2952
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1349 transition count 2952
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 145 place count 1314 transition count 2869
Iterating global reduction 0 with 35 rules applied. Total rules applied 180 place count 1314 transition count 2869
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 201 place count 1293 transition count 2764
Iterating global reduction 0 with 21 rules applied. Total rules applied 222 place count 1293 transition count 2764
Applied a total of 222 rules in 155 ms. Remains 1293 /1404 variables (removed 111) and now considering 2764/3075 (removed 311) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 1293/1404 places, 2764/3075 transitions.
[2023-03-23 17:03:42] [INFO ] Flatten gal took : 57 ms
[2023-03-23 17:03:42] [INFO ] Flatten gal took : 63 ms
[2023-03-23 17:03:42] [INFO ] Input system was already deterministic with 2764 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 1348 transition count 2951
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 1348 transition count 2951
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 148 place count 1312 transition count 2867
Iterating global reduction 0 with 36 rules applied. Total rules applied 184 place count 1312 transition count 2867
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 206 place count 1290 transition count 2757
Iterating global reduction 0 with 22 rules applied. Total rules applied 228 place count 1290 transition count 2757
Applied a total of 228 rules in 151 ms. Remains 1290 /1404 variables (removed 114) and now considering 2757/3075 (removed 318) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 1290/1404 places, 2757/3075 transitions.
[2023-03-23 17:03:42] [INFO ] Flatten gal took : 55 ms
[2023-03-23 17:03:42] [INFO ] Flatten gal took : 61 ms
[2023-03-23 17:03:42] [INFO ] Input system was already deterministic with 2757 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 1348 transition count 2951
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 1348 transition count 2951
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 148 place count 1312 transition count 2863
Iterating global reduction 0 with 36 rules applied. Total rules applied 184 place count 1312 transition count 2863
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 204 place count 1292 transition count 2763
Iterating global reduction 0 with 20 rules applied. Total rules applied 224 place count 1292 transition count 2763
Applied a total of 224 rules in 147 ms. Remains 1292 /1404 variables (removed 112) and now considering 2763/3075 (removed 312) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 1292/1404 places, 2763/3075 transitions.
[2023-03-23 17:03:42] [INFO ] Flatten gal took : 54 ms
[2023-03-23 17:03:43] [INFO ] Flatten gal took : 60 ms
[2023-03-23 17:03:43] [INFO ] Input system was already deterministic with 2763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1404 transition count 3051
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1380 transition count 3051
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 48 place count 1380 transition count 3018
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 114 place count 1347 transition count 3018
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 148 place count 1313 transition count 2916
Iterating global reduction 2 with 34 rules applied. Total rules applied 182 place count 1313 transition count 2916
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 182 place count 1313 transition count 2915
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 1312 transition count 2915
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 198 place count 1298 transition count 2857
Iterating global reduction 2 with 14 rules applied. Total rules applied 212 place count 1298 transition count 2857
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 214 place count 1296 transition count 2847
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 1296 transition count 2847
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 282 place count 1263 transition count 2814
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 298 place count 1247 transition count 2798
Iterating global reduction 2 with 16 rules applied. Total rules applied 314 place count 1247 transition count 2798
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 329 place count 1232 transition count 2723
Iterating global reduction 2 with 15 rules applied. Total rules applied 344 place count 1232 transition count 2723
Applied a total of 344 rules in 412 ms. Remains 1232 /1404 variables (removed 172) and now considering 2723/3075 (removed 352) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 412 ms. Remains : 1232/1404 places, 2723/3075 transitions.
[2023-03-23 17:03:43] [INFO ] Flatten gal took : 50 ms
[2023-03-23 17:03:43] [INFO ] Flatten gal took : 57 ms
[2023-03-23 17:03:43] [INFO ] Input system was already deterministic with 2723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1351 transition count 2962
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1351 transition count 2962
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 141 place count 1316 transition count 2879
Iterating global reduction 0 with 35 rules applied. Total rules applied 176 place count 1316 transition count 2879
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 197 place count 1295 transition count 2774
Iterating global reduction 0 with 21 rules applied. Total rules applied 218 place count 1295 transition count 2774
Applied a total of 218 rules in 153 ms. Remains 1295 /1404 variables (removed 109) and now considering 2774/3075 (removed 301) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 1295/1404 places, 2774/3075 transitions.
[2023-03-23 17:03:44] [INFO ] Flatten gal took : 60 ms
[2023-03-23 17:03:44] [INFO ] Flatten gal took : 69 ms
[2023-03-23 17:03:44] [INFO ] Input system was already deterministic with 2774 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1404 transition count 3047
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1376 transition count 3047
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 56 place count 1376 transition count 3011
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 128 place count 1340 transition count 3011
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 164 place count 1304 transition count 2911
Iterating global reduction 2 with 36 rules applied. Total rules applied 200 place count 1304 transition count 2911
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 200 place count 1304 transition count 2909
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 1302 transition count 2909
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 221 place count 1285 transition count 2836
Iterating global reduction 2 with 17 rules applied. Total rules applied 238 place count 1285 transition count 2836
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 240 place count 1283 transition count 2826
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 1283 transition count 2826
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 308 place count 1250 transition count 2793
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 328 place count 1230 transition count 2773
Iterating global reduction 2 with 20 rules applied. Total rules applied 348 place count 1230 transition count 2773
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 367 place count 1211 transition count 2678
Iterating global reduction 2 with 19 rules applied. Total rules applied 386 place count 1211 transition count 2678
Applied a total of 386 rules in 372 ms. Remains 1211 /1404 variables (removed 193) and now considering 2678/3075 (removed 397) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 372 ms. Remains : 1211/1404 places, 2678/3075 transitions.
[2023-03-23 17:03:44] [INFO ] Flatten gal took : 51 ms
[2023-03-23 17:03:44] [INFO ] Flatten gal took : 60 ms
[2023-03-23 17:03:44] [INFO ] Input system was already deterministic with 2678 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1351 transition count 2958
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1351 transition count 2958
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 141 place count 1316 transition count 2875
Iterating global reduction 0 with 35 rules applied. Total rules applied 176 place count 1316 transition count 2875
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 197 place count 1295 transition count 2770
Iterating global reduction 0 with 21 rules applied. Total rules applied 218 place count 1295 transition count 2770
Applied a total of 218 rules in 134 ms. Remains 1295 /1404 variables (removed 109) and now considering 2770/3075 (removed 305) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 1295/1404 places, 2770/3075 transitions.
[2023-03-23 17:03:45] [INFO ] Flatten gal took : 58 ms
[2023-03-23 17:03:45] [INFO ] Flatten gal took : 67 ms
[2023-03-23 17:03:45] [INFO ] Input system was already deterministic with 2770 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 1350 transition count 2957
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 1350 transition count 2957
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 142 place count 1316 transition count 2875
Iterating global reduction 0 with 34 rules applied. Total rules applied 176 place count 1316 transition count 2875
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 197 place count 1295 transition count 2770
Iterating global reduction 0 with 21 rules applied. Total rules applied 218 place count 1295 transition count 2770
Applied a total of 218 rules in 139 ms. Remains 1295 /1404 variables (removed 109) and now considering 2770/3075 (removed 305) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 1295/1404 places, 2770/3075 transitions.
[2023-03-23 17:03:45] [INFO ] Flatten gal took : 58 ms
[2023-03-23 17:03:45] [INFO ] Flatten gal took : 68 ms
[2023-03-23 17:03:45] [INFO ] Input system was already deterministic with 2770 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1404/1404 places, 3075/3075 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1349 transition count 2956
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1349 transition count 2956
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 146 place count 1313 transition count 2868
Iterating global reduction 0 with 36 rules applied. Total rules applied 182 place count 1313 transition count 2868
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 203 place count 1292 transition count 2763
Iterating global reduction 0 with 21 rules applied. Total rules applied 224 place count 1292 transition count 2763
Applied a total of 224 rules in 176 ms. Remains 1292 /1404 variables (removed 112) and now considering 2763/3075 (removed 312) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 1292/1404 places, 2763/3075 transitions.
[2023-03-23 17:03:46] [INFO ] Flatten gal took : 57 ms
[2023-03-23 17:03:46] [INFO ] Flatten gal took : 64 ms
[2023-03-23 17:03:46] [INFO ] Input system was already deterministic with 2763 transitions.
[2023-03-23 17:03:46] [INFO ] Flatten gal took : 69 ms
[2023-03-23 17:03:46] [INFO ] Flatten gal took : 71 ms
[2023-03-23 17:03:46] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-23 17:03:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1404 places, 3075 transitions and 13488 arcs took 19 ms.
Total runtime 175114 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 1404 NrTr: 3075 NrArc: 13488)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.382sec
net check time: 0m 0.002sec
init dd package: 0m 2.899sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10018296 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16089272 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 CTLFireability -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.049sec
18744 35248 57835 78597 104097 145351 184079 217777 254412 318610 393070 451110 512025 617524 711460 813553
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="CTLFireability"
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 CTLFireability"
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-167856420800770"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;