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 172K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K 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 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SwimmingPool-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512600227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527300168130

info: Time: 3600 - MCC
===========================================================================================
prep: translating SwimmingPool-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SwimmingPool-PT-03 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SwimmingPool-PT-03 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-03-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: NOT(E ((((3 <= InBath) OR (2 <= Out)) U ((Cabins <= Undress) AND (2 <= Cabins))))) : E (G ((WaitBag <= Undress))) : A (F (NOT(A (G ((Entered <= Out)))))) : A (G (E (X (((2 <= Bags) OR (3 <= Undress)))))) : NOT((E (F ((Cabins <= 2))) OR ((Cabins <= 1)))) : E (F (((Cabins <= 0) AND ((3 <= Cabins) OR (InBath <= Undress) OR (2 <= InBath))))) : A (F (E (G ((Dressed <= 0))))) : A (G ((3 <= Bags))) : NOT(A ((() U ((InBath <= Cabins) AND (1 <= WaitBag))))) : (E (G (E (X ((Dress <= Entered))))) AND E (F (((InBath + 1 <= Cabins) AND (Cabins + 1 <= Entered))))) : E (X (((1 <= Undress) OR A (G ((Undress <= Bags)))))) : (E (F (((Cabins <= InBath) AND (1 <= Undress) AND (2 <= Cabins) AND (3 <= Undress)))) OR E ((((Cabins <= Undress) AND (1 <= InBath)) U ((1 <= Dress) AND (2 <= Bags))))) : (E (G (A (G (TRUE)))) AND NOT((A (F ((3 <= Out))) AND (Bags <= Undress)))) : A (G (E (X (TRUE)))) : A (G ((((2 <= Bags) OR (InBath <= Bags) OR (Dress <= Entered)) OR E (F ((Dressed <= Bags)))))) : A (G ((Undress <= Bags)))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((2 <= Bags) OR (3 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(((2 <= Bags) OR (3 <= Undress))))))
lola: processed formula length: 56
lola: 34 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1824420 markings, 5800844 edges, 364884 markings/sec, 0 secs
lola: 3335791 markings, 10992797 edges, 302274 markings/sec, 5 secs
lola: 4735220 markings, 15917114 edges, 279886 markings/sec, 10 secs
lola: 6077409 markings, 20702038 edges, 268438 markings/sec, 15 secs
lola: 7381390 markings, 25397850 edges, 260796 markings/sec, 20 secs
lola: 8659504 markings, 30031247 edges, 255623 markings/sec, 25 secs
lola: 9923921 markings, 34627193 edges, 252883 markings/sec, 30 secs
lola: 11175499 markings, 39180844 edges, 250316 markings/sec, 35 secs
lola: 12418360 markings, 43718394 edges, 248572 markings/sec, 40 secs
lola: 13654075 markings, 48233190 edges, 247143 markings/sec, 45 secs
lola: 14749731 markings, 52241342 edges, 219131 markings/sec, 50 secs
lola: 15859527 markings, 56300196 edges, 221959 markings/sec, 55 secs
lola: 17016283 markings, 60527080 edges, 231351 markings/sec, 60 secs
lola: 18196819 markings, 64846137 edges, 236107 markings/sec, 65 secs
lola: 19396655 markings, 69233023 edges, 239967 markings/sec, 70 secs
lola: 20607147 markings, 73662497 edges, 242098 markings/sec, 75 secs
lola: 21827240 markings, 78128531 edges, 244019 markings/sec, 80 secs
lola: 23054773 markings, 82614117 edges, 245507 markings/sec, 85 secs
lola: 24290181 markings, 87131944 edges, 247082 markings/sec, 90 secs
lola: 25533648 markings, 91682762 edges, 248693 markings/sec, 95 secs
lola: 26784067 markings, 96263225 edges, 250084 markings/sec, 100 secs
lola: 28043026 markings, 100881312 edges, 251792 markings/sec, 105 secs
lola: 29320840 markings, 105574223 edges, 255563 markings/sec, 110 secs
lola: 29744537 markings, 107133568 edges, 84739 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 29744537 markings, 107133568 edges

FORMULA SwimmingPool-PT-03-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((Dress <= Entered))))) AND E (F (((InBath + 1 <= Cabins) AND (Cabins + 1 <= Entered)))))lola: ========================================

lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((InBath + 1 <= Cabins) AND (Cabins + 1 <= Entered))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((InBath + 1 <= Cabins) AND (Cabins + 1 <= Entered))))
lola: processed formula length: 60
lola: 33 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((InBath + 1 <= Cabins) AND (Cabins + 1 <= Entered))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: state equation: write sara problem file to SwimmingPool-PT-03-CTLCardinality-0.sara
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((Dress <= Entered)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((Dress <= Entered)))))
lola: processed formula length: 42
lola: 34 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 126 markings, 126 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= Undress))) OR E (X (A (G ((Undress <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= Undress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((1 <= Undress))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((Undress <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (Bags + 1 <= Undress))))
lola: processed formula length: 40
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 113 markings, 112 edges
lola: ========================================lola: SUBRESULT
lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net is deadlock-free.
lola: 420 markings, 479 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Bags)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= Bags)))
lola: processed formula length: 19
lola: 34 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Bags <= 2)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 143 markings, 142 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Out + 1 <= Entered)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((Out + 1 <= Entered)))
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (Out + 1 <= Entered)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-03-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Undress <= Bags)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((Undress <= Bags)))
lola: processed formula length: 25
lola: 34 rewrites
lola: sara: try reading problem file SwimmingPool-PT-03-CTLCardinality-5-0.sara.
closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Bags + 1 <= Undress)
lola: sara: place or transition ordering is non-deterministic
state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-03-CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 70 markings, 69 edges

lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Cabins <= 0) AND ((3 <= Cabins) OR (InBath <= Undress) OR (2 <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((Cabins <= 0) AND ((3 <= Cabins) OR (InBath <= Undress) OR (2 <= InBath)))))
lola: processed formula length: 85
lola: 33 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((Cabins <= 0) AND ((3 <= Cabins) OR (InBath <= Undress) OR (2 <= InBath)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-03-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SwimmingPool-PT-03-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges

FORMULA SwimmingPool-PT-03-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((WaitBag <= Undress)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((WaitBag <= Undress)))
lola: processed formula length: 28
lola: 32 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 61 markings, 60 edges
lola: ========================================
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((Cabins + 1 <= InBath) OR (WaitBag <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((Cabins + 1 <= InBath) OR (WaitBag <= 0))))
lola: processed formula length: 51
lola: 32 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 61 markings, 60 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((Dressed <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= Dressed))))
lola: processed formula length: 39
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2518560 markings, 7137444 edges, 503712 markings/sec, 0 secs
lola: 4595233 markings, 13168262 edges, 415335 markings/sec, 5 secs
lola: 6813128 markings, 19576969 edges, 443579 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7544532 markings, 21664600 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= Bags) OR (InBath <= Bags) OR (Dress <= Entered)) OR E (F ((Dressed <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (((Bags <= 1) AND (Bags + 1 <= InBath) AND (Entered + 1 <= Dress)) AND NOT(E(TRUE U (Dressed <= Bags))))))
lola: processed formula length: 119
lola: 36 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1865535 markings, 5940179 edges, 373107 markings/sec, 0 secs
lola: 3340483 markings, 11008957 edges, 294990 markings/sec, 5 secs
lola: 4631704 markings, 15547691 edges, 258244 markings/sec, 10 secs
lola: 5844089 markings, 19865032 edges, 242477 markings/sec, 15 secs
lola: 7094897 markings, 24363521 edges, 250162 markings/sec, 20 secs
lola: 8366272 markings, 28965345 edges, 254275 markings/sec, 25 secs
lola: 9639682 markings, 33593182 edges, 254682 markings/sec, 30 secs
lola: 10916058 markings, 38236595 edges, 255275 markings/sec, 35 secs
lola: 12193885 markings, 42900542 edges, 255565 markings/sec, 40 secs
lola: 13471644 markings, 47565487 edges, 255552 markings/sec, 45 secs
lola: 14749262 markings, 52239684 edges, 255524 markings/sec, 50 secs
lola: 16028345 markings, 56917492 edges, 255817 markings/sec, 55 secs
lola: 17309269 markings, 61598922 edges, 256185 markings/sec, 60 secs
lola: 18585011 markings, 66266988 edges, 255148 markings/sec, 65 secs
lola: 19853717 markings, 70903910 edges, 253741 markings/sec, 70 secs
lola: 21054128 markings, 75298196 edges, 240082 markings/sec, 75 secs
lola: 22302418 markings, 79863203 edges, 249658 markings/sec, 80 secs
lola: 23478190 markings, 84161788 edges, 235154 markings/sec, 85 secs
lola: 24607015 markings, 88292150 edges, 225765 markings/sec, 90 secs
lola: 25724049 markings, 92386595 edges, 223407 markings/sec, 95 secs
lola: 26839215 markings, 96483166 edges, 223033 markings/sec, 100 secs
lola: 27951113 markings, 100590329 edges, 222380 markings/sec, 105 secs
lola: 29062977 markings, 104741916 edges, 222373 markings/sec, 110 secs
lola: 30161817 markings, 108943529 edges, 219768 markings/sec, 115 secs
lola: 31183050 markings, 113125619 edges, 204247 markings/sec, 120 secs
lola: 32075868 markings, 117393484 edges, 178564 markings/sec, 125 secs
lola: 32164133 markings, 121336642 edges, 17653 markings/sec, 130 secs
lola: 32168049 markings, 124581879 edges, 783 markings/sec, 135 secs
lola: 32170740 markings, 127680264 edges, 538 markings/sec, 140 secs
lola: 32172933 markings, 130692751 edges, 439 markings/sec, 145 secs
lola: 32175008 markings, 133657513 edges, 415 markings/sec, 150 secs
lola: 32176844 markings, 136595647 edges, 367 markings/sec, 155 secs
lola: 32178536 markings, 139531911 edges, 338 markings/sec, 160 secs
lola: 32180200 markings, 142507594 edges, 333 markings/sec, 165 secs
lola: 32181899 markings, 145673488 edges, 340 markings/sec, 170 secs
lola: 32183591 markings, 148965994 edges, 338 markings/sec, 175 secs
lola: 32185331 markings, 152231495 edges, 348 markings/sec, 180 secs
lola: 32187109 markings, 155631072 edges, 356 markings/sec, 185 secs
lola: 32188967 markings, 159091660 edges, 372 markings/sec, 190 secs
lola: 32190765 markings, 162562160 edges, 360 markings/sec, 195 secs
lola: 32192404 markings, 166025584 edges, 328 markings/sec, 200 secs
lola: 32193995 markings, 169477853 edges, 318 markings/sec, 205 secs
lola: 32195515 markings, 172915258 edges, 304 markings/sec, 210 secs
lola: 32197035 markings, 176337634 edges, 304 markings/sec, 215 secs
lola: 32198575 markings, 179725884 edges, 308 markings/sec, 220 secs
lola: 32199971 markings, 183062662 edges, 279 markings/sec, 225 secs
lola: 32201350 markings, 186335819 edges, 276 markings/sec, 230 secs
lola: 32202671 markings, 189449379 edges, 264 markings/sec, 235 secs
lola: 32204140 markings, 192486421 edges, 294 markings/sec, 240 secs
lola: 32205865 markings, 195710437 edges, 345 markings/sec, 245 secs
lola: 32208056 markings, 199293565 edges, 438 markings/sec, 250 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 32209356 markings, 201043889 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 793 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((3 <= Cabins))) AND ((2 <= Cabins)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 793 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= Cabins))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= Cabins))
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file SwimmingPool-PT-03-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: subprocess 13 will run for 1058 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Cabins)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((3 <= Cabins)))
lola: processed formula length: 21
lola: 34 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (Cabins <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-03-CTLCardinality-13-0.sara
========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 56 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1058 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((Out <= 2))) OR (Undress + 1 <= Bags))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1058 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((Out <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((Out <= 2)))
lola: processed formula length: 18
lola: 32 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Undress + 1 <= Bags)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Undress + 1 <= Bags)
lola: processed formula length: 21
lola: 32 rewrites
lola: closed formula file SwimmingPool-PT-03-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: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((InBath <= 2) AND (Out <= 1)) R ((Undress + 1 <= Cabins) OR (Cabins <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((((InBath <= 2) AND (Out <= 1)) R ((Undress + 1 <= Cabins) OR (Cabins <= 1))))
lola: processed formula length: 82
lola: 38 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((Cabins <= Undress) AND (2 <= Cabins))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 124 markings, 124 edges
lola: state equation: write sara problem file to SwimmingPool-PT-03-CTLCardinality-14-0.sara
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((Cabins <= InBath) AND (1 <= Undress) AND (2 <= Cabins) AND (3 <= Undress)))) OR E ((((Cabins <= Undress) AND (1 <= InBath)) U ((1 <= Dress) AND (2 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Cabins <= InBath) AND (1 <= Undress) AND (2 <= Cabins) AND (3 <= Undress))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((Cabins <= InBath) AND (1 <= Undress) AND (2 <= Cabins) AND (3 <= Undress))))
lola: processed formula length: 84
lola: 33 rewrites
lola: closed formula file SwimmingPool-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((Cabins <= InBath) AND (1 <= Undress) AND (2 <= Cabins) AND (3 <= Undress))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 68 markings, 67 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SwimmingPool-PT-03-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no yes no no no yes no yes yes yes yes no
lola:
preliminary result: no no yes no no yes no no no yes no yes yes yes yes no
lola: memory consumption: 22116 KB
lola: time consumption: 395 seconds

BK_TIME_CONFINEMENT_REACHED

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

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="SwimmingPool-PT-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/SwimmingPool-PT-03.tgz
mv SwimmingPool-PT-03 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 lola"
echo " Input is SwimmingPool-PT-03, 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 r160-smll-152705512600227"
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 ;