Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 70K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DES-PT-30a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385700241
=====================================================================

--------------------
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 DES-PT-30a-CTLCardinality-00
FORMULA_NAME DES-PT-30a-CTLCardinality-01
FORMULA_NAME DES-PT-30a-CTLCardinality-02
FORMULA_NAME DES-PT-30a-CTLCardinality-03
FORMULA_NAME DES-PT-30a-CTLCardinality-04
FORMULA_NAME DES-PT-30a-CTLCardinality-05
FORMULA_NAME DES-PT-30a-CTLCardinality-06
FORMULA_NAME DES-PT-30a-CTLCardinality-07
FORMULA_NAME DES-PT-30a-CTLCardinality-08
FORMULA_NAME DES-PT-30a-CTLCardinality-09
FORMULA_NAME DES-PT-30a-CTLCardinality-10
FORMULA_NAME DES-PT-30a-CTLCardinality-11
FORMULA_NAME DES-PT-30a-CTLCardinality-12
FORMULA_NAME DES-PT-30a-CTLCardinality-13
FORMULA_NAME DES-PT-30a-CTLCardinality-14
FORMULA_NAME DES-PT-30a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526541958612


BK_STOP 1526542749808

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-30a as instance name.
Using DES as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3539338, 'Memory': 8428.68, 'Tool': 'lola'}, {'Time': 3540182, 'Memory': 8447.92, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-30a...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DES-PT-30a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DES-PT-30a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DES-PT-30a @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 2 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 425/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 234 places, 191 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 216 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-30a-CTLCardinality.task
lola: ((((p171 <= p184) AND (p113 <= p103)) AND (E (G ((p116 <= p138))) OR (1 <= p98))) OR (p55 + 1 <= p54)) : E (F (((p138 <= p43) AND (3 <= p228) AND ((1 <= p44) OR (p96 <= p183)) AND (((1 <= p56) AND (p67 <= p200)) OR (1 <= p17))))) : ((E (F ((p76 + 1 <= p84))) AND (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))) AND (A (X ((p35 <= p60))) AND (p22 <= p120))) : E (X (A (F (((3 <= p87) AND (3 <= p155)))))) : E (G ((p65 <= p141))) : (((2 <= p145) AND E (X (((3 <= p131) AND (1 <= p169))))) OR NOT(E (G (((1 <= p117) OR (p112 <= p22)))))) : E (G (((p174 + 1 <= p172) OR (p94 <= 0)))) : E (F ((1 <= p160))) : A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195)))) : A (F (A (((3 <= p187) U (2 <= p203))))) : E (G ((((1 <= p231) OR (p32 <= p217) OR (p158 <= 0)) AND A (F ((p221 <= p46)))))) : A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67))))) : NOT(((A (F ((p185 <= p32))) AND E (G ((p156 <= p181)))) OR A (X (((3 <= p61) AND (p178 <= p181)))))) : (A (F (((p20 <= p205) AND (2 <= p59) AND (2 <= p166)))) AND (E (G ((p42 <= p206))) OR ((2 <= p37) AND E (F ((p95 <= p174)))))) : NOT(A (G ((p45 <= p48)))) : ((((p233 <= 2) AND (p76 + 1 <= p69) AND (1 <= p154)) OR NOT(A (F ((3 <= p17))))) AND (((1 <= p162) AND (3 <= p195)) OR A (X ((p42 <= p171)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p171 <= p184) AND (p113 <= p103)) AND (E (G ((p116 <= p138))) OR (1 <= p98))) OR (p55 + 1 <= p54))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p171 <= p184) AND (p113 <= p103))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p171 <= p184) AND (p113 <= p103))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p116 <= p138)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p138 + 1 <= p116)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 114 markings, 229 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p138 <= p43) AND (3 <= p228) AND ((1 <= p44) OR (p96 <= p183)) AND (((1 <= p56) AND (p67 <= p200)) OR (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p76 + 1 <= p84))) AND (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))) AND (A (X ((p35 <= p60))) AND (p22 <= p120)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p76 + 1 <= p84)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 141 markings, 141 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p35 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p35 <= p60)))
lola: processed formula: A (X ((p35 <= p60)))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p22 <= p120)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p120)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((3 <= p87) AND (3 <= p155))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((3 <= p87) AND (3 <= p155))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p65 <= p141)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p141 + 1 <= p65)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p145) AND E (X (((3 <= p131) AND (1 <= p169))))) OR NOT(E (G (((1 <= p117) OR (p112 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p145)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p145)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: processed formula: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p174 + 1 <= p172) OR (p94 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p172 <= p174) AND (1 <= p94))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p160)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: processed formula: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((3 <= p187) U (2 <= p203)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((3 <= p187) U (2 <= p203)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 89 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p231) OR (p32 <= p217) OR (p158 <= 0)) AND A (F ((p221 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p231 <= 0) AND (p217 + 1 <= p32) AND (1 <= p158)) OR NOT(A(TRUE U (p221 <= p46))))))
lola: processed formula length: 100
lola: 4 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 126 markings, 216 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: processed formula: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 14 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 592271 markings, 4280224 edges, 118454 markings/sec, 0 secs
lola: 1139389 markings, 8743555 edges, 109424 markings/sec, 5 secs
lola: 1633894 markings, 13169302 edges, 98901 markings/sec, 10 secs
lola: 2080406 markings, 17686313 edges, 89302 markings/sec, 15 secs
lola: 2567614 markings, 22082970 edges, 97442 markings/sec, 20 secs
lola: 3088830 markings, 26520074 edges, 104243 markings/sec, 25 secs
lola: 3650207 markings, 30982734 edges, 112275 markings/sec, 30 secs
lola: 4121610 markings, 35084100 edges, 94281 markings/sec, 35 secs
lola: 4632479 markings, 39079193 edges, 102174 markings/sec, 40 secs
lola: 5169810 markings, 43497715 edges, 107466 markings/sec, 45 secs
lola: 5642589 markings, 47793161 edges, 94556 markings/sec, 50 secs
lola: 6092659 markings, 52125220 edges, 90014 markings/sec, 55 secs
lola: 6510828 markings, 56440939 edges, 83634 markings/sec, 60 secs
lola: 6910553 markings, 60842655 edges, 79945 markings/sec, 65 secs
lola: 7337604 markings, 65115143 edges, 85410 markings/sec, 70 secs
lola: 7800770 markings, 69386361 edges, 92633 markings/sec, 75 secs
lola: 8269410 markings, 73587261 edges, 93728 markings/sec, 80 secs
lola: 8689521 markings, 77655234 edges, 84022 markings/sec, 85 secs
lola: 9110440 markings, 81422433 edges, 84184 markings/sec, 90 secs
lola: 9619256 markings, 85558966 edges, 101763 markings/sec, 95 secs
lola: 10134101 markings, 90079848 edges, 102969 markings/sec, 100 secs
lola: 10555482 markings, 94625953 edges, 84276 markings/sec, 105 secs
lola: 10981363 markings, 99031059 edges, 85176 markings/sec, 110 secs
lola: 11326877 markings, 103545344 edges, 69103 markings/sec, 115 secs
lola: 11703764 markings, 107807189 edges, 75377 markings/sec, 120 secs
lola: 12155931 markings, 112347964 edges, 90433 markings/sec, 125 secs
lola: 12642466 markings, 116794313 edges, 97307 markings/sec, 130 secs
lola: 13106302 markings, 121052079 edges, 92767 markings/sec, 135 secs
lola: 13498391 markings, 125083719 edges, 78418 markings/sec, 140 secs
lola: 13920858 markings, 129013774 edges, 84493 markings/sec, 145 secs
lola: 14425819 markings, 133422412 edges, 100992 markings/sec, 150 secs
lola: 14818236 markings, 137922484 edges, 78483 markings/sec, 155 secs
lola: 15140799 markings, 142343464 edges, 64513 markings/sec, 160 secs
lola: 15625846 markings, 146742876 edges, 97009 markings/sec, 165 secs
lola: 16026919 markings, 151155731 edges, 80215 markings/sec, 170 secs
lola: 16426662 markings, 155550436 edges, 79949 markings/sec, 175 secs
lola: 16795392 markings, 159848283 edges, 73746 markings/sec, 180 secs
lola: 17105330 markings, 164247934 edges, 61988 markings/sec, 185 secs
lola: 17449999 markings, 168438007 edges, 68934 markings/sec, 190 secs
lola: 17831528 markings, 172806079 edges, 76306 markings/sec, 195 secs
lola: 18252391 markings, 177018059 edges, 84173 markings/sec, 200 secs
lola: 18656574 markings, 181303534 edges, 80837 markings/sec, 205 secs
lola: 19039419 markings, 185315990 edges, 76569 markings/sec, 210 secs
lola: 19400548 markings, 189189909 edges, 72226 markings/sec, 215 secs
lola: 19750702 markings, 192940796 edges, 70031 markings/sec, 220 secs
lola: 20207019 markings, 197301175 edges, 91263 markings/sec, 225 secs
lola: 20568815 markings, 201602121 edges, 72359 markings/sec, 230 secs
lola: 20870422 markings, 206070927 edges, 60321 markings/sec, 235 secs
lola: 21367672 markings, 210420790 edges, 99450 markings/sec, 240 secs
lola: 21911203 markings, 214847358 edges, 108706 markings/sec, 245 secs
lola: 22351701 markings, 219369452 edges, 88100 markings/sec, 250 secs
lola: 22912328 markings, 223680204 edges, 112125 markings/sec, 255 secs
lola: 23456822 markings, 227895892 edges, 108899 markings/sec, 260 secs
lola: 23960983 markings, 232121984 edges, 100832 markings/sec, 265 secs
lola: 24447117 markings, 236272706 edges, 97227 markings/sec, 270 secs
lola: 24886630 markings, 240596003 edges, 87903 markings/sec, 275 secs
lola: 25325293 markings, 245032400 edges, 87733 markings/sec, 280 secs
lola: 25753383 markings, 249111672 edges, 85618 markings/sec, 285 secs
lola: 26164628 markings, 253543029 edges, 82249 markings/sec, 290 secs
lola: 26604845 markings, 257960916 edges, 88043 markings/sec, 295 secs
lola: 27083937 markings, 262186299 edges, 95818 markings/sec, 300 secs
lola: 27561516 markings, 266456894 edges, 95516 markings/sec, 305 secs
lola: 27967299 markings, 270794151 edges, 81157 markings/sec, 310 secs
lola: 28352832 markings, 275115371 edges, 77107 markings/sec, 315 secs
lola: 28727182 markings, 279320422 edges, 74870 markings/sec, 320 secs
lola: 29096160 markings, 283621959 edges, 73796 markings/sec, 325 secs
lola: 29510786 markings, 287830872 edges, 82925 markings/sec, 330 secs
lola: 29938540 markings, 291980777 edges, 85551 markings/sec, 335 secs
lola: 30307134 markings, 296303866 edges, 73719 markings/sec, 340 secs
lola: 30683569 markings, 300658091 edges, 75287 markings/sec, 345 secs
lola: 31186870 markings, 304986795 edges, 100660 markings/sec, 350 secs
lola: 31681783 markings, 309342493 edges, 98983 markings/sec, 355 secs
lola: 32095118 markings, 313638152 edges, 82667 markings/sec, 360 secs
lola: 32474289 markings, 318052219 edges, 75834 markings/sec, 365 secs
lola: 32865319 markings, 322319771 edges, 78206 markings/sec, 370 secs
lola: 33199765 markings, 326846037 edges, 66889 markings/sec, 375 secs
lola: 33610723 markings, 331513268 edges, 82192 markings/sec, 380 secs
lola: 33983411 markings, 336145656 edges, 74538 markings/sec, 385 secs
lola: 34307405 markings, 340537858 edges, 64799 markings/sec, 390 secs
lola: 34663065 markings, 345039226 edges, 71132 markings/sec, 395 secs
lola: 35065018 markings, 349349207 edges, 80391 markings/sec, 400 secs
lola: 35445446 markings, 353362619 edges, 76086 markings/sec, 405 secs
lola: 35757940 markings, 357454876 edges, 62499 markings/sec, 410 secs
lola: 36262857 markings, 362060058 edges, 100983 markings/sec, 415 secs
lola: 36701898 markings, 366615101 edges, 87808 markings/sec, 420 secs
lola: 37089049 markings, 371076559 edges, 77430 markings/sec, 425 secs
lola: 37516321 markings, 375632645 edges, 85454 markings/sec, 430 secs
lola: 37910521 markings, 379815033 edges, 78840 markings/sec, 435 secs
lola: 38322205 markings, 383872920 edges, 82337 markings/sec, 440 secs
lola: 38800536 markings, 388162314 edges, 95666 markings/sec, 445 secs
lola: 39328560 markings, 392736497 edges, 105605 markings/sec, 450 secs
lola: 39775097 markings, 397162041 edges, 89307 markings/sec, 455 secs
lola: 40237726 markings, 401666700 edges, 92526 markings/sec, 460 secs
lola: 40675801 markings, 405921548 edges, 87615 markings/sec, 465 secs
lola: 41107359 markings, 409980885 edges, 86312 markings/sec, 470 secs
lola: 41544415 markings, 414093527 edges, 87411 markings/sec, 475 secs
lola: 41974203 markings, 418256096 edges, 85958 markings/sec, 480 secs
lola: 42363532 markings, 422295901 edges, 77866 markings/sec, 485 secs
lola: 42701837 markings, 426283651 edges, 67661 markings/sec, 490 secs
lola: 43098088 markings, 430347323 edges, 79250 markings/sec, 495 secs
lola: 43462378 markings, 434231493 edges, 72858 markings/sec, 500 secs
lola: 43864206 markings, 438053238 edges, 80366 markings/sec, 505 secs
lola: 44310863 markings, 442004445 edges, 89331 markings/sec, 510 secs
lola: 44712167 markings, 445834301 edges, 80261 markings/sec, 515 secs
lola: 45078645 markings, 449503596 edges, 73296 markings/sec, 520 secs
lola: 45468134 markings, 453402949 edges, 77898 markings/sec, 525 secs
lola: 45863065 markings, 457098126 edges, 78986 markings/sec, 530 secs
lola: 46365419 markings, 461257861 edges, 100471 markings/sec, 535 secs
lola: 46851526 markings, 465530230 edges, 97221 markings/sec, 540 secs
lola: 47264113 markings, 469940911 edges, 82517 markings/sec, 545 secs
lola: 47667319 markings, 474288305 edges, 80641 markings/sec, 550 secs
lola: 48110263 markings, 478488207 edges, 88589 markings/sec, 555 secs
lola: 48464381 markings, 482717278 edges, 70824 markings/sec, 560 secs
lola: 48821886 markings, 486979375 edges, 71501 markings/sec, 565 secs
lola: 49263440 markings, 491176789 edges, 88311 markings/sec, 570 secs
lola: 49699895 markings, 495459472 edges, 87291 markings/sec, 575 secs
lola: 50109586 markings, 499597835 edges, 81938 markings/sec, 580 secs
lola: 50439089 markings, 503865229 edges, 65901 markings/sec, 585 secs
lola: 50799452 markings, 508066104 edges, 72073 markings/sec, 590 secs
lola: 51135144 markings, 512164202 edges, 67138 markings/sec, 595 secs
lola: 51434541 markings, 516480729 edges, 59879 markings/sec, 600 secs
lola: 51757123 markings, 520793715 edges, 64516 markings/sec, 605 secs
lola: 52087342 markings, 525160932 edges, 66044 markings/sec, 610 secs
lola: 52424567 markings, 529116503 edges, 67445 markings/sec, 615 secs
lola: 52708552 markings, 532880542 edges, 56797 markings/sec, 620 secs
lola: 53135927 markings, 537329647 edges, 85475 markings/sec, 625 secs
lola: 53525513 markings, 541787696 edges, 77917 markings/sec, 630 secs
lola: 53865231 markings, 545809521 edges, 67944 markings/sec, 635 secs
lola: 54275919 markings, 549844985 edges, 82138 markings/sec, 640 secs
lola: 54716717 markings, 554286109 edges, 88160 markings/sec, 645 secs
lola: 55111932 markings, 558637444 edges, 79043 markings/sec, 650 secs
lola: 55483957 markings, 562410121 edges, 74405 markings/sec, 655 secs
lola: 55869347 markings, 566385468 edges, 77078 markings/sec, 660 secs
lola: 56236851 markings, 570358575 edges, 73501 markings/sec, 665 secs
lola: 56544486 markings, 574235030 edges, 61527 markings/sec, 670 secs
lola: 56895056 markings, 577894880 edges, 70114 markings/sec, 675 secs
lola: 57263915 markings, 581630554 edges, 73772 markings/sec, 680 secs
lola: 57628313 markings, 585343759 edges, 72880 markings/sec, 685 secs
lola: 57958849 markings, 588922113 edges, 66107 markings/sec, 690 secs
lola: 58487771 markings, 593188442 edges, 105784 markings/sec, 695 secs
lola: 59075913 markings, 597610023 edges, 117628 markings/sec, 700 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: memory allocation failed
lola:
preliminary result: yes no yes no yes no yes yes no no yes unknown
FORMULA DES-PT-30a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="DES-PT-30a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is DES-PT-30a, 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 r058-smll-152646385700241"
echo "====================================================================="
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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
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 ;