Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 75K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748795881202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-01 16:38:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 16:38:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:38:02] [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.
[2025-06-01 16:38:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 16:38:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2025-06-01 16:38:03] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2025-06-01 16:38:03] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2025-06-01 16:38:03] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2025-06-01 16:38:03] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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.4 ms
Remains 16 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-3-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40001 steps (1649 resets) in 921 ms. (43 steps per ms) remains 16/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 13/16 properties
BEST_FIRST walk for 4003 steps (39 resets) in 76 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (160 resets) in 77 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (35 resets) in 67 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (38 resets) in 50 ms. (78 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (36 resets) in 43 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (44 resets) in 42 ms. (93 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (36 resets) in 22 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (40 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (161 resets) in 54 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (160 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
// Phase 1: matrix 7 rows 6 cols
[2025-06-01 16:38:03] [INFO ] Computed 1 invariants in 7 ms
[2025-06-01 16:38:03] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 6/13 variables, and 1 constraints, problems are : Problem set: 13 solved, 0 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 13 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 13 atomic propositions for a total of 10 simplifications.
FORMULA NeoElection-COL-3-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:38:03] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2025-06-01 16:38:03] [INFO ] Flatten gal took : 12 ms
[2025-06-01 16:38:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-01 16:38:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-3-CTLCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:38:03] [INFO ] Flatten gal took : 1 ms
FORMULA NeoElection-COL-3-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(4), POS(3), M(4)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 3)]] 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.
[2025-06-01 16:38:04] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 43 ms.
[2025-06-01 16:38:04] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
Support contains 18 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 56 transition count 46
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 56 transition count 46
Applied a total of 16 rules in 10 ms. Remains 56 /67 variables (removed 11) and now considering 46/58 (removed 12) transitions.
[2025-06-01 16:38:04] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 56 cols
[2025-06-01 16:38:04] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:04] [INFO ] Implicit Places using invariants in 98 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 106 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/67 places, 46/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 47/67 places, 46/58 transitions.
Support contains 18 out of 47 places after structural reductions.
[2025-06-01 16:38:04] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:38:04] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:38:04] [INFO ] Input system was already deterministic with 46 transitions.
Support contains 15 out of 47 places (down from 18) after GAL structural reductions.
RANDOM walk for 40000 steps (452 resets) in 639 ms. (62 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (87 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (117 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (129 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (88 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
[2025-06-01 16:38:04] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2025-06-01 16:38:04] [INFO ] Computed 5 invariants in 1 ms
[2025-06-01 16:38:04] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 21/89 variables, and 3 constraints, problems are : Problem set: 4 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/47 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 3 simplifications.
[2025-06-01 16:38:04] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:38:04] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:38:04] [INFO ] Input system was already deterministic with 46 transitions.
Computed a total of 47 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA NeoElection-COL-3-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2025-06-01 16:38:04] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2025-06-01 16:38:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:04] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-01 16:38:04] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2025-06-01 16:38:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 16:38:04] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2025-06-01 16:38:04] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2025-06-01 16:38:04] [INFO ] Invariant cache hit.
[2025-06-01 16:38:04] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD6 is UNSAT
At refinement iteration 4 (OVERLAPS) 42/89 variables, 47/52 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 2/54 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:05] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 3/63 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 63 constraints, problems are : Problem set: 1 solved, 42 unsolved in 1457 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 42/89 variables, 47/61 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 42/105 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:06] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:06] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/89 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 107 constraints, problems are : Problem set: 1 solved, 42 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/43 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3041ms problems are : Problem set: 1 solved, 42 unsolved
Search for dead transitions found 1 dead transitions in 3043ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 47/47 places, 45/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3172 ms. Remains : 47/47 places, 45/46 transitions.
[2025-06-01 16:38:07] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:38:07] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:38:07] [INFO ] Input system was already deterministic with 45 transitions.
[2025-06-01 16:38:07] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:38:07] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:38:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5936644416461950077.gal : 2 ms
[2025-06-01 16:38:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14548058390247284258.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5936644416461950077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14548058390247284258.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,391638,0.051331,5704,2,1037,5,8599,6,0,227,9465,0


Converting to forward existential form...Done !
original formula: AF(EG(((((((P_startNeg__broadcasting_3+P_startNeg__broadcasting_4)+(P_startNeg__broadcasting_5+P_startNeg__broadcasting_6))+((P_startNeg_...304
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((((P_startNeg__broadcasting_3+P_startNeg__broadcasting_4)+(P_startNeg__broadcasting_5+P_start...349
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t25, t26, t27, t28, t33, t34, t35, Intersection with reachable a...223
(forward)formula 0,0,0.523206,24668,1,0,200,110054,112,53,1576,124498,188
FORMULA NeoElection-COL-3-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 43
Applied a total of 6 rules in 6 ms. Remains 44 /47 variables (removed 3) and now considering 43/46 (removed 3) transitions.
[2025-06-01 16:38:08] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 44 cols
[2025-06-01 16:38:08] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:08] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-01 16:38:08] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2025-06-01 16:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 16:38:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-01 16:38:08] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2025-06-01 16:38:08] [INFO ] Invariant cache hit.
[2025-06-01 16:38:08] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem TDEAD6 is UNSAT
At refinement iteration 4 (OVERLAPS) 39/83 variables, 44/49 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/51 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:08] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:08] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:09] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:09] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:09] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:09] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 6/57 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/83 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 57 constraints, problems are : Problem set: 1 solved, 39 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 3/44 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 39/83 variables, 44/55 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 2/57 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 39/96 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:09] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:38:10] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/83 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 98 constraints, problems are : Problem set: 1 solved, 39 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 39/40 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2308ms problems are : Problem set: 1 solved, 39 unsolved
Search for dead transitions found 1 dead transitions in 2309ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 42/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2435 ms. Remains : 44/47 places, 42/46 transitions.
[2025-06-01 16:38:10] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:38:10] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:38:10] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-01 16:38:10] [INFO ] Flatten gal took : 2 ms
[2025-06-01 16:38:10] [INFO ] Flatten gal took : 2 ms
[2025-06-01 16:38:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality17871904666930538070.gal : 1 ms
[2025-06-01 16:38:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality4392183361655013186.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17871904666930538070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4392183361655013186.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,391638,0.027086,4968,2,629,5,5758,6,0,212,5410,0


Converting to forward existential form...Done !
original formula: EX(AX(FALSE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t25, t26, t27, t28, t36, t37, t38, Intersection with reachable at each step ...211
(forward)formula 0,0,0.086358,7656,1,0,102,20589,99,47,1379,21811,91
FORMULA NeoElection-COL-3-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-06-01 16:38:11] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:38:11] [INFO ] Flatten gal took : 3 ms
Total runtime 8624 ms.

BK_STOP 1748795891106

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-3"
export BK_EXAMINATION="CTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876811800049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-3.tgz
mv NeoElection-COL-3 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;