Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998300020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NeoElection-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998300020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 04:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 04:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 81K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-4-LTLFireability-00
FORMULA_NAME NeoElection-COL-4-LTLFireability-01
FORMULA_NAME NeoElection-COL-4-LTLFireability-02
FORMULA_NAME NeoElection-COL-4-LTLFireability-03
FORMULA_NAME NeoElection-COL-4-LTLFireability-04
FORMULA_NAME NeoElection-COL-4-LTLFireability-05
FORMULA_NAME NeoElection-COL-4-LTLFireability-06
FORMULA_NAME NeoElection-COL-4-LTLFireability-07
FORMULA_NAME NeoElection-COL-4-LTLFireability-08
FORMULA_NAME NeoElection-COL-4-LTLFireability-09
FORMULA_NAME NeoElection-COL-4-LTLFireability-10
FORMULA_NAME NeoElection-COL-4-LTLFireability-11
FORMULA_NAME NeoElection-COL-4-LTLFireability-12
FORMULA_NAME NeoElection-COL-4-LTLFireability-13
FORMULA_NAME NeoElection-COL-4-LTLFireability-14
FORMULA_NAME NeoElection-COL-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652908524263

Running Version 202205111006
[2022-05-18 21:15:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 21:15:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:15:26] [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.
[2022-05-18 21:15:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 21:15:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1061 ms
[2022-05-18 21:15:27] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2022-05-18 21:15:27] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 21:15:27] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 9 ms.
[2022-05-18 21:15:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA NeoElection-COL-4-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 11 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-4-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 93 steps, including 5 resets, run visited all 4 properties in 21 ms. (steps per millisecond=4 )
[2022-05-18 21:15:27] [INFO ] Flatten gal took : 31 ms
[2022-05-18 21:15:27] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(5), POS(4), M(5)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 4)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-18 21:15:28] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 126 ms.
[2022-05-18 21:15:28] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Deduced a syphon composed of 1687 places in 8 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
FORMULA NeoElection-COL-4-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 106 transition count 123
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 106 transition count 123
Applied a total of 20 rules in 23 ms. Remains 106 /122 variables (removed 16) and now considering 123/127 (removed 4) transitions.
[2022-05-18 21:15:28] [INFO ] Flow matrix only has 114 transitions (discarded 9 similar events)
// Phase 1: matrix 114 rows 106 cols
[2022-05-18 21:15:28] [INFO ] Computed 23 place invariants in 35 ms
[2022-05-18 21:15:28] [INFO ] Implicit Places using invariants in 348 ms returned [10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 394 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/122 places, 123/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 94/122 places, 123/127 transitions.
Support contains 50 out of 94 places after structural reductions.
[2022-05-18 21:15:28] [INFO ] Flatten gal took : 48 ms
[2022-05-18 21:15:28] [INFO ] Flatten gal took : 29 ms
[2022-05-18 21:15:28] [INFO ] Input system was already deterministic with 123 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 4 properties in 15 ms. (steps per millisecond=5 )
Computed a total of 94 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(F(X(F(p0))))))))'
Support contains 22 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 123/123 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 90 transition count 115
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 115
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 22 place count 72 transition count 70
Iterating global reduction 0 with 14 rules applied. Total rules applied 36 place count 72 transition count 70
Applied a total of 36 rules in 23 ms. Remains 72 /94 variables (removed 22) and now considering 70/123 (removed 53) transitions.
[2022-05-18 21:15:28] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 72 cols
[2022-05-18 21:15:28] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 21:15:29] [INFO ] Implicit Places using invariants in 84 ms returned [6, 7, 8, 9]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 96 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/94 places, 70/123 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/94 places, 70/123 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s20 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s48 1)) (AND (GEQ s5 1) (GEQ s34 1) (GEQ s50 1)) (AND (GEQ s4 1) (GEQ s27 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9816 reset in 566 ms.
Product exploration explored 100000 steps with 9830 reset in 472 ms.
Computed a total of 68 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 70
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2022-05-18 21:15:31] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 68 cols
[2022-05-18 21:15:31] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-18 21:15:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-18 21:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 21:15:31] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-18 21:15:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 21:15:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-18 21:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 21:15:31] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-18 21:15:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-18 21:15:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-18 21:15:31] [INFO ] Computed and/alt/rep : 62/137/53 causal constraints (skipped 4 transitions) in 20 ms.
[2022-05-18 21:15:31] [INFO ] Added : 33 causal constraints over 7 iterations in 136 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 70/70 transitions.
Applied a total of 0 rules in 14 ms. Remains 68 /68 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2022-05-18 21:15:31] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 68 cols
[2022-05-18 21:15:31] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-18 21:15:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-05-18 21:15:31] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 68 cols
[2022-05-18 21:15:31] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-18 21:15:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-18 21:15:31] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-05-18 21:15:31] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-18 21:15:31] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 68 cols
[2022-05-18 21:15:31] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-18 21:15:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 70/70 transitions.
Computed a total of 68 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 70
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
[2022-05-18 21:15:32] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 68 cols
[2022-05-18 21:15:32] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-18 21:15:32] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-18 21:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 21:15:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-18 21:15:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 21:15:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-18 21:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 21:15:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-18 21:15:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-18 21:15:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-18 21:15:33] [INFO ] Computed and/alt/rep : 62/137/53 causal constraints (skipped 4 transitions) in 10 ms.
[2022-05-18 21:15:33] [INFO ] Added : 33 causal constraints over 7 iterations in 105 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9836 reset in 513 ms.
Product exploration explored 100000 steps with 9844 reset in 351 ms.
Built C files in :
/tmp/ltsmin3955209271578510138
[2022-05-18 21:15:34] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2022-05-18 21:15:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:15:34] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2022-05-18 21:15:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:15:34] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2022-05-18 21:15:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 21:15:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3955209271578510138
Running compilation step : cd /tmp/ltsmin3955209271578510138;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin3955209271578510138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3955209271578510138;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10523084374946212259.hoa' '--buchi-type=spotba'
LTSmin run took 197 ms.
FORMULA NeoElection-COL-4-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-4-LTLFireability-03 finished in 6347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U p0))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 123/123 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 80 transition count 78
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 80 transition count 78
Applied a total of 28 rules in 9 ms. Remains 80 /94 variables (removed 14) and now considering 78/123 (removed 45) transitions.
[2022-05-18 21:15:35] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 80 cols
[2022-05-18 21:15:35] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 21:15:35] [INFO ] Implicit Places using invariants in 111 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 113 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/94 places, 78/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/94 places, 78/123 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s60 1) (GEQ s63 1) (GEQ s61 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-05 finished in 248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 18 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 123/123 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 89 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 89 transition count 101
Applied a total of 10 rules in 5 ms. Remains 89 /94 variables (removed 5) and now considering 101/123 (removed 22) transitions.
[2022-05-18 21:15:35] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
// Phase 1: matrix 92 rows 89 cols
[2022-05-18 21:15:35] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 21:15:35] [INFO ] Implicit Places using invariants in 89 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/94 places, 101/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 88/94 places, 101/123 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s43 1) (GEQ s66 1)) (AND (GEQ s14 1) (GEQ s47 1) (GEQ s66 1)) (AND (GEQ s18 1) (GEQ s59 1) (GEQ s67 1)) (AND (GEQ s13 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-06 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 22 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 123/123 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 80 transition count 78
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 80 transition count 78
Applied a total of 28 rules in 12 ms. Remains 80 /94 variables (removed 14) and now considering 78/123 (removed 45) transitions.
[2022-05-18 21:15:35] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 80 cols
[2022-05-18 21:15:35] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 21:15:35] [INFO ] Implicit Places using invariants in 105 ms returned [10, 11, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 107 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/94 places, 78/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 76/94 places, 78/123 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s24 1) (GEQ s53 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s52 1)) (AND (GEQ s9 1) (GEQ s38 1) (GEQ s54 1)) (AND (GEQ s8 1) (GEQ s31...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-08 finished in 259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 24 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 123/123 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 89 transition count 118
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 89 transition count 114
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 85 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 80 transition count 103
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 80 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 78 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 77 transition count 100
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 212 edges and 76 vertex of which 74 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 74 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 27 place count 74 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 39 place count 68 transition count 93
Applied a total of 39 rules in 54 ms. Remains 68 /94 variables (removed 26) and now considering 93/123 (removed 30) transitions.
[2022-05-18 21:15:36] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
// Phase 1: matrix 84 rows 68 cols
[2022-05-18 21:15:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 21:15:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2022-05-18 21:15:36] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
// Phase 1: matrix 84 rows 68 cols
[2022-05-18 21:15:36] [INFO ] Computed 9 place invariants in 13 ms
[2022-05-18 21:15:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-18 21:15:36] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2022-05-18 21:15:36] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-18 21:15:36] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
// Phase 1: matrix 84 rows 68 cols
[2022-05-18 21:15:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-18 21:15:36] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/94 places, 93/123 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/94 places, 93/123 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s5 1) (LT s13 1) (LT s43 1) (LT s55 1)) (OR (LT s1 1) (LT s6 1) (LT s24 1) (LT s53 1)) (OR (LT s2 1) (LT s9 1) (LT s32 1) (LT s54 1)) (OR ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1136 reset in 1135 ms.
Product exploration explored 100000 steps with 1136 reset in 941 ms.
Computed a total of 68 stabilizing places and 93 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 93
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-4-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-15 finished in 2674 ms.
All properties solved by simple procedures.
Total runtime 12439 ms.

BK_STOP 1652908539054

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998300020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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