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-165277023900053.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-6, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277023900053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 230K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 935K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 857K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 96K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 275K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K 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 877K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1652805022650

Running Version 202205111006
[2022-05-17 16:30:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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:30:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:30:24] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2022-05-17 16:30:24] [INFO ] Transformed 1330 places.
[2022-05-17 16:30:24] [INFO ] Transformed 2030 transitions.
[2022-05-17 16:30:24] [INFO ] Found NUPN structural information;
[2022-05-17 16:30:24] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2022-05-17 16:30:24] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 269 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 997 ms. (steps per millisecond=10 ) properties (out of 1330) seen :375
Running SMT prover for 955 properties.
[2022-05-17 16:30:25] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 16:30:25] [INFO ] Computed 27 place invariants in 34 ms
[2022-05-17 16:30:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:30:50] [INFO ] After 25059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 955 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 955 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 1330 transition count 1951
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 1251 transition count 1951
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 158 place count 1251 transition count 1859
Deduced a syphon composed of 92 places in 3 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 342 place count 1159 transition count 1859
Applied a total of 342 rules in 154 ms. Remains 1159 /1330 variables (removed 171) and now considering 1859/2030 (removed 171) transitions.
Finished structural reductions, in 1 iterations. Remains : 1159/1330 places, 1859/2030 transitions.
Interrupted random walk after 435488 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 46
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 909) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 906) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 906) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 905) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 894) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 894) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 894) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 894) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 894) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 894) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 890) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 890) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 885) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 881) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 880) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 878) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 878) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 878) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 878) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 874) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 874) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 874) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 874) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 874) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 874) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 874) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 869) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 869) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 868) seen :0
Running SMT prover for 868 properties.
[2022-05-17 16:31:22] [INFO ] Flow matrix only has 1649 transitions (discarded 210 similar events)
// Phase 1: matrix 1649 rows 1159 cols
[2022-05-17 16:31:22] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-17 16:31:45] [INFO ] After 22603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:868
[2022-05-17 16:32:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2022-05-17 16:32:00] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 16:32:56] [INFO ] After 41346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :868
[2022-05-17 16:32:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:33:50] [INFO ] After 54718ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :868
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 14 places in 492 ms of which 4 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 36 places in 509 ms of which 2 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 48 places in 495 ms of which 3 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 128 places in 474 ms of which 2 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 159 places in 504 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 150 places in 475 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 149 places in 477 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 154 places in 462 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 11 places in 464 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 0 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 18 places in 466 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 127 places in 463 ms of which 1 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 145 places in 413 ms of which 1 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 1 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 1 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 1 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 121 places in 398 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 180 places in 381 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 151 places in 386 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 125 places in 352 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 45 places in 366 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 41 places in 364 ms of which 1 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 58 places in 385 ms of which 1 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 103 places in 298 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 116 places in 260 ms of which 2 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 12439 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 110 places in 300 ms of which 0 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 100 places in 300 ms of which 1 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 793 ms
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 53 places in 245 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 899 ms
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 120 places in 289 ms of which 1 ms to minimize.
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 1 ms to minimize.
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 1 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 1 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 0 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 0 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2691 ms
[2022-05-17 16:34:09] [INFO ] Deduced a trap composed of 99 places in 304 ms of which 1 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Deduced a trap composed of 45 places in 293 ms of which 1 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Deduced a trap composed of 85 places in 295 ms of which 1 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 1 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 123 places in 231 ms of which 1 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 124 places in 237 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 123 places in 229 ms of which 1 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2389 ms
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 72 places in 242 ms of which 1 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2022-05-17 16:34:12] [INFO ] Deduced a trap composed of 146 places in 212 ms of which 1 ms to minimize.
[2022-05-17 16:34:12] [INFO ] Deduced a trap composed of 149 places in 218 ms of which 1 ms to minimize.
[2022-05-17 16:34:12] [INFO ] Deduced a trap composed of 147 places in 206 ms of which 0 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 150 places in 212 ms of which 0 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 1 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 150 places in 214 ms of which 1 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1689 ms
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:34:14] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:34:14] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 179 places in 351 ms of which 1 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 129 places in 304 ms of which 1 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 111 places in 258 ms of which 1 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 1 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 135 places in 262 ms of which 1 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 89 places in 243 ms of which 1 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 214 places in 248 ms of which 1 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 112 places in 265 ms of which 2 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 2 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 3 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 77 places in 267 ms of which 1 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 90 places in 249 ms of which 1 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 116 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 88 places in 222 ms of which 0 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 150 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 150 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 148 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6717 ms
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 1 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 0 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 0 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 1 ms to minimize.
[2022-05-17 16:34:22] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 1 ms to minimize.
[2022-05-17 16:34:22] [INFO ] Deduced a trap composed of 73 places in 243 ms of which 0 ms to minimize.
[2022-05-17 16:34:22] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 0 ms to minimize.
[2022-05-17 16:34:23] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:34:23] [INFO ] Deduced a trap composed of 99 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:34:23] [INFO ] Deduced a trap composed of 99 places in 192 ms of which 0 ms to minimize.
[2022-05-17 16:34:23] [INFO ] Deduced a trap composed of 100 places in 206 ms of which 1 ms to minimize.
[2022-05-17 16:34:24] [INFO ] Deduced a trap composed of 124 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:34:24] [INFO ] Deduced a trap composed of 124 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:34:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3911 ms
[2022-05-17 16:34:24] [INFO ] Deduced a trap composed of 111 places in 214 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 155 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 100 places in 217 ms of which 1 ms to minimize.
[2022-05-17 16:34:27] [INFO ] Deduced a trap composed of 96 places in 220 ms of which 0 ms to minimize.
[2022-05-17 16:34:27] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 0 ms to minimize.
[2022-05-17 16:34:27] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 0 ms to minimize.
[2022-05-17 16:34:28] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 1 ms to minimize.
[2022-05-17 16:34:28] [INFO ] Deduced a trap composed of 119 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:34:29] [INFO ] Deduced a trap composed of 138 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:34:29] [INFO ] Deduced a trap composed of 86 places in 267 ms of which 1 ms to minimize.
[2022-05-17 16:34:29] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 0 ms to minimize.
[2022-05-17 16:34:29] [INFO ] Deduced a trap composed of 107 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:34:30] [INFO ] Deduced a trap composed of 111 places in 205 ms of which 0 ms to minimize.
[2022-05-17 16:34:30] [INFO ] Deduced a trap composed of 96 places in 207 ms of which 1 ms to minimize.
[2022-05-17 16:34:30] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 0 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 110 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 83 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 0 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 188 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2022-05-17 16:34:33] [INFO ] Deduced a trap composed of 135 places in 294 ms of which 1 ms to minimize.
[2022-05-17 16:34:33] [INFO ] Deduced a trap composed of 89 places in 285 ms of which 1 ms to minimize.
[2022-05-17 16:34:33] [INFO ] Deduced a trap composed of 165 places in 233 ms of which 0 ms to minimize.
[2022-05-17 16:34:33] [INFO ] Deduced a trap composed of 202 places in 235 ms of which 0 ms to minimize.
[2022-05-17 16:34:34] [INFO ] Deduced a trap composed of 138 places in 246 ms of which 1 ms to minimize.
[2022-05-17 16:34:34] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:34:34] [INFO ] Deduced a trap composed of 165 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 165 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 10786 ms
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 1 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2022-05-17 16:34:36] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:34:36] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:34:36] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:34:36] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:34:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 659 ms
[2022-05-17 16:34:37] [INFO ] Deduced a trap composed of 14 places in 344 ms of which 0 ms to minimize.
[2022-05-17 16:34:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2022-05-17 16:34:37] [INFO ] Deduced a trap composed of 34 places in 408 ms of which 1 ms to minimize.
[2022-05-17 16:34:38] [INFO ] Deduced a trap composed of 51 places in 404 ms of which 0 ms to minimize.
[2022-05-17 16:34:38] [INFO ] Deduced a trap composed of 22 places in 407 ms of which 0 ms to minimize.
[2022-05-17 16:34:39] [INFO ] Deduced a trap composed of 10 places in 390 ms of which 0 ms to minimize.
[2022-05-17 16:34:39] [INFO ] Deduced a trap composed of 78 places in 347 ms of which 1 ms to minimize.
[2022-05-17 16:34:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2372 ms
[2022-05-17 16:34:40] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 1 ms to minimize.
[2022-05-17 16:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2022-05-17 16:34:40] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 1 ms to minimize.
[2022-05-17 16:34:41] [INFO ] Deduced a trap composed of 61 places in 379 ms of which 0 ms to minimize.
[2022-05-17 16:34:41] [INFO ] Deduced a trap composed of 35 places in 370 ms of which 1 ms to minimize.
[2022-05-17 16:34:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1418 ms
[2022-05-17 16:34:42] [INFO ] Deduced a trap composed of 108 places in 378 ms of which 0 ms to minimize.
[2022-05-17 16:34:42] [INFO ] Deduced a trap composed of 63 places in 385 ms of which 1 ms to minimize.
[2022-05-17 16:34:43] [INFO ] Deduced a trap composed of 114 places in 402 ms of which 0 ms to minimize.
[2022-05-17 16:34:43] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2022-05-17 16:34:44] [INFO ] Deduced a trap composed of 92 places in 374 ms of which 1 ms to minimize.
[2022-05-17 16:34:44] [INFO ] Deduced a trap composed of 63 places in 368 ms of which 1 ms to minimize.
[2022-05-17 16:34:44] [INFO ] Deduced a trap composed of 10 places in 388 ms of which 1 ms to minimize.
[2022-05-17 16:34:45] [INFO ] Deduced a trap composed of 65 places in 363 ms of which 1 ms to minimize.
[2022-05-17 16:34:45] [INFO ] Deduced a trap composed of 49 places in 361 ms of which 0 ms to minimize.
[2022-05-17 16:34:46] [INFO ] Deduced a trap composed of 35 places in 356 ms of which 1 ms to minimize.
[2022-05-17 16:34:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4526 ms
[2022-05-17 16:34:47] [INFO ] Deduced a trap composed of 96 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:34:47] [INFO ] Deduced a trap composed of 96 places in 224 ms of which 0 ms to minimize.
[2022-05-17 16:34:47] [INFO ] Deduced a trap composed of 95 places in 223 ms of which 1 ms to minimize.
[2022-05-17 16:34:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 940 ms
[2022-05-17 16:34:48] [INFO ] Deduced a trap composed of 39 places in 396 ms of which 1 ms to minimize.
[2022-05-17 16:34:49] [INFO ] Deduced a trap composed of 22 places in 373 ms of which 1 ms to minimize.
[2022-05-17 16:34:49] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 1 ms to minimize.
[2022-05-17 16:34:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1405 ms
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 161 places in 356 ms of which 1 ms to minimize.
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 58 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 138 places in 345 ms of which 1 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 121 places in 347 ms of which 1 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 58 places in 349 ms of which 1 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 0 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2469 ms
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2022-05-17 16:34:53] [INFO ] Deduced a trap composed of 124 places in 218 ms of which 1 ms to minimize.
[2022-05-17 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2022-05-17 16:34:53] [INFO ] Deduced a trap composed of 106 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2022-05-17 16:34:55] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 1 ms to minimize.
[2022-05-17 16:34:55] [INFO ] Deduced a trap composed of 66 places in 305 ms of which 1 ms to minimize.
[2022-05-17 16:34:55] [INFO ] Deduced a trap composed of 132 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:34:55] [INFO ] Deduced a trap composed of 161 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:34:56] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:34:56] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:34:56] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:34:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2245 ms
[2022-05-17 16:34:58] [INFO ] Deduced a trap composed of 101 places in 308 ms of which 1 ms to minimize.
[2022-05-17 16:34:58] [INFO ] Deduced a trap composed of 147 places in 237 ms of which 1 ms to minimize.
[2022-05-17 16:34:58] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:34:59] [INFO ] Deduced a trap composed of 25 places in 315 ms of which 1 ms to minimize.
[2022-05-17 16:34:59] [INFO ] Deduced a trap composed of 154 places in 238 ms of which 0 ms to minimize.
[2022-05-17 16:35:00] [INFO ] Deduced a trap composed of 127 places in 242 ms of which 0 ms to minimize.
[2022-05-17 16:35:00] [INFO ] Deduced a trap composed of 131 places in 240 ms of which 0 ms to minimize.
[2022-05-17 16:35:00] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 1 ms to minimize.
[2022-05-17 16:35:01] [INFO ] Deduced a trap composed of 157 places in 246 ms of which 1 ms to minimize.
[2022-05-17 16:35:01] [INFO ] Deduced a trap composed of 131 places in 242 ms of which 4 ms to minimize.
[2022-05-17 16:35:01] [INFO ] Deduced a trap composed of 155 places in 237 ms of which 1 ms to minimize.
[2022-05-17 16:35:02] [INFO ] Deduced a trap composed of 157 places in 237 ms of which 1 ms to minimize.
[2022-05-17 16:35:02] [INFO ] Deduced a trap composed of 130 places in 237 ms of which 1 ms to minimize.
[2022-05-17 16:35:02] [INFO ] Deduced a trap composed of 157 places in 243 ms of which 1 ms to minimize.
[2022-05-17 16:35:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5073 ms
[2022-05-17 16:35:03] [INFO ] Deduced a trap composed of 79 places in 262 ms of which 0 ms to minimize.
[2022-05-17 16:35:03] [INFO ] Deduced a trap composed of 111 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:35:03] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:35:04] [INFO ] Deduced a trap composed of 185 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:35:04] [INFO ] Deduced a trap composed of 188 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:35:05] [INFO ] Deduced a trap composed of 126 places in 343 ms of which 1 ms to minimize.
[2022-05-17 16:35:06] [INFO ] Deduced a trap composed of 111 places in 302 ms of which 1 ms to minimize.
[2022-05-17 16:35:06] [INFO ] Deduced a trap composed of 162 places in 308 ms of which 1 ms to minimize.
[2022-05-17 16:35:06] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:35:06] [INFO ] Deduced a trap composed of 110 places in 229 ms of which 1 ms to minimize.
[2022-05-17 16:35:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4062 ms
[2022-05-17 16:35:07] [INFO ] Deduced a trap composed of 107 places in 290 ms of which 1 ms to minimize.
[2022-05-17 16:35:07] [INFO ] Deduced a trap composed of 130 places in 235 ms of which 1 ms to minimize.
[2022-05-17 16:35:07] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 0 ms to minimize.
[2022-05-17 16:35:08] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:35:08] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:35:08] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:35:08] [INFO ] Deduced a trap composed of 130 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:35:09] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:35:09] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:35:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2412 ms
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 10 places in 397 ms of which 1 ms to minimize.
[2022-05-17 16:35:11] [INFO ] Deduced a trap composed of 80 places in 279 ms of which 1 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 76 places in 278 ms of which 1 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 80 places in 293 ms of which 0 ms to minimize.
[2022-05-17 16:35:12] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 1 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 80 places in 272 ms of which 0 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2022-05-17 16:35:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3065 ms
[2022-05-17 16:35:14] [INFO ] Deduced a trap composed of 38 places in 356 ms of which 1 ms to minimize.
[2022-05-17 16:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 1 ms to minimize.
[2022-05-17 16:35:15] [INFO ] Deduced a trap composed of 57 places in 320 ms of which 1 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 1 ms to minimize.
[2022-05-17 16:35:16] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 1 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 0 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 1 ms to minimize.
[2022-05-17 16:35:17] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 1 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 1 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 1 ms to minimize.
[2022-05-17 16:35:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3954 ms
[2022-05-17 16:35:19] [INFO ] Deduced a trap composed of 45 places in 405 ms of which 3 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 115 places in 376 ms of which 1 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 1 ms to minimize.
[2022-05-17 16:35:20] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 1 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 0 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 0 ms to minimize.
[2022-05-17 16:35:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2623 ms
[2022-05-17 16:35:22] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 48 places in 337 ms of which 1 ms to minimize.
[2022-05-17 16:35:23] [INFO ] Deduced a trap composed of 58 places in 334 ms of which 1 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 58 places in 334 ms of which 1 ms to minimize.
[2022-05-17 16:35:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1274 ms
[2022-05-17 16:35:24] [INFO ] Deduced a trap composed of 103 places in 337 ms of which 1 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 67 places in 307 ms of which 0 ms to minimize.
[2022-05-17 16:35:25] [INFO ] Deduced a trap composed of 106 places in 326 ms of which 1 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 72 places in 328 ms of which 1 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Deduced a trap composed of 107 places in 325 ms of which 1 ms to minimize.
[2022-05-17 16:35:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2026 ms
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 89 places in 288 ms of which 0 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2022-05-17 16:35:28] [INFO ] Deduced a trap composed of 116 places in 235 ms of which 1 ms to minimize.
[2022-05-17 16:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2022-05-17 16:35:29] [INFO ] Deduced a trap composed of 82 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2022-05-17 16:35:29] [INFO ] Deduced a trap composed of 82 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 844 ms
[2022-05-17 16:35:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:35:30] [INFO ] After 225020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:868
Parikh walk visited 10 properties in 30040 ms.
Support contains 858 out of 1159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1159/1159 places, 1859/1859 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 1159 transition count 1808
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 1108 transition count 1808
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 102 place count 1108 transition count 1785
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 148 place count 1085 transition count 1785
Applied a total of 148 rules in 61 ms. Remains 1085 /1159 variables (removed 74) and now considering 1785/1859 (removed 74) transitions.
Finished structural reductions, in 1 iterations. Remains : 1085/1159 places, 1785/1859 transitions.
Interrupted random walk after 414792 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 28
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 830) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 828) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 824) seen :0
Probabilistic random walk after 1000000 steps, saw 135293 distinct states, run finished after 15263 ms. (steps per millisecond=65 ) properties seen :19
Running SMT prover for 805 properties.
[2022-05-17 16:36:46] [INFO ] Flow matrix only has 1575 transitions (discarded 210 similar events)
// Phase 1: matrix 1575 rows 1085 cols
[2022-05-17 16:36:46] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-17 16:37:05] [INFO ] After 19386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:805
[2022-05-17 16:37:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-17 16:37:18] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 16:38:07] [INFO ] After 36780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :805
[2022-05-17 16:38:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:38:56] [INFO ] After 48414ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :805
[2022-05-17 16:38:56] [INFO ] Deduced a trap composed of 157 places in 401 ms of which 1 ms to minimize.
[2022-05-17 16:38:57] [INFO ] Deduced a trap composed of 144 places in 381 ms of which 1 ms to minimize.
[2022-05-17 16:38:57] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 1 ms to minimize.
[2022-05-17 16:38:58] [INFO ] Deduced a trap composed of 16 places in 377 ms of which 1 ms to minimize.
[2022-05-17 16:38:58] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 1 ms to minimize.
[2022-05-17 16:38:58] [INFO ] Deduced a trap composed of 18 places in 400 ms of which 1 ms to minimize.
[2022-05-17 16:38:59] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 1 ms to minimize.
[2022-05-17 16:38:59] [INFO ] Deduced a trap composed of 11 places in 401 ms of which 1 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 17 places in 395 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 1 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 61 places in 356 ms of which 1 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 1 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 20 places in 355 ms of which 1 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 1 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 37 places in 352 ms of which 1 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 43 places in 352 ms of which 0 ms to minimize.
[2022-05-17 16:39:03] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 1 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 34 places in 342 ms of which 1 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 1 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 25 places in 364 ms of which 1 ms to minimize.
[2022-05-17 16:39:05] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 1 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 1 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 21 places in 374 ms of which 0 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 106 places in 368 ms of which 1 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 32 places in 368 ms of which 1 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 100 places in 313 ms of which 1 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 97 places in 309 ms of which 0 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 253 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:39:08] [INFO ] Deduced a trap composed of 76 places in 284 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 123 places in 284 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 1 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 117 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 1 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 1 ms to minimize.
[2022-05-17 16:39:10] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 0 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 270 places in 216 ms of which 1 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 205 places in 213 ms of which 1 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 1 ms to minimize.
[2022-05-17 16:39:11] [INFO ] Deduced a trap composed of 100 places in 215 ms of which 1 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 24 places in 342 ms of which 1 ms to minimize.
[2022-05-17 16:39:12] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 0 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 88 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:39:13] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 0 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 66 places in 295 ms of which 1 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 0 ms to minimize.
[2022-05-17 16:39:14] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 147 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 145 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:39:15] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 145 places in 183 ms of which 1 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:39:16] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 20583 ms
[2022-05-17 16:39:17] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 1 ms to minimize.
[2022-05-17 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2022-05-17 16:39:17] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2022-05-17 16:39:18] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 0 ms to minimize.
[2022-05-17 16:39:18] [INFO ] Deduced a trap composed of 117 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:39:18] [INFO ] Deduced a trap composed of 114 places in 258 ms of which 1 ms to minimize.
[2022-05-17 16:39:18] [INFO ] Deduced a trap composed of 131 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 188 places in 253 ms of which 1 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:39:19] [INFO ] Deduced a trap composed of 109 places in 255 ms of which 0 ms to minimize.
[2022-05-17 16:39:20] [INFO ] Deduced a trap composed of 145 places in 258 ms of which 0 ms to minimize.
[2022-05-17 16:39:20] [INFO ] Deduced a trap composed of 145 places in 255 ms of which 1 ms to minimize.
[2022-05-17 16:39:20] [INFO ] Deduced a trap composed of 108 places in 262 ms of which 1 ms to minimize.
[2022-05-17 16:39:21] [INFO ] Deduced a trap composed of 73 places in 236 ms of which 0 ms to minimize.
[2022-05-17 16:39:21] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 1 ms to minimize.
[2022-05-17 16:39:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3814 ms
[2022-05-17 16:39:21] [INFO ] Deduced a trap composed of 106 places in 232 ms of which 1 ms to minimize.
[2022-05-17 16:39:22] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 1 ms to minimize.
[2022-05-17 16:39:22] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 0 ms to minimize.
[2022-05-17 16:39:22] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 0 ms to minimize.
[2022-05-17 16:39:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1261 ms
[2022-05-17 16:39:23] [INFO ] Deduced a trap composed of 73 places in 230 ms of which 0 ms to minimize.
[2022-05-17 16:39:23] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 0 ms to minimize.
[2022-05-17 16:39:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 645 ms
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 0 ms to minimize.
[2022-05-17 16:39:24] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 174 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:39:25] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:39:26] [INFO ] Deduced a trap composed of 37 places in 364 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 52 places in 327 ms of which 0 ms to minimize.
[2022-05-17 16:39:27] [INFO ] Deduced a trap composed of 98 places in 330 ms of which 1 ms to minimize.
[2022-05-17 16:39:28] [INFO ] Deduced a trap composed of 52 places in 328 ms of which 0 ms to minimize.
[2022-05-17 16:39:28] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 0 ms to minimize.
[2022-05-17 16:39:28] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 1 ms to minimize.
[2022-05-17 16:39:29] [INFO ] Deduced a trap composed of 160 places in 273 ms of which 0 ms to minimize.
[2022-05-17 16:39:29] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 1 ms to minimize.
[2022-05-17 16:39:30] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 0 ms to minimize.
[2022-05-17 16:39:30] [INFO ] Deduced a trap composed of 86 places in 266 ms of which 1 ms to minimize.
[2022-05-17 16:39:30] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 0 ms to minimize.
[2022-05-17 16:39:31] [INFO ] Deduced a trap composed of 96 places in 280 ms of which 1 ms to minimize.
[2022-05-17 16:39:31] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6776 ms
[2022-05-17 16:39:31] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 0 ms to minimize.
[2022-05-17 16:39:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2022-05-17 16:39:32] [INFO ] Deduced a trap composed of 67 places in 290 ms of which 1 ms to minimize.
[2022-05-17 16:39:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2022-05-17 16:39:32] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2022-05-17 16:39:32] [INFO ] Deduced a trap composed of 85 places in 236 ms of which 1 ms to minimize.
[2022-05-17 16:39:33] [INFO ] Deduced a trap composed of 75 places in 241 ms of which 0 ms to minimize.
[2022-05-17 16:39:33] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:39:33] [INFO ] Deduced a trap composed of 140 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:39:33] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:39:34] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:39:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1862 ms
[2022-05-17 16:39:34] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:39:34] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:39:34] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:39:34] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:39:35] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:39:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 953 ms
[2022-05-17 16:39:35] [INFO ] Deduced a trap composed of 52 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:39:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2022-05-17 16:39:36] [INFO ] Deduced a trap composed of 85 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:39:36] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:39:36] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:39:37] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:39:37] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:39:37] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:39:37] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:39:38] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:39:38] [INFO ] Deduced a trap composed of 47 places in 338 ms of which 1 ms to minimize.
[2022-05-17 16:39:39] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 1 ms to minimize.
[2022-05-17 16:39:39] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:39:40] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 1 ms to minimize.
[2022-05-17 16:39:40] [INFO ] Deduced a trap composed of 97 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:39:40] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 0 ms to minimize.
[2022-05-17 16:39:41] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 1 ms to minimize.
[2022-05-17 16:39:41] [INFO ] Deduced a trap composed of 121 places in 227 ms of which 0 ms to minimize.
[2022-05-17 16:39:41] [INFO ] Deduced a trap composed of 124 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:39:42] [INFO ] Deduced a trap composed of 124 places in 230 ms of which 1 ms to minimize.
[2022-05-17 16:39:42] [INFO ] Deduced a trap composed of 127 places in 224 ms of which 1 ms to minimize.
[2022-05-17 16:39:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6255 ms
[2022-05-17 16:39:43] [INFO ] Deduced a trap composed of 10 places in 401 ms of which 1 ms to minimize.
[2022-05-17 16:39:43] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 0 ms to minimize.
[2022-05-17 16:39:43] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:39:44] [INFO ] Deduced a trap composed of 124 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:39:44] [INFO ] Deduced a trap composed of 46 places in 272 ms of which 1 ms to minimize.
[2022-05-17 16:39:44] [INFO ] Deduced a trap composed of 124 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:39:45] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 1 ms to minimize.
[2022-05-17 16:39:45] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 0 ms to minimize.
[2022-05-17 16:39:46] [INFO ] Deduced a trap composed of 121 places in 295 ms of which 0 ms to minimize.
[2022-05-17 16:39:46] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 0 ms to minimize.
[2022-05-17 16:39:46] [INFO ] Deduced a trap composed of 147 places in 261 ms of which 1 ms to minimize.
[2022-05-17 16:39:47] [INFO ] Deduced a trap composed of 84 places in 318 ms of which 1 ms to minimize.
[2022-05-17 16:39:47] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 0 ms to minimize.
[2022-05-17 16:39:48] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 1 ms to minimize.
[2022-05-17 16:39:48] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 0 ms to minimize.
[2022-05-17 16:39:48] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 1 ms to minimize.
[2022-05-17 16:39:48] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6096 ms
[2022-05-17 16:39:49] [INFO ] Deduced a trap composed of 107 places in 261 ms of which 1 ms to minimize.
[2022-05-17 16:39:49] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:39:49] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:39:50] [INFO ] Deduced a trap composed of 66 places in 299 ms of which 1 ms to minimize.
[2022-05-17 16:39:50] [INFO ] Deduced a trap composed of 97 places in 233 ms of which 1 ms to minimize.
[2022-05-17 16:39:51] [INFO ] Deduced a trap composed of 71 places in 236 ms of which 0 ms to minimize.
[2022-05-17 16:39:51] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:39:51] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:39:51] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:39:51] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:39:52] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:39:52] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:39:52] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:39:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3782 ms
[2022-05-17 16:39:52] [INFO ] Deduced a trap composed of 123 places in 224 ms of which 0 ms to minimize.
[2022-05-17 16:39:53] [INFO ] Deduced a trap composed of 144 places in 220 ms of which 0 ms to minimize.
[2022-05-17 16:39:53] [INFO ] Deduced a trap composed of 122 places in 222 ms of which 1 ms to minimize.
[2022-05-17 16:39:53] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 0 ms to minimize.
[2022-05-17 16:39:54] [INFO ] Deduced a trap composed of 146 places in 223 ms of which 0 ms to minimize.
[2022-05-17 16:39:54] [INFO ] Deduced a trap composed of 146 places in 226 ms of which 0 ms to minimize.
[2022-05-17 16:39:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1774 ms
[2022-05-17 16:39:54] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 1 ms to minimize.
[2022-05-17 16:39:55] [INFO ] Deduced a trap composed of 60 places in 319 ms of which 1 ms to minimize.
[2022-05-17 16:39:55] [INFO ] Deduced a trap composed of 139 places in 266 ms of which 0 ms to minimize.
[2022-05-17 16:39:56] [INFO ] Deduced a trap composed of 96 places in 192 ms of which 0 ms to minimize.
[2022-05-17 16:39:56] [INFO ] Deduced a trap composed of 140 places in 204 ms of which 0 ms to minimize.
[2022-05-17 16:39:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1951 ms
[2022-05-17 16:39:57] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 1 ms to minimize.
[2022-05-17 16:39:57] [INFO ] Deduced a trap composed of 52 places in 320 ms of which 1 ms to minimize.
[2022-05-17 16:39:58] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 0 ms to minimize.
[2022-05-17 16:39:58] [INFO ] Deduced a trap composed of 46 places in 314 ms of which 1 ms to minimize.
[2022-05-17 16:39:59] [INFO ] Deduced a trap composed of 151 places in 254 ms of which 0 ms to minimize.
[2022-05-17 16:39:59] [INFO ] Deduced a trap composed of 151 places in 252 ms of which 0 ms to minimize.
[2022-05-17 16:39:59] [INFO ] Deduced a trap composed of 154 places in 252 ms of which 0 ms to minimize.
[2022-05-17 16:40:00] [INFO ] Deduced a trap composed of 148 places in 247 ms of which 0 ms to minimize.
[2022-05-17 16:40:00] [INFO ] Deduced a trap composed of 151 places in 248 ms of which 1 ms to minimize.
[2022-05-17 16:40:00] [INFO ] Deduced a trap composed of 154 places in 255 ms of which 1 ms to minimize.
[2022-05-17 16:40:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3852 ms
[2022-05-17 16:40:01] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:40:01] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:40:02] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 1 ms to minimize.
[2022-05-17 16:40:02] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:40:03] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:40:03] [INFO ] Deduced a trap composed of 100 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:40:03] [INFO ] Deduced a trap composed of 100 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:40:03] [INFO ] Deduced a trap composed of 124 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:40:03] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:40:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3188 ms
[2022-05-17 16:40:04] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 0 ms to minimize.
[2022-05-17 16:40:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2022-05-17 16:40:07] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 1 ms to minimize.
[2022-05-17 16:40:07] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:40:07] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:40:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 855 ms
[2022-05-17 16:40:07] [INFO ] Deduced a trap composed of 44 places in 271 ms of which 1 ms to minimize.
[2022-05-17 16:40:08] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 0 ms to minimize.
[2022-05-17 16:40:08] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 1 ms to minimize.
[2022-05-17 16:40:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1046 ms
[2022-05-17 16:40:09] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 1 ms to minimize.
[2022-05-17 16:40:09] [INFO ] Deduced a trap composed of 32 places in 381 ms of which 1 ms to minimize.
[2022-05-17 16:40:10] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 1 ms to minimize.
[2022-05-17 16:40:10] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 1 ms to minimize.
[2022-05-17 16:40:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1734 ms
[2022-05-17 16:40:11] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2022-05-17 16:40:11] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 1 ms to minimize.
[2022-05-17 16:40:11] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 0 ms to minimize.
[2022-05-17 16:40:12] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:40:12] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:40:12] [INFO ] Deduced a trap composed of 124 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:40:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2090 ms
[2022-05-17 16:40:13] [INFO ] Deduced a trap composed of 10 places in 373 ms of which 1 ms to minimize.
[2022-05-17 16:40:14] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:40:14] [INFO ] Deduced a trap composed of 98 places in 320 ms of which 0 ms to minimize.
[2022-05-17 16:40:14] [INFO ] Deduced a trap composed of 76 places in 311 ms of which 1 ms to minimize.
[2022-05-17 16:40:15] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 1 ms to minimize.
[2022-05-17 16:40:15] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 0 ms to minimize.
[2022-05-17 16:40:15] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:40:16] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:40:16] [INFO ] Deduced a trap composed of 83 places in 335 ms of which 1 ms to minimize.
[2022-05-17 16:40:16] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 0 ms to minimize.
[2022-05-17 16:40:17] [INFO ] Deduced a trap composed of 70 places in 282 ms of which 1 ms to minimize.
[2022-05-17 16:40:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3934 ms
[2022-05-17 16:40:17] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 1 ms to minimize.
[2022-05-17 16:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2022-05-17 16:40:18] [INFO ] Deduced a trap composed of 41 places in 313 ms of which 1 ms to minimize.
[2022-05-17 16:40:18] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 0 ms to minimize.
[2022-05-17 16:40:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 759 ms
[2022-05-17 16:40:19] [INFO ] Deduced a trap composed of 52 places in 314 ms of which 1 ms to minimize.
[2022-05-17 16:40:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2022-05-17 16:40:19] [INFO ] Deduced a trap composed of 63 places in 378 ms of which 1 ms to minimize.
[2022-05-17 16:40:20] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 1 ms to minimize.
[2022-05-17 16:40:20] [INFO ] Deduced a trap composed of 91 places in 335 ms of which 1 ms to minimize.
[2022-05-17 16:40:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1340 ms
[2022-05-17 16:40:21] [INFO ] Deduced a trap composed of 86 places in 279 ms of which 1 ms to minimize.
[2022-05-17 16:40:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2022-05-17 16:40:22] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 1 ms to minimize.
[2022-05-17 16:40:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2022-05-17 16:40:22] [INFO ] Deduced a trap composed of 119 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:40:23] [INFO ] Deduced a trap composed of 116 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:40:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2022-05-17 16:40:24] [INFO ] Deduced a trap composed of 78 places in 253 ms of which 1 ms to minimize.
[2022-05-17 16:40:24] [INFO ] Deduced a trap composed of 94 places in 249 ms of which 1 ms to minimize.
[2022-05-17 16:40:24] [INFO ] Deduced a trap composed of 108 places in 232 ms of which 1 ms to minimize.
[2022-05-17 16:40:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 985 ms
[2022-05-17 16:40:25] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 1 ms to minimize.
[2022-05-17 16:40:25] [INFO ] Deduced a trap composed of 52 places in 276 ms of which 1 ms to minimize.
[2022-05-17 16:40:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 747 ms
[2022-05-17 16:40:26] [INFO ] Deduced a trap composed of 150 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:40:26] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:40:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2022-05-17 16:40:27] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:40:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2022-05-17 16:40:29] [INFO ] Deduced a trap composed of 129 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:40:29] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:40:29] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:40:29] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:40:30] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:40:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1217 ms
[2022-05-17 16:40:32] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2022-05-17 16:40:32] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:40:33] [INFO ] Deduced a trap composed of 10 places in 330 ms of which 0 ms to minimize.
[2022-05-17 16:40:33] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 1 ms to minimize.
[2022-05-17 16:40:33] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 0 ms to minimize.
[2022-05-17 16:40:34] [INFO ] Deduced a trap composed of 78 places in 337 ms of which 0 ms to minimize.
[2022-05-17 16:40:34] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 1 ms to minimize.
[2022-05-17 16:40:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3010 ms
[2022-05-17 16:40:35] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 1 ms to minimize.
[2022-05-17 16:40:35] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:40:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 781 ms
[2022-05-17 16:40:36] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 1 ms to minimize.
[2022-05-17 16:40:37] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 1 ms to minimize.
[2022-05-17 16:40:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 831 ms
[2022-05-17 16:40:37] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 0 ms to minimize.
[2022-05-17 16:40:38] [INFO ] Deduced a trap composed of 107 places in 248 ms of which 1 ms to minimize.
[2022-05-17 16:40:38] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:40:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1008 ms
[2022-05-17 16:40:39] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 1 ms to minimize.
[2022-05-17 16:40:39] [INFO ] Deduced a trap composed of 95 places in 355 ms of which 1 ms to minimize.
[2022-05-17 16:40:39] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:40:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1022 ms
[2022-05-17 16:40:40] [INFO ] Deduced a trap composed of 58 places in 320 ms of which 1 ms to minimize.
[2022-05-17 16:40:41] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 1 ms to minimize.
[2022-05-17 16:40:41] [INFO ] Deduced a trap composed of 12 places in 371 ms of which 1 ms to minimize.
[2022-05-17 16:40:41] [INFO ] Deduced a trap composed of 61 places in 308 ms of which 1 ms to minimize.
[2022-05-17 16:40:42] [INFO ] Deduced a trap composed of 87 places in 314 ms of which 1 ms to minimize.
[2022-05-17 16:40:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2042 ms
[2022-05-17 16:40:42] [INFO ] Deduced a trap composed of 100 places in 227 ms of which 1 ms to minimize.
[2022-05-17 16:40:42] [INFO ] Deduced a trap composed of 96 places in 220 ms of which 0 ms to minimize.
[2022-05-17 16:40:43] [INFO ] Deduced a trap composed of 134 places in 219 ms of which 1 ms to minimize.
[2022-05-17 16:40:43] [INFO ] Deduced a trap composed of 100 places in 281 ms of which 1 ms to minimize.
[2022-05-17 16:40:43] [INFO ] Deduced a trap composed of 90 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:40:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1636 ms
[2022-05-17 16:40:44] [INFO ] Deduced a trap composed of 92 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:40:44] [INFO ] Deduced a trap composed of 95 places in 267 ms of which 1 ms to minimize.
[2022-05-17 16:40:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 736 ms
[2022-05-17 16:40:45] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 0 ms to minimize.
[2022-05-17 16:40:45] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:40:45] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 0 ms to minimize.
[2022-05-17 16:40:46] [INFO ] Deduced a trap composed of 68 places in 242 ms of which 0 ms to minimize.
[2022-05-17 16:40:46] [INFO ] Deduced a trap composed of 69 places in 280 ms of which 0 ms to minimize.
[2022-05-17 16:40:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1690 ms
[2022-05-17 16:40:47] [INFO ] Deduced a trap composed of 108 places in 270 ms of which 1 ms to minimize.
[2022-05-17 16:40:47] [INFO ] Deduced a trap composed of 105 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:40:48] [INFO ] Deduced a trap composed of 126 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:40:48] [INFO ] Deduced a trap composed of 108 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:40:48] [INFO ] Deduced a trap composed of 108 places in 263 ms of which 1 ms to minimize.
[2022-05-17 16:40:49] [INFO ] Deduced a trap composed of 81 places in 257 ms of which 1 ms to minimize.
[2022-05-17 16:40:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2078 ms
[2022-05-17 16:40:50] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 1 ms to minimize.
[2022-05-17 16:40:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2022-05-17 16:40:50] [INFO ] Deduced a trap composed of 201 places in 271 ms of which 1 ms to minimize.
[2022-05-17 16:40:51] [INFO ] Deduced a trap composed of 2 places in 479 ms of which 1 ms to minimize.
[2022-05-17 16:40:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:40:51] [INFO ] After 225497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:805
Parikh walk visited 0 properties in 30014 ms.
Support contains 805 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1085/1085 places, 1785/1785 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1085 transition count 1757
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1057 transition count 1757
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 56 place count 1057 transition count 1744
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 82 place count 1044 transition count 1744
Applied a total of 82 rules in 46 ms. Remains 1044 /1085 variables (removed 41) and now considering 1744/1785 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 1044/1085 places, 1744/1785 transitions.
Interrupted random walk after 432053 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 797) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 797) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 794) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 794) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 792) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 792) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 791) seen :0
Probabilistic random walk after 1000000 steps, saw 132337 distinct states, run finished after 14520 ms. (steps per millisecond=68 ) properties seen :16
Running SMT prover for 775 properties.
[2022-05-17 16:42:07] [INFO ] Flow matrix only has 1534 transitions (discarded 210 similar events)
// Phase 1: matrix 1534 rows 1044 cols
[2022-05-17 16:42:07] [INFO ] Computed 27 place invariants in 15 ms
[2022-05-17 16:42:25] [INFO ] After 18531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:775
[2022-05-17 16:42:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2022-05-17 16:42:37] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 16:43:24] [INFO ] After 34578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :775
[2022-05-17 16:43:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:44:10] [INFO ] After 45933ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :775
[2022-05-17 16:44:10] [INFO ] Deduced a trap composed of 10 places in 387 ms of which 1 ms to minimize.
[2022-05-17 16:44:10] [INFO ] Deduced a trap composed of 279 places in 383 ms of which 1 ms to minimize.
[2022-05-17 16:44:11] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 1 ms to minimize.
[2022-05-17 16:44:11] [INFO ] Deduced a trap composed of 20 places in 377 ms of which 0 ms to minimize.
[2022-05-17 16:44:12] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2022-05-17 16:44:12] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 1 ms to minimize.
[2022-05-17 16:44:13] [INFO ] Deduced a trap composed of 16 places in 375 ms of which 1 ms to minimize.
[2022-05-17 16:44:13] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 0 ms to minimize.
[2022-05-17 16:44:13] [INFO ] Deduced a trap composed of 185 places in 336 ms of which 1 ms to minimize.
[2022-05-17 16:44:14] [INFO ] Deduced a trap composed of 216 places in 314 ms of which 1 ms to minimize.
[2022-05-17 16:44:14] [INFO ] Deduced a trap composed of 129 places in 318 ms of which 0 ms to minimize.
[2022-05-17 16:44:15] [INFO ] Deduced a trap composed of 124 places in 322 ms of which 1 ms to minimize.
[2022-05-17 16:44:15] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 0 ms to minimize.
[2022-05-17 16:44:15] [INFO ] Deduced a trap composed of 73 places in 287 ms of which 0 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 112 places in 293 ms of which 1 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 71 places in 295 ms of which 0 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 64 places in 289 ms of which 0 ms to minimize.
[2022-05-17 16:44:17] [INFO ] Deduced a trap composed of 112 places in 296 ms of which 0 ms to minimize.
[2022-05-17 16:44:17] [INFO ] Deduced a trap composed of 68 places in 291 ms of which 1 ms to minimize.
[2022-05-17 16:44:17] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 1 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 1 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 1 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 1 ms to minimize.
[2022-05-17 16:44:19] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 0 ms to minimize.
[2022-05-17 16:44:19] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 1 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 35 places in 305 ms of which 1 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 44 places in 308 ms of which 1 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 1 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 97 places in 266 ms of which 1 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 70 places in 321 ms of which 1 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 0 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 0 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 1 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 1 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 75 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 0 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 85 places in 276 ms of which 1 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 73 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 105 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 29 places in 257 ms of which 1 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 0 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 0 ms to minimize.
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 109 places in 245 ms of which 1 ms to minimize.
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 0 ms to minimize.
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 2 ms to minimize.
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 1 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 1 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 17300 ms
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 221 places in 217 ms of which 0 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 221 places in 216 ms of which 1 ms to minimize.
[2022-05-17 16:44:28] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 0 ms to minimize.
[2022-05-17 16:44:28] [INFO ] Deduced a trap composed of 88 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:44:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1148 ms
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 0 ms to minimize.
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2022-05-17 16:44:30] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 0 ms to minimize.
[2022-05-17 16:44:30] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 0 ms to minimize.
[2022-05-17 16:44:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1593 ms
[2022-05-17 16:44:30] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 996 ms
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 2 ms to minimize.
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 0 ms to minimize.
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 1 ms to minimize.
[2022-05-17 16:44:33] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:44:33] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 0 ms to minimize.
[2022-05-17 16:44:33] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 1 ms to minimize.
[2022-05-17 16:44:34] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 1 ms to minimize.
[2022-05-17 16:44:34] [INFO ] Deduced a trap composed of 24 places in 346 ms of which 1 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 1 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 58 places in 330 ms of which 1 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 62 places in 290 ms of which 0 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 1 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 1 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 0 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 1 ms to minimize.
[2022-05-17 16:44:38] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:44:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6413 ms
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 0 ms to minimize.
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 115 places in 287 ms of which 0 ms to minimize.
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 74 places in 289 ms of which 1 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 91 places in 287 ms of which 0 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1965 ms
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 0 ms to minimize.
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 52 places in 276 ms of which 1 ms to minimize.
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 0 ms to minimize.
[2022-05-17 16:44:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1107 ms
[2022-05-17 16:44:42] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2022-05-17 16:44:42] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 1 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 97 places in 314 ms of which 1 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 94 places in 308 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 97 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 127 places in 312 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 124 places in 308 ms of which 1 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 124 places in 310 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 127 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 121 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 121 places in 311 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5271 ms
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 1 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 1 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 73 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 102 places in 258 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 1 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 105 places in 257 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 105 places in 252 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 1 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 112 places in 236 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 85 places in 235 ms of which 1 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 109 places in 237 ms of which 1 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 81 places in 222 ms of which 4 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4452 ms
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 95 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1460 ms
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 140 places in 239 ms of which 1 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 139 places in 231 ms of which 1 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 91 places in 245 ms of which 1 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 1 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 91 places in 244 ms of which 1 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 136 places in 246 ms of which 1 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 116 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 143 places in 212 ms of which 1 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 139 places in 211 ms of which 1 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5282 ms
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 70 places in 244 ms of which 0 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 1 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 148 places in 276 ms of which 0 ms to minimize.
[2022-05-17 16:45:00] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 1 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 148 places in 205 ms of which 1 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 148 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1886 ms
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:45:01] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:45:02] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 37 places in 315 ms of which 1 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 1 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 81 places in 288 ms of which 0 ms to minimize.
[2022-05-17 16:45:04] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 1 ms to minimize.
[2022-05-17 16:45:04] [INFO ] Deduced a trap composed of 111 places in 229 ms of which 0 ms to minimize.
[2022-05-17 16:45:04] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 1 ms to minimize.
[2022-05-17 16:45:04] [INFO ] Deduced a trap composed of 90 places in 227 ms of which 0 ms to minimize.
[2022-05-17 16:45:05] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 1 ms to minimize.
[2022-05-17 16:45:05] [INFO ] Deduced a trap composed of 91 places in 229 ms of which 1 ms to minimize.
[2022-05-17 16:45:05] [INFO ] Deduced a trap composed of 87 places in 227 ms of which 0 ms to minimize.
[2022-05-17 16:45:06] [INFO ] Deduced a trap composed of 119 places in 230 ms of which 1 ms to minimize.
[2022-05-17 16:45:06] [INFO ] Deduced a trap composed of 138 places in 232 ms of which 1 ms to minimize.
[2022-05-17 16:45:06] [INFO ] Deduced a trap composed of 115 places in 237 ms of which 0 ms to minimize.
[2022-05-17 16:45:07] [INFO ] Deduced a trap composed of 142 places in 212 ms of which 1 ms to minimize.
[2022-05-17 16:45:07] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:45:07] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:45:07] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5913 ms
[2022-05-17 16:45:07] [INFO ] Deduced a trap composed of 90 places in 235 ms of which 1 ms to minimize.
[2022-05-17 16:45:08] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 1 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 39 places in 311 ms of which 1 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:45:09] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:45:10] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3723 ms
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 69 places in 330 ms of which 1 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 1 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 1 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 1 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1821 ms
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 1 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 801 ms
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 25 places in 341 ms of which 1 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 0 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 1 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 0 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3540 ms
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 103 places in 342 ms of which 1 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 1 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 791 ms
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 50 places in 322 ms of which 1 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 0 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 812 ms
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 80 places in 327 ms of which 1 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 51 places in 328 ms of which 1 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 57 places in 317 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 85 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 65 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 1 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 67 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 61 places in 325 ms of which 1 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 0 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 55 places in 268 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 27 places in 362 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 120 places in 342 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6058 ms
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 0 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 52 places in 327 ms of which 1 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 53 places in 331 ms of which 1 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 123 places in 331 ms of which 1 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 122 places in 324 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 19 places in 326 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 50 places in 262 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4436 ms
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 0 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 0 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 1 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 1 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 68 places in 311 ms of which 1 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 94 places in 305 ms of which 1 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 0 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 62 places in 346 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 83 places in 272 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2705 ms
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 70 places in 267 ms of which 1 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 60 places in 289 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 766 ms
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 112 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 118 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 809 ms
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 147 places in 247 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1205 ms
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 49 places in 241 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 159 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 1 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 1 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 1 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3248 ms
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 146 places in 209 ms of which 1 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 98 places in 213 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 951 ms
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 107 places in 231 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 90 places in 225 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 126 places in 239 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2137 ms
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 1 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 1 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1745 ms
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 1 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 983 ms
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 86 places in 253 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 76 places in 260 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
[2022-05-17 16:45:56] [INFO ] Deduced a trap composed of 92 places in 277 ms of which 0 ms to minimize.
[2022-05-17 16:45:56] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:45:56] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 0 ms to minimize.
[2022-05-17 16:45:57] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 1 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:45:59] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:45:59] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:45:59] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:45:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3788 ms
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 118 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1154 ms
[2022-05-17 16:46:01] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Deduced a trap composed of 86 places in 288 ms of which 0 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Deduced a trap composed of 95 places in 247 ms of which 1 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1374 ms
[2022-05-17 16:46:03] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2022-05-17 16:46:03] [INFO ] Deduced a trap composed of 50 places in 254 ms of which 0 ms to minimize.
[2022-05-17 16:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2022-05-17 16:46:04] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 1 ms to minimize.
[2022-05-17 16:46:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2022-05-17 16:46:04] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:46:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:46:05] [INFO ] Deduced a trap composed of 145 places in 214 ms of which 1 ms to minimize.
[2022-05-17 16:46:05] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 0 ms to minimize.
[2022-05-17 16:46:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 606 ms
[2022-05-17 16:46:06] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 1 ms to minimize.
[2022-05-17 16:46:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2022-05-17 16:46:07] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:46:07] [INFO ] Deduced a trap composed of 125 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:46:07] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 1 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 872 ms
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 92 places in 243 ms of which 0 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 90 places in 256 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 100 places in 238 ms of which 1 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 74 places in 229 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 646 ms
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 105 places in 212 ms of which 1 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2022-05-17 16:46:10] [INFO ] After 166818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :774
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:46:10] [INFO ] After 225014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :774
Parikh walk visited 18 properties in 30025 ms.
Support contains 757 out of 1044 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1044/1044 places, 1744/1744 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1044 transition count 1720
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1020 transition count 1720
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 48 place count 1020 transition count 1707
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 1007 transition count 1707
Applied a total of 74 rules in 39 ms. Remains 1007 /1044 variables (removed 37) and now considering 1707/1744 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 1007/1044 places, 1707/1744 transitions.
Interrupted random walk after 449224 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 757) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 757) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 755) seen :0
Probabilistic random walk after 1000000 steps, saw 129377 distinct states, run finished after 13672 ms. (steps per millisecond=73 ) properties seen :4
Running SMT prover for 751 properties.
[2022-05-17 16:47:25] [INFO ] Flow matrix only has 1497 transitions (discarded 210 similar events)
// Phase 1: matrix 1497 rows 1007 cols
[2022-05-17 16:47:25] [INFO ] Computed 27 place invariants in 13 ms
[2022-05-17 16:47:42] [INFO ] After 17577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:751
[2022-05-17 16:47:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2022-05-17 16:47:53] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 16:48:36] [INFO ] After 32257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :751
[2022-05-17 16:48:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:49:18] [INFO ] After 42030ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :751
[2022-05-17 16:49:19] [INFO ] Deduced a trap composed of 14 places in 350 ms of which 1 ms to minimize.
[2022-05-17 16:49:19] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 1 ms to minimize.
[2022-05-17 16:49:20] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 0 ms to minimize.
[2022-05-17 16:49:20] [INFO ] Deduced a trap composed of 14 places in 341 ms of which 1 ms to minimize.
[2022-05-17 16:49:20] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 1 ms to minimize.
[2022-05-17 16:49:21] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 1 ms to minimize.
[2022-05-17 16:49:21] [INFO ] Deduced a trap composed of 29 places in 348 ms of which 0 ms to minimize.
[2022-05-17 16:49:22] [INFO ] Deduced a trap composed of 11 places in 368 ms of which 0 ms to minimize.
[2022-05-17 16:49:22] [INFO ] Deduced a trap composed of 25 places in 360 ms of which 1 ms to minimize.
[2022-05-17 16:49:22] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 1 ms to minimize.
[2022-05-17 16:49:23] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 1 ms to minimize.
[2022-05-17 16:49:23] [INFO ] Deduced a trap composed of 54 places in 347 ms of which 1 ms to minimize.
[2022-05-17 16:49:24] [INFO ] Deduced a trap composed of 117 places in 346 ms of which 1 ms to minimize.
[2022-05-17 16:49:24] [INFO ] Deduced a trap composed of 31 places in 334 ms of which 1 ms to minimize.
[2022-05-17 16:49:24] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 1 ms to minimize.
[2022-05-17 16:49:25] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 0 ms to minimize.
[2022-05-17 16:49:25] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 0 ms to minimize.
[2022-05-17 16:49:26] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 1 ms to minimize.
[2022-05-17 16:49:26] [INFO ] Deduced a trap composed of 80 places in 302 ms of which 1 ms to minimize.
[2022-05-17 16:49:26] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 1 ms to minimize.
[2022-05-17 16:49:27] [INFO ] Deduced a trap composed of 20 places in 299 ms of which 1 ms to minimize.
[2022-05-17 16:49:27] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 1 ms to minimize.
[2022-05-17 16:49:27] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 0 ms to minimize.
[2022-05-17 16:49:28] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:49:28] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:49:28] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 1 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 143 places in 258 ms of which 0 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 137 places in 253 ms of which 0 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 143 places in 265 ms of which 1 ms to minimize.
[2022-05-17 16:49:30] [INFO ] Deduced a trap composed of 143 places in 262 ms of which 0 ms to minimize.
[2022-05-17 16:49:30] [INFO ] Deduced a trap composed of 192 places in 252 ms of which 1 ms to minimize.
[2022-05-17 16:49:30] [INFO ] Deduced a trap composed of 70 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 0 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 1 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 149 places in 235 ms of which 0 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 63 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 217 places in 237 ms of which 0 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 1 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 0 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 70 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 0 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 70 places in 251 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 70 places in 245 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 53 places in 245 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 16414 ms
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 1 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 737 ms
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 96 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Deduced a trap composed of 96 places in 189 ms of which 2 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 785 ms
[2022-05-17 16:49:37] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 0 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 173 places in 290 ms of which 0 ms to minimize.
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 0 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 47 places in 313 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 70 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 1 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 73 places in 243 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 0 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3625 ms
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 30 places in 321 ms of which 1 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 115 places in 177 ms of which 1 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 117 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1366 ms
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 87 places in 248 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 1 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 1 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 1 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1461 ms
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 2 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1131 ms
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 911 ms
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 28 places in 309 ms of which 1 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 145 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 635 ms
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 770 ms
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 91 places in 198 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 112 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3797 ms
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 40 places in 353 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1537 ms
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 1 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 1 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 111 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 93 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 114 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5890 ms
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 677 ms
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 133 places in 225 ms of which 1 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 73 places in 235 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 76 places in 334 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 149 places in 290 ms of which 1 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3863 ms
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 1 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 66 places in 365 ms of which 1 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 75 places in 318 ms of which 1 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 1 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 64 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 45 places in 310 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 1 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 1 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 71 places in 278 ms of which 1 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 71 places in 273 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4714 ms
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2041 ms
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 696 ms
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 0 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 70 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 863 ms
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 0 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 683 ms
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 113 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 112 places in 208 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 95 places in 199 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 115 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1086 ms
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 157 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 807 ms
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 95 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1644 ms
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 87 places in 252 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 115 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1229 ms
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 97 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 70 places in 252 ms of which 1 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2853 ms
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 115 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 739 ms
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 110 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 92 places in 206 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1343 ms
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 112 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1064 ms
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 134 places in 226 ms of which 1 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 117 places in 204 ms of which 1 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 97 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 262 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 97 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 88 places in 228 ms of which 0 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 0 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 1 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 92 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 1 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3190 ms
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 1 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 0 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 1 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 1 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 0 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2808 ms
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 91 places in 263 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 720 ms
[2022-05-17 16:50:39] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2022-05-17 16:50:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 118 places in 234 ms of which 1 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 142 places in 232 ms of which 1 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 94 places in 233 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 94 places in 238 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 145 places in 229 ms of which 1 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 145 places in 231 ms of which 1 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 1 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2104 ms
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 0 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 1 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 786 ms
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 51 places in 206 ms of which 1 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 1 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 1 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 1 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 1 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 1 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1757 ms
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 0 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 101 places in 225 ms of which 0 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 124 places in 213 ms of which 1 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1058 ms
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 104 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 96 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1578 ms
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 90 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 84 places in 271 ms of which 1 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 721 ms
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 92 places in 198 ms of which 1 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 92 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1175 ms
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 1 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 0 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 79 places in 217 ms of which 0 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 111 places in 210 ms of which 0 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 639 ms
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 0 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Deduced a trap composed of 81 places in 258 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1305 ms
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 118 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:50:55] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 909 ms
[2022-05-17 16:50:55] [INFO ] Deduced a trap composed of 84 places in 246 ms of which 1 ms to minimize.
[2022-05-17 16:50:56] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 1 ms to minimize.
[2022-05-17 16:50:56] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:50:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 848 ms
[2022-05-17 16:50:57] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:50:57] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 1 ms to minimize.
[2022-05-17 16:50:58] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 1 ms to minimize.
[2022-05-17 16:50:58] [INFO ] Deduced a trap composed of 145 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:50:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1877 ms
[2022-05-17 16:50:59] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 0 ms to minimize.
[2022-05-17 16:51:00] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:51:00] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:51:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 879 ms
[2022-05-17 16:51:01] [INFO ] Deduced a trap composed of 135 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2022-05-17 16:51:01] [INFO ] Deduced a trap composed of 118 places in 206 ms of which 1 ms to minimize.
[2022-05-17 16:51:01] [INFO ] Deduced a trap composed of 122 places in 197 ms of which 0 ms to minimize.
[2022-05-17 16:51:02] [INFO ] Deduced a trap composed of 119 places in 210 ms of which 1 ms to minimize.
[2022-05-17 16:51:02] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 0 ms to minimize.
[2022-05-17 16:51:03] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:51:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2281 ms
[2022-05-17 16:51:04] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:51:04] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:51:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 587 ms
[2022-05-17 16:51:05] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 1 ms to minimize.
[2022-05-17 16:51:05] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 0 ms to minimize.
[2022-05-17 16:51:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 913 ms
[2022-05-17 16:51:06] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 0 ms to minimize.
[2022-05-17 16:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2022-05-17 16:51:07] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 0 ms to minimize.
[2022-05-17 16:51:07] [INFO ] Deduced a trap composed of 125 places in 253 ms of which 1 ms to minimize.
[2022-05-17 16:51:07] [INFO ] Deduced a trap composed of 119 places in 251 ms of which 1 ms to minimize.
[2022-05-17 16:51:08] [INFO ] Deduced a trap composed of 121 places in 254 ms of which 0 ms to minimize.
[2022-05-17 16:51:08] [INFO ] Deduced a trap composed of 163 places in 250 ms of which 1 ms to minimize.
[2022-05-17 16:51:09] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:51:09] [INFO ] Deduced a trap composed of 63 places in 206 ms of which 1 ms to minimize.
[2022-05-17 16:51:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2863 ms
[2022-05-17 16:51:10] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2022-05-17 16:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2022-05-17 16:51:10] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 1 ms to minimize.
[2022-05-17 16:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2022-05-17 16:51:11] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:51:12] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:51:12] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:51:13] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 0 ms to minimize.
[2022-05-17 16:51:13] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 1 ms to minimize.
[2022-05-17 16:51:14] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:51:14] [INFO ] Deduced a trap composed of 112 places in 199 ms of which 0 ms to minimize.
[2022-05-17 16:51:14] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:51:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3051 ms
[2022-05-17 16:51:15] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 1 ms to minimize.
[2022-05-17 16:51:16] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 1 ms to minimize.
[2022-05-17 16:51:16] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 0 ms to minimize.
[2022-05-17 16:51:17] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:51:17] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:51:17] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:51:17] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:51:18] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 0 ms to minimize.
[2022-05-17 16:51:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3282 ms
[2022-05-17 16:51:19] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2022-05-17 16:51:19] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:51:20] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 1 ms to minimize.
[2022-05-17 16:51:21] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:51:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1194 ms
[2022-05-17 16:51:22] [INFO ] Deduced a trap composed of 82 places in 250 ms of which 1 ms to minimize.
[2022-05-17 16:51:22] [INFO ] Deduced a trap composed of 121 places in 245 ms of which 1 ms to minimize.
[2022-05-17 16:51:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 673 ms
[2022-05-17 16:51:23] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 0 ms to minimize.
[2022-05-17 16:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2022-05-17 16:51:25] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 0 ms to minimize.
[2022-05-17 16:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2022-05-17 16:51:26] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 1 ms to minimize.
[2022-05-17 16:51:26] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 1 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 1938 ms
[2022-05-17 16:51:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:51:27] [INFO ] After 225021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:751
Parikh walk visited 0 properties in 30029 ms.
Support contains 751 out of 1007 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1007/1007 places, 1707/1707 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1007 transition count 1704
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1004 transition count 1704
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 1004 transition count 1702
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 1002 transition count 1702
Applied a total of 10 rules in 36 ms. Remains 1002 /1007 variables (removed 5) and now considering 1702/1707 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 1002/1007 places, 1702/1707 transitions.
Interrupted random walk after 455467 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Probabilistic random walk after 1000000 steps, saw 131732 distinct states, run finished after 13754 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 751 properties.
[2022-05-17 16:52:42] [INFO ] Flow matrix only has 1492 transitions (discarded 210 similar events)
// Phase 1: matrix 1492 rows 1002 cols
[2022-05-17 16:52:42] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-17 16:52:59] [INFO ] After 17025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:751
[2022-05-17 16:53:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 16:53:10] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 16:53:53] [INFO ] After 32322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :751
[2022-05-17 16:53:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:54:35] [INFO ] After 42414ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :751
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 19 places in 354 ms of which 1 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 1 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 1 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 1 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 24 places in 351 ms of which 1 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 95 places in 356 ms of which 1 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 115 places in 350 ms of which 1 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 103 places in 340 ms of which 1 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 0 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 1 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 1 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 100 places in 337 ms of which 1 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 0 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 1 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 0 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 27 places in 342 ms of which 1 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 1 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 1 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 0 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 1 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 1 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 0 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 1 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 0 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 0 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 1 ms to minimize.
[2022-05-17 16:54:46] [INFO ] Deduced a trap composed of 60 places in 250 ms of which 0 ms to minimize.
[2022-05-17 16:54:46] [INFO ] Deduced a trap composed of 70 places in 241 ms of which 0 ms to minimize.
[2022-05-17 16:54:46] [INFO ] Deduced a trap composed of 70 places in 244 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 53 places in 215 ms of which 0 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 190 places in 226 ms of which 1 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 1 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 0 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 90 places in 234 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 1 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 1 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14047 ms
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 0 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 736 ms
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 1 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 1 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 1 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1125 ms
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 1 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 1 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 61 places in 330 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 67 places in 282 ms of which 1 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 90 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 88 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 88 places in 283 ms of which 0 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 91 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 114 places in 280 ms of which 1 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 111 places in 280 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 73 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 118 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 97 places in 251 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7397 ms
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 91 places in 187 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1284 ms
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 115 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 995 ms
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 1 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 1 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3271 ms
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 91 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 91 places in 257 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 90 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 91 places in 253 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 116 places in 206 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1843 ms
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 82 places in 274 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 172 places in 269 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 1 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 118 places in 183 ms of which 1 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 1 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 112 places in 250 ms of which 1 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 121 places in 209 ms of which 1 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 121 places in 212 ms of which 1 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3694 ms
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 1 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 116 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2333 ms
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 843 ms
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 70 places in 238 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 672 ms
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 115 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 121 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 0 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 87 places in 238 ms of which 0 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 135 places in 197 ms of which 1 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2355 ms
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 63 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 1 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 118 places in 200 ms of which 1 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 118 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 118 places in 198 ms of which 1 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 118 places in 201 ms of which 1 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 114 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2514 ms
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 1 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 0 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 91 places in 243 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1322 ms
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 1 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 936 ms
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 1 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 1 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1384 ms
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 1 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 1 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 1 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 1 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 1 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1650 ms
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 87 places in 208 ms of which 1 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 1 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 0 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 693 ms
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 1 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 87 places in 270 ms of which 1 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 1 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 797 ms
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 121 places in 276 ms of which 0 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 1 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 48 places in 286 ms of which 1 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 0 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 1 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 92 places in 263 ms of which 0 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 1 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 105 places in 236 ms of which 1 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 50 places in 263 ms of which 1 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 111 places in 202 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4043 ms
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 91 places in 197 ms of which 1 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 91 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 91 places in 193 ms of which 1 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1711 ms
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 1 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 107 places in 221 ms of which 1 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 1 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1190 ms
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:55:42] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:55:42] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:55:42] [INFO ] Deduced a trap composed of 140 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:55:42] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:55:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1117 ms
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:55:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 699 ms
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 114 places in 209 ms of which 0 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1190 ms
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1297 ms
[2022-05-17 16:55:48] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:55:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2022-05-17 16:55:49] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 1 ms to minimize.
[2022-05-17 16:55:49] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 142 places in 229 ms of which 0 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 0 ms to minimize.
[2022-05-17 16:55:51] [INFO ] Deduced a trap composed of 99 places in 229 ms of which 1 ms to minimize.
[2022-05-17 16:55:51] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 0 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 135 places in 213 ms of which 1 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3431 ms
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2022-05-17 16:55:53] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2022-05-17 16:55:53] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 0 ms to minimize.
[2022-05-17 16:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2022-05-17 16:55:54] [INFO ] Deduced a trap composed of 42 places in 293 ms of which 0 ms to minimize.
[2022-05-17 16:55:54] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 0 ms to minimize.
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 1 ms to minimize.
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 94 places in 239 ms of which 0 ms to minimize.
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 97 places in 237 ms of which 1 ms to minimize.
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 0 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Deduced a trap composed of 142 places in 244 ms of which 0 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Deduced a trap composed of 145 places in 245 ms of which 1 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Deduced a trap composed of 145 places in 238 ms of which 1 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2857 ms
[2022-05-17 16:55:57] [INFO ] Deduced a trap composed of 97 places in 294 ms of which 1 ms to minimize.
[2022-05-17 16:55:57] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 0 ms to minimize.
[2022-05-17 16:55:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 750 ms
[2022-05-17 16:55:58] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 1 ms to minimize.
[2022-05-17 16:55:58] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:55:58] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:55:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 709 ms
[2022-05-17 16:55:59] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 1 ms to minimize.
[2022-05-17 16:55:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2022-05-17 16:55:59] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:56:00] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:56:00] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 0 ms to minimize.
[2022-05-17 16:56:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1000 ms
[2022-05-17 16:56:00] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:56:01] [INFO ] Deduced a trap composed of 106 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:56:01] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 0 ms to minimize.
[2022-05-17 16:56:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 911 ms
[2022-05-17 16:56:02] [INFO ] Deduced a trap composed of 92 places in 207 ms of which 0 ms to minimize.
[2022-05-17 16:56:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2022-05-17 16:56:02] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2022-05-17 16:56:02] [INFO ] Deduced a trap composed of 97 places in 218 ms of which 0 ms to minimize.
[2022-05-17 16:56:03] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 1 ms to minimize.
[2022-05-17 16:56:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 904 ms
[2022-05-17 16:56:03] [INFO ] Deduced a trap composed of 107 places in 210 ms of which 1 ms to minimize.
[2022-05-17 16:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2022-05-17 16:56:04] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:56:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 70 places in 239 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 662 ms
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 0 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 57 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1007 ms
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 0 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1040 ms
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1063 ms
[2022-05-17 16:56:09] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 0 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1099 ms
[2022-05-17 16:56:10] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2022-05-17 16:56:11] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:56:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2022-05-17 16:56:13] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 1 ms to minimize.
[2022-05-17 16:56:13] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 0 ms to minimize.
[2022-05-17 16:56:13] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 113 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 113 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1948 ms
[2022-05-17 16:56:15] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:56:15] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:56:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2022-05-17 16:56:16] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 1 ms to minimize.
[2022-05-17 16:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2022-05-17 16:56:17] [INFO ] Deduced a trap composed of 128 places in 224 ms of which 1 ms to minimize.
[2022-05-17 16:56:17] [INFO ] Deduced a trap composed of 125 places in 217 ms of which 0 ms to minimize.
[2022-05-17 16:56:17] [INFO ] Deduced a trap composed of 121 places in 218 ms of which 1 ms to minimize.
[2022-05-17 16:56:18] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2022-05-17 16:56:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1183 ms
[2022-05-17 16:56:18] [INFO ] Deduced a trap composed of 74 places in 215 ms of which 0 ms to minimize.
[2022-05-17 16:56:19] [INFO ] Deduced a trap composed of 97 places in 209 ms of which 1 ms to minimize.
[2022-05-17 16:56:19] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 1 ms to minimize.
[2022-05-17 16:56:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 962 ms
[2022-05-17 16:56:20] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 0 ms to minimize.
[2022-05-17 16:56:20] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:56:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 561 ms
[2022-05-17 16:56:24] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:56:24] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
[2022-05-17 16:56:25] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 1 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 1 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 0 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 92 places in 206 ms of which 1 ms to minimize.
[2022-05-17 16:56:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1574 ms
[2022-05-17 16:56:27] [INFO ] Deduced a trap composed of 50 places in 254 ms of which 1 ms to minimize.
[2022-05-17 16:56:27] [INFO ] Deduced a trap composed of 76 places in 254 ms of which 0 ms to minimize.
[2022-05-17 16:56:28] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 1 ms to minimize.
[2022-05-17 16:56:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1004 ms
[2022-05-17 16:56:28] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2022-05-17 16:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2022-05-17 16:56:30] [INFO ] Deduced a trap composed of 84 places in 266 ms of which 1 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Deduced a trap composed of 203 places in 252 ms of which 1 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 1 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 0 ms to minimize.
[2022-05-17 16:56:32] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 1 ms to minimize.
[2022-05-17 16:56:32] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 1 ms to minimize.
[2022-05-17 16:56:32] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 1 ms to minimize.
[2022-05-17 16:56:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2457 ms
[2022-05-17 16:56:33] [INFO ] Deduced a trap composed of 145 places in 227 ms of which 0 ms to minimize.
[2022-05-17 16:56:33] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 1 ms to minimize.
[2022-05-17 16:56:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2022-05-17 16:56:36] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2022-05-17 16:56:38] [INFO ] Deduced a trap composed of 76 places in 263 ms of which 0 ms to minimize.
[2022-05-17 16:56:38] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 1 ms to minimize.
[2022-05-17 16:56:39] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:56:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 951 ms
[2022-05-17 16:56:39] [INFO ] Deduced a trap composed of 123 places in 230 ms of which 0 ms to minimize.
[2022-05-17 16:56:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2022-05-17 16:56:40] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 0 ms to minimize.
[2022-05-17 16:56:40] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:56:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 713 ms
[2022-05-17 16:56:41] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 0 ms to minimize.
[2022-05-17 16:56:41] [INFO ] Deduced a trap composed of 183 places in 213 ms of which 1 ms to minimize.
[2022-05-17 16:56:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 623 ms
[2022-05-17 16:56:42] [INFO ] Deduced a trap composed of 81 places in 284 ms of which 0 ms to minimize.
[2022-05-17 16:56:42] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 1 ms to minimize.
[2022-05-17 16:56:42] [INFO ] Deduced a trap composed of 91 places in 240 ms of which 1 ms to minimize.
[2022-05-17 16:56:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1068 ms
[2022-05-17 16:56:44] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 1 ms to minimize.
[2022-05-17 16:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2022-05-17 16:56:44] [INFO ] Deduced a trap composed of 2 places in 433 ms of which 1 ms to minimize.
[2022-05-17 16:56:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:56:44] [INFO ] After 225456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:751
Parikh walk visited 0 properties in 30032 ms.
Support contains 751 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1002/1002 places, 1702/1702 transitions.
Applied a total of 0 rules in 28 ms. Remains 1002 /1002 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1002/1002 places, 1702/1702 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1002/1002 places, 1702/1702 transitions.
Applied a total of 0 rules in 17 ms. Remains 1002 /1002 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2022-05-17 16:57:14] [INFO ] Flow matrix only has 1492 transitions (discarded 210 similar events)
// Phase 1: matrix 1492 rows 1002 cols
[2022-05-17 16:57:14] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-17 16:57:15] [INFO ] Implicit Places using invariants in 321 ms returned [920, 921, 923, 994, 995, 996, 997]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 324 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 995/1002 places, 1702/1702 transitions.
Applied a total of 0 rules in 17 ms. Remains 995 /995 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 995/1002 places, 1702/1702 transitions.
Interrupted random walk after 455603 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 751) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 747) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 743) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 743) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 739) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 732) seen :0
Probabilistic random walk after 1000000 steps, saw 131735 distinct states, run finished after 13734 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 732 properties.
[2022-05-17 16:58:00] [INFO ] Flow matrix only has 1492 transitions (discarded 210 similar events)
// Phase 1: matrix 1492 rows 995 cols
[2022-05-17 16:58:00] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:58:17] [INFO ] After 16427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:732
[2022-05-17 16:58:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2022-05-17 16:59:09] [INFO ] After 31533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :732
[2022-05-17 16:59:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:50] [INFO ] After 41394ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :732
[2022-05-17 16:59:51] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 1 ms to minimize.
[2022-05-17 16:59:51] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2022-05-17 16:59:52] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 1 ms to minimize.
[2022-05-17 16:59:52] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 1 ms to minimize.
[2022-05-17 16:59:52] [INFO ] Deduced a trap composed of 98 places in 345 ms of which 1 ms to minimize.
[2022-05-17 16:59:53] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 1 ms to minimize.
[2022-05-17 16:59:53] [INFO ] Deduced a trap composed of 70 places in 330 ms of which 0 ms to minimize.
[2022-05-17 16:59:54] [INFO ] Deduced a trap composed of 125 places in 332 ms of which 1 ms to minimize.
[2022-05-17 16:59:54] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 1 ms to minimize.
[2022-05-17 16:59:54] [INFO ] Deduced a trap composed of 37 places in 336 ms of which 1 ms to minimize.
[2022-05-17 16:59:55] [INFO ] Deduced a trap composed of 16 places in 324 ms of which 1 ms to minimize.
[2022-05-17 16:59:55] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 0 ms to minimize.
[2022-05-17 16:59:55] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 0 ms to minimize.
[2022-05-17 16:59:56] [INFO ] Deduced a trap composed of 28 places in 293 ms of which 1 ms to minimize.
[2022-05-17 16:59:56] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 0 ms to minimize.
[2022-05-17 16:59:57] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 0 ms to minimize.
[2022-05-17 16:59:57] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 0 ms to minimize.
[2022-05-17 16:59:57] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 1 ms to minimize.
[2022-05-17 16:59:58] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 1 ms to minimize.
[2022-05-17 16:59:58] [INFO ] Deduced a trap composed of 70 places in 293 ms of which 0 ms to minimize.
[2022-05-17 16:59:58] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 1 ms to minimize.
[2022-05-17 16:59:59] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 1 ms to minimize.
[2022-05-17 16:59:59] [INFO ] Deduced a trap composed of 70 places in 294 ms of which 1 ms to minimize.
[2022-05-17 16:59:59] [INFO ] Deduced a trap composed of 67 places in 294 ms of which 1 ms to minimize.
[2022-05-17 17:00:00] [INFO ] Deduced a trap composed of 70 places in 283 ms of which 0 ms to minimize.
[2022-05-17 17:00:00] [INFO ] Deduced a trap composed of 63 places in 273 ms of which 0 ms to minimize.
[2022-05-17 17:00:00] [INFO ] Deduced a trap composed of 70 places in 276 ms of which 0 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 70 places in 280 ms of which 0 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 93 places in 259 ms of which 1 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 1 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 1 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Deduced a trap composed of 91 places in 260 ms of which 0 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Deduced a trap composed of 75 places in 279 ms of which 0 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 128 places in 271 ms of which 1 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 1 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 1 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 0 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 62 places in 268 ms of which 0 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 49 places in 274 ms of which 0 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 106 places in 273 ms of which 0 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 0 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 0 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 15563 ms
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 125 places in 188 ms of which 0 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 99 places in 186 ms of which 1 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 0 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 1 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1594 ms
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 90 places in 260 ms of which 0 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 1 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 672 ms
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 0 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 90 places in 219 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 91 places in 219 ms of which 1 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 87 places in 223 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 0 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 91 places in 228 ms of which 1 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 1 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 1 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 73 places in 229 ms of which 1 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 1 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 73 places in 220 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 92 places in 262 ms of which 0 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 91 places in 266 ms of which 1 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 118 places in 261 ms of which 1 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 1 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 130 places in 225 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 115 places in 227 ms of which 1 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 111 places in 223 ms of which 1 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 140 places in 228 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 91 places in 224 ms of which 1 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 1 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 115 places in 196 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 111 places in 202 ms of which 1 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 8746 ms
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 135 places in 282 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 0 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 1 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 1 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 1 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 1 ms to minimize.

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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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 StableMarking -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-6"
export BK_EXAMINATION="StableMarking"
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-6, examination is StableMarking"
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-165277023900053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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