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.r521-tall-167987246400258.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 ltsminxred
Input is EisenbergMcGuire-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 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 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 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.7M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680845531576

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 05:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 05:32:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:32:14] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2023-04-07 05:32:14] [INFO ] Transformed 712 places.
[2023-04-07 05:32:14] [INFO ] Transformed 2816 transitions.
[2023-04-07 05:32:14] [INFO ] Found NUPN structural information;
[2023-04-07 05:32:14] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 590 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 160 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 682 transition count 2576
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 682 transition count 2576
Applied a total of 60 rules in 154 ms. Remains 682 /712 variables (removed 30) and now considering 2576/2816 (removed 240) transitions.
[2023-04-07 05:32:14] [INFO ] Flow matrix only has 1128 transitions (discarded 1448 similar events)
// Phase 1: matrix 1128 rows 682 cols
[2023-04-07 05:32:15] [INFO ] Computed 25 invariants in 25 ms
[2023-04-07 05:32:15] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-04-07 05:32:15] [INFO ] Flow matrix only has 1128 transitions (discarded 1448 similar events)
[2023-04-07 05:32:15] [INFO ] Invariant cache hit.
[2023-04-07 05:32:16] [INFO ] State equation strengthened by 466 read => feed constraints.
[2023-04-07 05:32:18] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 3276 ms to find 0 implicit places.
[2023-04-07 05:32:18] [INFO ] Flow matrix only has 1128 transitions (discarded 1448 similar events)
[2023-04-07 05:32:18] [INFO ] Invariant cache hit.
[2023-04-07 05:32:19] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 682/712 places, 2576/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4547 ms. Remains : 682/712 places, 2576/2816 transitions.
Support contains 160 out of 682 places after structural reductions.
[2023-04-07 05:32:19] [INFO ] Flatten gal took : 227 ms
[2023-04-07 05:32:20] [INFO ] Flatten gal took : 192 ms
[2023-04-07 05:32:20] [INFO ] Input system was already deterministic with 2576 transitions.
Support contains 159 out of 682 places (down from 160) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 132) seen :24
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 108) 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 108) 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 108) 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 108) 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 108) 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 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 108) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) 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 108) seen :0
Running SMT prover for 108 properties.
[2023-04-07 05:32:21] [INFO ] Flow matrix only has 1128 transitions (discarded 1448 similar events)
[2023-04-07 05:32:21] [INFO ] Invariant cache hit.
[2023-04-07 05:32:23] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2023-04-07 05:32:23] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-07 05:32:23] [INFO ] After 1693ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:107
[2023-04-07 05:32:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2023-04-07 05:32:24] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-07 05:32:30] [INFO ] After 4993ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :100
[2023-04-07 05:32:30] [INFO ] State equation strengthened by 466 read => feed constraints.
[2023-04-07 05:32:36] [INFO ] After 6099ms SMT Verify possible using 466 Read/Feed constraints in natural domain returned unsat :8 sat :100
[2023-04-07 05:32:37] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 5 ms to minimize.
[2023-04-07 05:32:37] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 1 ms to minimize.
[2023-04-07 05:32:37] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2023-04-07 05:32:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 747 ms
[2023-04-07 05:32:38] [INFO ] Deduced a trap composed of 3 places in 613 ms of which 1 ms to minimize.
[2023-04-07 05:32:38] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2023-04-07 05:32:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 958 ms
[2023-04-07 05:32:38] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 0 ms to minimize.
[2023-04-07 05:32:39] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2023-04-07 05:32:39] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 9 ms to minimize.
[2023-04-07 05:32:39] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2023-04-07 05:32:39] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2023-04-07 05:32:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 940 ms
[2023-04-07 05:32:39] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2023-04-07 05:32:40] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-07 05:32:40] [INFO ] Deduced a trap composed of 160 places in 280 ms of which 0 ms to minimize.
[2023-04-07 05:32:40] [INFO ] Deduced a trap composed of 128 places in 314 ms of which 3 ms to minimize.
[2023-04-07 05:32:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1052 ms
[2023-04-07 05:32:40] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2023-04-07 05:32:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-04-07 05:32:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-07 05:32:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-07 05:32:41] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 0 ms to minimize.
[2023-04-07 05:32:41] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2023-04-07 05:32:41] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2023-04-07 05:32:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2023-04-07 05:32:42] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2023-04-07 05:32:42] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-07 05:32:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2023-04-07 05:32:42] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-04-07 05:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-07 05:32:42] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-04-07 05:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-07 05:32:43] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 1 ms to minimize.
[2023-04-07 05:32:43] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2023-04-07 05:32:43] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2023-04-07 05:32:43] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2023-04-07 05:32:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 828 ms
[2023-04-07 05:32:44] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 1 ms to minimize.
[2023-04-07 05:32:44] [INFO ] Deduced a trap composed of 147 places in 254 ms of which 1 ms to minimize.
[2023-04-07 05:32:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 629 ms
[2023-04-07 05:32:45] [INFO ] Deduced a trap composed of 143 places in 259 ms of which 0 ms to minimize.
[2023-04-07 05:32:45] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 1 ms to minimize.
[2023-04-07 05:32:45] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 1 ms to minimize.
[2023-04-07 05:32:46] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2023-04-07 05:32:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1088 ms
[2023-04-07 05:32:46] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 0 ms to minimize.
[2023-04-07 05:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-04-07 05:32:46] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 4 ms to minimize.
[2023-04-07 05:32:46] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2023-04-07 05:32:47] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-04-07 05:32:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 606 ms
[2023-04-07 05:32:47] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-04-07 05:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-04-07 05:32:48] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-04-07 05:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-07 05:32:48] [INFO ] After 17698ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :97
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-07 05:32:48] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :97
Fused 108 Parikh solutions to 98 different solutions.
Parikh walk visited 1 properties in 4093 ms.
Support contains 127 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 682 transition count 2574
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 680 transition count 2574
Performed 181 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 181 Pre rules applied. Total rules applied 4 place count 680 transition count 2393
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 366 place count 499 transition count 2393
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 373 place count 492 transition count 2337
Iterating global reduction 2 with 7 rules applied. Total rules applied 380 place count 492 transition count 2337
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 482 place count 441 transition count 2286
Applied a total of 482 rules in 340 ms. Remains 441 /682 variables (removed 241) and now considering 2286/2576 (removed 290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 441/682 places, 2286/2576 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 97) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 94) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 94) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 93) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 93) seen :0
Interrupted probabilistic random walk after 80667 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{0=1, 6=1, 7=1, 9=1, 12=1, 15=1, 21=1, 23=1, 24=1, 29=1, 35=1, 36=1, 52=1, 57=1, 59=1, 66=1, 72=1, 73=1, 87=1, 91=1, 92=1}
Probabilistic random walk after 80667 steps, saw 58287 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :21
Running SMT prover for 72 properties.
[2023-04-07 05:32:56] [INFO ] Flow matrix only has 838 transitions (discarded 1448 similar events)
// Phase 1: matrix 838 rows 441 cols
[2023-04-07 05:32:56] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 05:32:57] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:32:57] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:32:57] [INFO ] After 828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:72
[2023-04-07 05:32:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:32:58] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:33:01] [INFO ] After 2395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :72
[2023-04-07 05:33:01] [INFO ] State equation strengthened by 417 read => feed constraints.
[2023-04-07 05:33:04] [INFO ] After 3051ms SMT Verify possible using 417 Read/Feed constraints in natural domain returned unsat :0 sat :72
[2023-04-07 05:33:04] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 8 ms to minimize.
[2023-04-07 05:33:04] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 1 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 0 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 3 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-04-07 05:33:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1709 ms
[2023-04-07 05:33:06] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-04-07 05:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-07 05:33:06] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-07 05:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-07 05:33:06] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 3 ms to minimize.
[2023-04-07 05:33:06] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2023-04-07 05:33:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-04-07 05:33:07] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-07 05:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-07 05:33:07] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 0 ms to minimize.
[2023-04-07 05:33:07] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-04-07 05:33:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-04-07 05:33:08] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-04-07 05:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-07 05:33:08] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
[2023-04-07 05:33:08] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-04-07 05:33:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-04-07 05:33:08] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-04-07 05:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-07 05:33:09] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2023-04-07 05:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-07 05:33:09] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-04-07 05:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-07 05:33:10] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2023-04-07 05:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 05:33:10] [INFO ] Deduced a trap composed of 110 places in 213 ms of which 0 ms to minimize.
[2023-04-07 05:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-04-07 05:33:10] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-07 05:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-07 05:33:11] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2023-04-07 05:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-07 05:33:11] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2023-04-07 05:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-07 05:33:12] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 7 ms to minimize.
[2023-04-07 05:33:12] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-04-07 05:33:12] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 3 ms to minimize.
[2023-04-07 05:33:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 510 ms
[2023-04-07 05:33:12] [INFO ] Deduced a trap composed of 120 places in 166 ms of which 1 ms to minimize.
[2023-04-07 05:33:12] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2023-04-07 05:33:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2023-04-07 05:33:13] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-04-07 05:33:13] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-04-07 05:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2023-04-07 05:33:13] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2023-04-07 05:33:13] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-04-07 05:33:13] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2023-04-07 05:33:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 391 ms
[2023-04-07 05:33:14] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2023-04-07 05:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-04-07 05:33:14] [INFO ] After 13607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :72
Attempting to minimize the solution found.
Minimization took 3531 ms.
[2023-04-07 05:33:18] [INFO ] After 20591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :72
Parikh walk visited 0 properties in 746 ms.
Support contains 104 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 2286/2286 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 441 transition count 2275
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 430 transition count 2275
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 423 transition count 2219
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 423 transition count 2219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 421 transition count 2217
Applied a total of 40 rules in 260 ms. Remains 421 /441 variables (removed 20) and now considering 2217/2286 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 421/441 places, 2217/2286 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 72) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 72) seen :0
Interrupted probabilistic random walk after 89775 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{2=1, 24=1, 36=1, 48=1, 62=1, 70=1}
Probabilistic random walk after 89775 steps, saw 61266 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :6
Running SMT prover for 66 properties.
[2023-04-07 05:33:22] [INFO ] Flow matrix only has 769 transitions (discarded 1448 similar events)
// Phase 1: matrix 769 rows 421 cols
[2023-04-07 05:33:22] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 05:33:23] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:33:23] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:33:23] [INFO ] After 947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:66
[2023-04-07 05:33:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:33:24] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:33:27] [INFO ] After 2252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :66
[2023-04-07 05:33:27] [INFO ] State equation strengthened by 368 read => feed constraints.
[2023-04-07 05:33:29] [INFO ] After 2559ms SMT Verify possible using 368 Read/Feed constraints in natural domain returned unsat :0 sat :66
[2023-04-07 05:33:29] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-07 05:33:29] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 05:33:30] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-04-07 05:33:30] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-04-07 05:33:30] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 05:33:30] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-07 05:33:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 782 ms
[2023-04-07 05:33:30] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-04-07 05:33:30] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-04-07 05:33:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-04-07 05:33:31] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 0 ms to minimize.
[2023-04-07 05:33:31] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 0 ms to minimize.
[2023-04-07 05:33:31] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 0 ms to minimize.
[2023-04-07 05:33:31] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 1 ms to minimize.
[2023-04-07 05:33:32] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-04-07 05:33:32] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 0 ms to minimize.
[2023-04-07 05:33:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1482 ms
[2023-04-07 05:33:32] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2023-04-07 05:33:32] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2023-04-07 05:33:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-04-07 05:33:33] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-07 05:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-07 05:33:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2023-04-07 05:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-07 05:33:33] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2023-04-07 05:33:33] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 0 ms to minimize.
[2023-04-07 05:33:33] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2023-04-07 05:33:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 362 ms
[2023-04-07 05:33:34] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-04-07 05:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-04-07 05:33:34] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2023-04-07 05:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-04-07 05:33:34] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2023-04-07 05:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-07 05:33:34] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 0 ms to minimize.
[2023-04-07 05:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-07 05:33:34] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2023-04-07 05:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-07 05:33:35] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2023-04-07 05:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-07 05:33:35] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-04-07 05:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-07 05:33:36] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2023-04-07 05:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-04-07 05:33:36] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 1 ms to minimize.
[2023-04-07 05:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-04-07 05:33:37] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2023-04-07 05:33:37] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-04-07 05:33:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-04-07 05:33:37] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2023-04-07 05:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-07 05:33:38] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2023-04-07 05:33:38] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2023-04-07 05:33:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2023-04-07 05:33:38] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2023-04-07 05:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-04-07 05:33:39] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 0 ms to minimize.
[2023-04-07 05:33:39] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 0 ms to minimize.
[2023-04-07 05:33:39] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 1 ms to minimize.
[2023-04-07 05:33:40] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 1 ms to minimize.
[2023-04-07 05:33:40] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 1 ms to minimize.
[2023-04-07 05:33:40] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 0 ms to minimize.
[2023-04-07 05:33:40] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 0 ms to minimize.
[2023-04-07 05:33:41] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 0 ms to minimize.
[2023-04-07 05:33:41] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 30 ms to minimize.
[2023-04-07 05:33:41] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 1 ms to minimize.
[2023-04-07 05:33:41] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 1 ms to minimize.
[2023-04-07 05:33:42] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 1 ms to minimize.
[2023-04-07 05:33:42] [INFO ] Deduced a trap composed of 64 places in 344 ms of which 1 ms to minimize.
[2023-04-07 05:33:42] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 0 ms to minimize.
[2023-04-07 05:33:43] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 0 ms to minimize.
[2023-04-07 05:33:43] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 1 ms to minimize.
[2023-04-07 05:33:43] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 0 ms to minimize.
[2023-04-07 05:33:43] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 0 ms to minimize.
[2023-04-07 05:33:43] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 0 ms to minimize.
[2023-04-07 05:33:43] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5019 ms
[2023-04-07 05:33:43] [INFO ] After 16876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :66
Attempting to minimize the solution found.
Minimization took 3021 ms.
[2023-04-07 05:33:47] [INFO ] After 23228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :66
Parikh walk visited 0 properties in 425 ms.
Support contains 97 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 2217/2217 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 421 transition count 2215
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 419 transition count 2215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 417 transition count 2199
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 417 transition count 2199
Applied a total of 8 rules in 109 ms. Remains 417 /421 variables (removed 4) and now considering 2199/2217 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 417/421 places, 2199/2217 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 66) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 65) seen :0
Interrupted probabilistic random walk after 102924 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{2=1, 32=1}
Probabilistic random walk after 102924 steps, saw 68866 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :2
Running SMT prover for 63 properties.
[2023-04-07 05:33:51] [INFO ] Flow matrix only has 751 transitions (discarded 1448 similar events)
// Phase 1: matrix 751 rows 417 cols
[2023-04-07 05:33:51] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:33:51] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:33:51] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2023-04-07 05:33:51] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:63
[2023-04-07 05:33:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 05:33:52] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:33:54] [INFO ] After 1881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :63
[2023-04-07 05:33:54] [INFO ] State equation strengthened by 354 read => feed constraints.
[2023-04-07 05:33:56] [INFO ] After 2483ms SMT Verify possible using 354 Read/Feed constraints in natural domain returned unsat :0 sat :63
[2023-04-07 05:33:57] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 0 ms to minimize.
[2023-04-07 05:33:57] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2023-04-07 05:33:57] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2023-04-07 05:33:57] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-07 05:33:57] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 05:33:57] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2023-04-07 05:33:58] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 0 ms to minimize.
[2023-04-07 05:33:58] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-04-07 05:33:58] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2023-04-07 05:33:58] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-04-07 05:33:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1717 ms
[2023-04-07 05:33:58] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-07 05:33:58] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2023-04-07 05:33:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-04-07 05:33:59] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-04-07 05:33:59] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-07 05:33:59] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2023-04-07 05:33:59] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2023-04-07 05:33:59] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-04-07 05:33:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 764 ms
[2023-04-07 05:33:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-07 05:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-07 05:34:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-04-07 05:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-04-07 05:34:00] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-04-07 05:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-07 05:34:00] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2023-04-07 05:34:00] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2023-04-07 05:34:00] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-04-07 05:34:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 373 ms
[2023-04-07 05:34:01] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2023-04-07 05:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-04-07 05:34:01] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2023-04-07 05:34:01] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-04-07 05:34:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-04-07 05:34:01] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2023-04-07 05:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-04-07 05:34:02] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2023-04-07 05:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-07 05:34:02] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2023-04-07 05:34:02] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2023-04-07 05:34:02] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-04-07 05:34:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2023-04-07 05:34:02] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-04-07 05:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-07 05:34:03] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-04-07 05:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-07 05:34:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 05:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-07 05:34:03] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-04-07 05:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-07 05:34:04] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2023-04-07 05:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 05:34:05] [INFO ] After 11228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :63
Attempting to minimize the solution found.
Minimization took 3588 ms.
[2023-04-07 05:34:09] [INFO ] After 17540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :63
Parikh walk visited 0 properties in 431 ms.
Support contains 92 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 2199/2199 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 417 transition count 2198
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 416 transition count 2198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 414 transition count 2182
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 414 transition count 2182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 413 transition count 2181
Applied a total of 8 rules in 98 ms. Remains 413 /417 variables (removed 4) and now considering 2181/2199 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 413/417 places, 2181/2199 transitions.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2023-04-07 05:34:09] [INFO ] Flatten gal took : 85 ms
[2023-04-07 05:34:09] [INFO ] Flatten gal took : 81 ms
[2023-04-07 05:34:10] [INFO ] Input system was already deterministic with 2576 transitions.
Support contains 142 out of 682 places (down from 144) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 658 transition count 2384
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 658 transition count 2384
Applied a total of 48 rules in 72 ms. Remains 658 /682 variables (removed 24) and now considering 2384/2576 (removed 192) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 658/682 places, 2384/2576 transitions.
[2023-04-07 05:34:10] [INFO ] Flatten gal took : 67 ms
[2023-04-07 05:34:10] [INFO ] Flatten gal took : 82 ms
[2023-04-07 05:34:10] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 656 transition count 2368
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 656 transition count 2368
Applied a total of 52 rules in 56 ms. Remains 656 /682 variables (removed 26) and now considering 2368/2576 (removed 208) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 656/682 places, 2368/2576 transitions.
[2023-04-07 05:34:10] [INFO ] Flatten gal took : 124 ms
[2023-04-07 05:34:10] [INFO ] Flatten gal took : 124 ms
[2023-04-07 05:34:11] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 657 transition count 2376
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 657 transition count 2376
Applied a total of 50 rules in 137 ms. Remains 657 /682 variables (removed 25) and now considering 2376/2576 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 657/682 places, 2376/2576 transitions.
[2023-04-07 05:34:11] [INFO ] Flatten gal took : 61 ms
[2023-04-07 05:34:11] [INFO ] Flatten gal took : 66 ms
[2023-04-07 05:34:11] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 682 transition count 2568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 674 transition count 2568
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 674 transition count 2368
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 474 transition count 2368
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 441 place count 449 transition count 2168
Iterating global reduction 2 with 25 rules applied. Total rules applied 466 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 578 place count 393 transition count 2112
Applied a total of 578 rules in 458 ms. Remains 393 /682 variables (removed 289) and now considering 2112/2576 (removed 464) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 460 ms. Remains : 393/682 places, 2112/2576 transitions.
[2023-04-07 05:34:12] [INFO ] Flatten gal took : 58 ms
[2023-04-07 05:34:12] [INFO ] Flatten gal took : 81 ms
[2023-04-07 05:34:12] [INFO ] Input system was already deterministic with 2112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 659 transition count 2392
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 659 transition count 2392
Applied a total of 46 rules in 56 ms. Remains 659 /682 variables (removed 23) and now considering 2392/2576 (removed 184) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 659/682 places, 2392/2576 transitions.
[2023-04-07 05:34:12] [INFO ] Flatten gal took : 106 ms
[2023-04-07 05:34:12] [INFO ] Flatten gal took : 144 ms
[2023-04-07 05:34:13] [INFO ] Input system was already deterministic with 2392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 659 transition count 2392
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 659 transition count 2392
Applied a total of 46 rules in 56 ms. Remains 659 /682 variables (removed 23) and now considering 2392/2576 (removed 184) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 659/682 places, 2392/2576 transitions.
[2023-04-07 05:34:13] [INFO ] Flatten gal took : 152 ms
[2023-04-07 05:34:13] [INFO ] Flatten gal took : 128 ms
[2023-04-07 05:34:13] [INFO ] Input system was already deterministic with 2392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 658 transition count 2384
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 658 transition count 2384
Applied a total of 48 rules in 24 ms. Remains 658 /682 variables (removed 24) and now considering 2384/2576 (removed 192) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 658/682 places, 2384/2576 transitions.
[2023-04-07 05:34:13] [INFO ] Flatten gal took : 51 ms
[2023-04-07 05:34:13] [INFO ] Flatten gal took : 70 ms
[2023-04-07 05:34:13] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 658 transition count 2384
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 658 transition count 2384
Applied a total of 48 rules in 22 ms. Remains 658 /682 variables (removed 24) and now considering 2384/2576 (removed 192) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 658/682 places, 2384/2576 transitions.
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 59 ms
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 70 ms
[2023-04-07 05:34:14] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 660 transition count 2400
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 660 transition count 2400
Applied a total of 44 rules in 21 ms. Remains 660 /682 variables (removed 22) and now considering 2400/2576 (removed 176) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 660/682 places, 2400/2576 transitions.
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 48 ms
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 71 ms
[2023-04-07 05:34:14] [INFO ] Input system was already deterministic with 2400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 658 transition count 2384
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 658 transition count 2384
Applied a total of 48 rules in 38 ms. Remains 658 /682 variables (removed 24) and now considering 2384/2576 (removed 192) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 658/682 places, 2384/2576 transitions.
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 60 ms
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 51 ms
[2023-04-07 05:34:14] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 656 transition count 2368
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 656 transition count 2368
Applied a total of 52 rules in 22 ms. Remains 656 /682 variables (removed 26) and now considering 2368/2576 (removed 208) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 656/682 places, 2368/2576 transitions.
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 46 ms
[2023-04-07 05:34:14] [INFO ] Flatten gal took : 53 ms
[2023-04-07 05:34:14] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 659 transition count 2392
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 659 transition count 2392
Applied a total of 46 rules in 54 ms. Remains 659 /682 variables (removed 23) and now considering 2392/2576 (removed 184) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 659/682 places, 2392/2576 transitions.
[2023-04-07 05:34:15] [INFO ] Flatten gal took : 59 ms
[2023-04-07 05:34:15] [INFO ] Flatten gal took : 51 ms
[2023-04-07 05:34:15] [INFO ] Input system was already deterministic with 2392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 658 transition count 2384
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 658 transition count 2384
Applied a total of 48 rules in 25 ms. Remains 658 /682 variables (removed 24) and now considering 2384/2576 (removed 192) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 658/682 places, 2384/2576 transitions.
[2023-04-07 05:34:15] [INFO ] Flatten gal took : 50 ms
[2023-04-07 05:34:15] [INFO ] Flatten gal took : 58 ms
[2023-04-07 05:34:15] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 682 transition count 2568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 674 transition count 2568
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 674 transition count 2368
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 474 transition count 2368
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 442 place count 448 transition count 2160
Iterating global reduction 2 with 26 rules applied. Total rules applied 468 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 580 place count 392 transition count 2104
Applied a total of 580 rules in 122 ms. Remains 392 /682 variables (removed 290) and now considering 2104/2576 (removed 472) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 122 ms. Remains : 392/682 places, 2104/2576 transitions.
[2023-04-07 05:34:15] [INFO ] Flatten gal took : 41 ms
[2023-04-07 05:34:15] [INFO ] Flatten gal took : 57 ms
[2023-04-07 05:34:15] [INFO ] Input system was already deterministic with 2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518247 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518247 steps, saw 269387 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:34:18] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:34:19] [INFO ] Computed 25 invariants in 43 ms
[2023-04-07 05:34:19] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:34:19] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:34:19] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:34:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:34:19] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:34:19] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:19] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:34:19] [INFO ] After 107ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 0 ms to minimize.
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2023-04-07 05:34:20] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 05:34:21] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-04-07 05:34:21] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-04-07 05:34:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1455 ms
[2023-04-07 05:34:21] [INFO ] After 1599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-07 05:34:21] [INFO ] After 1909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 60 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 05:34:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:34:21] [INFO ] Invariant cache hit.
[2023-04-07 05:34:21] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:34:21] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:34:21] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 05:34:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:34:21] [INFO ] After 53ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 05:34:22] [INFO ] Deduced a trap composed of 3 places in 570 ms of which 0 ms to minimize.
[2023-04-07 05:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 621 ms
[2023-04-07 05:34:22] [INFO ] After 691ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:34:22] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:34:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-04-07 05:34:22] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:34:22] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:22] [INFO ] After 43ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:23] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-07 05:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-07 05:34:23] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 05:34:23] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2361 ms. (steps per millisecond=423 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1074096 steps, run timeout after 6001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 1074096 steps, saw 484675 distinct states, run finished after 6001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:34:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:34:32] [INFO ] Invariant cache hit.
[2023-04-07 05:34:32] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-07 05:34:32] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:34:32] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:34:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:34:32] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:34:32] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:32] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:34:32] [INFO ] After 80ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:32] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 1 ms to minimize.
[2023-04-07 05:34:33] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2023-04-07 05:34:33] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 05:34:33] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 1 ms to minimize.
[2023-04-07 05:34:33] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2023-04-07 05:34:33] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-07 05:34:33] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-07 05:34:34] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2023-04-07 05:34:34] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 0 ms to minimize.
[2023-04-07 05:34:34] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2023-04-07 05:34:34] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2023-04-07 05:34:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1601 ms
[2023-04-07 05:34:34] [INFO ] After 1713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 05:34:34] [INFO ] After 2008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:34:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:34:34] [INFO ] Invariant cache hit.
[2023-04-07 05:34:35] [INFO ] Implicit Places using invariants in 842 ms returned []
[2023-04-07 05:34:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:34:35] [INFO ] Invariant cache hit.
[2023-04-07 05:34:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:34:36] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2023-04-07 05:34:37] [INFO ] Redundant transitions in 120 ms returned []
[2023-04-07 05:34:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:34:37] [INFO ] Invariant cache hit.
[2023-04-07 05:34:37] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3214 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=389 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 05:34:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:34:38] [INFO ] Invariant cache hit.
[2023-04-07 05:34:38] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-07 05:34:38] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:34:38] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 05:34:38] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:34:38] [INFO ] After 29ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 05:34:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-07 05:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-07 05:34:38] [INFO ] After 137ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:34:38] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:34:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:34:38] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:34:38] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:38] [INFO ] After 53ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:38] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-07 05:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-07 05:34:38] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 05:34:38] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 498 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=249 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 93886 steps, run visited all 1 properties in 484 ms. (steps per millisecond=193 )
Probabilistic random walk after 93886 steps, saw 60395 distinct states, run finished after 485 ms. (steps per millisecond=193 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 42 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 05:34:39] [INFO ] Computed 17 invariants in 0 ms
[2023-04-07 05:34:39] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 05:34:39] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:34:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 131 ms returned sat
[2023-04-07 05:34:39] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 05:34:39] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:34:39] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 05:34:39] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 657 transition count 2376
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 657 transition count 2376
Applied a total of 50 rules in 68 ms. Remains 657 /682 variables (removed 25) and now considering 2376/2576 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 657/682 places, 2376/2576 transitions.
[2023-04-07 05:34:39] [INFO ] Flatten gal took : 47 ms
[2023-04-07 05:34:39] [INFO ] Flatten gal took : 54 ms
[2023-04-07 05:34:40] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2576/2576 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 660 transition count 2400
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 660 transition count 2400
Applied a total of 44 rules in 53 ms. Remains 660 /682 variables (removed 22) and now considering 2400/2576 (removed 176) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 660/682 places, 2400/2576 transitions.
[2023-04-07 05:34:40] [INFO ] Flatten gal took : 49 ms
[2023-04-07 05:34:40] [INFO ] Flatten gal took : 54 ms
[2023-04-07 05:34:40] [INFO ] Input system was already deterministic with 2400 transitions.
[2023-04-07 05:34:40] [INFO ] Flatten gal took : 59 ms
[2023-04-07 05:34:40] [INFO ] Flatten gal took : 57 ms
[2023-04-07 05:34:40] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-04-07 05:34:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 682 places, 2576 transitions and 12480 arcs took 19 ms.
Total runtime 146606 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1138/ctl_0_ --ctl=/tmp/1138/ctl_1_ --ctl=/tmp/1138/ctl_2_ --ctl=/tmp/1138/ctl_3_ --ctl=/tmp/1138/ctl_4_ --ctl=/tmp/1138/ctl_5_ --ctl=/tmp/1138/ctl_6_ --ctl=/tmp/1138/ctl_7_ --ctl=/tmp/1138/ctl_8_ --ctl=/tmp/1138/ctl_9_ --ctl=/tmp/1138/ctl_10_ --ctl=/tmp/1138/ctl_11_ --ctl=/tmp/1138/ctl_12_ --ctl=/tmp/1138/ctl_13_ --ctl=/tmp/1138/ctl_14_ --ctl=/tmp/1138/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15262536 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100560 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 CTLFireability -timeout 360 -rebuildPNML
mcc2023

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-08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ltsminxred"
echo " Input is EisenbergMcGuire-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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