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.r537-tall-167987255000158.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 smartxred
Input is EisenbergMcGuire-PT-07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r537-tall-167987255000158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 31 16:48 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 1680814831726

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:00:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 21:00:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:00:33] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-04-06 21:00:33] [INFO ] Transformed 553 places.
[2023-04-06 21:00:33] [INFO ] Transformed 1960 transitions.
[2023-04-06 21:00:33] [INFO ] Found NUPN structural information;
[2023-04-06 21:00:33] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 182 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 553) seen :368
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) 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 185) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 185) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 185) 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 185) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) 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 184) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 184) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 184) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 184) 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 184) 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 184) 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 184) 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 184) 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 184) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 184) 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 184) 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 184) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 184) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 184) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) 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 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) 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 183) 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 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 183) 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 183) 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 183) 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 183) 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 183) 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 183) seen :0
Running SMT prover for 183 properties.
[2023-04-06 21:00:34] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2023-04-06 21:00:34] [INFO ] Computed 22 invariants in 24 ms
[2023-04-06 21:00:36] [INFO ] After 2107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:183
[2023-04-06 21:00:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2023-04-06 21:00:37] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 21:00:44] [INFO ] After 5232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :183
[2023-04-06 21:00:44] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-06 21:00:51] [INFO ] After 6687ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :183
[2023-04-06 21:00:51] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 6 ms to minimize.
[2023-04-06 21:00:51] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 1 ms to minimize.
[2023-04-06 21:00:51] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2023-04-06 21:00:51] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2023-04-06 21:00:52] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2023-04-06 21:00:52] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2023-04-06 21:00:52] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2023-04-06 21:00:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1298 ms
[2023-04-06 21:00:52] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-04-06 21:00:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 21:00:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 21:00:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 21:00:53] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 21:00:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 21:00:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 21:00:54] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2023-04-06 21:00:54] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:00:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 314 ms
[2023-04-06 21:00:55] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:00:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 21:00:55] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:00:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 21:00:55] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:00:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-06 21:00:56] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2023-04-06 21:00:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-04-06 21:00:57] [INFO ] Deduced a trap composed of 87 places in 198 ms of which 1 ms to minimize.
[2023-04-06 21:00:57] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 1 ms to minimize.
[2023-04-06 21:00:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2023-04-06 21:00:57] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:00:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 21:00:57] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2023-04-06 21:00:58] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 0 ms to minimize.
[2023-04-06 21:00:58] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-04-06 21:00:58] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2023-04-06 21:00:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 919 ms
[2023-04-06 21:00:58] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 0 ms to minimize.
[2023-04-06 21:00:58] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2023-04-06 21:00:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2023-04-06 21:00:59] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-04-06 21:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 21:00:59] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 0 ms to minimize.
[2023-04-06 21:00:59] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 0 ms to minimize.
[2023-04-06 21:00:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2023-04-06 21:00:59] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2023-04-06 21:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-04-06 21:01:00] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 1 ms to minimize.
[2023-04-06 21:01:00] [INFO ] Deduced a trap composed of 122 places in 181 ms of which 0 ms to minimize.
[2023-04-06 21:01:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 466 ms
[2023-04-06 21:01:01] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 0 ms to minimize.
[2023-04-06 21:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:725)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 21:01:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-06 21:01:01] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:183
Fused 183 Parikh solutions to 146 different solutions.
Parikh walk visited 7 properties in 9104 ms.
Support contains 176 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 14 place count 546 transition count 1841
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 238 place count 434 transition count 1841
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 280 place count 392 transition count 1547
Iterating global reduction 2 with 42 rules applied. Total rules applied 322 place count 392 transition count 1547
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 388 place count 359 transition count 1514
Applied a total of 388 rules in 176 ms. Remains 359 /553 variables (removed 194) and now considering 1514/1960 (removed 446) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 359/553 places, 1514/1960 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21966 ms. (steps per millisecond=45 ) properties (out of 176) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 160) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 159) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 158) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Running SMT prover for 157 properties.
[2023-04-06 21:01:35] [INFO ] Flow matrix only has 555 transitions (discarded 959 similar events)
// Phase 1: matrix 555 rows 359 cols
[2023-04-06 21:01:35] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 21:01:36] [INFO ] After 1095ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:157
[2023-04-06 21:01:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-04-06 21:01:37] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 21:01:41] [INFO ] After 2604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :157
[2023-04-06 21:01:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:01:44] [INFO ] After 3047ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :157
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 0 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 743 ms
[2023-04-06 21:01:44] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 21:01:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 21:01:45] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 21:01:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-06 21:01:45] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 21:01:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:01:45] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2023-04-06 21:01:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:01:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-04-06 21:01:45] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2023-04-06 21:01:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-04-06 21:01:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-04-06 21:01:46] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:01:46] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-04-06 21:01:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-04-06 21:01:46] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-06 21:01:46] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2023-04-06 21:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 21:01:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 21:01:47] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:01:47] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:01:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-04-06 21:01:47] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2023-04-06 21:01:47] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 4 ms to minimize.
[2023-04-06 21:01:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-04-06 21:01:47] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2023-04-06 21:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 21:01:48] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 21:01:48] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:01:49] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2023-04-06 21:01:49] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 0 ms to minimize.
[2023-04-06 21:01:49] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 0 ms to minimize.
[2023-04-06 21:01:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 405 ms
[2023-04-06 21:01:49] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:01:50] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:01:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-04-06 21:01:50] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 3 ms to minimize.
[2023-04-06 21:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:01:51] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 0 ms to minimize.
[2023-04-06 21:01:51] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-04-06 21:01:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-04-06 21:01:51] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 3 ms to minimize.
[2023-04-06 21:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 21:01:52] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2023-04-06 21:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-06 21:01:52] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 21:01:53] [INFO ] After 12064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :157
Attempting to minimize the solution found.
Minimization took 3376 ms.
[2023-04-06 21:01:56] [INFO ] After 19778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :157
Fused 157 Parikh solutions to 113 different solutions.
Parikh walk visited 0 properties in 1407 ms.
Support contains 157 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 1514/1514 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 350 transition count 1505
Applied a total of 18 rules in 50 ms. Remains 350 /359 variables (removed 9) and now considering 1505/1514 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 350/359 places, 1505/1514 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21982 ms. (steps per millisecond=45 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 157) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 154) seen :0
Probabilistic random walk after 10000000 steps, saw 1999545 distinct states, run finished after 61433 ms. (steps per millisecond=162 ) properties seen :150
Running SMT prover for 4 properties.
[2023-04-06 21:03:23] [INFO ] Flow matrix only has 546 transitions (discarded 959 similar events)
// Phase 1: matrix 546 rows 350 cols
[2023-04-06 21:03:23] [INFO ] Computed 22 invariants in 10 ms
[2023-04-06 21:03:23] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 21:03:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:03:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:03:23] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 21:03:23] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:03:23] [INFO ] After 99ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:03:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 975 ms
[2023-04-06 21:03:25] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:03:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 21:03:25] [INFO ] After 1249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-04-06 21:03:25] [INFO ] After 1593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 137 ms.
Support contains 4 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1505/1505 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 350 transition count 1463
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 308 transition count 1463
Applied a total of 84 rules in 44 ms. Remains 308 /350 variables (removed 42) and now considering 1463/1505 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 308/350 places, 1463/1505 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11225 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1542 ms. (steps per millisecond=648 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1540 ms. (steps per millisecond=649 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1534 ms. (steps per millisecond=651 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 9840632 steps, run timeout after 51001 ms. (steps per millisecond=192 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 9840632 steps, saw 1998644 distinct states, run finished after 51003 ms. (steps per millisecond=192 ) properties seen :2
Running SMT prover for 2 properties.
[2023-04-06 21:04:33] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:04:33] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 21:04:33] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:04:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:04:33] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:04:33] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 21:04:34] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:04:34] [INFO ] After 59ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 21:04:34] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 21:04:34] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:04:34] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 21:04:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2023-04-06 21:04:34] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 21:04:34] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 45 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6468 ms. (steps per millisecond=154 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4952320 steps, run timeout after 24001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 4952320 steps, saw 1120675 distinct states, run finished after 24001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 21:05:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:06] [INFO ] Invariant cache hit.
[2023-04-06 21:05:07] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:05:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:05:07] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2023-04-06 21:05:07] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:07] [INFO ] After 55ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:07] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:05:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 21:05:07] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 21:05:07] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:05:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:07] [INFO ] Invariant cache hit.
[2023-04-06 21:05:07] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-04-06 21:05:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:07] [INFO ] Invariant cache hit.
[2023-04-06 21:05:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:08] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2023-04-06 21:05:08] [INFO ] Redundant transitions in 85 ms returned []
[2023-04-06 21:05:08] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:08] [INFO ] Invariant cache hit.
[2023-04-06 21:05:09] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1751 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 965 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 21:05:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:10] [INFO ] Invariant cache hit.
[2023-04-06 21:05:10] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:10] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:10] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-04-06 21:05:10] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:10] [INFO ] After 36ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-04-06 21:05:10] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:05:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:05:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2023-04-06 21:05:10] [INFO ] After 298ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:05:10] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:05:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:10] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:10] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:10] [INFO ] After 36ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:10] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 21:05:10] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6866 ms. (steps per millisecond=145 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4971144 steps, run timeout after 24001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 4971144 steps, saw 1123043 distinct states, run finished after 24001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 21:05:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:43] [INFO ] Invariant cache hit.
[2023-04-06 21:05:43] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:05:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:43] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:44] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:44] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:44] [INFO ] After 57ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:05:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:05:44] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 21:05:44] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:05:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:44] [INFO ] Invariant cache hit.
[2023-04-06 21:05:44] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-04-06 21:05:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:44] [INFO ] Invariant cache hit.
[2023-04-06 21:05:44] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:45] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-04-06 21:05:45] [INFO ] Redundant transitions in 123 ms returned []
[2023-04-06 21:05:45] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:45] [INFO ] Invariant cache hit.
[2023-04-06 21:05:46] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1767 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 756 ms. (steps per millisecond=132 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 21:05:46] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:46] [INFO ] Invariant cache hit.
[2023-04-06 21:05:46] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:46] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:47] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-04-06 21:05:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:47] [INFO ] After 30ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-04-06 21:05:47] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:05:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-04-06 21:05:47] [INFO ] After 282ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:05:47] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:05:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:47] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:47] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:47] [INFO ] After 36ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 21:05:47] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 21:05:47] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 752744 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 752744 steps, saw 243963 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:05:50] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:50] [INFO ] Invariant cache hit.
[2023-04-06 21:05:50] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:05:50] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:50] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:50] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:50] [INFO ] After 38ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:50] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 21:05:50] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-06 21:05:50] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 34 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 761560 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 761560 steps, saw 246400 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:05:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:54] [INFO ] Invariant cache hit.
[2023-04-06 21:05:54] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:54] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:54] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:54] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:54] [INFO ] After 40ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:54] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-06 21:05:54] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-06 21:05:54] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 32 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:05:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:54] [INFO ] Invariant cache hit.
[2023-04-06 21:05:54] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-04-06 21:05:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:54] [INFO ] Invariant cache hit.
[2023-04-06 21:05:54] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:55] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2023-04-06 21:05:55] [INFO ] Redundant transitions in 26 ms returned []
[2023-04-06 21:05:55] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:05:55] [INFO ] Invariant cache hit.
[2023-04-06 21:05:56] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1769 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 29 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2023-04-06 21:05:56] [INFO ] Computed 15 invariants in 2 ms
[2023-04-06 21:05:56] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-04-06 21:05:56] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:05:56] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:56] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:05:56] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 750168 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 750168 steps, saw 243608 distinct states, run finished after 3003 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:05:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:05:59] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 21:05:59] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:05:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:05:59] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:59] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:05:59] [INFO ] After 40ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:05:59] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 21:05:59] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 769776 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 769776 steps, saw 248421 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:06:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:06:02] [INFO ] Invariant cache hit.
[2023-04-06 21:06:02] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:06:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:06:02] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 8 ms returned sat
[2023-04-06 21:06:02] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:06:02] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:06:03] [INFO ] After 42ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:06:03] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-06 21:06:03] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 46 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 42 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:06:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:06:03] [INFO ] Invariant cache hit.
[2023-04-06 21:06:03] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-04-06 21:06:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:06:03] [INFO ] Invariant cache hit.
[2023-04-06 21:06:03] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:06:04] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2023-04-06 21:06:04] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 21:06:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:06:04] [INFO ] Invariant cache hit.
[2023-04-06 21:06:04] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1710 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 23 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2023-04-06 21:06:04] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 21:06:04] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:06:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-04-06 21:06:04] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:06:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:06:04] [INFO ] After 3ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:06:04] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:06:04] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 1347 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 368 place count 100 transition count 177
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 382 place count 93 transition count 177
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 389 place count 93 transition count 170
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 396 place count 93 transition count 163
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 480 place count 51 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 487 place count 51 transition count 121
Applied a total of 487 rules in 24 ms. Remains 51 /308 variables (removed 257) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 21:06:04] [INFO ] Computed 15 invariants in 0 ms
[2023-04-06 21:06:04] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 21:06:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:06:05] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 21:06:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:06:05] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 21:06:05] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 21:06:05] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Unable to solve all queries for examination StableMarking. Remains :2 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 2 properties from file /home/mcc/execution/StableMarking.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 331911 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 07
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 553 places, 1960 transitions, 9212 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 11581636 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16164936 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="EisenbergMcGuire-PT-07"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is EisenbergMcGuire-PT-07, 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 r537-tall-167987255000158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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