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-167873962900402.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-S05J30, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r309-tall-167873962900402
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679443527115

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-S05J30
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:05:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:05:28] [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:05:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:05:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 711 ms
[2023-03-22 00:05:29] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 20 ms.
[2023-03-22 00:05:29] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 47 ms.
[2023-03-22 00:05:29] [INFO ] Unfolded 38 HLPN properties in 7 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:05:29] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-22 00:05:29] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-22 00:05:29] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 675 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-22 00:05:30] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-22 00:05:30] [INFO ] Computed 82 place invariants in 40 ms
[2023-03-22 00:05:30] [INFO ] [Real]Absence check using 75 positive place invariants in 154 ms returned sat
[2023-03-22 00:05:30] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:05:30] [INFO ] After 729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:31] [INFO ] [Nat]Absence check using 75 positive place invariants in 28 ms returned sat
[2023-03-22 00:05:31] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:05:31] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:05:40] [INFO ] After 9006ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:05:40] [INFO ] After 9677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 448 transition count 674
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 413 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 412 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 412 transition count 673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 410 transition count 671
Applied a total of 153 rules in 157 ms. Remains 410 /489 variables (removed 79) and now considering 671/745 (removed 74) transitions.
[2023-03-22 00:05:40] [INFO ] Flow matrix only has 667 transitions (discarded 4 similar events)
// Phase 1: matrix 667 rows 410 cols
[2023-03-22 00:05:40] [INFO ] Computed 77 place invariants in 25 ms
[2023-03-22 00:05:41] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/489 places, 576/745 transitions.
Applied a total of 0 rules in 50 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 410/489 places, 576/745 transitions.
Incomplete random walk after 1000000 steps, including 51958 resets, run finished after 3615 ms. (steps per millisecond=276 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5590 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2861750 steps, run timeout after 12001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 2861750 steps, saw 835757 distinct states, run finished after 12004 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:05:57] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-22 00:05:57] [INFO ] Computed 77 place invariants in 19 ms
[2023-03-22 00:05:58] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2023-03-22 00:05:58] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-22 00:05:58] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:58] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:05:58] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:05:58] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:05:58] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:58] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 6 ms to minimize.
[2023-03-22 00:05:58] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 1 ms to minimize.
[2023-03-22 00:05:58] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 1 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 1 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 0 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 1 ms to minimize.
[2023-03-22 00:05:59] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2023-03-22 00:06:00] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:06:00] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:06:00] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:06:00] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 0 ms to minimize.
[2023-03-22 00:06:00] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-22 00:06:00] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 1 ms to minimize.
[2023-03-22 00:06:01] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 0 ms to minimize.
[2023-03-22 00:06:01] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:06:01] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 0 ms to minimize.
[2023-03-22 00:06:01] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 0 ms to minimize.
[2023-03-22 00:06:01] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:06:02] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:06:02] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:06:02] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:06:02] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:06:02] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:06:03] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:06:03] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 0 ms to minimize.
[2023-03-22 00:06:03] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:06:03] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:06:04] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:06:04] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:06:04] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:06:04] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:06:04] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:06:05] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:06:05] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:06:05] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:06:05] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2023-03-22 00:06:06] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:06:06] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:06:08] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2023-03-22 00:06:09] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 2 ms to minimize.
[2023-03-22 00:06:09] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:06:10] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:06:10] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:06:10] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:06:10] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:06:11] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:06:11] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:06:11] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 1 ms to minimize.
[2023-03-22 00:06:11] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:06:12] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:06:12] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:06:12] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:06:13] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:06:13] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:06:13] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 0 ms to minimize.
[2023-03-22 00:06:13] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 3 ms to minimize.
[2023-03-22 00:06:14] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:06:16] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:06:17] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:06:18] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:06:18] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2023-03-22 00:06:18] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:06:19] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:06:19] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 1 ms to minimize.
[2023-03-22 00:06:23] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:06:32] [INFO ] Trap strengthening (SAT) tested/added 66/66 trap constraints in 34314 ms
[2023-03-22 00:06:32] [INFO ] After 34453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:06:32] [INFO ] After 34745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 00:06:32] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:06:32] [INFO ] Invariant cache hit.
[2023-03-22 00:06:33] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-22 00:06:33] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:06:33] [INFO ] Invariant cache hit.
[2023-03-22 00:06:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:34] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2023-03-22 00:06:34] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 00:06:34] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:06:34] [INFO ] Invariant cache hit.
[2023-03-22 00:06:34] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2114 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5236 resets, run finished after 408 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:06:35] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:06:35] [INFO ] Invariant cache hit.
[2023-03-22 00:06:35] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-22 00:06:35] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:06:35] [INFO ] After 139ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:06:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:06:35] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:06:35] [INFO ] After 87ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:35] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:35] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:06:35] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-22 00:06:36] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:36] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 2 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 1 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 1 ms to minimize.
[2023-03-22 00:06:36] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 1 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:06:37] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:06:38] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:06:39] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:06:39] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:06:39] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:06:39] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:06:39] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:06:43] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 1 ms to minimize.
[2023-03-22 00:06:45] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:06:46] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:06:50] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:06:53] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 0 ms to minimize.
[2023-03-22 00:06:55] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:07:01] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:07:10] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 34572 ms
[2023-03-22 00:07:10] [INFO ] After 34667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:07:10] [INFO ] After 35113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52084 resets, run finished after 3505 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5523 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2922595 steps, run timeout after 12001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 2922595 steps, saw 854010 distinct states, run finished after 12001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:07:27] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:07:27] [INFO ] Invariant cache hit.
[2023-03-22 00:07:27] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-22 00:07:27] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:07:27] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:07:27] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:07:27] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:07:27] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:07:27] [INFO ] After 80ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:07:28] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:07:29] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 140 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:07:30] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:07:31] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:07:32] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:07:34] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 1 ms to minimize.
[2023-03-22 00:07:34] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2023-03-22 00:07:34] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 1 ms to minimize.
[2023-03-22 00:07:35] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:07:35] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 1 ms to minimize.
[2023-03-22 00:07:36] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 0 ms to minimize.
[2023-03-22 00:07:37] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 0 ms to minimize.
[2023-03-22 00:07:45] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2023-03-22 00:07:46] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 0 ms to minimize.
[2023-03-22 00:07:46] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2023-03-22 00:07:46] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 0 ms to minimize.
[2023-03-22 00:07:47] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:07:48] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2023-03-22 00:07:48] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 1 ms to minimize.
[2023-03-22 00:07:49] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 1 ms to minimize.
[2023-03-22 00:07:50] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:07:53] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 1 ms to minimize.
[2023-03-22 00:07:53] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:07:53] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:07:54] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:08:03] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 35131 ms
[2023-03-22 00:08:03] [INFO ] After 35243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:08:03] [INFO ] After 35688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 00:08:03] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:08:03] [INFO ] Invariant cache hit.
[2023-03-22 00:08:03] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-22 00:08:03] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:08:03] [INFO ] Invariant cache hit.
[2023-03-22 00:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:04] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2023-03-22 00:08:04] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-22 00:08:04] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:08:04] [INFO ] Invariant cache hit.
[2023-03-22 00:08:05] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1984 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5165 resets, run finished after 360 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:08:05] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:08:05] [INFO ] Invariant cache hit.
[2023-03-22 00:08:05] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-22 00:08:05] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:08:05] [INFO ] After 136ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:08:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:05] [INFO ] After 55ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:08:05] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:05] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:05] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:08:05] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:08:06] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:06] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 1 ms to minimize.
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 0 ms to minimize.
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:08:06] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 0 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:08:07] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-22 00:08:08] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 0 ms to minimize.
[2023-03-22 00:08:08] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-22 00:08:08] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 1 ms to minimize.
[2023-03-22 00:08:08] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-22 00:08:08] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 1 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 0 ms to minimize.
[2023-03-22 00:08:09] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2023-03-22 00:08:10] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2023-03-22 00:08:13] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 0 ms to minimize.
[2023-03-22 00:08:16] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2023-03-22 00:08:16] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2023-03-22 00:08:21] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:08:23] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:08:25] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:08:32] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:08:41] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 34948 ms
[2023-03-22 00:08:41] [INFO ] After 35039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:08:41] [INFO ] After 35488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 510 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667047 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667047 steps, saw 205665 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:08:44] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:08:44] [INFO ] Invariant cache hit.
[2023-03-22 00:08:44] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:08:44] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-22 00:08:44] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:08:44] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-22 00:08:44] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:08:44] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:08:44] [INFO ] After 109ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:08:45] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:08:46] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:08:46] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:08:46] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:08:46] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 1 ms to minimize.
[2023-03-22 00:08:46] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:08:46] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:08:46] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:08:47] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:08:47] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:08:47] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:08:47] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 140 places in 104 ms of which 0 ms to minimize.
[2023-03-22 00:08:48] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:08:49] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 0 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:08:50] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:08:51] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:08:51] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 1 ms to minimize.
[2023-03-22 00:08:51] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:08:51] [INFO ] Deduced a trap composed of 119 places in 105 ms of which 1 ms to minimize.
[2023-03-22 00:08:51] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 1 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:08:52] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 138 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:08:53] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:08:54] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:08:54] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 0 ms to minimize.
[2023-03-22 00:08:56] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:09:05] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:05] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:09:05] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:09:06] [INFO ] Deduced a trap composed of 134 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:09:06] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:09:06] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:09:06] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:09:07] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:09:07] [INFO ] Deduced a trap composed of 135 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:07] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:07] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2023-03-22 00:09:08] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 2 ms to minimize.
[2023-03-22 00:09:08] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 1 ms to minimize.
[2023-03-22 00:09:09] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:09:09] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 24485 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:09:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:09:09] [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 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 00:09:09] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:09:09] [INFO ] Invariant cache hit.
[2023-03-22 00:09:09] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 666244 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 666244 steps, saw 205404 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:09:12] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:09:12] [INFO ] Invariant cache hit.
[2023-03-22 00:09:12] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:09:12] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-22 00:09:12] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:09:12] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:09:12] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 00:09:13] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:13] [INFO ] After 108ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:13] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:09:13] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:09:13] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:09:13] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:14] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:14] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:09:14] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:09:14] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:14] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 0 ms to minimize.
[2023-03-22 00:09:14] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 1 ms to minimize.
[2023-03-22 00:09:15] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 1 ms to minimize.
[2023-03-22 00:09:16] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:16] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:09:16] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:17] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:09:17] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:17] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:09:17] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:17] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:17] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:09:18] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:18] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:09:18] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:09:18] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:09:18] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:09:18] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:19] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:09:19] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:19] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:09:19] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:09:19] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 0 ms to minimize.
[2023-03-22 00:09:20] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:09:20] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:09:20] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:20] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:09:20] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:20] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:21] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:09:21] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:09:21] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:09:22] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 2 ms to minimize.
[2023-03-22 00:09:22] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:25] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:34] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 0 ms to minimize.
[2023-03-22 00:09:35] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2023-03-22 00:09:35] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:09:35] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 1 ms to minimize.
[2023-03-22 00:09:36] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:09:37] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 1 ms to minimize.
[2023-03-22 00:09:38] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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:09:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:09:38] [INFO ] After 25119ms 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, 576/576 transitions.
Applied a total of 0 rules in 11 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 11 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 00:09:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:09:38] [INFO ] Invariant cache hit.
[2023-03-22 00:09:38] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-22 00:09:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:09:38] [INFO ] Invariant cache hit.
[2023-03-22 00:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:39] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2023-03-22 00:09:39] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 00:09:39] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-22 00:09:39] [INFO ] Invariant cache hit.
[2023-03-22 00:09:39] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1920 ms. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 54 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2023-03-22 00:09:40] [INFO ] Computed 77 place invariants in 8 ms
[2023-03-22 00:09:40] [INFO ] [Real]Absence check using 70 positive place invariants in 15 ms returned sat
[2023-03-22 00:09:40] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-22 00:09:40] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:09:40] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-22 00:09:40] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-22 00:09:40] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 1 ms to minimize.
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 1 ms to minimize.
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:09:40] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:41] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 1 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 0 ms to minimize.
[2023-03-22 00:09:42] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 1 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 0 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 1 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 1 ms to minimize.
[2023-03-22 00:09:43] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 1 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:09:44] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 1 ms to minimize.
[2023-03-22 00:09:45] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 1 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 0 ms to minimize.
[2023-03-22 00:09:46] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 1 ms to minimize.
[2023-03-22 00:09:47] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:47] [INFO ] Deduced a trap composed of 132 places in 105 ms of which 1 ms to minimize.
[2023-03-22 00:09:47] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:09:47] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:47] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:09:48] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:09:49] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 0 ms to minimize.
[2023-03-22 00:09:50] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:09:51] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2023-03-22 00:09:54] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:09:54] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:09:54] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 1 ms to minimize.
[2023-03-22 00:09:59] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:09:59] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:10:00] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:10:02] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:10:02] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:10:03] [INFO ] Deduced a trap composed of 138 places in 121 ms of which 0 ms to minimize.
[2023-03-22 00:10:06] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:10:08] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 0 ms to minimize.
[2023-03-22 00:10:09] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:10:09] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:10:09] [INFO ] Deduced a trap composed of 138 places in 100 ms of which 1 ms to minimize.
[2023-03-22 00:10:10] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 0 ms to minimize.
[2023-03-22 00:10:10] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:10:14] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:10:16] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 0 ms to minimize.
[2023-03-22 00:10:19] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:10:24] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:10:26] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:10:32] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:10:38] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:10:44] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:10:45] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:10:50] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:10:55] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:10:56] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:11:05] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 84798 ms
[2023-03-22 00:11:05] [INFO ] After 85002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:11:05] [INFO ] After 85098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 93 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:11:05] [INFO ] Invariant cache hit.
[2023-03-22 00:11:05] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-22 00:11:05] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-22 00:11:05] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:11:05] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-22 00:11:05] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-22 00:11:05] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:11:05] [INFO ] Deduced a trap composed of 146 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:11:05] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 148 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 146 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 1 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 0 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 0 ms to minimize.
[2023-03-22 00:11:06] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 1 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:11:07] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 1 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:11:08] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 2 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 1 ms to minimize.
[2023-03-22 00:11:09] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 1 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 126 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 141 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 1 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:11:10] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 1 ms to minimize.
[2023-03-22 00:11:11] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:11:11] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:11:11] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:11] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 1 ms to minimize.
[2023-03-22 00:11:11] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 1 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 0 ms to minimize.
[2023-03-22 00:11:12] [INFO ] Deduced a trap composed of 129 places in 102 ms of which 0 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 0 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 1 ms to minimize.
[2023-03-22 00:11:13] [INFO ] Deduced a trap composed of 117 places in 104 ms of which 1 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 0 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:11:14] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 1 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:11:15] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:11:16] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 135 places in 118 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 0 ms to minimize.
[2023-03-22 00:11:17] [INFO ] Deduced a trap composed of 144 places in 115 ms of which 1 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 114 places in 102 ms of which 0 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:18] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:11:19] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:11:19] [INFO ] Deduced a trap composed of 127 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:11:20] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 0 ms to minimize.
[2023-03-22 00:11:20] [INFO ] Deduced a trap composed of 129 places in 102 ms of which 1 ms to minimize.
[2023-03-22 00:11:20] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 1 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 144 places in 110 ms of which 0 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 129 places in 102 ms of which 1 ms to minimize.
[2023-03-22 00:11:21] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2023-03-22 00:11:22] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 1 ms to minimize.
[2023-03-22 00:11:25] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 0 ms to minimize.
[2023-03-22 00:11:25] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 0 ms to minimize.
[2023-03-22 00:11:34] [INFO ] Trap strengthening (SAT) tested/added 96/96 trap constraints in 29133 ms
[2023-03-22 00:11:34] [INFO ] After 29391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:11:34] [INFO ] After 29470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 366216 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S05J30
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: 12508796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16116560 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: 519, Transitions: 1430
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 t19
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-209.sara.
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 159
lola: find path: 176
lola: goal oriented search: 95
lola: high level: 1000
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134

lola: SARA FINISHED
lola: STATE EQUATION TRIES TRANSITION t638
sara: try reading problem file stateEquationProblem-QuasiLiveness-1168.sara.
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: reporting
lola: not produced: 1
lola: find path: 176
lola: goal oriented search: 118
lola: symmetry: 1
lola: high level: 1134
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1432 secs. Pages in use: 286

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J30"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="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-S05J30, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r309-tall-167873962900402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J30.tgz
mv PolyORBNT-COL-S05J30 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;