About the Execution of ITS-Tools for Anderson-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12095.008 | 1800000.00 | 4242734.00 | 3610.70 | [undef] | Time out reached |
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.r013-smll-171620124700229.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 itstools
Input is Anderson-PT-10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-smll-171620124700229
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 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 1.3M 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 1716230228570
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-20 18:37:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-20 18:37:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:37:10] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2024-05-20 18:37:10] [INFO ] Transformed 621 places.
[2024-05-20 18:37:10] [INFO ] Transformed 2480 transitions.
[2024-05-20 18:37:10] [INFO ] Found NUPN structural information;
[2024-05-20 18:37:10] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 517 ms.
Built sparse matrix representations for Structural reductions in 17 ms.20383KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 621/621 places, 2480/2480 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 211 ms. Remains 621 /621 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 242 ms. Remains : 621/621 places, 2480/2480 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 621/621 places, 2480/2480 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 145 ms. Remains 621 /621 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
// Phase 1: matrix 2480 rows 621 cols
[2024-05-20 18:37:11] [INFO ] Computed 23 invariants in 137 ms
[2024-05-20 18:37:12] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-20 18:37:12] [INFO ] Invariant cache hit.
[2024-05-20 18:37:14] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-20 18:37:14] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2024-05-20 18:37:14] [INFO ] Redundant transitions in 250 ms returned []
Running 2470 sub problems to find dead transitions.
[2024-05-20 18:37:15] [INFO ] Invariant cache hit.
[2024-05-20 18:37:15] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 621/621 constraints. Problems are: Problem set: 0 solved, 2470 unsolved
SMT process timed out in 40493ms, After SMT, problems are : Problem set: 0 solved, 2470 unsolved
Search for dead transitions found 0 dead transitions in 40563ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 43914 ms. Remains : 621/621 places, 2480/2480 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4805 ms (no deadlock found). (steps per millisecond=260 )
Random directed walk for 1250001 steps, including 0 resets, run took 4496 ms (no deadlock found). (steps per millisecond=278 )
[2024-05-20 18:38:04] [INFO ] Invariant cache hit.
[2024-05-20 18:38:05] [INFO ] [Real]Absence check using 11 positive place invariants in 74 ms returned sat
[2024-05-20 18:38:08] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 2379 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 70 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2024-05-20 18:38:08] [INFO ] Computed 23 invariants in 62 ms
[2024-05-20 18:38:10] [INFO ] Implicit Places using invariants in 2116 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2126 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 24 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2024-05-20 18:38:10] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 18:38:11] [INFO ] Implicit Places using invariants in 1540 ms returned []
[2024-05-20 18:38:11] [INFO ] Invariant cache hit.
[2024-05-20 18:38:13] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-20 18:38:17] [INFO ] Implicit Places using invariants and state equation in 6018 ms returned []
Implicit Place search using SMT with State Equation took 7564 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 9786 ms. Remains : 430/621 places, 2290/2480 transitions.
Initial state reduction rules removed 10 formulas.
[2024-05-20 18:38:19] [INFO ] Flatten gal took : 651 ms
[2024-05-20 18:38:20] [INFO ] Flatten gal took : 456 ms
[2024-05-20 18:38:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15584183361476435114.gal : 115 ms
[2024-05-20 18:38:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3223465701578559594.prop : 35 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15584183361476435114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3223465701578559594.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3223465701578559594.prop.
RANDOM walk for 40000 steps (8 resets) in 15162 ms. (2 steps per ms) remains 1236/2280 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 33 ms. (3 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 21 ms. (5 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 29 ms. (4 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1236/1236 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1236/1236 properties
[2024-05-20 18:38:22] [INFO ] Invariant cache hit.
[2024-05-20 18:38:22] [INFO ] State equation strengthened by 170 read => feed constraints.
Reachability property qltransition_2110 is true.
Reachability property qltransition_2010 is true.
Reachability property qltransition_1711 is true.
Reachability property qltransition_1521 is true.
Reachability property qltransition_1331 is true.
Reachability property qltransition_1141 is true.
Reachability property qltransition_951 is true.
Reachability property qltransition_761 is true.
Reachability property qltransition_571 is true.
Reachability property qltransition_381 is true.
Reachability property qltransition_191 is true.
SDD proceeding with computation,2269 properties remain. new max is 2
SDD size :1 after 3
Reachability property qltransition_2112 is true.
Reachability property qltransition_2011 is true.
Reachability property qltransition_1712 is true.
Reachability property qltransition_1522 is true.
Reachability property qltransition_1332 is true.
Reachability property qltransition_1142 is true.
Reachability property qltransition_952 is true.
Reachability property qltransition_762 is true.
Reachability property qltransition_572 is true.
Reachability property qltransition_382 is true.
Reachability property qltransition_192 is true.
Reachability property qltransition_1 is true.
SDD proceeding with computation,2257 properties remain. new max is 2
SDD size :3 after 6
Reachability property qltransition_2114 is true.
Reachability property qltransition_2012 is true.
Reachability property qltransition_1713 is true.
Reachability property qltransition_1523 is true.
Reachability property qltransition_1333 is true.
Reachability property qltransition_1143 is true.
Reachability property qltransition_953 is true.
Reachability property qltransition_763 is true.
Reachability property qltransition_573 is true.
Reachability property qltransition_383 is true.
Reachability property qltransition_193 is true.
Reachability property qltransition_21 is true.
SDD proceeding with computation,2245 properties remain. new max is 2
SDD size :6 after 9
Reachability property qltransition_2116 is true.
Reachability property qltransition_2013 is true.
Reachability property qltransition_1714 is true.
Reachability property qltransition_1524 is true.
Reachability property qltransition_1334 is true.
Reachability property qltransition_1144 is true.
Reachability property qltransition_954 is true.
Reachability property qltransition_764 is true.
Reachability property qltransition_574 is true.
Reachability property qltransition_384 is true.
Reachability property qltransition_194 is true.
Reachability property qltransition_41 is true.
SDD proceeding with computation,2233 properties remain. new max is 2
SDD size :9 after 12
Reachability property qltransition_2134 is true.
Reachability property qltransition_2132 is true.
Reachability property qltransition_2130 is true.
Reachability property qltransition_2128 is true.
Reachability property qltransition_2022 is true.
Reachability property qltransition_1715 is true.
Reachability property qltransition_1525 is true.
Reachability property qltransition_1335 is true.
Reachability property qltransition_1145 is true.
Reachability property qltransition_955 is true.
Reachability property qltransition_765 is true.
Reachability property qltransition_575 is true.
Reachability property qltransition_385 is true.
Reachability property qltransition_42 is true.
Reachability property qltransition_22 is true.
Reachability property qltransition_2 is true.
SDD proceeding with computation,2217 properties remain. new max is 2
SDD size :12 after 25
SDD proceeding with computation,2217 properties remain. new max is 4
SDD size :25 after 27
Reachability property qltransition_2023 is true.
SDD proceeding with computation,2216 properties remain. new max is 4
SDD size :27 after 28
Reachability property qltransition_2021 is true.
SDD proceeding with computation,2215 properties remain. new max is 4
SDD size :28 after 31
Reachability property qltransition_2020 is true.
SDD proceeding with computation,2214 properties remain. new max is 4
SDD size :31 after 32
Reachability property qltransition_211 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,2212 properties remain. new max is 4
SDD size :32 after 35
Reachability property qltransition_212 is true.
SDD proceeding with computation,2211 properties remain. new max is 4
SDD size :35 after 41
Reachability property qltransition_213 is true.
SDD proceeding with computation,2210 properties remain. new max is 4
SDD size :41 after 44
Reachability property qltransition_232 is true.
Reachability property qltransition_231 is true.
SDD proceeding with computation,2208 properties remain. new max is 4
SDD size :44 after 48
Reachability property qltransition_23 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,2206 properties remain. new max is 4
SDD size :48 after 51
SDD proceeding with computation,2206 properties remain. new max is 8
SDD size :51 after 52
Reachability property qltransition_2152 is true.
Reachability property qltransition_2150 is true.
Reachability property qltransition_2148 is true.
Reachability property qltransition_2146 is true.
Reachability property qltransition_2033 is true.
Reachability property qltransition_1716 is true.
Reachability property qltransition_1526 is true.
Reachability property qltransition_1336 is true.
Reachability property qltransition_1146 is true.
Reachability property qltransition_956 is true.
Reachability property qltransition_766 is true.
Reachability property qltransition_576 is true.
Reachability property qltransition_233 is true.
Reachability property qltransition_214 is true.
Reachability property qltransition_195 is true.
Reachability property qltransition_43 is true.
Reachability property qltransition_24 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,2188 properties remain. new max is 8
SDD size :52 after 116
Reachability property qltransition_2032 is true.
SDD proceeding with computation,2187 properties remain. new max is 8
SDD size :116 after 126
SDD proceeding with computation,2187 properties remain. new max is 16
SDD size :126 after 138
Reachability property qltransition_2031 is true.
SDD proceeding with computation,2186 properties remain. new max is 16
SDD size :138 after 149
Reachability property qltransition_2030 is true.
Reachability property qltransition_401 is true.
SDD proceeding with computation,2184 properties remain. new max is 16
SDD size :149 after 153
Reachability property qltransition_402 is true.
SDD proceeding with computation,2183 properties remain. new max is 16
SDD size :153 after 159
Reachability property qltransition_403 is true.
SDD proceeding with computation,2182 properties remain. new max is 16
SDD size :159 after 162
Reachability property qltransition_404 is true.
SDD proceeding with computation,2181 properties remain. new max is 16
SDD size :162 after 186
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
SMT process timed out in 10586ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 192 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 2290/2290 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 395 transition count 2255
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 395 transition count 2255
Applied a total of 70 rules in 170 ms. Remains 395 /430 variables (removed 35) and now considering 2255/2290 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 395/430 places, 2255/2290 transitions.
SDD proceeding with computation,2181 properties remain. new max is 32
SDD size :186 after 196
Reachability property qltransition_423 is true.
Reachability property qltransition_422 is true.
Reachability property qltransition_421 is true.
SDD proceeding with computation,2178 properties remain. new max is 32
SDD size :196 after 212
SDD proceeding with computation,2178 properties remain. new max is 64
SDD size :212 after 218
Reachability property qltransition_2170 is true.
Reachability property qltransition_2168 is true.
Reachability property qltransition_2166 is true.
Reachability property qltransition_2164 is true.
Reachability property qltransition_2043 is true.
Reachability property qltransition_2042 is true.
Reachability property qltransition_1717 is true.
Reachability property qltransition_1527 is true.
Reachability property qltransition_1337 is true.
Reachability property qltransition_1147 is true.
Reachability property qltransition_957 is true.
Reachability property qltransition_767 is true.
Reachability property qltransition_424 is true.
Reachability property qltransition_405 is true.
Reachability property qltransition_386 is true.
Reachability property qltransition_234 is true.
Reachability property qltransition_215 is true.
Reachability property qltransition_196 is true.
Reachability property qltransition_44 is true.
Reachability property qltransition_25 is true.
Reachability property qltransition_6 is true.
SDD proceeding with computation,2157 properties remain. new max is 64
SDD size :218 after 574
SDD proceeding with computation,2157 properties remain. new max is 128
SDD size :574 after 706
Reachability property qltransition_2041 is true.
Reachability property qltransition_2040 is true.
Reachability property qltransition_595 is true.
Reachability property qltransition_594 is true.
Reachability property qltransition_593 is true.
Reachability property qltransition_592 is true.
Reachability property qltransition_591 is true.
SDD proceeding with computation,2150 properties remain. new max is 128
SDD size :706 after 873
Reachability property qltransition_614 is true.
Reachability property qltransition_613 is true.
Reachability property qltransition_612 is true.
Reachability property qltransition_611 is true.
SDD proceeding with computation,2146 properties remain. new max is 128
SDD size :873 after 989
Reachability property qltransition_2188 is true.
Reachability property qltransition_2186 is true.
Reachability property qltransition_2184 is true.
Reachability property qltransition_2182 is true.
Reachability property qltransition_1718 is true.
Reachability property qltransition_1528 is true.
Reachability property qltransition_1338 is true.
Reachability property qltransition_1148 is true.
Reachability property qltransition_958 is true.
Reachability property qltransition_615 is true.
Reachability property qltransition_596 is true.
Reachability property qltransition_577 is true.
Reachability property qltransition_425 is true.
Reachability property qltransition_406 is true.
Reachability property qltransition_387 is true.
Reachability property qltransition_235 is true.
Reachability property qltransition_216 is true.
Reachability property qltransition_197 is true.
Reachability property qltransition_45 is true.
Reachability property qltransition_26 is true.
Reachability property qltransition_7 is true.
SDD proceeding with computation,2125 properties remain. new max is 128
SDD size :989 after 2538
Reachability property qltransition_2053 is true.
Reachability property qltransition_2052 is true.
SDD proceeding with computation,2123 properties remain. new max is 128
SDD size :2538 after 3198
SDD proceeding with computation,2123 properties remain. new max is 256
SDD size :3198 after 3572
Reachability property qltransition_2051 is true.
Reachability property qltransition_2050 is true.
Reachability property qltransition_786 is true.
Reachability property qltransition_785 is true.
Reachability property qltransition_784 is true.
Reachability property qltransition_783 is true.
Reachability property qltransition_782 is true.
Reachability property qltransition_781 is true.
SDD proceeding with computation,2115 properties remain. new max is 256
SDD size :3572 after 4528
Reachability property qltransition_805 is true.
Reachability property qltransition_804 is true.
Reachability property qltransition_803 is true.
Reachability property qltransition_802 is true.
Reachability property qltransition_801 is true.
SDD proceeding with computation,2110 properties remain. new max is 256
SDD size :4528 after 5142
Reachability property qltransition_2206 is true.
Reachability property qltransition_2204 is true.
Reachability property qltransition_2202 is true.
Reachability property qltransition_2200 is true.
Reachability property qltransition_1719 is true.
Reachability property qltransition_1529 is true.
Reachability property qltransition_1339 is true.
Reachability property qltransition_1149 is true.
Reachability property qltransition_806 is true.
Reachability property qltransition_787 is true.
Reachability property qltransition_768 is true.
Reachability property qltransition_616 is true.
Reachability property qltransition_597 is true.
Reachability property qltransition_578 is true.
Reachability property qltransition_426 is true.
Reachability property qltransition_407 is true.
Reachability property qltransition_388 is true.
Reachability property qltransition_236 is true.
Reachability property qltransition_217 is true.
Reachability property qltransition_198 is true.
Reachability property qltransition_46 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,2087 properties remain. new max is 256
SDD size :5142 after 12866
SDD proceeding with computation,2087 properties remain. new max is 512
SDD size :12866 after 14790
Reachability property qltransition_2063 is true.
Reachability property qltransition_2062 is true.
SDD proceeding with computation,2085 properties remain. new max is 512
SDD size :14790 after 19150
SDD proceeding with computation,2085 properties remain. new max is 1024
SDD size :19150 after 22342
Reachability property qltransition_2061 is true.
Reachability property qltransition_2060 is true.
Reachability property qltransition_996 is true.
Reachability property qltransition_995 is true.
Reachability property qltransition_994 is true.
Reachability property qltransition_993 is true.
Reachability property qltransition_992 is true.
Reachability property qltransition_991 is true.
Reachability property qltransition_977 is true.
Reachability property qltransition_976 is true.
Reachability property qltransition_975 is true.
Reachability property qltransition_974 is true.
Reachability property qltransition_973 is true.
Reachability property qltransition_972 is true.
Reachability property qltransition_971 is true.
SDD proceeding with computation,2070 properties remain. new max is 1024
SDD size :22342 after 31012
Reachability property qltransition_2224 is true.
Reachability property qltransition_2222 is true.
Reachability property qltransition_2220 is true.
Reachability property qltransition_2218 is true.
Reachability property qltransition_997 is true.
Reachability property qltransition_978 is true.
Reachability property qltransition_959 is true.
Reachability property qltransition_807 is true.
Reachability property qltransition_788 is true.
Reachability property qltransition_769 is true.
Reachability property qltransition_617 is true.
Reachability property qltransition_598 is true.
Reachability property qltransition_579 is true.
Reachability property qltransition_427 is true.
Reachability property qltransition_408 is true.
Reachability property qltransition_389 is true.
Reachability property qltransition_237 is true.
Reachability property qltransition_218 is true.
Reachability property qltransition_199 is true.
Reachability property qltransition_47 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_9 is true.
SDD proceeding with computation,2048 properties remain. new max is 1024
SDD size :31012 after 77864
RANDOM walk for 1331758 steps (2 resets) in 120004 ms. (11 steps per ms) remains 637/1231 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 606/637 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 603/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 603/603 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 572/603 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 110 ms. (36 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 512/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 510/512 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 510/510 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 510/510 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 509/510 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 508/509 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 508/508 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 508/508 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 508/508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 463/508 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 463/463 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 463/463 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 447/463 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 446/447 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 446/446 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 414/446 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 414/414 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 393/414 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 391/393 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 391/391 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 391/391 properties
BEST_FIRST walk for 4001 steps (8 resets) in 68 ms. (57 steps per ms) remains 391/391 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 388/391 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 387/388 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4001 steps (8 resets) in 78 ms. (50 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4001 steps (8 resets) in 70 ms. (56 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 387/387 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 342/387 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 342/342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 342/342 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 342/342 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 341/342 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4001 steps (8 resets) in 116 ms. (34 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 341/341 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 334/341 properties
BEST_FIRST walk for 4000 steps (8 resets) in 86 ms. (45 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 334/334 properties
SDD proceeding with computation,2048 properties remain. new max is 2048
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 334/334 properties
SDD size :77864 after 93844
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 334/334 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 333/334 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 333/333 properties
// Phase 1: matrix 2255 rows 395 cols
[2024-05-20 18:39:07] [INFO ] Computed 22 invariants in 14 ms
[2024-05-20 18:39:07] [INFO ] State equation strengthened by 145 read => feed constraints.
Reachability property qltransition_2073 is true.
Reachability property qltransition_2072 is true.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 252/387 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 333 unsolved
SDD proceeding with computation,2046 properties remain. new max is 2048
SDD size :93844 after 129366
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
SDD proceeding with computation,2046 properties remain. new max is 4096
SDD size :129366 after 153266
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Reachability property qltransition_2242 is true.
Reachability property qltransition_2240 is true.
Reachability property qltransition_2238 is true.
Reachability property qltransition_2236 is true.
At refinement iteration 4 (OVERLAPS) 8/395 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Reachability property qltransition_2071 is true.
Reachability property qltransition_2070 is true.
Reachability property qltransition_1187 is true.
Reachability property qltransition_1186 is true.
Reachability property qltransition_1185 is true.
Reachability property qltransition_1184 is true.
Reachability property qltransition_1183 is true.
Reachability property qltransition_1182 is true.
[2024-05-20 18:39:22] [INFO ] Deduced a trap composed of 153 places in 762 ms of which 64 ms to minimize.
Reachability property qltransition_1181 is true.
[2024-05-20 18:39:23] [INFO ] Deduced a trap composed of 119 places in 914 ms of which 8 ms to minimize.
[2024-05-20 18:39:23] [INFO ] Deduced a trap composed of 95 places in 686 ms of which 5 ms to minimize.
[2024-05-20 18:39:24] [INFO ] Deduced a trap composed of 118 places in 848 ms of which 5 ms to minimize.
Reachability property qltransition_1168 is true.
Reachability property qltransition_1167 is true.
Reachability property qltransition_1166 is true.
Reachability property qltransition_1165 is true.
Reachability property qltransition_1164 is true.
Reachability property qltransition_1163 is true.
Reachability property qltransition_1162 is true.
Reachability property qltransition_1161 is true.
[2024-05-20 18:39:25] [INFO ] Deduced a trap composed of 114 places in 656 ms of which 4 ms to minimize.
[2024-05-20 18:39:25] [INFO ] Deduced a trap composed of 168 places in 546 ms of which 4 ms to minimize.
SDD proceeding with computation,2025 properties remain. new max is 4096
SDD size :153266 after 431680
[2024-05-20 18:39:26] [INFO ] Deduced a trap composed of 199 places in 849 ms of which 5 ms to minimize.
[2024-05-20 18:39:27] [INFO ] Deduced a trap composed of 169 places in 960 ms of which 8 ms to minimize.
[2024-05-20 18:39:28] [INFO ] Deduced a trap composed of 94 places in 773 ms of which 5 ms to minimize.
[2024-05-20 18:39:29] [INFO ] Deduced a trap composed of 132 places in 751 ms of which 4 ms to minimize.
[2024-05-20 18:39:30] [INFO ] Deduced a trap composed of 95 places in 877 ms of which 7 ms to minimize.
[2024-05-20 18:39:30] [INFO ] Deduced a trap composed of 181 places in 759 ms of which 4 ms to minimize.
[2024-05-20 18:39:31] [INFO ] Deduced a trap composed of 142 places in 589 ms of which 3 ms to minimize.
[2024-05-20 18:39:32] [INFO ] Deduced a trap composed of 52 places in 747 ms of which 6 ms to minimize.
[2024-05-20 18:39:33] [INFO ] Deduced a trap composed of 60 places in 763 ms of which 6 ms to minimize.
[2024-05-20 18:39:33] [INFO ] Deduced a trap composed of 154 places in 740 ms of which 6 ms to minimize.
[2024-05-20 18:39:34] [INFO ] Deduced a trap composed of 183 places in 709 ms of which 6 ms to minimize.
[2024-05-20 18:39:35] [INFO ] Deduced a trap composed of 137 places in 703 ms of which 5 ms to minimize.
SDD proceeding with computation,2025 properties remain. new max is 8192
SDD size :431680 after 563726
[2024-05-20 18:39:36] [INFO ] Deduced a trap composed of 120 places in 760 ms of which 6 ms to minimize.
[2024-05-20 18:39:36] [INFO ] Deduced a trap composed of 153 places in 729 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-20 18:39:38] [INFO ] Deduced a trap composed of 116 places in 618 ms of which 4 ms to minimize.
[2024-05-20 18:39:38] [INFO ] Deduced a trap composed of 86 places in 611 ms of which 4 ms to minimize.
[2024-05-20 18:39:39] [INFO ] Deduced a trap composed of 117 places in 677 ms of which 5 ms to minimize.
[2024-05-20 18:39:40] [INFO ] Deduced a trap composed of 67 places in 673 ms of which 4 ms to minimize.
[2024-05-20 18:39:41] [INFO ] Deduced a trap composed of 113 places in 763 ms of which 4 ms to minimize.
[2024-05-20 18:39:41] [INFO ] Deduced a trap composed of 180 places in 741 ms of which 4 ms to minimize.
[2024-05-20 18:39:42] [INFO ] Deduced a trap composed of 128 places in 733 ms of which 5 ms to minimize.
[2024-05-20 18:39:43] [INFO ] Deduced a trap composed of 104 places in 697 ms of which 4 ms to minimize.
[2024-05-20 18:39:44] [INFO ] Deduced a trap composed of 131 places in 712 ms of which 8 ms to minimize.
[2024-05-20 18:39:44] [INFO ] Deduced a trap composed of 100 places in 759 ms of which 5 ms to minimize.
[2024-05-20 18:39:45] [INFO ] Deduced a trap composed of 94 places in 747 ms of which 5 ms to minimize.
[2024-05-20 18:39:46] [INFO ] Deduced a trap composed of 59 places in 776 ms of which 5 ms to minimize.
Reachability property qltransition_2083 is true.
Reachability property qltransition_2082 is true.
[2024-05-20 18:39:47] [INFO ] Deduced a trap composed of 50 places in 712 ms of which 3 ms to minimize.
[2024-05-20 18:39:47] [INFO ] Deduced a trap composed of 88 places in 702 ms of which 8 ms to minimize.
[2024-05-20 18:39:48] [INFO ] Deduced a trap composed of 109 places in 738 ms of which 13 ms to minimize.
[2024-05-20 18:39:49] [INFO ] Deduced a trap composed of 186 places in 709 ms of which 4 ms to minimize.
SDD proceeding with computation,2023 properties remain. new max is 8192
SDD size :563726 after 810196
[2024-05-20 18:39:50] [INFO ] Deduced a trap composed of 95 places in 641 ms of which 4 ms to minimize.
[2024-05-20 18:39:50] [INFO ] Deduced a trap composed of 81 places in 806 ms of which 4 ms to minimize.
[2024-05-20 18:39:51] [INFO ] Deduced a trap composed of 150 places in 758 ms of which 5 ms to minimize.
[2024-05-20 18:39:52] [INFO ] Deduced a trap composed of 83 places in 715 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/2650 variables, and 62 constraints, problems are : Problem set: 0 solved, 333 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/395 constraints, ReadFeed: 0/145 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 252/387 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 8/395 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Reachability property qltransition_2081 is true.
Reachability property qltransition_2080 is true.
Reachability property qltransition_1358 is true.
Reachability property qltransition_1357 is true.
Reachability property qltransition_1356 is true.
Reachability property qltransition_1355 is true.
Reachability property qltransition_1354 is true.
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Reachability property qltransition_1353 is true.
[2024-05-20 18:40:04] [INFO ] Deduced a trap composed of 97 places in 727 ms of which 5 ms to minimize.
Reachability property qltransition_1352 is true.
[2024-05-20 18:40:04] [INFO ] Deduced a trap composed of 115 places in 695 ms of which 4 ms to minimize.
Reachability property qltransition_1351 is true.
[2024-05-20 18:40:05] [INFO ] Deduced a trap composed of 86 places in 642 ms of which 4 ms to minimize.
[2024-05-20 18:40:06] [INFO ] Deduced a trap composed of 72 places in 652 ms of which 5 ms to minimize.
[2024-05-20 18:40:07] [INFO ] Deduced a trap composed of 133 places in 727 ms of which 5 ms to minimize.
[2024-05-20 18:40:07] [INFO ] Deduced a trap composed of 118 places in 643 ms of which 4 ms to minimize.
[2024-05-20 18:40:08] [INFO ] Deduced a trap composed of 100 places in 727 ms of which 5 ms to minimize.
[2024-05-20 18:40:09] [INFO ] Deduced a trap composed of 70 places in 667 ms of which 4 ms to minimize.
[2024-05-20 18:40:09] [INFO ] Deduced a trap composed of 131 places in 814 ms of which 4 ms to minimize.
SDD proceeding with computation,2013 properties remain. new max is 8192
SDD size :810196 after 1.17872e+06
[2024-05-20 18:40:10] [INFO ] Deduced a trap composed of 115 places in 731 ms of which 4 ms to minimize.
[2024-05-20 18:40:11] [INFO ] Deduced a trap composed of 96 places in 627 ms of which 5 ms to minimize.
[2024-05-20 18:40:12] [INFO ] Deduced a trap composed of 124 places in 659 ms of which 4 ms to minimize.
[2024-05-20 18:40:12] [INFO ] Deduced a trap composed of 152 places in 689 ms of which 5 ms to minimize.
[2024-05-20 18:40:13] [INFO ] Deduced a trap composed of 120 places in 604 ms of which 4 ms to minimize.
[2024-05-20 18:40:14] [INFO ] Deduced a trap composed of 143 places in 743 ms of which 5 ms to minimize.
[2024-05-20 18:40:14] [INFO ] Deduced a trap composed of 128 places in 631 ms of which 16 ms to minimize.
[2024-05-20 18:40:15] [INFO ] Deduced a trap composed of 104 places in 618 ms of which 4 ms to minimize.
[2024-05-20 18:40:16] [INFO ] Deduced a trap composed of 177 places in 627 ms of which 4 ms to minimize.
[2024-05-20 18:40:16] [INFO ] Deduced a trap composed of 79 places in 617 ms of which 4 ms to minimize.
[2024-05-20 18:40:17] [INFO ] Deduced a trap composed of 105 places in 617 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-20 18:40:19] [INFO ] Deduced a trap composed of 159 places in 629 ms of which 4 ms to minimize.
[2024-05-20 18:40:19] [INFO ] Deduced a trap composed of 139 places in 639 ms of which 4 ms to minimize.
[2024-05-20 18:40:20] [INFO ] Deduced a trap composed of 124 places in 646 ms of which 4 ms to minimize.
[2024-05-20 18:40:21] [INFO ] Deduced a trap composed of 156 places in 655 ms of which 5 ms to minimize.
[2024-05-20 18:40:21] [INFO ] Deduced a trap composed of 117 places in 751 ms of which 4 ms to minimize.
[2024-05-20 18:40:22] [INFO ] Deduced a trap composed of 144 places in 658 ms of which 6 ms to minimize.
[2024-05-20 18:40:23] [INFO ] Deduced a trap composed of 131 places in 625 ms of which 4 ms to minimize.
[2024-05-20 18:40:23] [INFO ] Deduced a trap composed of 72 places in 627 ms of which 4 ms to minimize.
[2024-05-20 18:40:24] [INFO ] Deduced a trap composed of 174 places in 656 ms of which 5 ms to minimize.
[2024-05-20 18:40:25] [INFO ] Deduced a trap composed of 165 places in 655 ms of which 5 ms to minimize.
[2024-05-20 18:40:25] [INFO ] Deduced a trap composed of 71 places in 652 ms of which 4 ms to minimize.
Reachability property qltransition_2260 is true.
[2024-05-20 18:40:26] [INFO ] Deduced a trap composed of 71 places in 645 ms of which 4 ms to minimize.
Reachability property qltransition_2258 is true.
Reachability property qltransition_2256 is true.
Reachability property qltransition_2254 is true.
Reachability property qltransition_1377 is true.
Reachability property qltransition_1376 is true.
Reachability property qltransition_1375 is true.
Reachability property qltransition_1374 is true.
[2024-05-20 18:40:27] [INFO ] Deduced a trap composed of 176 places in 664 ms of which 4 ms to minimize.
Reachability property qltransition_1373 is true.
Reachability property qltransition_1372 is true.
[2024-05-20 18:40:27] [INFO ] Deduced a trap composed of 141 places in 643 ms of which 4 ms to minimize.
[2024-05-20 18:40:28] [INFO ] Deduced a trap composed of 107 places in 653 ms of which 4 ms to minimize.
Reachability property qltransition_1371 is true.
[2024-05-20 18:40:29] [INFO ] Deduced a trap composed of 106 places in 657 ms of which 4 ms to minimize.
[2024-05-20 18:40:29] [INFO ] Deduced a trap composed of 115 places in 642 ms of which 4 ms to minimize.
[2024-05-20 18:40:30] [INFO ] Deduced a trap composed of 199 places in 649 ms of which 4 ms to minimize.
[2024-05-20 18:40:31] [INFO ] Deduced a trap composed of 219 places in 662 ms of which 5 ms to minimize.
[2024-05-20 18:40:31] [INFO ] Deduced a trap composed of 223 places in 652 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-20 18:40:34] [INFO ] Deduced a trap composed of 145 places in 675 ms of which 5 ms to minimize.
[2024-05-20 18:40:35] [INFO ] Deduced a trap composed of 174 places in 662 ms of which 5 ms to minimize.
[2024-05-20 18:40:35] [INFO ] Deduced a trap composed of 142 places in 655 ms of which 4 ms to minimize.
[2024-05-20 18:40:36] [INFO ] Deduced a trap composed of 155 places in 651 ms of which 4 ms to minimize.
[2024-05-20 18:40:37] [INFO ] Deduced a trap composed of 75 places in 672 ms of which 4 ms to minimize.
[2024-05-20 18:40:37] [INFO ] Deduced a trap composed of 85 places in 658 ms of which 4 ms to minimize.
[2024-05-20 18:40:38] [INFO ] Deduced a trap composed of 139 places in 671 ms of which 4 ms to minimize.
[2024-05-20 18:40:39] [INFO ] Deduced a trap composed of 119 places in 661 ms of which 4 ms to minimize.
SMT process timed out in 92049ms, After SMT, problems are : Problem set: 0 solved, 333 unsolved
Fused 333 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 135 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2255/2255 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 359 transition count 2219
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 359 transition count 2219
Applied a total of 72 rules in 100 ms. Remains 359 /395 variables (removed 36) and now considering 2219/2255 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 359/395 places, 2219/2255 transitions.
SDD proceeding with computation,2002 properties remain. new max is 8192
SDD size :1.17872e+06 after 2.5803e+06
SDD proceeding with computation,2002 properties remain. new max is 16384
SDD size :2.5803e+06 after 3.04066e+06
RANDOM walk for 3876354 steps (8 resets) in 119959 ms. (32 steps per ms) remains 293/333 properties
BEST_FIRST walk for 40003 steps (8 resets) in 368 ms. (108 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 449 ms. (88 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 290/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 290/290 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 290/290 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 288/290 properties
BEST_FIRST walk for 40004 steps (8 resets) in 700 ms. (57 steps per ms) remains 288/288 properties
BEST_FIRST walk for 40001 steps (8 resets) in 844 ms. (47 steps per ms) remains 288/288 properties
BEST_FIRST walk for 40002 steps (8 resets) in 688 ms. (58 steps per ms) remains 288/288 properties
BEST_FIRST walk for 40003 steps (8 resets) in 730 ms. (54 steps per ms) remains 286/288 properties
BEST_FIRST walk for 40003 steps (8 resets) in 670 ms. (59 steps per ms) remains 286/286 properties
BEST_FIRST walk for 40004 steps (8 resets) in 643 ms. (62 steps per ms) remains 286/286 properties
BEST_FIRST walk for 40003 steps (8 resets) in 583 ms. (68 steps per ms) remains 286/286 properties
BEST_FIRST walk for 40002 steps (8 resets) in 611 ms. (65 steps per ms) remains 286/286 properties
BEST_FIRST walk for 40003 steps (8 resets) in 703 ms. (56 steps per ms) remains 286/286 properties
BEST_FIRST walk for 40003 steps (8 resets) in 740 ms. (53 steps per ms) remains 286/286 properties
BEST_FIRST walk for 40004 steps (8 resets) in 875 ms. (45 steps per ms) remains 286/286 properties
BEST_FIRST walk for 40003 steps (8 resets) in 790 ms. (50 steps per ms) remains 285/286 properties
BEST_FIRST walk for 40002 steps (8 resets) in 816 ms. (48 steps per ms) remains 285/285 properties
BEST_FIRST walk for 40001 steps (8 resets) in 602 ms. (66 steps per ms) remains 285/285 properties
BEST_FIRST walk for 40002 steps (8 resets) in 697 ms. (57 steps per ms) remains 271/285 properties
BEST_FIRST walk for 40002 steps (8 resets) in 727 ms. (54 steps per ms) remains 271/271 properties
BEST_FIRST walk for 40002 steps (8 resets) in 680 ms. (58 steps per ms) remains 271/271 properties
BEST_FIRST walk for 40003 steps (8 resets) in 541 ms. (73 steps per ms) remains 271/271 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 271/271 properties
BEST_FIRST walk for 40003 steps (8 resets) in 646 ms. (61 steps per ms) remains 261/271 properties
BEST_FIRST walk for 40002 steps (8 resets) in 631 ms. (63 steps per ms) remains 261/261 properties
BEST_FIRST walk for 40001 steps (8 resets) in 756 ms. (52 steps per ms) remains 261/261 properties
BEST_FIRST walk for 40003 steps (8 resets) in 668 ms. (59 steps per ms) remains 261/261 properties
BEST_FIRST walk for 40003 steps (8 resets) in 711 ms. (56 steps per ms) remains 261/261 properties
BEST_FIRST walk for 40003 steps (8 resets) in 812 ms. (49 steps per ms) remains 261/261 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 261/261 properties
BEST_FIRST walk for 40003 steps (8 resets) in 708 ms. (56 steps per ms) remains 261/261 properties
BEST_FIRST walk for 40002 steps (8 resets) in 647 ms. (61 steps per ms) remains 250/261 properties
BEST_FIRST walk for 40003 steps (8 resets) in 800 ms. (49 steps per ms) remains 249/250 properties
BEST_FIRST walk for 40003 steps (8 resets) in 514 ms. (77 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40003 steps (8 resets) in 724 ms. (55 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40003 steps (8 resets) in 691 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40001 steps (8 resets) in 648 ms. (61 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40002 steps (8 resets) in 574 ms. (69 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40002 steps (8 resets) in 582 ms. (68 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40004 steps (8 resets) in 804 ms. (49 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40004 steps (8 resets) in 694 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40002 steps (8 resets) in 676 ms. (59 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40002 steps (8 resets) in 659 ms. (60 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40002 steps (8 resets) in 686 ms. (58 steps per ms) remains 249/249 properties
BEST_FIRST walk for 40003 steps (8 resets) in 632 ms. (63 steps per ms) remains 244/249 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 244/244 properties
BEST_FIRST walk for 40003 steps (8 resets) in 689 ms. (57 steps per ms) remains 244/244 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 244/244 properties
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 235/244 properties
BEST_FIRST walk for 40002 steps (8 resets) in 599 ms. (66 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 227/235 properties
BEST_FIRST walk for 40002 steps (8 resets) in 536 ms. (74 steps per ms) remains 227/227 properties
BEST_FIRST walk for 40004 steps (8 resets) in 616 ms. (64 steps per ms) remains 227/227 properties
BEST_FIRST walk for 40003 steps (8 resets) in 600 ms. (66 steps per ms) remains 225/227 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 225/225 properties
BEST_FIRST walk for 40003 steps (8 resets) in 503 ms. (79 steps per ms) remains 225/225 properties
BEST_FIRST walk for 40003 steps (8 resets) in 579 ms. (68 steps per ms) remains 225/225 properties
BEST_FIRST walk for 40002 steps (8 resets) in 637 ms. (62 steps per ms) remains 224/225 properties
BEST_FIRST walk for 40003 steps (8 resets) in 654 ms. (61 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40002 steps (8 resets) in 688 ms. (58 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40003 steps (8 resets) in 443 ms. (90 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40002 steps (8 resets) in 694 ms. (57 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40001 steps (8 resets) in 624 ms. (64 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40003 steps (8 resets) in 487 ms. (81 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40003 steps (8 resets) in 593 ms. (67 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40003 steps (8 resets) in 611 ms. (65 steps per ms) remains 221/224 properties
BEST_FIRST walk for 40003 steps (8 resets) in 593 ms. (67 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40001 steps (8 resets) in 561 ms. (71 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (8 resets) in 484 ms. (82 steps per ms) remains 221/221 properties
BEST_FIRST walk for 40003 steps (8 resets) in 512 ms. (77 steps per ms) remains 219/221 properties
BEST_FIRST walk for 40002 steps (8 resets) in 532 ms. (75 steps per ms) remains 217/219 properties
BEST_FIRST walk for 40003 steps (8 resets) in 624 ms. (64 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40001 steps (8 resets) in 643 ms. (62 steps per ms) remains 213/217 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40002 steps (8 resets) in 457 ms. (87 steps per ms) remains 212/213 properties
BEST_FIRST walk for 40003 steps (8 resets) in 566 ms. (70 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40003 steps (8 resets) in 661 ms. (60 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40002 steps (8 resets) in 589 ms. (67 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40002 steps (8 resets) in 475 ms. (84 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40001 steps (8 resets) in 675 ms. (59 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 651 ms. (61 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 511 ms. (78 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40002 steps (8 resets) in 519 ms. (76 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 189/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40003 steps (8 resets) in 508 ms. (78 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40003 steps (8 resets) in 549 ms. (72 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40002 steps (8 resets) in 478 ms. (83 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40003 steps (8 resets) in 468 ms. (85 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40003 steps (8 resets) in 603 ms. (66 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40003 steps (8 resets) in 556 ms. (71 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40002 steps (8 resets) in 481 ms. (82 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40003 steps (8 resets) in 598 ms. (66 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40003 steps (8 resets) in 551 ms. (72 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40002 steps (8 resets) in 603 ms. (66 steps per ms) remains 183/189 properties
BEST_FIRST walk for 40002 steps (8 resets) in 679 ms. (58 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40003 steps (8 resets) in 582 ms. (68 steps per ms) remains 182/183 properties
BEST_FIRST walk for 40002 steps (8 resets) in 600 ms. (66 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 573 ms. (69 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 375 ms. (106 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 599 ms. (66 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 730 ms. (54 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40002 steps (8 resets) in 644 ms. (62 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40002 steps (8 resets) in 572 ms. (69 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 667 ms. (59 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40002 steps (8 resets) in 720 ms. (55 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 660 ms. (60 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 637 ms. (62 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 705 ms. (56 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 768 ms. (52 steps per ms) remains 181/182 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 513 ms. (77 steps per ms) remains 180/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 508 ms. (78 steps per ms) remains 177/180 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40002 steps (8 resets) in 360 ms. (110 steps per ms) remains 176/177 properties
BEST_FIRST walk for 40002 steps (8 resets) in 435 ms. (91 steps per ms) remains 176/176 properties
BEST_FIRST walk for 40002 steps (8 resets) in 444 ms. (89 steps per ms) remains 174/176 properties
BEST_FIRST walk for 40003 steps (8 resets) in 489 ms. (81 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 743 ms. (53 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40001 steps (8 resets) in 421 ms. (94 steps per ms) remains 173/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (8 resets) in 456 ms. (87 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40002 steps (8 resets) in 651 ms. (61 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 172/173 properties
BEST_FIRST walk for 40003 steps (8 resets) in 446 ms. (89 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 172/172 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 102/172 properties
BEST_FIRST walk for 40002 steps (8 resets) in 479 ms. (83 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 415 ms. (96 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 658 ms. (60 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 547 ms. (72 steps per ms) remains 101/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 442 ms. (90 steps per ms) remains 97/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 417 ms. (95 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40002 steps (8 resets) in 564 ms. (70 steps per ms) remains 97/97 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 92/97 properties
BEST_FIRST walk for 40001 steps (8 resets) in 471 ms. (84 steps per ms) remains 92/92 properties
// Phase 1: matrix 2219 rows 359 cols
[2024-05-20 18:41:39] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 18:41:39] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 282/344 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 18:41:41] [INFO ] Deduced a trap composed of 235 places in 394 ms of which 4 ms to minimize.
Reachability property qltransition_2093 is true.
Reachability property qltransition_2092 is true.
[2024-05-20 18:41:41] [INFO ] Deduced a trap composed of 216 places in 434 ms of which 5 ms to minimize.
[2024-05-20 18:41:42] [INFO ] Deduced a trap composed of 197 places in 426 ms of which 5 ms to minimize.
[2024-05-20 18:41:42] [INFO ] Deduced a trap composed of 253 places in 423 ms of which 4 ms to minimize.
[2024-05-20 18:41:43] [INFO ] Deduced a trap composed of 185 places in 412 ms of which 4 ms to minimize.
[2024-05-20 18:41:43] [INFO ] Deduced a trap composed of 234 places in 310 ms of which 4 ms to minimize.
[2024-05-20 18:41:43] [INFO ] Deduced a trap composed of 216 places in 381 ms of which 4 ms to minimize.
[2024-05-20 18:41:44] [INFO ] Deduced a trap composed of 254 places in 373 ms of which 5 ms to minimize.
[2024-05-20 18:41:45] [INFO ] Deduced a trap composed of 219 places in 460 ms of which 6 ms to minimize.
[2024-05-20 18:41:45] [INFO ] Deduced a trap composed of 197 places in 480 ms of which 5 ms to minimize.
[2024-05-20 18:41:46] [INFO ] Deduced a trap composed of 234 places in 449 ms of which 5 ms to minimize.
[2024-05-20 18:41:46] [INFO ] Deduced a trap composed of 215 places in 443 ms of which 4 ms to minimize.
[2024-05-20 18:41:47] [INFO ] Deduced a trap composed of 218 places in 410 ms of which 4 ms to minimize.
[2024-05-20 18:41:47] [INFO ] Deduced a trap composed of 221 places in 398 ms of which 3 ms to minimize.
[2024-05-20 18:41:48] [INFO ] Deduced a trap composed of 222 places in 398 ms of which 4 ms to minimize.
[2024-05-20 18:41:48] [INFO ] Deduced a trap composed of 218 places in 633 ms of which 68 ms to minimize.
[2024-05-20 18:41:49] [INFO ] Deduced a trap composed of 216 places in 412 ms of which 4 ms to minimize.
[2024-05-20 18:41:49] [INFO ] Deduced a trap composed of 217 places in 397 ms of which 4 ms to minimize.
[2024-05-20 18:41:50] [INFO ] Deduced a trap composed of 201 places in 407 ms of which 4 ms to minimize.
[2024-05-20 18:41:50] [INFO ] Deduced a trap composed of 185 places in 422 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 18:41:51] [INFO ] Deduced a trap composed of 178 places in 440 ms of which 4 ms to minimize.
[2024-05-20 18:41:51] [INFO ] Deduced a trap composed of 216 places in 410 ms of which 4 ms to minimize.
[2024-05-20 18:41:52] [INFO ] Deduced a trap composed of 197 places in 447 ms of which 3 ms to minimize.
[2024-05-20 18:41:52] [INFO ] Deduced a trap composed of 161 places in 341 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 15/359 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 92 unsolved
SDD proceeding with computation,2000 properties remain. new max is 16384
[2024-05-20 18:41:57] [INFO ] Deduced a trap composed of 92 places in 876 ms of which 5 ms to minimize.
SDD size :3.04066e+06 after 3.94426e+06
[2024-05-20 18:41:58] [INFO ] Deduced a trap composed of 116 places in 881 ms of which 6 ms to minimize.
[2024-05-20 18:41:59] [INFO ] Deduced a trap composed of 145 places in 889 ms of which 6 ms to minimize.
[2024-05-20 18:42:00] [INFO ] Deduced a trap composed of 85 places in 881 ms of which 6 ms to minimize.
[2024-05-20 18:42:01] [INFO ] Deduced a trap composed of 74 places in 908 ms of which 6 ms to minimize.
[2024-05-20 18:42:02] [INFO ] Deduced a trap composed of 150 places in 876 ms of which 6 ms to minimize.
[2024-05-20 18:42:03] [INFO ] Deduced a trap composed of 95 places in 907 ms of which 6 ms to minimize.
[2024-05-20 18:42:03] [INFO ] Deduced a trap composed of 112 places in 725 ms of which 4 ms to minimize.
[2024-05-20 18:42:04] [INFO ] Deduced a trap composed of 94 places in 912 ms of which 6 ms to minimize.
[2024-05-20 18:42:05] [INFO ] Deduced a trap composed of 148 places in 893 ms of which 6 ms to minimize.
[2024-05-20 18:42:06] [INFO ] Deduced a trap composed of 107 places in 896 ms of which 8 ms to minimize.
[2024-05-20 18:42:07] [INFO ] Deduced a trap composed of 103 places in 885 ms of which 6 ms to minimize.
[2024-05-20 18:42:08] [INFO ] Deduced a trap composed of 104 places in 891 ms of which 6 ms to minimize.
[2024-05-20 18:42:09] [INFO ] Deduced a trap composed of 109 places in 893 ms of which 6 ms to minimize.
[2024-05-20 18:42:10] [INFO ] Deduced a trap composed of 138 places in 895 ms of which 6 ms to minimize.
[2024-05-20 18:42:11] [INFO ] Deduced a trap composed of 129 places in 910 ms of which 6 ms to minimize.
[2024-05-20 18:42:12] [INFO ] Deduced a trap composed of 103 places in 730 ms of which 4 ms to minimize.
[2024-05-20 18:42:13] [INFO ] Deduced a trap composed of 162 places in 890 ms of which 6 ms to minimize.
[2024-05-20 18:42:14] [INFO ] Deduced a trap composed of 158 places in 925 ms of which 6 ms to minimize.
[2024-05-20 18:42:14] [INFO ] Deduced a trap composed of 113 places in 753 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 18:42:16] [INFO ] Deduced a trap composed of 60 places in 574 ms of which 3 ms to minimize.
[2024-05-20 18:42:17] [INFO ] Deduced a trap composed of 112 places in 565 ms of which 4 ms to minimize.
[2024-05-20 18:42:17] [INFO ] Deduced a trap composed of 115 places in 493 ms of which 4 ms to minimize.
SDD proceeding with computation,2000 properties remain. new max is 32768
[2024-05-20 18:42:18] [INFO ] Deduced a trap composed of 46 places in 549 ms of which 4 ms to minimize.
SDD size :3.94426e+06 after 4.62243e+06
[2024-05-20 18:42:19] [INFO ] Deduced a trap composed of 144 places in 545 ms of which 4 ms to minimize.
[2024-05-20 18:42:19] [INFO ] Deduced a trap composed of 160 places in 549 ms of which 3 ms to minimize.
[2024-05-20 18:42:20] [INFO ] Deduced a trap composed of 139 places in 548 ms of which 4 ms to minimize.
[2024-05-20 18:42:20] [INFO ] Deduced a trap composed of 127 places in 543 ms of which 4 ms to minimize.
[2024-05-20 18:42:21] [INFO ] Deduced a trap composed of 168 places in 543 ms of which 4 ms to minimize.
[2024-05-20 18:42:22] [INFO ] Deduced a trap composed of 169 places in 562 ms of which 4 ms to minimize.
[2024-05-20 18:42:22] [INFO ] Deduced a trap composed of 144 places in 554 ms of which 5 ms to minimize.
[2024-05-20 18:42:23] [INFO ] Deduced a trap composed of 149 places in 537 ms of which 4 ms to minimize.
[2024-05-20 18:42:23] [INFO ] Deduced a trap composed of 112 places in 546 ms of which 3 ms to minimize.
[2024-05-20 18:42:24] [INFO ] Deduced a trap composed of 122 places in 543 ms of which 4 ms to minimize.
[2024-05-20 18:42:24] [INFO ] Deduced a trap composed of 126 places in 547 ms of which 4 ms to minimize.
[2024-05-20 18:42:25] [INFO ] Deduced a trap composed of 152 places in 548 ms of which 4 ms to minimize.
[2024-05-20 18:42:25] [INFO ] Deduced a trap composed of 164 places in 541 ms of which 3 ms to minimize.
[2024-05-20 18:42:26] [INFO ] Deduced a trap composed of 71 places in 544 ms of which 3 ms to minimize.
[2024-05-20 18:42:27] [INFO ] Deduced a trap composed of 79 places in 553 ms of which 4 ms to minimize.
[2024-05-20 18:42:27] [INFO ] Deduced a trap composed of 56 places in 542 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 18:42:28] [INFO ] Deduced a trap composed of 125 places in 468 ms of which 4 ms to minimize.
[2024-05-20 18:42:29] [INFO ] Deduced a trap composed of 136 places in 542 ms of which 4 ms to minimize.
[2024-05-20 18:42:30] [INFO ] Deduced a trap composed of 113 places in 543 ms of which 3 ms to minimize.
[2024-05-20 18:42:30] [INFO ] Deduced a trap composed of 102 places in 538 ms of which 4 ms to minimize.
[2024-05-20 18:42:31] [INFO ] Deduced a trap composed of 62 places in 528 ms of which 3 ms to minimize.
[2024-05-20 18:42:31] [INFO ] Deduced a trap composed of 72 places in 530 ms of which 4 ms to minimize.
[2024-05-20 18:42:32] [INFO ] Deduced a trap composed of 114 places in 543 ms of which 4 ms to minimize.
[2024-05-20 18:42:33] [INFO ] Deduced a trap composed of 108 places in 543 ms of which 3 ms to minimize.
[2024-05-20 18:42:34] [INFO ] Deduced a trap composed of 92 places in 538 ms of which 4 ms to minimize.
[2024-05-20 18:42:34] [INFO ] Deduced a trap composed of 112 places in 543 ms of which 4 ms to minimize.
[2024-05-20 18:42:35] [INFO ] Deduced a trap composed of 107 places in 574 ms of which 4 ms to minimize.
[2024-05-20 18:42:35] [INFO ] Deduced a trap composed of 145 places in 663 ms of which 4 ms to minimize.
[2024-05-20 18:42:36] [INFO ] Deduced a trap composed of 155 places in 647 ms of which 4 ms to minimize.
[2024-05-20 18:42:37] [INFO ] Deduced a trap composed of 148 places in 629 ms of which 4 ms to minimize.
[2024-05-20 18:42:38] [INFO ] Deduced a trap composed of 162 places in 667 ms of which 4 ms to minimize.
[2024-05-20 18:42:38] [INFO ] Deduced a trap composed of 52 places in 712 ms of which 4 ms to minimize.
[2024-05-20 18:42:39] [INFO ] Deduced a trap composed of 62 places in 764 ms of which 4 ms to minimize.
[2024-05-20 18:42:40] [INFO ] Deduced a trap composed of 71 places in 688 ms of which 4 ms to minimize.
[2024-05-20 18:42:41] [INFO ] Deduced a trap composed of 128 places in 696 ms of which 4 ms to minimize.
[2024-05-20 18:42:41] [INFO ] Deduced a trap composed of 155 places in 671 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 18:42:45] [INFO ] Deduced a trap composed of 87 places in 640 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 18:42:48] [INFO ] Deduced a trap composed of 133 places in 663 ms of which 4 ms to minimize.
[2024-05-20 18:42:48] [INFO ] Deduced a trap composed of 130 places in 665 ms of which 4 ms to minimize.
[2024-05-20 18:42:49] [INFO ] Deduced a trap composed of 127 places in 661 ms of which 4 ms to minimize.
[2024-05-20 18:42:50] [INFO ] Deduced a trap composed of 61 places in 681 ms of which 4 ms to minimize.
[2024-05-20 18:42:50] [INFO ] Deduced a trap composed of 133 places in 670 ms of which 5 ms to minimize.
[2024-05-20 18:42:51] [INFO ] Deduced a trap composed of 81 places in 697 ms of which 4 ms to minimize.
[2024-05-20 18:42:52] [INFO ] Deduced a trap composed of 81 places in 637 ms of which 4 ms to minimize.
[2024-05-20 18:42:52] [INFO ] Deduced a trap composed of 104 places in 608 ms of which 3 ms to minimize.
[2024-05-20 18:42:53] [INFO ] Deduced a trap composed of 88 places in 506 ms of which 4 ms to minimize.
[2024-05-20 18:42:53] [INFO ] Deduced a trap composed of 74 places in 610 ms of which 4 ms to minimize.
Reachability property qltransition_2091 is true.
Reachability property qltransition_2090 is true.
Reachability property qltransition_1548 is true.
Reachability property qltransition_1547 is true.
Reachability property qltransition_1546 is true.
Reachability property qltransition_1545 is true.
Reachability property qltransition_1544 is true.
Reachability property qltransition_1543 is true.
[2024-05-20 18:42:54] [INFO ] Deduced a trap composed of 130 places in 499 ms of which 4 ms to minimize.
[2024-05-20 18:42:55] [INFO ] Deduced a trap composed of 74 places in 606 ms of which 4 ms to minimize.
[2024-05-20 18:42:55] [INFO ] Deduced a trap composed of 104 places in 591 ms of which 3 ms to minimize.
SMT process timed out in 76102ms, After SMT, problems are : Problem set: 0 solved, 92 unsolved
Fused 92 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 2219/2219 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 306 transition count 1536
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 306 transition count 1536
Applied a total of 106 rules in 84 ms. Remains 306 /359 variables (removed 53) and now considering 1536/2219 (removed 683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 306/359 places, 1536/2219 transitions.
Reachability property qltransition_1542 is true.
Reachability property qltransition_1541 is true.
RANDOM walk for 4000000 steps (8 resets) in 94855 ms. (42 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3158 ms. (126 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2985 ms. (133 steps per ms) remains 92/92 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3218 ms. (124 steps per ms) remains 89/92 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2592 ms. (154 steps per ms) remains 89/89 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3173 ms. (126 steps per ms) remains 88/89 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2787 ms. (143 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2545 ms. (157 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3306 ms. (120 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3114 ms. (128 steps per ms) remains 88/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3373 ms. (118 steps per ms) remains 87/88 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3074 ms. (130 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2928 ms. (136 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2900 ms. (137 steps per ms) remains 87/87 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2788 ms. (143 steps per ms) remains 86/87 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2955 ms. (135 steps per ms) remains 85/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2556 ms. (156 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2761 ms. (144 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2557 ms. (156 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2991 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2520 ms. (158 steps per ms) remains 82/85 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2349 ms. (170 steps per ms) remains 82/82 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2980 ms. (134 steps per ms) remains 81/82 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2862 ms. (139 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2505 ms. (159 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2530 ms. (158 steps per ms) remains 81/81 properties
SDD proceeding with computation,1990 properties remain. new max is 32768
BEST_FIRST walk for 400002 steps (8 resets) in 3046 ms. (131 steps per ms) remains 81/81 properties
SDD size :4.62243e+06 after 7.23965e+06
BEST_FIRST walk for 400003 steps (8 resets) in 2907 ms. (137 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2939 ms. (136 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2750 ms. (145 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2726 ms. (146 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2602 ms. (153 steps per ms) remains 80/81 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2437 ms. (164 steps per ms) remains 77/80 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2618 ms. (152 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2289 ms. (174 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2884 ms. (138 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2834 ms. (141 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3479 ms. (114 steps per ms) remains 73/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2698 ms. (148 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2822 ms. (141 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2884 ms. (138 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2869 ms. (139 steps per ms) remains 66/73 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2229 ms. (179 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2387 ms. (167 steps per ms) remains 64/66 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2615 ms. (152 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2437 ms. (164 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2678 ms. (149 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2736 ms. (146 steps per ms) remains 61/64 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2272 ms. (175 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2246 ms. (178 steps per ms) remains 60/61 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2593 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3090 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2115 ms. (189 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2521 ms. (158 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2685 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2580 ms. (154 steps per ms) remains 53/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2443 ms. (163 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2525 ms. (158 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2094 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2743 ms. (145 steps per ms) remains 51/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2240 ms. (178 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2313 ms. (172 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2669 ms. (149 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2538 ms. (157 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3164 ms. (126 steps per ms) remains 49/51 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2672 ms. (149 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2650 ms. (150 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2778 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2584 ms. (154 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2453 ms. (163 steps per ms) remains 48/48 properties
// Phase 1: matrix 1536 rows 306 cols
[2024-05-20 18:44:30] [INFO ] Computed 22 invariants in 15 ms
[2024-05-20 18:44:30] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 239/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 26/305 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:44:32] [INFO ] Deduced a trap composed of 123 places in 459 ms of which 5 ms to minimize.
[2024-05-20 18:44:32] [INFO ] Deduced a trap composed of 106 places in 439 ms of which 4 ms to minimize.
[2024-05-20 18:44:33] [INFO ] Deduced a trap composed of 74 places in 374 ms of which 4 ms to minimize.
[2024-05-20 18:44:33] [INFO ] Deduced a trap composed of 68 places in 437 ms of which 3 ms to minimize.
[2024-05-20 18:44:33] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 4 ms to minimize.
[2024-05-20 18:44:34] [INFO ] Deduced a trap composed of 103 places in 444 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:44:35] [INFO ] Deduced a trap composed of 98 places in 451 ms of which 4 ms to minimize.
[2024-05-20 18:44:35] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 4 ms to minimize.
[2024-05-20 18:44:36] [INFO ] Deduced a trap composed of 57 places in 437 ms of which 5 ms to minimize.
[2024-05-20 18:44:37] [INFO ] Deduced a trap composed of 75 places in 499 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:44:38] [INFO ] Deduced a trap composed of 79 places in 519 ms of which 4 ms to minimize.
[2024-05-20 18:44:39] [INFO ] Deduced a trap composed of 143 places in 482 ms of which 4 ms to minimize.
[2024-05-20 18:44:39] [INFO ] Deduced a trap composed of 86 places in 368 ms of which 3 ms to minimize.
[2024-05-20 18:44:39] [INFO ] Deduced a trap composed of 81 places in 402 ms of which 3 ms to minimize.
[2024-05-20 18:44:40] [INFO ] Deduced a trap composed of 114 places in 389 ms of which 3 ms to minimize.
[2024-05-20 18:44:40] [INFO ] Deduced a trap composed of 93 places in 398 ms of which 3 ms to minimize.
[2024-05-20 18:44:41] [INFO ] Deduced a trap composed of 66 places in 391 ms of which 3 ms to minimize.
[2024-05-20 18:44:41] [INFO ] Deduced a trap composed of 58 places in 400 ms of which 3 ms to minimize.
[2024-05-20 18:44:41] [INFO ] Deduced a trap composed of 135 places in 372 ms of which 3 ms to minimize.
[2024-05-20 18:44:42] [INFO ] Deduced a trap composed of 160 places in 457 ms of which 4 ms to minimize.
[2024-05-20 18:44:42] [INFO ] Deduced a trap composed of 114 places in 412 ms of which 3 ms to minimize.
[2024-05-20 18:44:43] [INFO ] Deduced a trap composed of 114 places in 385 ms of which 3 ms to minimize.
[2024-05-20 18:44:43] [INFO ] Deduced a trap composed of 142 places in 311 ms of which 3 ms to minimize.
[2024-05-20 18:44:43] [INFO ] Deduced a trap composed of 76 places in 380 ms of which 3 ms to minimize.
[2024-05-20 18:44:44] [INFO ] Deduced a trap composed of 128 places in 372 ms of which 3 ms to minimize.
[2024-05-20 18:44:44] [INFO ] Deduced a trap composed of 121 places in 371 ms of which 3 ms to minimize.
[2024-05-20 18:44:44] [INFO ] Deduced a trap composed of 103 places in 380 ms of which 3 ms to minimize.
[2024-05-20 18:44:45] [INFO ] Deduced a trap composed of 112 places in 366 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:44:47] [INFO ] Deduced a trap composed of 94 places in 350 ms of which 4 ms to minimize.
[2024-05-20 18:44:47] [INFO ] Deduced a trap composed of 93 places in 416 ms of which 3 ms to minimize.
[2024-05-20 18:44:48] [INFO ] Deduced a trap composed of 94 places in 429 ms of which 4 ms to minimize.
[2024-05-20 18:44:48] [INFO ] Deduced a trap composed of 59 places in 413 ms of which 4 ms to minimize.
[2024-05-20 18:44:49] [INFO ] Deduced a trap composed of 73 places in 403 ms of which 3 ms to minimize.
[2024-05-20 18:44:49] [INFO ] Deduced a trap composed of 93 places in 419 ms of which 4 ms to minimize.
[2024-05-20 18:44:49] [INFO ] Deduced a trap composed of 123 places in 410 ms of which 3 ms to minimize.
Reachability property qltransition_2278 is true.
Reachability property qltransition_2276 is true.
Reachability property qltransition_2274 is true.
Reachability property qltransition_2272 is true.
[2024-05-20 18:44:50] [INFO ] Deduced a trap composed of 111 places in 417 ms of which 3 ms to minimize.
Reachability property qltransition_1567 is true.
Reachability property qltransition_1566 is true.
Reachability property qltransition_1565 is true.
[2024-05-20 18:44:50] [INFO ] Deduced a trap composed of 75 places in 427 ms of which 4 ms to minimize.
Reachability property qltransition_1564 is true.
Reachability property qltransition_1563 is true.
Reachability property qltransition_1562 is true.
[2024-05-20 18:44:51] [INFO ] Deduced a trap composed of 98 places in 400 ms of which 4 ms to minimize.
[2024-05-20 18:44:51] [INFO ] Deduced a trap composed of 121 places in 423 ms of which 4 ms to minimize.
[2024-05-20 18:44:52] [INFO ] Deduced a trap composed of 107 places in 417 ms of which 3 ms to minimize.
[2024-05-20 18:44:52] [INFO ] Deduced a trap composed of 98 places in 420 ms of which 4 ms to minimize.
[2024-05-20 18:44:52] [INFO ] Deduced a trap composed of 103 places in 427 ms of which 3 ms to minimize.
[2024-05-20 18:44:53] [INFO ] Deduced a trap composed of 90 places in 423 ms of which 3 ms to minimize.
[2024-05-20 18:44:53] [INFO ] Deduced a trap composed of 88 places in 421 ms of which 3 ms to minimize.
[2024-05-20 18:44:54] [INFO ] Deduced a trap composed of 83 places in 429 ms of which 4 ms to minimize.
[2024-05-20 18:44:54] [INFO ] Deduced a trap composed of 78 places in 427 ms of which 5 ms to minimize.
[2024-05-20 18:44:55] [INFO ] Deduced a trap composed of 68 places in 412 ms of which 4 ms to minimize.
[2024-05-20 18:44:55] [INFO ] Deduced a trap composed of 83 places in 412 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:44:56] [INFO ] Deduced a trap composed of 87 places in 393 ms of which 3 ms to minimize.
[2024-05-20 18:44:56] [INFO ] Deduced a trap composed of 65 places in 367 ms of which 3 ms to minimize.
[2024-05-20 18:44:57] [INFO ] Deduced a trap composed of 58 places in 386 ms of which 3 ms to minimize.
[2024-05-20 18:44:57] [INFO ] Deduced a trap composed of 72 places in 414 ms of which 3 ms to minimize.
Reachability property qltransition_1561 is true.
[2024-05-20 18:44:58] [INFO ] Deduced a trap composed of 90 places in 406 ms of which 4 ms to minimize.
[2024-05-20 18:44:58] [INFO ] Deduced a trap composed of 89 places in 406 ms of which 3 ms to minimize.
[2024-05-20 18:44:58] [INFO ] Deduced a trap composed of 101 places in 388 ms of which 3 ms to minimize.
[2024-05-20 18:44:59] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 3 ms to minimize.
[2024-05-20 18:44:59] [INFO ] Deduced a trap composed of 98 places in 405 ms of which 4 ms to minimize.
[2024-05-20 18:45:00] [INFO ] Deduced a trap composed of 56 places in 396 ms of which 3 ms to minimize.
[2024-05-20 18:45:00] [INFO ] Deduced a trap composed of 109 places in 377 ms of which 4 ms to minimize.
[2024-05-20 18:45:01] [INFO ] Deduced a trap composed of 71 places in 436 ms of which 3 ms to minimize.
[2024-05-20 18:45:01] [INFO ] Deduced a trap composed of 97 places in 349 ms of which 4 ms to minimize.
[2024-05-20 18:45:02] [INFO ] Deduced a trap composed of 100 places in 416 ms of which 4 ms to minimize.
[2024-05-20 18:45:02] [INFO ] Deduced a trap composed of 98 places in 409 ms of which 5 ms to minimize.
[2024-05-20 18:45:03] [INFO ] Deduced a trap composed of 56 places in 411 ms of which 4 ms to minimize.
[2024-05-20 18:45:03] [INFO ] Deduced a trap composed of 57 places in 406 ms of which 3 ms to minimize.
[2024-05-20 18:45:03] [INFO ] Deduced a trap composed of 82 places in 401 ms of which 4 ms to minimize.
[2024-05-20 18:45:04] [INFO ] Deduced a trap composed of 74 places in 419 ms of which 3 ms to minimize.
[2024-05-20 18:45:04] [INFO ] Deduced a trap composed of 61 places in 422 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:45:05] [INFO ] Deduced a trap composed of 78 places in 409 ms of which 4 ms to minimize.
[2024-05-20 18:45:06] [INFO ] Deduced a trap composed of 79 places in 411 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 1536/1842 variables, 306/398 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1842 variables, 91/489 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1842 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 16 (OVERLAPS) 0/1842 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1842/1842 variables, and 489 constraints, problems are : Problem set: 0 solved, 48 unsolved in 50187 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 306/306 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 239/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 26/305 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:45:21] [INFO ] Deduced a trap composed of 121 places in 381 ms of which 3 ms to minimize.
[2024-05-20 18:45:22] [INFO ] Deduced a trap composed of 98 places in 374 ms of which 3 ms to minimize.
[2024-05-20 18:45:22] [INFO ] Deduced a trap composed of 104 places in 371 ms of which 3 ms to minimize.
[2024-05-20 18:45:22] [INFO ] Deduced a trap composed of 108 places in 380 ms of which 3 ms to minimize.
[2024-05-20 18:45:23] [INFO ] Deduced a trap composed of 102 places in 375 ms of which 3 ms to minimize.
[2024-05-20 18:45:23] [INFO ] Deduced a trap composed of 100 places in 368 ms of which 6 ms to minimize.
[2024-05-20 18:45:23] [INFO ] Deduced a trap composed of 104 places in 365 ms of which 3 ms to minimize.
[2024-05-20 18:45:24] [INFO ] Deduced a trap composed of 48 places in 410 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-20 18:45:25] [INFO ] Deduced a trap composed of 93 places in 419 ms of which 3 ms to minimize.
[2024-05-20 18:45:26] [INFO ] Deduced a trap composed of 81 places in 408 ms of which 3 ms to minimize.
[2024-05-20 18:45:26] [INFO ] Deduced a trap composed of 133 places in 405 ms of which 3 ms to minimize.
[2024-05-20 18:45:26] [INFO ] Deduced a trap composed of 39 places in 429 ms of which 3 ms to minimize.
[2024-05-20 18:45:27] [INFO ] Deduced a trap composed of 82 places in 413 ms of which 3 ms to minimize.
[2024-05-20 18:45:27] [INFO ] Deduced a trap composed of 91 places in 423 ms of which 3 ms to minimize.
[2024-05-20 18:45:28] [INFO ] Deduced a trap composed of 79 places in 417 ms of which 3 ms to minimize.
[2024-05-20 18:45:28] [INFO ] Deduced a trap composed of 90 places in 401 ms of which 3 ms to minimize.
[2024-05-20 18:45:29] [INFO ] Deduced a trap composed of 84 places in 479 ms of which 5 ms to minimize.
[2024-05-20 18:45:29] [INFO ] Deduced a trap composed of 39 places in 621 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 1536/1842 variables, 306/416 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1842 variables, 91/507 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1842 variables, 48/555 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1842 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 15 (OVERLAPS) 0/1842 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1842/1842 variables, and 555 constraints, problems are : Problem set: 0 solved, 48 unsolved in 46226 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 306/306 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 88/88 constraints]
After SMT, in 96587ms problems are : Problem set: 0 solved, 48 unsolved
SDD proceeding with computation,1979 properties remain. new max is 32768
SDD size :7.23965e+06 after 1.40592e+07
Parikh walk visited 15 properties in 15795 ms.
Support contains 33 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1536/1536 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 280 transition count 1060
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 280 transition count 1060
Applied a total of 52 rules in 34 ms. Remains 280 /306 variables (removed 26) and now considering 1060/1536 (removed 476) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 280/306 places, 1060/1536 transitions.
RANDOM walk for 4000000 steps (8 resets) in 48392 ms. (82 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2209 ms. (180 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2278 ms. (175 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2132 ms. (187 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1949 ms. (205 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1865 ms. (214 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2051 ms. (194 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2278 ms. (175 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2165 ms. (184 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2437 ms. (164 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2124 ms. (188 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2425 ms. (164 steps per ms) remains 28/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2079 ms. (192 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1896 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2112 ms. (189 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2020 ms. (197 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1525 ms. (262 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1993 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2075 ms. (192 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2170 ms. (184 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2405 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2409 ms. (165 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2046 ms. (195 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1934 ms. (206 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1656 ms. (241 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1822 ms. (219 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2127 ms. (187 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2008 ms. (199 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1639 ms. (243 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2160 ms. (185 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2623 ms. (152 steps per ms) remains 24/24 properties
// Phase 1: matrix 1060 rows 280 cols
[2024-05-20 18:46:59] [INFO ] Computed 22 invariants in 6 ms
[2024-05-20 18:46:59] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 204/229 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 49/278 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-20 18:47:00] [INFO ] Deduced a trap composed of 89 places in 269 ms of which 4 ms to minimize.
[2024-05-20 18:47:00] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-20 18:47:01] [INFO ] Deduced a trap composed of 85 places in 341 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1060/1340 variables, 280/305 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1340 variables, 90/395 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1340 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/1340 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 395 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5528 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 280/280 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 204/229 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 49/278 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 2/280 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1060/1340 variables, 280/305 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1340 variables, 90/395 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1340 variables, 24/419 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1340 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 0/1340 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 419 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5692 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 280/280 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 11317ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 25 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 1060/1060 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 273 transition count 927
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 273 transition count 927
Applied a total of 14 rules in 27 ms. Remains 273 /280 variables (removed 7) and now considering 927/1060 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 273/280 places, 927/1060 transitions.
Reachability property qltransition_2103 is true.
Reachability property qltransition_2102 is true.
RANDOM walk for 4000000 steps (8 resets) in 53135 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2005 ms. (199 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1741 ms. (229 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2207 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1855 ms. (215 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2061 ms. (193 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2115 ms. (189 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2135 ms. (187 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2767 ms. (144 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2163 ms. (184 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2366 ms. (168 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1414 ms. (282 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2103 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1621 ms. (246 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1791 ms. (223 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2433 ms. (164 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2600 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1942 ms. (205 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1763 ms. (226 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1765 ms. (226 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1687 ms. (236 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1970 ms. (202 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1815 ms. (220 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2392 ms. (167 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2237 ms. (178 steps per ms) remains 23/23 properties
Detected timeout of ITS tools.
[2024-05-20 18:48:20] [INFO ] Flatten gal took : 109 ms
[2024-05-20 18:48:20] [INFO ] Applying decomposition
[2024-05-20 18:48:20] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9111664931687173682.txt' '-o' '/tmp/graph9111664931687173682.bin' '-w' '/tmp/graph9111664931687173682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9111664931687173682.bin' '-l' '-1' '-v' '-w' '/tmp/graph9111664931687173682.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:48:21] [INFO ] Decomposing Gal with order
[2024-05-20 18:48:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:48:23] [INFO ] Removed a total of 4767 redundant transitions.
[2024-05-20 18:48:23] [INFO ] Flatten gal took : 1046 ms
[2024-05-20 18:48:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 177 ms.
[2024-05-20 18:48:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14429249655569971548.gal : 64 ms
[2024-05-20 18:48:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16262741516218338632.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14429249655569971548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16262741516218338632.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16262741516218338632.prop.
SDD proceeding with computation,23 properties remain. new max is 4
SDD size :1 after 982
SDD proceeding with computation,23 properties remain. new max is 8
SDD size :982 after 984
SDD proceeding with computation,23 properties remain. new max is 16
SDD size :984 after 990
SDD proceeding with computation,23 properties remain. new max is 32
SDD size :990 after 990
Interrupted probabilistic random walk after 5668005 steps, run timeout after 114167 ms. (steps per millisecond=49 ) properties seen :4 out of 23
Probabilistic random walk after 5668005 steps, saw 3296287 distinct states, run finished after 114177 ms. (steps per millisecond=49 ) properties seen :4
// Phase 1: matrix 927 rows 273 cols
[2024-05-20 18:49:43] [INFO ] Computed 22 invariants in 5 ms
[2024-05-20 18:49:43] [INFO ] State equation strengthened by 90 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) 202/222 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 49/271 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-20 18:49:44] [INFO ] Deduced a trap composed of 57 places in 294 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/273 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 927/1200 variables, 273/296 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1200 variables, 90/386 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1200 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/1200 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 386 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2508 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 273/273 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 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) 202/222 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 49/271 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/273 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 927/1200 variables, 273/296 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1200 variables, 90/386 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1200 variables, 19/405 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1200 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/1200 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1200/1200 variables, and 405 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3830 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 273/273 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
After SMT, in 6386ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 1001 ms.
Support contains 20 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 927/927 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 269 transition count 851
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 269 transition count 851
Applied a total of 8 rules in 22 ms. Remains 269 /273 variables (removed 4) and now considering 851/927 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 269/273 places, 851/927 transitions.
RANDOM walk for 4000000 steps (8 resets) in 53668 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2636 ms. (151 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2334 ms. (171 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2039 ms. (196 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1940 ms. (206 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2106 ms. (189 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2311 ms. (173 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2302 ms. (173 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1860 ms. (214 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1513 ms. (264 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1993 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1703 ms. (234 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1649 ms. (242 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2142 ms. (186 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2140 ms. (186 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1803 ms. (221 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2495 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2136 ms. (187 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1867 ms. (214 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2028 ms. (197 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 4549867 steps, run timeout after 99001 ms. (steps per millisecond=45 ) properties seen :5 out of 18
Probabilistic random walk after 4549867 steps, saw 2768459 distinct states, run finished after 99004 ms. (steps per millisecond=45 ) properties seen :5
// Phase 1: matrix 851 rows 269 cols
[2024-05-20 18:52:03] [INFO ] Computed 22 invariants in 5 ms
[2024-05-20 18:52:03] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 133/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 117/264 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 18:52:04] [INFO ] Deduced a trap composed of 100 places in 281 ms of which 14 ms to minimize.
[2024-05-20 18:52:04] [INFO ] Deduced a trap composed of 58 places in 273 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 18:52:04] [INFO ] Deduced a trap composed of 100 places in 218 ms of which 3 ms to minimize.
[2024-05-20 18:52:05] [INFO ] Deduced a trap composed of 74 places in 224 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 5/269 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 851/1120 variables, 269/295 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 90/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1120 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1120 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 385 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3118 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 269/269 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 133/147 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 117/264 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 5/269 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 851/1120 variables, 269/295 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 90/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 13/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1120 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/1120 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 398 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 269/269 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 5646ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 6445 ms.
Support contains 14 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 851/851 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 263 transition count 737
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 263 transition count 737
Applied a total of 12 rules in 20 ms. Remains 263 /269 variables (removed 6) and now considering 737/851 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 263/269 places, 737/851 transitions.
SDD proceeding with computation,23 properties remain. new max is 64
SDD size :990 after 76208
RANDOM walk for 4000000 steps (8 resets) in 42362 ms. (94 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3929893 steps (8 resets) in 13389 ms. (293 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 11060 ms. (361 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 11214 ms. (356 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 13049 ms. (306 steps per ms) remains 11/11 properties
BEST_FIRST walk for 3992075 steps (8 resets) in 13144 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 3645258 steps (7 resets) in 12152 ms. (299 steps per ms) remains 10/11 properties
BEST_FIRST walk for 3705414 steps (8 resets) in 11876 ms. (311 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 12379 ms. (323 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 12962 ms. (308 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 12156 ms. (329 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 13091 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 3638535 steps (7 resets) in 11320 ms. (321 steps per ms) remains 9/9 properties
BEST_FIRST walk for 3702484 steps (8 resets) in 12286 ms. (301 steps per ms) remains 8/9 properties
// Phase 1: matrix 737 rows 263 cols
[2024-05-20 18:53:28] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 18:53:28] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 227/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/243 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 19/262 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/263 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 737/1000 variables, 263/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 90/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1000 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 375 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1257 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 263/263 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 227/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/243 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 19/262 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/263 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 18:53:30] [INFO ] Deduced a trap composed of 93 places in 251 ms of which 3 ms to minimize.
[2024-05-20 18:53:31] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 3 ms to minimize.
[2024-05-20 18:53:31] [INFO ] Deduced a trap composed of 103 places in 242 ms of which 3 ms to minimize.
[2024-05-20 18:53:31] [INFO ] Deduced a trap composed of 74 places in 243 ms of which 3 ms to minimize.
[2024-05-20 18:53:31] [INFO ] Deduced a trap composed of 103 places in 245 ms of which 3 ms to minimize.
[2024-05-20 18:53:32] [INFO ] Deduced a trap composed of 113 places in 287 ms of which 4 ms to minimize.
[2024-05-20 18:53:32] [INFO ] Deduced a trap composed of 82 places in 371 ms of which 4 ms to minimize.
[2024-05-20 18:53:32] [INFO ] Deduced a trap composed of 103 places in 345 ms of which 3 ms to minimize.
[2024-05-20 18:53:33] [INFO ] Deduced a trap composed of 114 places in 328 ms of which 4 ms to minimize.
[2024-05-20 18:53:33] [INFO ] Deduced a trap composed of 101 places in 303 ms of which 3 ms to minimize.
[2024-05-20 18:53:33] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 3 ms to minimize.
[2024-05-20 18:53:33] [INFO ] Deduced a trap composed of 73 places in 218 ms of which 3 ms to minimize.
[2024-05-20 18:53:34] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 3 ms to minimize.
[2024-05-20 18:53:34] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 3 ms to minimize.
[2024-05-20 18:53:34] [INFO ] Deduced a trap composed of 54 places in 396 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 18:53:35] [INFO ] Deduced a trap composed of 79 places in 371 ms of which 5 ms to minimize.
[2024-05-20 18:53:35] [INFO ] Deduced a trap composed of 82 places in 361 ms of which 4 ms to minimize.
[2024-05-20 18:53:36] [INFO ] Deduced a trap composed of 73 places in 341 ms of which 4 ms to minimize.
[2024-05-20 18:53:36] [INFO ] Deduced a trap composed of 57 places in 317 ms of which 4 ms to minimize.
[2024-05-20 18:53:36] [INFO ] Deduced a trap composed of 84 places in 302 ms of which 3 ms to minimize.
[2024-05-20 18:53:36] [INFO ] Deduced a trap composed of 112 places in 313 ms of which 4 ms to minimize.
[2024-05-20 18:53:37] [INFO ] Deduced a trap composed of 63 places in 283 ms of which 3 ms to minimize.
[2024-05-20 18:53:37] [INFO ] Deduced a trap composed of 79 places in 291 ms of which 3 ms to minimize.
[2024-05-20 18:53:37] [INFO ] Deduced a trap composed of 99 places in 280 ms of which 3 ms to minimize.
[2024-05-20 18:53:38] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-20 18:53:38] [INFO ] Deduced a trap composed of 59 places in 266 ms of which 3 ms to minimize.
[2024-05-20 18:53:38] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 3 ms to minimize.
[2024-05-20 18:53:38] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 3 ms to minimize.
[2024-05-20 18:53:39] [INFO ] Deduced a trap composed of 50 places in 373 ms of which 4 ms to minimize.
[2024-05-20 18:53:39] [INFO ] Deduced a trap composed of 88 places in 353 ms of which 4 ms to minimize.
[2024-05-20 18:53:40] [INFO ] Deduced a trap composed of 104 places in 341 ms of which 4 ms to minimize.
[2024-05-20 18:53:40] [INFO ] Deduced a trap composed of 55 places in 340 ms of which 4 ms to minimize.
[2024-05-20 18:53:40] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 4 ms to minimize.
[2024-05-20 18:53:41] [INFO ] Deduced a trap composed of 87 places in 327 ms of which 4 ms to minimize.
[2024-05-20 18:53:41] [INFO ] Deduced a trap composed of 89 places in 318 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-20 18:53:41] [INFO ] Deduced a trap composed of 86 places in 306 ms of which 4 ms to minimize.
[2024-05-20 18:53:42] [INFO ] Deduced a trap composed of 85 places in 301 ms of which 4 ms to minimize.
[2024-05-20 18:53:42] [INFO ] Deduced a trap composed of 92 places in 296 ms of which 3 ms to minimize.
[2024-05-20 18:53:42] [INFO ] Deduced a trap composed of 104 places in 281 ms of which 3 ms to minimize.
[2024-05-20 18:53:43] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 3 ms to minimize.
[2024-05-20 18:53:43] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 737/1000 variables, 263/326 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1000 variables, 90/416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1000 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1000 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1000 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 424 constraints, problems are : Problem set: 0 solved, 8 unsolved in 14925 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 263/263 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 41/41 constraints]
After SMT, in 16226ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1895 ms.
Support contains 9 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 737/737 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 258 transition count 642
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 258 transition count 642
Applied a total of 10 rules in 16 ms. Remains 258 /263 variables (removed 5) and now considering 642/737 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 258/263 places, 642/737 transitions.
SDD proceeding with computation,23 properties remain. new max is 128
SDD size :76208 after 76635
RANDOM walk for 4000000 steps (8 resets) in 27028 ms. (147 steps per ms) remains 8/8 properties
SDD proceeding with computation,23 properties remain. new max is 256
SDD size :76635 after 88237
SDD proceeding with computation,23 properties remain. new max is 512
SDD size :88237 after 94563
BEST_FIRST walk for 3809784 steps (8 resets) in 12517 ms. (304 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10660 ms. (375 steps per ms) remains 7/7 properties
SDD proceeding with computation,23 properties remain. new max is 1024
SDD size :94563 after 189316
BEST_FIRST walk for 3994816 steps (8 resets) in 11585 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3986512 steps (8 resets) in 13202 ms. (301 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3985827 steps (8 resets) in 11872 ms. (335 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10523 ms. (380 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 11507 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 9964 ms. (401 steps per ms) remains 5/5 properties
// Phase 1: matrix 642 rows 258 cols
[2024-05-20 18:54:29] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 18:54:29] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 225/231 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/238 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 19/257 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 18:54:30] [INFO ] Deduced a trap composed of 102 places in 274 ms of which 5 ms to minimize.
[2024-05-20 18:54:30] [INFO ] Deduced a trap composed of 82 places in 304 ms of which 4 ms to minimize.
[2024-05-20 18:54:30] [INFO ] Deduced a trap composed of 75 places in 226 ms of which 4 ms to minimize.
[2024-05-20 18:54:30] [INFO ] Deduced a trap composed of 104 places in 288 ms of which 4 ms to minimize.
[2024-05-20 18:54:31] [INFO ] Deduced a trap composed of 85 places in 215 ms of which 3 ms to minimize.
[2024-05-20 18:54:31] [INFO ] Deduced a trap composed of 84 places in 278 ms of which 3 ms to minimize.
[2024-05-20 18:54:31] [INFO ] Deduced a trap composed of 82 places in 266 ms of which 3 ms to minimize.
[2024-05-20 18:54:32] [INFO ] Deduced a trap composed of 100 places in 207 ms of which 3 ms to minimize.
[2024-05-20 18:54:32] [INFO ] Deduced a trap composed of 96 places in 257 ms of which 4 ms to minimize.
[2024-05-20 18:54:32] [INFO ] Deduced a trap composed of 104 places in 260 ms of which 3 ms to minimize.
[2024-05-20 18:54:32] [INFO ] Deduced a trap composed of 76 places in 267 ms of which 3 ms to minimize.
[2024-05-20 18:54:33] [INFO ] Deduced a trap composed of 78 places in 252 ms of which 3 ms to minimize.
[2024-05-20 18:54:33] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 3 ms to minimize.
[2024-05-20 18:54:33] [INFO ] Deduced a trap composed of 87 places in 230 ms of which 3 ms to minimize.
[2024-05-20 18:54:33] [INFO ] Deduced a trap composed of 100 places in 227 ms of which 3 ms to minimize.
[2024-05-20 18:54:34] [INFO ] Deduced a trap composed of 87 places in 269 ms of which 4 ms to minimize.
[2024-05-20 18:54:34] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 4 ms to minimize.
[2024-05-20 18:54:34] [INFO ] Deduced a trap composed of 61 places in 297 ms of which 4 ms to minimize.
[2024-05-20 18:54:35] [INFO ] Deduced a trap composed of 71 places in 279 ms of which 4 ms to minimize.
[2024-05-20 18:54:35] [INFO ] Deduced a trap composed of 88 places in 280 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 18:54:35] [INFO ] Deduced a trap composed of 110 places in 280 ms of which 3 ms to minimize.
[2024-05-20 18:54:35] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 4 ms to minimize.
[2024-05-20 18:54:36] [INFO ] Deduced a trap composed of 75 places in 266 ms of which 3 ms to minimize.
[2024-05-20 18:54:36] [INFO ] Deduced a trap composed of 113 places in 262 ms of which 3 ms to minimize.
[2024-05-20 18:54:36] [INFO ] Deduced a trap composed of 77 places in 246 ms of which 3 ms to minimize.
[2024-05-20 18:54:36] [INFO ] Deduced a trap composed of 92 places in 221 ms of which 3 ms to minimize.
[2024-05-20 18:54:37] [INFO ] Deduced a trap composed of 102 places in 225 ms of which 3 ms to minimize.
[2024-05-20 18:54:37] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 3 ms to minimize.
[2024-05-20 18:54:37] [INFO ] Deduced a trap composed of 117 places in 235 ms of which 3 ms to minimize.
[2024-05-20 18:54:37] [INFO ] Deduced a trap composed of 90 places in 232 ms of which 3 ms to minimize.
[2024-05-20 18:54:38] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 4 ms to minimize.
[2024-05-20 18:54:38] [INFO ] Deduced a trap composed of 73 places in 234 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 642/900 variables, 258/312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 90/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/900 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 402 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9601 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 225/231 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/238 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 19/257 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 32/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 18:54:39] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 4 ms to minimize.
[2024-05-20 18:54:40] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 4 ms to minimize.
[2024-05-20 18:54:40] [INFO ] Deduced a trap composed of 61 places in 245 ms of which 3 ms to minimize.
[2024-05-20 18:54:40] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-20 18:54:40] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 3 ms to minimize.
[2024-05-20 18:54:41] [INFO ] Deduced a trap composed of 70 places in 270 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 642/900 variables, 258/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 90/408 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 5/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/900 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/900 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/900 variables, and 413 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3090 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 38/38 constraints]
After SMT, in 12712ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1087 ms.
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 642/642 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 255 transition count 585
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 255 transition count 585
Applied a total of 6 rules in 14 ms. Remains 255 /258 variables (removed 3) and now considering 585/642 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 255/258 places, 585/642 transitions.
RANDOM walk for 4000000 steps (8 resets) in 27875 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 9468 ms. (422 steps per ms) remains 4/5 properties
BEST_FIRST walk for 3915490 steps (8 resets) in 9885 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10487 ms. (381 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3942099 steps (8 resets) in 11083 ms. (355 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3914196 steps (8 resets) in 9885 ms. (395 steps per ms) remains 3/4 properties
// Phase 1: matrix 585 rows 255 cols
[2024-05-20 18:55:15] [INFO ] Computed 22 invariants in 6 ms
[2024-05-20 18:55:15] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 234/238 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/245 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/255 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:55:15] [INFO ] Deduced a trap composed of 106 places in 242 ms of which 5 ms to minimize.
[2024-05-20 18:55:16] [INFO ] Deduced a trap composed of 68 places in 317 ms of which 4 ms to minimize.
[2024-05-20 18:55:16] [INFO ] Deduced a trap composed of 121 places in 249 ms of which 3 ms to minimize.
[2024-05-20 18:55:16] [INFO ] Deduced a trap composed of 93 places in 305 ms of which 4 ms to minimize.
[2024-05-20 18:55:17] [INFO ] Deduced a trap composed of 61 places in 286 ms of which 4 ms to minimize.
[2024-05-20 18:55:17] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:55:17] [INFO ] Deduced a trap composed of 98 places in 288 ms of which 4 ms to minimize.
[2024-05-20 18:55:18] [INFO ] Deduced a trap composed of 92 places in 282 ms of which 4 ms to minimize.
[2024-05-20 18:55:18] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 3 ms to minimize.
[2024-05-20 18:55:18] [INFO ] Deduced a trap composed of 118 places in 257 ms of which 3 ms to minimize.
[2024-05-20 18:55:18] [INFO ] Deduced a trap composed of 80 places in 251 ms of which 3 ms to minimize.
[2024-05-20 18:55:19] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 585/840 variables, 255/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 90/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/840 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 379 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4057 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 234/238 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:55:19] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 2 ms to minimize.
[2024-05-20 18:55:20] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/245 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/255 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 585/840 variables, 255/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 90/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/840 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 384 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 5268ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1006 ms.
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 585/585 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 253 transition count 547
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 253 transition count 547
Applied a total of 4 rules in 14 ms. Remains 253 /255 variables (removed 2) and now considering 547/585 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 253/255 places, 547/585 transitions.
RANDOM walk for 4000000 steps (8 resets) in 28946 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 8067 ms. (495 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 8382 ms. (477 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 8593 ms. (465 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 7016573 steps, run timeout after 66001 ms. (steps per millisecond=106 ) properties seen :1 out of 3
Probabilistic random walk after 7016573 steps, saw 4757291 distinct states, run finished after 66001 ms. (steps per millisecond=106 ) properties seen :1
// Phase 1: matrix 547 rows 253 cols
[2024-05-20 18:56:50] [INFO ] Computed 22 invariants in 3 ms
[2024-05-20 18:56:50] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/253 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 18:56:50] [INFO ] Deduced a trap composed of 58 places in 309 ms of which 5 ms to minimize.
[2024-05-20 18:56:51] [INFO ] Deduced a trap composed of 91 places in 311 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 547/800 variables, 253/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/800 variables, 90/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/800 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/253 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 547/800 variables, 253/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/800 variables, 90/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/800 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 369 constraints, problems are : Problem set: 0 solved, 2 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 253/253 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1701ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 199 ms.
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 547/547 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 528
Applied a total of 2 rules in 23 ms. Remains 252 /253 variables (removed 1) and now considering 528/547 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 252/253 places, 528/547 transitions.
RANDOM walk for 4000000 steps (8 resets) in 21773 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8599 ms. (465 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3681 ms. (1086 steps per ms) remains 1/1 properties
// Phase 1: matrix 528 rows 252 cols
[2024-05-20 18:57:03] [INFO ] Computed 22 invariants in 5 ms
[2024-05-20 18:57:03] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/232 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 528/780 variables, 252/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 90/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/780 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/232 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:57:04] [INFO ] Deduced a trap composed of 77 places in 219 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 251 transition count 509
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 509
Applied a total of 2 rules in 20 ms. Remains 251 /252 variables (removed 1) and now considering 509/528 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 251/252 places, 509/528 transitions.
RANDOM walk for 4000000 steps (8 resets) in 9467 ms. (422 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3633 ms. (1100 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2980553 steps, run timeout after 9001 ms. (steps per millisecond=331 ) properties seen :0 out of 1
Probabilistic random walk after 2980553 steps, saw 2071419 distinct states, run finished after 9004 ms. (steps per millisecond=331 ) properties seen :0
// Phase 1: matrix 509 rows 251 cols
[2024-05-20 18:57:17] [INFO ] Computed 22 invariants in 3 ms
[2024-05-20 18:57:17] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/231 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 509/760 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/760 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 220/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/231 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/250 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 509/760 variables, 251/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 90/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/760 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 251/251 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 509/509 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 251/251 places, 509/509 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 509/509 transitions.
Applied a total of 0 rules in 16 ms. Remains 251 /251 variables (removed 0) and now considering 509/509 (removed 0) transitions.
[2024-05-20 18:57:18] [INFO ] Invariant cache hit.
[2024-05-20 18:57:18] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-20 18:57:18] [INFO ] Invariant cache hit.
[2024-05-20 18:57:19] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-20 18:57:19] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2024-05-20 18:57:19] [INFO ] Redundant transitions in 11 ms returned []
Running 499 sub problems to find dead transitions.
[2024-05-20 18:57:19] [INFO ] Invariant cache hit.
[2024-05-20 18:57:19] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-20 18:57:25] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 3 ms to minimize.
[2024-05-20 18:57:25] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-05-20 18:57:25] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 3 ms to minimize.
[2024-05-20 18:57:25] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 3 ms to minimize.
[2024-05-20 18:57:26] [INFO ] Deduced a trap composed of 99 places in 229 ms of which 3 ms to minimize.
[2024-05-20 18:57:26] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 3 ms to minimize.
[2024-05-20 18:57:26] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 2 ms to minimize.
[2024-05-20 18:57:26] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 2 ms to minimize.
[2024-05-20 18:57:27] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 3 ms to minimize.
[2024-05-20 18:57:27] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 3 ms to minimize.
[2024-05-20 18:57:27] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 2 ms to minimize.
[2024-05-20 18:57:27] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 3 ms to minimize.
[2024-05-20 18:57:27] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 3 ms to minimize.
[2024-05-20 18:57:27] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 3 ms to minimize.
[2024-05-20 18:57:28] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 3 ms to minimize.
[2024-05-20 18:57:28] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 2 ms to minimize.
[2024-05-20 18:57:28] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 2 ms to minimize.
[2024-05-20 18:57:28] [INFO ] Deduced a trap composed of 77 places in 232 ms of which 3 ms to minimize.
[2024-05-20 18:57:28] [INFO ] Deduced a trap composed of 92 places in 232 ms of which 4 ms to minimize.
[2024-05-20 18:57:29] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-20 18:57:31] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2024-05-20 18:57:32] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 3 ms to minimize.
[2024-05-20 18:57:33] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-20 18:57:33] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 3 ms to minimize.
[2024-05-20 18:57:33] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 3 ms to minimize.
[2024-05-20 18:57:33] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 3 ms to minimize.
[2024-05-20 18:57:34] [INFO ] Deduced a trap composed of 84 places in 231 ms of which 3 ms to minimize.
[2024-05-20 18:57:34] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 3 ms to minimize.
[2024-05-20 18:57:34] [INFO ] Deduced a trap composed of 107 places in 222 ms of which 3 ms to minimize.
[2024-05-20 18:57:34] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 3 ms to minimize.
[2024-05-20 18:57:35] [INFO ] Deduced a trap composed of 97 places in 349 ms of which 5 ms to minimize.
[2024-05-20 18:57:35] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 3 ms to minimize.
[2024-05-20 18:57:35] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 3 ms to minimize.
[2024-05-20 18:57:35] [INFO ] Deduced a trap composed of 84 places in 220 ms of which 3 ms to minimize.
[2024-05-20 18:57:36] [INFO ] Deduced a trap composed of 74 places in 235 ms of which 3 ms to minimize.
[2024-05-20 18:57:36] [INFO ] Deduced a trap composed of 83 places in 217 ms of which 3 ms to minimize.
[2024-05-20 18:57:36] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 3 ms to minimize.
[2024-05-20 18:57:36] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 3 ms to minimize.
[2024-05-20 18:57:37] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 4 ms to minimize.
[2024-05-20 18:57:37] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-20 18:57:46] [INFO ] Deduced a trap composed of 85 places in 263 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-20 18:57:49] [INFO ] Deduced a trap composed of 90 places in 220 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 251/760 variables, and 64 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 42/64 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/760 variables, and 64 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/251 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/499 constraints, Known Traps: 42/42 constraints]
After SMT, in 60526ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61803 ms. Remains : 251/251 places, 509/509 transitions.
RANDOM walk for 400000 steps (8 resets) in 2706 ms. (147 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-20 18:58:21] [INFO ] Invariant cache hit.
[2024-05-20 18:58:21] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-20 18:58:21] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 11 ms returned sat
[2024-05-20 18:58:21] [INFO ] After 226ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:58:21] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-20 18:58:21] [INFO ] After 37ms SMT Verify possible using 90 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 18:58:21] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:58:21] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:58:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-20 18:58:21] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-20 18:58:21] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:58:21] [INFO ] After 40ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 18:58:22] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:58:22] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Detected timeout of ITS tools.
RANDOM walk for 4000000 steps (8 resets) in 11397 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3242198 steps (6 resets) in 3454 ms. (938 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 2290 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 27 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2024-05-20 18:58:26] [INFO ] Computed 23 invariants in 16 ms
[2024-05-20 18:58:28] [INFO ] Implicit Places using invariants in 2580 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2582 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 17 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2024-05-20 18:58:28] [INFO ] Computed 22 invariants in 19 ms
[2024-05-20 18:58:30] [INFO ] Implicit Places using invariants in 1701 ms returned []
[2024-05-20 18:58:30] [INFO ] Invariant cache hit.
[2024-05-20 18:58:31] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-20 18:58:35] [INFO ] Implicit Places using invariants and state equation in 5451 ms returned []
Implicit Place search using SMT with State Equation took 7154 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 9782 ms. Remains : 430/621 places, 2290/2480 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
[2024-05-20 18:58:35] [INFO ] Flatten gal took : 108 ms
[2024-05-20 18:58:36] [INFO ] Flatten gal took : 133 ms
[2024-05-20 18:58:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7421201571218018619.gal : 19 ms
[2024-05-20 18:58:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11108622555192292894.ctl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7421201571218018619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11108622555192292894.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 18:58:39] [INFO ] Flatten gal took : 101 ms
[2024-05-20 18:58:39] [INFO ] Applying decomposition
[2024-05-20 18:58:39] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2596640548955980354.txt' '-o' '/tmp/graph2596640548955980354.bin' '-w' '/tmp/graph2596640548955980354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2596640548955980354.bin' '-l' '-1' '-v' '-w' '/tmp/graph2596640548955980354.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:58:39] [INFO ] Decomposing Gal with order
[2024-05-20 18:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:58:40] [INFO ] Removed a total of 4569 redundant transitions.
[2024-05-20 18:58:40] [INFO ] Flatten gal took : 240 ms
[2024-05-20 18:58:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 321 labels/synchronizations in 73 ms.
[2024-05-20 18:58:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15994097655195732657.gal : 27 ms
[2024-05-20 18:58:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12848213440940612905.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15994097655195732657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12848213440940612905.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 18:58:43] [INFO ] Flatten gal took : 91 ms
[2024-05-20 18:58:43] [INFO ] Flatten gal took : 92 ms
[2024-05-20 18:58:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12542038368671622887.gal : 13 ms
[2024-05-20 18:58:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2322610690199369849.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12542038368671622887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2322610690199369849.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 18:59:13] [INFO ] Flatten gal took : 99 ms
[2024-05-20 18:59:13] [INFO ] Applying decomposition
[2024-05-20 18:59:13] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5300446039711771067.txt' '-o' '/tmp/graph5300446039711771067.bin' '-w' '/tmp/graph5300446039711771067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5300446039711771067.bin' '-l' '-1' '-v' '-w' '/tmp/graph5300446039711771067.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:59:13] [INFO ] Decomposing Gal with order
[2024-05-20 18:59:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:59:14] [INFO ] Removed a total of 4309 redundant transitions.
[2024-05-20 18:59:14] [INFO ] Flatten gal took : 242 ms
[2024-05-20 18:59:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 429 labels/synchronizations in 54 ms.
[2024-05-20 18:59:14] [INFO ] Time to serialize gal into /tmp/CTLFireability187286517587901224.gal : 29 ms
[2024-05-20 18:59:14] [INFO ] Time to serialize properties into /tmp/CTLFireability829689081295360142.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability187286517587901224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability829689081295360142.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 18:59:44] [INFO ] Flatten gal took : 67 ms
[2024-05-20 18:59:44] [INFO ] Flatten gal took : 69 ms
[2024-05-20 18:59:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7148313914414196060.gal : 82 ms
[2024-05-20 18:59:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11574905250364788529.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7148313914414196060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11574905250364788529.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 19:04:45] [INFO ] Flatten gal took : 69 ms
[2024-05-20 19:04:45] [INFO ] Applying decomposition
[2024-05-20 19:04:45] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13918047291139423923.txt' '-o' '/tmp/graph13918047291139423923.bin' '-w' '/tmp/graph13918047291139423923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13918047291139423923.bin' '-l' '-1' '-v' '-w' '/tmp/graph13918047291139423923.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:04:45] [INFO ] Decomposing Gal with order
[2024-05-20 19:04:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:04:45] [INFO ] Removed a total of 4611 redundant transitions.
[2024-05-20 19:04:45] [INFO ] Flatten gal took : 214 ms
[2024-05-20 19:04:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 42 ms.
[2024-05-20 19:04:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1688590320359619083.gal : 13 ms
[2024-05-20 19:04:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6663523021134116497.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1688590320359619083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6663523021134116497.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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-10"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Anderson-PT-10, 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 r013-smll-171620124700229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 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 '
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 ;