About the Execution of LTSMin+red for EisenbergMcGuire-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1352.168 | 3600000.00 | 14092621.00 | 549.60 | ?????FT????????F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246400242.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400242
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 753K 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-06-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680838598592
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-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 03:36:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:36:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:36:40] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2023-04-07 03:36:40] [INFO ] Transformed 414 places.
[2023-04-07 03:36:40] [INFO ] Transformed 1296 transitions.
[2023-04-07 03:36:40] [INFO ] Found NUPN structural information;
[2023-04-07 03:36:40] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 126 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 404 transition count 1236
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 404 transition count 1236
Applied a total of 20 rules in 109 ms. Remains 404 /414 variables (removed 10) and now considering 1236/1296 (removed 60) transitions.
[2023-04-07 03:36:41] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
// Phase 1: matrix 642 rows 404 cols
[2023-04-07 03:36:41] [INFO ] Computed 19 invariants in 29 ms
[2023-04-07 03:36:41] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-04-07 03:36:41] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
[2023-04-07 03:36:41] [INFO ] Invariant cache hit.
[2023-04-07 03:36:42] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-04-07 03:36:42] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1482 ms to find 0 implicit places.
[2023-04-07 03:36:42] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
[2023-04-07 03:36:42] [INFO ] Invariant cache hit.
[2023-04-07 03:36:43] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/414 places, 1236/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2196 ms. Remains : 404/414 places, 1236/1296 transitions.
Support contains 126 out of 404 places after structural reductions.
[2023-04-07 03:36:43] [INFO ] Flatten gal took : 143 ms
[2023-04-07 03:36:43] [INFO ] Flatten gal took : 111 ms
[2023-04-07 03:36:44] [INFO ] Input system was already deterministic with 1236 transitions.
Support contains 122 out of 404 places (down from 126) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 115) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 82) 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 82) 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 81) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 80) 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 80) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 80) 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 80) 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 80) 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 80) 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 80) 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 80) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 80) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) 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 80) seen :0
Running SMT prover for 80 properties.
[2023-04-07 03:36:45] [INFO ] Flow matrix only has 642 transitions (discarded 594 similar events)
[2023-04-07 03:36:45] [INFO ] Invariant cache hit.
[2023-04-07 03:36:46] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 03:36:46] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 03:36:47] [INFO ] After 2089ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:79
[2023-04-07 03:36:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 03:36:48] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 03:36:51] [INFO ] After 2165ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :77
[2023-04-07 03:36:51] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-04-07 03:36:53] [INFO ] After 2453ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :3 sat :77
[2023-04-07 03:36:53] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 3 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 13 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 702 ms
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 26 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 0 ms to minimize.
[2023-04-07 03:36:55] [INFO ] Deduced a trap composed of 19 places in 783 ms of which 0 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 1 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2197 ms
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 0 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 758 ms
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 1 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 0 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-04-07 03:37:00] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 0 ms to minimize.
[2023-04-07 03:37:00] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 0 ms to minimize.
[2023-04-07 03:37:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2023-04-07 03:37:00] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 1 ms to minimize.
[2023-04-07 03:37:01] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 1 ms to minimize.
[2023-04-07 03:37:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2023-04-07 03:37:02] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2023-04-07 03:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-07 03:37:02] [INFO ] After 11587ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :76
Attempting to minimize the solution found.
Minimization took 2784 ms.
[2023-04-07 03:37:05] [INFO ] After 17716ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :76
Fused 80 Parikh solutions to 76 different solutions.
Parikh walk visited 0 properties in 2279 ms.
Support contains 81 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 404 transition count 1234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 402 transition count 1234
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 4 place count 402 transition count 1135
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 202 place count 303 transition count 1135
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 212 place count 293 transition count 1075
Iterating global reduction 2 with 10 rules applied. Total rules applied 222 place count 293 transition count 1075
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 280 place count 264 transition count 1046
Applied a total of 280 rules in 139 ms. Remains 264 /404 variables (removed 140) and now considering 1046/1236 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 264/404 places, 1046/1236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 76) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) 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 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 75) 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 75) 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 75) 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 75) seen :0
Interrupted probabilistic random walk after 172578 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{5=1, 6=1, 18=1, 19=1, 24=1, 26=1, 29=1, 34=1, 42=1, 44=1, 49=1, 52=1, 53=1, 63=1, 64=1, 67=1, 69=1, 70=1, 71=1, 72=1, 74=1}
Probabilistic random walk after 172578 steps, saw 82097 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :21
Running SMT prover for 54 properties.
[2023-04-07 03:37:11] [INFO ] Flow matrix only has 452 transitions (discarded 594 similar events)
// Phase 1: matrix 452 rows 264 cols
[2023-04-07 03:37:11] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 03:37:11] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 03:37:11] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:37:12] [INFO ] After 1337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:54
[2023-04-07 03:37:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 03:37:13] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:37:14] [INFO ] After 918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :54
[2023-04-07 03:37:14] [INFO ] State equation strengthened by 214 read => feed constraints.
[2023-04-07 03:37:15] [INFO ] After 1078ms SMT Verify possible using 214 Read/Feed constraints in natural domain returned unsat :0 sat :54
[2023-04-07 03:37:15] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-04-07 03:37:15] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-07 03:37:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-04-07 03:37:15] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
[2023-04-07 03:37:15] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
[2023-04-07 03:37:15] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-04-07 03:37:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 219 ms
[2023-04-07 03:37:15] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 03:37:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-07 03:37:15] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 515 ms
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-07 03:37:16] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-04-07 03:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-07 03:37:17] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2023-04-07 03:37:17] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2023-04-07 03:37:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2023-04-07 03:37:17] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-04-07 03:37:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 03:37:17] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-07 03:37:17] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-04-07 03:37:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-04-07 03:37:17] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2023-04-07 03:37:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 03:37:18] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-04-07 03:37:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-07 03:37:18] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2023-04-07 03:37:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-07 03:37:18] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 9 ms to minimize.
[2023-04-07 03:37:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-07 03:37:19] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-04-07 03:37:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-07 03:37:19] [INFO ] After 5191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :54
Attempting to minimize the solution found.
Minimization took 1250 ms.
[2023-04-07 03:37:20] [INFO ] After 7839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :54
Parikh walk visited 0 properties in 207 ms.
Support contains 61 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1046/1046 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 264 transition count 1037
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 255 transition count 1037
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 248 transition count 995
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 248 transition count 995
Applied a total of 32 rules in 44 ms. Remains 248 /264 variables (removed 16) and now considering 995/1046 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 248/264 places, 995/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) seen :0
Interrupted probabilistic random walk after 168581 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{14=1}
Probabilistic random walk after 168581 steps, saw 67413 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :1
Running SMT prover for 53 properties.
[2023-04-07 03:37:24] [INFO ] Flow matrix only has 401 transitions (discarded 594 similar events)
// Phase 1: matrix 401 rows 248 cols
[2023-04-07 03:37:24] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 03:37:24] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 03:37:24] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 03:37:25] [INFO ] After 745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:53
[2023-04-07 03:37:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 03:37:25] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 03:37:26] [INFO ] After 825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :53
[2023-04-07 03:37:26] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-07 03:37:27] [INFO ] After 1015ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :53
[2023-04-07 03:37:27] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-07 03:37:27] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-04-07 03:37:27] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 437 ms
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 2 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 4 ms to minimize.
[2023-04-07 03:37:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2023-04-07 03:37:28] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 412 ms
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-04-07 03:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-07 03:37:29] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2023-04-07 03:37:30] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 8 ms to minimize.
[2023-04-07 03:37:30] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-04-07 03:37:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2023-04-07 03:37:30] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2023-04-07 03:37:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 03:37:30] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2023-04-07 03:37:30] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-04-07 03:37:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-04-07 03:37:31] [INFO ] After 5033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :53
Attempting to minimize the solution found.
Minimization took 1097 ms.
[2023-04-07 03:37:32] [INFO ] After 7404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :53
Parikh walk visited 0 properties in 388 ms.
Support contains 61 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 995/995 transitions.
Applied a total of 0 rules in 53 ms. Remains 248 /248 variables (removed 0) and now considering 995/995 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 248/248 places, 995/995 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 53) 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 53) 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 53) 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 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Interrupted probabilistic random walk after 184457 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184457 steps, saw 72131 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 52 properties.
[2023-04-07 03:37:36] [INFO ] Flow matrix only has 401 transitions (discarded 594 similar events)
[2023-04-07 03:37:36] [INFO ] Invariant cache hit.
[2023-04-07 03:37:37] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 03:37:37] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 03:37:37] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-04-07 03:37:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 03:37:37] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:37:38] [INFO ] After 807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-04-07 03:37:39] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-07 03:37:40] [INFO ] After 1029ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :52
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 636 ms
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 03:37:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-04-07 03:37:40] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 356 ms
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 0 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-04-07 03:37:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-04-07 03:37:42] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-04-07 03:37:42] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-04-07 03:37:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-04-07 03:37:42] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-04-07 03:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-07 03:37:42] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-04-07 03:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 03:37:42] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2023-04-07 03:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-07 03:37:43] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-04-07 03:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-07 03:37:43] [INFO ] After 4732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :52
Attempting to minimize the solution found.
Minimization took 1076 ms.
[2023-04-07 03:37:44] [INFO ] After 7086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :52
Parikh walk visited 0 properties in 413 ms.
Support contains 60 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 995/995 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 248 transition count 994
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 994
Applied a total of 2 rules in 42 ms. Remains 247 /248 variables (removed 1) and now considering 994/995 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 247/248 places, 994/995 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Interrupted probabilistic random walk after 226422 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226422 steps, saw 80417 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 52 properties.
[2023-04-07 03:37:48] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
// Phase 1: matrix 400 rows 247 cols
[2023-04-07 03:37:48] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 03:37:49] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 03:37:49] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:37:49] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-04-07 03:37:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 03:37:49] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:37:50] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-04-07 03:37:50] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-07 03:37:51] [INFO ] After 983ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :52
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2023-04-07 03:37:52] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 0 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 0 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1238 ms
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 241 ms
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-04-07 03:37:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 0 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-04-07 03:37:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2023-04-07 03:37:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-04-07 03:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-07 03:37:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2023-04-07 03:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-07 03:37:56] [INFO ] After 5344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :52
Attempting to minimize the solution found.
Minimization took 1042 ms.
[2023-04-07 03:37:57] [INFO ] After 7627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :52
Parikh walk visited 0 properties in 414 ms.
Support contains 60 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 994/994 transitions.
Applied a total of 0 rules in 47 ms. Remains 247 /247 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 247/247 places, 994/994 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 994/994 transitions.
Applied a total of 0 rules in 64 ms. Remains 247 /247 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2023-04-07 03:37:57] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
[2023-04-07 03:37:57] [INFO ] Invariant cache hit.
[2023-04-07 03:37:58] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-04-07 03:37:58] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
[2023-04-07 03:37:58] [INFO ] Invariant cache hit.
[2023-04-07 03:37:58] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-07 03:37:58] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-04-07 03:37:58] [INFO ] Redundant transitions in 52 ms returned []
[2023-04-07 03:37:58] [INFO ] Flow matrix only has 400 transitions (discarded 594 similar events)
[2023-04-07 03:37:58] [INFO ] Invariant cache hit.
[2023-04-07 03:37:58] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1146 ms. Remains : 247/247 places, 994/994 transitions.
Graph (trivial) has 458 edges and 247 vertex of which 32 / 247 are part of one of the 6 SCC in 3 ms
Free SCC test removed 26 places
Drop transitions removed 97 transitions
Ensure Unique test removed 582 transitions
Reduce isomorphic transitions removed 679 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 221 transition count 290
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 196 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 194 transition count 288
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 55 place count 194 transition count 279
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 76 place count 182 transition count 279
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 140 place count 150 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 150 transition count 245
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 150 place count 146 transition count 259
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 158 place count 146 transition count 251
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 175 place count 146 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 145 transition count 235
Free-agglomeration rule applied 35 times.
Iterating global reduction 5 with 35 rules applied. Total rules applied 212 place count 145 transition count 200
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 247 place count 110 transition count 200
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 253 place count 110 transition count 200
Applied a total of 253 rules in 43 ms. Remains 110 /247 variables (removed 137) and now considering 200/994 (removed 794) transitions.
Running SMT prover for 52 properties.
// Phase 1: matrix 200 rows 110 cols
[2023-04-07 03:37:58] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 03:37:59] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 03:37:59] [INFO ] [Real]Absence check using 13 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 03:37:59] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-04-07 03:37:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 03:37:59] [INFO ] [Nat]Absence check using 13 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 03:38:00] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-04-07 03:38:00] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 14 ms to minimize.
[2023-04-07 03:38:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-04-07 03:38:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-07 03:38:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 118 ms
[2023-04-07 03:38:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-07 03:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 03:38:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-07 03:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 03:38:00] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2023-04-07 03:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-07 03:38:00] [INFO ] After 1236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :52
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-04-07 03:38:01] [INFO ] After 1849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :52
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA EisenbergMcGuire-PT-06-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:38:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 03:38:01] [INFO ] Flatten gal took : 80 ms
FORMULA EisenbergMcGuire-PT-06-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:38:01] [INFO ] Flatten gal took : 83 ms
[2023-04-07 03:38:01] [INFO ] Input system was already deterministic with 1236 transitions.
Support contains 101 out of 404 places (down from 113) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 386 transition count 1128
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 386 transition count 1128
Applied a total of 36 rules in 26 ms. Remains 386 /404 variables (removed 18) and now considering 1128/1236 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 386/404 places, 1128/1236 transitions.
[2023-04-07 03:38:01] [INFO ] Flatten gal took : 57 ms
[2023-04-07 03:38:01] [INFO ] Flatten gal took : 50 ms
[2023-04-07 03:38:01] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 404 transition count 1231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 399 transition count 1231
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 10 place count 399 transition count 1119
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 234 place count 287 transition count 1119
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 252 place count 269 transition count 1011
Iterating global reduction 2 with 18 rules applied. Total rules applied 270 place count 269 transition count 1011
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 10 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 328 place count 240 transition count 982
Applied a total of 328 rules in 110 ms. Remains 240 /404 variables (removed 164) and now considering 982/1236 (removed 254) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 121 ms. Remains : 240/404 places, 982/1236 transitions.
[2023-04-07 03:38:02] [INFO ] Flatten gal took : 39 ms
[2023-04-07 03:38:02] [INFO ] Flatten gal took : 33 ms
[2023-04-07 03:38:02] [INFO ] Input system was already deterministic with 982 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 28 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-07 03:38:02] [INFO ] Flatten gal took : 42 ms
[2023-04-07 03:38:02] [INFO ] Flatten gal took : 60 ms
[2023-04-07 03:38:02] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 29 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-07 03:38:02] [INFO ] Flatten gal took : 58 ms
[2023-04-07 03:38:02] [INFO ] Flatten gal took : 44 ms
[2023-04-07 03:38:02] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 386 transition count 1128
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 386 transition count 1128
Applied a total of 36 rules in 42 ms. Remains 386 /404 variables (removed 18) and now considering 1128/1236 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 386/404 places, 1128/1236 transitions.
[2023-04-07 03:38:02] [INFO ] Flatten gal took : 58 ms
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 52 ms
[2023-04-07 03:38:03] [INFO ] Input system was already deterministic with 1128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 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 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 398 transition count 1116
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 284 transition count 1116
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 260 place count 264 transition count 996
Iterating global reduction 2 with 20 rules applied. Total rules applied 280 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 340 place count 234 transition count 966
Applied a total of 340 rules in 73 ms. Remains 234 /404 variables (removed 170) and now considering 966/1236 (removed 270) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 234/404 places, 966/1236 transitions.
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 35 ms
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 24 ms
[2023-04-07 03:38:03] [INFO ] Input system was already deterministic with 966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3575 steps, run visited all 1 properties in 17 ms. (steps per millisecond=210 )
Probabilistic random walk after 3575 steps, saw 2699 distinct states, run finished after 33 ms. (steps per millisecond=108 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 404 transition count 1231
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 399 transition count 1231
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 10 place count 399 transition count 1118
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 236 place count 286 transition count 1118
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 256 place count 266 transition count 998
Iterating global reduction 2 with 20 rules applied. Total rules applied 276 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 336 place count 236 transition count 968
Applied a total of 336 rules in 73 ms. Remains 236 /404 variables (removed 168) and now considering 968/1236 (removed 268) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 236/404 places, 968/1236 transitions.
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 20 ms
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 23 ms
[2023-04-07 03:38:03] [INFO ] Input system was already deterministic with 968 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 10 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 22 ms
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 24 ms
[2023-04-07 03:38:03] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 389 transition count 1146
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 389 transition count 1146
Applied a total of 30 rules in 19 ms. Remains 389 /404 variables (removed 15) and now considering 1146/1236 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 389/404 places, 1146/1236 transitions.
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 55 ms
[2023-04-07 03:38:03] [INFO ] Flatten gal took : 42 ms
[2023-04-07 03:38:03] [INFO ] Input system was already deterministic with 1146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 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 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 398 transition count 1116
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 284 transition count 1116
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 260 place count 264 transition count 996
Iterating global reduction 2 with 20 rules applied. Total rules applied 280 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 340 place count 234 transition count 966
Applied a total of 340 rules in 88 ms. Remains 234 /404 variables (removed 170) and now considering 966/1236 (removed 270) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 234/404 places, 966/1236 transitions.
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 30 ms
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 52 ms
[2023-04-07 03:38:04] [INFO ] Input system was already deterministic with 966 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 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 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 12 place count 398 transition count 1120
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 232 place count 288 transition count 1120
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 249 place count 271 transition count 1018
Iterating global reduction 2 with 17 rules applied. Total rules applied 266 place count 271 transition count 1018
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 326 place count 241 transition count 988
Applied a total of 326 rules in 63 ms. Remains 241 /404 variables (removed 163) and now considering 988/1236 (removed 248) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 241/404 places, 988/1236 transitions.
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 37 ms
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 25 ms
[2023-04-07 03:38:04] [INFO ] Input system was already deterministic with 988 transitions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 384 transition count 1116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 384 transition count 1116
Applied a total of 40 rules in 10 ms. Remains 384 /404 variables (removed 20) and now considering 1116/1236 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 384/404 places, 1116/1236 transitions.
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 22 ms
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 25 ms
[2023-04-07 03:38:04] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 404/404 places, 1236/1236 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 404 transition count 1230
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 398 transition count 1230
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 398 transition count 1116
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 284 transition count 1116
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 260 place count 264 transition count 996
Iterating global reduction 2 with 20 rules applied. Total rules applied 280 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 340 place count 234 transition count 966
Applied a total of 340 rules in 78 ms. Remains 234 /404 variables (removed 170) and now considering 966/1236 (removed 270) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 234/404 places, 966/1236 transitions.
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 54 ms
[2023-04-07 03:38:04] [INFO ] Flatten gal took : 31 ms
[2023-04-07 03:38:04] [INFO ] Input system was already deterministic with 966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 829927 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{}
Probabilistic random walk after 829927 steps, saw 200601 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 03:38:08] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 03:38:08] [INFO ] Computed 19 invariants in 7 ms
[2023-04-07 03:38:08] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 03:38:08] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:38:08] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:38:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 03:38:08] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:38:08] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:08] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 03:38:08] [INFO ] After 47ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-04-07 03:38:08] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 03:38:08] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-07 03:38:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-04-07 03:38:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 284 ms
[2023-04-07 03:38:08] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 03:38:08] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 03:38:09] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 03:38:09] [INFO ] Invariant cache hit.
[2023-04-07 03:38:09] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-04-07 03:38:09] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 30 ms returned sat
[2023-04-07 03:38:09] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 03:38:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 03:38:09] [INFO ] After 16ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 03:38:09] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:38:09] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:38:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 03:38:09] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:38:09] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:09] [INFO ] After 21ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:09] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-07 03:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-04-07 03:38:09] [INFO ] After 95ms 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 03:38:09] [INFO ] After 217ms 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 1743 ms. (steps per millisecond=573 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1797887 steps, run timeout after 6001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 1797887 steps, saw 377090 distinct states, run finished after 6001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 03:38:18] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 03:38:18] [INFO ] Invariant cache hit.
[2023-04-07 03:38:18] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 03:38:18] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:38:18] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:38:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 03:38:18] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:38:18] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:18] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 03:38:18] [INFO ] After 33ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:18] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-04-07 03:38:18] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-07 03:38:18] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-04-07 03:38:18] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2023-04-07 03:38:18] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-04-07 03:38:18] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2023-04-07 03:38:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 561 ms
[2023-04-07 03:38:18] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-07 03:38:18] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 31 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 03:38:18] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 03:38:19] [INFO ] Invariant cache hit.
[2023-04-07 03:38:19] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-04-07 03:38:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 03:38:19] [INFO ] Invariant cache hit.
[2023-04-07 03:38:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 03:38:20] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2023-04-07 03:38:20] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-07 03:38:20] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 03:38:20] [INFO ] Invariant cache hit.
[2023-04-07 03:38:20] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1952 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 03:38:21] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 03:38:21] [INFO ] Invariant cache hit.
[2023-04-07 03:38:21] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 03:38:21] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 03:38:21] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 03:38:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 03:38:21] [INFO ] After 51ms SMT Verify possible using 164 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-04-07 03:38:21] [INFO ] After 81ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:38:21] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:38:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 03:38:21] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 03:38:21] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:21] [INFO ] After 33ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:21] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-07 03:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-07 03:38:21] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-04-07 03:38:21] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 104 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7859 steps, run visited all 1 properties in 37 ms. (steps per millisecond=212 )
Probabilistic random walk after 7859 steps, saw 5466 distinct states, run finished after 38 ms. (steps per millisecond=206 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 54 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-07 03:38:21] [INFO ] Computed 13 invariants in 0 ms
[2023-04-07 03:38:21] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 03:38:22] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 03:38:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 03:38:22] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 03:38:22] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 03:38:22] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 20 ms to minimize.
[2023-04-07 03:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-07 03:38:22] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 03:38:22] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1236/1236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 386 transition count 1128
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 386 transition count 1128
Applied a total of 36 rules in 21 ms. Remains 386 /404 variables (removed 18) and now considering 1128/1236 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 386/404 places, 1128/1236 transitions.
[2023-04-07 03:38:22] [INFO ] Flatten gal took : 23 ms
[2023-04-07 03:38:22] [INFO ] Flatten gal took : 25 ms
[2023-04-07 03:38:22] [INFO ] Input system was already deterministic with 1128 transitions.
[2023-04-07 03:38:22] [INFO ] Flatten gal took : 27 ms
[2023-04-07 03:38:22] [INFO ] Flatten gal took : 27 ms
[2023-04-07 03:38:22] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2023-04-07 03:38:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 404 places, 1236 transitions and 5736 arcs took 6 ms.
Total runtime 101958 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/1053/ctl_0_ --ctl=/tmp/1053/ctl_1_ --ctl=/tmp/1053/ctl_2_ --ctl=/tmp/1053/ctl_3_ --ctl=/tmp/1053/ctl_4_ --ctl=/tmp/1053/ctl_5_ --ctl=/tmp/1053/ctl_6_ --ctl=/tmp/1053/ctl_7_ --ctl=/tmp/1053/ctl_8_ --ctl=/tmp/1053/ctl_9_ --ctl=/tmp/1053/ctl_10_ --ctl=/tmp/1053/ctl_11_ --ctl=/tmp/1053/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14859440 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105352 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-06"
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-06, 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-167987246400242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 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 '
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 ;