Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 23:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 23:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 23:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 23:33 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 93K 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 1678891304539

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J40
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:41:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:41:49] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 14:41:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:41:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 500 ms
[2023-03-15 14:41:49] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 18 ms.
[2023-03-15 14:41:49] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 56 ms.
[2023-03-15 14:41:49] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:41:49] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 14:41:49] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 14:41:49] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 692 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 14:41:50] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-15 14:41:50] [INFO ] Computed 102 place invariants in 62 ms
[2023-03-15 14:41:51] [INFO ] [Real]Absence check using 95 positive place invariants in 58 ms returned sat
[2023-03-15 14:41:51] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:41:51] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:41:51] [INFO ] [Nat]Absence check using 95 positive place invariants in 34 ms returned sat
[2023-03-15 14:41:51] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:41:51] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:41:56] [INFO ] After 4075ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:56] [INFO ] After 4165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-15 14:41:56] [INFO ] After 5117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 844
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 843
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 530 transition count 841
Applied a total of 193 rules in 182 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
[2023-03-15 14:41:56] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2023-03-15 14:41:56] [INFO ] Computed 97 place invariants in 34 ms
[2023-03-15 14:41:56] [INFO ] Dead Transitions using invariants and state equation in 551 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 : 530/629 places, 746/935 transitions.
Applied a total of 0 rules in 40 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 775 ms. Remains : 530/629 places, 746/935 transitions.
Incomplete random walk after 1000000 steps, including 52129 resets, run finished after 4261 ms. (steps per millisecond=234 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4703 resets, run finished after 1165 ms. (steps per millisecond=858 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2913298 steps, run timeout after 15001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 2913298 steps, saw 872283 distinct states, run finished after 15004 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:42:17] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 14:42:17] [INFO ] Computed 97 place invariants in 21 ms
[2023-03-15 14:42:17] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-15 14:42:17] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:42:17] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:17] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-15 14:42:17] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 14:42:17] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:18] [INFO ] After 178ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:18] [INFO ] Deduced a trap composed of 110 places in 185 ms of which 1 ms to minimize.
[2023-03-15 14:42:18] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 2 ms to minimize.
[2023-03-15 14:42:18] [INFO ] Deduced a trap composed of 175 places in 192 ms of which 2 ms to minimize.
[2023-03-15 14:42:18] [INFO ] Deduced a trap composed of 179 places in 193 ms of which 1 ms to minimize.
[2023-03-15 14:42:19] [INFO ] Deduced a trap composed of 182 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:42:19] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:42:19] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:42:19] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:42:20] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:42:20] [INFO ] Deduced a trap composed of 176 places in 148 ms of which 1 ms to minimize.
[2023-03-15 14:42:20] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:42:20] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:42:20] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 167 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 176 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 179 places in 148 ms of which 2 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 176 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 2 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 173 places in 143 ms of which 1 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 182 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 2 ms to minimize.
[2023-03-15 14:42:27] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:42:28] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:42:28] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:42:29] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:42:29] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 1 ms to minimize.
[2023-03-15 14:42:29] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:42:30] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:42:30] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:42:30] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:42:31] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:42:31] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 2 ms to minimize.
[2023-03-15 14:42:32] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 1 ms to minimize.
[2023-03-15 14:42:33] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:42:33] [INFO ] Deduced a trap composed of 176 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:42:34] [INFO ] Deduced a trap composed of 185 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:42:43] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 25077 ms
[2023-03-15 14:42:43] [INFO ] After 25368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:42:43] [INFO ] After 25731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 36 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 30 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 14:42:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:42:43] [INFO ] Invariant cache hit.
[2023-03-15 14:42:43] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-15 14:42:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:42:43] [INFO ] Invariant cache hit.
[2023-03-15 14:42:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:45] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2023-03-15 14:42:45] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-15 14:42:45] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:42:45] [INFO ] Invariant cache hit.
[2023-03-15 14:42:45] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2628 ms. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5188 resets, run finished after 617 ms. (steps per millisecond=162 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:42:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:42:46] [INFO ] Invariant cache hit.
[2023-03-15 14:42:46] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 14:42:46] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:42:46] [INFO ] After 199ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:42:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:46] [INFO ] After 47ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:42:46] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:46] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:47] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-15 14:42:47] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:42:47] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:47] [INFO ] After 98ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 5 ms to minimize.
[2023-03-15 14:42:47] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 185 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 176 places in 166 ms of which 1 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 2 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 179 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 155 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 176 places in 146 ms of which 0 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 0 ms to minimize.
[2023-03-15 14:42:54] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 0 ms to minimize.
[2023-03-15 14:42:54] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 0 ms to minimize.
[2023-03-15 14:42:54] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:42:54] [INFO ] Deduced a trap composed of 185 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:42:55] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 1 ms to minimize.
[2023-03-15 14:42:55] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:42:55] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:42:55] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:42:55] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:42:56] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:42:56] [INFO ] Deduced a trap composed of 173 places in 165 ms of which 0 ms to minimize.
[2023-03-15 14:42:56] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:42:57] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:42:57] [INFO ] Deduced a trap composed of 176 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:42:57] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:42:58] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:42:58] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 1 ms to minimize.
[2023-03-15 14:42:59] [INFO ] Deduced a trap composed of 149 places in 165 ms of which 1 ms to minimize.
[2023-03-15 14:43:00] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:43:00] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 0 ms to minimize.
[2023-03-15 14:43:00] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 1 ms to minimize.
[2023-03-15 14:43:01] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:43:03] [INFO ] Deduced a trap composed of 179 places in 179 ms of which 0 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:43:10] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:43:16] [INFO ] Deduced a trap composed of 167 places in 183 ms of which 0 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 185 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:43:20] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 188 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:43:21] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 155 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 158 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 1 ms to minimize.
[2023-03-15 14:43:28] [INFO ] Deduced a trap composed of 158 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:43:28] [INFO ] Deduced a trap composed of 152 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:43:29] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:43:30] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 1 ms to minimize.
[2023-03-15 14:43:35] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:43:36] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:43:37] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:43:38] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:43:39] [INFO ] Deduced a trap composed of 189 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 198 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:43:46] [INFO ] Deduced a trap composed of 152 places in 143 ms of which 1 ms to minimize.
[2023-03-15 14:43:55] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 68361 ms
[2023-03-15 14:43:55] [INFO ] After 68512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:55] [INFO ] After 68820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 51916 resets, run finished after 4028 ms. (steps per millisecond=248 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4535 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2971568 steps, run timeout after 15001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 2971568 steps, saw 889446 distinct states, run finished after 15003 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:44:15] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:44:15] [INFO ] Invariant cache hit.
[2023-03-15 14:44:15] [INFO ] [Real]Absence check using 90 positive place invariants in 34 ms returned sat
[2023-03-15 14:44:16] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 14:44:16] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:16] [INFO ] [Nat]Absence check using 90 positive place invariants in 21 ms returned sat
[2023-03-15 14:44:16] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:44:16] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:16] [INFO ] After 127ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 185 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 1 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 167 places in 191 ms of which 1 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 176 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 3 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 173 places in 163 ms of which 0 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 168 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:44:20] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:44:20] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:44:20] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:44:20] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 0 ms to minimize.
[2023-03-15 14:44:21] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:44:21] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:44:21] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2023-03-15 14:44:21] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 1 ms to minimize.
[2023-03-15 14:44:22] [INFO ] Deduced a trap composed of 155 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:44:22] [INFO ] Deduced a trap composed of 176 places in 166 ms of which 1 ms to minimize.
[2023-03-15 14:44:22] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:44:23] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:44:23] [INFO ] Deduced a trap composed of 165 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:44:23] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 1 ms to minimize.
[2023-03-15 14:44:23] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:44:24] [INFO ] Deduced a trap composed of 185 places in 146 ms of which 0 ms to minimize.
[2023-03-15 14:44:24] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 1 ms to minimize.
[2023-03-15 14:44:24] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 0 ms to minimize.
[2023-03-15 14:44:24] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:44:24] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:44:25] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:44:25] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:44:25] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:44:26] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:44:26] [INFO ] Deduced a trap composed of 173 places in 140 ms of which 1 ms to minimize.
[2023-03-15 14:44:26] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:44:27] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:44:27] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:44:27] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:44:28] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:44:29] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:44:29] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:44:30] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:44:31] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:44:32] [INFO ] Deduced a trap composed of 179 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:44:45] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:44:49] [INFO ] Deduced a trap composed of 185 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:44:50] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:44:50] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:44:50] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:44:50] [INFO ] Deduced a trap composed of 188 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:44:51] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:44:51] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 3 ms to minimize.
[2023-03-15 14:44:52] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:44:53] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 0 ms to minimize.
[2023-03-15 14:44:54] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:44:55] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:44:55] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:44:57] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:44:57] [INFO ] Deduced a trap composed of 152 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:44:59] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 179 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:45:08] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 0 ms to minimize.
[2023-03-15 14:45:09] [INFO ] Deduced a trap composed of 189 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:45:12] [INFO ] Deduced a trap composed of 198 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:45:13] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:45:16] [INFO ] Deduced a trap composed of 152 places in 149 ms of which 1 ms to minimize.
[2023-03-15 14:45:25] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 68696 ms
[2023-03-15 14:45:25] [INFO ] After 68901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:45:25] [INFO ] After 69236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 24 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 22 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 14:45:25] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:45:25] [INFO ] Invariant cache hit.
[2023-03-15 14:45:25] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-15 14:45:25] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:45:25] [INFO ] Invariant cache hit.
[2023-03-15 14:45:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:28] [INFO ] Implicit Places using invariants and state equation in 2669 ms returned []
Implicit Place search using SMT with State Equation took 3261 ms to find 0 implicit places.
[2023-03-15 14:45:28] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 14:45:28] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:45:28] [INFO ] Invariant cache hit.
[2023-03-15 14:45:29] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3704 ms. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5171 resets, run finished after 406 ms. (steps per millisecond=246 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:45:29] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:45:29] [INFO ] Invariant cache hit.
[2023-03-15 14:45:29] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 14:45:29] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:45:29] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:45:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:29] [INFO ] After 48ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:45:29] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:29] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:29] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-15 14:45:29] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:45:30] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:30] [INFO ] After 95ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 1 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 185 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 176 places in 142 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 167 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 176 places in 144 ms of which 0 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:45:37] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:45:37] [INFO ] Deduced a trap composed of 185 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:45:37] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 0 ms to minimize.
[2023-03-15 14:45:37] [INFO ] Deduced a trap composed of 170 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:45:38] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:45:38] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:45:38] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:45:38] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2023-03-15 14:45:39] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:45:39] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:45:39] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:45:40] [INFO ] Deduced a trap composed of 176 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:45:40] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 1 ms to minimize.
[2023-03-15 14:45:40] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 1 ms to minimize.
[2023-03-15 14:45:41] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 3 ms to minimize.
[2023-03-15 14:45:41] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 1 ms to minimize.
[2023-03-15 14:45:42] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:45:43] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:45:43] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:45:44] [INFO ] Deduced a trap composed of 161 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:45:46] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 1 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:45:59] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 0 ms to minimize.
[2023-03-15 14:46:03] [INFO ] Deduced a trap composed of 185 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:46:03] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:46:03] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:46:04] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:46:04] [INFO ] Deduced a trap composed of 188 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:46:04] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:46:05] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:46:05] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:46:06] [INFO ] Deduced a trap composed of 161 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:46:07] [INFO ] Deduced a trap composed of 158 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:46:08] [INFO ] Deduced a trap composed of 158 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:46:09] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:46:11] [INFO ] Deduced a trap composed of 158 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:46:11] [INFO ] Deduced a trap composed of 152 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:46:12] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 1 ms to minimize.
[2023-03-15 14:46:13] [INFO ] Deduced a trap composed of 164 places in 141 ms of which 1 ms to minimize.
[2023-03-15 14:46:18] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:46:19] [INFO ] Deduced a trap composed of 161 places in 165 ms of which 0 ms to minimize.
[2023-03-15 14:46:20] [INFO ] Deduced a trap composed of 179 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:46:21] [INFO ] Deduced a trap composed of 158 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:46:22] [INFO ] Deduced a trap composed of 189 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:46:26] [INFO ] Deduced a trap composed of 198 places in 162 ms of which 1 ms to minimize.
[2023-03-15 14:46:27] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:46:29] [INFO ] Deduced a trap composed of 152 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:46:38] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 68713 ms
[2023-03-15 14:46:38] [INFO ] After 68852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:46:38] [INFO ] After 69158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 508 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 552260 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 552260 steps, saw 166083 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:46:42] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:46:42] [INFO ] Invariant cache hit.
[2023-03-15 14:46:42] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-15 14:46:42] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:46:42] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:46:42] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-15 14:46:42] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:46:42] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:46:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:46:42] [INFO ] After 169ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:46:42] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 179 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 182 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 182 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 0 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:46:46] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:46:46] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:46:46] [INFO ] Deduced a trap composed of 176 places in 148 ms of which 1 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:46:48] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:46:51] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:46:51] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 1 ms to minimize.
[2023-03-15 14:46:51] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 1 ms to minimize.
[2023-03-15 14:46:52] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 0 ms to minimize.
[2023-03-15 14:46:52] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 0 ms to minimize.
[2023-03-15 14:46:52] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:46:57] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:46:58] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 0 ms to minimize.
[2023-03-15 14:46:58] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:46:59] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:47:01] [INFO ] Deduced a trap composed of 159 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:47:01] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:47:01] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:47:02] [INFO ] Deduced a trap composed of 180 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:02] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:47:02] [INFO ] Deduced a trap composed of 182 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 176 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 161 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:47:04] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 14 ms to minimize.
[2023-03-15 14:47:07] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 24505 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-15 14:47:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:47:07] [INFO ] After 25019ms 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 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 22 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 14:47:07] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:47:07] [INFO ] Invariant cache hit.
[2023-03-15 14:47:07] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 552589 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 552589 steps, saw 166184 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:47:10] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:47:10] [INFO ] Invariant cache hit.
[2023-03-15 14:47:10] [INFO ] [Real]Absence check using 90 positive place invariants in 20 ms returned sat
[2023-03-15 14:47:10] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:47:10] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:11] [INFO ] [Nat]Absence check using 90 positive place invariants in 15 ms returned sat
[2023-03-15 14:47:11] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:47:11] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:11] [INFO ] After 162ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 0 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 182 places in 146 ms of which 1 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 182 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 1 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 170 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 185 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 0 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 185 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:47:26] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 1 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:47:30] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:47:30] [INFO ] Deduced a trap composed of 161 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:47:31] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:47:31] [INFO ] Deduced a trap composed of 180 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:47:31] [INFO ] Deduced a trap composed of 179 places in 161 ms of which 0 ms to minimize.
[2023-03-15 14:47:31] [INFO ] Deduced a trap composed of 182 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:47:35] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 24536 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:47:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:47:35] [INFO ] After 25020ms 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 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 22 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 18 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 14:47:36] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:47:36] [INFO ] Invariant cache hit.
[2023-03-15 14:47:36] [INFO ] Implicit Places using invariants in 756 ms returned []
[2023-03-15 14:47:36] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:47:36] [INFO ] Invariant cache hit.
[2023-03-15 14:47:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:39] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
[2023-03-15 14:47:39] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 14:47:39] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 14:47:39] [INFO ] Invariant cache hit.
[2023-03-15 14:47:39] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3651 ms. Remains : 530/530 places, 746/746 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 530 transition count 742
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 530 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 81 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2023-03-15 14:47:39] [INFO ] Computed 97 place invariants in 21 ms
[2023-03-15 14:47:39] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-15 14:47:39] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 14:47:39] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:40] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2023-03-15 14:47:40] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 14:47:40] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 183 places in 150 ms of which 2 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 174 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 165 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 177 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 174 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 183 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 183 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 174 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 1 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 177 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 1 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 1 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 0 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 1 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 1 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 0 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 1 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 0 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 1 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 0 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 0 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 153 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:47:57] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 1 ms to minimize.
[2023-03-15 14:47:57] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:47:58] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 0 ms to minimize.
[2023-03-15 14:47:58] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 0 ms to minimize.
[2023-03-15 14:47:59] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:48:01] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 1 ms to minimize.
[2023-03-15 14:48:01] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:48:02] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 1 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 156 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 1 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 153 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 183 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 1 ms to minimize.
[2023-03-15 14:48:08] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:48:08] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:48:09] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 169 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 171 places in 139 ms of which 0 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 0 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 1 ms to minimize.
[2023-03-15 14:48:12] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:48:12] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:48:13] [INFO ] Deduced a trap composed of 177 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:48:13] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:48:15] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:48:15] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:48:18] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:48:20] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:48:22] [INFO ] Deduced a trap composed of 177 places in 161 ms of which 0 ms to minimize.
[2023-03-15 14:48:31] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 50892 ms
[2023-03-15 14:48:31] [INFO ] After 51304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:48:31] [INFO ] After 51414ms 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 530 transition count 742
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 530 transition count 741
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 60 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:48:31] [INFO ] Invariant cache hit.
[2023-03-15 14:48:31] [INFO ] [Real]Absence check using 90 positive place invariants in 43 ms returned sat
[2023-03-15 14:48:31] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:48:31] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:48:31] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-15 14:48:31] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 14:48:32] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 0 ms to minimize.
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 0 ms to minimize.
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 177 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 180 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 150 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:48:34] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 1 ms to minimize.
[2023-03-15 14:48:34] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 1 ms to minimize.
[2023-03-15 14:48:34] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 0 ms to minimize.
[2023-03-15 14:48:34] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:48:34] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 3 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 177 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:48:37] [INFO ] Deduced a trap composed of 177 places in 151 ms of which 0 ms to minimize.
[2023-03-15 14:48:37] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:48:37] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:48:37] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 0 ms to minimize.
[2023-03-15 14:48:37] [INFO ] Deduced a trap composed of 153 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:48:38] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 1 ms to minimize.
[2023-03-15 14:48:38] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 1 ms to minimize.
[2023-03-15 14:48:38] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 1 ms to minimize.
[2023-03-15 14:48:38] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 1 ms to minimize.
[2023-03-15 14:48:38] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:48:39] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 1 ms to minimize.
[2023-03-15 14:48:39] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 1 ms to minimize.
[2023-03-15 14:48:39] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 1 ms to minimize.
[2023-03-15 14:48:39] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 0 ms to minimize.
[2023-03-15 14:48:39] [INFO ] Deduced a trap composed of 183 places in 160 ms of which 1 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 1 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 0 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 177 places in 146 ms of which 0 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 0 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 168 places in 156 ms of which 1 ms to minimize.
[2023-03-15 14:48:41] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:48:41] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 1 ms to minimize.
[2023-03-15 14:48:41] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:48:42] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:48:42] [INFO ] Deduced a trap composed of 177 places in 159 ms of which 1 ms to minimize.
[2023-03-15 14:48:43] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 0 ms to minimize.
[2023-03-15 14:48:44] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2023-03-15 14:48:44] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 0 ms to minimize.
[2023-03-15 14:48:44] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 0 ms to minimize.
[2023-03-15 14:48:45] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:48:45] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 1 ms to minimize.
[2023-03-15 14:48:45] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 0 ms to minimize.
[2023-03-15 14:48:45] [INFO ] Deduced a trap composed of 174 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:48:45] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:48:46] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 0 ms to minimize.
[2023-03-15 14:48:46] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 0 ms to minimize.
[2023-03-15 14:48:46] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 0 ms to minimize.
[2023-03-15 14:48:46] [INFO ] Deduced a trap composed of 180 places in 154 ms of which 0 ms to minimize.
[2023-03-15 14:48:47] [INFO ] Deduced a trap composed of 165 places in 179 ms of which 1 ms to minimize.
[2023-03-15 14:48:47] [INFO ] Deduced a trap composed of 174 places in 162 ms of which 0 ms to minimize.
[2023-03-15 14:48:47] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 1 ms to minimize.
[2023-03-15 14:48:48] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 0 ms to minimize.
[2023-03-15 14:48:48] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:48:48] [INFO ] Deduced a trap composed of 159 places in 187 ms of which 1 ms to minimize.
[2023-03-15 14:48:48] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 3 ms to minimize.
[2023-03-15 14:48:48] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:48:49] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 1 ms to minimize.
[2023-03-15 14:48:49] [INFO ] Deduced a trap composed of 159 places in 138 ms of which 1 ms to minimize.
[2023-03-15 14:48:49] [INFO ] Deduced a trap composed of 174 places in 152 ms of which 0 ms to minimize.
[2023-03-15 14:48:49] [INFO ] Deduced a trap composed of 174 places in 154 ms of which 1 ms to minimize.
[2023-03-15 14:48:51] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 0 ms to minimize.
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 1 ms to minimize.
[2023-03-15 14:48:54] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 0 ms to minimize.
[2023-03-15 14:48:56] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:49:05] [INFO ] Trap strengthening (SAT) tested/added 78/78 trap constraints in 33026 ms
[2023-03-15 14:49:05] [INFO ] After 33771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:49:05] [INFO ] After 33901ms 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 436397 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S05J40
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

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

BK_STOP 1678891747160

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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