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-167987246400250.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-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400250
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680842015916

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-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 04:33:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 04:33:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:33:37] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-04-07 04:33:37] [INFO ] Transformed 553 places.
[2023-04-07 04:33:37] [INFO ] Transformed 1960 transitions.
[2023-04-07 04:33:37] [INFO ] Found NUPN structural information;
[2023-04-07 04:33:37] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 119 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 529 transition count 1792
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 529 transition count 1792
Applied a total of 48 rules in 92 ms. Remains 529 /553 variables (removed 24) and now considering 1792/1960 (removed 168) transitions.
[2023-04-07 04:33:37] [INFO ] Flow matrix only has 833 transitions (discarded 959 similar events)
// Phase 1: matrix 833 rows 529 cols
[2023-04-07 04:33:37] [INFO ] Computed 22 invariants in 23 ms
[2023-04-07 04:33:38] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-04-07 04:33:38] [INFO ] Flow matrix only has 833 transitions (discarded 959 similar events)
[2023-04-07 04:33:38] [INFO ] Invariant cache hit.
[2023-04-07 04:33:38] [INFO ] State equation strengthened by 328 read => feed constraints.
[2023-04-07 04:33:39] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2023-04-07 04:33:39] [INFO ] Flow matrix only has 833 transitions (discarded 959 similar events)
[2023-04-07 04:33:39] [INFO ] Invariant cache hit.
[2023-04-07 04:33:39] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 529/553 places, 1792/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2284 ms. Remains : 529/553 places, 1792/1960 transitions.
Support contains 119 out of 529 places after structural reductions.
[2023-04-07 04:33:40] [INFO ] Flatten gal took : 141 ms
[2023-04-07 04:33:40] [INFO ] Flatten gal took : 140 ms
[2023-04-07 04:33:40] [INFO ] Input system was already deterministic with 1792 transitions.
Support contains 117 out of 529 places (down from 119) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 93) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 78) 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 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 78) 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 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) 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 78) seen :0
Running SMT prover for 78 properties.
[2023-04-07 04:33:41] [INFO ] Flow matrix only has 833 transitions (discarded 959 similar events)
[2023-04-07 04:33:41] [INFO ] Invariant cache hit.
[2023-04-07 04:33:42] [INFO ] After 802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:78
[2023-04-07 04:33:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 04:33:43] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 11 ms returned sat
[2023-04-07 04:33:46] [INFO ] After 2541ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :73
[2023-04-07 04:33:46] [INFO ] State equation strengthened by 328 read => feed constraints.
[2023-04-07 04:33:49] [INFO ] After 3236ms SMT Verify possible using 328 Read/Feed constraints in natural domain returned unsat :5 sat :73
[2023-04-07 04:33:50] [INFO ] Deduced a trap composed of 3 places in 333 ms of which 70 ms to minimize.
[2023-04-07 04:33:50] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 1 ms to minimize.
[2023-04-07 04:33:50] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 1 ms to minimize.
[2023-04-07 04:33:50] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2023-04-07 04:33:50] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 9 ms to minimize.
[2023-04-07 04:33:51] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 04:33:51] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-04-07 04:33:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1490 ms
[2023-04-07 04:33:51] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 12 ms to minimize.
[2023-04-07 04:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-07 04:33:51] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2023-04-07 04:33:51] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2023-04-07 04:33:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-04-07 04:33:51] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 04:33:52] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:33:52] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-04-07 04:33:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2023-04-07 04:33:52] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 3 ms to minimize.
[2023-04-07 04:33:52] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:33:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2023-04-07 04:33:52] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 0 ms to minimize.
[2023-04-07 04:33:52] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 0 ms to minimize.
[2023-04-07 04:33:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-04-07 04:33:52] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2023-04-07 04:33:53] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2023-04-07 04:33:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-04-07 04:33:54] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2023-04-07 04:33:54] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-04-07 04:33:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-04-07 04:33:55] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2023-04-07 04:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-07 04:33:56] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2023-04-07 04:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-07 04:33:56] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2023-04-07 04:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-07 04:33:57] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 3 ms to minimize.
[2023-04-07 04:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-07 04:33:57] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2023-04-07 04:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-07 04:33:57] [INFO ] After 11585ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :72
Attempting to minimize the solution found.
Minimization took 3673 ms.
[2023-04-07 04:34:01] [INFO ] After 19137ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :72
Fused 78 Parikh solutions to 72 different solutions.
Parikh walk visited 0 properties in 2369 ms.
Support contains 91 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 529 transition count 1786
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 523 transition count 1786
Performed 138 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 138 Pre rules applied. Total rules applied 12 place count 523 transition count 1648
Deduced a syphon composed of 138 places in 1 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 288 place count 385 transition count 1648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 382 transition count 1627
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 382 transition count 1627
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 374 place count 342 transition count 1587
Applied a total of 374 rules in 196 ms. Remains 342 /529 variables (removed 187) and now considering 1587/1792 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 342/529 places, 1587/1792 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 72) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) 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 71) seen :0
Interrupted probabilistic random walk after 153304 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{8=1, 13=1, 15=1, 17=1, 21=1, 23=1, 30=1, 33=1, 34=1, 38=1, 41=1, 42=1, 43=1, 51=1, 53=1, 55=1, 62=1, 64=1, 66=1, 70=1}
Probabilistic random walk after 153304 steps, saw 97022 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :20
Running SMT prover for 51 properties.
[2023-04-07 04:34:07] [INFO ] Flow matrix only has 628 transitions (discarded 959 similar events)
// Phase 1: matrix 628 rows 342 cols
[2023-04-07 04:34:07] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:34:08] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:51
[2023-04-07 04:34:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-07 04:34:08] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 9 ms returned sat
[2023-04-07 04:34:10] [INFO ] After 1288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :51
[2023-04-07 04:34:10] [INFO ] State equation strengthened by 310 read => feed constraints.
[2023-04-07 04:34:11] [INFO ] After 1455ms SMT Verify possible using 310 Read/Feed constraints in natural domain returned unsat :0 sat :51
[2023-04-07 04:34:11] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-07 04:34:11] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:34:11] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-07 04:34:11] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 559 ms
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2023-04-07 04:34:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2023-04-07 04:34:12] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 470 ms
[2023-04-07 04:34:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-04-07 04:34:13] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-07 04:34:13] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2023-04-07 04:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-07 04:34:14] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-04-07 04:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-07 04:34:14] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2023-04-07 04:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-07 04:34:14] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-04-07 04:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-07 04:34:15] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-04-07 04:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 04:34:16] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-04-07 04:34:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-07 04:34:16] [INFO ] After 6256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :51
Attempting to minimize the solution found.
Minimization took 1580 ms.
[2023-04-07 04:34:17] [INFO ] After 9721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :51
Parikh walk visited 0 properties in 296 ms.
Support contains 70 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1587/1587 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 342 transition count 1577
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 332 transition count 1577
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 324 transition count 1521
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 324 transition count 1521
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 38 place count 323 transition count 1520
Applied a total of 38 rules in 59 ms. Remains 323 /342 variables (removed 19) and now considering 1520/1587 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 323/342 places, 1520/1587 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) 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 51) seen :0
Interrupted probabilistic random walk after 151984 steps, run timeout after 3003 ms. (steps per millisecond=50 ) properties seen :{40=1, 49=1}
Probabilistic random walk after 151984 steps, saw 88650 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :2
Running SMT prover for 49 properties.
[2023-04-07 04:34:21] [INFO ] Flow matrix only has 561 transitions (discarded 959 similar events)
// Phase 1: matrix 561 rows 323 cols
[2023-04-07 04:34:21] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:34:22] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-04-07 04:34:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 04:34:22] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:34:23] [INFO ] After 1080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2023-04-07 04:34:23] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-04-07 04:34:25] [INFO ] After 1327ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :49
[2023-04-07 04:34:25] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-07 04:34:25] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-07 04:34:25] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:34:25] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:34:25] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2023-04-07 04:34:25] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-07 04:34:25] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-04-07 04:34:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 751 ms
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 4 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 3 ms to minimize.
[2023-04-07 04:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-07 04:34:26] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-04-07 04:34:27] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
[2023-04-07 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-04-07 04:34:27] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 1 ms to minimize.
[2023-04-07 04:34:27] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 0 ms to minimize.
[2023-04-07 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-04-07 04:34:27] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2023-04-07 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-04-07 04:34:27] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-04-07 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-07 04:34:28] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2023-04-07 04:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-07 04:34:28] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-04-07 04:34:28] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2023-04-07 04:34:28] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-04-07 04:34:28] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-04-07 04:34:28] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2023-04-07 04:34:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 440 ms
[2023-04-07 04:34:29] [INFO ] After 6111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 1429 ms.
[2023-04-07 04:34:31] [INFO ] After 9161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Parikh walk visited 0 properties in 300 ms.
Support contains 68 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 1520/1520 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 322 transition count 1513
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 322 transition count 1513
Applied a total of 2 rules in 45 ms. Remains 322 /323 variables (removed 1) and now considering 1513/1520 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 322/323 places, 1513/1520 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :0
Interrupted probabilistic random walk after 136608 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136608 steps, saw 80177 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 49 properties.
[2023-04-07 04:34:35] [INFO ] Flow matrix only has 554 transitions (discarded 959 similar events)
// Phase 1: matrix 554 rows 322 cols
[2023-04-07 04:34:35] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 04:34:35] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-04-07 04:34:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:34:35] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:34:37] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2023-04-07 04:34:37] [INFO ] State equation strengthened by 256 read => feed constraints.
[2023-04-07 04:34:38] [INFO ] After 1304ms SMT Verify possible using 256 Read/Feed constraints in natural domain returned unsat :0 sat :49
[2023-04-07 04:34:38] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-07 04:34:38] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2023-04-07 04:34:38] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2023-04-07 04:34:38] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 798 ms
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 410 ms
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-04-07 04:34:39] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 611 ms
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 04:34:40] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2023-04-07 04:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2023-04-07 04:34:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-04-07 04:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2023-04-07 04:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-04-07 04:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2023-04-07 04:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2023-04-07 04:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-04-07 04:34:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2023-04-07 04:34:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-04-07 04:34:43] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-04-07 04:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-07 04:34:44] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-07 04:34:44] [INFO ] After 7191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 1379 ms.
[2023-04-07 04:34:45] [INFO ] After 10187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Parikh walk visited 0 properties in 333 ms.
Support contains 68 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 1513/1513 transitions.
Applied a total of 0 rules in 31 ms. Remains 322 /322 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 322/322 places, 1513/1513 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 1513/1513 transitions.
Applied a total of 0 rules in 31 ms. Remains 322 /322 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
[2023-04-07 04:34:46] [INFO ] Flow matrix only has 554 transitions (discarded 959 similar events)
[2023-04-07 04:34:46] [INFO ] Invariant cache hit.
[2023-04-07 04:34:46] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-04-07 04:34:46] [INFO ] Flow matrix only has 554 transitions (discarded 959 similar events)
[2023-04-07 04:34:46] [INFO ] Invariant cache hit.
[2023-04-07 04:34:46] [INFO ] State equation strengthened by 256 read => feed constraints.
[2023-04-07 04:34:46] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2023-04-07 04:34:46] [INFO ] Redundant transitions in 85 ms returned []
[2023-04-07 04:34:46] [INFO ] Flow matrix only has 554 transitions (discarded 959 similar events)
[2023-04-07 04:34:46] [INFO ] Invariant cache hit.
[2023-04-07 04:34:47] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1405 ms. Remains : 322/322 places, 1513/1513 transitions.
Graph (trivial) has 814 edges and 322 vertex of which 46 / 322 are part of one of the 7 SCC in 2 ms
Free SCC test removed 39 places
Drop transitions removed 142 transitions
Ensure Unique test removed 956 transitions
Reduce isomorphic transitions removed 1098 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 283 transition count 379
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 247 transition count 379
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 73 place count 247 transition count 367
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 101 place count 231 transition count 367
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 211 place count 176 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 218 place count 176 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 174 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 225 place count 174 transition count 318
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 252 place count 174 transition count 291
Free-agglomeration rule applied 65 times.
Iterating global reduction 4 with 65 rules applied. Total rules applied 317 place count 174 transition count 226
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 382 place count 109 transition count 226
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 390 place count 109 transition count 226
Applied a total of 390 rules in 40 ms. Remains 109 /322 variables (removed 213) and now considering 226/1513 (removed 1287) transitions.
Running SMT prover for 49 properties.
// Phase 1: matrix 226 rows 109 cols
[2023-04-07 04:34:47] [INFO ] Computed 18 invariants in 1 ms
[2023-04-07 04:34:47] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-04-07 04:34:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:34:47] [INFO ] [Nat]Absence check using 15 positive and 3 generalized place invariants in 7 ms returned sat
[2023-04-07 04:34:48] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2023-04-07 04:34:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-07 04:34:48] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2023-04-07 04:34:48] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2023-04-07 04:34:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-04-07 04:34:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 136 ms
[2023-04-07 04:34:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-04-07 04:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 04:34:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-04-07 04:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-07 04:34:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-04-07 04:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 04:34:49] [INFO ] After 1278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-04-07 04:34:49] [INFO ] After 1887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA EisenbergMcGuire-PT-07-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 04:34:49] [INFO ] Flatten gal took : 81 ms
[2023-04-07 04:34:49] [INFO ] Flatten gal took : 67 ms
[2023-04-07 04:34:49] [INFO ] Input system was already deterministic with 1792 transitions.
Support contains 86 out of 529 places (down from 89) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 529 transition count 1785
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 522 transition count 1785
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 522 transition count 1631
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 368 transition count 1631
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 340 place count 350 transition count 1505
Iterating global reduction 2 with 18 rules applied. Total rules applied 358 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 442 place count 308 transition count 1463
Applied a total of 442 rules in 149 ms. Remains 308 /529 variables (removed 221) and now considering 1463/1792 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 150 ms. Remains : 308/529 places, 1463/1792 transitions.
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 46 ms
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 44 ms
[2023-04-07 04:34:50] [INFO ] Input system was already deterministic with 1463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 512 transition count 1673
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 512 transition count 1673
Applied a total of 34 rules in 26 ms. Remains 512 /529 variables (removed 17) and now considering 1673/1792 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 512/529 places, 1673/1792 transitions.
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 42 ms
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 62 ms
[2023-04-07 04:34:50] [INFO ] Input system was already deterministic with 1673 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 513 transition count 1680
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 513 transition count 1680
Applied a total of 32 rules in 38 ms. Remains 513 /529 variables (removed 16) and now considering 1680/1792 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 513/529 places, 1680/1792 transitions.
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 55 ms
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 52 ms
[2023-04-07 04:34:50] [INFO ] Input system was already deterministic with 1680 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 513 transition count 1680
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 513 transition count 1680
Applied a total of 32 rules in 49 ms. Remains 513 /529 variables (removed 16) and now considering 1680/1792 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 513/529 places, 1680/1792 transitions.
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 36 ms
[2023-04-07 04:34:50] [INFO ] Flatten gal took : 53 ms
[2023-04-07 04:34:51] [INFO ] Input system was already deterministic with 1680 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 511 transition count 1666
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 511 transition count 1666
Applied a total of 36 rules in 39 ms. Remains 511 /529 variables (removed 18) and now considering 1666/1792 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 511/529 places, 1666/1792 transitions.
[2023-04-07 04:34:51] [INFO ] Flatten gal took : 46 ms
[2023-04-07 04:34:51] [INFO ] Flatten gal took : 36 ms
[2023-04-07 04:34:51] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 529 transition count 1785
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 522 transition count 1785
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 522 transition count 1631
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 368 transition count 1631
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 339 place count 351 transition count 1512
Iterating global reduction 2 with 17 rules applied. Total rules applied 356 place count 351 transition count 1512
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 440 place count 309 transition count 1470
Applied a total of 440 rules in 98 ms. Remains 309 /529 variables (removed 220) and now considering 1470/1792 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 98 ms. Remains : 309/529 places, 1470/1792 transitions.
[2023-04-07 04:34:51] [INFO ] Flatten gal took : 33 ms
[2023-04-07 04:34:51] [INFO ] Flatten gal took : 35 ms
[2023-04-07 04:34:51] [INFO ] Input system was already deterministic with 1470 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 77885 steps, run visited all 1 properties in 372 ms. (steps per millisecond=209 )
Probabilistic random walk after 77885 steps, saw 46209 distinct states, run finished after 372 ms. (steps per millisecond=209 ) properties seen :1
FORMULA EisenbergMcGuire-PT-07-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 529 transition count 1785
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 522 transition count 1785
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 522 transition count 1631
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 368 transition count 1631
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 340 place count 350 transition count 1505
Iterating global reduction 2 with 18 rules applied. Total rules applied 358 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 442 place count 308 transition count 1463
Applied a total of 442 rules in 76 ms. Remains 308 /529 variables (removed 221) and now considering 1463/1792 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 308/529 places, 1463/1792 transitions.
[2023-04-07 04:34:52] [INFO ] Flatten gal took : 39 ms
[2023-04-07 04:34:52] [INFO ] Flatten gal took : 33 ms
[2023-04-07 04:34:52] [INFO ] Input system was already deterministic with 1463 transitions.
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 685760 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685760 steps, saw 244809 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:34:55] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:34:55] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 04:34:55] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:34:55] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-07 04:34:55] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:34:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-04-07 04:34:55] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:34:55] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:55] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:34:55] [INFO ] After 51ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:55] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2023-04-07 04:34:55] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 04:34:55] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-04-07 04:34:56] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-04-07 04:34:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-07 04:34:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-04-07 04:34:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 489 ms
[2023-04-07 04:34:56] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 04:34:56] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 52 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=301 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 04:34:56] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:34:56] [INFO ] Invariant cache hit.
[2023-04-07 04:34:56] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:34:56] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:34:56] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 04:34:56] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:34:56] [INFO ] After 93ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 04:34:57] [INFO ] After 167ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:34:57] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:34:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:34:57] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:34:57] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:57] [INFO ] After 27ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:34:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-07 04:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-07 04:34:57] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 04:34:57] [INFO ] After 262ms 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 1861 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1435848 steps, run timeout after 6001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 1435848 steps, saw 409976 distinct states, run finished after 6001 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:35:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:35:05] [INFO ] Invariant cache hit.
[2023-04-07 04:35:05] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:05] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:35:05] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:35:05] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:35:05] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:06] [INFO ] After 51ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:06] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 04:35:06] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:35:06] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:35:06] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:35:06] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-07 04:35:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-07 04:35:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 481 ms
[2023-04-07 04:35:06] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 04:35:06] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 42 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 42 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:35:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:35:06] [INFO ] Invariant cache hit.
[2023-04-07 04:35:06] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-04-07 04:35:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:35:06] [INFO ] Invariant cache hit.
[2023-04-07 04:35:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:07] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2023-04-07 04:35:07] [INFO ] Redundant transitions in 70 ms returned []
[2023-04-07 04:35:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:35:07] [INFO ] Invariant cache hit.
[2023-04-07 04:35:08] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1710 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=483 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 04:35:08] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:35:08] [INFO ] Invariant cache hit.
[2023-04-07 04:35:08] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:08] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:35:08] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 04:35:08] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:35:08] [INFO ] After 24ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 04:35:08] [INFO ] After 65ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:08] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:08] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:35:08] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:08] [INFO ] After 26ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:08] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-07 04:35:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-07 04:35:08] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 04:35:08] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 629 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=209 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 233326 steps, run visited all 1 properties in 1000 ms. (steps per millisecond=233 )
Probabilistic random walk after 233326 steps, saw 113866 distinct states, run finished after 1001 ms. (steps per millisecond=233 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 378 place count 94 transition count 179
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 94 transition count 173
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 391 place count 94 transition count 166
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 434 place count 94 transition count 123
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 477 place count 51 transition count 123
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 484 place count 51 transition count 123
Applied a total of 484 rules in 20 ms. Remains 51 /308 variables (removed 257) and now considering 123/1463 (removed 1340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 51 cols
[2023-04-07 04:35:10] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 04:35:10] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:35:10] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:35:10] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:35:10] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:10] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 04:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 04:35:10] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 04:35:10] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 511 transition count 1666
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 511 transition count 1666
Applied a total of 36 rules in 18 ms. Remains 511 /529 variables (removed 18) and now considering 1666/1792 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 511/529 places, 1666/1792 transitions.
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 32 ms
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 37 ms
[2023-04-07 04:35:10] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 511 transition count 1666
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 511 transition count 1666
Applied a total of 36 rules in 15 ms. Remains 511 /529 variables (removed 18) and now considering 1666/1792 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 511/529 places, 1666/1792 transitions.
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 31 ms
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 35 ms
[2023-04-07 04:35:10] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 511 transition count 1666
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 511 transition count 1666
Applied a total of 36 rules in 16 ms. Remains 511 /529 variables (removed 18) and now considering 1666/1792 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 511/529 places, 1666/1792 transitions.
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 32 ms
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 36 ms
[2023-04-07 04:35:10] [INFO ] Input system was already deterministic with 1666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 512 transition count 1673
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 512 transition count 1673
Applied a total of 34 rules in 17 ms. Remains 512 /529 variables (removed 17) and now considering 1673/1792 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 512/529 places, 1673/1792 transitions.
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 31 ms
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 34 ms
[2023-04-07 04:35:10] [INFO ] Input system was already deterministic with 1673 transitions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 513 transition count 1680
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 513 transition count 1680
Applied a total of 32 rules in 15 ms. Remains 513 /529 variables (removed 16) and now considering 1680/1792 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 513/529 places, 1680/1792 transitions.
[2023-04-07 04:35:10] [INFO ] Flatten gal took : 31 ms
[2023-04-07 04:35:11] [INFO ] Flatten gal took : 34 ms
[2023-04-07 04:35:11] [INFO ] Input system was already deterministic with 1680 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 529 transition count 1785
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 522 transition count 1785
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 522 transition count 1633
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 370 transition count 1633
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 335 place count 353 transition count 1514
Iterating global reduction 2 with 17 rules applied. Total rules applied 352 place count 353 transition count 1514
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 436 place count 311 transition count 1472
Applied a total of 436 rules in 70 ms. Remains 311 /529 variables (removed 218) and now considering 1472/1792 (removed 320) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 311/529 places, 1472/1792 transitions.
[2023-04-07 04:35:11] [INFO ] Flatten gal took : 28 ms
[2023-04-07 04:35:11] [INFO ] Flatten gal took : 31 ms
[2023-04-07 04:35:11] [INFO ] Input system was already deterministic with 1472 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 723624 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 723624 steps, saw 269645 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:35:14] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
// Phase 1: matrix 513 rows 311 cols
[2023-04-07 04:35:14] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 04:35:14] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:14] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:35:14] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:14] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:35:14] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:14] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:35:14] [INFO ] After 54ms SMT Verify possible using 226 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:14] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-07 04:35:14] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-07 04:35:14] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2023-04-07 04:35:14] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2023-04-07 04:35:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-04-07 04:35:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-04-07 04:35:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-07 04:35:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 534 ms
[2023-04-07 04:35:15] [INFO ] After 612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 04:35:15] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 32 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 311/311 places, 1472/1472 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1882 ms. (steps per millisecond=531 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1466520 steps, run timeout after 6018 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 1466520 steps, saw 455853 distinct states, run finished after 6018 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:35:23] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2023-04-07 04:35:23] [INFO ] Invariant cache hit.
[2023-04-07 04:35:23] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 04:35:23] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:35:23] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:35:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:35:23] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:24] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:35:24] [INFO ] After 57ms SMT Verify possible using 226 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-04-07 04:35:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 770 ms
[2023-04-07 04:35:24] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-07 04:35:24] [INFO ] After 1086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 35 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 311/311 places, 1472/1472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 36 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
[2023-04-07 04:35:24] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2023-04-07 04:35:24] [INFO ] Invariant cache hit.
[2023-04-07 04:35:25] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-04-07 04:35:25] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2023-04-07 04:35:25] [INFO ] Invariant cache hit.
[2023-04-07 04:35:25] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:35:26] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2023-04-07 04:35:26] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-07 04:35:26] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2023-04-07 04:35:26] [INFO ] Invariant cache hit.
[2023-04-07 04:35:26] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1687 ms. Remains : 311/311 places, 1472/1472 transitions.
Graph (trivial) has 1327 edges and 311 vertex of which 48 / 311 are part of one of the 7 SCC in 1 ms
Free SCC test removed 41 places
Drop transitions removed 157 transitions
Ensure Unique test removed 931 transitions
Reduce isomorphic transitions removed 1088 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 270 transition count 323
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 209 transition count 322
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 208 transition count 321
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 126 place count 208 transition count 308
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 157 place count 190 transition count 308
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 323 place count 107 transition count 225
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 363 place count 107 transition count 185
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 373 place count 102 transition count 186
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 377 place count 102 transition count 182
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 381 place count 102 transition count 178
Free-agglomeration rule applied 42 times.
Iterating global reduction 5 with 42 rules applied. Total rules applied 423 place count 102 transition count 136
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 465 place count 60 transition count 136
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 472 place count 60 transition count 136
Applied a total of 472 rules in 23 ms. Remains 60 /311 variables (removed 251) and now considering 136/1472 (removed 1336) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 60 cols
[2023-04-07 04:35:26] [INFO ] Computed 17 invariants in 13 ms
[2023-04-07 04:35:26] [INFO ] [Real]Absence check using 15 positive place invariants in 27 ms returned sat
[2023-04-07 04:35:26] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 04:35:26] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:35:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:35:26] [INFO ] [Nat]Absence check using 15 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 04:35:26] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 04:35:26] [INFO ] After 10ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:35:26] [INFO ] After 21ms 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 04:35:26] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 513 transition count 1680
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 513 transition count 1680
Applied a total of 32 rules in 16 ms. Remains 513 /529 variables (removed 16) and now considering 1680/1792 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 513/529 places, 1680/1792 transitions.
[2023-04-07 04:35:26] [INFO ] Flatten gal took : 30 ms
[2023-04-07 04:35:26] [INFO ] Flatten gal took : 34 ms
[2023-04-07 04:35:27] [INFO ] Input system was already deterministic with 1680 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 1792/1792 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 529 transition count 1785
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 522 transition count 1785
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 522 transition count 1633
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 370 transition count 1633
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 335 place count 353 transition count 1514
Iterating global reduction 2 with 17 rules applied. Total rules applied 352 place count 353 transition count 1514
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 432 place count 313 transition count 1474
Applied a total of 432 rules in 61 ms. Remains 313 /529 variables (removed 216) and now considering 1474/1792 (removed 318) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 313/529 places, 1474/1792 transitions.
[2023-04-07 04:35:27] [INFO ] Flatten gal took : 27 ms
[2023-04-07 04:35:27] [INFO ] Flatten gal took : 30 ms
[2023-04-07 04:35:27] [INFO ] Input system was already deterministic with 1474 transitions.
[2023-04-07 04:35:27] [INFO ] Flatten gal took : 37 ms
[2023-04-07 04:35:27] [INFO ] Flatten gal took : 39 ms
[2023-04-07 04:35:27] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 04:35:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 529 places, 1792 transitions and 8540 arcs took 10 ms.
Total runtime 110034 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/1064/ctl_0_ --ctl=/tmp/1064/ctl_1_ --ctl=/tmp/1064/ctl_2_ --ctl=/tmp/1064/ctl_3_ --ctl=/tmp/1064/ctl_4_ --ctl=/tmp/1064/ctl_5_ --ctl=/tmp/1064/ctl_6_ --ctl=/tmp/1064/ctl_7_ --ctl=/tmp/1064/ctl_8_ --ctl=/tmp/1064/ctl_9_ --ctl=/tmp/1064/ctl_10_ --ctl=/tmp/1064/ctl_11_ --ctl=/tmp/1064/ctl_12_ --ctl=/tmp/1064/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14909588 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102528 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-07"
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-07, 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-167987246400250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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