Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678915079767

Running Version 202205111006
[2023-03-15 21:18:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 21:18:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:18:02] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2023-03-15 21:18:02] [INFO ] Transformed 834 places.
[2023-03-15 21:18:02] [INFO ] Transformed 1242 transitions.
[2023-03-15 21:18:02] [INFO ] Found NUPN structural information;
[2023-03-15 21:18:02] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-15 21:18:02] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 444 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1275 ms. (steps per millisecond=7 ) properties (out of 834) seen :288
Running SMT prover for 546 properties.
[2023-03-15 21:18:03] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 21:18:03] [INFO ] Computed 23 place invariants in 32 ms
[2023-03-15 21:18:22] [INFO ] After 18587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:546
[2023-03-15 21:18:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2023-03-15 21:18:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-15 21:18:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 21:18:47] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:546
Fused 546 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 546 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 834 transition count 1176
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 768 transition count 1176
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 132 place count 768 transition count 1107
Deduced a syphon composed of 69 places in 10 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 270 place count 699 transition count 1107
Applied a total of 270 rules in 215 ms. Remains 699 /834 variables (removed 135) and now considering 1107/1242 (removed 135) transitions.
Finished structural reductions, in 1 iterations. Remains : 699/834 places, 1107/1242 transitions.
Interrupted random walk after 393499 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 46
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 500) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 500) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 496) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 490) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 485) 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 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 485) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 479) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) 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 477) 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 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) 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 477) 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 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 477) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 477) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 473) 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 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 473) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 473) 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 473) 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 473) 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 473) 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 473) 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 473) 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 473) 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 473) 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 473) 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 473) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 469) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 469) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 469) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 469) 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 469) 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 469) 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 469) 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 469) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 469) 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 469) 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 469) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 469) 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 469) 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 469) 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 469) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 469) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) 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 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 465) 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 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) 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 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 465) 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 465) seen :0
Running SMT prover for 465 properties.
[2023-03-15 21:19:20] [INFO ] Flow matrix only has 987 transitions (discarded 120 similar events)
// Phase 1: matrix 987 rows 699 cols
[2023-03-15 21:19:20] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-15 21:19:33] [INFO ] After 12424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:465
[2023-03-15 21:19:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-03-15 21:19:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 21:20:04] [INFO ] After 16853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :465
[2023-03-15 21:20:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 21:20:27] [INFO ] After 22328ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :465
[2023-03-15 21:20:28] [INFO ] Deduced a trap composed of 9 places in 797 ms of which 14 ms to minimize.
[2023-03-15 21:20:28] [INFO ] Deduced a trap composed of 13 places in 715 ms of which 3 ms to minimize.
[2023-03-15 21:20:29] [INFO ] Deduced a trap composed of 34 places in 760 ms of which 3 ms to minimize.
[2023-03-15 21:20:30] [INFO ] Deduced a trap composed of 10 places in 687 ms of which 2 ms to minimize.
[2023-03-15 21:20:30] [INFO ] Deduced a trap composed of 13 places in 437 ms of which 2 ms to minimize.
[2023-03-15 21:20:31] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 3 ms to minimize.
[2023-03-15 21:20:32] [INFO ] Deduced a trap composed of 13 places in 540 ms of which 1 ms to minimize.
[2023-03-15 21:20:32] [INFO ] Deduced a trap composed of 63 places in 509 ms of which 3 ms to minimize.
[2023-03-15 21:20:33] [INFO ] Deduced a trap composed of 16 places in 501 ms of which 1 ms to minimize.
[2023-03-15 21:20:33] [INFO ] Deduced a trap composed of 70 places in 451 ms of which 1 ms to minimize.
[2023-03-15 21:20:34] [INFO ] Deduced a trap composed of 72 places in 410 ms of which 1 ms to minimize.
[2023-03-15 21:20:34] [INFO ] Deduced a trap composed of 36 places in 399 ms of which 1 ms to minimize.
[2023-03-15 21:20:35] [INFO ] Deduced a trap composed of 40 places in 413 ms of which 1 ms to minimize.
[2023-03-15 21:20:35] [INFO ] Deduced a trap composed of 64 places in 446 ms of which 2 ms to minimize.
[2023-03-15 21:20:35] [INFO ] Deduced a trap composed of 61 places in 385 ms of which 1 ms to minimize.
[2023-03-15 21:20:36] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 1 ms to minimize.
[2023-03-15 21:20:36] [INFO ] Deduced a trap composed of 61 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:20:37] [INFO ] Deduced a trap composed of 43 places in 408 ms of which 1 ms to minimize.
[2023-03-15 21:20:37] [INFO ] Deduced a trap composed of 35 places in 403 ms of which 1 ms to minimize.
[2023-03-15 21:20:38] [INFO ] Deduced a trap composed of 63 places in 512 ms of which 2 ms to minimize.
[2023-03-15 21:20:38] [INFO ] Deduced a trap composed of 79 places in 286 ms of which 1 ms to minimize.
[2023-03-15 21:20:39] [INFO ] Deduced a trap composed of 83 places in 350 ms of which 1 ms to minimize.
[2023-03-15 21:20:39] [INFO ] Deduced a trap composed of 82 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:20:39] [INFO ] Deduced a trap composed of 79 places in 289 ms of which 1 ms to minimize.
[2023-03-15 21:20:40] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 0 ms to minimize.
[2023-03-15 21:20:40] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:20:40] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 13603 ms
[2023-03-15 21:20:41] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:20:41] [INFO ] Deduced a trap composed of 69 places in 252 ms of which 1 ms to minimize.
[2023-03-15 21:20:41] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 0 ms to minimize.
[2023-03-15 21:20:42] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 1 ms to minimize.
[2023-03-15 21:20:42] [INFO ] Deduced a trap composed of 55 places in 252 ms of which 1 ms to minimize.
[2023-03-15 21:20:42] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 0 ms to minimize.
[2023-03-15 21:20:43] [INFO ] Deduced a trap composed of 71 places in 419 ms of which 1 ms to minimize.
[2023-03-15 21:20:43] [INFO ] Deduced a trap composed of 62 places in 350 ms of which 2 ms to minimize.
[2023-03-15 21:20:44] [INFO ] Deduced a trap composed of 91 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:20:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3195 ms
[2023-03-15 21:20:44] [INFO ] Deduced a trap composed of 115 places in 488 ms of which 1 ms to minimize.
[2023-03-15 21:20:45] [INFO ] Deduced a trap composed of 45 places in 449 ms of which 1 ms to minimize.
[2023-03-15 21:20:46] [INFO ] Deduced a trap composed of 14 places in 543 ms of which 2 ms to minimize.
[2023-03-15 21:20:46] [INFO ] Deduced a trap composed of 68 places in 481 ms of which 1 ms to minimize.
[2023-03-15 21:20:47] [INFO ] Deduced a trap composed of 71 places in 457 ms of which 3 ms to minimize.
[2023-03-15 21:20:47] [INFO ] Deduced a trap composed of 68 places in 439 ms of which 1 ms to minimize.
[2023-03-15 21:20:47] [INFO ] Deduced a trap composed of 88 places in 366 ms of which 1 ms to minimize.
[2023-03-15 21:20:48] [INFO ] Deduced a trap composed of 91 places in 353 ms of which 1 ms to minimize.
[2023-03-15 21:20:48] [INFO ] Deduced a trap composed of 88 places in 459 ms of which 0 ms to minimize.
[2023-03-15 21:20:49] [INFO ] Deduced a trap composed of 91 places in 446 ms of which 1 ms to minimize.
[2023-03-15 21:20:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5105 ms
[2023-03-15 21:20:49] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 1 ms to minimize.
[2023-03-15 21:20:49] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 1 ms to minimize.
[2023-03-15 21:20:50] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 1 ms to minimize.
[2023-03-15 21:20:50] [INFO ] Deduced a trap composed of 51 places in 247 ms of which 1 ms to minimize.
[2023-03-15 21:20:50] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 1 ms to minimize.
[2023-03-15 21:20:51] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:20:51] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 1 ms to minimize.
[2023-03-15 21:20:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1822 ms
[2023-03-15 21:20:51] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 0 ms to minimize.
[2023-03-15 21:20:52] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 1 ms to minimize.
[2023-03-15 21:20:52] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 1 ms to minimize.
[2023-03-15 21:20:52] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 1 ms to minimize.
[2023-03-15 21:20:53] [INFO ] Deduced a trap composed of 101 places in 188 ms of which 1 ms to minimize.
[2023-03-15 21:20:53] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 1 ms to minimize.
[2023-03-15 21:20:53] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 1 ms to minimize.
[2023-03-15 21:20:53] [INFO ] Deduced a trap composed of 146 places in 185 ms of which 1 ms to minimize.
[2023-03-15 21:20:54] [INFO ] Deduced a trap composed of 103 places in 225 ms of which 1 ms to minimize.
[2023-03-15 21:20:54] [INFO ] Deduced a trap composed of 107 places in 241 ms of which 0 ms to minimize.
[2023-03-15 21:20:54] [INFO ] Deduced a trap composed of 106 places in 245 ms of which 0 ms to minimize.
[2023-03-15 21:20:55] [INFO ] Deduced a trap composed of 110 places in 241 ms of which 1 ms to minimize.
[2023-03-15 21:20:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3474 ms
[2023-03-15 21:20:55] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:20:55] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 3 ms to minimize.
[2023-03-15 21:20:56] [INFO ] Deduced a trap composed of 87 places in 372 ms of which 1 ms to minimize.
[2023-03-15 21:20:56] [INFO ] Deduced a trap composed of 67 places in 294 ms of which 2 ms to minimize.
[2023-03-15 21:20:57] [INFO ] Deduced a trap composed of 62 places in 299 ms of which 1 ms to minimize.
[2023-03-15 21:20:57] [INFO ] Deduced a trap composed of 84 places in 191 ms of which 2 ms to minimize.
[2023-03-15 21:20:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2167 ms
[2023-03-15 21:20:58] [INFO ] Deduced a trap composed of 9 places in 572 ms of which 1 ms to minimize.
[2023-03-15 21:20:59] [INFO ] Deduced a trap composed of 9 places in 586 ms of which 1 ms to minimize.
[2023-03-15 21:20:59] [INFO ] Deduced a trap composed of 29 places in 661 ms of which 1 ms to minimize.
[2023-03-15 21:21:00] [INFO ] Deduced a trap composed of 9 places in 578 ms of which 1 ms to minimize.
[2023-03-15 21:21:01] [INFO ] Deduced a trap composed of 46 places in 543 ms of which 1 ms to minimize.
[2023-03-15 21:21:01] [INFO ] Deduced a trap composed of 21 places in 530 ms of which 1 ms to minimize.
[2023-03-15 21:21:02] [INFO ] Deduced a trap composed of 66 places in 327 ms of which 1 ms to minimize.
[2023-03-15 21:21:02] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 1 ms to minimize.
[2023-03-15 21:21:02] [INFO ] Deduced a trap composed of 113 places in 253 ms of which 1 ms to minimize.
[2023-03-15 21:21:03] [INFO ] Deduced a trap composed of 114 places in 244 ms of which 0 ms to minimize.
[2023-03-15 21:21:03] [INFO ] Deduced a trap composed of 110 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:21:03] [INFO ] Deduced a trap composed of 113 places in 231 ms of which 1 ms to minimize.
[2023-03-15 21:21:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5854 ms
[2023-03-15 21:21:04] [INFO ] Deduced a trap composed of 51 places in 385 ms of which 1 ms to minimize.
[2023-03-15 21:21:04] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 1 ms to minimize.
[2023-03-15 21:21:05] [INFO ] Deduced a trap composed of 176 places in 385 ms of which 1 ms to minimize.
[2023-03-15 21:21:05] [INFO ] Deduced a trap composed of 48 places in 283 ms of which 1 ms to minimize.
[2023-03-15 21:21:05] [INFO ] Deduced a trap composed of 109 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:21:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2144 ms
[2023-03-15 21:21:06] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:21:06] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 0 ms to minimize.
[2023-03-15 21:21:07] [INFO ] Deduced a trap composed of 17 places in 395 ms of which 1 ms to minimize.
[2023-03-15 21:21:07] [INFO ] Deduced a trap composed of 17 places in 522 ms of which 1 ms to minimize.
[2023-03-15 21:21:08] [INFO ] Deduced a trap composed of 24 places in 464 ms of which 1 ms to minimize.
[2023-03-15 21:21:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2411 ms
[2023-03-15 21:21:09] [INFO ] Deduced a trap composed of 40 places in 383 ms of which 1 ms to minimize.
[2023-03-15 21:21:09] [INFO ] Deduced a trap composed of 92 places in 531 ms of which 1 ms to minimize.
[2023-03-15 21:21:10] [INFO ] Deduced a trap composed of 83 places in 494 ms of which 1 ms to minimize.
[2023-03-15 21:21:10] [INFO ] Deduced a trap composed of 89 places in 478 ms of which 1 ms to minimize.
[2023-03-15 21:21:11] [INFO ] Deduced a trap composed of 87 places in 421 ms of which 1 ms to minimize.
[2023-03-15 21:21:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2714 ms
[2023-03-15 21:21:11] [INFO ] Deduced a trap composed of 61 places in 411 ms of which 1 ms to minimize.
[2023-03-15 21:21:12] [INFO ] Deduced a trap composed of 56 places in 443 ms of which 1 ms to minimize.
[2023-03-15 21:21:13] [INFO ] Deduced a trap composed of 60 places in 473 ms of which 2 ms to minimize.
[2023-03-15 21:21:13] [INFO ] Deduced a trap composed of 58 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:21:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2150 ms
[2023-03-15 21:21:14] [INFO ] Deduced a trap composed of 59 places in 389 ms of which 1 ms to minimize.
[2023-03-15 21:21:14] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 0 ms to minimize.
[2023-03-15 21:21:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 922 ms
[2023-03-15 21:21:15] [INFO ] Deduced a trap composed of 92 places in 397 ms of which 1 ms to minimize.
[2023-03-15 21:21:15] [INFO ] Deduced a trap composed of 115 places in 408 ms of which 1 ms to minimize.
[2023-03-15 21:21:15] [INFO ] Deduced a trap composed of 51 places in 398 ms of which 1 ms to minimize.
[2023-03-15 21:21:16] [INFO ] Deduced a trap composed of 99 places in 350 ms of which 1 ms to minimize.
[2023-03-15 21:21:16] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 1 ms to minimize.
[2023-03-15 21:21:17] [INFO ] Deduced a trap composed of 103 places in 306 ms of which 1 ms to minimize.
[2023-03-15 21:21:17] [INFO ] Deduced a trap composed of 100 places in 297 ms of which 1 ms to minimize.
[2023-03-15 21:21:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2838 ms
[2023-03-15 21:21:18] [INFO ] Deduced a trap composed of 9 places in 503 ms of which 2 ms to minimize.
[2023-03-15 21:21:18] [INFO ] Deduced a trap composed of 91 places in 387 ms of which 1 ms to minimize.
[2023-03-15 21:21:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1066 ms
[2023-03-15 21:21:19] [INFO ] Deduced a trap composed of 114 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:21:19] [INFO ] Deduced a trap composed of 111 places in 361 ms of which 0 ms to minimize.
[2023-03-15 21:21:20] [INFO ] Deduced a trap composed of 111 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:21:20] [INFO ] Deduced a trap composed of 114 places in 540 ms of which 2 ms to minimize.
[2023-03-15 21:21:21] [INFO ] Deduced a trap composed of 108 places in 564 ms of which 1 ms to minimize.
[2023-03-15 21:21:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2589 ms
[2023-03-15 21:21:22] [INFO ] Deduced a trap composed of 40 places in 596 ms of which 1 ms to minimize.
[2023-03-15 21:21:23] [INFO ] Deduced a trap composed of 47 places in 595 ms of which 1 ms to minimize.
[2023-03-15 21:21:24] [INFO ] Deduced a trap composed of 44 places in 550 ms of which 1 ms to minimize.
[2023-03-15 21:21:24] [INFO ] Deduced a trap composed of 45 places in 560 ms of which 2 ms to minimize.
[2023-03-15 21:21:25] [INFO ] Deduced a trap composed of 22 places in 445 ms of which 1 ms to minimize.
[2023-03-15 21:21:25] [INFO ] Deduced a trap composed of 32 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:21:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3621 ms
[2023-03-15 21:21:26] [INFO ] Deduced a trap composed of 29 places in 376 ms of which 1 ms to minimize.
[2023-03-15 21:21:26] [INFO ] Deduced a trap composed of 116 places in 172 ms of which 1 ms to minimize.
[2023-03-15 21:21:26] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 0 ms to minimize.
[2023-03-15 21:21:27] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2023-03-15 21:21:28] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 0 ms to minimize.
[2023-03-15 21:21:28] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 1 ms to minimize.
[2023-03-15 21:21:28] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 1 ms to minimize.
[2023-03-15 21:21:29] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 1 ms to minimize.
[2023-03-15 21:21:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3420 ms
[2023-03-15 21:21:29] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-15 21:21:30] [INFO ] Deduced a trap composed of 77 places in 495 ms of which 0 ms to minimize.
[2023-03-15 21:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 612 ms
[2023-03-15 21:21:31] [INFO ] Deduced a trap composed of 115 places in 341 ms of which 0 ms to minimize.
[2023-03-15 21:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 445 ms
[2023-03-15 21:21:31] [INFO ] Deduced a trap composed of 51 places in 421 ms of which 1 ms to minimize.
[2023-03-15 21:21:32] [INFO ] Deduced a trap composed of 36 places in 476 ms of which 1 ms to minimize.
[2023-03-15 21:21:32] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 1 ms to minimize.
[2023-03-15 21:21:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1510 ms
[2023-03-15 21:21:33] [INFO ] Deduced a trap composed of 88 places in 466 ms of which 1 ms to minimize.
[2023-03-15 21:21:34] [INFO ] Deduced a trap composed of 41 places in 476 ms of which 1 ms to minimize.
[2023-03-15 21:21:34] [INFO ] Deduced a trap composed of 58 places in 517 ms of which 0 ms to minimize.
[2023-03-15 21:21:35] [INFO ] Deduced a trap composed of 45 places in 506 ms of which 2 ms to minimize.
[2023-03-15 21:21:36] [INFO ] Deduced a trap composed of 45 places in 481 ms of which 1 ms to minimize.
[2023-03-15 21:21:36] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 1 ms to minimize.
[2023-03-15 21:21:37] [INFO ] Deduced a trap composed of 46 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:21:37] [INFO ] Deduced a trap composed of 36 places in 400 ms of which 1 ms to minimize.
[2023-03-15 21:21:37] [INFO ] Deduced a trap composed of 46 places in 393 ms of which 1 ms to minimize.
[2023-03-15 21:21:38] [INFO ] Deduced a trap composed of 46 places in 384 ms of which 1 ms to minimize.
[2023-03-15 21:21:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5064 ms
[2023-03-15 21:21:38] [INFO ] Deduced a trap composed of 87 places in 335 ms of which 1 ms to minimize.
[2023-03-15 21:21:39] [INFO ] Deduced a trap composed of 90 places in 254 ms of which 1 ms to minimize.
[2023-03-15 21:21:39] [INFO ] Deduced a trap composed of 87 places in 259 ms of which 0 ms to minimize.
[2023-03-15 21:21:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1070 ms
[2023-03-15 21:21:40] [INFO ] Deduced a trap composed of 46 places in 384 ms of which 1 ms to minimize.
[2023-03-15 21:21:40] [INFO ] Deduced a trap composed of 86 places in 324 ms of which 0 ms to minimize.
[2023-03-15 21:21:41] [INFO ] Deduced a trap composed of 66 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:21:41] [INFO ] Deduced a trap composed of 86 places in 287 ms of which 1 ms to minimize.
[2023-03-15 21:21:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1631 ms
[2023-03-15 21:21:41] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 0 ms to minimize.
[2023-03-15 21:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 828 ms
[2023-03-15 21:21:43] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 1 ms to minimize.
[2023-03-15 21:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-15 21:21:43] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 1 ms to minimize.
[2023-03-15 21:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2023-03-15 21:21:44] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 0 ms to minimize.
[2023-03-15 21:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-15 21:21:46] [INFO ] Deduced a trap composed of 17 places in 480 ms of which 1 ms to minimize.
[2023-03-15 21:21:47] [INFO ] Deduced a trap composed of 32 places in 509 ms of which 1 ms to minimize.
[2023-03-15 21:21:47] [INFO ] Deduced a trap composed of 105 places in 337 ms of which 1 ms to minimize.
[2023-03-15 21:21:47] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 1 ms to minimize.
[2023-03-15 21:21:48] [INFO ] Deduced a trap composed of 78 places in 275 ms of which 1 ms to minimize.
[2023-03-15 21:21:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2154 ms
[2023-03-15 21:21:49] [INFO ] Deduced a trap composed of 70 places in 384 ms of which 1 ms to minimize.
[2023-03-15 21:21:50] [INFO ] Deduced a trap composed of 76 places in 374 ms of which 0 ms to minimize.
[2023-03-15 21:21:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 907 ms
[2023-03-15 21:21:51] [INFO ] Deduced a trap composed of 33 places in 445 ms of which 1 ms to minimize.
[2023-03-15 21:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2023-03-15 21:21:52] [INFO ] Deduced a trap composed of 25 places in 498 ms of which 1 ms to minimize.
[2023-03-15 21:21:52] [INFO ] Deduced a trap composed of 31 places in 541 ms of which 1 ms to minimize.
[2023-03-15 21:21:53] [INFO ] Deduced a trap composed of 9 places in 529 ms of which 1 ms to minimize.
[2023-03-15 21:21:53] [INFO ] Deduced a trap composed of 30 places in 565 ms of which 1 ms to minimize.
[2023-03-15 21:21:54] [INFO ] Deduced a trap composed of 64 places in 501 ms of which 1 ms to minimize.
[2023-03-15 21:21:54] [INFO ] Deduced a trap composed of 75 places in 372 ms of which 1 ms to minimize.
[2023-03-15 21:21:55] [INFO ] Deduced a trap composed of 71 places in 431 ms of which 1 ms to minimize.
[2023-03-15 21:21:55] [INFO ] Deduced a trap composed of 41 places in 468 ms of which 1 ms to minimize.
[2023-03-15 21:21:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4423 ms
[2023-03-15 21:21:57] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 1 ms to minimize.
[2023-03-15 21:21:57] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2023-03-15 21:21:58] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 0 ms to minimize.
[2023-03-15 21:21:58] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 0 ms to minimize.
[2023-03-15 21:21:58] [INFO ] Deduced a trap composed of 105 places in 290 ms of which 1 ms to minimize.
[2023-03-15 21:21:58] [INFO ] Deduced a trap composed of 105 places in 266 ms of which 1 ms to minimize.
[2023-03-15 21:21:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1169 ms
[2023-03-15 21:21:59] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 0 ms to minimize.
[2023-03-15 21:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-15 21:22:01] [INFO ] Deduced a trap composed of 85 places in 370 ms of which 0 ms to minimize.
[2023-03-15 21:22:02] [INFO ] Deduced a trap composed of 61 places in 303 ms of which 1 ms to minimize.
[2023-03-15 21:22:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 828 ms
[2023-03-15 21:22:02] [INFO ] Deduced a trap composed of 75 places in 312 ms of which 1 ms to minimize.
[2023-03-15 21:22:03] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 1 ms to minimize.
[2023-03-15 21:22:03] [INFO ] Deduced a trap composed of 100 places in 301 ms of which 1 ms to minimize.
[2023-03-15 21:22:03] [INFO ] Deduced a trap composed of 75 places in 326 ms of which 1 ms to minimize.
[2023-03-15 21:22:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2132 ms
[2023-03-15 21:22:05] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2023-03-15 21:22:05] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 0 ms to minimize.
[2023-03-15 21:22:05] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:22:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1207 ms
[2023-03-15 21:22:07] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 1 ms to minimize.
[2023-03-15 21:22:08] [INFO ] Deduced a trap composed of 88 places in 428 ms of which 1 ms to minimize.
[2023-03-15 21:22:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1241 ms
[2023-03-15 21:22:09] [INFO ] Deduced a trap composed of 98 places in 460 ms of which 1 ms to minimize.
[2023-03-15 21:22:09] [INFO ] Deduced a trap composed of 109 places in 418 ms of which 1 ms to minimize.
[2023-03-15 21:22:10] [INFO ] Deduced a trap composed of 117 places in 469 ms of which 1 ms to minimize.
[2023-03-15 21:22:11] [INFO ] Deduced a trap composed of 41 places in 484 ms of which 0 ms to minimize.
[2023-03-15 21:22:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2224 ms
[2023-03-15 21:22:11] [INFO ] Deduced a trap composed of 41 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:22:12] [INFO ] Deduced a trap composed of 41 places in 383 ms of which 1 ms to minimize.
[2023-03-15 21:22:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 876 ms
[2023-03-15 21:22:14] [INFO ] Deduced a trap composed of 73 places in 409 ms of which 1 ms to minimize.
[2023-03-15 21:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2023-03-15 21:22:15] [INFO ] Deduced a trap composed of 50 places in 584 ms of which 1 ms to minimize.
[2023-03-15 21:22:16] [INFO ] Deduced a trap composed of 50 places in 550 ms of which 2 ms to minimize.
[2023-03-15 21:22:16] [INFO ] Deduced a trap composed of 50 places in 547 ms of which 2 ms to minimize.
[2023-03-15 21:22:17] [INFO ] Deduced a trap composed of 37 places in 565 ms of which 1 ms to minimize.
[2023-03-15 21:22:17] [INFO ] Deduced a trap composed of 42 places in 557 ms of which 1 ms to minimize.
[2023-03-15 21:22:18] [INFO ] Deduced a trap composed of 25 places in 558 ms of which 2 ms to minimize.
[2023-03-15 21:22:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3906 ms
[2023-03-15 21:22:19] [INFO ] Deduced a trap composed of 34 places in 586 ms of which 1 ms to minimize.
[2023-03-15 21:22:20] [INFO ] Deduced a trap composed of 120 places in 573 ms of which 1 ms to minimize.
[2023-03-15 21:22:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1806 ms
[2023-03-15 21:22:21] [INFO ] Deduced a trap composed of 119 places in 412 ms of which 1 ms to minimize.
[2023-03-15 21:22:22] [INFO ] Deduced a trap composed of 139 places in 457 ms of which 1 ms to minimize.
[2023-03-15 21:22:22] [INFO ] Deduced a trap composed of 160 places in 474 ms of which 1 ms to minimize.
[2023-03-15 21:22:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1697 ms
[2023-03-15 21:22:23] [INFO ] Deduced a trap composed of 106 places in 536 ms of which 1 ms to minimize.
[2023-03-15 21:22:23] [INFO ] Deduced a trap composed of 67 places in 514 ms of which 2 ms to minimize.
[2023-03-15 21:22:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1287 ms
[2023-03-15 21:22:24] [INFO ] Deduced a trap composed of 91 places in 445 ms of which 1 ms to minimize.
[2023-03-15 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 601 ms
[2023-03-15 21:22:29] [INFO ] Deduced a trap composed of 90 places in 343 ms of which 1 ms to minimize.
[2023-03-15 21:22:29] [INFO ] Deduced a trap composed of 66 places in 418 ms of which 2 ms to minimize.
[2023-03-15 21:22:30] [INFO ] Deduced a trap composed of 111 places in 354 ms of which 2 ms to minimize.
[2023-03-15 21:22:30] [INFO ] Deduced a trap composed of 71 places in 488 ms of which 1 ms to minimize.
[2023-03-15 21:22:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2203 ms
[2023-03-15 21:22:31] [INFO ] Deduced a trap composed of 88 places in 283 ms of which 0 ms to minimize.
[2023-03-15 21:22:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2023-03-15 21:22:32] [INFO ] Deduced a trap composed of 52 places in 584 ms of which 1 ms to minimize.
[2023-03-15 21:22:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 746 ms
[2023-03-15 21:22:34] [INFO ] Deduced a trap composed of 63 places in 526 ms of which 1 ms to minimize.
[2023-03-15 21:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 681 ms
[2023-03-15 21:22:34] [INFO ] Deduced a trap composed of 87 places in 443 ms of which 1 ms to minimize.
[2023-03-15 21:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2023-03-15 21:22:36] [INFO ] Deduced a trap composed of 157 places in 339 ms of which 1 ms to minimize.
[2023-03-15 21:22:37] [INFO ] Deduced a trap composed of 137 places in 326 ms of which 1 ms to minimize.
[2023-03-15 21:22:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 929 ms
[2023-03-15 21:22:37] [INFO ] Deduced a trap composed of 86 places in 371 ms of which 1 ms to minimize.
[2023-03-15 21:22:38] [INFO ] Deduced a trap composed of 86 places in 352 ms of which 1 ms to minimize.
[2023-03-15 21:22:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 961 ms
[2023-03-15 21:22:56] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 2 ms to minimize.
[2023-03-15 21:22:57] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 0 ms to minimize.
[2023-03-15 21:22:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1686 ms
[2023-03-15 21:22:58] [INFO ] Deduced a trap composed of 74 places in 358 ms of which 1 ms to minimize.
[2023-03-15 21:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-15 21:23:00] [INFO ] Deduced a trap composed of 137 places in 503 ms of which 1 ms to minimize.
[2023-03-15 21:23:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 656 ms
[2023-03-15 21:23:12] [INFO ] Deduced a trap composed of 117 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 738 ms
[2023-03-15 21:23:15] [INFO ] Deduced a trap composed of 60 places in 595 ms of which 1 ms to minimize.
[2023-03-15 21:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 753 ms
[2023-03-15 21:23:18] [INFO ] After 193176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :465
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 21:23:18] [INFO ] After 225033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :465
Parikh walk visited 42 properties in 17493 ms.
Support contains 423 out of 699 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 699/699 places, 1107/1107 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 699 transition count 1041
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 633 transition count 1041
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 132 place count 633 transition count 1013
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 188 place count 605 transition count 1013
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 190 place count 604 transition count 1012
Applied a total of 190 rules in 100 ms. Remains 604 /699 variables (removed 95) and now considering 1012/1107 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 604/699 places, 1012/1107 transitions.
Interrupted random walk after 408084 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 410) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 406) 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 406) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 399) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 398) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 398) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 398) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 398) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 395) 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 395) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 391) 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 391) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 387) 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 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 387) 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 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 387) 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 387) 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 387) 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 387) 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 387) 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 387) 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 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 387) 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 387) 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 387) 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 387) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 383) 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 383) 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 383) 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 383) 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 383) 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 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 383) 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 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 383) 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 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 383) 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 383) 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 383) 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 383) 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 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 383) 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 383) 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 383) 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 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 383) 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 383) 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 383) 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 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 383) 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 383) 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 383) 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 383) 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 383) 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 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 383) 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 383) 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 383) 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 383) 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 383) 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 383) 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 383) 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 383) 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 383) 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 383) seen :0
Running SMT prover for 383 properties.
[2023-03-15 21:24:17] [INFO ] Flow matrix only has 892 transitions (discarded 120 similar events)
// Phase 1: matrix 892 rows 604 cols
[2023-03-15 21:24:17] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 21:24:23] [INFO ] After 6374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:383
[2023-03-15 21:24:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-15 21:24:28] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-15 21:24:45] [INFO ] After 12314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :383
[2023-03-15 21:24:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 21:25:04] [INFO ] After 18544ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :383
[2023-03-15 21:25:04] [INFO ] Deduced a trap composed of 13 places in 585 ms of which 2 ms to minimize.
[2023-03-15 21:25:05] [INFO ] Deduced a trap composed of 12 places in 583 ms of which 1 ms to minimize.
[2023-03-15 21:25:05] [INFO ] Deduced a trap composed of 9 places in 553 ms of which 1 ms to minimize.
[2023-03-15 21:25:06] [INFO ] Deduced a trap composed of 49 places in 482 ms of which 1 ms to minimize.
[2023-03-15 21:25:06] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 1 ms to minimize.
[2023-03-15 21:25:07] [INFO ] Deduced a trap composed of 33 places in 405 ms of which 1 ms to minimize.
[2023-03-15 21:25:07] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 1 ms to minimize.
[2023-03-15 21:25:08] [INFO ] Deduced a trap composed of 29 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:25:08] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 1 ms to minimize.
[2023-03-15 21:25:09] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 1 ms to minimize.
[2023-03-15 21:25:09] [INFO ] Deduced a trap composed of 87 places in 387 ms of which 1 ms to minimize.
[2023-03-15 21:25:09] [INFO ] Deduced a trap composed of 39 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:25:10] [INFO ] Deduced a trap composed of 12 places in 510 ms of which 1 ms to minimize.
[2023-03-15 21:25:10] [INFO ] Deduced a trap composed of 9 places in 392 ms of which 2 ms to minimize.
[2023-03-15 21:25:11] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 1 ms to minimize.
[2023-03-15 21:25:11] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 1 ms to minimize.
[2023-03-15 21:25:12] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 2 ms to minimize.
[2023-03-15 21:25:12] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 2 ms to minimize.
[2023-03-15 21:25:12] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 1 ms to minimize.
[2023-03-15 21:25:12] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 0 ms to minimize.
[2023-03-15 21:25:13] [INFO ] Deduced a trap composed of 74 places in 235 ms of which 0 ms to minimize.
[2023-03-15 21:25:13] [INFO ] Deduced a trap composed of 57 places in 251 ms of which 0 ms to minimize.
[2023-03-15 21:25:13] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 1 ms to minimize.
[2023-03-15 21:25:14] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 4 ms to minimize.
[2023-03-15 21:25:14] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 2 ms to minimize.
[2023-03-15 21:25:14] [INFO ] Deduced a trap composed of 79 places in 211 ms of which 1 ms to minimize.
[2023-03-15 21:25:14] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:25:14] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10814 ms
[2023-03-15 21:25:15] [INFO ] Deduced a trap composed of 50 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:25:16] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 1 ms to minimize.
[2023-03-15 21:25:16] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:25:17] [INFO ] Deduced a trap composed of 51 places in 372 ms of which 1 ms to minimize.
[2023-03-15 21:25:17] [INFO ] Deduced a trap composed of 36 places in 400 ms of which 1 ms to minimize.
[2023-03-15 21:25:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2285 ms
[2023-03-15 21:25:18] [INFO ] Deduced a trap composed of 45 places in 440 ms of which 1 ms to minimize.
[2023-03-15 21:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2023-03-15 21:25:18] [INFO ] Deduced a trap composed of 42 places in 345 ms of which 1 ms to minimize.
[2023-03-15 21:25:19] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 1 ms to minimize.
[2023-03-15 21:25:19] [INFO ] Deduced a trap composed of 116 places in 421 ms of which 1 ms to minimize.
[2023-03-15 21:25:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1410 ms
[2023-03-15 21:25:20] [INFO ] Deduced a trap composed of 87 places in 283 ms of which 0 ms to minimize.
[2023-03-15 21:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-15 21:25:21] [INFO ] Deduced a trap composed of 9 places in 540 ms of which 1 ms to minimize.
[2023-03-15 21:25:21] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 1 ms to minimize.
[2023-03-15 21:25:22] [INFO ] Deduced a trap composed of 102 places in 315 ms of which 1 ms to minimize.
[2023-03-15 21:25:22] [INFO ] Deduced a trap composed of 100 places in 296 ms of which 1 ms to minimize.
[2023-03-15 21:25:22] [INFO ] Deduced a trap composed of 102 places in 303 ms of which 1 ms to minimize.
[2023-03-15 21:25:23] [INFO ] Deduced a trap composed of 96 places in 290 ms of which 0 ms to minimize.
[2023-03-15 21:25:23] [INFO ] Deduced a trap composed of 96 places in 268 ms of which 1 ms to minimize.
[2023-03-15 21:25:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2994 ms
[2023-03-15 21:25:23] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 0 ms to minimize.
[2023-03-15 21:25:24] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 1 ms to minimize.
[2023-03-15 21:25:24] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 1 ms to minimize.
[2023-03-15 21:25:24] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 1 ms to minimize.
[2023-03-15 21:25:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1065 ms
[2023-03-15 21:25:25] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:25:25] [INFO ] Deduced a trap composed of 78 places in 270 ms of which 1 ms to minimize.
[2023-03-15 21:25:25] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 1 ms to minimize.
[2023-03-15 21:25:26] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2023-03-15 21:25:26] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 1 ms to minimize.
[2023-03-15 21:25:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1675 ms
[2023-03-15 21:25:26] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 1 ms to minimize.
[2023-03-15 21:25:26] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 0 ms to minimize.
[2023-03-15 21:25:27] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 1 ms to minimize.
[2023-03-15 21:25:27] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 0 ms to minimize.
[2023-03-15 21:25:27] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:25:28] [INFO ] Deduced a trap composed of 90 places in 324 ms of which 1 ms to minimize.
[2023-03-15 21:25:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1739 ms
[2023-03-15 21:25:28] [INFO ] Deduced a trap composed of 16 places in 399 ms of which 1 ms to minimize.
[2023-03-15 21:25:29] [INFO ] Deduced a trap composed of 35 places in 466 ms of which 1 ms to minimize.
[2023-03-15 21:25:29] [INFO ] Deduced a trap composed of 26 places in 454 ms of which 1 ms to minimize.
[2023-03-15 21:25:30] [INFO ] Deduced a trap composed of 46 places in 469 ms of which 1 ms to minimize.
[2023-03-15 21:25:30] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 1 ms to minimize.
[2023-03-15 21:25:31] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:25:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2761 ms
[2023-03-15 21:25:32] [INFO ] Deduced a trap composed of 16 places in 399 ms of which 0 ms to minimize.
[2023-03-15 21:25:32] [INFO ] Deduced a trap composed of 33 places in 343 ms of which 0 ms to minimize.
[2023-03-15 21:25:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 870 ms
[2023-03-15 21:25:33] [INFO ] Deduced a trap composed of 70 places in 211 ms of which 0 ms to minimize.
[2023-03-15 21:25:33] [INFO ] Deduced a trap composed of 70 places in 281 ms of which 0 ms to minimize.
[2023-03-15 21:25:33] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:25:33] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2023-03-15 21:25:34] [INFO ] Deduced a trap composed of 36 places in 422 ms of which 0 ms to minimize.
[2023-03-15 21:25:34] [INFO ] Deduced a trap composed of 15 places in 412 ms of which 1 ms to minimize.
[2023-03-15 21:25:35] [INFO ] Deduced a trap composed of 10 places in 436 ms of which 2 ms to minimize.
[2023-03-15 21:25:35] [INFO ] Deduced a trap composed of 50 places in 454 ms of which 0 ms to minimize.
[2023-03-15 21:25:36] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 1 ms to minimize.
[2023-03-15 21:25:36] [INFO ] Deduced a trap composed of 100 places in 404 ms of which 0 ms to minimize.
[2023-03-15 21:25:36] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 0 ms to minimize.
[2023-03-15 21:25:37] [INFO ] Deduced a trap composed of 50 places in 259 ms of which 0 ms to minimize.
[2023-03-15 21:25:37] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 1 ms to minimize.
[2023-03-15 21:25:37] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 1 ms to minimize.
[2023-03-15 21:25:38] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:25:38] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 0 ms to minimize.
[2023-03-15 21:25:38] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 3 ms to minimize.
[2023-03-15 21:25:38] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5930 ms
[2023-03-15 21:25:39] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 1 ms to minimize.
[2023-03-15 21:25:39] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2023-03-15 21:25:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
[2023-03-15 21:25:39] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 1 ms to minimize.
[2023-03-15 21:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 21:25:40] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 0 ms to minimize.
[2023-03-15 21:25:40] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 0 ms to minimize.
[2023-03-15 21:25:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 725 ms
[2023-03-15 21:25:40] [INFO ] Deduced a trap composed of 29 places in 268 ms of which 1 ms to minimize.
[2023-03-15 21:25:41] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 1 ms to minimize.
[2023-03-15 21:25:41] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 1 ms to minimize.
[2023-03-15 21:25:42] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 1 ms to minimize.
[2023-03-15 21:25:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1405 ms
[2023-03-15 21:25:42] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2023-03-15 21:25:42] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-15 21:25:42] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2023-03-15 21:25:43] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 2 ms to minimize.
[2023-03-15 21:25:43] [INFO ] Deduced a trap composed of 16 places in 425 ms of which 1 ms to minimize.
[2023-03-15 21:25:44] [INFO ] Deduced a trap composed of 11 places in 444 ms of which 1 ms to minimize.
[2023-03-15 21:25:44] [INFO ] Deduced a trap composed of 74 places in 407 ms of which 1 ms to minimize.
[2023-03-15 21:25:45] [INFO ] Deduced a trap composed of 97 places in 380 ms of which 0 ms to minimize.
[2023-03-15 21:25:45] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 0 ms to minimize.
[2023-03-15 21:25:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3495 ms
[2023-03-15 21:25:46] [INFO ] Deduced a trap composed of 70 places in 419 ms of which 1 ms to minimize.
[2023-03-15 21:25:46] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 1 ms to minimize.
[2023-03-15 21:25:47] [INFO ] Deduced a trap composed of 94 places in 290 ms of which 1 ms to minimize.
[2023-03-15 21:25:47] [INFO ] Deduced a trap composed of 94 places in 290 ms of which 1 ms to minimize.
[2023-03-15 21:25:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1571 ms
[2023-03-15 21:25:47] [INFO ] Deduced a trap composed of 88 places in 358 ms of which 1 ms to minimize.
[2023-03-15 21:25:48] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 1 ms to minimize.
[2023-03-15 21:25:48] [INFO ] Deduced a trap composed of 88 places in 245 ms of which 1 ms to minimize.
[2023-03-15 21:25:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1241 ms
[2023-03-15 21:25:49] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 1 ms to minimize.
[2023-03-15 21:25:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-15 21:25:50] [INFO ] Deduced a trap composed of 49 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:25:50] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 1 ms to minimize.
[2023-03-15 21:25:50] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 0 ms to minimize.
[2023-03-15 21:25:51] [INFO ] Deduced a trap composed of 92 places in 230 ms of which 1 ms to minimize.
[2023-03-15 21:25:51] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 0 ms to minimize.
[2023-03-15 21:25:51] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 0 ms to minimize.
[2023-03-15 21:25:51] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 0 ms to minimize.
[2023-03-15 21:25:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1797 ms
[2023-03-15 21:25:52] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 0 ms to minimize.
[2023-03-15 21:25:52] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 1 ms to minimize.
[2023-03-15 21:25:52] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 1 ms to minimize.
[2023-03-15 21:25:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1012 ms
[2023-03-15 21:25:53] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 1 ms to minimize.
[2023-03-15 21:25:53] [INFO ] Deduced a trap composed of 79 places in 292 ms of which 1 ms to minimize.
[2023-03-15 21:25:54] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 1 ms to minimize.
[2023-03-15 21:25:54] [INFO ] Deduced a trap composed of 41 places in 335 ms of which 1 ms to minimize.
[2023-03-15 21:25:55] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 0 ms to minimize.
[2023-03-15 21:25:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1789 ms
[2023-03-15 21:25:55] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 1 ms to minimize.
[2023-03-15 21:25:55] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-15 21:25:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 772 ms
[2023-03-15 21:25:56] [INFO ] Deduced a trap composed of 64 places in 366 ms of which 0 ms to minimize.
[2023-03-15 21:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2023-03-15 21:25:56] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 0 ms to minimize.
[2023-03-15 21:25:57] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 1 ms to minimize.
[2023-03-15 21:25:57] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 1 ms to minimize.
[2023-03-15 21:25:57] [INFO ] Deduced a trap composed of 94 places in 248 ms of which 1 ms to minimize.
[2023-03-15 21:25:57] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 0 ms to minimize.
[2023-03-15 21:25:58] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 0 ms to minimize.
[2023-03-15 21:25:58] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 0 ms to minimize.
[2023-03-15 21:25:58] [INFO ] Deduced a trap composed of 59 places in 280 ms of which 1 ms to minimize.
[2023-03-15 21:25:59] [INFO ] Deduced a trap composed of 76 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:25:59] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:25:59] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2023-03-15 21:25:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3133 ms
[2023-03-15 21:26:00] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2023-03-15 21:26:00] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 0 ms to minimize.
[2023-03-15 21:26:00] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2023-03-15 21:26:01] [INFO ] Deduced a trap composed of 37 places in 451 ms of which 1 ms to minimize.
[2023-03-15 21:26:02] [INFO ] Deduced a trap composed of 45 places in 436 ms of which 1 ms to minimize.
[2023-03-15 21:26:02] [INFO ] Deduced a trap composed of 45 places in 352 ms of which 1 ms to minimize.
[2023-03-15 21:26:02] [INFO ] Deduced a trap composed of 85 places in 263 ms of which 0 ms to minimize.
[2023-03-15 21:26:03] [INFO ] Deduced a trap composed of 85 places in 258 ms of which 0 ms to minimize.
[2023-03-15 21:26:03] [INFO ] Deduced a trap composed of 85 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:26:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3756 ms
[2023-03-15 21:26:05] [INFO ] Deduced a trap composed of 27 places in 451 ms of which 1 ms to minimize.
[2023-03-15 21:26:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2023-03-15 21:26:07] [INFO ] Deduced a trap composed of 10 places in 525 ms of which 1 ms to minimize.
[2023-03-15 21:26:07] [INFO ] Deduced a trap composed of 10 places in 541 ms of which 1 ms to minimize.
[2023-03-15 21:26:08] [INFO ] Deduced a trap composed of 100 places in 478 ms of which 1 ms to minimize.
[2023-03-15 21:26:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1813 ms
[2023-03-15 21:26:09] [INFO ] Deduced a trap composed of 93 places in 195 ms of which 0 ms to minimize.
[2023-03-15 21:26:09] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 1 ms to minimize.
[2023-03-15 21:26:10] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 0 ms to minimize.
[2023-03-15 21:26:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1347 ms
[2023-03-15 21:26:11] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 1 ms to minimize.
[2023-03-15 21:26:11] [INFO ] Deduced a trap composed of 94 places in 274 ms of which 1 ms to minimize.
[2023-03-15 21:26:11] [INFO ] Deduced a trap composed of 73 places in 346 ms of which 1 ms to minimize.
[2023-03-15 21:26:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1101 ms
[2023-03-15 21:26:12] [INFO ] Deduced a trap composed of 66 places in 378 ms of which 1 ms to minimize.
[2023-03-15 21:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2023-03-15 21:26:13] [INFO ] Deduced a trap composed of 11 places in 480 ms of which 1 ms to minimize.
[2023-03-15 21:26:13] [INFO ] Deduced a trap composed of 37 places in 463 ms of which 1 ms to minimize.
[2023-03-15 21:26:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1136 ms
[2023-03-15 21:26:14] [INFO ] Deduced a trap composed of 61 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:26:14] [INFO ] Deduced a trap composed of 62 places in 311 ms of which 1 ms to minimize.
[2023-03-15 21:26:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 824 ms
[2023-03-15 21:26:15] [INFO ] Deduced a trap composed of 25 places in 458 ms of which 1 ms to minimize.
[2023-03-15 21:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 585 ms
[2023-03-15 21:26:16] [INFO ] Deduced a trap composed of 65 places in 425 ms of which 2 ms to minimize.
[2023-03-15 21:26:16] [INFO ] Deduced a trap composed of 45 places in 426 ms of which 2 ms to minimize.
[2023-03-15 21:26:16] [INFO ] Deduced a trap composed of 44 places in 422 ms of which 1 ms to minimize.
[2023-03-15 21:26:17] [INFO ] Deduced a trap composed of 32 places in 427 ms of which 1 ms to minimize.
[2023-03-15 21:26:17] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 1 ms to minimize.
[2023-03-15 21:26:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2521 ms
[2023-03-15 21:26:18] [INFO ] Deduced a trap composed of 47 places in 505 ms of which 1 ms to minimize.
[2023-03-15 21:26:19] [INFO ] Deduced a trap composed of 114 places in 484 ms of which 1 ms to minimize.
[2023-03-15 21:26:19] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 1 ms to minimize.
[2023-03-15 21:26:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1721 ms
[2023-03-15 21:26:20] [INFO ] Deduced a trap composed of 62 places in 413 ms of which 1 ms to minimize.
[2023-03-15 21:26:20] [INFO ] Deduced a trap composed of 77 places in 396 ms of which 1 ms to minimize.
[2023-03-15 21:26:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1031 ms
[2023-03-15 21:26:21] [INFO ] Deduced a trap composed of 20 places in 457 ms of which 1 ms to minimize.
[2023-03-15 21:26:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 585 ms
[2023-03-15 21:26:22] [INFO ] Deduced a trap composed of 70 places in 410 ms of which 1 ms to minimize.
[2023-03-15 21:26:23] [INFO ] Deduced a trap composed of 99 places in 438 ms of which 1 ms to minimize.
[2023-03-15 21:26:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1063 ms
[2023-03-15 21:26:23] [INFO ] Deduced a trap composed of 134 places in 411 ms of which 1 ms to minimize.
[2023-03-15 21:26:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 542 ms
[2023-03-15 21:26:24] [INFO ] Deduced a trap composed of 112 places in 385 ms of which 1 ms to minimize.
[2023-03-15 21:26:24] [INFO ] Deduced a trap composed of 115 places in 386 ms of which 1 ms to minimize.
[2023-03-15 21:26:25] [INFO ] Deduced a trap composed of 116 places in 369 ms of which 0 ms to minimize.
[2023-03-15 21:26:25] [INFO ] Deduced a trap composed of 119 places in 375 ms of which 1 ms to minimize.
[2023-03-15 21:26:26] [INFO ] Deduced a trap composed of 112 places in 396 ms of which 1 ms to minimize.
[2023-03-15 21:26:26] [INFO ] Deduced a trap composed of 112 places in 390 ms of which 1 ms to minimize.
[2023-03-15 21:26:27] [INFO ] Deduced a trap composed of 154 places in 322 ms of which 1 ms to minimize.
[2023-03-15 21:26:27] [INFO ] Deduced a trap composed of 169 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:26:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3584 ms
[2023-03-15 21:26:29] [INFO ] Deduced a trap composed of 86 places in 277 ms of which 1 ms to minimize.
[2023-03-15 21:26:29] [INFO ] Deduced a trap composed of 86 places in 280 ms of which 1 ms to minimize.
[2023-03-15 21:26:30] [INFO ] Deduced a trap composed of 90 places in 282 ms of which 1 ms to minimize.
[2023-03-15 21:26:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1096 ms
[2023-03-15 21:26:31] [INFO ] Deduced a trap composed of 94 places in 274 ms of which 1 ms to minimize.
[2023-03-15 21:26:31] [INFO ] Deduced a trap composed of 93 places in 281 ms of which 1 ms to minimize.
[2023-03-15 21:26:32] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 1 ms to minimize.
[2023-03-15 21:26:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1354 ms
[2023-03-15 21:26:33] [INFO ] Deduced a trap composed of 100 places in 422 ms of which 1 ms to minimize.
[2023-03-15 21:26:33] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 1 ms to minimize.
[2023-03-15 21:26:34] [INFO ] Deduced a trap composed of 66 places in 382 ms of which 1 ms to minimize.
[2023-03-15 21:26:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1484 ms
[2023-03-15 21:26:34] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 1 ms to minimize.
[2023-03-15 21:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2023-03-15 21:26:35] [INFO ] Deduced a trap composed of 54 places in 471 ms of which 1 ms to minimize.
[2023-03-15 21:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 610 ms
[2023-03-15 21:26:37] [INFO ] Deduced a trap composed of 18 places in 503 ms of which 1 ms to minimize.
[2023-03-15 21:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 634 ms
[2023-03-15 21:26:38] [INFO ] Deduced a trap composed of 82 places in 414 ms of which 1 ms to minimize.
[2023-03-15 21:26:39] [INFO ] Deduced a trap composed of 94 places in 443 ms of which 1 ms to minimize.
[2023-03-15 21:26:39] [INFO ] Deduced a trap composed of 82 places in 421 ms of which 1 ms to minimize.
[2023-03-15 21:26:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1554 ms
[2023-03-15 21:26:40] [INFO ] Deduced a trap composed of 131 places in 289 ms of which 1 ms to minimize.
[2023-03-15 21:26:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2023-03-15 21:26:42] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 1 ms to minimize.
[2023-03-15 21:26:43] [INFO ] Deduced a trap composed of 45 places in 407 ms of which 1 ms to minimize.
[2023-03-15 21:26:43] [INFO ] Deduced a trap composed of 34 places in 423 ms of which 1 ms to minimize.
[2023-03-15 21:26:44] [INFO ] Deduced a trap composed of 24 places in 501 ms of which 1 ms to minimize.
[2023-03-15 21:26:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1894 ms
[2023-03-15 21:26:46] [INFO ] Deduced a trap composed of 75 places in 502 ms of which 1 ms to minimize.
[2023-03-15 21:26:46] [INFO ] Deduced a trap composed of 48 places in 495 ms of which 1 ms to minimize.
[2023-03-15 21:26:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1209 ms
[2023-03-15 21:26:48] [INFO ] Deduced a trap composed of 89 places in 230 ms of which 1 ms to minimize.
[2023-03-15 21:26:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-15 21:26:51] [INFO ] Deduced a trap composed of 20 places in 482 ms of which 1 ms to minimize.
[2023-03-15 21:26:51] [INFO ] Deduced a trap composed of 100 places in 502 ms of which 1 ms to minimize.
[2023-03-15 21:26:52] [INFO ] Deduced a trap composed of 31 places in 446 ms of which 1 ms to minimize.
[2023-03-15 21:26:52] [INFO ] Deduced a trap composed of 37 places in 457 ms of which 1 ms to minimize.
[2023-03-15 21:26:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2236 ms
[2023-03-15 21:26:55] [INFO ] Deduced a trap composed of 11 places in 490 ms of which 1 ms to minimize.
[2023-03-15 21:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 624 ms
[2023-03-15 21:26:58] [INFO ] Deduced a trap composed of 91 places in 469 ms of which 1 ms to minimize.
[2023-03-15 21:26:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 608 ms
[2023-03-15 21:26:58] [INFO ] Deduced a trap composed of 60 places in 360 ms of which 1 ms to minimize.
[2023-03-15 21:26:59] [INFO ] Deduced a trap composed of 93 places in 262 ms of which 0 ms to minimize.
[2023-03-15 21:26:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 833 ms
[2023-03-15 21:26:59] [INFO ] Deduced a trap composed of 44 places in 443 ms of which 1 ms to minimize.
[2023-03-15 21:27:00] [INFO ] Deduced a trap composed of 62 places in 318 ms of which 1 ms to minimize.
[2023-03-15 21:27:00] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 1 ms to minimize.
[2023-03-15 21:27:01] [INFO ] Deduced a trap composed of 77 places in 409 ms of which 1 ms to minimize.
[2023-03-15 21:27:01] [INFO ] Deduced a trap composed of 76 places in 418 ms of which 0 ms to minimize.
[2023-03-15 21:27:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2333 ms
[2023-03-15 21:27:02] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:27:02] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 1 ms to minimize.
[2023-03-15 21:27:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2023-03-15 21:27:04] [INFO ] Deduced a trap composed of 65 places in 339 ms of which 1 ms to minimize.
[2023-03-15 21:27:05] [INFO ] Deduced a trap composed of 62 places in 380 ms of which 1 ms to minimize.
[2023-03-15 21:27:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 899 ms
[2023-03-15 21:27:06] [INFO ] Deduced a trap composed of 19 places in 458 ms of which 2 ms to minimize.
[2023-03-15 21:27:07] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 1 ms to minimize.
[2023-03-15 21:27:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1151 ms
[2023-03-15 21:27:09] [INFO ] Deduced a trap composed of 36 places in 515 ms of which 1 ms to minimize.
[2023-03-15 21:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 654 ms
[2023-03-15 21:27:10] [INFO ] Deduced a trap composed of 89 places in 396 ms of which 1 ms to minimize.
[2023-03-15 21:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 530 ms
[2023-03-15 21:27:16] [INFO ] Deduced a trap composed of 22 places in 528 ms of which 1 ms to minimize.
[2023-03-15 21:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 664 ms
[2023-03-15 21:27:21] [INFO ] Deduced a trap composed of 27 places in 456 ms of which 1 ms to minimize.
[2023-03-15 21:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 601 ms
[2023-03-15 21:27:24] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2023-03-15 21:27:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-15 21:27:25] [INFO ] Deduced a trap composed of 26 places in 460 ms of which 1 ms to minimize.
[2023-03-15 21:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 603 ms
[2023-03-15 21:27:29] [INFO ] Deduced a trap composed of 48 places in 416 ms of which 1 ms to minimize.
[2023-03-15 21:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 993 ms
[2023-03-15 21:27:30] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 2 ms to minimize.
[2023-03-15 21:27:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2023-03-15 21:27:31] [INFO ] Deduced a trap composed of 68 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-15 21:27:41] [INFO ] Deduced a trap composed of 95 places in 432 ms of which 1 ms to minimize.
[2023-03-15 21:27:42] [INFO ] Deduced a trap composed of 81 places in 451 ms of which 1 ms to minimize.
[2023-03-15 21:27:42] [INFO ] Deduced a trap composed of 66 places in 377 ms of which 1 ms to minimize.
[2023-03-15 21:27:43] [INFO ] Deduced a trap composed of 51 places in 422 ms of which 1 ms to minimize.
[2023-03-15 21:27:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2034 ms
[2023-03-15 21:27:46] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 1 ms to minimize.
[2023-03-15 21:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-15 21:27:48] [INFO ] Deduced a trap composed of 53 places in 317 ms of which 1 ms to minimize.
[2023-03-15 21:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 445 ms
[2023-03-15 21:27:54] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 0 ms to minimize.
[2023-03-15 21:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-15 21:27:55] [INFO ] After 189495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :383
Attempting to minimize the solution found.
Minimization took 13532 ms.
[2023-03-15 21:28:08] [INFO ] After 225010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :382
Parikh walk visited 11 properties in 9944 ms.
Support contains 372 out of 604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 604/604 places, 1012/1012 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 604 transition count 987
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 579 transition count 987
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 50 place count 579 transition count 973
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 565 transition count 973
Applied a total of 78 rules in 44 ms. Remains 565 /604 variables (removed 39) and now considering 973/1012 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 565/604 places, 973/1012 transitions.
Interrupted random walk after 428832 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 372) 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 372) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 372) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) 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 368) 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 368) 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 368) 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 368) seen :0
Interrupted probabilistic random walk after 6715471 steps, run timeout after 105001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 6715471 steps, saw 960347 distinct states, run finished after 105010 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 368 properties.
[2023-03-15 21:30:39] [INFO ] Flow matrix only has 853 transitions (discarded 120 similar events)
// Phase 1: matrix 853 rows 565 cols
[2023-03-15 21:30:39] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-15 21:30:48] [INFO ] After 9374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:368
[2023-03-15 21:30:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2023-03-15 21:30:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 21:31:20] [INFO ] After 18377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :368
[2023-03-15 21:31:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 21:31:42] [INFO ] After 22560ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :368
[2023-03-15 21:31:43] [INFO ] Deduced a trap composed of 21 places in 542 ms of which 1 ms to minimize.
[2023-03-15 21:31:43] [INFO ] Deduced a trap composed of 18 places in 551 ms of which 2 ms to minimize.
[2023-03-15 21:31:44] [INFO ] Deduced a trap composed of 9 places in 559 ms of which 1 ms to minimize.
[2023-03-15 21:31:44] [INFO ] Deduced a trap composed of 14 places in 492 ms of which 1 ms to minimize.
[2023-03-15 21:31:45] [INFO ] Deduced a trap composed of 14 places in 569 ms of which 1 ms to minimize.
[2023-03-15 21:31:46] [INFO ] Deduced a trap composed of 14 places in 546 ms of which 1 ms to minimize.
[2023-03-15 21:31:46] [INFO ] Deduced a trap composed of 13 places in 500 ms of which 1 ms to minimize.
[2023-03-15 21:31:47] [INFO ] Deduced a trap composed of 16 places in 548 ms of which 1 ms to minimize.
[2023-03-15 21:31:47] [INFO ] Deduced a trap composed of 75 places in 531 ms of which 1 ms to minimize.
[2023-03-15 21:31:48] [INFO ] Deduced a trap composed of 9 places in 559 ms of which 1 ms to minimize.
[2023-03-15 21:31:49] [INFO ] Deduced a trap composed of 50 places in 408 ms of which 2 ms to minimize.
[2023-03-15 21:31:49] [INFO ] Deduced a trap composed of 22 places in 500 ms of which 1 ms to minimize.
[2023-03-15 21:31:50] [INFO ] Deduced a trap composed of 26 places in 504 ms of which 1 ms to minimize.
[2023-03-15 21:31:50] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 1 ms to minimize.
[2023-03-15 21:31:51] [INFO ] Deduced a trap composed of 32 places in 481 ms of which 1 ms to minimize.
[2023-03-15 21:31:51] [INFO ] Deduced a trap composed of 46 places in 454 ms of which 1 ms to minimize.
[2023-03-15 21:31:52] [INFO ] Deduced a trap composed of 37 places in 451 ms of which 1 ms to minimize.
[2023-03-15 21:31:52] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 1 ms to minimize.
[2023-03-15 21:31:53] [INFO ] Deduced a trap composed of 40 places in 421 ms of which 1 ms to minimize.
[2023-03-15 21:31:53] [INFO ] Deduced a trap composed of 49 places in 431 ms of which 1 ms to minimize.
[2023-03-15 21:31:54] [INFO ] Deduced a trap composed of 42 places in 438 ms of which 1 ms to minimize.
[2023-03-15 21:31:54] [INFO ] Deduced a trap composed of 39 places in 435 ms of which 1 ms to minimize.
[2023-03-15 21:31:55] [INFO ] Deduced a trap composed of 33 places in 460 ms of which 1 ms to minimize.
[2023-03-15 21:31:55] [INFO ] Deduced a trap composed of 31 places in 476 ms of which 1 ms to minimize.
[2023-03-15 21:31:56] [INFO ] Deduced a trap composed of 9 places in 490 ms of which 1 ms to minimize.
[2023-03-15 21:31:56] [INFO ] Deduced a trap composed of 16 places in 446 ms of which 1 ms to minimize.
[2023-03-15 21:31:57] [INFO ] Deduced a trap composed of 18 places in 416 ms of which 1 ms to minimize.
[2023-03-15 21:31:57] [INFO ] Deduced a trap composed of 16 places in 472 ms of which 1 ms to minimize.
[2023-03-15 21:31:58] [INFO ] Deduced a trap composed of 50 places in 436 ms of which 2 ms to minimize.
[2023-03-15 21:31:58] [INFO ] Deduced a trap composed of 62 places in 437 ms of which 1 ms to minimize.
[2023-03-15 21:31:59] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 1 ms to minimize.
[2023-03-15 21:31:59] [INFO ] Deduced a trap composed of 48 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:32:00] [INFO ] Deduced a trap composed of 48 places in 389 ms of which 1 ms to minimize.
[2023-03-15 21:32:00] [INFO ] Deduced a trap composed of 51 places in 386 ms of which 1 ms to minimize.
[2023-03-15 21:32:01] [INFO ] Deduced a trap composed of 51 places in 414 ms of which 1 ms to minimize.
[2023-03-15 21:32:01] [INFO ] Deduced a trap composed of 73 places in 461 ms of which 2 ms to minimize.
[2023-03-15 21:32:01] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 19123 ms
[2023-03-15 21:32:02] [INFO ] Deduced a trap composed of 33 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2023-03-15 21:32:03] [INFO ] Deduced a trap composed of 54 places in 470 ms of which 1 ms to minimize.
[2023-03-15 21:32:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2023-03-15 21:32:03] [INFO ] Deduced a trap composed of 37 places in 431 ms of which 2 ms to minimize.
[2023-03-15 21:32:04] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 1 ms to minimize.
[2023-03-15 21:32:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1043 ms
[2023-03-15 21:32:04] [INFO ] Deduced a trap composed of 77 places in 309 ms of which 1 ms to minimize.
[2023-03-15 21:32:05] [INFO ] Deduced a trap composed of 76 places in 304 ms of which 1 ms to minimize.
[2023-03-15 21:32:05] [INFO ] Deduced a trap composed of 76 places in 317 ms of which 1 ms to minimize.
[2023-03-15 21:32:05] [INFO ] Deduced a trap composed of 73 places in 266 ms of which 1 ms to minimize.
[2023-03-15 21:32:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1497 ms
[2023-03-15 21:32:06] [INFO ] Deduced a trap composed of 91 places in 332 ms of which 1 ms to minimize.
[2023-03-15 21:32:06] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 0 ms to minimize.
[2023-03-15 21:32:06] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 0 ms to minimize.
[2023-03-15 21:32:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 983 ms
[2023-03-15 21:32:07] [INFO ] Deduced a trap composed of 87 places in 227 ms of which 1 ms to minimize.
[2023-03-15 21:32:07] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 1 ms to minimize.
[2023-03-15 21:32:07] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 1 ms to minimize.
[2023-03-15 21:32:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1006 ms
[2023-03-15 21:32:08] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 1 ms to minimize.
[2023-03-15 21:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-15 21:32:08] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 0 ms to minimize.
[2023-03-15 21:32:08] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 1 ms to minimize.
[2023-03-15 21:32:09] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 1 ms to minimize.
[2023-03-15 21:32:09] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 1 ms to minimize.
[2023-03-15 21:32:09] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 0 ms to minimize.
[2023-03-15 21:32:09] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 0 ms to minimize.
[2023-03-15 21:32:09] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 0 ms to minimize.
[2023-03-15 21:32:10] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 0 ms to minimize.
[2023-03-15 21:32:10] [INFO ] Deduced a trap composed of 34 places in 394 ms of which 1 ms to minimize.
[2023-03-15 21:32:11] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 1 ms to minimize.
[2023-03-15 21:32:11] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 0 ms to minimize.
[2023-03-15 21:32:11] [INFO ] Deduced a trap composed of 91 places in 292 ms of which 1 ms to minimize.
[2023-03-15 21:32:12] [INFO ] Deduced a trap composed of 88 places in 374 ms of which 1 ms to minimize.
[2023-03-15 21:32:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3804 ms
[2023-03-15 21:32:12] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 1 ms to minimize.
[2023-03-15 21:32:12] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 0 ms to minimize.
[2023-03-15 21:32:13] [INFO ] Deduced a trap composed of 71 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:32:13] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 0 ms to minimize.
[2023-03-15 21:32:13] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 1 ms to minimize.
[2023-03-15 21:32:14] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 2 ms to minimize.
[2023-03-15 21:32:14] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 1 ms to minimize.
[2023-03-15 21:32:14] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 0 ms to minimize.
[2023-03-15 21:32:15] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 1 ms to minimize.
[2023-03-15 21:32:15] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2023-03-15 21:32:16] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 0 ms to minimize.
[2023-03-15 21:32:16] [INFO ] Deduced a trap composed of 73 places in 236 ms of which 1 ms to minimize.
[2023-03-15 21:32:16] [INFO ] Deduced a trap composed of 96 places in 231 ms of which 1 ms to minimize.
[2023-03-15 21:32:16] [INFO ] Deduced a trap composed of 93 places in 239 ms of which 1 ms to minimize.
[2023-03-15 21:32:17] [INFO ] Deduced a trap composed of 97 places in 227 ms of which 1 ms to minimize.
[2023-03-15 21:32:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4930 ms
[2023-03-15 21:32:17] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 0 ms to minimize.
[2023-03-15 21:32:17] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 1 ms to minimize.
[2023-03-15 21:32:18] [INFO ] Deduced a trap composed of 28 places in 325 ms of which 1 ms to minimize.
[2023-03-15 21:32:18] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-15 21:32:18] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2023-03-15 21:32:19] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 0 ms to minimize.
[2023-03-15 21:32:19] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 1 ms to minimize.
[2023-03-15 21:32:19] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 0 ms to minimize.
[2023-03-15 21:32:19] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 0 ms to minimize.
[2023-03-15 21:32:20] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 1 ms to minimize.
[2023-03-15 21:32:20] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 1 ms to minimize.
[2023-03-15 21:32:21] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 1 ms to minimize.
[2023-03-15 21:32:21] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 0 ms to minimize.
[2023-03-15 21:32:21] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 1 ms to minimize.
[2023-03-15 21:32:21] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 0 ms to minimize.
[2023-03-15 21:32:22] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 1 ms to minimize.
[2023-03-15 21:32:22] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:32:22] [INFO ] Deduced a trap composed of 86 places in 262 ms of which 1 ms to minimize.
[2023-03-15 21:32:22] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 0 ms to minimize.
[2023-03-15 21:32:23] [INFO ] Deduced a trap composed of 87 places in 185 ms of which 0 ms to minimize.
[2023-03-15 21:32:23] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 1 ms to minimize.
[2023-03-15 21:32:23] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 1 ms to minimize.
[2023-03-15 21:32:23] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6394 ms
[2023-03-15 21:32:23] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 0 ms to minimize.
[2023-03-15 21:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-15 21:32:24] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:32:24] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 1 ms to minimize.
[2023-03-15 21:32:25] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:32:25] [INFO ] Deduced a trap composed of 51 places in 344 ms of which 0 ms to minimize.
[2023-03-15 21:32:25] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 1 ms to minimize.
[2023-03-15 21:32:26] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 0 ms to minimize.
[2023-03-15 21:32:26] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 1 ms to minimize.
[2023-03-15 21:32:26] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2023-03-15 21:32:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2960 ms
[2023-03-15 21:32:27] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 0 ms to minimize.
[2023-03-15 21:32:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-15 21:32:27] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:32:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-15 21:32:28] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 0 ms to minimize.
[2023-03-15 21:32:28] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 1 ms to minimize.
[2023-03-15 21:32:28] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2023-03-15 21:32:29] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 1 ms to minimize.
[2023-03-15 21:32:29] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 1 ms to minimize.
[2023-03-15 21:32:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1619 ms
[2023-03-15 21:32:30] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 0 ms to minimize.
[2023-03-15 21:32:30] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 1 ms to minimize.
[2023-03-15 21:32:30] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 1 ms to minimize.
[2023-03-15 21:32:31] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 1 ms to minimize.
[2023-03-15 21:32:31] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 1 ms to minimize.
[2023-03-15 21:32:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1522 ms
[2023-03-15 21:32:32] [INFO ] Deduced a trap composed of 60 places in 332 ms of which 1 ms to minimize.
[2023-03-15 21:32:32] [INFO ] Deduced a trap composed of 50 places in 263 ms of which 0 ms to minimize.
[2023-03-15 21:32:32] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 1 ms to minimize.
[2023-03-15 21:32:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1002 ms
[2023-03-15 21:32:33] [INFO ] Deduced a trap composed of 88 places in 259 ms of which 0 ms to minimize.
[2023-03-15 21:32:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-15 21:32:33] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 0 ms to minimize.
[2023-03-15 21:32:33] [INFO ] Deduced a trap composed of 91 places in 178 ms of which 1 ms to minimize.
[2023-03-15 21:32:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2023-03-15 21:32:34] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 0 ms to minimize.
[2023-03-15 21:32:34] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 0 ms to minimize.
[2023-03-15 21:32:34] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 1 ms to minimize.
[2023-03-15 21:32:35] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 0 ms to minimize.
[2023-03-15 21:32:35] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 1 ms to minimize.
[2023-03-15 21:32:35] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 1 ms to minimize.
[2023-03-15 21:32:35] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 0 ms to minimize.
[2023-03-15 21:32:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1851 ms
[2023-03-15 21:32:36] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2023-03-15 21:32:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-15 21:32:37] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 0 ms to minimize.
[2023-03-15 21:32:38] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 1 ms to minimize.
[2023-03-15 21:32:38] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 0 ms to minimize.
[2023-03-15 21:32:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 711 ms
[2023-03-15 21:32:38] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2023-03-15 21:32:39] [INFO ] Deduced a trap composed of 67 places in 401 ms of which 0 ms to minimize.
[2023-03-15 21:32:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 887 ms
[2023-03-15 21:32:40] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2023-03-15 21:32:40] [INFO ] Deduced a trap composed of 91 places in 315 ms of which 1 ms to minimize.
[2023-03-15 21:32:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 724 ms
[2023-03-15 21:32:41] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 1 ms to minimize.
[2023-03-15 21:32:42] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:32:42] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 1 ms to minimize.
[2023-03-15 21:32:42] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 0 ms to minimize.
[2023-03-15 21:32:43] [INFO ] Deduced a trap composed of 137 places in 295 ms of which 0 ms to minimize.
[2023-03-15 21:32:43] [INFO ] Deduced a trap composed of 170 places in 293 ms of which 1 ms to minimize.
[2023-03-15 21:32:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2032 ms
[2023-03-15 21:32:43] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 1 ms to minimize.
[2023-03-15 21:32:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-15 21:32:44] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 1 ms to minimize.
[2023-03-15 21:32:44] [INFO ] Deduced a trap composed of 50 places in 282 ms of which 0 ms to minimize.
[2023-03-15 21:32:44] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 0 ms to minimize.
[2023-03-15 21:32:45] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 1 ms to minimize.
[2023-03-15 21:32:45] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 1 ms to minimize.
[2023-03-15 21:32:45] [INFO ] Deduced a trap composed of 51 places in 246 ms of which 1 ms to minimize.
[2023-03-15 21:32:46] [INFO ] Deduced a trap composed of 75 places in 317 ms of which 1 ms to minimize.
[2023-03-15 21:32:46] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:32:46] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 1 ms to minimize.
[2023-03-15 21:32:47] [INFO ] Deduced a trap composed of 75 places in 440 ms of which 1 ms to minimize.
[2023-03-15 21:32:47] [INFO ] Deduced a trap composed of 22 places in 299 ms of which 1 ms to minimize.
[2023-03-15 21:32:48] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 1 ms to minimize.
[2023-03-15 21:32:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4301 ms
[2023-03-15 21:32:48] [INFO ] Deduced a trap composed of 83 places in 348 ms of which 1 ms to minimize.
[2023-03-15 21:32:48] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 1 ms to minimize.
[2023-03-15 21:32:49] [INFO ] Deduced a trap composed of 63 places in 384 ms of which 1 ms to minimize.
[2023-03-15 21:32:49] [INFO ] Deduced a trap composed of 72 places in 275 ms of which 0 ms to minimize.
[2023-03-15 21:32:50] [INFO ] Deduced a trap composed of 43 places in 400 ms of which 1 ms to minimize.
[2023-03-15 21:32:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2015 ms
[2023-03-15 21:32:51] [INFO ] Deduced a trap composed of 24 places in 471 ms of which 2 ms to minimize.
[2023-03-15 21:32:51] [INFO ] Deduced a trap composed of 50 places in 372 ms of which 1 ms to minimize.
[2023-03-15 21:32:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1071 ms
[2023-03-15 21:32:52] [INFO ] Deduced a trap composed of 20 places in 387 ms of which 1 ms to minimize.
[2023-03-15 21:32:53] [INFO ] Deduced a trap composed of 10 places in 419 ms of which 0 ms to minimize.
[2023-03-15 21:32:53] [INFO ] Deduced a trap composed of 10 places in 389 ms of which 1 ms to minimize.
[2023-03-15 21:32:54] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:32:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2221 ms
[2023-03-15 21:32:54] [INFO ] Deduced a trap composed of 12 places in 420 ms of which 1 ms to minimize.
[2023-03-15 21:32:55] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 1 ms to minimize.
[2023-03-15 21:32:55] [INFO ] Deduced a trap composed of 28 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:32:55] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 1 ms to minimize.
[2023-03-15 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1692 ms
[2023-03-15 21:32:56] [INFO ] Deduced a trap composed of 71 places in 346 ms of which 1 ms to minimize.
[2023-03-15 21:32:56] [INFO ] Deduced a trap composed of 56 places in 359 ms of which 1 ms to minimize.
[2023-03-15 21:32:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 853 ms
[2023-03-15 21:32:57] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 0 ms to minimize.
[2023-03-15 21:32:57] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 1 ms to minimize.
[2023-03-15 21:32:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 782 ms
[2023-03-15 21:32:58] [INFO ] Deduced a trap composed of 87 places in 325 ms of which 1 ms to minimize.
[2023-03-15 21:32:58] [INFO ] Deduced a trap composed of 90 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:32:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 845 ms
[2023-03-15 21:32:59] [INFO ] Deduced a trap composed of 112 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2023-03-15 21:33:00] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:33:00] [INFO ] Deduced a trap composed of 48 places in 365 ms of which 1 ms to minimize.
[2023-03-15 21:33:01] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 1 ms to minimize.
[2023-03-15 21:33:01] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 1 ms to minimize.
[2023-03-15 21:33:02] [INFO ] Deduced a trap composed of 47 places in 378 ms of which 1 ms to minimize.
[2023-03-15 21:33:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2214 ms
[2023-03-15 21:33:02] [INFO ] Deduced a trap composed of 110 places in 315 ms of which 1 ms to minimize.
[2023-03-15 21:33:02] [INFO ] Deduced a trap composed of 125 places in 244 ms of which 0 ms to minimize.
[2023-03-15 21:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 754 ms
[2023-03-15 21:33:03] [INFO ] Deduced a trap composed of 90 places in 252 ms of which 1 ms to minimize.
[2023-03-15 21:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2023-03-15 21:33:03] [INFO ] Deduced a trap composed of 53 places in 273 ms of which 1 ms to minimize.
[2023-03-15 21:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-15 21:33:04] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 0 ms to minimize.
[2023-03-15 21:33:04] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 1 ms to minimize.
[2023-03-15 21:33:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2023-03-15 21:33:07] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2023-03-15 21:33:07] [INFO ] Deduced a trap composed of 85 places in 292 ms of which 1 ms to minimize.
[2023-03-15 21:33:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 881 ms
[2023-03-15 21:33:08] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 0 ms to minimize.
[2023-03-15 21:33:08] [INFO ] Deduced a trap composed of 36 places in 325 ms of which 1 ms to minimize.
[2023-03-15 21:33:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 763 ms
[2023-03-15 21:33:09] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 1 ms to minimize.
[2023-03-15 21:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 529 ms
[2023-03-15 21:33:10] [INFO ] Deduced a trap composed of 48 places in 355 ms of which 1 ms to minimize.
[2023-03-15 21:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-15 21:33:10] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 0 ms to minimize.
[2023-03-15 21:33:10] [INFO ] Deduced a trap composed of 86 places in 247 ms of which 0 ms to minimize.
[2023-03-15 21:33:11] [INFO ] Deduced a trap composed of 108 places in 348 ms of which 1 ms to minimize.
[2023-03-15 21:33:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 979 ms
[2023-03-15 21:33:11] [INFO ] Deduced a trap composed of 120 places in 222 ms of which 0 ms to minimize.
[2023-03-15 21:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-15 21:33:12] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 0 ms to minimize.
[2023-03-15 21:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 21:33:12] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 0 ms to minimize.
[2023-03-15 21:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 21:33:12] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 0 ms to minimize.
[2023-03-15 21:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-15 21:33:14] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 1 ms to minimize.
[2023-03-15 21:33:14] [INFO ] Deduced a trap composed of 96 places in 226 ms of which 1 ms to minimize.
[2023-03-15 21:33:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2023-03-15 21:33:15] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2023-03-15 21:33:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2023-03-15 21:33:17] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2023-03-15 21:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-15 21:33:21] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 1 ms to minimize.
[2023-03-15 21:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2023-03-15 21:33:22] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2023-03-15 21:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2023-03-15 21:33:25] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 1 ms to minimize.
[2023-03-15 21:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-15 21:33:25] [INFO ] Deduced a trap composed of 63 places in 287 ms of which 1 ms to minimize.
[2023-03-15 21:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2023-03-15 21:33:28] [INFO ] Deduced a trap composed of 19 places in 496 ms of which 1 ms to minimize.
[2023-03-15 21:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2023-03-15 21:33:29] [INFO ] Deduced a trap composed of 20 places in 457 ms of which 1 ms to minimize.
[2023-03-15 21:33:30] [INFO ] Deduced a trap composed of 19 places in 407 ms of which 1 ms to minimize.
[2023-03-15 21:33:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1007 ms
[2023-03-15 21:33:31] [INFO ] Deduced a trap composed of 53 places in 453 ms of which 1 ms to minimize.
[2023-03-15 21:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 557 ms
[2023-03-15 21:33:31] [INFO ] Deduced a trap composed of 51 places in 441 ms of which 1 ms to minimize.
[2023-03-15 21:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2023-03-15 21:33:34] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2023-03-15 21:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-15 21:33:38] [INFO ] Deduced a trap composed of 62 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2023-03-15 21:33:46] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 0 ms to minimize.
[2023-03-15 21:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 21:33:51] [INFO ] Deduced a trap composed of 47 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-15 21:33:52] [INFO ] Deduced a trap composed of 10 places in 438 ms of which 1 ms to minimize.
[2023-03-15 21:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 542 ms
[2023-03-15 21:33:55] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 0 ms to minimize.
[2023-03-15 21:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2023-03-15 21:33:56] [INFO ] After 156238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :368
Attempting to minimize the solution found.
Minimization took 37407 ms.
[2023-03-15 21:34:33] [INFO ] After 225014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :367
Parikh walk visited 0 properties in 1313 ms.
Support contains 368 out of 565 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 565/565 places, 973/973 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 565 transition count 971
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 563 transition count 971
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 563 transition count 970
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 562 transition count 970
Applied a total of 6 rules in 35 ms. Remains 562 /565 variables (removed 3) and now considering 970/973 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/565 places, 970/973 transitions.
Interrupted random walk after 421882 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties 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 368) 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 368) 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 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) 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 368) 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 368) 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 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 368) 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 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 368) 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 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 368) 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 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) 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 368) 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 368) seen :0
Interrupted probabilistic random walk after 6526058 steps, run timeout after 105001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 6526058 steps, saw 933273 distinct states, run finished after 105002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 368 properties.
[2023-03-15 21:36:55] [INFO ] Flow matrix only has 850 transitions (discarded 120 similar events)
// Phase 1: matrix 850 rows 562 cols
[2023-03-15 21:36:55] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 21:37:04] [INFO ] After 8967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:368
[2023-03-15 21:37:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 21:37:10] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 21:37:25] [INFO ] After 11282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :368
[2023-03-15 21:37:25] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 21:37:39] [INFO ] After 13716ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :368
[2023-03-15 21:37:39] [INFO ] Deduced a trap composed of 10 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:37:40] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 0 ms to minimize.
[2023-03-15 21:37:40] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 1 ms to minimize.
[2023-03-15 21:37:41] [INFO ] Deduced a trap composed of 9 places in 437 ms of which 1 ms to minimize.
[2023-03-15 21:37:41] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2023-03-15 21:37:41] [INFO ] Deduced a trap composed of 9 places in 453 ms of which 1 ms to minimize.
[2023-03-15 21:37:42] [INFO ] Deduced a trap composed of 24 places in 334 ms of which 1 ms to minimize.
[2023-03-15 21:37:42] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 1 ms to minimize.
[2023-03-15 21:37:43] [INFO ] Deduced a trap composed of 163 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:37:43] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 1 ms to minimize.
[2023-03-15 21:37:43] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 0 ms to minimize.
[2023-03-15 21:37:44] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 1 ms to minimize.
[2023-03-15 21:37:44] [INFO ] Deduced a trap composed of 42 places in 468 ms of which 1 ms to minimize.
[2023-03-15 21:37:45] [INFO ] Deduced a trap composed of 18 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:37:45] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 0 ms to minimize.
[2023-03-15 21:37:45] [INFO ] Deduced a trap composed of 32 places in 310 ms of which 1 ms to minimize.
[2023-03-15 21:37:46] [INFO ] Deduced a trap composed of 25 places in 474 ms of which 1 ms to minimize.
[2023-03-15 21:37:46] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 1 ms to minimize.
[2023-03-15 21:37:47] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:37:47] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 1 ms to minimize.
[2023-03-15 21:37:48] [INFO ] Deduced a trap composed of 49 places in 357 ms of which 1 ms to minimize.
[2023-03-15 21:37:48] [INFO ] Deduced a trap composed of 39 places in 297 ms of which 1 ms to minimize.
[2023-03-15 21:37:48] [INFO ] Deduced a trap composed of 33 places in 317 ms of which 0 ms to minimize.
[2023-03-15 21:37:49] [INFO ] Deduced a trap composed of 54 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:37:49] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 0 ms to minimize.
[2023-03-15 21:37:49] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 1 ms to minimize.
[2023-03-15 21:37:50] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:37:50] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 0 ms to minimize.
[2023-03-15 21:37:50] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 0 ms to minimize.
[2023-03-15 21:37:50] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11216 ms
[2023-03-15 21:37:51] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:37:51] [INFO ] Deduced a trap composed of 9 places in 439 ms of which 1 ms to minimize.
[2023-03-15 21:37:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 796 ms
[2023-03-15 21:37:51] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 0 ms to minimize.
[2023-03-15 21:37:52] [INFO ] Deduced a trap composed of 26 places in 359 ms of which 1 ms to minimize.
[2023-03-15 21:37:52] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 1 ms to minimize.
[2023-03-15 21:37:53] [INFO ] Deduced a trap composed of 48 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:37:53] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 1 ms to minimize.
[2023-03-15 21:37:54] [INFO ] Deduced a trap composed of 37 places in 383 ms of which 1 ms to minimize.
[2023-03-15 21:37:54] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 0 ms to minimize.
[2023-03-15 21:37:54] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 1 ms to minimize.
[2023-03-15 21:37:55] [INFO ] Deduced a trap composed of 83 places in 309 ms of which 1 ms to minimize.
[2023-03-15 21:37:55] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 0 ms to minimize.
[2023-03-15 21:37:55] [INFO ] Deduced a trap composed of 87 places in 199 ms of which 0 ms to minimize.
[2023-03-15 21:37:55] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 0 ms to minimize.
[2023-03-15 21:37:56] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 0 ms to minimize.
[2023-03-15 21:37:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4572 ms
[2023-03-15 21:37:56] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 0 ms to minimize.
[2023-03-15 21:37:56] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 1 ms to minimize.
[2023-03-15 21:37:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 557 ms
[2023-03-15 21:37:57] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 1 ms to minimize.
[2023-03-15 21:37:57] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 0 ms to minimize.
[2023-03-15 21:37:57] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 1 ms to minimize.
[2023-03-15 21:37:58] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 1 ms to minimize.
[2023-03-15 21:37:58] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 1 ms to minimize.
[2023-03-15 21:37:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1293 ms
[2023-03-15 21:37:58] [INFO ] Deduced a trap composed of 122 places in 205 ms of which 1 ms to minimize.
[2023-03-15 21:37:59] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 1 ms to minimize.
[2023-03-15 21:37:59] [INFO ] Deduced a trap composed of 51 places in 338 ms of which 1 ms to minimize.
[2023-03-15 21:37:59] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 1 ms to minimize.
[2023-03-15 21:38:00] [INFO ] Deduced a trap composed of 81 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:38:00] [INFO ] Deduced a trap composed of 75 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:38:01] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 1 ms to minimize.
[2023-03-15 21:38:01] [INFO ] Deduced a trap composed of 28 places in 370 ms of which 1 ms to minimize.
[2023-03-15 21:38:02] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2023-03-15 21:38:02] [INFO ] Deduced a trap composed of 24 places in 342 ms of which 1 ms to minimize.
[2023-03-15 21:38:02] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 1 ms to minimize.
[2023-03-15 21:38:03] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:38:03] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 1 ms to minimize.
[2023-03-15 21:38:03] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:38:04] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:38:04] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 1 ms to minimize.
[2023-03-15 21:38:04] [INFO ] Deduced a trap composed of 73 places in 241 ms of which 0 ms to minimize.
[2023-03-15 21:38:05] [INFO ] Deduced a trap composed of 20 places in 326 ms of which 1 ms to minimize.
[2023-03-15 21:38:05] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 0 ms to minimize.
[2023-03-15 21:38:06] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2023-03-15 21:38:06] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2023-03-15 21:38:06] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 0 ms to minimize.
[2023-03-15 21:38:07] [INFO ] Deduced a trap composed of 71 places in 272 ms of which 1 ms to minimize.
[2023-03-15 21:38:07] [INFO ] Deduced a trap composed of 57 places in 199 ms of which 0 ms to minimize.
[2023-03-15 21:38:07] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 0 ms to minimize.
[2023-03-15 21:38:08] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 1 ms to minimize.
[2023-03-15 21:38:08] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 1 ms to minimize.
[2023-03-15 21:38:08] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9768 ms
[2023-03-15 21:38:09] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 1 ms to minimize.
[2023-03-15 21:38:09] [INFO ] Deduced a trap composed of 93 places in 270 ms of which 0 ms to minimize.
[2023-03-15 21:38:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2023-03-15 21:38:09] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:38:10] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 1 ms to minimize.
[2023-03-15 21:38:10] [INFO ] Deduced a trap composed of 53 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:38:11] [INFO ] Deduced a trap composed of 40 places in 417 ms of which 1 ms to minimize.
[2023-03-15 21:38:11] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 0 ms to minimize.
[2023-03-15 21:38:11] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 1 ms to minimize.
[2023-03-15 21:38:11] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 0 ms to minimize.
[2023-03-15 21:38:12] [INFO ] Deduced a trap composed of 84 places in 247 ms of which 0 ms to minimize.
[2023-03-15 21:38:12] [INFO ] Deduced a trap composed of 80 places in 237 ms of which 1 ms to minimize.
[2023-03-15 21:38:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3103 ms
[2023-03-15 21:38:13] [INFO ] Deduced a trap composed of 16 places in 404 ms of which 1 ms to minimize.
[2023-03-15 21:38:13] [INFO ] Deduced a trap composed of 18 places in 444 ms of which 1 ms to minimize.
[2023-03-15 21:38:14] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 1 ms to minimize.
[2023-03-15 21:38:14] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 1 ms to minimize.
[2023-03-15 21:38:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1792 ms
[2023-03-15 21:38:14] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 3 ms to minimize.
[2023-03-15 21:38:15] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 1 ms to minimize.
[2023-03-15 21:38:15] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 1 ms to minimize.
[2023-03-15 21:38:16] [INFO ] Deduced a trap composed of 36 places in 273 ms of which 1 ms to minimize.
[2023-03-15 21:38:16] [INFO ] Deduced a trap composed of 60 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:38:17] [INFO ] Deduced a trap composed of 83 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:38:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2559 ms
[2023-03-15 21:38:17] [INFO ] Deduced a trap composed of 45 places in 366 ms of which 1 ms to minimize.
[2023-03-15 21:38:18] [INFO ] Deduced a trap composed of 131 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:38:18] [INFO ] Deduced a trap composed of 43 places in 365 ms of which 1 ms to minimize.
[2023-03-15 21:38:18] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 1 ms to minimize.
[2023-03-15 21:38:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1719 ms
[2023-03-15 21:38:19] [INFO ] Deduced a trap composed of 76 places in 300 ms of which 0 ms to minimize.
[2023-03-15 21:38:19] [INFO ] Deduced a trap composed of 56 places in 286 ms of which 1 ms to minimize.
[2023-03-15 21:38:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 773 ms
[2023-03-15 21:38:20] [INFO ] Deduced a trap composed of 76 places in 330 ms of which 1 ms to minimize.
[2023-03-15 21:38:21] [INFO ] Deduced a trap composed of 73 places in 330 ms of which 0 ms to minimize.
[2023-03-15 21:38:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 842 ms
[2023-03-15 21:38:21] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 1 ms to minimize.
[2023-03-15 21:38:22] [INFO ] Deduced a trap composed of 67 places in 405 ms of which 1 ms to minimize.
[2023-03-15 21:38:22] [INFO ] Deduced a trap composed of 67 places in 384 ms of which 1 ms to minimize.
[2023-03-15 21:38:23] [INFO ] Deduced a trap composed of 67 places in 302 ms of which 1 ms to minimize.
[2023-03-15 21:38:23] [INFO ] Deduced a trap composed of 67 places in 382 ms of which 1 ms to minimize.
[2023-03-15 21:38:24] [INFO ] Deduced a trap composed of 67 places in 403 ms of which 1 ms to minimize.
[2023-03-15 21:38:24] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 0 ms to minimize.
[2023-03-15 21:38:24] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 1 ms to minimize.
[2023-03-15 21:38:24] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 0 ms to minimize.
[2023-03-15 21:38:25] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 1 ms to minimize.
[2023-03-15 21:38:25] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 1 ms to minimize.
[2023-03-15 21:38:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4109 ms
[2023-03-15 21:38:25] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:38:26] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 1 ms to minimize.
[2023-03-15 21:38:26] [INFO ] Deduced a trap composed of 58 places in 372 ms of which 1 ms to minimize.
[2023-03-15 21:38:27] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 1 ms to minimize.
[2023-03-15 21:38:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2139 ms
[2023-03-15 21:38:28] [INFO ] Deduced a trap composed of 96 places in 281 ms of which 1 ms to minimize.
[2023-03-15 21:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-15 21:38:28] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 1 ms to minimize.
[2023-03-15 21:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2023-03-15 21:38:29] [INFO ] Deduced a trap composed of 61 places in 427 ms of which 1 ms to minimize.
[2023-03-15 21:38:29] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:38:30] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 0 ms to minimize.
[2023-03-15 21:38:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1198 ms
[2023-03-15 21:38:31] [INFO ] Deduced a trap composed of 54 places in 471 ms of which 1 ms to minimize.
[2023-03-15 21:38:31] [INFO ] Deduced a trap composed of 47 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:38:32] [INFO ] Deduced a trap composed of 38 places in 411 ms of which 1 ms to minimize.
[2023-03-15 21:38:32] [INFO ] Deduced a trap composed of 49 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:38:33] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 1 ms to minimize.
[2023-03-15 21:38:33] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 0 ms to minimize.
[2023-03-15 21:38:34] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 1 ms to minimize.
[2023-03-15 21:38:34] [INFO ] Deduced a trap composed of 19 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:38:35] [INFO ] Deduced a trap composed of 33 places in 343 ms of which 1 ms to minimize.
[2023-03-15 21:38:35] [INFO ] Deduced a trap composed of 67 places in 328 ms of which 1 ms to minimize.
[2023-03-15 21:38:35] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 1 ms to minimize.
[2023-03-15 21:38:36] [INFO ] Deduced a trap composed of 67 places in 328 ms of which 1 ms to minimize.
[2023-03-15 21:38:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5551 ms
[2023-03-15 21:38:36] [INFO ] Deduced a trap composed of 33 places in 330 ms of which 0 ms to minimize.
[2023-03-15 21:38:37] [INFO ] Deduced a trap composed of 96 places in 353 ms of which 1 ms to minimize.
[2023-03-15 21:38:37] [INFO ] Deduced a trap composed of 93 places in 247 ms of which 1 ms to minimize.
[2023-03-15 21:38:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1172 ms
[2023-03-15 21:38:38] [INFO ] Deduced a trap composed of 80 places in 292 ms of which 0 ms to minimize.
[2023-03-15 21:38:38] [INFO ] Deduced a trap composed of 84 places in 276 ms of which 0 ms to minimize.
[2023-03-15 21:38:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 739 ms
[2023-03-15 21:38:39] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 0 ms to minimize.
[2023-03-15 21:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-15 21:38:39] [INFO ] Deduced a trap composed of 28 places in 409 ms of which 1 ms to minimize.
[2023-03-15 21:38:39] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 0 ms to minimize.
[2023-03-15 21:38:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 852 ms
[2023-03-15 21:38:40] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 1 ms to minimize.
[2023-03-15 21:38:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-15 21:38:41] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2023-03-15 21:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-15 21:38:41] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 1 ms to minimize.
[2023-03-15 21:38:41] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 1 ms to minimize.
[2023-03-15 21:38:42] [INFO ] Deduced a trap composed of 57 places in 247 ms of which 1 ms to minimize.
[2023-03-15 21:38:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 846 ms
[2023-03-15 21:38:42] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 0 ms to minimize.
[2023-03-15 21:38:43] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 1 ms to minimize.
[2023-03-15 21:38:43] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 1 ms to minimize.
[2023-03-15 21:38:44] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 1 ms to minimize.
[2023-03-15 21:38:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2012 ms
[2023-03-15 21:38:45] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2023-03-15 21:38:45] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:38:46] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 1 ms to minimize.
[2023-03-15 21:38:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 708 ms
[2023-03-15 21:38:47] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 1 ms to minimize.
[2023-03-15 21:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2023-03-15 21:38:47] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:38:48] [INFO ] Deduced a trap composed of 34 places in 423 ms of which 1 ms to minimize.
[2023-03-15 21:38:48] [INFO ] Deduced a trap composed of 43 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:38:49] [INFO ] Deduced a trap composed of 51 places in 389 ms of which 1 ms to minimize.
[2023-03-15 21:38:49] [INFO ] Deduced a trap composed of 33 places in 395 ms of which 1 ms to minimize.
[2023-03-15 21:38:50] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 1 ms to minimize.
[2023-03-15 21:38:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2681 ms
[2023-03-15 21:38:51] [INFO ] Deduced a trap composed of 74 places in 359 ms of which 1 ms to minimize.
[2023-03-15 21:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2023-03-15 21:38:52] [INFO ] Deduced a trap composed of 19 places in 371 ms of which 1 ms to minimize.
[2023-03-15 21:38:52] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 1 ms to minimize.
[2023-03-15 21:38:53] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:38:53] [INFO ] Deduced a trap composed of 11 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:38:53] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2023-03-15 21:38:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2160 ms
[2023-03-15 21:38:54] [INFO ] Deduced a trap composed of 50 places in 377 ms of which 1 ms to minimize.
[2023-03-15 21:38:54] [INFO ] Deduced a trap composed of 75 places in 369 ms of which 1 ms to minimize.
[2023-03-15 21:38:55] [INFO ] Deduced a trap composed of 108 places in 308 ms of which 1 ms to minimize.
[2023-03-15 21:38:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1306 ms
[2023-03-15 21:38:55] [INFO ] Deduced a trap composed of 58 places in 359 ms of which 1 ms to minimize.
[2023-03-15 21:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2023-03-15 21:38:56] [INFO ] Deduced a trap composed of 34 places in 416 ms of which 1 ms to minimize.
[2023-03-15 21:38:57] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 1 ms to minimize.
[2023-03-15 21:38:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1027 ms
[2023-03-15 21:38:57] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 0 ms to minimize.
[2023-03-15 21:38:58] [INFO ] Deduced a trap composed of 10 places in 375 ms of which 1 ms to minimize.
[2023-03-15 21:38:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 891 ms
[2023-03-15 21:38:59] [INFO ] Deduced a trap composed of 87 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2023-03-15 21:39:00] [INFO ] Deduced a trap composed of 20 places in 454 ms of which 1 ms to minimize.
[2023-03-15 21:39:01] [INFO ] Deduced a trap composed of 59 places in 461 ms of which 1 ms to minimize.
[2023-03-15 21:39:01] [INFO ] Deduced a trap composed of 56 places in 452 ms of which 1 ms to minimize.
[2023-03-15 21:39:02] [INFO ] Deduced a trap composed of 134 places in 463 ms of which 1 ms to minimize.
[2023-03-15 21:39:02] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 1 ms to minimize.
[2023-03-15 21:39:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2644 ms
[2023-03-15 21:39:03] [INFO ] Deduced a trap composed of 30 places in 419 ms of which 1 ms to minimize.
[2023-03-15 21:39:03] [INFO ] Deduced a trap composed of 57 places in 338 ms of which 0 ms to minimize.
[2023-03-15 21:39:04] [INFO ] Deduced a trap composed of 80 places in 323 ms of which 1 ms to minimize.
[2023-03-15 21:39:04] [INFO ] Deduced a trap composed of 122 places in 311 ms of which 1 ms to minimize.
[2023-03-15 21:39:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1688 ms
[2023-03-15 21:39:04] [INFO ] Deduced a trap composed of 147 places in 241 ms of which 1 ms to minimize.
[2023-03-15 21:39:05] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 1 ms to minimize.
[2023-03-15 21:39:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 654 ms
[2023-03-15 21:39:05] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 1 ms to minimize.
[2023-03-15 21:39:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-15 21:39:06] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 1 ms to minimize.
[2023-03-15 21:39:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 528 ms
[2023-03-15 21:39:07] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 1 ms to minimize.
[2023-03-15 21:39:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2023-03-15 21:39:09] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2023-03-15 21:39:10] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 1 ms to minimize.
[2023-03-15 21:39:10] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 1 ms to minimize.
[2023-03-15 21:39:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 946 ms
[2023-03-15 21:39:12] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 1 ms to minimize.
[2023-03-15 21:39:12] [INFO ] Deduced a trap composed of 91 places in 246 ms of which 1 ms to minimize.
[2023-03-15 21:39:12] [INFO ] Deduced a trap composed of 90 places in 206 ms of which 1 ms to minimize.
[2023-03-15 21:39:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 814 ms
[2023-03-15 21:39:13] [INFO ] Deduced a trap composed of 84 places in 199 ms of which 0 ms to minimize.
[2023-03-15 21:39:14] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 1 ms to minimize.
[2023-03-15 21:39:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1079 ms
[2023-03-15 21:39:15] [INFO ] Deduced a trap composed of 26 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:39:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 513 ms
[2023-03-15 21:39:15] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 1 ms to minimize.
[2023-03-15 21:39:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2023-03-15 21:39:17] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2023-03-15 21:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-15 21:39:17] [INFO ] Deduced a trap composed of 93 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:39:18] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 1 ms to minimize.
[2023-03-15 21:39:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 812 ms
[2023-03-15 21:39:18] [INFO ] Deduced a trap composed of 63 places in 333 ms of which 1 ms to minimize.
[2023-03-15 21:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-15 21:39:19] [INFO ] Deduced a trap composed of 125 places in 206 ms of which 1 ms to minimize.
[2023-03-15 21:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2023-03-15 21:39:23] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 1 ms to minimize.
[2023-03-15 21:39:23] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 0 ms to minimize.
[2023-03-15 21:39:23] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 1 ms to minimize.
[2023-03-15 21:39:23] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 0 ms to minimize.
[2023-03-15 21:39:23] [INFO ] Deduced a trap composed of 91 places in 218 ms of which 1 ms to minimize.
[2023-03-15 21:39:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1082 ms
[2023-03-15 21:39:24] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-15 21:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-15 21:39:28] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 0 ms to minimize.
[2023-03-15 21:39:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2023-03-15 21:39:28] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 0 ms to minimize.
[2023-03-15 21:39:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-15 21:39:29] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 1 ms to minimize.
[2023-03-15 21:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-15 21:39:32] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 1 ms to minimize.
[2023-03-15 21:39:32] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2023-03-15 21:39:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 646 ms
[2023-03-15 21:39:33] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 5 ms to minimize.
[2023-03-15 21:39:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-15 21:39:34] [INFO ] Deduced a trap composed of 60 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:39:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2023-03-15 21:39:34] [INFO ] Deduced a trap composed of 87 places in 249 ms of which 1 ms to minimize.
[2023-03-15 21:39:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 881 ms
[2023-03-15 21:39:39] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 1 ms to minimize.
[2023-03-15 21:39:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2023-03-15 21:39:41] [INFO ] Deduced a trap composed of 13 places in 453 ms of which 1 ms to minimize.
[2023-03-15 21:39:41] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 1 ms to minimize.
[2023-03-15 21:39:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1021 ms
[2023-03-15 21:39:42] [INFO ] Deduced a trap composed of 43 places in 446 ms of which 1 ms to minimize.
[2023-03-15 21:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 568 ms
[2023-03-15 21:39:43] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2023-03-15 21:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-15 21:39:51] [INFO ] Deduced a trap composed of 22 places in 379 ms of which 1 ms to minimize.
[2023-03-15 21:39:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-15 21:39:54] [INFO ] Deduced a trap composed of 34 places in 415 ms of which 1 ms to minimize.
[2023-03-15 21:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 628 ms
[2023-03-15 21:39:56] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2023-03-15 21:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-15 21:39:57] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 1 ms to minimize.
[2023-03-15 21:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2023-03-15 21:40:04] [INFO ] Deduced a trap composed of 72 places in 191 ms of which 1 ms to minimize.
[2023-03-15 21:40:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-15 21:40:05] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 1 ms to minimize.
[2023-03-15 21:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2023-03-15 21:40:14] [INFO ] After 169049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :368
Attempting to minimize the solution found.
Minimization took 34988 ms.
[2023-03-15 21:40:49] [INFO ] After 225011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :367
Fused 368 Parikh solutions to 367 different solutions.
Parikh walk visited 0 properties in 1669 ms.
Support contains 368 out of 562 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 970/970 transitions.
Applied a total of 0 rules in 28 ms. Remains 562 /562 variables (removed 0) and now considering 970/970 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 970/970 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 970/970 transitions.
Applied a total of 0 rules in 26 ms. Remains 562 /562 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-15 21:40:51] [INFO ] Flow matrix only has 850 transitions (discarded 120 similar events)
// Phase 1: matrix 850 rows 562 cols
[2023-03-15 21:40:51] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 21:40:51] [INFO ] Implicit Places using invariants in 468 ms returned [526, 538, 539, 540, 541, 542]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 473 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 556/562 places, 970/970 transitions.
Applied a total of 0 rules in 26 ms. Remains 556 /556 variables (removed 0) and now considering 970/970 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 556/562 places, 970/970 transitions.
Interrupted random walk after 428035 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties 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 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) 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 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 368) 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 368) seen :0
Interrupted probabilistic random walk after 6812743 steps, run timeout after 105001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 6812743 steps, saw 974231 distinct states, run finished after 105002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 368 properties.
[2023-03-15 21:43:12] [INFO ] Flow matrix only has 850 transitions (discarded 120 similar events)
// Phase 1: matrix 850 rows 556 cols
[2023-03-15 21:43:12] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 21:43:19] [INFO ] After 7814ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:368
[2023-03-15 21:43:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-03-15 21:43:51] [INFO ] After 18374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :368
[2023-03-15 21:43:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 21:44:10] [INFO ] After 19207ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :368
[2023-03-15 21:44:10] [INFO ] Deduced a trap composed of 9 places in 360 ms of which 1 ms to minimize.
[2023-03-15 21:44:11] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:44:11] [INFO ] Deduced a trap composed of 42 places in 385 ms of which 1 ms to minimize.
[2023-03-15 21:44:11] [INFO ] Deduced a trap composed of 12 places in 413 ms of which 1 ms to minimize.
[2023-03-15 21:44:12] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 1 ms to minimize.
[2023-03-15 21:44:12] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:44:13] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2023-03-15 21:44:13] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 1 ms to minimize.
[2023-03-15 21:44:13] [INFO ] Deduced a trap composed of 16 places in 338 ms of which 1 ms to minimize.
[2023-03-15 21:44:14] [INFO ] Deduced a trap composed of 16 places in 339 ms of which 1 ms to minimize.
[2023-03-15 21:44:14] [INFO ] Deduced a trap composed of 46 places in 410 ms of which 1 ms to minimize.
[2023-03-15 21:44:15] [INFO ] Deduced a trap composed of 22 places in 317 ms of which 1 ms to minimize.
[2023-03-15 21:44:15] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2023-03-15 21:44:15] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 1 ms to minimize.
[2023-03-15 21:44:16] [INFO ] Deduced a trap composed of 38 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:44:16] [INFO ] Deduced a trap composed of 16 places in 449 ms of which 1 ms to minimize.
[2023-03-15 21:44:17] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:44:17] [INFO ] Deduced a trap composed of 41 places in 390 ms of which 2 ms to minimize.
[2023-03-15 21:44:17] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 1 ms to minimize.
[2023-03-15 21:44:18] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 1 ms to minimize.
[2023-03-15 21:44:18] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 0 ms to minimize.
[2023-03-15 21:44:18] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 0 ms to minimize.
[2023-03-15 21:44:19] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 1 ms to minimize.
[2023-03-15 21:44:19] [INFO ] Deduced a trap composed of 27 places in 328 ms of which 1 ms to minimize.
[2023-03-15 21:44:20] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 1 ms to minimize.
[2023-03-15 21:44:20] [INFO ] Deduced a trap composed of 39 places in 330 ms of which 1 ms to minimize.
[2023-03-15 21:44:20] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 1 ms to minimize.
[2023-03-15 21:44:21] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:44:21] [INFO ] Deduced a trap composed of 66 places in 378 ms of which 1 ms to minimize.
[2023-03-15 21:44:22] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 1 ms to minimize.
[2023-03-15 21:44:22] [INFO ] Deduced a trap composed of 34 places in 454 ms of which 1 ms to minimize.
[2023-03-15 21:44:23] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:44:23] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 1 ms to minimize.
[2023-03-15 21:44:23] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 13105 ms
[2023-03-15 21:44:23] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-15 21:44:24] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 0 ms to minimize.
[2023-03-15 21:44:24] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 1 ms to minimize.
[2023-03-15 21:44:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 817 ms
[2023-03-15 21:44:24] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 1 ms to minimize.
[2023-03-15 21:44:25] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 1 ms to minimize.
[2023-03-15 21:44:25] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 0 ms to minimize.
[2023-03-15 21:44:25] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2023-03-15 21:44:25] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 1 ms to minimize.
[2023-03-15 21:44:26] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 1 ms to minimize.
[2023-03-15 21:44:26] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 0 ms to minimize.
[2023-03-15 21:44:26] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 1 ms to minimize.
[2023-03-15 21:44:26] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 0 ms to minimize.
[2023-03-15 21:44:27] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 0 ms to minimize.
[2023-03-15 21:44:27] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 0 ms to minimize.
[2023-03-15 21:44:27] [INFO ] Deduced a trap composed of 68 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:44:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3216 ms
[2023-03-15 21:44:27] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 0 ms to minimize.
[2023-03-15 21:44:28] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 1 ms to minimize.
[2023-03-15 21:44:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
[2023-03-15 21:44:28] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 1 ms to minimize.
[2023-03-15 21:44:28] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:44:28] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 0 ms to minimize.
[2023-03-15 21:44:29] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2023-03-15 21:44:29] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 1 ms to minimize.
[2023-03-15 21:44:29] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 1 ms to minimize.
[2023-03-15 21:44:29] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 0 ms to minimize.
[2023-03-15 21:44:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1522 ms
[2023-03-15 21:44:30] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 1 ms to minimize.
[2023-03-15 21:44:30] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-15 21:44:30] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 0 ms to minimize.
[2023-03-15 21:44:30] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 1 ms to minimize.
[2023-03-15 21:44:31] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 0 ms to minimize.
[2023-03-15 21:44:31] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 0 ms to minimize.
[2023-03-15 21:44:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1462 ms
[2023-03-15 21:44:31] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 0 ms to minimize.
[2023-03-15 21:44:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-15 21:44:32] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2023-03-15 21:44:32] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 0 ms to minimize.
[2023-03-15 21:44:33] [INFO ] Deduced a trap composed of 102 places in 302 ms of which 1 ms to minimize.
[2023-03-15 21:44:33] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2023-03-15 21:44:33] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 0 ms to minimize.
[2023-03-15 21:44:34] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 1 ms to minimize.
[2023-03-15 21:44:34] [INFO ] Deduced a trap composed of 91 places in 248 ms of which 0 ms to minimize.
[2023-03-15 21:44:34] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 1 ms to minimize.
[2023-03-15 21:44:34] [INFO ] Deduced a trap composed of 91 places in 176 ms of which 0 ms to minimize.
[2023-03-15 21:44:34] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 0 ms to minimize.
[2023-03-15 21:44:35] [INFO ] Deduced a trap composed of 91 places in 181 ms of which 0 ms to minimize.
[2023-03-15 21:44:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3246 ms
[2023-03-15 21:44:35] [INFO ] Deduced a trap composed of 67 places in 383 ms of which 1 ms to minimize.
[2023-03-15 21:44:36] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 0 ms to minimize.
[2023-03-15 21:44:36] [INFO ] Deduced a trap composed of 56 places in 314 ms of which 0 ms to minimize.
[2023-03-15 21:44:36] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 1 ms to minimize.
[2023-03-15 21:44:37] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 1 ms to minimize.
[2023-03-15 21:44:37] [INFO ] Deduced a trap composed of 97 places in 232 ms of which 0 ms to minimize.
[2023-03-15 21:44:37] [INFO ] Deduced a trap composed of 96 places in 215 ms of which 1 ms to minimize.
[2023-03-15 21:44:37] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 1 ms to minimize.
[2023-03-15 21:44:38] [INFO ] Deduced a trap composed of 105 places in 215 ms of which 1 ms to minimize.
[2023-03-15 21:44:38] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 0 ms to minimize.
[2023-03-15 21:44:38] [INFO ] Deduced a trap composed of 93 places in 315 ms of which 1 ms to minimize.
[2023-03-15 21:44:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3326 ms
[2023-03-15 21:44:38] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 0 ms to minimize.
[2023-03-15 21:44:39] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 1 ms to minimize.
[2023-03-15 21:44:39] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 0 ms to minimize.
[2023-03-15 21:44:39] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 1 ms to minimize.
[2023-03-15 21:44:40] [INFO ] Deduced a trap composed of 80 places in 234 ms of which 1 ms to minimize.
[2023-03-15 21:44:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1322 ms
[2023-03-15 21:44:40] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 0 ms to minimize.
[2023-03-15 21:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-15 21:44:40] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 1 ms to minimize.
[2023-03-15 21:44:41] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 1 ms to minimize.
[2023-03-15 21:44:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 725 ms
[2023-03-15 21:44:42] [INFO ] Deduced a trap composed of 53 places in 317 ms of which 1 ms to minimize.
[2023-03-15 21:44:42] [INFO ] Deduced a trap composed of 57 places in 297 ms of which 1 ms to minimize.
[2023-03-15 21:44:42] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 0 ms to minimize.
[2023-03-15 21:44:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1022 ms
[2023-03-15 21:44:43] [INFO ] Deduced a trap composed of 33 places in 395 ms of which 1 ms to minimize.
[2023-03-15 21:44:43] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 1 ms to minimize.
[2023-03-15 21:44:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1008 ms
[2023-03-15 21:44:44] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 1 ms to minimize.
[2023-03-15 21:44:44] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 1 ms to minimize.
[2023-03-15 21:44:44] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:44:45] [INFO ] Deduced a trap composed of 63 places in 335 ms of which 1 ms to minimize.
[2023-03-15 21:44:45] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 1 ms to minimize.
[2023-03-15 21:44:45] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 1 ms to minimize.
[2023-03-15 21:44:46] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 1 ms to minimize.
[2023-03-15 21:44:46] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 1 ms to minimize.
[2023-03-15 21:44:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2378 ms
[2023-03-15 21:44:46] [INFO ] Deduced a trap composed of 50 places in 285 ms of which 1 ms to minimize.
[2023-03-15 21:44:47] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 0 ms to minimize.
[2023-03-15 21:44:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 769 ms
[2023-03-15 21:44:47] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 0 ms to minimize.
[2023-03-15 21:44:48] [INFO ] Deduced a trap composed of 29 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:44:48] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 1 ms to minimize.
[2023-03-15 21:44:48] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 0 ms to minimize.
[2023-03-15 21:44:49] [INFO ] Deduced a trap composed of 53 places in 231 ms of which 1 ms to minimize.
[2023-03-15 21:44:49] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2023-03-15 21:44:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2173 ms
[2023-03-15 21:44:49] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:44:50] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 1 ms to minimize.
[2023-03-15 21:44:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 609 ms
[2023-03-15 21:44:50] [INFO ] Deduced a trap composed of 66 places in 390 ms of which 1 ms to minimize.
[2023-03-15 21:44:51] [INFO ] Deduced a trap composed of 23 places in 326 ms of which 1 ms to minimize.
[2023-03-15 21:44:51] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 0 ms to minimize.
[2023-03-15 21:44:51] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 1 ms to minimize.
[2023-03-15 21:44:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1494 ms
[2023-03-15 21:44:52] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 0 ms to minimize.
[2023-03-15 21:44:52] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 0 ms to minimize.
[2023-03-15 21:44:53] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 1 ms to minimize.
[2023-03-15 21:44:53] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:44:53] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2023-03-15 21:44:54] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:44:54] [INFO ] Deduced a trap composed of 50 places in 414 ms of which 1 ms to minimize.
[2023-03-15 21:44:55] [INFO ] Deduced a trap composed of 50 places in 414 ms of which 1 ms to minimize.
[2023-03-15 21:44:55] [INFO ] Deduced a trap composed of 50 places in 397 ms of which 1 ms to minimize.
[2023-03-15 21:44:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3749 ms
[2023-03-15 21:44:56] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 1 ms to minimize.
[2023-03-15 21:44:56] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 1 ms to minimize.
[2023-03-15 21:44:56] [INFO ] Deduced a trap composed of 51 places in 371 ms of which 1 ms to minimize.
[2023-03-15 21:44:57] [INFO ] Deduced a trap composed of 19 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:44:58] [INFO ] Deduced a trap composed of 9 places in 417 ms of which 1 ms to minimize.
[2023-03-15 21:44:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2437 ms
[2023-03-15 21:44:59] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 1 ms to minimize.
[2023-03-15 21:45:00] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 2 ms to minimize.
[2023-03-15 21:45:00] [INFO ] Deduced a trap composed of 67 places in 416 ms of which 1 ms to minimize.
[2023-03-15 21:45:01] [INFO ] Deduced a trap composed of 67 places in 398 ms of which 1 ms to minimize.
[2023-03-15 21:45:01] [INFO ] Deduced a trap composed of 66 places in 398 ms of which 1 ms to minimize.
[2023-03-15 21:45:02] [INFO ] Deduced a trap composed of 67 places in 411 ms of which 1 ms to minimize.
[2023-03-15 21:45:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2784 ms
[2023-03-15 21:45:03] [INFO ] Deduced a trap composed of 96 places in 432 ms of which 1 ms to minimize.
[2023-03-15 21:45:03] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 0 ms to minimize.
[2023-03-15 21:45:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 797 ms
[2023-03-15 21:45:04] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 1 ms to minimize.
[2023-03-15 21:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 562 ms
[2023-03-15 21:45:05] [INFO ] Deduced a trap composed of 22 places in 458 ms of which 1 ms to minimize.
[2023-03-15 21:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2023-03-15 21:45:06] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 1 ms to minimize.
[2023-03-15 21:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 571 ms
[2023-03-15 21:45:06] [INFO ] Deduced a trap composed of 44 places in 344 ms of which 1 ms to minimize.
[2023-03-15 21:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-15 21:45:07] [INFO ] Deduced a trap composed of 48 places in 402 ms of which 1 ms to minimize.
[2023-03-15 21:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2023-03-15 21:45:07] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 1 ms to minimize.
[2023-03-15 21:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2023-03-15 21:45:09] [INFO ] Deduced a trap composed of 67 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:45:09] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 1 ms to minimize.
[2023-03-15 21:45:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 806 ms
[2023-03-15 21:45:10] [INFO ] Deduced a trap composed of 34 places in 394 ms of which 1 ms to minimize.
[2023-03-15 21:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 517 ms
[2023-03-15 21:45:10] [INFO ] Deduced a trap composed of 86 places in 259 ms of which 1 ms to minimize.
[2023-03-15 21:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-15 21:45:11] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:45:11] [INFO ] Deduced a trap composed of 34 places in 374 ms of which 1 ms to minimize.
[2023-03-15 21:45:12] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 0 ms to minimize.
[2023-03-15 21:45:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1374 ms
[2023-03-15 21:45:12] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 1 ms to minimize.
[2023-03-15 21:45:12] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 1 ms to minimize.
[2023-03-15 21:45:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 689 ms
[2023-03-15 21:45:14] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 1 ms to minimize.
[2023-03-15 21:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-15 21:45:15] [INFO ] Deduced a trap composed of 20 places in 515 ms of which 1 ms to minimize.
[2023-03-15 21:45:15] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 2 ms to minimize.
[2023-03-15 21:45:16] [INFO ] Deduced a trap composed of 14 places in 493 ms of which 2 ms to minimize.
[2023-03-15 21:45:17] [INFO ] Deduced a trap composed of 35 places in 470 ms of which 1 ms to minimize.
[2023-03-15 21:45:17] [INFO ] Deduced a trap composed of 11 places in 489 ms of which 1 ms to minimize.
[2023-03-15 21:45:18] [INFO ] Deduced a trap composed of 87 places in 395 ms of which 1 ms to minimize.
[2023-03-15 21:45:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3203 ms
[2023-03-15 21:45:18] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 0 ms to minimize.
[2023-03-15 21:45:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-15 21:45:19] [INFO ] Deduced a trap composed of 98 places in 369 ms of which 1 ms to minimize.
[2023-03-15 21:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2023-03-15 21:45:20] [INFO ] Deduced a trap composed of 75 places in 284 ms of which 1 ms to minimize.
[2023-03-15 21:45:21] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 0 ms to minimize.
[2023-03-15 21:45:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 668 ms
[2023-03-15 21:45:21] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 1 ms to minimize.
[2023-03-15 21:45:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-15 21:45:22] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2023-03-15 21:45:24] [INFO ] Deduced a trap composed of 11 places in 471 ms of which 1 ms to minimize.
[2023-03-15 21:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2023-03-15 21:45:24] [INFO ] Deduced a trap composed of 33 places in 459 ms of which 1 ms to minimize.
[2023-03-15 21:45:25] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 1 ms to minimize.
[2023-03-15 21:45:25] [INFO ] Deduced a trap composed of 122 places in 367 ms of which 1 ms to minimize.
[2023-03-15 21:45:26] [INFO ] Deduced a trap composed of 108 places in 294 ms of which 0 ms to minimize.
[2023-03-15 21:45:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1869 ms
[2023-03-15 21:45:26] [INFO ] Deduced a trap composed of 162 places in 345 ms of which 1 ms to minimize.
[2023-03-15 21:45:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-15 21:45:27] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 1 ms to minimize.
[2023-03-15 21:45:27] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 1 ms to minimize.
[2023-03-15 21:45:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 913 ms
[2023-03-15 21:45:28] [INFO ] Deduced a trap composed of 33 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:45:28] [INFO ] Deduced a trap composed of 73 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:45:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 957 ms
[2023-03-15 21:45:30] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 1 ms to minimize.
[2023-03-15 21:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-15 21:45:30] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 1 ms to minimize.
[2023-03-15 21:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-15 21:45:31] [INFO ] Deduced a trap composed of 72 places in 226 ms of which 1 ms to minimize.
[2023-03-15 21:45:32] [INFO ] Deduced a trap composed of 90 places in 268 ms of which 1 ms to minimize.
[2023-03-15 21:45:32] [INFO ] Deduced a trap composed of 115 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:45:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1019 ms
[2023-03-15 21:45:33] [INFO ] Deduced a trap composed of 10 places in 447 ms of which 1 ms to minimize.
[2023-03-15 21:45:33] [INFO ] Deduced a trap composed of 10 places in 457 ms of which 1 ms to minimize.
[2023-03-15 21:45:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1095 ms
[2023-03-15 21:45:34] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 1 ms to minimize.
[2023-03-15 21:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-15 21:45:34] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 1 ms to minimize.
[2023-03-15 21:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2023-03-15 21:45:36] [INFO ] Deduced a trap composed of 50 places in 436 ms of which 1 ms to minimize.
[2023-03-15 21:45:36] [INFO ] Deduced a trap composed of 44 places in 427 ms of which 1 ms to minimize.
[2023-03-15 21:45:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1065 ms
[2023-03-15 21:45:37] [INFO ] Deduced a trap composed of 61 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:45:38] [INFO ] Deduced a trap composed of 51 places in 292 ms of which 1 ms to minimize.
[2023-03-15 21:45:38] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 1 ms to minimize.
[2023-03-15 21:45:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1536 ms
[2023-03-15 21:45:39] [INFO ] Deduced a trap composed of 91 places in 248 ms of which 1 ms to minimize.
[2023-03-15 21:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-15 21:45:40] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 1 ms to minimize.
[2023-03-15 21:45:40] [INFO ] Deduced a trap composed of 86 places in 284 ms of which 0 ms to minimize.
[2023-03-15 21:45:41] [INFO ] Deduced a trap composed of 82 places in 270 ms of which 1 ms to minimize.
[2023-03-15 21:45:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1095 ms
[2023-03-15 21:45:41] [INFO ] Deduced a trap composed of 125 places in 278 ms of which 1 ms to minimize.
[2023-03-15 21:45:42] [INFO ] Deduced a trap composed of 93 places in 203 ms of which 1 ms to minimize.
[2023-03-15 21:45:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2023-03-15 21:45:46] [INFO ] Deduced a trap composed of 91 places in 377 ms of which 1 ms to minimize.
[2023-03-15 21:45:46] [INFO ] Deduced a trap composed of 87 places in 368 ms of which 2 ms to minimize.
[2023-03-15 21:45:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 936 ms
[2023-03-15 21:45:49] [INFO ] Deduced a trap composed of 44 places in 326 ms of which 1 ms to minimize.
[2023-03-15 21:45:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2023-03-15 21:45:53] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 1 ms to minimize.
[2023-03-15 21:45:53] [INFO ] Deduced a trap composed of 11 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:45:53] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2023-03-15 21:45:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1041 ms
[2023-03-15 21:45:54] [INFO ] Deduced a trap composed of 81 places in 257 ms of which 1 ms to minimize.
[2023-03-15 21:45:55] [INFO ] Deduced a trap composed of 86 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:45:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1228 ms
[2023-03-15 21:45:56] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 1 ms to minimize.
[2023-03-15 21:45:56] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 0 ms to minimize.
[2023-03-15 21:45:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2023-03-15 21:45:57] [INFO ] Deduced a trap composed of 82 places in 278 ms of which 1 ms to minimize.
[2023-03-15 21:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2023-03-15 21:45:58] [INFO ] Deduced a trap composed of 43 places in 402 ms of which 2 ms to minimize.
[2023-03-15 21:45:59] [INFO ] Deduced a trap composed of 58 places in 420 ms of which 1 ms to minimize.
[2023-03-15 21:45:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1032 ms
[2023-03-15 21:46:01] [INFO ] Deduced a trap composed of 87 places in 351 ms of which 1 ms to minimize.
[2023-03-15 21:46:01] [INFO ] Deduced a trap composed of 84 places in 285 ms of which 0 ms to minimize.
[2023-03-15 21:46:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 971 ms
[2023-03-15 21:46:02] [INFO ] Deduced a trap composed of 19 places in 468 ms of which 1 ms to minimize.
[2023-03-15 21:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2023-03-15 21:46:12] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-15 21:46:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-15 21:46:14] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:46:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-15 21:46:17] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 1 ms to minimize.
[2023-03-15 21:46:17] [INFO ] Deduced a trap composed of 34 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:46:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1021 ms
[2023-03-15 21:46:19] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 1 ms to minimize.
[2023-03-15 21:46:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 550 ms
[2023-03-15 21:46:20] [INFO ] Deduced a trap composed of 76 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:46:20] [INFO ] Deduced a trap composed of 24 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:46:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 986 ms
[2023-03-15 21:46:30] [INFO ] Deduced a trap composed of 44 places in 389 ms of which 0 ms to minimize.
[2023-03-15 21:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-15 21:46:31] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 1 ms to minimize.
[2023-03-15 21:46:31] [INFO ] Deduced a trap composed of 97 places in 236 ms of which 1 ms to minimize.
[2023-03-15 21:46:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 910 ms
[2023-03-15 21:46:38] [INFO ] After 167591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :368
Attempting to minimize the solution found.
Minimization took 26211 ms.
[2023-03-15 21:47:04] [INFO ] After 225010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :367
Parikh walk visited 0 properties in 9821 ms.
Support contains 368 out of 556 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 556/556 places, 970/970 transitions.
Applied a total of 0 rules in 14 ms. Remains 556 /556 variables (removed 0) and now considering 970/970 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 556/556 places, 970/970 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 556/556 places, 970/970 transitions.
Applied a total of 0 rules in 14 ms. Remains 556 /556 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-15 21:47:14] [INFO ] Flow matrix only has 850 transitions (discarded 120 similar events)
// Phase 1: matrix 850 rows 556 cols
[2023-03-15 21:47:14] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 21:47:15] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-15 21:47:15] [INFO ] Flow matrix only has 850 transitions (discarded 120 similar events)
// Phase 1: matrix 850 rows 556 cols
[2023-03-15 21:47:15] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 21:47:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 21:47:16] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
[2023-03-15 21:47:16] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-15 21:47:16] [INFO ] Flow matrix only has 850 transitions (discarded 120 similar events)
// Phase 1: matrix 850 rows 556 cols
[2023-03-15 21:47:16] [INFO ] Computed 17 place invariants in 10 ms
[2023-03-15 21:47:18] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 556/556 places, 970/970 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 7109 ms. (steps per millisecond=14 ) properties (out of 368) seen :0
Running SMT prover for 368 properties.
[2023-03-15 21:47:25] [INFO ] Flow matrix only has 850 transitions (discarded 120 similar events)
// Phase 1: matrix 850 rows 556 cols
[2023-03-15 21:47:25] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 21:47:33] [INFO ] After 8661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:368
[2023-03-15 21:47:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2023-03-15 21:47:56] [INFO ] After 12728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :368
[2023-03-15 21:47:56] [INFO ] State equation strengthened by 205 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Peterson-PT-5, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r288-smll-167863554400393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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