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.r313-tall-167873966100402.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is PolyORBNT-COL-S05J30, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r313-tall-167873966100402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678891281026

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J30
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:41:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:41:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:41:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 14:41:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:41:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 970 ms
[2023-03-15 14:41:23] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 19 ms.
[2023-03-15 14:41:23] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 48 ms.
[2023-03-15 14:41:23] [INFO ] Unfolded 38 HLPN properties in 7 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:41:23] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 14:41:23] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 14:41:23] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 30 places in 8 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 682 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 36) seen :29
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 171 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 14:41:24] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-15 14:41:24] [INFO ] Computed 82 place invariants in 48 ms
[2023-03-15 14:41:25] [INFO ] [Real]Absence check using 75 positive place invariants in 25 ms returned sat
[2023-03-15 14:41:25] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:41:25] [INFO ] After 399ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-15 14:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:41:25] [INFO ] After 73ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-15 14:41:25] [INFO ] Deduced a trap composed of 263 places in 205 ms of which 5 ms to minimize.
[2023-03-15 14:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-15 14:41:26] [INFO ] After 469ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 14:41:26] [INFO ] After 1391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-15 14:41:26] [INFO ] [Nat]Absence check using 75 positive place invariants in 50 ms returned sat
[2023-03-15 14:41:26] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:41:26] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 14:41:27] [INFO ] After 158ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 14:41:27] [INFO ] Deduced a trap composed of 267 places in 210 ms of which 5 ms to minimize.
[2023-03-15 14:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-15 14:41:27] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-15 14:41:27] [INFO ] After 1569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 179 ms.
Support contains 11 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 484 transition count 710
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 75 place count 449 transition count 710
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 75 place count 449 transition count 677
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 141 place count 416 transition count 677
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 415 transition count 676
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 415 transition count 676
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 413 transition count 674
Applied a total of 147 rules in 148 ms. Remains 413 /489 variables (removed 76) and now considering 674/745 (removed 71) transitions.
[2023-03-15 14:41:27] [INFO ] Flow matrix only has 670 transitions (discarded 4 similar events)
// Phase 1: matrix 670 rows 413 cols
[2023-03-15 14:41:28] [INFO ] Computed 77 place invariants in 17 ms
[2023-03-15 14:41:28] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 413/489 places, 579/745 transitions.
Applied a total of 0 rules in 24 ms. Remains 413 /413 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 413/489 places, 579/745 transitions.
Incomplete random walk after 1000000 steps, including 44386 resets, run finished after 3187 ms. (steps per millisecond=313 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5377 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:41:32] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2023-03-15 14:41:32] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-15 14:41:32] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 14:41:32] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:41:32] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:41:32] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 14:41:32] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:41:32] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:41:32] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 1 ms to minimize.
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 127 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 133 places in 119 ms of which 1 ms to minimize.
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 1 ms to minimize.
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 0 ms to minimize.
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 136 places in 122 ms of which 0 ms to minimize.
[2023-03-15 14:41:34] [INFO ] Deduced a trap composed of 127 places in 122 ms of which 0 ms to minimize.
[2023-03-15 14:41:34] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 1 ms to minimize.
[2023-03-15 14:41:34] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 0 ms to minimize.
[2023-03-15 14:41:34] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 0 ms to minimize.
[2023-03-15 14:41:34] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 0 ms to minimize.
[2023-03-15 14:41:34] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 0 ms to minimize.
[2023-03-15 14:41:35] [INFO ] Deduced a trap composed of 136 places in 122 ms of which 0 ms to minimize.
[2023-03-15 14:41:35] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 1 ms to minimize.
[2023-03-15 14:41:35] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 0 ms to minimize.
[2023-03-15 14:41:35] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 1 ms to minimize.
[2023-03-15 14:41:36] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 0 ms to minimize.
[2023-03-15 14:41:38] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 1 ms to minimize.
[2023-03-15 14:41:39] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2023-03-15 14:41:39] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:41:39] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:41:40] [INFO ] Deduced a trap composed of 130 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:41:40] [INFO ] Deduced a trap composed of 130 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:41:41] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 0 ms to minimize.
[2023-03-15 14:41:41] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:41:41] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:41:41] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:41:42] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 0 ms to minimize.
[2023-03-15 14:41:43] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 1 ms to minimize.
[2023-03-15 14:41:44] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 1 ms to minimize.
[2023-03-15 14:41:44] [INFO ] Deduced a trap composed of 142 places in 118 ms of which 1 ms to minimize.
[2023-03-15 14:41:44] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:41:45] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 0 ms to minimize.
[2023-03-15 14:41:46] [INFO ] Deduced a trap composed of 136 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:41:46] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:41:47] [INFO ] Deduced a trap composed of 136 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:41:47] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:41:47] [INFO ] Deduced a trap composed of 142 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:41:48] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:41:49] [INFO ] Deduced a trap composed of 124 places in 117 ms of which 2 ms to minimize.
[2023-03-15 14:41:51] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 1 ms to minimize.
[2023-03-15 14:41:52] [INFO ] Deduced a trap composed of 136 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:41:53] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2023-03-15 14:41:53] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:41:54] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 1 ms to minimize.
[2023-03-15 14:41:54] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 0 ms to minimize.
[2023-03-15 14:42:03] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 30671 ms
[2023-03-15 14:42:03] [INFO ] After 30788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:42:03] [INFO ] After 31073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 579/579 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 412 transition count 578
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 412 transition count 576
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 410 transition count 576
Applied a total of 6 rules in 35 ms. Remains 410 /413 variables (removed 3) and now considering 576/579 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 410/413 places, 576/579 transitions.
Incomplete random walk after 1000000 steps, including 52206 resets, run finished after 3493 ms. (steps per millisecond=286 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5531 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2871524 steps, run timeout after 12001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 2871524 steps, saw 838831 distinct states, run finished after 12006 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:42:20] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 14:42:20] [INFO ] Computed 77 place invariants in 17 ms
[2023-03-15 14:42:20] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:42:20] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:42:20] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:20] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:42:20] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 14:42:20] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:20] [INFO ] After 113ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:20] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 5 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 2 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 11 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 1 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 116 places in 106 ms of which 1 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 1 ms to minimize.
[2023-03-15 14:42:28] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 1 ms to minimize.
[2023-03-15 14:42:28] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:42:28] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:42:28] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:42:30] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:42:30] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:42:30] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:42:30] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2023-03-15 14:42:39] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 18983 ms
[2023-03-15 14:42:39] [INFO ] After 19158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:42:39] [INFO ] After 19460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 14:42:39] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:42:39] [INFO ] Invariant cache hit.
[2023-03-15 14:42:40] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-15 14:42:40] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:42:40] [INFO ] Invariant cache hit.
[2023-03-15 14:42:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:41] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2023-03-15 14:42:41] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-15 14:42:41] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:42:41] [INFO ] Invariant cache hit.
[2023-03-15 14:42:41] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2056 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5203 resets, run finished after 481 ms. (steps per millisecond=207 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:42:42] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:42:42] [INFO ] Invariant cache hit.
[2023-03-15 14:42:42] [INFO ] [Real]Absence check using 70 positive place invariants in 15 ms returned sat
[2023-03-15 14:42:42] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:42:42] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:42:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:42] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:42:42] [INFO ] After 71ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:42] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:42] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:42:42] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:42:42] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:42] [INFO ] After 44ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:43] [INFO ] Deduced a trap composed of 146 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:42:43] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 0 ms to minimize.
[2023-03-15 14:42:43] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 0 ms to minimize.
[2023-03-15 14:42:43] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 0 ms to minimize.
[2023-03-15 14:42:43] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:42:43] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:42:44] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:42:44] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:42:44] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:42:44] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:42:44] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:42:44] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:42:45] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2023-03-15 14:42:45] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:42:45] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 1 ms to minimize.
[2023-03-15 14:42:45] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:42:45] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:42:45] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2023-03-15 14:42:46] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:42:46] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 0 ms to minimize.
[2023-03-15 14:42:46] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 0 ms to minimize.
[2023-03-15 14:42:46] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:42:46] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 1 ms to minimize.
[2023-03-15 14:42:46] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 1 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 116 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 137 places in 104 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:43:00] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 18013 ms
[2023-03-15 14:43:01] [INFO ] After 18212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:01] [INFO ] After 18453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52067 resets, run finished after 3323 ms. (steps per millisecond=300 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5585 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2880419 steps, run timeout after 12001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 2880419 steps, saw 841600 distinct states, run finished after 12001 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:43:17] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:43:17] [INFO ] Invariant cache hit.
[2023-03-15 14:43:17] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:43:17] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:43:17] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:17] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 14:43:17] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:43:17] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:17] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:17] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 1 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 140 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:43:19] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:43:19] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2023-03-15 14:43:19] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2023-03-15 14:43:19] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:43:19] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 1 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:43:27] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 0 ms to minimize.
[2023-03-15 14:43:32] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 0 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 23623 ms
[2023-03-15 14:43:41] [INFO ] After 23802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:41] [INFO ] After 24112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 14:43:41] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:43:41] [INFO ] Invariant cache hit.
[2023-03-15 14:43:41] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-15 14:43:41] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:43:41] [INFO ] Invariant cache hit.
[2023-03-15 14:43:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:43] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-15 14:43:43] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 14:43:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:43:43] [INFO ] Invariant cache hit.
[2023-03-15 14:43:43] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2180 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5224 resets, run finished after 334 ms. (steps per millisecond=299 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:43:44] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:43:44] [INFO ] Invariant cache hit.
[2023-03-15 14:43:44] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:43:44] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:43:44] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:43:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:44] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:43:44] [INFO ] After 77ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:44] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:44] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:43:44] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:43:44] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:44] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:44] [INFO ] Deduced a trap composed of 146 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:43:44] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:43:45] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:43:45] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:43:45] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 1 ms to minimize.
[2023-03-15 14:43:45] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:43:45] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-15 14:43:45] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 1 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:43:47] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:43:47] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 0 ms to minimize.
[2023-03-15 14:43:47] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:43:47] [INFO ] Deduced a trap composed of 119 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:43:47] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:43:48] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:43:48] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:43:48] [INFO ] Deduced a trap composed of 143 places in 122 ms of which 1 ms to minimize.
[2023-03-15 14:43:48] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:43:48] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:43:48] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 116 places in 106 ms of which 1 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 140 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:43:51] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:43:51] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:43:53] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:43:53] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:44:02] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 17744 ms
[2023-03-15 14:44:02] [INFO ] After 17865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:44:02] [INFO ] After 18132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 541 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649404 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649404 steps, saw 199885 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:44:05] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:44:05] [INFO ] Invariant cache hit.
[2023-03-15 14:44:05] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:44:05] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:44:05] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:05] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 14:44:05] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:44:05] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:05] [INFO ] After 50ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:06] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:44:06] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:44:06] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:06] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:44:06] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:44:06] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 0 ms to minimize.
[2023-03-15 14:44:06] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 0 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 1 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Deduced a trap composed of 140 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:44:08] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:44:08] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:08] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:44:08] [INFO ] Deduced a trap composed of 134 places in 103 ms of which 1 ms to minimize.
[2023-03-15 14:44:08] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 1 ms to minimize.
[2023-03-15 14:44:08] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:09] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:44:09] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:44:09] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:44:09] [INFO ] Deduced a trap composed of 149 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:44:09] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:44:09] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:09] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:10] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:10] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-15 14:44:10] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:44:10] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:44:10] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:44:11] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:44:11] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 1 ms to minimize.
[2023-03-15 14:44:11] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:44:11] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:44:11] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:44:12] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:44:12] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:13] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2023-03-15 14:44:13] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:13] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-15 14:44:13] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:44:13] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:44:14] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2023-03-15 14:44:14] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:44:14] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:44:14] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 3 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 1 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:44:21] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:44:30] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 24084 ms
[2023-03-15 14:44:30] [INFO ] After 24163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:44:30] [INFO ] After 24462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 21 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 14:44:30] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:44:30] [INFO ] Invariant cache hit.
[2023-03-15 14:44:30] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 10000 steps, including 527 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651420 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651420 steps, saw 200547 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:44:33] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:44:33] [INFO ] Invariant cache hit.
[2023-03-15 14:44:33] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 14:44:33] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:44:33] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:33] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:44:33] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:44:33] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:33] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 1 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 128 places in 103 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 0 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 0 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 1 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 149 places in 122 ms of which 0 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:44:40] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 0 ms to minimize.
[2023-03-15 14:44:40] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:40] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:44:41] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:44:41] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:44:41] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:41] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:44:42] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:44:42] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2023-03-15 14:44:42] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 1 ms to minimize.
[2023-03-15 14:44:42] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:44:42] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:44:43] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:44:43] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 1 ms to minimize.
[2023-03-15 14:44:43] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:44:43] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:44:44] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:44:44] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:44:45] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 0 ms to minimize.
[2023-03-15 14:44:45] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:44:46] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:44:48] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:44:57] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 23990 ms
[2023-03-15 14:44:57] [INFO ] After 24072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:44:57] [INFO ] After 24377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 14:44:57] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:44:57] [INFO ] Invariant cache hit.
[2023-03-15 14:44:58] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-15 14:44:58] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:44:58] [INFO ] Invariant cache hit.
[2023-03-15 14:44:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:59] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2023-03-15 14:44:59] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 14:44:59] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 14:44:59] [INFO ] Invariant cache hit.
[2023-03-15 14:44:59] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1864 ms. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 40 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2023-03-15 14:44:59] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-15 14:44:59] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:44:59] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:44:59] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:59] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:45:00] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:45:00] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 129 places in 102 ms of which 0 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 4 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 1 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 1 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 0 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 1 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 1 ms to minimize.
[2023-03-15 14:45:16] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 16516 ms
[2023-03-15 14:45:16] [INFO ] After 16738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:45:16] [INFO ] After 16820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 36 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:45:16] [INFO ] Invariant cache hit.
[2023-03-15 14:45:16] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 14:45:16] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:45:16] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 14:45:16] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:45:17] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:17] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 1 ms to minimize.
[2023-03-15 14:45:17] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:17] [INFO ] Deduced a trap composed of 117 places in 119 ms of which 0 ms to minimize.
[2023-03-15 14:45:17] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:17] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:45:18] [INFO ] Deduced a trap composed of 120 places in 103 ms of which 1 ms to minimize.
[2023-03-15 14:45:18] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:18] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:18] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:18] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 0 ms to minimize.
[2023-03-15 14:45:18] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:18] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 123 places in 102 ms of which 1 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 132 places in 102 ms of which 1 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 132 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 1 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 0 ms to minimize.
[2023-03-15 14:45:21] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:21] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 1 ms to minimize.
[2023-03-15 14:45:21] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:21] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:45:21] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:45:21] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 0 ms to minimize.
[2023-03-15 14:45:21] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:22] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:22] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:45:22] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:45:22] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:22] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:22] [INFO ] Deduced a trap composed of 138 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:22] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 0 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 130 places in 107 ms of which 1 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 141 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:23] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 0 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:25] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:45:25] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:45:25] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:26] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:45:26] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 127 places in 104 ms of which 0 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 0 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 1 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 132 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 1 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 0 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 114 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 1 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 118 places in 102 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 0 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 0 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 0 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 141 places in 103 ms of which 0 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 117 places in 119 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 0 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 1 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 126 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 0 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 138 places in 110 ms of which 1 ms to minimize.
[2023-03-15 14:45:45] [INFO ] Trap strengthening (SAT) tested/added 105/105 trap constraints in 28520 ms
[2023-03-15 14:45:45] [INFO ] After 28849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:45:45] [INFO ] After 28929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 263149 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S05J30
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 48 places, 38 transitions, 140 arcs.
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P12)>=1)))
(potential((tk(P3)>=1) & (tk(P6)>=1) & (tk(P7)>=1)))
(potential((tk(P3)>=1) & (tk(P10)>=1) & (tk(P8)>=1)))
(potential((tk(P3)>=1) & (tk(P11)>=1) & (tk(P9)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P13)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P14)>=1)))
(potential((tk(P16)>=1) & (tk(P46)>=1)))
(potential((tk(P4)>=1)))
(potential((tk(P17)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P18)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P20)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P36)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P33)>=1) & (tk(P28)>=1)))
(potential((tk(P15)>=1) & (tk(P29)>=1)))
(potential((tk(P15)>=1) & (tk(P30)>=1)))
(potential((tk(P15)>=1) & (tk(P31)>=1)))
(potential((tk(P15)>=1) & (tk(P32)>=1)))
(potential((tk(P26)>=1) & (tk(P34)>=1) & (tk(P35)>=1) & (tk(P37)>=1)))
(potential((tk(P37)>=1) & (tk(P38)>=1) & (tk(P25)>=1)))
(potential((tk(P2)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P39)>=1) & (tk(P45)>=1)))
(potential((tk(P39)>=1) & (tk(P46)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P27)>=1) & (tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P41)>=1)))
FORMULA QuasiLiveness FALSE TECHNIQUES IMPLICIT_RELATION DECISION_DIAGRAMS SATURATION

BK_STOP 1678891547306

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
WARNING:
No initial marking given, assuming zero
within model automodel built in file model.sm near line 245

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="PolyORBNT-COL-S05J30"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBNT-COL-S05J30, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r313-tall-167873966100402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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