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 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 6.2K 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.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is RobotManipulation-PT-00050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-152685548800038
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526896488262


BK_STOP 1526897533147

--------------------
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 RobotManipulation-PT-00050 as instance name.
Using RobotManipulation 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 475014, 'Memory': 15931.03, 'Tool': 'marcie'}, {'Time': 513450, 'Memory': 11029.86, 'Tool': 'lola'}, {'Time': 3511024, 'Memory': 12801.37, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0809155098586567x far from the best tool marcie.
CTLCardinality marcie RobotManipulation-PT-00050...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
check for maximal unmarked siphon
ok

Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: RobotManipulation_PT_00050
(NrP: 15 NrTr: 11 NrArc: 34)

check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

net check time: 0m 0.001sec

init dd package: 0m 1.571sec

check for maximal unmarked siphon
parse successfull
ok
check for constant places
ok
net created successfully

Net: RobotManipulation_PT_00050
(NrP: 15 NrTr: 11 NrArc: 34)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec
net check time: 0m 0.000sec


init dd package: 0m 4.992sec


iterations count:4213 (383), effective:1001 (91)


RS generation: 0m21.360sec


initing FirstDep: 0m 0.000sec

-> reachability set: #nodes 759117 (7.6e+05) #states 8,526,843,022,542 (12)



starting MCC model checker
--------------------------


iterations count:175 (15), effective:36 (3)
checking: AG [~ [AX [3<=r_moving]]]
normalized: ~ [E [true U ~ [EX [~ [3<=r_moving]]]]]

abstracting: (3<=r_moving)
states: 6,567,733,272,100 (12)

.-> the formula is FALSE

FORMULA RobotManipulation-PT-00050-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m42.453sec

checking: EF [~ [2<=r_stopped]]
normalized: E [true U ~ [2<=r_stopped]]

abstracting: (2<=r_stopped)
states: 7,774,051,628,200 (12)
sat_reach.icc:155: Timeout: after 231 sec

MC time: 3m52.647sec

checking: EF [3<=moved]
normalized: E [true U 3<=moved]

abstracting: (3<=moved)
states: 6,567,733,272,100 (12)

iterations count:110 (10), effective:27 (2)
-> the formula is TRUE
std::bad_alloc


FORMULA RobotManipulation-PT-00050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.431sec

checking: ~ [EF [AG [1<=p_rdy]]]
normalized: ~ [E [true U ~ [E [true U ~ [1<=p_rdy]]]]]

abstracting: (1<=p_rdy)
states: 7,822,791,763,800 (12)

FORMULA RobotManipulation-PT-00050-CTLCardinality-13 CANNOT_COMPUTE

MC time: 0m16.818sec

checking: AG [EF [3<=p_rdy]]
normalized: ~ [E [true U ~ [E [true U 3<=p_rdy]]]]

abstracting: (3<=p_rdy)

before gc: list nodes free: 41

after gc: idd nodes used:3033494, unused:60966506; list nodes free:503918197
states: 6,567,733,272,100 (12)

iterations count:131 (11), effective:27 (2)
/usr/bin/mcc-head: line 8: 8 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
CTLCardinality lola RobotManipulation-PT-00050...

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00050: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ RobotManipulation-PT-00050 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00050-CTLCardinality.task
lola: A (G (NOT(A (X ((3 <= r_moving)))))) : E (F ((((2 <= p_i2) AND (r_active <= p_i2) AND ((p_rel <= initialized) OR (r_moving <= p_m))) AND E (X ((r_stopped <= initialize)))))) : ((moved <= r_stopped) AND A (G (((p_rdy <= r_active) OR (2 <= initialized) OR (3 <= access))))) : E ((E (G ((move <= p_sc))) U ((p_i1 <= 2) AND (p_sc <= 1)))) : A (X (E (G (((3 <= initialized) OR (access <= r_stopped)))))) : (NOT(E (F (((access <= p_rdy) AND (move <= initialize))))) OR (((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1)) AND (((p_m <= 0) AND (r_active + 1 <= move)) OR A (X ((1 <= p_m)))))) : E (F ((r_stopped <= 1))) : (A (X (A (F ((r_moving <= r_active))))) AND A (G (((2 <= initialize) OR (3 <= r_moving) OR (2 <= access))))) : A (G (((p_rel <= 0) OR (r_moving <= 2) OR (r_moving <= p_i2)))) : NOT(A (G (TRUE))) : NOT((E (G ((r_active <= p_m))) AND (A (X ((p_i1 <= r_stopped))) AND TRUE))) : A (G ((E (F ((moved <= p_i2))) OR E (F ((p_i1 <= p_m)))))) : E (F ((3 <= moved))) : NOT(E (F (A (G ((1 <= p_rdy)))))) : E (G ((initialized <= r_moving))) : A (G (E (F ((3 <= p_rdy)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((3 <= r_moving))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((r_moving <= 2)))))
lola: processed formula length: 39
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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: 100807 markings, 312086 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p_i2) AND (r_active <= p_i2) AND ((p_rel <= initialized) OR (r_moving <= p_m))) AND E (X ((r_stopped <= initialize))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (((2 <= p_i2) AND (r_active <= p_i2) AND ((p_rel <= initialized) OR (r_moving <= p_m))) AND EX((r_stopped <= initialize))))
lola: processed formula length: 133
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((moved <= r_stopped) AND A (G (((p_rdy <= r_active) OR (2 <= initialized) OR (3 <= access)))))
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: (moved <= r_stopped)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (moved <= r_stopped)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rdy <= r_active) OR (2 <= initialized) OR (3 <= access))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00050-CTLCardinality-3.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
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 ((E (G ((move <= p_sc))) U ((p_i1 <= 2) AND (p_sc <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U (p_sc + 1 <= move))) U ((p_i1 <= 2) AND (p_sc <= 1)))
lola: processed formula length: 68
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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: 555 markings, 1145 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((3 <= initialized) OR (access <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U ((initialized <= 2) AND (r_stopped + 1 <= access)))))
lola: processed formula length: 69
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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: 202 markings, 201 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((access <= p_rdy) AND (move <= initialize))))) OR (((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1)) AND (((p_m <= 0) AND (r_active + 1 <= move)) OR A (X ((1 <= p_m))))))
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: A (G (((p_rdy + 1 <= access) OR (initialize + 1 <= move))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 301 markings, 300 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_rdy <= 0) OR (r_stopped + 1 <= p_i1) OR (p_i2 <= p_i1))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: processed formula with 3 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_m <= 0) AND (r_active + 1 <= move))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_m <= 0) AND (r_active + 1 <= move))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: processed formula with 2 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p_m)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= p_m)))
lola: processed formula: A (X ((1 <= p_m)))
lola: processed formula length: 18
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 505 markings, 505 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((r_stopped <= 1)))
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 36 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-6.sara
lola: 199 markings, 198 edges
lola: ========================================
lola: lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)state equation: calling and running sara

lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((r_moving <= r_active))))) AND A (G (((2 <= initialize) OR (3 <= r_moving) OR (2 <= access)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((r_moving <= r_active)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (r_moving <= r_active)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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).
sara: try reading problem file RobotManipulation-PT-00050-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= initialize) OR (3 <= r_moving) OR (2 <= access))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-8.sara
lola: lola:
SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 397 markings, 396 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rel <= 0) OR (r_moving <= 2) OR (r_moving <= p_i2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00050-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: processed formula with 0 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((r_active <= p_m))) AND (A (X ((p_i1 <= r_stopped))) AND TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_m + 1 <= r_active)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_m + 1 <= r_active)))
lola: processed formula: A (F ((p_m + 1 <= r_active)))
lola: processed formula length: 29
lola: 9 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 103 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((moved <= p_i2))) OR E (F ((p_i1 <= p_m))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (moved <= p_i2))) AND NOT(E(TRUE U (p_i1 <= p_m))))))
lola: processed formula length: 80
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1556538 markings, 5252936 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2886988 markings, 9832132 edges, 266090 markings/sec, 5 secs
lola: 4141549 markings, 14173158 edges, 250912 markings/sec, 10 secs
lola: 5353446 markings, 18386330 edges, 242379 markings/sec, 15 secs
lola: 6535366 markings, 22489864 edges, 236384 markings/sec, 20 secs
lola: 7670783 markings, 26451717 edges, 227083 markings/sec, 25 secs
lola: 8798422 markings, 30381069 edges, 225528 markings/sec, 30 secs
lola: 9896462 markings, 34223647 edges, 219608 markings/sec, 35 secs
lola: 10980079 markings, 38024067 edges, 216723 markings/sec, 40 secs
lola: 12073934 markings, 41854948 edges, 218771 markings/sec, 45 secs
lola: 13148987 markings, 45625399 edges, 215011 markings/sec, 50 secs
lola: 14217093 markings, 49382101 edges, 213621 markings/sec, 55 secs
lola: 15276736 markings, 53104902 edges, 211929 markings/sec, 60 secs
lola: 16306823 markings, 56731792 edges, 206017 markings/sec, 65 secs
lola: 17324030 markings, 60309447 edges, 203441 markings/sec, 70 secs
lola: 18375454 markings, 64009004 edges, 210285 markings/sec, 75 secs
lola: 19437105 markings, 67742205 edges, 212330 markings/sec, 80 secs
lola: 20481850 markings, 71408229 edges, 208949 markings/sec, 85 secs
lola: 21527700 markings, 75100974 edges, 209170 markings/sec, 90 secs
lola: 22546778 markings, 78690981 edges, 203816 markings/sec, 95 secs
lola: 23559649 markings, 82269092 edges, 202574 markings/sec, 100 secs
lola: 24569903 markings, 85842762 edges, 202051 markings/sec, 105 secs
lola: 25582385 markings, 89411086 edges, 202496 markings/sec, 110 secs
lola: 26591563 markings, 92977308 edges, 201836 markings/sec, 115 secs
lola: 27605974 markings, 96550490 edges, 202882 markings/sec, 120 secs
lola: 28579012 markings, 100002741 edges, 194608 markings/sec, 125 secs
lola: 29538123 markings, 103394123 edges, 191822 markings/sec, 130 secs
lola: 30503979 markings, 106808526 edges, 193171 markings/sec, 135 secs
lola: 31481241 markings, 110265766 edges, 195452 markings/sec, 140 secs
lola: 32467225 markings, 113756008 edges, 197197 markings/sec, 145 secs
lola: 33474078 markings, 117309652 edges, 201371 markings/sec, 150 secs
lola: 34443980 markings, 120744881 edges, 193980 markings/sec, 155 secs
lola: 35398201 markings, 124122288 edges, 190844 markings/sec, 160 secs
lola: 36390419 markings, 127632065 edges, 198444 markings/sec, 165 secs
lola: 37362558 markings, 131065576 edges, 194428 markings/sec, 170 secs
lola: 38324919 markings, 134471163 edges, 192472 markings/sec, 175 secs
lola: 39265651 markings, 137812430 edges, 188146 markings/sec, 180 secs
lola: 40230379 markings, 141222316 edges, 192946 markings/sec, 185 secs
lola: 41182386 markings, 144600522 edges, 190401 markings/sec, 190 secs
lola: 42145873 markings, 148008822 edges, 192697 markings/sec, 195 secs
lola: 43073662 markings, 151314297 edges, 185558 markings/sec, 200 secs
lola: 44028073 markings, 154701905 edges, 190882 markings/sec, 205 secs
lola: 44942501 markings, 157955382 edges, 182886 markings/sec, 210 secs
lola: 45885450 markings, 161277523 edges, 188590 markings/sec, 215 secs
lola: 46803479 markings, 164553137 edges, 183606 markings/sec, 220 secs
lola: 47741307 markings, 167879029 edges, 187566 markings/sec, 225 secs
lola: 48670112 markings, 171172198 edges, 185761 markings/sec, 230 secs
lola: 49605178 markings, 174503035 edges, 187013 markings/sec, 235 secs
lola: 50544941 markings, 177832062 edges, 187953 markings/sec, 240 secs
lola: 51471782 markings, 181126966 edges, 185368 markings/sec, 245 secs
lola: 52404891 markings, 184429525 edges, 186622 markings/sec, 250 secs
lola: 53329503 markings, 187718651 edges, 184922 markings/sec, 255 secs
lola: 54258309 markings, 191014689 edges, 185761 markings/sec, 260 secs
lola: 55179280 markings, 194295218 edges, 184194 markings/sec, 265 secs
lola: 56106064 markings, 197576553 edges, 185357 markings/sec, 270 secs
lola: 57023545 markings, 200840354 edges, 183496 markings/sec, 275 secs
lola: 57931098 markings, 204075094 edges, 181511 markings/sec, 280 secs
lola: 58837030 markings, 207301663 edges, 181186 markings/sec, 285 secs
lola: 59754718 markings, 210556498 edges, 183538 markings/sec, 290 secs
lola: 60660766 markings, 213778212 edges, 181210 markings/sec, 295 secs
lola: 61578112 markings, 217033350 edges, 183469 markings/sec, 300 secs
lola: 62496876 markings, 220293916 edges, 183753 markings/sec, 305 secs
lola: 63406269 markings, 223529356 edges, 181879 markings/sec, 310 secs
lola: 64306329 markings, 226740266 edges, 180012 markings/sec, 315 secs
lola: 65197283 markings, 229923642 edges, 178191 markings/sec, 320 secs
lola: 66090633 markings, 233111348 edges, 178670 markings/sec, 325 secs
lola: 66988011 markings, 236301436 edges, 179476 markings/sec, 330 secs
lola: 67900178 markings, 239535120 edges, 182433 markings/sec, 335 secs
lola: 68802483 markings, 242753245 edges, 180461 markings/sec, 340 secs
lola: 69659476 markings, 245827811 edges, 171399 markings/sec, 345 secs
lola: 70554210 markings, 248994930 edges, 178947 markings/sec, 350 secs
lola: 71465715 markings, 252218407 edges, 182301 markings/sec, 355 secs
lola: 72349724 markings, 255365293 edges, 176802 markings/sec, 360 secs
lola: 73243521 markings, 258535798 edges, 178759 markings/sec, 365 secs
lola: 74124392 markings, 261664881 edges, 176174 markings/sec, 370 secs
lola: 75014820 markings, 264827250 edges, 178086 markings/sec, 375 secs
lola: 75898730 markings, 267988800 edges, 176782 markings/sec, 380 secs
lola: 76796924 markings, 271212374 edges, 179639 markings/sec, 385 secs
lola: 77681037 markings, 274378923 edges, 176823 markings/sec, 390 secs
----- Kill lola and sara stderr -----
lola: 78552736 markings, 277479278 edges, 174340 markings/sec, 395 secs
lola: 79437625 markings, 280636804 edges, 176978 markings/sec, 400 secs
lola: 80334765 markings, 283823120 edges, 179428 markings/sec, 405 secs
lola: 81208922 markings, 286943410 edges, 174831 markings/sec, 410 secs
lola: 82092957 markings, 290096835 edges, 176807 markings/sec, 415 secs
lola: 82992033 markings, 293296028 edges, 179815 markings/sec, 420 secs
lola: 83876530 markings, 296445674 edges, 176899 markings/sec, 425 secs
lola: 84763954 markings, 299594243 edges, 177485 markings/sec, 430 secs
lola: 85632382 markings, 302699080 edges, 173686 markings/sec, 435 secs
lola: 86531879 markings, 305920057 edges, 179899 markings/sec, 440 secs
lola: 87445227 markings, 309176214 edges, 182670 markings/sec, 445 secs
lola: 88241458 markings, 312021868 edges, 159246 markings/sec, 450 secs
lola: 89109608 markings, 315127927 edges, 173630 markings/sec, 455 secs
lola: 89989285 markings, 318278075 edges, 175935 markings/sec, 460 secs
lola: 90895501 markings, 321509828 edges, 181243 markings/sec, 465 secs
lola: 91804468 markings, 324751439 edges, 181793 markings/sec, 470 secs
lola: 92707460 markings, 327978724 edges, 180598 markings/sec, 475 secs
lola: 93622746 markings, 331234200 edges, 183057 markings/sec, 480 secs
lola: 94527250 markings, 334466569 edges, 180901 markings/sec, 485 secs
lola: 95424057 markings, 337677515 edges, 179361 markings/sec, 490 secs
lola: 96319676 markings, 340891531 edges, 179124 markings/sec, 495 secs
lola: 97230033 markings, 344128967 edges, 182071 markings/sec, 500 secs
lola: 98150300 markings, 347392385 edges, 184053 markings/sec, 505 secs
lola: 99039109 markings, 350575703 edges, 177762 markings/sec, 510 secs
lola: 99923647 markings, 353715136 edges, 176908 markings/sec, 515 secs
lola: 100812985 markings, 356872831 edges, 177868 markings/sec, 520 secs
lola: 101686695 markings, 359993224 edges, 174742 markings/sec, 525 secs
lola: 102573425 markings, 363152777 edges, 177346 markings/sec, 530 secs
lola: 103450074 markings, 366283432 edges, 175330 markings/sec, 535 secs
lola: 104337100 markings, 369450778 edges, 177405 markings/sec, 540 secs
lola: 105104137 markings, 372201093 edges, 153407 markings/sec, 545 secs
lola: 105109006 markings, 372218114 edges, 974 markings/sec, 550 secs
lola: 105112284 markings, 372229752 edges, 656 markings/sec, 555 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: 'p'
Aborted (core dumped)
FORMULA RobotManipulation-PT-00050-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00050-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="RobotManipulation-PT-00050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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/RobotManipulation-PT-00050.tgz
mv RobotManipulation-PT-00050 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 irma4mcc-full"
echo " Input is RobotManipulation-PT-00050, 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 r150-smll-152685548800038"
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 ;