About the Execution of 2024-gold for AutoFlight-PT-48b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15679.920 | 969136.00 | 2195633.00 | 1313.60 | 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/mcc2025-input.r014-tall-174853743900362.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is AutoFlight-PT-48b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743900362
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 956K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748549788120
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-48b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:16:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 20:16:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:16:29] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2025-05-29 20:16:29] [INFO ] Transformed 3950 places.
[2025-05-29 20:16:29] [INFO ] Transformed 3936 transitions.
[2025-05-29 20:16:29] [INFO ] Found NUPN structural information;
[2025-05-29 20:16:29] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 421 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1708 transitions
Trivial Post-agglo rules discarded 1708 transitions
Performed 1708 trivial Post agglomeration. Transition count delta: 1708
Iterating post reduction 0 with 1708 rules applied. Total rules applied 1708 place count 3950 transition count 2228
Reduce places removed 1708 places and 0 transitions.
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 1996 rules applied. Total rules applied 3704 place count 2242 transition count 1940
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 3800 place count 2146 transition count 1940
Performed 507 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 507 Pre rules applied. Total rules applied 3800 place count 2146 transition count 1433
Deduced a syphon composed of 507 places in 46 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 4814 place count 1639 transition count 1433
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 1 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 6214 place count 939 transition count 733
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 6214 rules in 542 ms. Remains 939 /3950 variables (removed 3011) and now considering 733/3936 (removed 3203) transitions.
// Phase 1: matrix 733 rows 939 cols
[2025-05-29 20:16:30] [INFO ] Computed 258 invariants in 47 ms
[2025-05-29 20:16:31] [INFO ] Implicit Places using invariants in 1432 ms returned [255, 258, 261, 264, 267, 270, 273, 276, 279, 282, 285, 288, 291, 294, 297, 300, 303, 306, 309, 312, 315, 318, 321, 324, 327, 330, 333, 336, 339, 342, 345, 348, 351, 354, 357, 360, 363, 366, 369, 372, 375, 378, 381, 384, 387, 390, 393, 396, 938]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1463 ms to find 49 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 890/3950 places, 733/3936 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 890 transition count 685
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 842 transition count 685
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 0 with 104 rules applied. Total rules applied 200 place count 790 transition count 633
Applied a total of 200 rules in 39 ms. Remains 790 /890 variables (removed 100) and now considering 633/733 (removed 100) transitions.
// Phase 1: matrix 633 rows 790 cols
[2025-05-29 20:16:31] [INFO ] Computed 209 invariants in 4 ms
[2025-05-29 20:16:32] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-05-29 20:16:32] [INFO ] Invariant cache hit.
[2025-05-29 20:16:32] [INFO ] State equation strengthened by 192 read => feed constraints.
[2025-05-29 20:16:36] [INFO ] Implicit Places using invariants and state equation in 4145 ms returned []
Implicit Place search using SMT with State Equation took 4566 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 790/3950 places, 633/3936 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6628 ms. Remains : 790/3950 places, 633/3936 transitions.
Discarding 144 transitions out of 633. Remains 489
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (345 resets) in 4007 ms. (9 steps per ms) remains 224/488 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 224/224 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 224/224 properties
[2025-05-29 20:16:37] [INFO ] Invariant cache hit.
[2025-05-29 20:16:37] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 283/670 variables, 149/536 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 283/819 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1423 variables, and 819 constraints, problems are : Problem set: 0 solved, 224 unsolved in 5016 ms.
Refiners :[Domain max(s): 670/790 constraints, Positive P Invariants (semi-flows): 149/209 constraints, State Equation: 0/790 constraints, ReadFeed: 0/192 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 283/670 variables, 149/536 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 283/819 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2025-05-29 20:16:44] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 24 ms to minimize.
[2025-05-29 20:16:44] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 3 ms to minimize.
[2025-05-29 20:16:44] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2025-05-29 20:16:44] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2025-05-29 20:16:45] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1423 variables, and 832 constraints, problems are : Problem set: 0 solved, 224 unsolved in 5015 ms.
Refiners :[Domain max(s): 670/790 constraints, Positive P Invariants (semi-flows): 149/209 constraints, State Equation: 0/790 constraints, ReadFeed: 0/192 constraints, PredecessorRefiner: 0/224 constraints, Known Traps: 13/13 constraints]
After SMT, in 10259ms problems are : Problem set: 0 solved, 224 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 387 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 633/633 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 607
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 607
Free-agglomeration rule applied 56 times.
Iterating global reduction 0 with 56 rules applied. Total rules applied 108 place count 764 transition count 551
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 164 place count 708 transition count 551
Applied a total of 164 rules in 106 ms. Remains 708 /790 variables (removed 82) and now considering 551/633 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 708/790 places, 551/633 transitions.
RANDOM walk for 4000000 steps (59560 resets) in 71692 ms. (55 steps per ms) remains 98/224 properties
BEST_FIRST walk for 400004 steps (76 resets) in 2401 ms. (166 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (76 resets) in 1751 ms. (228 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (76 resets) in 1806 ms. (221 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (76 resets) in 1768 ms. (226 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1857 ms. (215 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1890 ms. (211 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (141 resets) in 1879 ms. (212 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1886 ms. (211 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1812 ms. (220 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1387 ms. (288 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1847 ms. (216 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1838 ms. (217 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1833 ms. (218 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1811 ms. (220 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (144 resets) in 1390 ms. (287 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1380 ms. (289 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1379 ms. (289 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1361 ms. (293 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (140 resets) in 1371 ms. (291 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1359 ms. (294 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1364 ms. (293 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (142 resets) in 1367 ms. (292 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1373 ms. (291 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1370 ms. (291 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1367 ms. (292 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1362 ms. (293 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (140 resets) in 1374 ms. (290 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1382 ms. (289 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (142 resets) in 1793 ms. (222 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1906 ms. (209 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (145 resets) in 1815 ms. (220 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1858 ms. (215 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1841 ms. (217 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1842 ms. (217 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1897 ms. (210 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (141 resets) in 1856 ms. (215 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1402 ms. (285 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1374 ms. (290 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1370 ms. (291 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1366 ms. (292 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1859 ms. (215 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1882 ms. (212 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1800 ms. (222 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1785 ms. (223 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1878 ms. (212 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1751 ms. (228 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (143 resets) in 1921 ms. (208 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1805 ms. (221 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (144 resets) in 1838 ms. (217 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (142 resets) in 1833 ms. (218 steps per ms) remains 98/98 properties
// Phase 1: matrix 551 rows 708 cols
[2025-05-29 20:17:31] [INFO ] Computed 209 invariants in 5 ms
[2025-05-29 20:17:31] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 297/454 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 254/708 variables, 168/209 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2025-05-29 20:17:35] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:17:36] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2025-05-29 20:17:36] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/708 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/708 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 551/1259 variables, 708/927 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1259 variables, 248/1175 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1259 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/1259 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1259/1259 variables, and 1175 constraints, problems are : Problem set: 0 solved, 98 unsolved in 24753 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 708/708 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 297/454 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 254/708 variables, 168/209 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/708 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:17:58] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:17:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/708 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/708 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 551/1259 variables, 708/939 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1259 variables, 248/1187 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1259 variables, 98/1285 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-29 20:18:16] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2025-05-29 20:18:22] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1259 variables, 2/1287 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1259/1259 variables, and 1287 constraints, problems are : Problem set: 0 solved, 98 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 708/708 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 24/24 constraints]
After SMT, in 69831ms problems are : Problem set: 0 solved, 98 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 551/551 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 686 transition count 529
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 686 transition count 529
Free-agglomeration rule applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 60 place count 686 transition count 513
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 76 place count 670 transition count 513
Applied a total of 76 rules in 93 ms. Remains 670 /708 variables (removed 38) and now considering 513/551 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 670/708 places, 513/551 transitions.
RANDOM walk for 4000000 steps (39777 resets) in 69523 ms. (57 steps per ms) remains 94/98 properties
BEST_FIRST walk for 400004 steps (98 resets) in 1660 ms. (240 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (97 resets) in 1650 ms. (242 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (97 resets) in 1658 ms. (241 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (96 resets) in 1649 ms. (242 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (162 resets) in 1839 ms. (217 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (168 resets) in 1843 ms. (216 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (166 resets) in 1832 ms. (218 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (152 resets) in 1810 ms. (220 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1847 ms. (216 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (162 resets) in 1808 ms. (221 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (163 resets) in 1841 ms. (217 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (160 resets) in 1778 ms. (224 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (169 resets) in 1782 ms. (224 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1765 ms. (226 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (162 resets) in 1829 ms. (218 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1787 ms. (223 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (163 resets) in 1813 ms. (220 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (158 resets) in 1765 ms. (226 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400002 steps (160 resets) in 1796 ms. (222 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (156 resets) in 1776 ms. (225 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1827 ms. (218 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (158 resets) in 1776 ms. (225 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1868 ms. (214 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (159 resets) in 1792 ms. (223 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (163 resets) in 1849 ms. (216 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (156 resets) in 1790 ms. (223 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (168 resets) in 1888 ms. (211 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (157 resets) in 2163 ms. (184 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (158 resets) in 2288 ms. (174 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1778 ms. (224 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (163 resets) in 1877 ms. (212 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (159 resets) in 1828 ms. (218 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (166 resets) in 1856 ms. (215 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1866 ms. (214 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1801 ms. (221 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (168 resets) in 1854 ms. (215 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1774 ms. (225 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (151 resets) in 1808 ms. (221 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (170 resets) in 1844 ms. (216 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (164 resets) in 1834 ms. (217 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (160 resets) in 1833 ms. (218 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1810 ms. (220 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (155 resets) in 1810 ms. (220 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (159 resets) in 1792 ms. (223 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (158 resets) in 1839 ms. (217 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1815 ms. (220 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (154 resets) in 1824 ms. (219 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (162 resets) in 1824 ms. (219 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (162 resets) in 1812 ms. (220 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1848 ms. (216 steps per ms) remains 94/94 properties
Interrupted probabilistic random walk after 13208892 steps, run timeout after 150001 ms. (steps per millisecond=88 ) properties seen :46 out of 94
Probabilistic random walk after 13208892 steps, saw 1529051 distinct states, run finished after 150008 ms. (steps per millisecond=88 ) properties seen :46
// Phase 1: matrix 513 rows 670 cols
[2025-05-29 20:22:02] [INFO ] Computed 209 invariants in 5 ms
[2025-05-29 20:22:02] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 355/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 220/670 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 513/1183 variables, 670/879 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1183 variables, 264/1143 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1183 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/1183 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1183/1183 variables, and 1143 constraints, problems are : Problem set: 0 solved, 48 unsolved in 8032 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 670/670 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 355/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 220/670 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 513/1183 variables, 670/879 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1183 variables, 264/1143 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1183 variables, 48/1191 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1183 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/1183 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1183/1183 variables, and 1191 constraints, problems are : Problem set: 0 solved, 48 unsolved in 13496 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 670/670 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 21570ms problems are : Problem set: 0 solved, 48 unsolved
Fused 48 Parikh solutions to 47 different solutions.
Parikh walk visited 0 properties in 10144 ms.
Support contains 95 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 513/513 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 668 transition count 511
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 668 transition count 511
Applied a total of 4 rules in 44 ms. Remains 668 /670 variables (removed 2) and now considering 511/513 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 668/670 places, 511/513 transitions.
RANDOM walk for 4000000 steps (39642 resets) in 81292 ms. (49 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (101 resets) in 1564 ms. (255 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (99 resets) in 1567 ms. (255 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (169 resets) in 1753 ms. (228 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (159 resets) in 1720 ms. (232 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (170 resets) in 1759 ms. (227 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (159 resets) in 1733 ms. (230 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (168 resets) in 1746 ms. (228 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (155 resets) in 1693 ms. (236 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (169 resets) in 1728 ms. (231 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (158 resets) in 1698 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (170 resets) in 1720 ms. (232 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (158 resets) in 1651 ms. (242 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (167 resets) in 1754 ms. (227 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (163 resets) in 1655 ms. (241 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (163 resets) in 1718 ms. (232 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (155 resets) in 1714 ms. (233 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (161 resets) in 1760 ms. (227 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (159 resets) in 1700 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (170 resets) in 1767 ms. (226 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (154 resets) in 1724 ms. (231 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (168 resets) in 1704 ms. (234 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1691 ms. (236 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (158 resets) in 1700 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1734 ms. (230 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (153 resets) in 1736 ms. (230 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (161 resets) in 1716 ms. (232 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (170 resets) in 1683 ms. (237 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (156 resets) in 1681 ms. (237 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1683 ms. (237 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (158 resets) in 1680 ms. (237 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1721 ms. (232 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (161 resets) in 1724 ms. (231 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1690 ms. (236 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (162 resets) in 1688 ms. (236 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (153 resets) in 1710 ms. (233 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (154 resets) in 1716 ms. (232 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (156 resets) in 1765 ms. (226 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (165 resets) in 1704 ms. (234 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (164 resets) in 1684 ms. (237 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (159 resets) in 1713 ms. (233 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1735 ms. (230 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (161 resets) in 1752 ms. (228 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (151 resets) in 1742 ms. (229 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (157 resets) in 1693 ms. (236 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (161 resets) in 1709 ms. (233 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (152 resets) in 1693 ms. (236 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (158 resets) in 1688 ms. (236 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (161 resets) in 1668 ms. (239 steps per ms) remains 48/48 properties
Interrupted probabilistic random walk after 12967927 steps, run timeout after 147001 ms. (steps per millisecond=88 ) properties seen :0 out of 48
Probabilistic random walk after 12967927 steps, saw 1494207 distinct states, run finished after 147001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 511 rows 668 cols
[2025-05-29 20:25:50] [INFO ] Computed 209 invariants in 9 ms
[2025-05-29 20:25:50] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 355/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 218/668 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 511/1179 variables, 668/877 constraints. Problems are: Problem set: 0 solved, 48 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1179 variables, 264/1141 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1179 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/1179 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1179/1179 variables, and 1141 constraints, problems are : Problem set: 0 solved, 48 unsolved in 4588 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 668/668 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 355/450 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 218/668 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 511/1179 variables, 668/877 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1179 variables, 264/1141 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1179 variables, 48/1189 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1179 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/1179 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1179/1179 variables, and 1189 constraints, problems are : Problem set: 0 solved, 48 unsolved in 15691 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 668/668 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 20318ms problems are : Problem set: 0 solved, 48 unsolved
Fused 48 Parikh solutions to 47 different solutions.
Parikh walk visited 29 properties in 6366 ms.
Support contains 37 out of 668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 668/668 places, 511/511 transitions.
Free-agglomeration rule applied 38 times.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 668 transition count 473
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 76 place count 630 transition count 473
Applied a total of 76 rules in 53 ms. Remains 630 /668 variables (removed 38) and now considering 473/511 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 630/668 places, 473/511 transitions.
RANDOM walk for 4000000 steps (43596 resets) in 63048 ms. (63 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (205 resets) in 1713 ms. (233 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (201 resets) in 1720 ms. (232 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (271 resets) in 1790 ms. (223 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (295 resets) in 1814 ms. (220 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (285 resets) in 1831 ms. (218 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (287 resets) in 1842 ms. (217 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (273 resets) in 1788 ms. (223 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (267 resets) in 1819 ms. (219 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (300 resets) in 1820 ms. (219 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (287 resets) in 1775 ms. (225 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (283 resets) in 1790 ms. (223 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (281 resets) in 1793 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (272 resets) in 1800 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (286 resets) in 1726 ms. (231 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (290 resets) in 1769 ms. (225 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (296 resets) in 1764 ms. (226 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (298 resets) in 1757 ms. (227 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400004 steps (295 resets) in 1784 ms. (224 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (301 resets) in 1765 ms. (226 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 6942556 steps, run timeout after 84001 ms. (steps per millisecond=82 ) properties seen :0 out of 18
Probabilistic random walk after 6942556 steps, saw 1017084 distinct states, run finished after 84001 ms. (steps per millisecond=82 ) properties seen :0
// Phase 1: matrix 473 rows 630 cols
[2025-05-29 20:28:10] [INFO ] Computed 209 invariants in 5 ms
[2025-05-29 20:28:10] [INFO ] State equation strengthened by 302 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 355/390 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 240/630 variables, 190/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 473/1103 variables, 630/839 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 302/1141 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/1103 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 1141 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1876 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 630/630 constraints, ReadFeed: 302/302 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 355/390 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 240/630 variables, 190/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 473/1103 variables, 630/839 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 302/1141 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 18/1159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1103 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/1103 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 1159 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5954 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 630/630 constraints, ReadFeed: 302/302 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 7874ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 11 properties in 16325 ms.
Support contains 14 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 473/473 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 472
Free-agglomeration rule applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 24 place count 629 transition count 450
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 46 place count 607 transition count 450
Applied a total of 46 rules in 50 ms. Remains 607 /630 variables (removed 23) and now considering 450/473 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 607/630 places, 450/473 transitions.
RANDOM walk for 4000000 steps (21415 resets) in 47758 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3799365 steps (1958 resets) in 17763 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3758132 steps (1732 resets) in 15975 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (1909 resets) in 17565 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3888422 steps (1811 resets) in 17061 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3565083 steps (1732 resets) in 19962 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3581560 steps (1686 resets) in 19507 ms. (183 steps per ms) remains 6/7 properties
BEST_FIRST walk for 3575672 steps (1708 resets) in 18502 ms. (193 steps per ms) remains 6/6 properties
// Phase 1: matrix 450 rows 607 cols
[2025-05-29 20:29:24] [INFO ] Computed 209 invariants in 3 ms
[2025-05-29 20:29:24] [INFO ] State equation strengthened by 324 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 343/355 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 252/607 variables, 202/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 450/1057 variables, 607/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 324/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1057 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 1140 constraints, problems are : Problem set: 0 solved, 6 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 607/607 constraints, ReadFeed: 324/324 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 343/355 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 252/607 variables, 202/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 450/1057 variables, 607/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 324/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 6/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1057 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1057 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 1146 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1956 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 607/607 constraints, ReadFeed: 324/324 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2696ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4701 ms.
Support contains 12 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 450/450 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 607 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 605 transition count 448
Applied a total of 4 rules in 38 ms. Remains 605 /607 variables (removed 2) and now considering 448/450 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 605/607 places, 448/450 transitions.
RANDOM walk for 4000000 steps (21643 resets) in 45536 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3900522 steps (2142 resets) in 18020 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3962752 steps (1941 resets) in 16871 ms. (234 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3849520 steps (1786 resets) in 16073 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3651259 steps (1653 resets) in 18334 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3809579 steps (1868 resets) in 16645 ms. (228 steps per ms) remains 5/6 properties
BEST_FIRST walk for 3964882 steps (1959 resets) in 16712 ms. (237 steps per ms) remains 5/5 properties
// Phase 1: matrix 448 rows 605 cols
[2025-05-29 20:30:16] [INFO ] Computed 209 invariants in 2 ms
[2025-05-29 20:30:16] [INFO ] State equation strengthened by 326 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 342/352 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 253/605 variables, 203/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/605 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 448/1053 variables, 605/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 326/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1053 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1053/1053 variables, and 1140 constraints, problems are : Problem set: 0 solved, 5 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 605/605 constraints, ReadFeed: 326/326 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 342/352 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 253/605 variables, 203/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/605 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 448/1053 variables, 605/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1053 variables, 326/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1053 variables, 5/1145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1053 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1053 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1053/1053 variables, and 1145 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2198 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 605/605 constraints, ReadFeed: 326/326 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2874ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3617 ms.
Support contains 10 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 448/448 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 605 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 603 transition count 446
Applied a total of 4 rules in 24 ms. Remains 603 /605 variables (removed 2) and now considering 446/448 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 603/605 places, 446/448 transitions.
RANDOM walk for 4000000 steps (21490 resets) in 45974 ms. (87 steps per ms) remains 5/5 properties
BEST_FIRST walk for 3942266 steps (2269 resets) in 18380 ms. (214 steps per ms) remains 5/5 properties
BEST_FIRST walk for 3913738 steps (1875 resets) in 16173 ms. (241 steps per ms) remains 5/5 properties
BEST_FIRST walk for 3819364 steps (1824 resets) in 15813 ms. (241 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (1949 resets) in 16589 ms. (241 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000004 steps (1907 resets) in 16617 ms. (240 steps per ms) remains 4/4 properties
// Phase 1: matrix 446 rows 603 cols
[2025-05-29 20:31:01] [INFO ] Computed 209 invariants in 1 ms
[2025-05-29 20:31:01] [INFO ] State equation strengthened by 328 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 341/349 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 254/603 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 446/1049 variables, 603/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1049 variables, 328/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1049 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1049 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1049/1049 variables, and 1140 constraints, problems are : Problem set: 0 solved, 4 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 603/603 constraints, ReadFeed: 328/328 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 341/349 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 254/603 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 446/1049 variables, 603/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1049 variables, 328/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1049 variables, 4/1144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1049 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1049 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1049/1049 variables, and 1144 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 603/603 constraints, ReadFeed: 328/328 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1973ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3329 ms.
Support contains 8 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 446/446 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 603 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 601 transition count 444
Applied a total of 4 rules in 24 ms. Remains 601 /603 variables (removed 2) and now considering 444/446 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 601/603 places, 444/446 transitions.
RANDOM walk for 4000000 steps (21514 resets) in 47127 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3821273 steps (2213 resets) in 18006 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3906921 steps (1870 resets) in 16103 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (2017 resets) in 16196 ms. (246 steps per ms) remains 3/4 properties
BEST_FIRST walk for 3912363 steps (1926 resets) in 15869 ms. (246 steps per ms) remains 3/3 properties
// Phase 1: matrix 444 rows 601 cols
[2025-05-29 20:31:44] [INFO ] Computed 209 invariants in 3 ms
[2025-05-29 20:31:44] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 255/601 variables, 205/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 444/1045 variables, 601/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1045 variables, 330/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1045 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1045 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1045/1045 variables, and 1140 constraints, problems are : Problem set: 0 solved, 3 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 601/601 constraints, ReadFeed: 330/330 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/346 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 255/601 variables, 205/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 444/1045 variables, 601/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1045 variables, 330/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1045 variables, 3/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1045 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1045 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1045/1045 variables, and 1143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 601/601 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1368ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1598 ms.
Support contains 6 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 444/444 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 601 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 599 transition count 442
Applied a total of 4 rules in 22 ms. Remains 599 /601 variables (removed 2) and now considering 442/444 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 599/601 places, 442/444 transitions.
RANDOM walk for 4000000 steps (21224 resets) in 42358 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 3734312 steps (2280 resets) in 16968 ms. (220 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (1926 resets) in 15752 ms. (253 steps per ms) remains 2/3 properties
BEST_FIRST walk for 3541702 steps (1712 resets) in 17759 ms. (199 steps per ms) remains 2/2 properties
// Phase 1: matrix 442 rows 599 cols
[2025-05-29 20:32:16] [INFO ] Computed 209 invariants in 2 ms
[2025-05-29 20:32:16] [INFO ] State equation strengthened by 332 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 339/343 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/599 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 442/1041 variables, 599/808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 332/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1041 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1041/1041 variables, and 1140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 599/599 constraints, ReadFeed: 332/332 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 339/343 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/599 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 442/1041 variables, 599/808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 332/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 2/1142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1041 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1041/1041 variables, and 1142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 209/209 constraints, State Equation: 599/599 constraints, ReadFeed: 332/332 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1982ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 726 ms.
Support contains 4 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 442/442 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 599 transition count 440
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 597 transition count 440
Applied a total of 4 rules in 22 ms. Remains 597 /599 variables (removed 2) and now considering 440/442 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 597/599 places, 440/442 transitions.
RANDOM walk for 4000000 steps (20934 resets) in 43415 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 3832281 steps (2321 resets) in 17191 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 117951 steps (44 resets) in 443 ms. (265 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 489 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 967869 ms.
ITS solved all properties within timeout
BK_STOP 1748550757256
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
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="AutoFlight-PT-48b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is AutoFlight-PT-48b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r014-tall-174853743900362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;