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.r012-smll-171620124200224.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 Anderson-PT-09, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124200224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716264465416

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 04:07:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-21 04:07:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:07:47] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-05-21 04:07:47] [INFO ] Transformed 505 places.
[2024-05-21 04:07:47] [INFO ] Transformed 1845 transitions.
[2024-05-21 04:07:47] [INFO ] Found NUPN structural information;
[2024-05-21 04:07:47] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 575 ms.
Built sparse matrix representations for Structural reductions in 34 ms.21696KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 200 ms. Remains 505 /505 variables (removed 0) and now considering 1845/1845 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 225 ms. Remains : 505/505 places, 1845/1845 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 85 ms. Remains 505 /505 variables (removed 0) and now considering 1845/1845 (removed 0) transitions.
// Phase 1: matrix 1845 rows 505 cols
[2024-05-21 04:07:48] [INFO ] Computed 21 invariants in 80 ms
[2024-05-21 04:07:49] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-21 04:07:49] [INFO ] Invariant cache hit.
[2024-05-21 04:07:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 04:07:50] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
[2024-05-21 04:07:50] [INFO ] Redundant transitions in 122 ms returned []
Running 1836 sub problems to find dead transitions.
[2024-05-21 04:07:50] [INFO ] Invariant cache hit.
[2024-05-21 04:07:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 505/505 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 10/515 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 11/526 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
[2024-05-21 04:08:21] [INFO ] Deduced a trap composed of 82 places in 586 ms of which 55 ms to minimize.
[2024-05-21 04:08:22] [INFO ] Deduced a trap composed of 245 places in 589 ms of which 6 ms to minimize.
[2024-05-21 04:08:22] [INFO ] Deduced a trap composed of 161 places in 518 ms of which 6 ms to minimize.
[2024-05-21 04:08:23] [INFO ] Deduced a trap composed of 247 places in 604 ms of which 7 ms to minimize.
[2024-05-21 04:08:24] [INFO ] Deduced a trap composed of 169 places in 549 ms of which 5 ms to minimize.
[2024-05-21 04:08:24] [INFO ] Deduced a trap composed of 215 places in 535 ms of which 5 ms to minimize.
[2024-05-21 04:08:25] [INFO ] Deduced a trap composed of 281 places in 636 ms of which 5 ms to minimize.
[2024-05-21 04:08:25] [INFO ] Deduced a trap composed of 281 places in 616 ms of which 8 ms to minimize.
[2024-05-21 04:08:26] [INFO ] Deduced a trap composed of 124 places in 602 ms of which 6 ms to minimize.
[2024-05-21 04:08:27] [INFO ] Deduced a trap composed of 235 places in 550 ms of which 5 ms to minimize.
[2024-05-21 04:08:27] [INFO ] Deduced a trap composed of 326 places in 606 ms of which 6 ms to minimize.
SMT process timed out in 37013ms, After SMT, problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 37089ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 39459 ms. Remains : 505/505 places, 1845/1845 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4157 ms (no deadlock found). (steps per millisecond=300 )
Random directed walk for 1250001 steps, including 0 resets, run took 4001 ms (no deadlock found). (steps per millisecond=312 )
[2024-05-21 04:08:36] [INFO ] Invariant cache hit.
[2024-05-21 04:08:36] [INFO ] [Real]Absence check using 10 positive place invariants in 36 ms returned sat
[2024-05-21 04:08:37] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 669 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 505 transition count 1773
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 433 transition count 1773
Applied a total of 144 rules in 85 ms. Remains 433 /505 variables (removed 72) and now considering 1773/1845 (removed 72) transitions.
// Phase 1: matrix 1773 rows 433 cols
[2024-05-21 04:08:37] [INFO ] Computed 21 invariants in 19 ms
[2024-05-21 04:08:39] [INFO ] Implicit Places using invariants in 1679 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1692 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 432/505 places, 1773/1845 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 432 transition count 1692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 351 transition count 1692
Applied a total of 162 rules in 20 ms. Remains 351 /432 variables (removed 81) and now considering 1692/1773 (removed 81) transitions.
// Phase 1: matrix 1692 rows 351 cols
[2024-05-21 04:08:39] [INFO ] Computed 20 invariants in 18 ms
[2024-05-21 04:08:40] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2024-05-21 04:08:40] [INFO ] Invariant cache hit.
[2024-05-21 04:08:40] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 04:08:45] [INFO ] Implicit Places using invariants and state equation in 4948 ms returned []
Implicit Place search using SMT with State Equation took 6060 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 351/505 places, 1692/1845 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 7859 ms. Remains : 351/505 places, 1692/1845 transitions.
Initial state reduction rules removed 9 formulas.
RANDOM walk for 40000 steps (8 resets) in 8236 ms. (4 steps per ms) remains 782/1683 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 782/782 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 782/782 properties
[2024-05-21 04:08:47] [INFO ] Invariant cache hit.
[2024-05-21 04:08:47] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 151/2043 variables, and 152 constraints, problems are : Problem set: 0 solved, 782 unsolved in 5061 ms.
Refiners :[Domain max(s): 151/351 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 1/10 constraints, State Equation: 0/351 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (OVERLAPS) 200/351 variables, 10/162 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 200/362 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 9/371 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/2043 variables, and 371 constraints, problems are : Problem set: 0 solved, 782 unsolved in 5056 ms.
Refiners :[Domain max(s): 351/351 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/351 constraints, ReadFeed: 0/135 constraints, PredecessorRefiner: 0/782 constraints, Known Traps: 0/0 constraints]
After SMT, in 12527ms problems are : Problem set: 0 solved, 782 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 151 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 1692/1692 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 317 transition count 1658
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 317 transition count 1658
Applied a total of 68 rules in 87 ms. Remains 317 /351 variables (removed 34) and now considering 1658/1692 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 317/351 places, 1658/1692 transitions.
RANDOM walk for 3115960 steps (8 resets) in 120004 ms. (25 steps per ms) remains 290/782 properties
BEST_FIRST walk for 40001 steps (8 resets) in 326 ms. (122 steps per ms) remains 278/290 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 278/278 properties
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 276/278 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 275/276 properties
BEST_FIRST walk for 40003 steps (8 resets) in 669 ms. (59 steps per ms) remains 271/275 properties
BEST_FIRST walk for 40003 steps (8 resets) in 393 ms. (101 steps per ms) remains 271/271 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 271/271 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 267/271 properties
BEST_FIRST walk for 40001 steps (8 resets) in 285 ms. (139 steps per ms) remains 267/267 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 266/267 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 266/266 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 266/266 properties
BEST_FIRST walk for 40002 steps (8 resets) in 288 ms. (138 steps per ms) remains 264/266 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 264/264 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 263/264 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 158/263 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 155/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 151/155 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 149/151 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 147/149 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 147/147 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 147/147 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 84/147 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 81/84 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 77/81 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 77/77 properties
BEST_FIRST walk for 40001 steps (8 resets) in 154 ms. (258 steps per ms) remains 77/77 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 77/77 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 77/77 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 76/77 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 75/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 75/75 properties
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 74/75 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 73/74 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 72/73 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40001 steps (8 resets) in 160 ms. (248 steps per ms) remains 72/72 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 71/72 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 71/71 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 70/71 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 68/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 68/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 67/68 properties
BEST_FIRST walk for 40001 steps (8 resets) in 146 ms. (272 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40001 steps (8 resets) in 139 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 63/67 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 61/63 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40001 steps (8 resets) in 136 ms. (291 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 60/61 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 60/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 60/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 60/60 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 60/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 60/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 60/60 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 54/60 properties
BEST_FIRST walk for 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 50/54 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 50/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 48/50 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 48/48 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 48/48 properties
// Phase 1: matrix 1658 rows 317 cols
[2024-05-21 04:09:34] [INFO ] Computed 20 invariants in 10 ms
[2024-05-21 04:09:34] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 256/293 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 23/316 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-21 04:09:36] [INFO ] Deduced a trap composed of 118 places in 426 ms of which 4 ms to minimize.
[2024-05-21 04:09:36] [INFO ] Deduced a trap composed of 66 places in 351 ms of which 3 ms to minimize.
[2024-05-21 04:09:37] [INFO ] Deduced a trap composed of 145 places in 451 ms of which 4 ms to minimize.
[2024-05-21 04:09:37] [INFO ] Deduced a trap composed of 105 places in 401 ms of which 4 ms to minimize.
[2024-05-21 04:09:38] [INFO ] Deduced a trap composed of 97 places in 395 ms of which 4 ms to minimize.
[2024-05-21 04:09:38] [INFO ] Deduced a trap composed of 53 places in 397 ms of which 4 ms to minimize.
[2024-05-21 04:09:39] [INFO ] Deduced a trap composed of 84 places in 490 ms of which 3 ms to minimize.
[2024-05-21 04:09:39] [INFO ] Deduced a trap composed of 122 places in 463 ms of which 4 ms to minimize.
[2024-05-21 04:09:40] [INFO ] Deduced a trap composed of 109 places in 445 ms of which 3 ms to minimize.
[2024-05-21 04:09:40] [INFO ] Deduced a trap composed of 95 places in 470 ms of which 4 ms to minimize.
[2024-05-21 04:09:41] [INFO ] Deduced a trap composed of 121 places in 488 ms of which 4 ms to minimize.
[2024-05-21 04:09:41] [INFO ] Deduced a trap composed of 48 places in 592 ms of which 4 ms to minimize.
[2024-05-21 04:09:42] [INFO ] Deduced a trap composed of 89 places in 483 ms of which 4 ms to minimize.
[2024-05-21 04:09:42] [INFO ] Deduced a trap composed of 72 places in 401 ms of which 4 ms to minimize.
[2024-05-21 04:09:43] [INFO ] Deduced a trap composed of 135 places in 494 ms of which 4 ms to minimize.
[2024-05-21 04:09:43] [INFO ] Deduced a trap composed of 111 places in 472 ms of which 4 ms to minimize.
[2024-05-21 04:09:44] [INFO ] Deduced a trap composed of 76 places in 466 ms of which 3 ms to minimize.
[2024-05-21 04:09:44] [INFO ] Deduced a trap composed of 169 places in 417 ms of which 3 ms to minimize.
[2024-05-21 04:09:45] [INFO ] Deduced a trap composed of 53 places in 422 ms of which 4 ms to minimize.
[2024-05-21 04:09:45] [INFO ] Deduced a trap composed of 112 places in 441 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-21 04:09:46] [INFO ] Deduced a trap composed of 117 places in 409 ms of which 4 ms to minimize.
[2024-05-21 04:09:46] [INFO ] Deduced a trap composed of 154 places in 387 ms of which 3 ms to minimize.
[2024-05-21 04:09:47] [INFO ] Deduced a trap composed of 114 places in 446 ms of which 4 ms to minimize.
[2024-05-21 04:09:47] [INFO ] Deduced a trap composed of 105 places in 479 ms of which 5 ms to minimize.
[2024-05-21 04:09:48] [INFO ] Deduced a trap composed of 112 places in 455 ms of which 3 ms to minimize.
[2024-05-21 04:09:48] [INFO ] Deduced a trap composed of 110 places in 444 ms of which 5 ms to minimize.
[2024-05-21 04:09:48] [INFO ] Deduced a trap composed of 140 places in 416 ms of which 3 ms to minimize.
[2024-05-21 04:09:49] [INFO ] Deduced a trap composed of 77 places in 487 ms of which 4 ms to minimize.
[2024-05-21 04:09:49] [INFO ] Deduced a trap composed of 87 places in 443 ms of which 4 ms to minimize.
[2024-05-21 04:09:50] [INFO ] Deduced a trap composed of 86 places in 448 ms of which 6 ms to minimize.
[2024-05-21 04:09:50] [INFO ] Deduced a trap composed of 87 places in 455 ms of which 4 ms to minimize.
[2024-05-21 04:09:51] [INFO ] Deduced a trap composed of 100 places in 416 ms of which 3 ms to minimize.
[2024-05-21 04:09:51] [INFO ] Deduced a trap composed of 97 places in 453 ms of which 3 ms to minimize.
[2024-05-21 04:09:52] [INFO ] Deduced a trap composed of 133 places in 447 ms of which 3 ms to minimize.
[2024-05-21 04:09:52] [INFO ] Deduced a trap composed of 120 places in 379 ms of which 3 ms to minimize.
[2024-05-21 04:09:53] [INFO ] Deduced a trap composed of 72 places in 450 ms of which 3 ms to minimize.
[2024-05-21 04:09:53] [INFO ] Deduced a trap composed of 78 places in 447 ms of which 3 ms to minimize.
[2024-05-21 04:09:54] [INFO ] Deduced a trap composed of 125 places in 426 ms of which 3 ms to minimize.
[2024-05-21 04:09:54] [INFO ] Deduced a trap composed of 89 places in 462 ms of which 3 ms to minimize.
[2024-05-21 04:09:55] [INFO ] Deduced a trap composed of 70 places in 473 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-21 04:09:56] [INFO ] Deduced a trap composed of 128 places in 458 ms of which 4 ms to minimize.
[2024-05-21 04:09:56] [INFO ] Deduced a trap composed of 124 places in 449 ms of which 3 ms to minimize.
[2024-05-21 04:09:56] [INFO ] Deduced a trap composed of 87 places in 474 ms of which 4 ms to minimize.
[2024-05-21 04:09:57] [INFO ] Deduced a trap composed of 111 places in 469 ms of which 4 ms to minimize.
[2024-05-21 04:09:57] [INFO ] Deduced a trap composed of 101 places in 472 ms of which 4 ms to minimize.
[2024-05-21 04:09:58] [INFO ] Deduced a trap composed of 74 places in 451 ms of which 4 ms to minimize.
[2024-05-21 04:09:58] [INFO ] Deduced a trap composed of 100 places in 468 ms of which 4 ms to minimize.
[2024-05-21 04:09:59] [INFO ] Deduced a trap composed of 58 places in 467 ms of which 4 ms to minimize.
[2024-05-21 04:09:59] [INFO ] Deduced a trap composed of 104 places in 496 ms of which 5 ms to minimize.
[2024-05-21 04:10:00] [INFO ] Deduced a trap composed of 100 places in 453 ms of which 3 ms to minimize.
[2024-05-21 04:10:00] [INFO ] Deduced a trap composed of 67 places in 465 ms of which 4 ms to minimize.
[2024-05-21 04:10:01] [INFO ] Deduced a trap composed of 134 places in 461 ms of which 4 ms to minimize.
[2024-05-21 04:10:01] [INFO ] Deduced a trap composed of 114 places in 492 ms of which 4 ms to minimize.
[2024-05-21 04:10:02] [INFO ] Deduced a trap composed of 48 places in 474 ms of which 4 ms to minimize.
[2024-05-21 04:10:02] [INFO ] Deduced a trap composed of 84 places in 466 ms of which 4 ms to minimize.
[2024-05-21 04:10:03] [INFO ] Deduced a trap composed of 114 places in 446 ms of which 4 ms to minimize.
[2024-05-21 04:10:03] [INFO ] Deduced a trap composed of 124 places in 461 ms of which 4 ms to minimize.
[2024-05-21 04:10:04] [INFO ] Deduced a trap composed of 96 places in 461 ms of which 4 ms to minimize.
[2024-05-21 04:10:04] [INFO ] Deduced a trap composed of 44 places in 474 ms of which 4 ms to minimize.
[2024-05-21 04:10:05] [INFO ] Deduced a trap composed of 50 places in 444 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-21 04:10:06] [INFO ] Deduced a trap composed of 64 places in 391 ms of which 4 ms to minimize.
[2024-05-21 04:10:07] [INFO ] Deduced a trap composed of 51 places in 478 ms of which 3 ms to minimize.
[2024-05-21 04:10:07] [INFO ] Deduced a trap composed of 77 places in 458 ms of which 4 ms to minimize.
[2024-05-21 04:10:08] [INFO ] Deduced a trap composed of 136 places in 460 ms of which 3 ms to minimize.
[2024-05-21 04:10:08] [INFO ] Deduced a trap composed of 97 places in 379 ms of which 3 ms to minimize.
[2024-05-21 04:10:09] [INFO ] Deduced a trap composed of 88 places in 452 ms of which 3 ms to minimize.
[2024-05-21 04:10:09] [INFO ] Deduced a trap composed of 75 places in 399 ms of which 3 ms to minimize.
[2024-05-21 04:10:10] [INFO ] Deduced a trap composed of 89 places in 443 ms of which 4 ms to minimize.
[2024-05-21 04:10:10] [INFO ] Deduced a trap composed of 73 places in 448 ms of which 3 ms to minimize.
[2024-05-21 04:10:10] [INFO ] Deduced a trap composed of 87 places in 447 ms of which 3 ms to minimize.
[2024-05-21 04:10:11] [INFO ] Deduced a trap composed of 103 places in 446 ms of which 4 ms to minimize.
[2024-05-21 04:10:12] [INFO ] Deduced a trap composed of 80 places in 460 ms of which 4 ms to minimize.
[2024-05-21 04:10:12] [INFO ] Deduced a trap composed of 71 places in 454 ms of which 4 ms to minimize.
[2024-05-21 04:10:12] [INFO ] Deduced a trap composed of 53 places in 456 ms of which 4 ms to minimize.
[2024-05-21 04:10:13] [INFO ] Deduced a trap composed of 72 places in 427 ms of which 3 ms to minimize.
[2024-05-21 04:10:13] [INFO ] Deduced a trap composed of 102 places in 453 ms of which 4 ms to minimize.
[2024-05-21 04:10:14] [INFO ] Deduced a trap composed of 105 places in 461 ms of which 3 ms to minimize.
[2024-05-21 04:10:14] [INFO ] Deduced a trap composed of 126 places in 463 ms of which 4 ms to minimize.
[2024-05-21 04:10:15] [INFO ] Deduced a trap composed of 132 places in 452 ms of which 4 ms to minimize.
[2024-05-21 04:10:15] [INFO ] Deduced a trap composed of 71 places in 461 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-21 04:10:17] [INFO ] Deduced a trap composed of 36 places in 454 ms of which 3 ms to minimize.
[2024-05-21 04:10:17] [INFO ] Deduced a trap composed of 65 places in 442 ms of which 3 ms to minimize.
[2024-05-21 04:10:18] [INFO ] Deduced a trap composed of 64 places in 446 ms of which 3 ms to minimize.
[2024-05-21 04:10:18] [INFO ] Deduced a trap composed of 49 places in 374 ms of which 3 ms to minimize.
[2024-05-21 04:10:19] [INFO ] Deduced a trap composed of 80 places in 458 ms of which 4 ms to minimize.
[2024-05-21 04:10:19] [INFO ] Deduced a trap composed of 88 places in 397 ms of which 3 ms to minimize.
[2024-05-21 04:10:20] [INFO ] Deduced a trap composed of 53 places in 457 ms of which 3 ms to minimize.
SMT process timed out in 45300ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Fused 48 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 1658/1658 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 241 transition count 974
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 241 transition count 974
Applied a total of 152 rules in 53 ms. Remains 241 /317 variables (removed 76) and now considering 974/1658 (removed 684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 241/317 places, 974/1658 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30039 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 934 ms. (427 steps per ms) remains 45/48 properties
BEST_FIRST walk for 400002 steps (8 resets) in 877 ms. (455 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 923 ms. (432 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 872 ms. (458 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 887 ms. (450 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400002 steps (8 resets) in 914 ms. (437 steps per ms) remains 41/43 properties
BEST_FIRST walk for 400002 steps (8 resets) in 870 ms. (459 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (8 resets) in 856 ms. (466 steps per ms) remains 38/41 properties
BEST_FIRST walk for 400001 steps (8 resets) in 803 ms. (497 steps per ms) remains 37/38 properties
BEST_FIRST walk for 400002 steps (8 resets) in 802 ms. (498 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400000 steps (8 resets) in 844 ms. (473 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 818 ms. (488 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 826 ms. (483 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 826 ms. (483 steps per ms) remains 33/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 781 ms. (511 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 784 ms. (509 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 808 ms. (494 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 788 ms. (506 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (8 resets) in 768 ms. (520 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 759 ms. (526 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 765 ms. (522 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 752 ms. (531 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 799 ms. (500 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 770 ms. (518 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 793 ms. (503 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 746 ms. (535 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 758 ms. (527 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 757 ms. (527 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 786 ms. (508 steps per ms) remains 25/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 775 ms. (515 steps per ms) remains 22/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 802 ms. (498 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 794 ms. (503 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 828 ms. (482 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 842 ms. (474 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 819 ms. (487 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (8 resets) in 787 ms. (507 steps per ms) remains 19/22 properties
// Phase 1: matrix 974 rows 241 cols
[2024-05-21 04:10:36] [INFO ] Computed 20 invariants in 7 ms
[2024-05-21 04:10:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 195/215 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 25/240 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-21 04:10:37] [INFO ] Deduced a trap composed of 87 places in 259 ms of which 3 ms to minimize.
[2024-05-21 04:10:37] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 3 ms to minimize.
[2024-05-21 04:10:37] [INFO ] Deduced a trap composed of 96 places in 290 ms of which 2 ms to minimize.
[2024-05-21 04:10:37] [INFO ] Deduced a trap composed of 97 places in 256 ms of which 3 ms to minimize.
[2024-05-21 04:10:38] [INFO ] Deduced a trap composed of 98 places in 261 ms of which 3 ms to minimize.
[2024-05-21 04:10:38] [INFO ] Deduced a trap composed of 90 places in 267 ms of which 3 ms to minimize.
[2024-05-21 04:10:38] [INFO ] Deduced a trap composed of 103 places in 275 ms of which 2 ms to minimize.
[2024-05-21 04:10:39] [INFO ] Deduced a trap composed of 82 places in 257 ms of which 2 ms to minimize.
[2024-05-21 04:10:39] [INFO ] Deduced a trap composed of 92 places in 255 ms of which 3 ms to minimize.
[2024-05-21 04:10:39] [INFO ] Deduced a trap composed of 75 places in 259 ms of which 2 ms to minimize.
[2024-05-21 04:10:39] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 3 ms to minimize.
[2024-05-21 04:10:40] [INFO ] Deduced a trap composed of 63 places in 268 ms of which 3 ms to minimize.
[2024-05-21 04:10:40] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-21 04:10:41] [INFO ] Deduced a trap composed of 62 places in 293 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 974/1215 variables, 241/275 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 72/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/1215 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1215/1215 variables, and 347 constraints, problems are : Problem set: 0 solved, 19 unsolved in 7399 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 241/241 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 195/215 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 25/240 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 974/1215 variables, 241/275 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1215 variables, 72/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1215 variables, 19/366 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1215 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/1215 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1215/1215 variables, and 366 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4457 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 241/241 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 14/14 constraints]
After SMT, in 11926ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 20 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 974/974 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 226 transition count 719
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 226 transition count 719
Applied a total of 30 rules in 43 ms. Remains 226 /241 variables (removed 15) and now considering 719/974 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 226/241 places, 719/974 transitions.
RANDOM walk for 4000000 steps (8 resets) in 22297 ms. (179 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 681 ms. (586 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 713 ms. (560 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 717 ms. (557 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 696 ms. (573 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 685 ms. (583 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 722 ms. (553 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 723 ms. (552 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 679 ms. (588 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400001 steps (8 resets) in 678 ms. (589 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 648 ms. (616 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 687 ms. (581 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 672 ms. (594 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 664 ms. (601 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 668 ms. (597 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 660 ms. (605 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 644 ms. (620 steps per ms) remains 15/15 properties
// Phase 1: matrix 719 rows 226 cols
[2024-05-21 04:10:57] [INFO ] Computed 20 invariants in 5 ms
[2024-05-21 04:10:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 184/200 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 25/225 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 04:10:58] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 3 ms to minimize.
[2024-05-21 04:10:58] [INFO ] Deduced a trap composed of 81 places in 224 ms of which 3 ms to minimize.
[2024-05-21 04:10:58] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 2 ms to minimize.
[2024-05-21 04:10:58] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 3 ms to minimize.
[2024-05-21 04:10:59] [INFO ] Deduced a trap composed of 75 places in 223 ms of which 3 ms to minimize.
[2024-05-21 04:10:59] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 2 ms to minimize.
[2024-05-21 04:10:59] [INFO ] Deduced a trap composed of 69 places in 237 ms of which 3 ms to minimize.
[2024-05-21 04:10:59] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 2 ms to minimize.
[2024-05-21 04:11:00] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 2 ms to minimize.
[2024-05-21 04:11:00] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 3 ms to minimize.
[2024-05-21 04:11:00] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 3 ms to minimize.
[2024-05-21 04:11:00] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 3 ms to minimize.
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 114 places in 282 ms of which 3 ms to minimize.
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 98 places in 234 ms of which 2 ms to minimize.
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 49 places in 273 ms of which 3 ms to minimize.
[2024-05-21 04:11:01] [INFO ] Deduced a trap composed of 85 places in 226 ms of which 3 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 63 places in 272 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 3 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 3 ms to minimize.
[2024-05-21 04:11:02] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 3 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 3 ms to minimize.
[2024-05-21 04:11:03] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 2 ms to minimize.
[2024-05-21 04:11:04] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/226 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 04:11:04] [INFO ] Deduced a trap composed of 74 places in 236 ms of which 2 ms to minimize.
[2024-05-21 04:11:04] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 3 ms to minimize.
[2024-05-21 04:11:05] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 04:11:05] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 719/945 variables, 226/275 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/945 variables, 72/347 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/945 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/945 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 945/945 variables, and 347 constraints, problems are : Problem set: 0 solved, 15 unsolved in 9422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 184/200 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 25/225 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/226 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 04:11:07] [INFO ] Deduced a trap composed of 77 places in 232 ms of which 2 ms to minimize.
[2024-05-21 04:11:08] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 719/945 variables, 226/277 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/945 variables, 72/349 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/945 variables, 15/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/945 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/945 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 945/945 variables, and 364 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3889 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 31/31 constraints]
After SMT, in 13353ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 9421 ms.
Support contains 16 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 719/719 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 222 transition count 651
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 222 transition count 651
Applied a total of 8 rules in 20 ms. Remains 222 /226 variables (removed 4) and now considering 651/719 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 222/226 places, 651/719 transitions.
RANDOM walk for 4000000 steps (8 resets) in 20934 ms. (191 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 651 ms. (613 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 624 ms. (640 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 606 ms. (658 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (8 resets) in 594 ms. (672 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 608 ms. (656 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 622 ms. (642 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 611 ms. (653 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400000 steps (8 resets) in 591 ms. (675 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 567 ms. (704 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (8 resets) in 572 ms. (698 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400004 steps (8 resets) in 569 ms. (701 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400001 steps (8 resets) in 577 ms. (692 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (8 resets) in 545 ms. (732 steps per ms) remains 12/12 properties
// Phase 1: matrix 651 rows 222 cols
[2024-05-21 04:11:30] [INFO ] Computed 20 invariants in 11 ms
[2024-05-21 04:11:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 190/203 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/204 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 17/221 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 04:11:30] [INFO ] Deduced a trap composed of 96 places in 214 ms of which 3 ms to minimize.
[2024-05-21 04:11:30] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 3 ms to minimize.
[2024-05-21 04:11:31] [INFO ] Deduced a trap composed of 80 places in 202 ms of which 2 ms to minimize.
[2024-05-21 04:11:31] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 3 ms to minimize.
[2024-05-21 04:11:31] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 2 ms to minimize.
[2024-05-21 04:11:31] [INFO ] Deduced a trap composed of 62 places in 200 ms of which 3 ms to minimize.
[2024-05-21 04:11:32] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 2 ms to minimize.
[2024-05-21 04:11:32] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 2 ms to minimize.
[2024-05-21 04:11:32] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 3 ms to minimize.
[2024-05-21 04:11:32] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/222 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-21 04:11:33] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 2 ms to minimize.
[2024-05-21 04:11:33] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 3 ms to minimize.
[2024-05-21 04:11:33] [INFO ] Deduced a trap composed of 89 places in 210 ms of which 3 ms to minimize.
[2024-05-21 04:11:33] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 651/873 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 72/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/873 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 873/873 variables, and 328 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4534 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 222/222 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 190/203 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/204 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 17/221 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/222 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 651/873 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 72/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 12/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/873 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 873/873 variables, and 340 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2571 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 222/222 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints]
After SMT, in 7151ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 859 ms.
Support contains 13 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 651/651 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 219 transition count 600
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 219 transition count 600
Applied a total of 6 rules in 16 ms. Remains 219 /222 variables (removed 3) and now considering 600/651 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 219/222 places, 600/651 transitions.
RANDOM walk for 4000000 steps (8 resets) in 16554 ms. (241 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4849 ms. (824 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 4983 ms. (802 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4509 ms. (886 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 4388 ms. (911 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 4187 ms. (955 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 3891 ms. (1027 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3795 ms. (1053 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3583 ms. (1116 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 3443 ms. (1161 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3276 ms. (1220 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3954320 steps (8 resets) in 3099 ms. (1275 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1692 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 505 transition count 1773
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 433 transition count 1773
Applied a total of 144 rules in 31 ms. Remains 433 /505 variables (removed 72) and now considering 1773/1845 (removed 72) transitions.
// Phase 1: matrix 1773 rows 433 cols
[2024-05-21 04:11:54] [INFO ] Computed 21 invariants in 19 ms
[2024-05-21 04:11:56] [INFO ] Implicit Places using invariants in 1732 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1734 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 432/505 places, 1773/1845 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 432 transition count 1692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 351 transition count 1692
Applied a total of 162 rules in 12 ms. Remains 351 /432 variables (removed 81) and now considering 1692/1773 (removed 81) transitions.
// Phase 1: matrix 1692 rows 351 cols
[2024-05-21 04:11:56] [INFO ] Computed 20 invariants in 10 ms
[2024-05-21 04:11:57] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2024-05-21 04:11:57] [INFO ] Invariant cache hit.
[2024-05-21 04:11:58] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 04:12:02] [INFO ] Implicit Places using invariants and state equation in 4849 ms returned []
Implicit Place search using SMT with State Equation took 5932 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 351/505 places, 1692/1845 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 7710 ms. Remains : 351/505 places, 1692/1845 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :1692 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 1692 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 255344 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-09

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 505
TRANSITIONS: 1845
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 7092
NUPN UNITS: 12
LOADING TIME: 1.274

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.103
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.997
OK.
----------------------------------------------------------------------
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: 1148
MODEL NAME: /home/mcc/execution/model
505 places, 1845 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
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="Anderson-PT-09"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Anderson-PT-09, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620124200224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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