Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r175-tall-165277023800047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-5, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277023800047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652803679710

Running Version 202205111006
[2022-05-17 16:08:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-17 16:08:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:08:01] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2022-05-17 16:08:01] [INFO ] Transformed 834 places.
[2022-05-17 16:08:01] [INFO ] Transformed 1242 transitions.
[2022-05-17 16:08:01] [INFO ] Found NUPN structural information;
[2022-05-17 16:08:01] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 16:08:01] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 238 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 2 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 105 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2022-05-17 16:08:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2022-05-17 16:08:01] [INFO ] Computed 23 place invariants in 21 ms
[2022-05-17 16:08:01] [INFO ] Implicit Places using invariants in 403 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 429 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/834 places, 672/1242 transitions.
Discarding 6 transitions out of 672. Remains 666
Incomplete random walk after 10000 steps, including 2 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 666) seen :301
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 365) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 364) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 362) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 361) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 360) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 360) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 359) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 359) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 359) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 357) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 356) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 356) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 355) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 354) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 353) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 352) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 351) seen :0
Running SMT prover for 351 properties.
[2022-05-17 16:08:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:08:02] [INFO ] Computed 17 place invariants in 7 ms
[2022-05-17 16:08:04] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:08:12] [INFO ] After 9908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:351
[2022-05-17 16:08:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:08:21] [INFO ] After 5582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :351
[2022-05-17 16:08:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:08:27] [INFO ] After 6516ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :351
[2022-05-17 16:08:27] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 7 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:08:28] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 6 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:08:29] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2892 ms
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:08:30] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1014 ms
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:08:31] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:08:32] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 3 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:08:33] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2576 ms
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:08:34] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 812 ms
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:08:35] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 4 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:08:36] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:08:37] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:08:37] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:08:37] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1910 ms
[2022-05-17 16:08:37] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:08:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:08:37] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:351
Fused 351 Parikh solutions to 342 different solutions.
Parikh walk visited 35 properties in 5331 ms.
Support contains 206 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 24 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 635080 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 264) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 254) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 240) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 231) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 230) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 227) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 222) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 220) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 220) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 220) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 217) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 217) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 217) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 217) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 215) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 213) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 212) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 211) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 211) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 210) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 210) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 208) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 208) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 207) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 207) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 206) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 206) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 205) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 205) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 204) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 204) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 202) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 202) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 201) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 201) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 200) seen :0
Running SMT prover for 200 properties.
[2022-05-17 16:09:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:09:24] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:09:25] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:09:29] [INFO ] After 3382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:192
[2022-05-17 16:09:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:09:29] [INFO ] After 209ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:200
[2022-05-17 16:09:29] [INFO ] After 5241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:200
[2022-05-17 16:09:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:09:34] [INFO ] After 3008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :200
[2022-05-17 16:09:37] [INFO ] After 3461ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :200
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 464 ms
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:09:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 324 ms
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 784 ms
[2022-05-17 16:09:39] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:09:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:09:40] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1193 ms
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:09:41] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1023 ms
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:09:42] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:09:43] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:09:44] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3153 ms
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:09:45] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:09:46] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1002 ms
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:09:47] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:09:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1248 ms
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 463 ms
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:09:49] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 887 ms
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:09:50] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:09:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1411 ms
[2022-05-17 16:09:52] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:09:52] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:09:52] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:09:52] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:09:52] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:09:52] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:09:52] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:09:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2022-05-17 16:09:53] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:09:53] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:09:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:09:53] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:09:53] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-17 16:09:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:09:54] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:09:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2022-05-17 16:09:54] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:09:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:09:54] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:09:54] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:09:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2022-05-17 16:09:54] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:09:54] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:09:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2022-05-17 16:09:55] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 16:09:55] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:09:55] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-17 16:09:55] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:09:55] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:09:55] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:09:55] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:09:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 358 ms
[2022-05-17 16:09:56] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:09:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-17 16:09:56] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:09:56] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:09:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2022-05-17 16:09:56] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:09:56] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:09:56] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:09:56] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:09:57] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:09:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 488 ms
[2022-05-17 16:09:57] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:09:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:09:57] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:09:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:09:58] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:09:58] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:09:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2022-05-17 16:09:58] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:09:59] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:09:59] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:09:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2022-05-17 16:09:59] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:09:59] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:09:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2022-05-17 16:10:00] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:10:01] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:10:02] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:10:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-17 16:10:02] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:10:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:10:02] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:10:02] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:10:03] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:10:03] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:10:03] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:10:03] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:10:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 602 ms
[2022-05-17 16:10:03] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:10:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:10:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:10:04] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:10:05] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:10:05] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:10:05] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:10:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 884 ms
[2022-05-17 16:10:05] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:10:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:10:05] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:10:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:10:06] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:10:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:10:06] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:10:06] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:10:06] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:10:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1172 ms
[2022-05-17 16:10:08] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:10:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:10:08] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:10:08] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:10:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2022-05-17 16:10:08] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:10:09] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:10:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2022-05-17 16:10:09] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:10:09] [INFO ] After 35525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :200
Attempting to minimize the solution found.
Minimization took 9293 ms.
[2022-05-17 16:10:19] [INFO ] After 49440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :200
Parikh walk visited 0 properties in 1051 ms.
Support contains 160 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 16 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 719559 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 200) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 200) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 198) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 198) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 197) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 79014 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 196 properties.
[2022-05-17 16:12:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:12:16] [INFO ] Computed 17 place invariants in 7 ms
[2022-05-17 16:12:17] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:12:21] [INFO ] After 3415ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:193
[2022-05-17 16:12:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:12:21] [INFO ] After 83ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:196
[2022-05-17 16:12:21] [INFO ] After 5120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:196
[2022-05-17 16:12:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:12:26] [INFO ] After 3056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :196
[2022-05-17 16:12:29] [INFO ] After 3506ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :196
[2022-05-17 16:12:29] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:12:29] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:12:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 606 ms
[2022-05-17 16:12:30] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:12:31] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1401 ms
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:12:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:12:33] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1193 ms
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:12:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 651 ms
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:12:35] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1104 ms
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:12:36] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 4 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:12:37] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1777 ms
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:12:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 842 ms
[2022-05-17 16:12:38] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 461 ms
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:12:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 646 ms
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 357 ms
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:12:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 16:12:40] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:12:41] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:12:42] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:12:42] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:12:42] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:12:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1047 ms
[2022-05-17 16:12:42] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:12:42] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:12:42] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:12:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
[2022-05-17 16:12:43] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:12:43] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:12:43] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:12:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2022-05-17 16:12:43] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:12:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:12:43] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:12:43] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:12:43] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:12:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:12:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2022-05-17 16:12:44] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:12:44] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:12:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2022-05-17 16:12:44] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:12:44] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:12:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2022-05-17 16:12:44] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:12:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:12:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 360 ms
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:12:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:12:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-17 16:12:47] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:12:47] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 366 ms
[2022-05-17 16:12:51] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:12:51] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:12:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2022-05-17 16:12:52] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:12:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:12:52] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:12:52] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:12:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:12:54] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:12:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 778 ms
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 312 ms
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 590 ms
[2022-05-17 16:12:58] [INFO ] After 32271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :196
Attempting to minimize the solution found.
Minimization took 9463 ms.
[2022-05-17 16:13:07] [INFO ] After 46443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :196
Fused 196 Parikh solutions to 193 different solutions.
Parikh walk visited 0 properties in 752 ms.
Support contains 158 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 733180 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 80336 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 196 properties.
[2022-05-17 16:15:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:15:02] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:15:03] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:15:07] [INFO ] After 3392ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:193
[2022-05-17 16:15:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:15:07] [INFO ] After 82ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:196
[2022-05-17 16:15:07] [INFO ] After 5112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:196
[2022-05-17 16:15:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:15:12] [INFO ] After 3135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :196
[2022-05-17 16:15:15] [INFO ] After 3564ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :196
[2022-05-17 16:15:15] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:15:15] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:15:15] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:15:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 381 ms
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 634 ms
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:16] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:17] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1470 ms
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:15:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 275 ms
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:19] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1296 ms
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:15:20] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 703 ms
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:15:21] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1165 ms
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:15:22] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:23] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1898 ms
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:15:24] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 793 ms
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 446 ms
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:25] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 637 ms
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 388 ms
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:15:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:15:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:15:27] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1110 ms
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:15:28] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:15:29] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:15:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 355 ms
[2022-05-17 16:15:29] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:15:29] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:15:29] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:15:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2022-05-17 16:15:29] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:15:30] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:15:30] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:15:30] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:30] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:15:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 470 ms
[2022-05-17 16:15:30] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:30] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:15:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2022-05-17 16:15:31] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:31] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:15:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2022-05-17 16:15:31] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:15:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:15:31] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:15:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-17 16:15:31] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:15:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:15:31] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:15:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:15:31] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:15:32] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 335 ms
[2022-05-17 16:15:32] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 255 ms
[2022-05-17 16:15:32] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 16:15:33] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-17 16:15:33] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:15:33] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:15:34] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:15:34] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:15:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2022-05-17 16:15:34] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:15:34] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-17 16:15:35] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2022-05-17 16:15:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2022-05-17 16:15:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2022-05-17 16:15:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 193 ms
[2022-05-17 16:15:35] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:15:35] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:15:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2022-05-17 16:15:35] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:15:36] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:15:36] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:15:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2022-05-17 16:15:36] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:15:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:15:36] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:15:37] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:15:37] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:15:37] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:15:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 382 ms
[2022-05-17 16:15:37] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:15:38] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:15:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2022-05-17 16:15:38] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:15:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:15:39] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:15:39] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:15:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2022-05-17 16:15:40] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:15:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-17 16:15:41] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:15:41] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:15:41] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:15:41] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:15:41] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:15:41] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:15:41] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:15:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 743 ms
[2022-05-17 16:15:42] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:15:42] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:15:42] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:15:42] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 312 ms
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:15:43] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:15:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 632 ms
[2022-05-17 16:15:44] [INFO ] After 32627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :196
Attempting to minimize the solution found.
Minimization took 8786 ms.
[2022-05-17 16:15:53] [INFO ] After 46155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :196
Fused 196 Parikh solutions to 193 different solutions.
Parikh walk visited 0 properties in 611 ms.
Support contains 158 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:15:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:15:54] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:15:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-17 16:15:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:15:54] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:15:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:15:54] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2022-05-17 16:15:54] [INFO ] Redundant transitions in 45 ms returned []
[2022-05-17 16:15:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:15:54] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 16:15:54] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3579 ms. (steps per millisecond=27 ) properties (out of 158) seen :69
Running SMT prover for 89 properties.
[2022-05-17 16:15:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:15:58] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:15:58] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:16:00] [INFO ] After 2264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:89
[2022-05-17 16:16:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:16:02] [INFO ] After 1335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :89
[2022-05-17 16:16:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:16:04] [INFO ] After 1466ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :89
[2022-05-17 16:16:04] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:16:04] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:16:04] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:16:04] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:16:04] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:16:04] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:16:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1587 ms
[2022-05-17 16:16:05] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 856 ms
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:16:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:16:07] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:16:08] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1909 ms
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:16:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 990 ms
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:16:10] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:16:11] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:16:12] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3029 ms
[2022-05-17 16:16:13] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:16:13] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:16:13] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:16:13] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:16:13] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:16:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2022-05-17 16:16:13] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:16:13] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:14] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1565 ms
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:16:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 546 ms
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:16:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 629 ms
[2022-05-17 16:16:16] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:16:17] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:16:18] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:16:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 763 ms
[2022-05-17 16:16:18] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:16:18] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:16:18] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:16:18] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:16:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2022-05-17 16:16:18] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:16:18] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 541 ms
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:16:19] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 758 ms
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 324 ms
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2022-05-17 16:16:20] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 901 ms
[2022-05-17 16:16:21] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:16:22] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:16:22] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:16:22] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:16:22] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 475 ms
[2022-05-17 16:16:23] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:16:23] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:16:24] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:16:24] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:16:24] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:16:24] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:16:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2022-05-17 16:16:25] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:16:25] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:16:25] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:16:26] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:16:26] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:16:26] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:16:26] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:16:26] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:16:26] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:16:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2022-05-17 16:16:27] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:16:27] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:16:27] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 449 ms
[2022-05-17 16:16:27] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:16:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:16:27] [INFO ] After 25127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :89
Attempting to minimize the solution found.
Minimization took 4318 ms.
[2022-05-17 16:16:32] [INFO ] After 31526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :89
Interrupted random walk after 717466 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 196) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 194) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 194) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 192) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 192) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 80242 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 192 properties.
[2022-05-17 16:18:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:18:28] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:18:29] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:18:33] [INFO ] After 3358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:183
[2022-05-17 16:18:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:18:33] [INFO ] After 228ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:192
[2022-05-17 16:18:33] [INFO ] After 5222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:192
[2022-05-17 16:18:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:18:38] [INFO ] After 3052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :192
[2022-05-17 16:18:41] [INFO ] After 3471ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :192
[2022-05-17 16:18:41] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 671 ms
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:18:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:18:43] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1157 ms
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:18:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 784 ms
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:18:45] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:18:46] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2181 ms
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:18:47] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1059 ms
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:18:48] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1149 ms
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:18:49] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:18:50] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1369 ms
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:18:51] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1079 ms
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:18:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 446 ms
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 318 ms
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 447 ms
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 16:18:53] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 758 ms
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:18:54] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 513 ms
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:18:55] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:18:56] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:18:56] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:18:56] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:18:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 773 ms
[2022-05-17 16:18:56] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:18:56] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:18:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2022-05-17 16:18:56] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:18:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:18:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:18:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:18:57] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:18:58] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:18:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 260 ms
[2022-05-17 16:18:58] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:18:58] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:18:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2022-05-17 16:18:58] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-05-17 16:18:58] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:18:58] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:18:58] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:18:59] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:18:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 428 ms
[2022-05-17 16:18:59] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:18:59] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:18:59] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:18:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2022-05-17 16:18:59] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:18:59] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2022-05-17 16:19:00] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 286 ms
[2022-05-17 16:19:00] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:19:01] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-17 16:19:01] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:19:02] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:19:02] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:19:02] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:19:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2022-05-17 16:19:02] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:19:02] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-17 16:19:03] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:19:03] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:19:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2022-05-17 16:19:03] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-17 16:19:04] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:19:04] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:19:04] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:19:05] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:19:06] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:19:06] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:19:06] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:19:06] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:19:07] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:19:07] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:19:07] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:19:08] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:19:08] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 892 ms
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:19:09] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:19:10] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:19:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2022-05-17 16:19:10] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:19:10] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:19:10] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:19:10] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:19:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 436 ms
[2022-05-17 16:19:11] [INFO ] After 33144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :192
Attempting to minimize the solution found.
Minimization took 8048 ms.
[2022-05-17 16:19:19] [INFO ] After 45830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :192
Parikh walk visited 1 properties in 2421 ms.
Support contains 156 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 724696 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 191) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 191) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 190) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 80722 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 190 properties.
[2022-05-17 16:21:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:21:17] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:21:18] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:21:22] [INFO ] After 3338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:179
[2022-05-17 16:21:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:21:22] [INFO ] After 274ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:190
[2022-05-17 16:21:22] [INFO ] After 5185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:190
[2022-05-17 16:21:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:21:26] [INFO ] After 2830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :190
[2022-05-17 16:21:30] [INFO ] After 3213ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :190
[2022-05-17 16:21:30] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:21:30] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:21:30] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:30] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:21:30] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:21:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 536 ms
[2022-05-17 16:21:30] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:21:30] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 792 ms
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:21:31] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 473 ms
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:21:32] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:21:33] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:21:34] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:21:35] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3571 ms
[2022-05-17 16:21:35] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:21:36] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1121 ms
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:37] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1237 ms
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:21:38] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:21:39] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2004 ms
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:21:40] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1309 ms
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:21:41] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 996 ms
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:21:42] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 697 ms
[2022-05-17 16:21:43] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:21:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 772 ms
[2022-05-17 16:21:44] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:21:45] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:21:45] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:21:45] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:21:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2022-05-17 16:21:45] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:21:45] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:21:45] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:21:45] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:21:46] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:21:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 531 ms
[2022-05-17 16:21:46] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:21:46] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:21:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2022-05-17 16:21:46] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 3 ms to minimize.
[2022-05-17 16:21:46] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:21:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2022-05-17 16:21:47] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:21:47] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:21:47] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:21:47] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:21:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 401 ms
[2022-05-17 16:21:47] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-05-17 16:21:47] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:21:48] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:21:48] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:21:48] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:21:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2022-05-17 16:21:48] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:21:48] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:21:49] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:21:49] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:21:49] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:21:49] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:21:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 341 ms
[2022-05-17 16:21:49] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:21:49] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:21:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:21:50] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:21:50] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:21:50] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:21:50] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:21:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 404 ms
[2022-05-17 16:21:50] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:21:51] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:21:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:21:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2022-05-17 16:21:51] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:21:52] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:21:52] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 16:21:52] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-17 16:21:53] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:21:53] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:21:53] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:21:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2022-05-17 16:21:53] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:21:53] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2022-05-17 16:21:54] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:21:54] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:21:54] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:21:54] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:21:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 311 ms
[2022-05-17 16:21:55] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:21:55] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:21:55] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:21:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 334 ms
[2022-05-17 16:21:56] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-17 16:21:56] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:21:56] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:21:56] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:21:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2022-05-17 16:21:56] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:21:57] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-17 16:21:57] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:21:57] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-17 16:21:58] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:21:58] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:21:58] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:21:59] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:21:59] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:21:59] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 558 ms
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:22:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 432 ms
[2022-05-17 16:22:01] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:22:01] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:22:01] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:22:01] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:22:02] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:22:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 479 ms
[2022-05-17 16:22:02] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:22:02] [INFO ] After 35946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :190
Attempting to minimize the solution found.
Minimization took 8876 ms.
[2022-05-17 16:22:11] [INFO ] After 49201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :190
Parikh walk visited 0 properties in 227 ms.
Support contains 155 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 747298 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 190) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 190) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 188) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 78191 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 188 properties.
[2022-05-17 16:24:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:24:03] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:24:04] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:24:08] [INFO ] After 4679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:188
[2022-05-17 16:24:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:24:12] [INFO ] After 2802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :188
[2022-05-17 16:24:12] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:24:15] [INFO ] After 3146ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :188
[2022-05-17 16:24:15] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 443 ms
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:24:16] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 911 ms
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 493 ms
[2022-05-17 16:24:17] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 431 ms
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:24:18] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 628 ms
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:24:19] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1664 ms
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2022-05-17 16:24:20] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:24:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1038 ms
[2022-05-17 16:24:21] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:22] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1627 ms
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:24:23] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 903 ms
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:24:24] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 942 ms
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:24:25] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 855 ms
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:24:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 564 ms
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 488 ms
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:24:27] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 902 ms
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:24:28] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 752 ms
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 388 ms
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:24:29] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:24:30] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:24:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 292 ms
[2022-05-17 16:24:30] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:24:30] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-17 16:24:30] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-17 16:24:31] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:24:31] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:31] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:24:31] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:31] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:24:31] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:31] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:24:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 608 ms
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:24:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:24:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 416 ms
[2022-05-17 16:24:32] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 485 ms
[2022-05-17 16:24:33] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:24:33] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2022-05-17 16:24:34] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:24:34] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:24:34] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:24:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2022-05-17 16:24:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-17 16:24:35] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:24:35] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:24:35] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:24:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2022-05-17 16:24:35] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:24:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:24:36] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:24:36] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-05-17 16:24:36] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:24:37] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:24:37] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:24:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2022-05-17 16:24:37] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:24:37] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:24:38] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:24:38] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:24:38] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-17 16:24:39] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:24:39] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:24:39] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:24:40] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2022-05-17 16:24:40] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:24:40] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:24:40] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:24:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2022-05-17 16:24:41] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:24:41] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:24:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2022-05-17 16:24:41] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-17 16:24:41] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:24:42] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 630 ms
[2022-05-17 16:24:43] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:24:44] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:24:44] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:24:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2022-05-17 16:24:44] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-17 16:24:44] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 16:24:45] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:24:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:24:45] [INFO ] After 33091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :188
Attempting to minimize the solution found.
Minimization took 9243 ms.
[2022-05-17 16:24:54] [INFO ] After 46643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :188
Parikh walk visited 0 properties in 2058 ms.
Support contains 154 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 733524 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 188) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 188) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 187) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 77940 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 187 properties.
[2022-05-17 16:26:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:26:49] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:26:50] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:26:54] [INFO ] After 3096ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:176
[2022-05-17 16:26:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:26:54] [INFO ] After 271ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:187
[2022-05-17 16:26:54] [INFO ] After 4887ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:187
[2022-05-17 16:26:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:26:58] [INFO ] After 2760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :187
[2022-05-17 16:27:02] [INFO ] After 3190ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :187
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 767 ms
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 414 ms
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 571 ms
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 478 ms
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1066 ms
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 609 ms
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 2959 ms
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 452 ms
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 837 ms
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1864 ms
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 575 ms
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 816 ms
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 257 ms
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 257 ms
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1069 ms
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 234 ms
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
[2022-05-17 16:27:23] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 612 ms
[2022-05-17 16:27:25] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:27:26] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:27:26] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:27:26] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 573 ms
[2022-05-17 16:27:28] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:27:28] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:27:30] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:27:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:27:30] [INFO ] After 31960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :187
Attempting to minimize the solution found.
Minimization took 8228 ms.
[2022-05-17 16:27:39] [INFO ] After 44446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :187
Parikh walk visited 2 properties in 2380 ms.
Support contains 152 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 768858 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 185) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 78958 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 183 properties.
[2022-05-17 16:29:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:29:35] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:29:36] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:29:40] [INFO ] After 3097ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19 real:164
[2022-05-17 16:29:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:29:40] [INFO ] After 424ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:183
[2022-05-17 16:29:40] [INFO ] After 5026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:183
[2022-05-17 16:29:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:29:45] [INFO ] After 2713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :183
[2022-05-17 16:29:48] [INFO ] After 3013ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :183
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:29:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:29:48] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:29:49] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:29:50] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3027 ms
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:29:51] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 981 ms
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:29:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 331 ms
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:29:53] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:29:54] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1841 ms
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:29:55] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 981 ms
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:29:56] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:29:57] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1963 ms
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:29:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 744 ms
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:29:59] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 374 ms
[2022-05-17 16:30:00] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2022-05-17 16:30:00] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:30:00] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:30:00] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:30:01] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:30:01] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:30:01] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:30:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2022-05-17 16:30:01] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 343 ms
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:30:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2022-05-17 16:30:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:30:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:30:03] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:30:03] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:30:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 410 ms
[2022-05-17 16:30:03] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:30:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:30:03] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:30:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:30:04] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:30:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:30:04] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:30:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:30:04] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:30:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2022-05-17 16:30:04] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:30:04] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:30:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2022-05-17 16:30:04] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 456 ms
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:30:05] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:30:06] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:30:06] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:30:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 584 ms
[2022-05-17 16:30:06] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:30:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-17 16:30:07] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:30:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-17 16:30:08] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:30:08] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:30:08] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:30:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:30:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2022-05-17 16:30:08] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2022-05-17 16:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-05-17 16:30:09] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:30:10] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-17 16:30:10] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-17 16:30:10] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:30:10] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:30:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2022-05-17 16:30:11] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-17 16:30:11] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:30:11] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:30:11] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:30:11] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:30:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 576 ms
[2022-05-17 16:30:12] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:30:12] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:30:12] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:30:12] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:30:12] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:30:12] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:30:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 425 ms
[2022-05-17 16:30:13] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:30:13] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:30:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:30:14] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:30:15] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:30:15] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:30:15] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:30:15] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:30:15] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:30:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1278 ms
[2022-05-17 16:30:15] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:30:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:30:15] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:30:16] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:30:16] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:30:17] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:30:17] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:30:17] [INFO ] After 32693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :183
Attempting to minimize the solution found.
Minimization took 7874 ms.
[2022-05-17 16:30:25] [INFO ] After 44780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :183
Fused 183 Parikh solutions to 179 different solutions.
Parikh walk visited 0 properties in 2061 ms.
Support contains 151 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 742912 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 183) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 182) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 182) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 180) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 180) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 179) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 73624 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 179 properties.
[2022-05-17 16:32:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:32:16] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:32:16] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:32:20] [INFO ] After 3115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:166
[2022-05-17 16:32:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:32:21] [INFO ] After 340ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:179
[2022-05-17 16:32:21] [INFO ] After 4974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:179
[2022-05-17 16:32:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:32:25] [INFO ] After 2712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :179
[2022-05-17 16:32:28] [INFO ] After 3020ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :179
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 733 ms
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 516 ms
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 595 ms
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1289 ms
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 451 ms
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3009 ms
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 991 ms
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1908 ms
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2972 ms
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 446 ms
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 610 ms
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1660 ms
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1003 ms
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 311 ms
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:32:50] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:32:50] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:32:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-17 16:32:51] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:32:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-17 16:33:00] [INFO ] After 34800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :179
Attempting to minimize the solution found.
Minimization took 9463 ms.
[2022-05-17 16:33:09] [INFO ] After 48425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :179
Fused 179 Parikh solutions to 176 different solutions.
Parikh walk visited 0 properties in 2263 ms.
Support contains 149 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Interrupted random walk after 738690 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 179) seen :0
Probabilistic random walk after 10000001 steps, saw 1429547 distinct states, run finished after 73163 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 179 properties.
[2022-05-17 16:34:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:34:57] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:34:58] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:35:02] [INFO ] After 3009ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:166
[2022-05-17 16:35:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:35:02] [INFO ] After 323ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:179
[2022-05-17 16:35:02] [INFO ] After 4820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:179
[2022-05-17 16:35:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:35:06] [INFO ] After 2677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :179
[2022-05-17 16:35:09] [INFO ] After 2941ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :179
[2022-05-17 16:35:09] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 756 ms
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:10] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 530 ms
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 630 ms
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1214 ms
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 429 ms
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2842 ms
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 960 ms
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1859 ms
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2885 ms
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 438 ms
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 604 ms
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1605 ms
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:35:27] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:35:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 978 ms
[2022-05-17 16:35:27] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:35:27] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:35:27] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:35:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2022-05-17 16:35:27] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:35:27] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:35:29] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:35:29] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:35:29] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-17 16:35:29] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:35:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2022-05-17 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-17 16:35:30] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-17 16:35:30] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:35:30] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:35:31] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:35:32] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 16:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-17 16:35:32] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:35:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-17 16:35:33] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:35:33] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:35:33] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:35:33] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:35:34] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-05-17 16:35:34] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-17 16:35:35] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:35:35] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:35:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2022-05-17 16:35:35] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-17 16:35:36] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:36] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2022-05-17 16:35:36] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:35:36] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:35:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-17 16:35:37] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-17 16:35:37] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-17 16:35:38] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:35:38] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:35:38] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2022-05-17 16:35:39] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:35:39] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:35:39] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:35:39] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:35:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2022-05-17 16:35:40] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2022-05-17 16:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-17 16:35:40] [INFO ] After 33667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :179
Attempting to minimize the solution found.
Minimization took 9761 ms.
[2022-05-17 16:35:50] [INFO ] After 47538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :179
Fused 179 Parikh solutions to 176 different solutions.
Parikh walk visited 0 properties in 1910 ms.
Support contains 149 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:35:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:35:52] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:35:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2022-05-17 16:35:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:35:52] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:35:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:35:52] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2022-05-17 16:35:52] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:35:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:35:52] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:35:52] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3784 ms. (steps per millisecond=26 ) properties (out of 149) seen :67
Running SMT prover for 82 properties.
[2022-05-17 16:35:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:35:56] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:35:57] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:35:58] [INFO ] After 2070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:82
[2022-05-17 16:35:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 16:36:00] [INFO ] After 1247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :82
[2022-05-17 16:36:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:02] [INFO ] After 1366ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :82
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:02] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:36:03] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:36:04] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2719 ms
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 558 ms
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:36:05] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:06] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:07] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2416 ms
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:08] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1536 ms
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:09] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:36:10] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1784 ms
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:36:11] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 893 ms
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:12] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 943 ms
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:36:13] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:36:14] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:14] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2022-05-17 16:36:14] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:36:14] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:14] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:36:14] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 281 ms
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:15] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 973 ms
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:36:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 670 ms
[2022-05-17 16:36:17] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:36:17] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2022-05-17 16:36:17] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-17 16:36:17] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:36:18] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:36:18] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:18] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 407 ms
[2022-05-17 16:36:18] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2022-05-17 16:36:18] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:36:19] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-17 16:36:19] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:36:19] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:36:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2022-05-17 16:36:19] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:36:19] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:36:19] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:36:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2022-05-17 16:36:19] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:36:20] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 730 ms
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 539 ms
[2022-05-17 16:36:22] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2022-05-17 16:36:23] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:36:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:36:24] [INFO ] After 23237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :82
Attempting to minimize the solution found.
Minimization took 3550 ms.
[2022-05-17 16:36:27] [INFO ] After 28715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :82
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 442362 steps, run visited all 1 properties in 988 ms. (steps per millisecond=447 )
Probabilistic random walk after 442362 steps, saw 65796 distinct states, run finished after 988 ms. (steps per millisecond=447 ) properties seen :1
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Finished random walk after 3857 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=482 )
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=111 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 9207 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1534 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 4096 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1024 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1340549 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1340549 steps, saw 193030 distinct states, run finished after 3004 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:36:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:31] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 16:36:31] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:36:31] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:31] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:31] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:31] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:36:32] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1343832 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1343832 steps, saw 193555 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:36:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:35] [INFO ] Computed 17 place invariants in 7 ms
[2022-05-17 16:36:35] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:36:35] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:35] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:35] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-17 16:36:35] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:36:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:35] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:36:35] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-17 16:36:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:35] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:36:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:36] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2022-05-17 16:36:36] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 16:36:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:36] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:36:36] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 3 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 23 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:36:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:36:36] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:36:36] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:36] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:36:36] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:36] [INFO ] Flatten gal took : 10 ms
[2022-05-17 16:36:36] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:36:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6192368935984117876.gal : 2 ms
[2022-05-17 16:36:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13766852073619238505.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6192368935984117876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13766852073619238505.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13766852073619238505.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.007247,3276,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.007567,3700,2,3,6,12,7,0,16,6,0
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1341221 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1341221 steps, saw 193117 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:36:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:39] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:36:39] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:36:40] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:40] [INFO ] After 39ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 970 ms
[2022-05-17 16:36:41] [INFO ] After 1024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 16:36:41] [INFO ] After 1260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1345372 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1345372 steps, saw 193775 distinct states, run finished after 3003 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:36:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:44] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:36:44] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:36:44] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:44] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 953 ms
[2022-05-17 16:36:45] [INFO ] After 994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:36:45] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:36:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:45] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:36:45] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-17 16:36:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:36:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:46] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2022-05-17 16:36:46] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-17 16:36:46] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:46] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:36:46] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 16 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:36:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:36:46] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:36:46] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:46] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:36:46] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:46] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:36:46] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:36:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12391264123514362305.gal : 1 ms
[2022-05-17 16:36:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15372876831312407601.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12391264123514362305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15372876831312407601.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15372876831312407601.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.005125,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.005416,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17776 steps, run visited all 1 properties in 44 ms. (steps per millisecond=404 )
Probabilistic random walk after 17776 steps, saw 4285 distinct states, run finished after 45 ms. (steps per millisecond=395 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1352421 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{}
Probabilistic random walk after 1352421 steps, saw 194503 distinct states, run finished after 3001 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:36:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:49] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 16:36:49] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:36:49] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:49] [INFO ] After 35ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:49] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 16:36:50] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 33 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1354997 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :{}
Probabilistic random walk after 1354997 steps, saw 194777 distinct states, run finished after 3003 ms. (steps per millisecond=451 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:36:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:53] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:36:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:36:53] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:53] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:53] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 16:36:53] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:36:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:53] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:36:53] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-05-17 16:36:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:53] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:36:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:54] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2022-05-17 16:36:54] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:36:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:54] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:36:54] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 15 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:36:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:36:54] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:36:54] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:54] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:36:54] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:54] [INFO ] Flatten gal took : 5 ms
[2022-05-17 16:36:54] [INFO ] Flatten gal took : 3 ms
[2022-05-17 16:36:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1830985292611193061.gal : 2 ms
[2022-05-17 16:36:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13423158085477491838.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1830985292611193061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13423158085477491838.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13423158085477491838.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002055,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002408,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1342817 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1342817 steps, saw 193408 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:36:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:36:57] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:36:57] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:36:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:36:57] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:36:57] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:36:57] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:36:57] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1344000 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1344000 steps, saw 193567 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:00] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:01] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:01] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:01] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:01] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:37:01] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:01] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:01] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-17 16:37:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:01] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:02] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2022-05-17 16:37:02] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:37:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:02] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:02] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 8 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:37:02] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:37:02] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:02] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:37:02] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:02] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:37:02] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:37:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7241570562227872005.gal : 1 ms
[2022-05-17 16:37:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1362824017354129038.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7241570562227872005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1362824017354129038.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1362824017354129038.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00142,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001665,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 89332 steps, run visited all 1 properties in 202 ms. (steps per millisecond=442 )
Probabilistic random walk after 89332 steps, saw 14380 distinct states, run finished after 202 ms. (steps per millisecond=442 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1349117 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :{}
Probabilistic random walk after 1349117 steps, saw 194147 distinct states, run finished after 3001 ms. (steps per millisecond=449 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:05] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:05] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:05] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:37:05] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:06] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:06] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 16:37:06] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1304919 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :{}
Probabilistic random walk after 1304919 steps, saw 187677 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:09] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:09] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:37:09] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:09] [INFO ] After 40ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:09] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:37:09] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:09] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:09] [INFO ] Implicit Places using invariants in 156 ms returned []
[2022-05-17 16:37:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:09] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:10] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2022-05-17 16:37:10] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:37:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:10] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:10] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 7 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:37:10] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:37:10] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:10] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:37:10] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:10] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:10] [INFO ] Flatten gal took : 3 ms
[2022-05-17 16:37:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7460511959810684256.gal : 1 ms
[2022-05-17 16:37:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9664894179784009188.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7460511959810684256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9664894179784009188.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9664894179784009188.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001505,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.0018,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1347374 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1347374 steps, saw 194068 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:13] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:13] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-17 16:37:13] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:13] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:13] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:13] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-17 16:37:13] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1339723 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1339723 steps, saw 192912 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:16] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:16] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:17] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:17] [INFO ] After 33ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:17] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 16:37:17] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:17] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:17] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-17 16:37:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:17] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:18] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2022-05-17 16:37:18] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 16:37:18] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:18] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:18] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:37:18] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:37:18] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:18] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:37:18] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:18] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:18] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17038701935993879361.gal : 2 ms
[2022-05-17 16:37:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8416904032051118754.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17038701935993879361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8416904032051118754.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8416904032051118754.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00546,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.005693,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 8703 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1087 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 8647 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1441 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1345295 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1345295 steps, saw 193769 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:21] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:21] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:21] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:21] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 315 ms
[2022-05-17 16:37:21] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:37:22] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1338015 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338015 steps, saw 192660 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:25] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:25] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:37:25] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:25] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2022-05-17 16:37:25] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 16:37:25] [INFO ] After 509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:25] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:25] [INFO ] Implicit Places using invariants in 156 ms returned []
[2022-05-17 16:37:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:25] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:26] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2022-05-17 16:37:26] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:37:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:26] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:26] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:37:26] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:37:26] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:26] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:37:26] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:26] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:26] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:37:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15222258048643724872.gal : 1 ms
[2022-05-17 16:37:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11036535634470671345.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15222258048643724872.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11036535634470671345.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11036535634470671345.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001251,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001496,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1353723 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :{}
Probabilistic random walk after 1353723 steps, saw 194655 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:29] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:29] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:37:29] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:30] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:30] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:37:30] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1339464 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1339464 steps, saw 192891 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:33] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:33] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:33] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:33] [INFO ] After 32ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:33] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 16:37:33] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:33] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:33] [INFO ] Implicit Places using invariants in 162 ms returned []
[2022-05-17 16:37:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:33] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:34] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2022-05-17 16:37:34] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:37:34] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:34] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:34] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:37:34] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:37:34] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:34] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:37:34] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:34] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:34] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:37:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12582924272710569600.gal : 0 ms
[2022-05-17 16:37:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7523594372038742231.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12582924272710569600.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7523594372038742231.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7523594372038742231.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002633,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.003069,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1353779 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :{}
Probabilistic random walk after 1353779 steps, saw 194671 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:37] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:37] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:37] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:37] [INFO ] After 29ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:37] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 16:37:37] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1359883 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :{}
Probabilistic random walk after 1359883 steps, saw 196856 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:40] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:41] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:41] [INFO ] After 28ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:41] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-17 16:37:41] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:41] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-17 16:37:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:41] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:42] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2022-05-17 16:37:42] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 16:37:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:42] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 13 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:37:42] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:37:42] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:42] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:37:42] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:42] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:37:42] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2509888171660184213.gal : 1 ms
[2022-05-17 16:37:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality475747838364882269.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2509888171660184213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality475747838364882269.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality475747838364882269.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00152,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001948,3904,2,3,6,12,7,0,16,6,0
Finished random walk after 700 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=350 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1351742 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{}
Probabilistic random walk after 1351742 steps, saw 194442 distinct states, run finished after 3003 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:45] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:45] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:45] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:45] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:45] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:37:45] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:37:45] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1356698 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :{}
Probabilistic random walk after 1356698 steps, saw 195367 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:48] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:48] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:48] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:49] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:49] [INFO ] After 31ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:49] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-17 16:37:49] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-17 16:37:49] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:49] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:49] [INFO ] Implicit Places using invariants in 142 ms returned []
[2022-05-17 16:37:49] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:49] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:50] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2022-05-17 16:37:50] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 16:37:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:50] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:50] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 10 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:37:50] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:37:50] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:50] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:37:50] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:50] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:50] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10749964995405719140.gal : 1 ms
[2022-05-17 16:37:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17362059429068194262.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10749964995405719140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17362059429068194262.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17362059429068194262.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001374,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001613,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1338211 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338211 steps, saw 192686 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:53] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 16:37:53] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:53] [INFO ] After 30ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:53] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 16:37:53] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1350909 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{}
Probabilistic random walk after 1350909 steps, saw 194362 distinct states, run finished after 3002 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:37:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:56] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:37:56] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 16:37:56] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:56] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:56] [INFO ] After 26ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:56] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-17 16:37:57] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2022-05-17 16:37:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:57] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:57] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-17 16:37:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:57] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:57] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2022-05-17 16:37:57] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 16:37:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 16:37:57] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 16:37:58] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/258 places, 672/672 transitions.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 6 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:37:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:37:58] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:37:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:37:58] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:58] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:37:58] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:37:58] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:37:58] [INFO ] Flatten gal took : 4 ms
[2022-05-17 16:37:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11602875249226121133.gal : 1 ms
[2022-05-17 16:37:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9821964848367412013.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6029499340411464681;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11602875249226121133.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9821964848367412013.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9821964848367412013.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001889,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002258,3904,2,3,6,12,7,0,16,6,0
Finished random walk after 478 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=239 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 5979 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1494 )
Finished random walk after 1059 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=353 )
Finished random walk after 3172 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=453 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 8654 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1730 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17778 steps, run visited all 1 properties in 45 ms. (steps per millisecond=395 )
Probabilistic random walk after 17778 steps, saw 4287 distinct states, run finished after 45 ms. (steps per millisecond=395 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Peterson-PT-5"
export BK_EXAMINATION="QuasiLiveness"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-5, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-tall-165277023800047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;