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.r320-tall-167873970600422.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 gold2022
Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-167873970600422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:37 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 1678871861535

Running Version 202205111006
[2023-03-15 09:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 09:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:17:42] [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 09:17:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:17:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 620 ms
[2023-03-15 09:17:43] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 21 ms.
[2023-03-15 09:17:43] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 179 ms.
[2023-03-15 09:17:43] [INFO ] Unfolded 38 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:17:43] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 09:17:43] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 09:17:43] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 29 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1134 ms. (steps per millisecond=8 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-15 09:17:45] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-15 09:17:45] [INFO ] Computed 72 place invariants in 95 ms
[2023-03-15 09:17:47] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2023-03-15 09:17:47] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 09:17:48] [INFO ] After 770ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2023-03-15 09:17:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:48] [INFO ] After 121ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:6
[2023-03-15 09:17:48] [INFO ] After 367ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-15 09:17:48] [INFO ] After 1847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2023-03-15 09:17:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 20 ms returned sat
[2023-03-15 09:17:48] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 09:17:50] [INFO ] After 1354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 09:17:51] [INFO ] After 1059ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-15 09:17:56] [INFO ] Deduced a trap composed of 131 places in 443 ms of which 2 ms to minimize.
[2023-03-15 09:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2023-03-15 09:17:57] [INFO ] After 6725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 699 ms.
[2023-03-15 09:17:57] [INFO ] After 9111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 888 ms.
Support contains 41 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 439 transition count 1602
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 416 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 415 transition count 1601
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 415 transition count 1601
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 112 place count 413 transition count 1599
Applied a total of 112 rules in 248 ms. Remains 413 /474 variables (removed 61) and now considering 1599/1650 (removed 51) transitions.
[2023-03-15 09:17:58] [INFO ] Flow matrix only has 1590 transitions (discarded 9 similar events)
// Phase 1: matrix 1590 rows 413 cols
[2023-03-15 09:17:58] [INFO ] Computed 62 place invariants in 36 ms
[2023-03-15 09:17:59] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 413/474 places, 984/1650 transitions.
Applied a total of 0 rules in 42 ms. Remains 413 /413 variables (removed 0) and now considering 984/984 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/474 places, 984/1650 transitions.
Incomplete random walk after 1000000 steps, including 65513 resets, run finished after 6876 ms. (steps per millisecond=145 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 1000001 steps, including 9437 resets, run finished after 1469 ms. (steps per millisecond=680 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:18:07] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2023-03-15 09:18:07] [INFO ] Computed 62 place invariants in 17 ms
[2023-03-15 09:18:08] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:18:08] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:18:08] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 09:18:08] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:18:08] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:08] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:08] [INFO ] Deduced a trap composed of 176 places in 236 ms of which 2 ms to minimize.
[2023-03-15 09:18:08] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 1 ms to minimize.
[2023-03-15 09:18:09] [INFO ] Deduced a trap composed of 176 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:18:09] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:18:09] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:18:09] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 172 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 0 ms to minimize.
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 184 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 180 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 180 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 0 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 2 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:18:20] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:18:20] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:18:20] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:18:21] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:18:21] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:18:21] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:18:21] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:18:23] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:18:23] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:18:24] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:24] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:18:24] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:18:25] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:18:25] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:18:25] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 2 ms to minimize.
[2023-03-15 09:18:25] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:18:26] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:18:26] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:18:26] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:18:27] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 0 ms to minimize.
[2023-03-15 09:18:27] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:18:27] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:18:28] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:18:28] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:18:28] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2023-03-15 09:18:29] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 2 ms to minimize.
[2023-03-15 09:18:29] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:18:29] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:18:30] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:18:30] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:18:30] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:18:32] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:18:33] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:18:34] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:18:34] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:18:35] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:18:35] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:35] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:18:35] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:18:36] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-15 09:18:36] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:36] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:18:36] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:18:37] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:18:37] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:18:48] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:48] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:18:50] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 0 ms to minimize.
[2023-03-15 09:18:51] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:18:53] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:18:53] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:18:54] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:18:54] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:18:55] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:18:55] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-15 09:18:55] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:19:01] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:19:02] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:02] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:19:02] [INFO ] Deduced a trap composed of 180 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:19:04] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 172 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 180 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 176 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 176 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:19:21] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:19:21] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:19:21] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:19:22] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 174 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:19:28] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:19:29] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 176 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:19:32] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:19:32] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 176 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 172 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 176 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 182 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 180 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 176 places in 237 ms of which 1 ms to minimize.
[2023-03-15 09:19:43] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 182 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 174 places in 194 ms of which 1 ms to minimize.
[2023-03-15 09:19:47] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:19:48] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:19:49] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:19:49] [INFO ] Deduced a trap composed of 174 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:19:50] [INFO ] Deduced a trap composed of 176 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 176 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:19:57] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:19:57] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:19:57] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:20:00] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:20:01] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:20:02] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:20:03] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:20:03] [INFO ] Deduced a trap composed of 180 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:20:03] [INFO ] Deduced a trap composed of 174 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:20:04] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:20:05] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:20:06] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:20:07] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:20:08] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:20:08] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:20:09] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:20:16] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:20:16] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:20:16] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:20:17] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:20:17] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:20:17] [INFO ] Deduced a trap composed of 180 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:20:18] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 0 ms to minimize.
[2023-03-15 09:20:18] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:20:24] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:20:24] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:20:25] [INFO ] Deduced a trap composed of 180 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:20:26] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:20:26] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:20:27] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:20:27] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:20:28] [INFO ] Deduced a trap composed of 180 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:20:29] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:20:30] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:20:31] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:20:32] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:20:38] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:20:42] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Trap strengthening (SAT) tested/added 250/250 trap constraints in 164087 ms
[2023-03-15 09:20:52] [INFO ] After 164317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:52] [INFO ] After 164681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 413/413 places, 984/984 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 983
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 983
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 981
Deduced a syphon composed of 2 places in 0 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 981
Applied a total of 6 rules in 57 ms. Remains 410 /413 variables (removed 3) and now considering 981/984 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/413 places, 981/984 transitions.
Incomplete random walk after 1000000 steps, including 72680 resets, run finished after 9313 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9634 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6054242 steps, run timeout after 33001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 6054242 steps, saw 1051074 distinct states, run finished after 33002 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:21:36] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:21:36] [INFO ] Computed 62 place invariants in 21 ms
[2023-03-15 09:21:36] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 09:21:36] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 09:21:36] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:21:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2023-03-15 09:21:37] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:21:37] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:21:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:21:37] [INFO ] After 66ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:21:37] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:21:37] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 179 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:21:43] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:21:43] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:21:43] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:21:43] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:21:45] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:21:45] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:21:45] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:21:45] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 1 ms to minimize.
[2023-03-15 09:21:46] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:21:46] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:21:46] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2023-03-15 09:21:47] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:21:47] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:21:47] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:21:47] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:21:48] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:21:48] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:21:48] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:21:48] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-15 09:21:49] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:21:49] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:21:49] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:21:49] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:21:50] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:21:50] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:21:50] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:21:51] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:21:51] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:21:51] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:21:51] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:21:52] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:21:52] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 154 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2023-03-15 09:21:55] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:21:55] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:21:55] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:21:55] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:21:56] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:21:56] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:21:57] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:21:57] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:21:57] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:21:58] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:21:58] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 174 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:22:00] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:22:00] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:22:00] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:01] [INFO ] Deduced a trap composed of 154 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:22:01] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:22:04] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:04] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:22:04] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:04] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:22:05] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:22:05] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:22:05] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:22:06] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:22:06] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:22:08] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:22:10] [INFO ] Deduced a trap composed of 169 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:22:19] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 41880 ms
[2023-03-15 09:22:19] [INFO ] After 42032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:22:19] [INFO ] After 42417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 28 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 09:22:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:22:19] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-15 09:22:19] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-15 09:22:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:22:19] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-15 09:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:22:21] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2129 ms to find 0 implicit places.
[2023-03-15 09:22:21] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-15 09:22:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:22:21] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-15 09:22:22] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7299 resets, run finished after 1011 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:22:23] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:22:23] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-15 09:22:23] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:22:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:22:23] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:22:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:22:23] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 09:22:23] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:22:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:22:23] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:22:23] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:22:24] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:22:24] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:22:24] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:22:24] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:22:25] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:22:25] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:22:25] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:22:25] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:22:26] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:22:26] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:22:26] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:22:26] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:22:27] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:22:27] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:27] [INFO ] Deduced a trap composed of 179 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:22:28] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:22:28] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:28] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:22:28] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:22:29] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:22:29] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:29] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:22:29] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:22:30] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:22:30] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:22:30] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:30] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:31] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:22:31] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:31] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:22:31] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:22:32] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:22:32] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:22:32] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:22:33] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:22:33] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:22:33] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:33] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:22:34] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:34] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:22:34] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:34] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:22:35] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:22:35] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:35] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:22:36] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:22:36] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:22:36] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:22:36] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 1 ms to minimize.
[2023-03-15 09:22:37] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:22:37] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:22:37] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:22:37] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:22:38] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:22:38] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:39] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:22:39] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:22:39] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:40] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:40] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:22:40] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:22:40] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:22:41] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:22:41] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:22:41] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 09:22:42] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:22:42] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:22:42] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:22:43] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:22:43] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:22:43] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:43] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:22:45] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:22:45] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:22:45] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:22:45] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 4 ms to minimize.
[2023-03-15 09:22:46] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:22:46] [INFO ] Deduced a trap composed of 174 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:22:46] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:22:47] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:47] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:22:47] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:22:48] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:22:50] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:22:50] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:51] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:51] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:22:51] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:22:51] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:22:52] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:52] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:22:53] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:22:54] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:22:56] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:23:05] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 42181 ms
[2023-03-15 09:23:05] [INFO ] After 42365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:23:05] [INFO ] After 42739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72554 resets, run finished after 9285 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9600 resets, run finished after 1722 ms. (steps per millisecond=580 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6038114 steps, run timeout after 33001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 6038114 steps, saw 1048289 distinct states, run finished after 33001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:23:49] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:23:49] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-15 09:23:49] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-15 09:23:49] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:23:50] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:23:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-15 09:23:50] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 09:23:50] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:23:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:23:50] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:23:50] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:23:50] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:23:51] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:23:51] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:23:51] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:23:51] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:23:52] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:23:52] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:23:52] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 0 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 170 places in 228 ms of which 0 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-15 09:23:54] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:23:54] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-15 09:23:54] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:23:54] [INFO ] Deduced a trap composed of 179 places in 230 ms of which 0 ms to minimize.
[2023-03-15 09:23:55] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:23:55] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:23:55] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:23:56] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2023-03-15 09:23:56] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:23:56] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 1 ms to minimize.
[2023-03-15 09:23:56] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:23:57] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:23:57] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:23:57] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:23:57] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:23:58] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 0 ms to minimize.
[2023-03-15 09:23:58] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:23:58] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:23:58] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:23:59] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:23:59] [INFO ] Deduced a trap composed of 170 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:24:00] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:24:00] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 1 ms to minimize.
[2023-03-15 09:24:00] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:24:00] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:24:01] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:24:01] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-15 09:24:01] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:24:01] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2023-03-15 09:24:02] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:24:02] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:24:02] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:24:03] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:24:03] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:24:03] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:24:04] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-15 09:24:04] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:24:04] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:24:04] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 0 ms to minimize.
[2023-03-15 09:24:05] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:24:05] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-15 09:24:05] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:24:06] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:24:06] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:24:07] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:24:07] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:24:07] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:24:07] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:24:08] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:24:08] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:24:08] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:24:09] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:24:09] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:24:09] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:24:09] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:24:10] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:24:10] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 4 ms to minimize.
[2023-03-15 09:24:11] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:24:11] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:24:11] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:11] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:24:12] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:24:13] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:24:13] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:24:13] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:24:13] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:24:14] [INFO ] Deduced a trap composed of 174 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:24:14] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:24:14] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:24:15] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:24:15] [INFO ] Deduced a trap composed of 154 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:15] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:24:18] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:24:18] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:24:18] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:24:19] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:19] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:19] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:24:19] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:24:20] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:24:20] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:24:22] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:24:24] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:24:33] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 42991 ms
[2023-03-15 09:24:33] [INFO ] After 43148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:24:33] [INFO ] After 43578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 09:24:33] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:24:33] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-15 09:24:34] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-15 09:24:34] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:24:34] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-15 09:24:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:24:36] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
[2023-03-15 09:24:36] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 09:24:36] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:24:36] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-15 09:24:36] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7293 resets, run finished after 934 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:24:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:24:37] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-15 09:24:37] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:24:37] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:24:37] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:24:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:24:37] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:24:37] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:24:37] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:24:38] [INFO ] Deduced a trap composed of 177 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:24:38] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:24:38] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:24:38] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:24:39] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:39] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:24:39] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:24:39] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:24:40] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:24:40] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:24:40] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:24:40] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:24:41] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:24:41] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:24:41] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:24:42] [INFO ] Deduced a trap composed of 179 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:24:42] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:24:42] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:24:42] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:24:43] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:24:43] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:43] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:24:43] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:24:44] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:24:44] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:24:44] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:24:44] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:24:45] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:24:45] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:24:45] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:24:45] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:24:46] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:24:46] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:24:46] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:24:47] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:24:47] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:24:47] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:24:47] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:24:48] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:24:48] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:24:48] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:24:48] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:24:49] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:24:49] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:24:49] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:24:50] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:24:50] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:24:50] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:24:50] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:24:51] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:24:51] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:24:51] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:24:51] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:24:52] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:24:52] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:24:52] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:24:53] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-15 09:24:53] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:24:54] [INFO ] Deduced a trap composed of 154 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:24:54] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:24:54] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:24:54] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:24:55] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:55] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:24:55] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:24:56] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:24:56] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:24:56] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:24:56] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:24:57] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:24:57] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:24:58] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:24:58] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:24:59] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:24:59] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:24:59] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:25:00] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:00] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:25:00] [INFO ] Deduced a trap composed of 174 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:01] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:25:01] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:25:01] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:25:02] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:25:02] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:25:04] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:05] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:25:05] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:25:05] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:25:05] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2023-03-15 09:25:05] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:25:06] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:25:06] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-15 09:25:07] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:08] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:25:10] [INFO ] Deduced a trap composed of 169 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:25:19] [INFO ] Trap strengthening (SAT) tested/added 95/95 trap constraints in 42056 ms
[2023-03-15 09:25:20] [INFO ] After 42212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:25:20] [INFO ] After 42591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 733 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 531812 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 531812 steps, saw 86543 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:25:23] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:25:23] [INFO ] Computed 62 place invariants in 20 ms
[2023-03-15 09:25:23] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-15 09:25:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:25:23] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:25:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:25:23] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 09:25:23] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:25:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:25:23] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:25:23] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:25:24] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:25:24] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:25:24] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:25:24] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:25:25] [INFO ] Deduced a trap composed of 172 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:25:25] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:25] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:25:25] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:25:26] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:25:26] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:25:26] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:26] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:25:27] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:25:27] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:25:27] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:27] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:25:28] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:25:28] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:25:28] [INFO ] Deduced a trap composed of 164 places in 253 ms of which 0 ms to minimize.
[2023-03-15 09:25:29] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:25:29] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:25:29] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:25:29] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:25:30] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:25:30] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:25:30] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:25:31] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:25:31] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:31] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:25:31] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:25:32] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:25:32] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-15 09:25:32] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:33] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 1 ms to minimize.
[2023-03-15 09:25:33] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:25:33] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:25:33] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:25:34] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:34] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:25:34] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:34] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:25:35] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:25:35] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:35] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:25:35] [INFO ] Deduced a trap composed of 154 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:25:36] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:25:36] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:25:36] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 09:25:36] [INFO ] Deduced a trap composed of 165 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:25:37] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:25:37] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:25:37] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:25:38] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:25:38] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:25:38] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:25:39] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:39] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:25:39] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:25:40] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:25:40] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:25:40] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:25:40] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:25:41] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:25:41] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:42] [INFO ] Deduced a trap composed of 154 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:42] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:42] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:25:43] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:25:43] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:25:43] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:25:43] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:25:44] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:25:44] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:25:44] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:25:45] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:25:45] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:25:45] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:25:46] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:25:46] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:25:46] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:25:47] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:25:47] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:25:48] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:25:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:25:48] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 28 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 09:25:48] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:25:48] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-15 09:25:48] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 10000 steps, including 733 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 526517 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 526517 steps, saw 85720 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:25:51] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:25:51] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-15 09:25:51] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:25:51] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 09:25:51] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:25:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:25:52] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:25:52] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:25:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:25:52] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:25:52] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:25:52] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:25:53] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:25:53] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:25:53] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:25:53] [INFO ] Deduced a trap composed of 172 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:25:54] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:25:54] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:25:54] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:25:54] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:25:55] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:25:55] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:55] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:25:55] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:25:56] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:25:56] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:25:56] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:25:56] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:25:57] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:25:57] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:25:57] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:25:57] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:25:58] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-15 09:25:58] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:25:58] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:25:58] [INFO ] Deduced a trap composed of 152 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:25:59] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:25:59] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:25:59] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:26:00] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:26:00] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:26:00] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:26:01] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:26:01] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:26:01] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:26:02] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:26:02] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:26:02] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:26:02] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 09:26:03] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:26:03] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:26:03] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:26:03] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:26:04] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:26:04] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:26:04] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:26:04] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:26:05] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 09:26:05] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:26:05] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:26:06] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:26:06] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 09:26:06] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 1 ms to minimize.
[2023-03-15 09:26:07] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:26:07] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 09:26:07] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:26:07] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:26:08] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-15 09:26:08] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:26:08] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:26:09] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:26:09] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:26:09] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 09:26:10] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 09:26:10] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:26:10] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:26:11] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:26:11] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:26:11] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-15 09:26:12] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-15 09:26:12] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:26:12] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:26:12] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:26:13] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:26:13] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:26:14] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 09:26:14] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 0 ms to minimize.
[2023-03-15 09:26:14] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:26:15] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:26:15] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 09:26:15] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:26:16] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 09:26:16] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:26:16] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 24582 ms
[2023-03-15 09:26:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:26:16] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 09:26:17] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:26:17] [INFO ] Computed 62 place invariants in 17 ms
[2023-03-15 09:26:17] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-15 09:26:17] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:26:17] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-15 09:26:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:26:18] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2023-03-15 09:26:18] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 09:26:18] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 09:26:18] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-15 09:26:19] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
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 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 83 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2023-03-15 09:26:19] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-15 09:26:19] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:26:19] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:26:19] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:26:19] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 09:26:19] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:26:19] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:26:19] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2023-03-15 09:26:20] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 1 ms to minimize.
[2023-03-15 09:26:20] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:26:20] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:26:20] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 1 ms to minimize.
[2023-03-15 09:26:20] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2023-03-15 09:26:21] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:26:21] [INFO ] Deduced a trap composed of 154 places in 182 ms of which 0 ms to minimize.
[2023-03-15 09:26:21] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 1 ms to minimize.
[2023-03-15 09:26:21] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:26:22] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 1 ms to minimize.
[2023-03-15 09:26:22] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 0 ms to minimize.
[2023-03-15 09:26:22] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 09:26:22] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:26:22] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:26:23] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:26:23] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2023-03-15 09:26:23] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 1 ms to minimize.
[2023-03-15 09:26:23] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 1 ms to minimize.
[2023-03-15 09:26:24] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2023-03-15 09:26:24] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:26:24] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 09:26:24] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:26:24] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 1 ms to minimize.
[2023-03-15 09:26:25] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:26:25] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2023-03-15 09:26:25] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:26:25] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:26:25] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2023-03-15 09:26:26] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:26:26] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:26:26] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:26:26] [INFO ] Deduced a trap composed of 152 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:26:26] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 1 ms to minimize.
[2023-03-15 09:26:27] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:26:27] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 1 ms to minimize.
[2023-03-15 09:26:27] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:26:27] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:26:27] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:26:28] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 1 ms to minimize.
[2023-03-15 09:26:28] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2023-03-15 09:26:28] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 09:26:28] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 0 ms to minimize.
[2023-03-15 09:26:29] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2023-03-15 09:26:29] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2023-03-15 09:26:29] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:26:29] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2023-03-15 09:26:30] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:26:30] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:26:30] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:26:31] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:26:31] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:26:31] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:26:31] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 1 ms to minimize.
[2023-03-15 09:26:31] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2023-03-15 09:26:32] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2023-03-15 09:26:32] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:26:32] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2023-03-15 09:26:32] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 1 ms to minimize.
[2023-03-15 09:26:32] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 1 ms to minimize.
[2023-03-15 09:26:33] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:26:33] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:26:33] [INFO ] Deduced a trap composed of 159 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:26:33] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:26:34] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:26:34] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:26:34] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2023-03-15 09:26:34] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:26:34] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:26:35] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 1 ms to minimize.
[2023-03-15 09:26:35] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:26:35] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2023-03-15 09:26:35] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 0 ms to minimize.
[2023-03-15 09:26:35] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:26:36] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:26:36] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:26:36] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 0 ms to minimize.
[2023-03-15 09:26:36] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:26:37] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:26:37] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:26:37] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:26:37] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 0 ms to minimize.
[2023-03-15 09:26:37] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:26:38] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 1 ms to minimize.
[2023-03-15 09:26:38] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-15 09:26:38] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2023-03-15 09:26:38] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:26:38] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:26:39] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 5 ms to minimize.
[2023-03-15 09:30:04] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 224707 ms
[2023-03-15 09:30:04] [INFO ] After 224936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:30:04] [INFO ] After 225011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:30:04] [INFO ] Flatten gal took : 183 ms
[2023-03-15 09:30:04] [INFO ] Flatten gal took : 147 ms
[2023-03-15 09:30:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13983632924720008356.gal : 64 ms
[2023-03-15 09:30:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1620408257383882891.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6207946479866207345;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13983632924720008356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1620408257383882891.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1620408257383882891.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 389
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :389 after 399
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :399 after 433
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :433 after 534
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :534 after 769
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :769 after 1262
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1262 after 2760
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2760 after 5148
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5148 after 230782
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :230782 after 235888
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :235888 after 299019
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :299019 after 425613
Detected timeout of ITS tools.
[2023-03-15 09:30:20] [INFO ] Flatten gal took : 79 ms
[2023-03-15 09:30:20] [INFO ] Applying decomposition
[2023-03-15 09:30:20] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11549813869198671988.txt' '-o' '/tmp/graph11549813869198671988.bin' '-w' '/tmp/graph11549813869198671988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11549813869198671988.bin' '-l' '-1' '-v' '-w' '/tmp/graph11549813869198671988.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:30:20] [INFO ] Decomposing Gal with order
[2023-03-15 09:30:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:30:21] [INFO ] Removed a total of 1240 redundant transitions.
[2023-03-15 09:30:21] [INFO ] Flatten gal took : 347 ms
[2023-03-15 09:30:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 820 labels/synchronizations in 56 ms.
[2023-03-15 09:30:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7814120984455625821.gal : 50 ms
[2023-03-15 09:30:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13939500814551841764.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6207946479866207345;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7814120984455625821.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13939500814551841764.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality13939500814551841764.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3282
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3282 after 725015
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :725015 after 725017
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :725017 after 725019
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :725019 after 725023
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :725023 after 725029
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :725029 after 725037
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :725037 after 831328
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :831328 after 831617
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :831617 after 832008
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :832008 after 1.01419e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.01419e+06 after 1.02882e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.02882e+06 after 1.32129e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.32129e+06 after 1.89774e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.89774e+06 after 2.01673e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12219886975224163220
[2023-03-15 09:30:36] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12219886975224163220
Running compilation step : cd /tmp/ltsmin12219886975224163220;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1999 ms.
Running link step : cd /tmp/ltsmin12219886975224163220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12219886975224163220;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
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 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 76 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2023-03-15 09:30:51] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-15 09:30:51] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2023-03-15 09:30:51] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 09:30:51] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:30:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 09:30:51] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 09:30:51] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:30:52] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2023-03-15 09:30:52] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:30:52] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:30:52] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 09:30:52] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:30:54] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:30:54] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:30:54] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 2 ms to minimize.
[2023-03-15 09:30:54] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 1 ms to minimize.
[2023-03-15 09:30:55] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:30:55] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2023-03-15 09:30:55] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:30:55] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-15 09:30:55] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:30:56] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:30:56] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 2 ms to minimize.
[2023-03-15 09:30:56] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:30:56] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2023-03-15 09:30:56] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:30:57] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:30:57] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:30:57] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 1 ms to minimize.
[2023-03-15 09:30:57] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2023-03-15 09:30:58] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:30:58] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:30:58] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:30:58] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2023-03-15 09:30:58] [INFO ] Deduced a trap composed of 152 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:30:59] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:30:59] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:30:59] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2023-03-15 09:30:59] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 09:30:59] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:31:00] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 1 ms to minimize.
[2023-03-15 09:31:00] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 0 ms to minimize.
[2023-03-15 09:31:00] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-15 09:31:00] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2023-03-15 09:31:01] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 0 ms to minimize.
[2023-03-15 09:31:01] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 09:31:01] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:31:01] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2023-03-15 09:31:02] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 1 ms to minimize.
[2023-03-15 09:31:02] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:31:02] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2023-03-15 09:31:02] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:31:03] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 1 ms to minimize.
[2023-03-15 09:31:03] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:31:03] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2023-03-15 09:31:03] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2023-03-15 09:31:04] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 1 ms to minimize.
[2023-03-15 09:31:04] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 1 ms to minimize.
[2023-03-15 09:31:04] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2023-03-15 09:31:04] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2023-03-15 09:31:04] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2023-03-15 09:31:05] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-15 09:31:05] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2023-03-15 09:31:05] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 09:31:05] [INFO ] Deduced a trap composed of 159 places in 191 ms of which 1 ms to minimize.
[2023-03-15 09:31:06] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2023-03-15 09:31:06] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2023-03-15 09:31:06] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-15 09:31:06] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-15 09:31:06] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2023-03-15 09:31:07] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 0 ms to minimize.
[2023-03-15 09:31:07] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 1 ms to minimize.
[2023-03-15 09:31:07] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2023-03-15 09:31:07] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 1 ms to minimize.
[2023-03-15 09:31:08] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 0 ms to minimize.
[2023-03-15 09:31:08] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-15 09:31:08] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-15 09:31:08] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2023-03-15 09:31:08] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 0 ms to minimize.
[2023-03-15 09:31:09] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-15 09:31:09] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-15 09:31:09] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2023-03-15 09:31:09] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-15 09:31:10] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 0 ms to minimize.
[2023-03-15 09:31:10] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 1 ms to minimize.
[2023-03-15 09:31:10] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 1 ms to minimize.
[2023-03-15 09:31:10] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2023-03-15 09:31:10] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2023-03-15 09:31:11] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2023-03-15 09:31:11] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 1 ms to minimize.
[2023-03-15 09:31:11] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2023-03-15 09:34:36] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 224695 ms
[2023-03-15 09:34:36] [INFO ] After 224935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:34:36] [INFO ] After 225010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:34:36] [INFO ] Flatten gal took : 65 ms
[2023-03-15 09:34:36] [INFO ] Flatten gal took : 56 ms
[2023-03-15 09:34:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4683072732653601608.gal : 10 ms
[2023-03-15 09:34:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1572813900645284067.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4683072732653601608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1572813900645284067.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1572813900645284067.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 389
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :389 after 399
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :399 after 433
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :433 after 534
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :534 after 769
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :769 after 1262
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1262 after 2760
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2760 after 5148
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5148 after 230782
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :230782 after 235888
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :235888 after 299019
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :299019 after 425613
Detected timeout of ITS tools.
[2023-03-15 09:34:51] [INFO ] Flatten gal took : 51 ms
[2023-03-15 09:34:51] [INFO ] Applying decomposition
[2023-03-15 09:34:51] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18381915994067310281.txt' '-o' '/tmp/graph18381915994067310281.bin' '-w' '/tmp/graph18381915994067310281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18381915994067310281.bin' '-l' '-1' '-v' '-w' '/tmp/graph18381915994067310281.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:34:51] [INFO ] Decomposing Gal with order
[2023-03-15 09:34:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:34:52] [INFO ] Removed a total of 3108 redundant transitions.
[2023-03-15 09:34:52] [INFO ] Flatten gal took : 126 ms
[2023-03-15 09:34:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 46 ms.
[2023-03-15 09:34:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6380878846454270379.gal : 9 ms
[2023-03-15 09:34:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17731189128238321737.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6380878846454270379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17731189128238321737.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality17731189128238321737.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 634202
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :634202 after 636098
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :636098 after 640826
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :640826 after 646226
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :646226 after 646226
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :646226 after 940676
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :940676 after 943586
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :943586 after 2.77245e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.77245e+06 after 3.46743e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.46743e+06 after 5.55049e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.55049e+06 after 5.83753e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7783736974987903936
[2023-03-15 09:35:07] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7783736974987903936
Running compilation step : cd /tmp/ltsmin7783736974987903936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1870 ms.
Running link step : cd /tmp/ltsmin7783736974987903936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7783736974987903936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:35:22] [INFO ] Flatten gal took : 60 ms
[2023-03-15 09:35:22] [INFO ] Flatten gal took : 46 ms
[2023-03-15 09:35:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4712601263427128735.gal : 7 ms
[2023-03-15 09:35:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10045893795169333861.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4712601263427128735.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10045893795169333861.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability10045893795169333861.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
Detected timeout of ITS tools.
[2023-03-15 09:35:25] [INFO ] Flatten gal took : 46 ms
[2023-03-15 09:35:25] [INFO ] Applying decomposition
[2023-03-15 09:35:25] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14414999163918012446.txt' '-o' '/tmp/graph14414999163918012446.bin' '-w' '/tmp/graph14414999163918012446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14414999163918012446.bin' '-l' '-1' '-v' '-w' '/tmp/graph14414999163918012446.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:35:25] [INFO ] Decomposing Gal with order
[2023-03-15 09:35:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:35:25] [INFO ] Removed a total of 2742 redundant transitions.
[2023-03-15 09:35:25] [INFO ] Flatten gal took : 116 ms
[2023-03-15 09:35:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 263 labels/synchronizations in 25 ms.
[2023-03-15 09:35:26] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2611509857904945452.gal : 9 ms
[2023-03-15 09:35:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9000137784401739240.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2611509857904945452.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9000137784401739240.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability9000137784401739240.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2649684280227718452
[2023-03-15 09:35:29] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2649684280227718452
Running compilation step : cd /tmp/ltsmin2649684280227718452;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1840 ms.
Running link step : cd /tmp/ltsmin2649684280227718452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2649684280227718452;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:35:32] [INFO ] Flatten gal took : 42 ms
[2023-03-15 09:35:32] [INFO ] Flatten gal took : 43 ms
[2023-03-15 09:35:32] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability889971232590595208.gal : 6 ms
[2023-03-15 09:35:32] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6670228130457057088.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability889971232590595208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6670228130457057088.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityFireability6670228130457057088.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
Detected timeout of ITS tools.
[2023-03-15 09:36:02] [INFO ] Flatten gal took : 43 ms
[2023-03-15 09:36:02] [INFO ] Applying decomposition
[2023-03-15 09:36:02] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1291428045972343147.txt' '-o' '/tmp/graph1291428045972343147.bin' '-w' '/tmp/graph1291428045972343147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1291428045972343147.bin' '-l' '-1' '-v' '-w' '/tmp/graph1291428045972343147.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:36:02] [INFO ] Decomposing Gal with order
[2023-03-15 09:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:36:02] [INFO ] Removed a total of 2800 redundant transitions.
[2023-03-15 09:36:02] [INFO ] Flatten gal took : 103 ms
[2023-03-15 09:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 25 ms.
[2023-03-15 09:36:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6169569232828386405.gal : 18 ms
[2023-03-15 09:36:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12051112559052396203.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6169569232828386405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12051112559052396203.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability12051112559052396203.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11782730702245080731
[2023-03-15 09:36:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11782730702245080731
Running compilation step : cd /tmp/ltsmin11782730702245080731;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1880 ms.
Running link step : cd /tmp/ltsmin11782730702245080731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11782730702245080731;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:37:02] [INFO ] Flatten gal took : 44 ms
[2023-03-15 09:37:02] [INFO ] Flatten gal took : 43 ms
[2023-03-15 09:37:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5596418785010906285.gal : 6 ms
[2023-03-15 09:37:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3398960532364636516.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5596418785010906285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3398960532364636516.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityFireability3398960532364636516.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.62585e+06 after 3.99829e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.99829e+06 after 4.16985e+07
Detected timeout of ITS tools.
[2023-03-15 09:42:03] [INFO ] Flatten gal took : 45 ms
[2023-03-15 09:42:03] [INFO ] Applying decomposition
[2023-03-15 09:42:03] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph571763719459467557.txt' '-o' '/tmp/graph571763719459467557.bin' '-w' '/tmp/graph571763719459467557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph571763719459467557.bin' '-l' '-1' '-v' '-w' '/tmp/graph571763719459467557.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:42:03] [INFO ] Decomposing Gal with order
[2023-03-15 09:42:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:42:03] [INFO ] Removed a total of 2800 redundant transitions.
[2023-03-15 09:42:03] [INFO ] Flatten gal took : 91 ms
[2023-03-15 09:42:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 18 ms.
[2023-03-15 09:42:03] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability173621264069292227.gal : 6 ms
[2023-03-15 09:42:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14813619738506263487.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability173621264069292227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14813619738506263487.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability14813619738506263487.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 5540
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5540 after 5540
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5540 after 5554
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5554 after 5555
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5555 after 5559
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5559 after 5565
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5565 after 3.62042e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.62042e+07 after 3.68745e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.68745e+07 after 3.7756e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.7756e+07 after 3.77567e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.77567e+07 after 4.74653e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2664112393795342795
[2023-03-15 09:47:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2664112393795342795
Running compilation step : cd /tmp/ltsmin2664112393795342795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1871 ms.
Running link step : cd /tmp/ltsmin2664112393795342795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2664112393795342795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is PolyORBNT-COL-S10J20, 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 r320-tall-167873970600422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;