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.r309-tall-167873963000422.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 lolaxred
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 r309-tall-167873963000422
=====================================================================

--------------------
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 1679444042544

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:14:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:14:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:14:04] [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-22 00:14:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:14:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 477 ms
[2023-03-22 00:14:04] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 18 ms.
[2023-03-22 00:14:04] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 179 ms.
[2023-03-22 00:14:04] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:14:04] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-22 00:14:04] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-22 00:14:04] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 27 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 558 resets, run finished after 918 ms. (steps per millisecond=10 ) 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 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 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 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 14 ms. (steps per millisecond=71 ) 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 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 13 ms. (steps per millisecond=77 ) 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 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) 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 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 00:14:06] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-22 00:14:06] [INFO ] Computed 72 place invariants in 117 ms
[2023-03-22 00:14:08] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-22 00:14:08] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:14:08] [INFO ] After 699ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2023-03-22 00:14:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:14:09] [INFO ] After 106ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:6
[2023-03-22 00:14:09] [INFO ] After 313ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-22 00:14:09] [INFO ] After 1532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2023-03-22 00:14:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 31 ms returned sat
[2023-03-22 00:14:09] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:14:12] [INFO ] After 2320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 00:14:12] [INFO ] After 769ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 00:14:14] [INFO ] Deduced a trap composed of 218 places in 430 ms of which 1 ms to minimize.
[2023-03-22 00:14:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2023-03-22 00:14:14] [INFO ] Deduced a trap composed of 132 places in 397 ms of which 1 ms to minimize.
[2023-03-22 00:14:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2023-03-22 00:14:14] [INFO ] After 2755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 694 ms.
[2023-03-22 00:14:15] [INFO ] After 6135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 1239 ms.
Support contains 41 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 1 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 219 ms. Remains 413 /474 variables (removed 61) and now considering 1599/1650 (removed 51) transitions.
[2023-03-22 00:14:16] [INFO ] Flow matrix only has 1590 transitions (discarded 9 similar events)
// Phase 1: matrix 1590 rows 413 cols
[2023-03-22 00:14:17] [INFO ] Computed 62 place invariants in 48 ms
[2023-03-22 00:14:17] [INFO ] Dead Transitions using invariants and state equation in 666 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 REACHABILITY mode, iteration 1 : 413/474 places, 984/1650 transitions.
Applied a total of 0 rules in 26 ms. Remains 413 /413 variables (removed 0) and now considering 984/984 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 918 ms. Remains : 413/474 places, 984/1650 transitions.
Incomplete random walk after 1000000 steps, including 65534 resets, run finished after 6604 ms. (steps per millisecond=151 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 1000001 steps, including 9475 resets, run finished after 1448 ms. (steps per millisecond=690 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:14:25] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2023-03-22 00:14:25] [INFO ] Computed 62 place invariants in 25 ms
[2023-03-22 00:14:25] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-22 00:14:25] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:14:25] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:14:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-22 00:14:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-22 00:14:26] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:14:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:14:26] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:14:26] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:14:26] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:14:27] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:14:27] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:14:27] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:14:27] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:14:28] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:14:28] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:14:28] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-22 00:14:28] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:14:29] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:14:29] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:14:29] [INFO ] Deduced a trap composed of 176 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:14:29] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:14:30] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:14:30] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:14:30] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:14:31] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:14:31] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:14:31] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:14:31] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:14:32] [INFO ] Deduced a trap composed of 172 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:14:32] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:14:32] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-22 00:14:33] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:14:33] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:14:33] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:14:33] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:14:34] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:14:34] [INFO ] Deduced a trap composed of 159 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:14:34] [INFO ] Deduced a trap composed of 170 places in 241 ms of which 4 ms to minimize.
[2023-03-22 00:14:34] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:14:35] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:14:35] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:14:35] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:14:36] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:14:36] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:14:36] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:14:36] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:14:37] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:14:37] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:14:37] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:14:38] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:14:38] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:14:38] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:14:39] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:14:39] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:14:39] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:14:39] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:14:40] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-22 00:14:40] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:14:40] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 9 ms to minimize.
[2023-03-22 00:14:41] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:14:41] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 0 ms to minimize.
[2023-03-22 00:14:41] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:14:42] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:14:42] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 1 ms to minimize.
[2023-03-22 00:14:43] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:14:43] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:14:44] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 3 ms to minimize.
[2023-03-22 00:14:44] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:14:44] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:14:45] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:14:45] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:14:51] [INFO ] Deduced a trap composed of 158 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:14:52] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:14:52] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-22 00:14:53] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:14:53] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:14:54] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:14:54] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:14:55] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:14:55] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:15:04] [INFO ] Trap strengthening (SAT) tested/added 73/73 trap constraints in 38354 ms
[2023-03-22 00:15:04] [INFO ] After 38452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:15:04] [INFO ] After 38829ms 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 REACHABILITY 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 410 transition count 981
Applied a total of 6 rules in 48 ms. Remains 410 /413 variables (removed 3) and now considering 981/984 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 410/413 places, 981/984 transitions.
Incomplete random walk after 1000000 steps, including 72568 resets, run finished after 9051 ms. (steps per millisecond=110 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9694 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5368613 steps, run timeout after 30001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 5368613 steps, saw 929874 distinct states, run finished after 30004 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:15:45] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-22 00:15:45] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-22 00:15:45] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-22 00:15:45] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:15:45] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:15:45] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-22 00:15:45] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:15:46] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:15:46] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:15:46] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:15:46] [INFO ] Deduced a trap composed of 175 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:15:46] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:15:47] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:15:47] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:15:47] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:15:47] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:15:48] [INFO ] Deduced a trap composed of 175 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:15:48] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:15:48] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:15:49] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:15:49] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:15:49] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:15:49] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:15:50] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:15:50] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:15:50] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:15:50] [INFO ] Deduced a trap composed of 173 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:15:51] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:15:51] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:15:51] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:15:51] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:15:52] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:15:52] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:15:52] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:15:53] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:15:53] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:15:54] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:15:54] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:15:54] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:15:54] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-22 00:15:55] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:15:55] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:15:55] [INFO ] Deduced a trap composed of 181 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:15:56] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:15:56] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:15:56] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:15:57] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:15:57] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:15:57] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:15:58] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:15:58] [INFO ] Deduced a trap composed of 162 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:15:58] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:15:58] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:15:59] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:15:59] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:15:59] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:16:00] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:16:00] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:16:00] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:16:00] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:16:01] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:16:01] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:16:01] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:16:02] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:16:02] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:16:02] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:16:03] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:16:04] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-22 00:16:04] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:16:05] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 1 ms to minimize.
[2023-03-22 00:16:05] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:16:05] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:16:06] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:16:06] [INFO ] Deduced a trap composed of 154 places in 205 ms of which 1 ms to minimize.
[2023-03-22 00:16:06] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 2 ms to minimize.
[2023-03-22 00:16:07] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:16:07] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2023-03-22 00:16:07] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:16:08] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:16:08] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 13 ms to minimize.
[2023-03-22 00:16:08] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:16:08] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:16:11] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:16:12] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:16:12] [INFO ] Deduced a trap composed of 173 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:16:12] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:16:13] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:16:13] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:16:13] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:16:13] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:16:14] [INFO ] Deduced a trap composed of 170 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:16:14] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:16:15] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:16:15] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:16:15] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-22 00:16:16] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:16:16] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:16:17] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:16:17] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:16:17] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-22 00:16:18] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:16:18] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:16:19] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:16:20] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:16:20] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:16:20] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:16:21] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:16:21] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:16:22] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:16:22] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:16:22] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:16:25] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:16:26] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:16:28] [INFO ] Deduced a trap composed of 154 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:16:37] [INFO ] Trap strengthening (SAT) tested/added 105/105 trap constraints in 51587 ms
[2023-03-22 00:16:37] [INFO ] After 51737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:16:37] [INFO ] After 52143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 29 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-22 00:16:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:16:37] [INFO ] Invariant cache hit.
[2023-03-22 00:16:38] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-22 00:16:38] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:16:38] [INFO ] Invariant cache hit.
[2023-03-22 00:16:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:16:40] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2023-03-22 00:16:40] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 00:16:40] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:16:40] [INFO ] Invariant cache hit.
[2023-03-22 00:16:40] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2974 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7244 resets, run finished after 1022 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:16:41] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:16:41] [INFO ] Invariant cache hit.
[2023-03-22 00:16:41] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-22 00:16:41] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:16:42] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:16:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:16:42] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:16:42] [INFO ] Deduced a trap composed of 169 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:16:42] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2023-03-22 00:16:42] [INFO ] After 621ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:16:42] [INFO ] After 907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:16:42] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-22 00:16:42] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:16:43] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:16:43] [INFO ] After 176ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:16:43] [INFO ] Deduced a trap composed of 174 places in 526 ms of which 0 ms to minimize.
[2023-03-22 00:16:44] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:16:44] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:16:44] [INFO ] Deduced a trap composed of 174 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:16:44] [INFO ] Deduced a trap composed of 172 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:16:45] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:16:45] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:16:45] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:16:45] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:16:46] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:16:46] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:16:46] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:16:47] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:16:47] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:16:47] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:16:47] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:16:48] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:16:48] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:16:48] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:16:48] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:16:49] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:16:49] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:16:49] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:16:50] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:16:50] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:16:50] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:16:50] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:16:51] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 1 ms to minimize.
[2023-03-22 00:16:51] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:16:51] [INFO ] Deduced a trap composed of 175 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:16:52] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 0 ms to minimize.
[2023-03-22 00:16:52] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:16:52] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:16:53] [INFO ] Deduced a trap composed of 158 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:16:54] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:16:54] [INFO ] Deduced a trap composed of 154 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:16:54] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:16:55] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:16:55] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:16:55] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:16:55] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:16:56] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:16:56] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:16:56] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:16:57] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:16:57] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:16:57] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:16:57] [INFO ] Deduced a trap composed of 152 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:16:58] [INFO ] Deduced a trap composed of 162 places in 288 ms of which 0 ms to minimize.
[2023-03-22 00:16:58] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:16:59] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:16:59] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:16:59] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:17:00] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:17:00] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:17:00] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 1 ms to minimize.
[2023-03-22 00:17:01] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:17:01] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:17:01] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:17:02] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:17:02] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:17:02] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:17:03] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:17:03] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:17:03] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:17:03] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:17:04] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 1 ms to minimize.
[2023-03-22 00:17:04] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 0 ms to minimize.
[2023-03-22 00:17:04] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 0 ms to minimize.
[2023-03-22 00:17:05] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:17:05] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2023-03-22 00:17:05] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 3 ms to minimize.
[2023-03-22 00:17:06] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:17:06] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:17:06] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:17:07] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:17:07] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:17:07] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-22 00:17:08] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:17:08] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:17:08] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:17:09] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:17:09] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:17:09] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:17:10] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:17:10] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:17:10] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:17:11] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:17:11] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:17:11] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:17:12] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:17:12] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:17:12] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:17:12] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-22 00:17:13] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:17:14] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:17:15] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:17:15] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:17:18] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:17:18] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:17:19] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:17:19] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2023-03-22 00:17:19] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:17:20] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:17:22] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:17:23] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-22 00:17:23] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:17:23] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:17:25] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 0 ms to minimize.
[2023-03-22 00:17:31] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:17:31] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:17:40] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 57208 ms
[2023-03-22 00:17:40] [INFO ] After 57447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:17:40] [INFO ] After 57745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72760 resets, run finished after 9046 ms. (steps per millisecond=110 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9626 resets, run finished after 1695 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5542135 steps, run timeout after 30001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 5542135 steps, saw 960431 distinct states, run finished after 30001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:18:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:18:21] [INFO ] Invariant cache hit.
[2023-03-22 00:18:21] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-22 00:18:21] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:18:21] [INFO ] After 238ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:18:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:18:21] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:18:21] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:18:21] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-22 00:18:21] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:18:22] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:18:22] [INFO ] After 203ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:18:22] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 1 ms to minimize.
[2023-03-22 00:18:22] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:18:23] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:18:23] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:18:23] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:18:23] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:18:24] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:18:24] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:18:24] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:18:25] [INFO ] Deduced a trap composed of 175 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:18:25] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:18:25] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 1 ms to minimize.
[2023-03-22 00:18:25] [INFO ] Deduced a trap composed of 150 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:18:26] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:18:26] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:18:26] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:18:27] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:18:27] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:18:27] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:18:27] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:18:28] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:18:28] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:18:28] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:18:28] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:18:29] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:18:29] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:18:29] [INFO ] Deduced a trap composed of 168 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:18:30] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:18:30] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:18:30] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:18:30] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:18:31] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 0 ms to minimize.
[2023-03-22 00:18:31] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:18:31] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:18:32] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:18:32] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:18:32] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:18:32] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:18:33] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:18:33] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 0 ms to minimize.
[2023-03-22 00:18:33] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:18:34] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-22 00:18:34] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:18:34] [INFO ] Deduced a trap composed of 177 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:18:34] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:18:35] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:18:35] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:18:35] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:18:35] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:18:36] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:18:36] [INFO ] Deduced a trap composed of 154 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:18:36] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 1 ms to minimize.
[2023-03-22 00:18:36] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:18:37] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:18:37] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 0 ms to minimize.
[2023-03-22 00:18:37] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:18:38] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:18:38] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:18:39] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:18:39] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:18:39] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:18:40] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:18:40] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 1 ms to minimize.
[2023-03-22 00:18:40] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:18:42] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:18:42] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:18:42] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:18:43] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:18:43] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:18:43] [INFO ] Deduced a trap composed of 168 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:18:44] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:18:44] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:18:45] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-22 00:18:46] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:18:46] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:18:46] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 0 ms to minimize.
[2023-03-22 00:18:47] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:18:47] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:18:47] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:18:48] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 0 ms to minimize.
[2023-03-22 00:18:48] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:18:48] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:18:49] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:18:49] [INFO ] Deduced a trap composed of 162 places in 254 ms of which 0 ms to minimize.
[2023-03-22 00:18:50] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:18:50] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:18:50] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:18:52] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:18:53] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:18:53] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:18:53] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:18:54] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:18:54] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:18:55] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:18:56] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:18:56] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:18:57] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:18:57] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:18:58] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:18:58] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:18:59] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 1 ms to minimize.
[2023-03-22 00:18:59] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:19:00] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:19:00] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 1 ms to minimize.
[2023-03-22 00:19:04] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:19:04] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 1 ms to minimize.
[2023-03-22 00:19:04] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 1 ms to minimize.
[2023-03-22 00:19:05] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 1 ms to minimize.
[2023-03-22 00:19:05] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 1 ms to minimize.
[2023-03-22 00:19:06] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:19:06] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:19:06] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:19:07] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:19:08] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:19:08] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:19:10] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:19:19] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 57549 ms
[2023-03-22 00:19:19] [INFO ] After 57834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:19:19] [INFO ] After 58134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-22 00:19:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:19:19] [INFO ] Invariant cache hit.
[2023-03-22 00:19:20] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-22 00:19:20] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:19:20] [INFO ] Invariant cache hit.
[2023-03-22 00:19:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:19:21] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
[2023-03-22 00:19:21] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 00:19:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:19:21] [INFO ] Invariant cache hit.
[2023-03-22 00:19:22] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2354 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7244 resets, run finished after 909 ms. (steps per millisecond=110 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:19:23] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:19:23] [INFO ] Invariant cache hit.
[2023-03-22 00:19:23] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-22 00:19:23] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:19:23] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:19:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:19:23] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:19:23] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:19:24] [INFO ] Deduced a trap composed of 160 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:19:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2023-03-22 00:19:24] [INFO ] After 605ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:19:24] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:19:24] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-22 00:19:24] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:19:24] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:19:24] [INFO ] After 177ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:19:24] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:19:25] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:19:25] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:19:25] [INFO ] Deduced a trap composed of 174 places in 231 ms of which 0 ms to minimize.
[2023-03-22 00:19:25] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:19:26] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:19:26] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:19:26] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:19:26] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:19:27] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:19:27] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:19:27] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 0 ms to minimize.
[2023-03-22 00:19:27] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:19:28] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:19:28] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:19:28] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:19:29] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:29] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:19:29] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:19:29] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:19:30] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:19:30] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:19:30] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:19:30] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:19:31] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:19:31] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:19:31] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:19:32] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:19:32] [INFO ] Deduced a trap composed of 168 places in 245 ms of which 0 ms to minimize.
[2023-03-22 00:19:32] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 1 ms to minimize.
[2023-03-22 00:19:32] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:19:33] [INFO ] Deduced a trap composed of 169 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:19:33] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:19:34] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 1 ms to minimize.
[2023-03-22 00:19:35] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:19:35] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:19:35] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:19:35] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2023-03-22 00:19:36] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:36] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 0 ms to minimize.
[2023-03-22 00:19:36] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:19:37] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:19:37] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:19:37] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:19:37] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:19:38] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:19:38] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:19:38] [INFO ] Deduced a trap composed of 152 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:19:39] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-22 00:19:39] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-22 00:19:39] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:19:40] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:19:40] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:19:40] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:41] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:19:41] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2023-03-22 00:19:42] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:19:42] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:19:42] [INFO ] Deduced a trap composed of 154 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:19:42] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:43] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:19:43] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-22 00:19:43] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-22 00:19:43] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:44] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:19:44] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:19:44] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:45] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:19:45] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:45] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:19:46] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:19:46] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:19:46] [INFO ] Deduced a trap composed of 173 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:19:46] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:19:47] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:47] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:19:47] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:19:48] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:19:48] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:19:49] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:19:49] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:19:49] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:19:50] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:19:50] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:19:50] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:19:51] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:19:51] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:19:52] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:19:52] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 1 ms to minimize.
[2023-03-22 00:19:52] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 0 ms to minimize.
[2023-03-22 00:19:52] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:19:53] [INFO ] Deduced a trap composed of 156 places in 234 ms of which 1 ms to minimize.
[2023-03-22 00:19:53] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:19:53] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:19:54] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:19:55] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-22 00:19:56] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:19:56] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:19:59] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2023-03-22 00:19:59] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:20:00] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:20:00] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:20:00] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:20:01] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 0 ms to minimize.
[2023-03-22 00:20:03] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:20:04] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-22 00:20:04] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:20:04] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:20:06] [INFO ] Deduced a trap composed of 152 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:20:12] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:20:12] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:20:21] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 57035 ms
[2023-03-22 00:20:21] [INFO ] After 57276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:20:21] [INFO ] After 57559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 713 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 526240 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 526240 steps, saw 85674 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:24] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:20:24] [INFO ] Invariant cache hit.
[2023-03-22 00:20:24] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-22 00:20:24] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:20:25] [INFO ] After 231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:20:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:20:25] [INFO ] After 68ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:25] [INFO ] After 402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-22 00:20:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:20:25] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:25] [INFO ] After 138ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:26] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:20:26] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 0 ms to minimize.
[2023-03-22 00:20:26] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:20:26] [INFO ] Deduced a trap composed of 168 places in 236 ms of which 0 ms to minimize.
[2023-03-22 00:20:27] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-22 00:20:27] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:20:27] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:20:27] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:20:28] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:20:28] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:20:28] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:20:29] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:20:29] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:20:29] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:20:29] [INFO ] Deduced a trap composed of 185 places in 209 ms of which 1 ms to minimize.
[2023-03-22 00:20:30] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:20:30] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 1 ms to minimize.
[2023-03-22 00:20:31] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:20:31] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:20:31] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:20:31] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:20:32] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:20:32] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:20:32] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:20:32] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 1 ms to minimize.
[2023-03-22 00:20:33] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:20:33] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:20:33] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:20:34] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:20:34] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:20:35] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:20:36] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:20:36] [INFO ] Deduced a trap composed of 173 places in 235 ms of which 0 ms to minimize.
[2023-03-22 00:20:36] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 1 ms to minimize.
[2023-03-22 00:20:37] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:20:37] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:20:37] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:20:38] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 0 ms to minimize.
[2023-03-22 00:20:38] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2023-03-22 00:20:38] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:20:39] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:20:39] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:20:39] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 1 ms to minimize.
[2023-03-22 00:20:39] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:20:40] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:20:40] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-22 00:20:40] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:20:41] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:20:41] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:20:41] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:20:42] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:20:42] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:20:42] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:20:42] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:20:43] [INFO ] Deduced a trap composed of 152 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:20:44] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:20:44] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:20:44] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:20:44] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:20:45] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:20:45] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:20:45] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:20:46] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:20:46] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-22 00:20:46] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:20:47] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2023-03-22 00:20:47] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:20:47] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2023-03-22 00:20:47] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:20:48] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:20:48] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 0 ms to minimize.
[2023-03-22 00:20:50] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 24452 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:20:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:20:50] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-22 00:20:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:20:50] [INFO ] Invariant cache hit.
[2023-03-22 00:20:50] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 10000 steps, including 707 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 103 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 527530 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 527530 steps, saw 85882 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:53] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:20:53] [INFO ] Invariant cache hit.
[2023-03-22 00:20:53] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-22 00:20:53] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:20:54] [INFO ] After 240ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:20:54] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:54] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:20:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-22 00:20:54] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:20:54] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:54] [INFO ] After 140ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:20:54] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:20:55] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:20:55] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:20:55] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:20:56] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-22 00:20:56] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:20:56] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-22 00:20:56] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:20:57] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:20:57] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:20:57] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-22 00:20:57] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:20:58] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 0 ms to minimize.
[2023-03-22 00:20:58] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:20:58] [INFO ] Deduced a trap composed of 185 places in 206 ms of which 1 ms to minimize.
[2023-03-22 00:20:59] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:20:59] [INFO ] Deduced a trap composed of 175 places in 233 ms of which 1 ms to minimize.
[2023-03-22 00:20:59] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 0 ms to minimize.
[2023-03-22 00:21:00] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-22 00:21:00] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2023-03-22 00:21:00] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-22 00:21:00] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-22 00:21:01] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:21:01] [INFO ] Deduced a trap composed of 179 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:21:01] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:21:02] [INFO ] Deduced a trap composed of 171 places in 229 ms of which 0 ms to minimize.
[2023-03-22 00:21:02] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:21:02] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:21:03] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2023-03-22 00:21:03] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:21:04] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:21:04] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:21:04] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:21:04] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:21:05] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 0 ms to minimize.
[2023-03-22 00:21:05] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:21:07] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-22 00:21:07] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:21:07] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:21:07] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:21:08] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:21:08] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:21:08] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-22 00:21:08] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:21:09] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-22 00:21:09] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-22 00:21:09] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:21:10] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-22 00:21:10] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-22 00:21:10] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:21:11] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-22 00:21:11] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:21:11] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2023-03-22 00:21:11] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2023-03-22 00:21:12] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:21:12] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:21:12] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-22 00:21:12] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:21:13] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-22 00:21:13] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:21:13] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:21:14] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:21:14] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:21:14] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2023-03-22 00:21:15] [INFO ] Deduced a trap composed of 154 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:21:15] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 1 ms to minimize.
[2023-03-22 00:21:15] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 0 ms to minimize.
[2023-03-22 00:21:16] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:21:16] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:21:16] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2023-03-22 00:21:17] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 0 ms to minimize.
[2023-03-22 00:21:19] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 24569 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:21:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:21:19] [INFO ] After 25024ms 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 24 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-22 00:21:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:21:19] [INFO ] Invariant cache hit.
[2023-03-22 00:21:19] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-22 00:21:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:21:19] [INFO ] Invariant cache hit.
[2023-03-22 00:21:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:21:21] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-22 00:21:21] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 00:21:21] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-22 00:21:21] [INFO ] Invariant cache hit.
[2023-03-22 00:21:21] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2136 ms. 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 1 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 78 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-22 00:21:21] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-22 00:21:21] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-22 00:21:21] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:21:21] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:21:21] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-22 00:21:21] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:21:21] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:21:22] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:21:22] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 0 ms to minimize.
[2023-03-22 00:21:22] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:21:22] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:21:23] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:23] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2023-03-22 00:21:23] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2023-03-22 00:21:23] [INFO ] Deduced a trap composed of 154 places in 191 ms of which 1 ms to minimize.
[2023-03-22 00:21:23] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:21:24] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 1 ms to minimize.
[2023-03-22 00:21:24] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:21:24] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:21:24] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 1 ms to minimize.
[2023-03-22 00:21:25] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:21:25] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:21:25] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:21:25] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:25] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:21:26] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:26] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2023-03-22 00:21:26] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:21:26] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-22 00:21:27] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:27] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 0 ms to minimize.
[2023-03-22 00:21:27] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:21:27] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:21:28] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2023-03-22 00:21:28] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:21:28] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2023-03-22 00:21:28] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2023-03-22 00:21:28] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:21:29] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:21:29] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 1 ms to minimize.
[2023-03-22 00:21:29] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:21:29] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 1 ms to minimize.
[2023-03-22 00:21:30] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 1 ms to minimize.
[2023-03-22 00:21:31] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:21:31] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:21:31] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 0 ms to minimize.
[2023-03-22 00:21:31] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-22 00:21:32] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 0 ms to minimize.
[2023-03-22 00:21:32] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 1 ms to minimize.
[2023-03-22 00:21:32] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 1 ms to minimize.
[2023-03-22 00:21:32] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:21:33] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2023-03-22 00:21:33] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:21:33] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2023-03-22 00:21:34] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-22 00:21:34] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-22 00:21:34] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:34] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 0 ms to minimize.
[2023-03-22 00:21:35] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2023-03-22 00:21:36] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 1 ms to minimize.
[2023-03-22 00:21:36] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:36] [INFO ] Deduced a trap composed of 159 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:21:36] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:37] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-22 00:21:38] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 1 ms to minimize.
[2023-03-22 00:21:38] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:21:38] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:21:38] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 154 places in 213 ms of which 0 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 1 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 1 ms to minimize.
[2023-03-22 00:21:40] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:21:40] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:21:40] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-22 00:21:40] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-22 00:21:41] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:21:41] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:21:41] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:21:41] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:21:42] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-22 00:21:42] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2023-03-22 00:21:42] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-22 00:21:42] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 0 ms to minimize.
[2023-03-22 00:25:06] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 224721 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:25:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:25:06] [INFO ] After 225017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
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 96 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:25:06] [INFO ] Invariant cache hit.
[2023-03-22 00:25:06] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-22 00:25:06] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-22 00:25:06] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:25:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-22 00:25:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-22 00:25:07] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:25:07] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:25:07] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2023-03-22 00:25:07] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:25:08] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:08] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:08] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:08] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:09] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 0 ms to minimize.
[2023-03-22 00:25:09] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:09] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 0 ms to minimize.
[2023-03-22 00:25:09] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2023-03-22 00:25:10] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:25:10] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:25:10] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 0 ms to minimize.
[2023-03-22 00:25:10] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:25:11] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 0 ms to minimize.
[2023-03-22 00:25:11] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:25:11] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:25:11] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:25:11] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-22 00:25:12] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-22 00:25:12] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2023-03-22 00:25:12] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-22 00:25:12] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:25:13] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:25:13] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2023-03-22 00:25:13] [INFO ] Deduced a trap composed of 152 places in 218 ms of which 1 ms to minimize.
[2023-03-22 00:25:13] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 1 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 0 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2023-03-22 00:25:14] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-22 00:25:15] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:25:15] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:25:15] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 0 ms to minimize.
[2023-03-22 00:25:15] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 0 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:16] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2023-03-22 00:25:17] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:25:17] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:25:17] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 0 ms to minimize.
[2023-03-22 00:25:17] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 0 ms to minimize.
[2023-03-22 00:25:18] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:25:18] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-22 00:25:18] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:25:18] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 1 ms to minimize.
[2023-03-22 00:25:19] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:25:19] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:25:19] [INFO ] Deduced a trap composed of 152 places in 203 ms of which 1 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2023-03-22 00:25:20] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2023-03-22 00:25:21] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2023-03-22 00:25:21] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:25:21] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 0 ms to minimize.
[2023-03-22 00:25:21] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-22 00:25:22] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:25:23] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2023-03-22 00:25:23] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:25:23] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-22 00:25:23] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:25:24] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 1 ms to minimize.
[2023-03-22 00:25:24] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 0 ms to minimize.
[2023-03-22 00:25:24] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:25:24] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 0 ms to minimize.
[2023-03-22 00:25:25] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:25:25] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 13 ms to minimize.
[2023-03-22 00:25:25] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 0 ms to minimize.
[2023-03-22 00:25:25] [INFO ] Deduced a trap composed of 152 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:25:25] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:25:26] [INFO ] Deduced a trap composed of 165 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:26] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:25:26] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:25:26] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2023-03-22 00:25:27] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:25:28] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:25:28] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 0 ms to minimize.
[2023-03-22 00:25:28] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 0 ms to minimize.
[2023-03-22 00:25:28] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-22 00:25:29] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 0 ms to minimize.
[2023-03-22 00:25:29] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-22 00:25:29] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:29] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:25:29] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 0 ms to minimize.
[2023-03-22 00:25:30] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:25:30] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-22 00:25:30] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2023-03-22 00:25:30] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 0 ms to minimize.
[2023-03-22 00:25:31] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2023-03-22 00:25:31] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:25:31] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:25:31] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:25:31] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:25:32] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:25:32] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 1 ms to minimize.
[2023-03-22 00:25:32] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 0 ms to minimize.
[2023-03-22 00:25:32] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2023-03-22 00:25:33] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:25:33] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:33] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 1 ms to minimize.
[2023-03-22 00:25:33] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-22 00:25:33] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:25:34] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:25:34] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:34] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-22 00:25:35] [INFO ] Deduced a trap composed of 154 places in 182 ms of which 1 ms to minimize.
[2023-03-22 00:25:35] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-22 00:25:35] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:25:36] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 1 ms to minimize.
[2023-03-22 00:25:36] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:25:36] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 23 ms to minimize.
[2023-03-22 00:25:37] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 1 ms to minimize.
[2023-03-22 00:25:37] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:25:37] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2023-03-22 00:25:37] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2023-03-22 00:25:38] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 1 ms to minimize.
[2023-03-22 00:25:38] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-22 00:25:38] [INFO ] Deduced a trap composed of 150 places in 195 ms of which 0 ms to minimize.
[2023-03-22 00:25:38] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:25:38] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 1 ms to minimize.
[2023-03-22 00:25:39] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 0 ms to minimize.
[2023-03-22 00:25:39] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2023-03-22 00:25:40] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:40] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 0 ms to minimize.
[2023-03-22 00:25:40] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:25:40] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 0 ms to minimize.
[2023-03-22 00:25:41] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 1 ms to minimize.
[2023-03-22 00:25:41] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-22 00:25:41] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 0 ms to minimize.
[2023-03-22 00:25:41] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 1 ms to minimize.
[2023-03-22 00:25:41] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2023-03-22 00:25:42] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-22 00:25:42] [INFO ] Deduced a trap composed of 152 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:42] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:25:42] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:43] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2023-03-22 00:25:43] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-22 00:25:43] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-22 00:25:45] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 0 ms to minimize.
[2023-03-22 00:25:45] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-22 00:25:45] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:25:45] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-22 00:25:46] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 1 ms to minimize.
[2023-03-22 00:25:46] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-22 00:25:46] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-22 00:25:46] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2023-03-22 00:25:47] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2023-03-22 00:25:47] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 0 ms to minimize.
[2023-03-22 00:25:47] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-22 00:25:47] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 1 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-22 00:25:48] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-22 00:28:51] [INFO ] Trap strengthening (SAT) tested/added 169/169 trap constraints in 224682 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:28:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:28:51] [INFO ] After 225017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 887814 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S10J20
BK_EXAMINATION: QuasiLiveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: QuasiLiveness
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15248176 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16153328 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: TR BINDINGS
lola: TR BINDINGS DONE
lola: Places: 494, Transitions: 11780
lola: @ trans NoJob
lola: @ trans fi1
lola: @ trans fi3
lola: @ trans trans_689
lola: @ trans DummyOR1
lola: @ trans fo3
lola: @ trans fi2
lola: @ trans trans_457
lola: @ trans WillPerformWork
lola: @ trans trans_461
lola: @ trans MustCheck
lola: @ trans trans_508
lola: @ trans trans_509
lola: @ trans trans_534
lola: @ trans fo2
lola: @ trans LeaveCSTCS
lola: @ trans trans_478
lola: @ trans trans_459
lola: @ trans trans_533
lola: @ trans trans_510
lola: @ trans GoPerformWork
lola: @ trans Run
lola: @ trans trans_685
lola: @ trans GoCheckSource
lola: @ trans fo1
lola: @ trans trans_486
lola: @ trans trans_511
lola: @ trans JobExist
lola: @ trans NotifyEventEndOfCheckSources
lola: @ trans EnterCSTCS
lola: @ trans trans_489
lola: @ trans IsEvt
lola: @ trans trans_463
lola: @ trans trans_776
lola: @ trans trans_488
lola: @ trans trans_487
lola: @ trans DummyOR2
lola: @ trans trans_376
lola: STATE EQUATION TRIES TRANSITION t10578
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-7468.sara.
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1024
lola: find path: 114
lola: goal oriented search: 3
lola: symmetry: 1
lola: high level: 10638
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: reporting
lola: not produced: 1
lola: find path: 114
lola: goal oriented search: 12
lola: symmetry: 1
lola: high level: 11652
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 910 secs. Pages in use: 17

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="lolaxred"
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 lolaxred"
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 r309-tall-167873963000422"
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 ;