About the Execution of GreatSPN+red for DoubleLock-PT-p2s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13817.479 | 941526.00 | 2408062.00 | 1251.90 | T?T??T?T???TFT?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131500617.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleLock-PT-p2s2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500617
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 12 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 813K May 18 16:42 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 DoubleLock-PT-p2s2-CTLCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-08
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-09
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2023-12
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2023-13
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2023-14
FORMULA_NAME DoubleLock-PT-p2s2-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716396751156
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:52:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 16:52:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:52:32] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-22 16:52:32] [INFO ] Transformed 184 places.
[2024-05-22 16:52:32] [INFO ] Transformed 1832 transitions.
[2024-05-22 16:52:32] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 147 transition count 1768
Applied a total of 1 rules in 48 ms. Remains 147 /148 variables (removed 1) and now considering 1768/1768 (removed 0) transitions.
[2024-05-22 16:52:32] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 147 cols
[2024-05-22 16:52:32] [INFO ] Computed 3 invariants in 39 ms
[2024-05-22 16:52:33] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-22 16:52:33] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2024-05-22 16:52:33] [INFO ] Invariant cache hit.
[2024-05-22 16:52:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 16:52:33] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
Running 1766 sub problems to find dead transitions.
[2024-05-22 16:52:33] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2024-05-22 16:52:33] [INFO ] Invariant cache hit.
[2024-05-22 16:52:33] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
[2024-05-22 16:52:53] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 13 ms to minimize.
[2024-05-22 16:52:53] [INFO ] Deduced a trap composed of 93 places in 223 ms of which 2 ms to minimize.
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
[2024-05-22 16:52:54] [INFO ] Deduced a trap composed of 90 places in 779 ms of which 2 ms to minimize.
[2024-05-22 16:52:55] [INFO ] Deduced a trap composed of 89 places in 510 ms of which 14 ms to minimize.
Problem TDEAD1144 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1191 is UNSAT
[2024-05-22 16:52:56] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 1 ms to minimize.
[2024-05-22 16:52:56] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 1 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 6/9 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 145/1372 variables, and 9 constraints, problems are : Problem set: 192 solved, 1574 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/147 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 1766/1766 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 192 solved, 1574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 2/3 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 6/9 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/9 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
At refinement iteration 5 (OVERLAPS) 1225/1370 variables, 145/154 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1370 variables, 116/270 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1370 variables, 96/366 constraints. Problems are: Problem set: 192 solved, 1574 unsolved
[2024-05-22 16:53:33] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 1 ms to minimize.
[2024-05-22 16:53:33] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1370/1372 variables, and 368 constraints, problems are : Problem set: 192 solved, 1574 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 145/147 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 96/1766 constraints, Known Traps: 8/8 constraints]
After SMT, in 62717ms problems are : Problem set: 192 solved, 1574 unsolved
Search for dead transitions found 192 dead transitions in 62759ms
Found 192 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in LTL mode, iteration 1 : 147/148 places, 1576/1768 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63803 ms. Remains : 147/148 places, 1576/1768 transitions.
Support contains 92 out of 147 places after structural reductions.
[2024-05-22 16:53:37] [INFO ] Flatten gal took : 271 ms
[2024-05-22 16:53:37] [INFO ] Flatten gal took : 180 ms
[2024-05-22 16:53:37] [INFO ] Input system was already deterministic with 1576 transitions.
Support contains 89 out of 147 places (down from 92) after GAL structural reductions.
RANDOM walk for 40007 steps (402 resets) in 1362 ms. (29 steps per ms) remains 47/86 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (9 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 44/46 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (12 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (9 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
[2024-05-22 16:53:38] [INFO ] Flow matrix only has 1061 transitions (discarded 515 similar events)
// Phase 1: matrix 1061 rows 147 cols
[2024-05-22 16:53:38] [INFO ] Computed 3 invariants in 7 ms
[2024-05-22 16:53:38] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 1 (OVERLAPS) 89/139 variables, 3/3 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1197 variables, 139/142 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1197 variables, 110/252 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1197 variables, 0/252 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 11/1208 variables, 8/260 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1208 variables, 2/262 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1208 variables, 0/262 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1208 variables, 0/262 constraints. Problems are: Problem set: 36 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 262 constraints, problems are : Problem set: 36 solved, 8 unsolved in 1941 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 126/135 variables, 3/3 constraints. Problems are: Problem set: 36 solved, 8 unsolved
[2024-05-22 16:53:41] [INFO ] Deduced a trap composed of 60 places in 782 ms of which 6 ms to minimize.
[2024-05-22 16:53:41] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:53:41] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 3 ms to minimize.
[2024-05-22 16:53:41] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 4/7 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1057/1192 variables, 135/142 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1192 variables, 109/251 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1192 variables, 5/256 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1192 variables, 0/256 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 16/1208 variables, 12/268 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 3/271 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1208 variables, 3/274 constraints. Problems are: Problem set: 36 solved, 8 unsolved
[2024-05-22 16:53:44] [INFO ] Deduced a trap composed of 72 places in 283 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1208 variables, 1/275 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1208 variables, 0/275 constraints. Problems are: Problem set: 36 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1208 variables, 0/275 constraints. Problems are: Problem set: 36 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 275 constraints, problems are : Problem set: 36 solved, 8 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 8/44 constraints, Known Traps: 5/5 constraints]
After SMT, in 6847ms problems are : Problem set: 36 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Graph (complete) has 2609 edges and 147 vertex of which 145 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 145 transition count 1560
Applied a total of 17 rules in 106 ms. Remains 145 /147 variables (removed 2) and now considering 1560/1576 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 145/147 places, 1560/1576 transitions.
RANDOM walk for 40007 steps (402 resets) in 250 ms. (159 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (71 resets) in 75 ms. (526 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (80 resets) in 156 ms. (254 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (73 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (77 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (84 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
[2024-05-22 16:53:45] [INFO ] Flow matrix only has 1045 transitions (discarded 515 similar events)
// Phase 1: matrix 1045 rows 145 cols
[2024-05-22 16:53:45] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 16:53:45] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 957/1112 variables, 78/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 101/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/1119 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1119 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 17/1136 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1136 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1136 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 54/1190 variables, 59/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1190 variables, 11/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1190 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 259 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 957/1112 variables, 78/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 101/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1112 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 7/1119 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1119 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 17/1136 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1136 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1136 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 54/1190 variables, 59/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 11/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1190 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1190 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 264 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3030ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 1731 ms.
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 1560/1560 transitions.
Applied a total of 0 rules in 38 ms. Remains 145 /145 variables (removed 0) and now considering 1560/1560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 145/145 places, 1560/1560 transitions.
RANDOM walk for 40005 steps (409 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (76 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (76 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (80 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (83 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 297688 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :1 out of 4
Probabilistic random walk after 297688 steps, saw 232702 distinct states, run finished after 3004 ms. (steps per millisecond=99 ) properties seen :1
[2024-05-22 16:53:53] [INFO ] Flow matrix only has 1045 transitions (discarded 515 similar events)
[2024-05-22 16:53:54] [INFO ] Invariant cache hit.
[2024-05-22 16:53:54] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 964/1110 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 101/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/1117 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1117 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/1135 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1135 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1135 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 55/1190 variables, 60/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1190 variables, 11/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1190 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 259 constraints, problems are : Problem set: 0 solved, 3 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 964/1110 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 101/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/1117 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1117 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/1135 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1135 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1135 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 55/1190 variables, 60/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 11/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1190 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1190 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1593ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 823 ms.
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 1560/1560 transitions.
Graph (complete) has 2550 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 144 /145 variables (removed 1) and now considering 1560/1560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 144/145 places, 1560/1560 transitions.
RANDOM walk for 40000 steps (409 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (79 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (80 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (83 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 242681 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 3
Probabilistic random walk after 242681 steps, saw 166591 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-22 16:53:59] [INFO ] Flow matrix only has 1045 transitions (discarded 515 similar events)
// Phase 1: matrix 1045 rows 144 cols
[2024-05-22 16:53:59] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 16:53:59] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 964/1110 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 101/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/1117 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1117 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/1135 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1135 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1135 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 54/1189 variables, 59/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1189 variables, 11/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1189 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1189 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1189/1189 variables, and 258 constraints, problems are : Problem set: 0 solved, 3 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 964/1110 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 101/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/1117 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1117 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/1135 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1135 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1135 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 54/1189 variables, 59/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1189 variables, 11/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1189 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1189 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1189/1189 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1710ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 426 ms.
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1560/1560 transitions.
Applied a total of 0 rules in 23 ms. Remains 144 /144 variables (removed 0) and now considering 1560/1560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 144/144 places, 1560/1560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1560/1560 transitions.
Applied a total of 0 rules in 22 ms. Remains 144 /144 variables (removed 0) and now considering 1560/1560 (removed 0) transitions.
[2024-05-22 16:54:01] [INFO ] Flow matrix only has 1045 transitions (discarded 515 similar events)
[2024-05-22 16:54:01] [INFO ] Invariant cache hit.
[2024-05-22 16:54:02] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-22 16:54:02] [INFO ] Flow matrix only has 1045 transitions (discarded 515 similar events)
[2024-05-22 16:54:02] [INFO ] Invariant cache hit.
[2024-05-22 16:54:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-22 16:54:02] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2024-05-22 16:54:02] [INFO ] Redundant transitions in 84 ms returned []
Running 1558 sub problems to find dead transitions.
[2024-05-22 16:54:02] [INFO ] Flow matrix only has 1045 transitions (discarded 515 similar events)
[2024-05-22 16:54:02] [INFO ] Invariant cache hit.
[2024-05-22 16:54:02] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (OVERLAPS) 1045/1189 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1189 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1189/1189 variables, and 258 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1558/1558 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 3 (OVERLAPS) 1045/1189 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1189 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1189 variables, 1558/1816 constraints. Problems are: Problem set: 0 solved, 1558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1189/1189 variables, and 1816 constraints, problems are : Problem set: 0 solved, 1558 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1558/1558 constraints, Known Traps: 0/0 constraints]
After SMT, in 61938ms problems are : Problem set: 0 solved, 1558 unsolved
Search for dead transitions found 0 dead transitions in 61952ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63081 ms. Remains : 144/144 places, 1560/1560 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 144 transition count 1045
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 144 transition count 1034
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 133 transition count 1034
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 539 place count 132 transition count 1033
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 540 place count 131 transition count 1001
Iterating global reduction 1 with 1 rules applied. Total rules applied 541 place count 131 transition count 1001
Applied a total of 541 rules in 75 ms. Remains 131 /144 variables (removed 13) and now considering 1001/1560 (removed 559) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1001 rows 131 cols
[2024-05-22 16:55:05] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 16:55:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 16:55:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-22 16:55:05] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 16:55:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 16:55:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:55:05] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 16:55:05] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 16:55:05] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1039 ms.
Successfully simplified 36 atomic propositions for a total of 15 simplifications.
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 16:55:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-22 16:55:06] [INFO ] Flatten gal took : 76 ms
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 16:55:06] [INFO ] Flatten gal took : 79 ms
[2024-05-22 16:55:06] [INFO ] Input system was already deterministic with 1576 transitions.
Support contains 40 out of 147 places (down from 52) after GAL structural reductions.
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 416 stable transitions
Graph (complete) has 3028 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.25 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Graph (complete) has 3028 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 67 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:06] [INFO ] Flatten gal took : 54 ms
[2024-05-22 16:55:06] [INFO ] Flatten gal took : 51 ms
[2024-05-22 16:55:06] [INFO ] Input system was already deterministic with 1576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 144 transition count 1576
Applied a total of 3 rules in 6 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:06] [INFO ] Flatten gal took : 62 ms
[2024-05-22 16:55:06] [INFO ] Flatten gal took : 67 ms
[2024-05-22 16:55:06] [INFO ] Input system was already deterministic with 1576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 144 transition count 1576
Applied a total of 3 rules in 5 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:07] [INFO ] Flatten gal took : 43 ms
[2024-05-22 16:55:07] [INFO ] Flatten gal took : 54 ms
[2024-05-22 16:55:07] [INFO ] Input system was already deterministic with 1576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 144 transition count 1576
Applied a total of 3 rules in 5 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:07] [INFO ] Flatten gal took : 45 ms
[2024-05-22 16:55:07] [INFO ] Flatten gal took : 136 ms
[2024-05-22 16:55:07] [INFO ] Input system was already deterministic with 1576 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Graph (complete) has 3028 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:07] [INFO ] Flatten gal took : 45 ms
[2024-05-22 16:55:07] [INFO ] Flatten gal took : 62 ms
[2024-05-22 16:55:07] [INFO ] Input system was already deterministic with 1576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 146 transition count 1576
Applied a total of 1 rules in 5 ms. Remains 146 /147 variables (removed 1) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 146/147 places, 1576/1576 transitions.
[2024-05-22 16:55:07] [INFO ] Flatten gal took : 45 ms
[2024-05-22 16:55:08] [INFO ] Flatten gal took : 47 ms
[2024-05-22 16:55:08] [INFO ] Input system was already deterministic with 1576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 144 transition count 1576
Applied a total of 3 rules in 5 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:08] [INFO ] Flatten gal took : 123 ms
[2024-05-22 16:55:08] [INFO ] Flatten gal took : 76 ms
[2024-05-22 16:55:08] [INFO ] Input system was already deterministic with 1576 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Graph (complete) has 3028 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:08] [INFO ] Flatten gal took : 68 ms
[2024-05-22 16:55:08] [INFO ] Flatten gal took : 91 ms
[2024-05-22 16:55:08] [INFO ] Input system was already deterministic with 1576 transitions.
RANDOM walk for 2947 steps (24 resets) in 32 ms. (89 steps per ms) remains 0/1 properties
FORMULA DoubleLock-PT-p2s2-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 1576/1576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 144 transition count 1576
Applied a total of 3 rules in 4 ms. Remains 144 /147 variables (removed 3) and now considering 1576/1576 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 144/147 places, 1576/1576 transitions.
[2024-05-22 16:55:09] [INFO ] Flatten gal took : 79 ms
[2024-05-22 16:55:09] [INFO ] Flatten gal took : 54 ms
[2024-05-22 16:55:09] [INFO ] Input system was already deterministic with 1576 transitions.
[2024-05-22 16:55:09] [INFO ] Flatten gal took : 69 ms
[2024-05-22 16:55:09] [INFO ] Flatten gal took : 87 ms
[2024-05-22 16:55:09] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 16:55:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 147 places, 1576 transitions and 6368 arcs took 27 ms.
Total runtime 157149 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p2s2
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 147
TRANSITIONS: 1576
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.004s]
SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 650
MODEL NAME: /home/mcc/execution/408/model
147 places, 1576 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716397692682
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
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="DoubleLock-PT-p2s2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleLock-PT-p2s2, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131500617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;