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-165277023900054.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 Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277023900054
=====================================================================

--------------------
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 Liveness

=== Now, execution of the tool begins

BK_START 1652805028574

Running Version 202205111006
[2022-05-17 16:30:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -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:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:30:30] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2022-05-17 16:30:30] [INFO ] Transformed 1330 places.
[2022-05-17 16:30:30] [INFO ] Transformed 2030 transitions.
[2022-05-17 16:30:30] [INFO ] Found NUPN structural information;
[2022-05-17 16:30:30] [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:30] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 275 ms.
Built sparse matrix representations for Structural reductions in 10 ms.12041KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 83 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 44 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2022-05-17 16:30:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 16:30:30] [INFO ] Computed 27 place invariants in 36 ms
[2022-05-17 16:30:30] [INFO ] Implicit Places using invariants in 389 ms returned []
[2022-05-17 16:30:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 16:30:30] [INFO ] Computed 27 place invariants in 18 ms
[2022-05-17 16:30:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:30:31] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2022-05-17 16:30:31] [INFO ] Redundant transitions in 108 ms returned []
[2022-05-17 16:30:31] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 16:30:31] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-17 16:30:32] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1330/1330 places, 2030/2030 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2594 ms (no deadlock found). (steps per millisecond=481 )
Random directed walk for 1250006 steps, including 0 resets, run took 3752 ms (no deadlock found). (steps per millisecond=333 )
[2022-05-17 16:30:39] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 16:30:39] [INFO ] Computed 27 place invariants in 10 ms
[2022-05-17 16:30:39] [INFO ] [Real]Absence check using 20 positive place invariants in 51 ms returned sat
[2022-05-17 16:30:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 38 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 123 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2022-05-17 16:30:39] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2022-05-17 16:30:39] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-17 16:30:40] [INFO ] Implicit Places using invariants in 270 ms returned [387, 388, 390, 398, 399, 400, 401]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 283 ms to find 7 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 399/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 399/1330 places, 1106/2030 transitions.
Discarding 7 transitions out of 1106. Remains 1099
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1158 ms. (steps per millisecond=8 ) properties (out of 1099) seen :417
Running SMT prover for 682 properties.
[2022-05-17 16:30:41] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:30:41] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:30:46] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:31:06] [INFO ] After 16193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :168 real:514
[2022-05-17 16:31:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:31:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:31:06] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 682 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 371 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 17 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 416215 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 129
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 553) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 541) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 535) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 530) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 523) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 522) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 520) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 518) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 517) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 512) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 509) 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 509) 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 509) 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 509) 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 509) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 507) 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 507) 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 507) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 506) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 505) 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 505) 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 505) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 503) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 502) 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 502) 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 502) 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 502) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 501) 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 501) 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 501) 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 501) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 500) 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 500) 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 500) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 498) 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 498) 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 498) 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 498) 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 498) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 495) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 494) 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 494) 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 494) 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 494) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 494) 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 494) 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 494) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 494) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 493) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 492) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 492) 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 488) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 488) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 488) 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 488) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 487) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 487) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 484) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 483) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 481) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 481) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 481) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 481) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 481) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 481) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 481) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 481) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 478) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 478) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 478) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 478) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 478) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 478) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 478) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 478) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 477) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 473) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 471) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 471) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 471) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 471) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 471) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 471) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 468) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 468) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 467) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 467) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 467) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 467) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 467) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 467) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 467) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 466) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 466) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 465) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 463) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 463) seen :0
Running SMT prover for 463 properties.
[2022-05-17 16:31:37] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:31:37] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-17 16:31:40] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:31:57] [INFO ] After 19517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:463
[2022-05-17 16:32:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:32:14] [INFO ] After 11801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :463
[2022-05-17 16:32:14] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:32:28] [INFO ] After 13523ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :463
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 2 ms to minimize.
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 2 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 1 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5649 ms
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2737 ms
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:32:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1288 ms
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:32:38] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:32:39] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:32:41] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:32:42] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4344 ms
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 617 ms
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 827 ms
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2254 ms
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2269 ms
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 4 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:32:50] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:32:50] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:32:50] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:32:50] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:32:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 992 ms
[2022-05-17 16:32:50] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 1 ms to minimize.
[2022-05-17 16:32:51] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:32:51] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:32:51] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:32:51] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:51] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:51] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:32:52] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:32:53] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4634 ms
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:56] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:32:57] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:32:58] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3553 ms
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:32:59] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:33:00] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:33:00] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:33:00] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:33:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1569 ms
[2022-05-17 16:33:00] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-17 16:33:01] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-17 16:33:01] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:33:03] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:33:03] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:33:03] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:33:03] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:33:03] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2239 ms
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:33:06] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:33:06] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 812 ms
[2022-05-17 16:33:06] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:33:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2020 ms
[2022-05-17 16:33:09] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:33:09] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:33:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1093 ms
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:33:11] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:33:11] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:33:11] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:33:12] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:33:12] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:33:12] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:33:12] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:33:14] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4604 ms
[2022-05-17 16:33:15] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:33:15] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:33:16] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:33:16] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:33:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1072 ms
[2022-05-17 16:33:17] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:33:17] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:33:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2022-05-17 16:33:17] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 558 ms
[2022-05-17 16:33:19] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:33:19] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:33:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2022-05-17 16:33:20] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2022-05-17 16:33:22] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:22] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:33:22] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:33:22] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:33:22] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:33:22] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:33:22] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2631 ms
[2022-05-17 16:33:25] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:33:26] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:33:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2022-05-17 16:33:26] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:33:26] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:33:27] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:33:27] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:33:27] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:33:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 721 ms
[2022-05-17 16:33:28] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:33:28] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:33:28] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:33:28] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:33:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 657 ms
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2022-05-17 16:33:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:33:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:33:30] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:33:30] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:33:30] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:30] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:33:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 523 ms
[2022-05-17 16:33:30] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:33:31] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:33:32] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:33:32] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:33:33] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:33] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:33:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2022-05-17 16:33:33] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:33:33] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2022-05-17 16:33:34] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:33:34] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:33:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1157 ms
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:33:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:33:36] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 617 ms
[2022-05-17 16:33:37] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 708 ms
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 633 ms
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 590 ms
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 694 ms
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 763 ms
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2442 ms
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:34:09] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 570 ms
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 514 ms
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 16:34:12] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:34:12] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2022-05-17 16:34:21] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:34:22] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:34:27] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:34:28] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:34:29] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 16:34:30] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 408 ms
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:34:31] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:34:32] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2022-05-17 16:34:39] [INFO ] After 144669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :463
Attempting to minimize the solution found.
Minimization took 63099 ms.
[2022-05-17 16:35:42] [INFO ] After 225012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :462
Fused 463 Parikh solutions to 441 different solutions.
Parikh walk visited 0 properties in 4206 ms.
Support contains 309 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 18 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 524041 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 418) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 416) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 416) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 416) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 416) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 416) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 414) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 408) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 403) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 403) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 399) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 392) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 392) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 390) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 387) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 386) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 384) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 384) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 382) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 380) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 380) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 380) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 378) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 377) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 375) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 374) seen :0
Running SMT prover for 374 properties.
[2022-05-17 16:36:26] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:36:26] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:36:28] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:36:41] [INFO ] After 10490ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:364
[2022-05-17 16:36:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:36:42] [INFO ] After 387ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:374
[2022-05-17 16:36:42] [INFO ] After 15598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:374
[2022-05-17 16:36:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-05-17 16:36:55] [INFO ] After 9248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :374
[2022-05-17 16:37:06] [INFO ] After 10809ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :374
[2022-05-17 16:37:06] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 0 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2246 ms
[2022-05-17 16:37:09] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 566 ms
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3430 ms
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 848 ms
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1910 ms
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1199 ms
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1126 ms
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3869 ms
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:37:27] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:27] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:37:27] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:37:27] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:37:27] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4059 ms
[2022-05-17 16:37:27] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:37:30] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:37:30] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:30] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 10 ms to minimize.
[2022-05-17 16:37:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2821 ms
[2022-05-17 16:37:30] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:30] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1133 ms
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:37:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 668 ms
[2022-05-17 16:37:33] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:37:33] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:37:33] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 664 ms
[2022-05-17 16:37:35] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:37:35] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:37:35] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:37:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2022-05-17 16:37:35] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 719 ms
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:37:37] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:37:37] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:37:37] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:37:37] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:37] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:37:37] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2647 ms
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:37:41] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:41] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1829 ms
[2022-05-17 16:37:41] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:37:43] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:37:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1129 ms
[2022-05-17 16:37:43] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:37:43] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1817 ms
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:37:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1326 ms
[2022-05-17 16:37:47] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:37:47] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:37:47] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:37:47] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:37:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 643 ms
[2022-05-17 16:37:47] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:37:48] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:37:48] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:37:48] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:37:48] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:37:48] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:37:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 975 ms
[2022-05-17 16:37:49] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:37:49] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:37:49] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:37:50] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:50] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:37:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 924 ms
[2022-05-17 16:37:50] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:50] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:37:50] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:37:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 416 ms
[2022-05-17 16:37:51] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:37:51] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:37:51] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:37:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2022-05-17 16:37:52] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:37:52] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:37:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2022-05-17 16:37:52] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:37:53] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:37:53] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:37:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 417 ms
[2022-05-17 16:37:53] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:37:54] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:37:54] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:37:54] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:37:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2022-05-17 16:37:55] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:37:55] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:37:55] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:37:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2022-05-17 16:37:55] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:37:56] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:56] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:37:56] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:37:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 732 ms
[2022-05-17 16:37:57] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:37:57] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:37:57] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:37:57] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:37:57] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:57] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1276 ms
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1771 ms
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2022-05-17 16:38:03] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:38:03] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:38:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1567 ms
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:38:08] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 684 ms
[2022-05-17 16:38:11] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:38:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:38:12] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2022-05-17 16:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 556 ms
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:38:18] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:38:18] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:38:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2022-05-17 16:38:20] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:38:22] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 509 ms
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 16:38:25] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:38:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:38:26] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:38:26] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:38:28] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:38:28] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:38:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2022-05-17 16:38:31] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:38:31] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:38:32] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:38:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:38:32] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:38:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:38:35] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:38:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 16:38:35] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:38:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2022-05-17 16:38:39] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:38:39] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:38:41] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:38:41] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2022-05-17 16:38:41] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:38:42] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:38:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-05-17 16:38:42] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:38:42] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:42] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:38:42] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1639 ms
[2022-05-17 16:38:44] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:38:46] [INFO ] After 110078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :374
Attempting to minimize the solution found.
Minimization took 32371 ms.
[2022-05-17 16:39:18] [INFO ] After 156221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :374
Fused 374 Parikh solutions to 351 different solutions.
Parikh walk visited 2 properties in 4517 ms.
Support contains 271 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 18 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 536507 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 372) seen :0
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 93567 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 372 properties.
[2022-05-17 16:41:29] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:41:29] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:41:32] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:41:44] [INFO ] After 10250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:362
[2022-05-17 16:41:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:41:45] [INFO ] After 388ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:372
[2022-05-17 16:41:45] [INFO ] After 15311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:372
[2022-05-17 16:41:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:41:58] [INFO ] After 9222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :372
[2022-05-17 16:42:08] [INFO ] After 9867ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :372
[2022-05-17 16:42:08] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4295 ms
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3613 ms
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1853 ms
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1094 ms
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 928 ms
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2436 ms
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1365 ms
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3124 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4877 ms
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1332 ms
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 465 ms
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2271 ms
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2791 ms
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1689 ms
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 781 ms
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1746 ms
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2022-05-17 16:42:48] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:42:48] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:42:48] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2809 ms
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 708 ms
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:54] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:42:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1763 ms
[2022-05-17 16:42:54] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:42:54] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:42:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 16:42:54] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:42:56] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:42:56] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:42:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1497 ms
[2022-05-17 16:42:56] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:42:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:42:57] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 465 ms
[2022-05-17 16:42:57] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:42:58] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:42:58] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:58] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:42:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
[2022-05-17 16:42:58] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 817 ms
[2022-05-17 16:43:01] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:43:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:43:01] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:43:01] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:43:01] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 689 ms
[2022-05-17 16:43:02] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:43:02] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:43:02] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:43:03] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:43:03] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:43:03] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:43:03] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:43:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 905 ms
[2022-05-17 16:43:03] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:43:04] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2022-05-17 16:43:10] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:43:10] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:43:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 815 ms
[2022-05-17 16:43:11] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:43:11] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:43:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 772 ms
[2022-05-17 16:43:12] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:43:12] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:43:13] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:43:13] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 696 ms
[2022-05-17 16:43:14] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2022-05-17 16:43:15] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:43:15] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2022-05-17 16:43:15] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:43:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2022-05-17 16:43:15] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:43:15] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:43:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2022-05-17 16:43:15] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:43:16] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:43:17] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:43:17] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:43:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 986 ms
[2022-05-17 16:43:18] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:43:18] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-17 16:43:18] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:43:19] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:43:19] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:43:19] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:43:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2022-05-17 16:43:19] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:43:20] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:43:21] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2022-05-17 16:43:22] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:43:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:43:23] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:43:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:43:23] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:43:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-17 16:43:24] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:43:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:43:25] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:43:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:43:25] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:43:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:43:26] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-17 16:43:26] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:43:27] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:43:27] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:43:28] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:43:29] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:43:31] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:43:31] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:43:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2022-05-17 16:43:31] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:43:32] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:43:32] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:43:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 425 ms
[2022-05-17 16:43:32] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-17 16:43:35] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:43:35] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:43:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2022-05-17 16:43:36] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:43:36] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:43:37] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:43:37] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:43:38] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:43:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:43:42] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:43:42] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:43:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 558 ms
[2022-05-17 16:43:45] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:43:45] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:43:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2022-05-17 16:43:46] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:43:49] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:43:49] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:43:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2022-05-17 16:43:50] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:43:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:43:51] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-05-17 16:43:53] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:43:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2022-05-17 16:43:55] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:43:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:43:57] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:43:57] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:43:57] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:43:57] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:43:57] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:43:57] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:43:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 859 ms
[2022-05-17 16:43:58] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:43:58] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:43:58] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:43:58] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:43:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2022-05-17 16:43:59] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:43:59] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:43:59] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:43:59] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:43:59] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:43:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 740 ms
[2022-05-17 16:44:00] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:44:02] [INFO ] After 123127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :372
Attempting to minimize the solution found.
Minimization took 40384 ms.
[2022-05-17 16:44:42] [INFO ] After 177206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :372
Fused 372 Parikh solutions to 353 different solutions.
Parikh walk visited 1 properties in 4786 ms.
Support contains 270 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 13 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:44:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:44:47] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:44:47] [INFO ] Implicit Places using invariants in 143 ms returned []
[2022-05-17 16:44:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:44:47] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:44:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:44:48] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2022-05-17 16:44:48] [INFO ] Redundant transitions in 62 ms returned []
[2022-05-17 16:44:48] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:44:48] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:44:48] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4200 ms. (steps per millisecond=23 ) properties (out of 270) seen :97
Running SMT prover for 173 properties.
[2022-05-17 16:44:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:44:52] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:44:53] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:44:59] [INFO ] After 6944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:173
[2022-05-17 16:45:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:45:06] [INFO ] After 4380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :173
[2022-05-17 16:45:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:45:11] [INFO ] After 4905ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :173
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:45:11] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 8224 ms
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2631 ms
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 650 ms
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 591 ms
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3786 ms
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1112 ms
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2363 ms
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 484 ms
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:45:33] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1368 ms
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1254 ms
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2923 ms
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1321 ms
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:45:40] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:45:41] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1890 ms
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:45:42] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:45:43] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1850 ms
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:45:44] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 829 ms
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:45:45] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1033 ms
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:45:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 773 ms
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-05-17 16:45:48] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:45:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:45:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 760 ms
[2022-05-17 16:45:49] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:45:50] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1745 ms
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:45:51] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:45:52] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1699 ms
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:45:53] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 849 ms
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:45:55] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:45:55] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:45:55] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:55] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:45:55] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:45:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1468 ms
[2022-05-17 16:45:55] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:45:56] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:45:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2022-05-17 16:45:56] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:45:56] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:45:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2022-05-17 16:45:57] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:45:57] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:45:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2022-05-17 16:45:57] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:45:57] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:45:57] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:45:57] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 644 ms
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:45:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 602 ms
[2022-05-17 16:45:59] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:45:59] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:45:59] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:45:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:46:00] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:46:01] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:46:01] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:46:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1040 ms
[2022-05-17 16:46:01] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2022-05-17 16:46:02] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:46:02] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:46:03] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:46:03] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:46:03] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:46:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2022-05-17 16:46:04] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:46:04] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:46:04] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:46:04] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:46:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 658 ms
[2022-05-17 16:46:04] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:46:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:46:05] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2022-05-17 16:46:06] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:46:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 16:46:07] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 16:46:07] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:46:07] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:46:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:46:08] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 799 ms
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:46:09] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 720 ms
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 737 ms
[2022-05-17 16:46:11] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:46:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2022-05-17 16:46:12] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:46:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:46:14] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:46:14] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:46:14] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:46:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2022-05-17 16:46:15] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:46:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2022-05-17 16:46:16] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:46:16] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:46:16] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:46:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 507 ms
[2022-05-17 16:46:16] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:46:17] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-17 16:46:17] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:46:17] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:46:18] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:46:18] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:46:18] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:46:18] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:46:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 549 ms
[2022-05-17 16:46:19] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:46:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:46:22] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:46:24] [INFO ] After 78159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :173
Attempting to minimize the solution found.
Minimization took 15345 ms.
[2022-05-17 16:46:39] [INFO ] After 100012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :173
Interrupted random walk after 545603 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 371) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 369) seen :0
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 97592 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 369 properties.
[2022-05-17 16:48:51] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:48:51] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:48:53] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:49:06] [INFO ] After 10044ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16 real:353
[2022-05-17 16:49:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:49:06] [INFO ] After 592ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:369
[2022-05-17 16:49:06] [INFO ] After 15273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:369
[2022-05-17 16:49:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:49:20] [INFO ] After 9038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :369
[2022-05-17 16:49:28] [INFO ] After 8343ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :369
[2022-05-17 16:49:28] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:49:28] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:49:29] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:49:30] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:49:30] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:49:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1610 ms
[2022-05-17 16:49:30] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:49:30] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:49:31] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:49:32] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:49:33] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3569 ms
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:49:34] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:49:35] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:49:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2557 ms
[2022-05-17 16:49:36] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:49:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 969 ms
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:49:38] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5513 ms
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2081 ms
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4875 ms
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1831 ms
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2807 ms
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2499 ms
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 882 ms
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1309 ms
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1246 ms
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2888 ms
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 736 ms
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 711 ms
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 597 ms
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 396 ms
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1322 ms
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2084 ms
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 795 ms
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 627 ms
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1345 ms
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 785 ms
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 440 ms
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 494 ms
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 668 ms
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 467 ms
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2022-05-17 16:50:39] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:50:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 581 ms
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 635 ms
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 439 ms
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 473 ms
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:50:53] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:50:53] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:50:55] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:50:59] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 16:50:59] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:51:02] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 16:51:07] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:51:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:51:07] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:51:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:51:08] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:51:08] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:51:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 657 ms
[2022-05-17 16:51:10] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:51:10] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:51:13] [INFO ] After 112984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :369
Attempting to minimize the solution found.
Minimization took 38341 ms.
[2022-05-17 16:51:51] [INFO ] After 164823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :369
Fused 369 Parikh solutions to 343 different solutions.
Parikh walk visited 1 properties in 5173 ms.
Support contains 268 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 13 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 530347 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 368) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 366) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 96080 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 365 properties.
[2022-05-17 16:54:08] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:54:08] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:54:10] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:54:22] [INFO ] After 9851ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17 real:348
[2022-05-17 16:54:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:54:23] [INFO ] After 604ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:365
[2022-05-17 16:54:23] [INFO ] After 15125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:365
[2022-05-17 16:54:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:54:36] [INFO ] After 8979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :365
[2022-05-17 16:54:46] [INFO ] After 10045ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :365
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1606 ms
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2102 ms
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2269 ms
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3975 ms
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2310 ms
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1959 ms
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1242 ms
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1408 ms
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2649 ms
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1400 ms
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1235 ms
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2625 ms
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1300 ms
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3291 ms
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1668 ms
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1023 ms
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1754 ms
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1159 ms
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 735 ms
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 397 ms
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 678 ms
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1138 ms
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 652 ms
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 707 ms
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 743 ms
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 784 ms
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:55:42] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:55:44] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:44] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:55:44] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:55:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1846 ms
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 579 ms
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 904 ms
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:55:48] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 494 ms
[2022-05-17 16:55:48] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:55:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:55:49] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 441 ms
[2022-05-17 16:55:51] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:55:51] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 349 ms
[2022-05-17 16:55:53] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:55:54] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:55:55] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1088 ms
[2022-05-17 16:55:57] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-17 16:55:58] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:56:00] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:56:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:56:03] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:56:03] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:56:04] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:56:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 436 ms
[2022-05-17 16:56:04] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:56:04] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:56:04] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:56:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2142 ms
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:56:08] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:56:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 608 ms
[2022-05-17 16:56:09] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:56:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-17 16:56:11] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:56:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-17 16:56:13] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:56:13] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:56:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2022-05-17 16:56:13] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:56:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 494 ms
[2022-05-17 16:56:15] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:56:18] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:56:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2022-05-17 16:56:24] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:56:24] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:56:24] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:56:24] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:56:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2022-05-17 16:56:25] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:56:25] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 799 ms
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 658 ms
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:56:27] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:56:28] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:56:28] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:56:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2022-05-17 16:56:28] [INFO ] After 112126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :365
Attempting to minimize the solution found.
Minimization took 36588 ms.
[2022-05-17 16:57:05] [INFO ] After 162069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :365
Fused 365 Parikh solutions to 337 different solutions.
Parikh walk visited 0 properties in 4199 ms.
Support contains 267 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 13 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 414649 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 365) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 365) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 362) seen :0
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 96369 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 362 properties.
[2022-05-17 16:59:22] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:22] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:25] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:59:37] [INFO ] After 9999ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16 real:346
[2022-05-17 16:59:37] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:37] [INFO ] After 567ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:362
[2022-05-17 16:59:37] [INFO ] After 15122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:362
[2022-05-17 16:59:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:59:50] [INFO ] After 8597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :362
[2022-05-17 17:00:00] [INFO ] After 9640ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :362
[2022-05-17 17:00:00] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2022-05-17 17:00:00] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2022-05-17 17:00:00] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 0 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 0 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:00:01] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 0 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2068 ms
[2022-05-17 17:00:02] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-05-17 17:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:00:03] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:00:04] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2436 ms
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 0 ms to minimize.
[2022-05-17 17:00:05] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:00:06] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:00:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2094 ms
[2022-05-17 17:00:07] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 1 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2022-05-17 17:00:08] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 0 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-05-17 17:00:09] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 7451 ms
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 4 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 1 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1339 ms
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 639 ms
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 782 ms
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 758 ms
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 0 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 0 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 1 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 1 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3728 ms
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 0 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 1 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 0 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 0 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 0 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 0 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 0 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2593 ms
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 965 ms
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 0 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 723 ms
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2022-05-17 17:00:28] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:28] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2022-05-17 17:00:28] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 0 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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination Liveness -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="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-6, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-tall-165277023900054"
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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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