Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662362100372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is Referendum-PT-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362100372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 16K Apr 11 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 11 16:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 11 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 305K Apr 11 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 23K May 18 16:43 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 Referendum-PT-0020-LTLCardinality-00
FORMULA_NAME Referendum-PT-0020-LTLCardinality-01
FORMULA_NAME Referendum-PT-0020-LTLCardinality-02
FORMULA_NAME Referendum-PT-0020-LTLCardinality-03
FORMULA_NAME Referendum-PT-0020-LTLCardinality-04
FORMULA_NAME Referendum-PT-0020-LTLCardinality-05
FORMULA_NAME Referendum-PT-0020-LTLCardinality-06
FORMULA_NAME Referendum-PT-0020-LTLCardinality-07
FORMULA_NAME Referendum-PT-0020-LTLCardinality-08
FORMULA_NAME Referendum-PT-0020-LTLCardinality-09
FORMULA_NAME Referendum-PT-0020-LTLCardinality-10
FORMULA_NAME Referendum-PT-0020-LTLCardinality-11
FORMULA_NAME Referendum-PT-0020-LTLCardinality-12
FORMULA_NAME Referendum-PT-0020-LTLCardinality-13
FORMULA_NAME Referendum-PT-0020-LTLCardinality-14
FORMULA_NAME Referendum-PT-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716861746770

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:02:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:02:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:02:28] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-05-28 02:02:28] [INFO ] Transformed 61 places.
[2024-05-28 02:02:28] [INFO ] Transformed 41 transitions.
[2024-05-28 02:02:28] [INFO ] Found NUPN structural information;
[2024-05-28 02:02:28] [INFO ] Parsed PT model containing 61 places and 41 transitions and 101 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0020-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2024-05-28 02:02:28] [INFO ] Computed 20 invariants in 9 ms
[2024-05-28 02:02:28] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-28 02:02:28] [INFO ] Invariant cache hit.
[2024-05-28 02:02:30] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
[2024-05-28 02:02:30] [INFO ] Invariant cache hit.
[2024-05-28 02:02:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1782 ms. Remains : 61/61 places, 41/41 transitions.
Support contains 61 out of 61 places after structural reductions.
[2024-05-28 02:02:30] [INFO ] Flatten gal took : 18 ms
[2024-05-28 02:02:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 02:02:31] [INFO ] Input system was already deterministic with 41 transitions.
Finished random walk after 41 steps, including 1 resets, run visited all 15 properties in 12 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 61 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 41
Applied a total of 20 rules in 2 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-28 02:02:31] [INFO ] Computed 0 invariants in 2 ms
[2024-05-28 02:02:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 02:02:31] [INFO ] Invariant cache hit.
[2024-05-28 02:02:31] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-28 02:02:31] [INFO ] Invariant cache hit.
[2024-05-28 02:02:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 41/61 places, 41/41 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 250 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 4 ms.
FORMULA Referendum-PT-0020-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-00 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||(p1&&F(p2))) U p3)))'
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2024-05-28 02:02:31] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 02:02:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 02:02:31] [INFO ] Invariant cache hit.
[2024-05-28 02:02:31] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-28 02:02:31] [INFO ] Invariant cache hit.
[2024-05-28 02:02:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 1 reset in 2 ms.
FORMULA Referendum-PT-0020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-02 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 41 /61 variables (removed 20) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-28 02:02:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:02:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:02:32] [INFO ] Invariant cache hit.
[2024-05-28 02:02:32] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-28 02:02:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:02:32] [INFO ] Invariant cache hit.
[2024-05-28 02:02:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/61 places, 41/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 41/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7689 reset in 383 ms.
Product exploration explored 100000 steps with 7687 reset in 301 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
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 : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 02:02:33] [INFO ] Invariant cache hit.
[2024-05-28 02:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:02:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 02:02:33] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 02:02:33] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 40 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-28 02:02:33] [INFO ] Invariant cache hit.
[2024-05-28 02:02:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 02:02:33] [INFO ] Invariant cache hit.
[2024-05-28 02:02:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-28 02:02:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:02:33] [INFO ] Invariant cache hit.
[2024-05-28 02:02:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 41 transition count 41
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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 02:02:34] [INFO ] Invariant cache hit.
[2024-05-28 02:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 02:02:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 02:02:34] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 02:02:34] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7723 reset in 309 ms.
Product exploration explored 100000 steps with 7726 reset in 279 ms.
Built C files in :
/tmp/ltsmin15510157519738322464
[2024-05-28 02:02:35] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-28 02:02:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:02:35] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-28 02:02:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:02:35] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-28 02:02:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:02:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15510157519738322464
Running compilation step : cd /tmp/ltsmin15510157519738322464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin15510157519738322464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15510157519738322464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5349591709394585033.hoa' '--buchi-type=spotba'
LTSmin run took 142 ms.
FORMULA Referendum-PT-0020-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0020-LTLCardinality-04 finished in 3868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2024-05-28 02:02:35] [INFO ] Computed 20 invariants in 1 ms
[2024-05-28 02:02:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:02:35] [INFO ] Invariant cache hit.
[2024-05-28 02:02:35] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-28 02:02:35] [INFO ] Invariant cache hit.
[2024-05-28 02:02:35] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 61 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0020-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLCardinality-06 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0) U (G(!p1)||(!p1&&F(!p2))))))'
Support contains 60 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-28 02:02:36] [INFO ] Invariant cache hit.
[2024-05-28 02:02:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 02:02:36] [INFO ] Invariant cache hit.
[2024-05-28 02:02:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-28 02:02:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:02:36] [INFO ] Invariant cache hit.
[2024-05-28 02:02:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 208 ms :[p1, p0, p1, (AND p1 p2), (AND p0 p2)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p0:(GT 3 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-07 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G((X(p0) U p1)))))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 23 transition count 23
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 73 place count 6 transition count 6
Iterating global reduction 1 with 17 rules applied. Total rules applied 90 place count 6 transition count 6
Applied a total of 90 rules in 5 ms. Remains 6 /61 variables (removed 55) and now considering 6/41 (removed 35) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-28 02:02:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:02:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:02:36] [INFO ] Invariant cache hit.
[2024-05-28 02:02:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:02:36] [INFO ] Invariant cache hit.
[2024-05-28 02:02:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/61 places, 6/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 6/61 places, 6/41 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s0 1)), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 65 steps with 2 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-09 finished in 162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 3 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 2 /61 variables (removed 59) and now considering 2/41 (removed 39) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-28 02:02:37] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:02:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:02:37] [INFO ] Invariant cache hit.
[2024-05-28 02:02:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:02:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:02:37] [INFO ] Invariant cache hit.
[2024-05-28 02:02:37] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/61 places, 2/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 2/61 places, 2/41 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-11 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:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-11 finished in 148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 25 transition count 25
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 10 transition count 10
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 10 transition count 10
Applied a total of 82 rules in 2 ms. Remains 10 /61 variables (removed 51) and now considering 10/41 (removed 31) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 02:02:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:02:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:02:37] [INFO ] Invariant cache hit.
[2024-05-28 02:02:37] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 02:02:37] [INFO ] Invariant cache hit.
[2024-05-28 02:02:37] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10/61 places, 10/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 10/61 places, 10/41 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s4 0) (NEQ s1 1)), p1:(OR (EQ s2 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-12 finished in 242 ms.
All properties solved by simple procedures.
Total runtime 9083 ms.

BK_STOP 1716861758689

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="Referendum-PT-0020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Referendum-PT-0020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662362100372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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