fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r175-tall-165277023800043
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Peterson-PT-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
472.380 407434.00 698902.00 674.90 F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 47K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 30 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 388K Apr 30 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 26K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 298K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652803424758

Running Version 202205111006
[2022-05-17 16:03:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-17 16:03:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:03:46] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-05-17 16:03:46] [INFO ] Transformed 480 places.
[2022-05-17 16:03:46] [INFO ] Transformed 690 transitions.
[2022-05-17 16:03:46] [INFO ] Found NUPN structural information;
[2022-05-17 16:03:46] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2022-05-17 16:03:46] [INFO ] Parsed PT model containing 480 places and 690 transitions in 220 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 480) seen :199
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 281) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 281) seen :0
Running SMT prover for 281 properties.
[2022-05-17 16:03:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 16:03:47] [INFO ] Computed 19 place invariants in 25 ms
[2022-05-17 16:03:50] [INFO ] After 3258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:281
[2022-05-17 16:03:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2022-05-17 16:03:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 16:04:00] [INFO ] After 6083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :281
[2022-05-17 16:04:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 16:04:07] [INFO ] After 7169ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :281
[2022-05-17 16:04:08] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 5 ms to minimize.
[2022-05-17 16:04:08] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 2 ms to minimize.
[2022-05-17 16:04:08] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:04:08] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 2 ms to minimize.
[2022-05-17 16:04:08] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:04:09] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:04:09] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:04:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1304 ms
[2022-05-17 16:04:09] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:04:09] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:04:09] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:04:09] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:04:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 586 ms
[2022-05-17 16:04:10] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:04:10] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:04:10] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:04:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 502 ms
[2022-05-17 16:04:10] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:04:10] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 643 ms
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 352 ms
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:04:11] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:04:12] [INFO ] Deduced a trap composed of 107 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 5 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1479 ms
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:04:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 439 ms
[2022-05-17 16:04:14] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:04:14] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:04:14] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:04:14] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:04:15] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:04:15] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:04:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2022-05-17 16:04:15] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:04:15] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:04:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:04:15] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:281
Parikh walk visited 0 properties in 87 ms.
Support contains 281 out of 480 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 480 transition count 643
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 433 transition count 643
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 94 place count 433 transition count 597
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 186 place count 387 transition count 597
Applied a total of 186 rules in 67 ms. Remains 387 /480 variables (removed 93) and now considering 597/690 (removed 93) transitions.
Finished structural reductions, in 1 iterations. Remains : 387/480 places, 597/690 transitions.
Interrupted random walk after 619392 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 251) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 235) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 227) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 223) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 219) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 219) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 216) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 216) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 212) seen :0
Running SMT prover for 212 properties.
[2022-05-17 16:04:51] [INFO ] Flow matrix only has 537 transitions (discarded 60 similar events)
// Phase 1: matrix 537 rows 387 cols
[2022-05-17 16:04:51] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 16:04:53] [INFO ] After 1779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:212
[2022-05-17 16:04:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-17 16:04:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 16:04:59] [INFO ] After 3539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :212
[2022-05-17 16:04:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 16:05:04] [INFO ] After 4587ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :212
[2022-05-17 16:05:04] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:05:04] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:05:04] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:05:04] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:05:04] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:05:04] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:05:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1817 ms
[2022-05-17 16:05:06] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:05:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-17 16:05:06] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:05:06] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:05:06] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2022-05-17 16:05:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2022-05-17 16:05:06] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2022-05-17 16:05:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 441 ms
[2022-05-17 16:05:06] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:05:07] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1436 ms
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:05:08] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:05:09] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:05:09] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:05:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 786 ms
[2022-05-17 16:05:09] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-17 16:05:09] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:05:09] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-17 16:05:09] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:05:09] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 364 ms
[2022-05-17 16:05:10] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2022-05-17 16:05:10] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:05:10] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:05:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2022-05-17 16:05:11] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:05:11] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:05:11] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:05:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2022-05-17 16:05:11] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:05:11] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:05:11] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:05:11] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-17 16:05:12] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:05:13] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:05:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1556 ms
[2022-05-17 16:05:13] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-17 16:05:13] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:05:13] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:05:13] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:05:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2022-05-17 16:05:13] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 905 ms
[2022-05-17 16:05:14] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-17 16:05:15] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:05:15] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:05:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2022-05-17 16:05:15] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:05:15] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:05:15] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:05:15] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:05:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 455 ms
[2022-05-17 16:05:15] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:05:16] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:05:16] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-17 16:05:16] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:05:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 784 ms
[2022-05-17 16:05:18] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2022-05-17 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-17 16:05:18] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-17 16:05:18] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-17 16:05:18] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:05:18] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-17 16:05:18] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:05:18] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2022-05-17 16:05:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2022-05-17 16:05:19] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:05:19] [INFO ] Deduced a trap composed of 112 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-17 16:05:19] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:05:19] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2022-05-17 16:05:19] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:05:19] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:05:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 359 ms
[2022-05-17 16:05:20] [INFO ] Deduced a trap composed of 108 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:05:20] [INFO ] Deduced a trap composed of 112 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:05:20] [INFO ] Deduced a trap composed of 127 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:05:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2022-05-17 16:05:20] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-17 16:05:21] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:05:21] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-17 16:05:21] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:05:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:05:22] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:05:22] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:05:22] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:05:22] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:05:22] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:05:22] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:05:22] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:05:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 888 ms
[2022-05-17 16:05:23] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-17 16:05:24] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:05:25] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-17 16:05:27] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-17 16:05:27] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 16:05:28] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:05:29] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-17 16:05:29] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:05:29] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-05-17 16:05:29] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:05:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:05:29] [INFO ] After 30007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :212
Attempting to minimize the solution found.
Minimization took 7545 ms.
[2022-05-17 16:05:37] [INFO ] After 43621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :212
Parikh walk visited 50 properties in 4467 ms.
Support contains 162 out of 387 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 387/387 places, 597/597 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 387 transition count 531
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 321 transition count 531
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 132 place count 321 transition count 507
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 180 place count 297 transition count 507
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 190 place count 292 transition count 502
Applied a total of 190 rules in 32 ms. Remains 292 /387 variables (removed 95) and now considering 502/597 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 292/387 places, 502/597 transitions.
Interrupted random walk after 762586 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 162) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 162) seen :0
Probabilistic random walk after 10000001 steps, saw 1666954 distinct states, run finished after 82980 ms. (steps per millisecond=120 ) properties seen :101
Running SMT prover for 61 properties.
[2022-05-17 16:07:38] [INFO ] Flow matrix only has 442 transitions (discarded 60 similar events)
// Phase 1: matrix 442 rows 292 cols
[2022-05-17 16:07:38] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-17 16:07:38] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:61
[2022-05-17 16:07:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 16:07:38] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 16:07:39] [INFO ] After 876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :61
[2022-05-17 16:07:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 16:07:40] [INFO ] After 938ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :61
[2022-05-17 16:07:40] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 0 ms to minimize.
[2022-05-17 16:07:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1076 ms
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:07:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:07:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 313 ms
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:07:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:07:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-17 16:07:42] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:07:43] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 674 ms
[2022-05-17 16:07:44] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 16:07:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2022-05-17 16:07:44] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 263 ms
[2022-05-17 16:07:44] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:07:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-17 16:07:45] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:07:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:07:45] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:07:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-17 16:07:45] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:07:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-17 16:07:46] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2022-05-17 16:07:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-05-17 16:07:46] [INFO ] After 6727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :61
Attempting to minimize the solution found.
Minimization took 1655 ms.
[2022-05-17 16:07:48] [INFO ] After 9843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :61
Parikh walk visited 0 properties in 2249 ms.
Support contains 61 out of 292 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 292/292 places, 502/502 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 292 transition count 451
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 241 transition count 451
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 102 place count 241 transition count 430
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 144 place count 220 transition count 430
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 160 place count 212 transition count 422
Applied a total of 160 rules in 31 ms. Remains 212 /292 variables (removed 80) and now considering 422/502 (removed 80) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/292 places, 422/502 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29422 ms. (steps per millisecond=33 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=196 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=186 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=192 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=196 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=190 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=195 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=193 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=169 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=173 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=171 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=176 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=176 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=178 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=182 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=182 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=180 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 61) seen :0
Finished probabilistic random walk after 16994688 steps, run visited all 61 properties in 104440 ms. (steps per millisecond=162 )
Probabilistic random walk after 16994688 steps, saw 2832961 distinct states, run finished after 104440 ms. (steps per millisecond=162 ) properties seen :61
Able to resolve query StableMarking after proving 480 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 406192 ms.

BK_STOP 1652803832192

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-4"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-4, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-tall-165277023800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 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 ;