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 704K
-rw-r--r-- 1 mcc users 3.6K 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 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 16K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 536K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FlexibleBarrier-PT-12b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007100164
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527594225102


BK_STOP 1527594694662

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-12b as instance name.
Using FlexibleBarrier 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': False, 'Source Transition': False, 'Sink Transition': False, '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': 2032198, 'Memory': 7861.79, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FlexibleBarrier-PT-12b...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
FlexibleBarrier-PT-12b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-12b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ FlexibleBarrier-PT-12b @ 3540 seconds
----- Start make result stderr -----
----- 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: 4277/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1988 places, 2289 transitions, 1974 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-12b-CTLCardinality.task
lola: (A (((p1421 <= p1109) U (3 <= p1596))) OR A (G ((p1908 <= p101)))) : (NOT(E (F (((p1671 <= p270) AND (p1483 <= p236))))) OR A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))) : A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904))))) : (A (G (((p1165 <= p1541) OR (p958 <= p1450) OR (p807 <= p201)))) OR (((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576))) AND E (X (((p117 <= p92) AND (2 <= p1029)))))) : A (X (E (G (((p1127 <= p1887) OR (2 <= p511)))))) : E (X (E (G (((p318 <= p1513) OR (p1811 <= p1205)))))) : A (G ((p156 <= p1557))) : A (G ((A (G ((2 <= p243))) OR E (G ((p732 <= p1364)))))) : A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572)))) : E (((3 <= p980) U E (G ((p47 <= p258))))) : E (F (A (F ((p748 + 1 <= p461))))) : ((p1084 <= p1796) AND (NOT(A (G ((p223 <= p1962)))) OR NOT(A (F ((p686 <= p914)))))) : A ((E (G ((3 <= p880))) U E (G ((p771 <= p1060))))) : E (G ((A (F ((p367 <= p880))) OR ((1 <= p1343) OR (p1264 <= p782) OR ((p608 <= p1208) AND (2 <= p1753)))))) : (NOT(NOT(A (G ((p1251 <= p2))))) AND E (X (E (G ((p1164 <= p1049)))))) : NOT(E (F ((2 <= p710))))
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 (((p1421 <= p1109) U (3 <= p1596))) OR A (G ((p1908 <= p101))))
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: A (((p1421 <= p1109) U (3 <= p1596)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p1421 <= p1109) U (3 <= p1596)))
lola: processed formula: A (((p1421 <= p1109) U (3 <= p1596)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 8 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: 80 markings, 80 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1908 <= p101)))
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 248 bytes per marking, with 10 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((p1671 <= p270) AND (p1483 <= p236))))) OR A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p270 + 1 <= p1671) OR (p236 + 1 <= p1483))))
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 248 bytes per marking, with 10 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-CTLCardinality.sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))
lola: processed formula: A ((((p345 <= p1365) OR (p116 <= p425)) U (3 <= p33)))
lola: processed formula length: 55
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality.sara.
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: 80 markings, 80 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904)))))
lola: processed formula: A (F (((p436 <= p1348) AND ((p1723 + 1 <= p1567) OR (p1466 + 1 <= p1904)))))
lola: processed formula length: 77
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 9 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: 80 markings, 80 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p1165 <= p1541) OR (p958 <= p1450) OR (p807 <= p201)))) OR (((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576))) AND E (X (((p117 <= p92) AND (2 <= p1029))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1165 <= p1541) OR (p958 <= p1450) OR (p807 <= p201))))
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 248 bytes per marking, with 10 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 FlexibleBarrier-PT-12b-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 137402 markings, 166435 edges, 27480 markings/sec, 0 secs
lola: sara is running 5 secs || 275623 markings, 342509 edges, 27644 markings/sec, 5 secs
lola: sara is running 10 secs || 413755 markings, 518173 edges, 27626 markings/sec, 10 secs
lola: sara is running 15 secs || 554187 markings, 693288 edges, 28086 markings/sec, 15 secs
lola: sara is running 20 secs || 692736 markings, 868372 edges, 27710 markings/sec, 20 secs
lola: sara is running 25 secs || 831911 markings, 1038392 edges, 27835 markings/sec, 25 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1739 <= 2) OR ((p109 + 1 <= p1023) AND (p401 + 1 <= p576)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-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 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p117 <= p92) AND (2 <= p1029))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p117 <= p92) AND (2 <= p1029)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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 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: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p1127 <= p1887) OR (2 <= p511))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U ((p1887 + 1 <= p1127) AND (p511 <= 1)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p318 <= p1513) OR (p1811 <= p1205))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((p1513 + 1 <= p318) AND (p1205 + 1 <= p1811)))))
lola: processed formula length: 65
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p156 <= p1557)))
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 248 bytes per marking, with 10 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 FlexibleBarrier-PT-12b-CTLCardinality-6.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: 34 markings, 33 edges
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((2 <= p243))) OR E (G ((p732 <= p1364))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (p243 <= 1)) AND A(TRUE U (p1364 + 1 <= p732)))))
lola: processed formula length: 72
lola: 8 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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: 190275 markings, 907215 edges, 3687031648961953792 markings/sec, 0 secs
lola: 375164 markings, 1926738 edges, 36978 markings/sec, 5 secs
lola: 552553 markings, 2964259 edges, 35478 markings/sec, 10 secs
lola: 719894 markings, 3965285 edges, 33468 markings/sec, 15 secs
lola: 902399 markings, 4980801 edges, 36501 markings/sec, 20 secs
lola: 1058818 markings, 5982212 edges, 31284 markings/sec, 25 secs
lola: 1247246 markings, 6981708 edges, 37686 markings/sec, 30 secs
lola: 1410695 markings, 7995688 edges, 32690 markings/sec, 35 secs
lola: 1589607 markings, 8984575 edges, 35782 markings/sec, 40 secs
lola: 1761390 markings, 9995593 edges, 34357 markings/sec, 45 secs
lola: 1929007 markings, 10985447 edges, 33523 markings/sec, 50 secs
lola: 2106844 markings, 11981919 edges, 35567 markings/sec, 55 secs
lola: 2264386 markings, 12965890 edges, 31508 markings/sec, 60 secs
lola: 2446087 markings, 13948956 edges, 36340 markings/sec, 65 secs
lola: 2599401 markings, 14925207 edges, 30663 markings/sec, 70 secs
lola: 2775859 markings, 15873278 edges, 35292 markings/sec, 75 secs
lola: 2933607 markings, 16842795 edges, 31550 markings/sec, 80 secs
lola: 3101759 markings, 17772391 edges, 33630 markings/sec, 85 secs
lola: 3262843 markings, 18735694 edges, 32217 markings/sec, 90 secs
lola: 3426727 markings, 19661895 edges, 32777 markings/sec, 95 secs
lola: 3587832 markings, 20608036 edges, 32221 markings/sec, 100 secs
lola: 3742209 markings, 21517458 edges, 30875 markings/sec, 105 secs
lola: 3901661 markings, 22423460 edges, 31890 markings/sec, 110 secs
lola: 4052048 markings, 23318956 edges, 30077 markings/sec, 115 secs
lola: 4215716 markings, 24243377 edges, 32734 markings/sec, 120 secs
lola: 4361710 markings, 25123618 edges, 29199 markings/sec, 125 secs
lola: 4524283 markings, 26036125 edges, 32515 markings/sec, 130 secs
lola: 4667739 markings, 26903394 edges, 28691 markings/sec, 135 secs
lola: 4829940 markings, 27811585 edges, 32440 markings/sec, 140 secs
lola: 4970972 markings, 28665390 edges, 28206 markings/sec, 145 secs
lola: 5131184 markings, 29562597 edges, 32042 markings/sec, 150 secs
lola: 5270876 markings, 30404437 edges, 27938 markings/sec, 155 secs
lola: 5429372 markings, 31297078 edges, 31699 markings/sec, 160 secs
lola: 5569073 markings, 32135004 edges, 27940 markings/sec, 165 secs
lola: 5724575 markings, 33018587 edges, 31100 markings/sec, 170 secs
lola: 5864507 markings, 33845333 edges, 27986 markings/sec, 175 secs
lola: 6013245 markings, 34709038 edges, 29748 markings/sec, 180 secs
lola: 6157185 markings, 35529635 edges, 28788 markings/sec, 185 secs
lola: 6297839 markings, 36378292 edges, 28131 markings/sec, 190 secs
lola: 6442217 markings, 37185685 edges, 28876 markings/sec, 195 secs
lola: 6577067 markings, 38021061 edges, 26970 markings/sec, 200 secs
lola: 6727020 markings, 38834507 edges, 29991 markings/sec, 205 secs
lola: 6852443 markings, 39645627 edges, 25085 markings/sec, 210 secs
lola: 7009623 markings, 40470134 edges, 31436 markings/sec, 215 secs
lola: 7132113 markings, 41262340 edges, 24498 markings/sec, 220 secs
lola: 7289362 markings, 42098432 edges, 31450 markings/sec, 225 secs
lola: 7413945 markings, 42874297 edges, 24917 markings/sec, 230 secs
lola: 7564559 markings, 43704889 edges, 30123 markings/sec, 235 secs
lola: 7690888 markings, 44463616 edges, 25266 markings/sec, 240 secs
lola: 7830394 markings, 45275499 edges, 27901 markings/sec, 245 secs
lola: 7964114 markings, 46029685 edges, 26744 markings/sec, 250 secs
lola: 8089051 markings, 46815589 edges, 24987 markings/sec, 255 secs
lola: 8236440 markings, 47598911 edges, 29478 markings/sec, 260 secs
lola: 8351286 markings, 48356903 edges, 22969 markings/sec, 265 secs
lola: 8504382 markings, 49159436 edges, 30619 markings/sec, 270 secs
lola: 8623534 markings, 49896338 edges, 23830 markings/sec, 275 secs
lola: 8766138 markings, 50693749 edges, 28521 markings/sec, 280 secs
lola: 8890795 markings, 51415998 edges, 24931 markings/sec, 285 secs
lola: 9013030 markings, 52176005 edges, 24447 markings/sec, 290 secs
lola: 9153873 markings, 52933160 edges, 28169 markings/sec, 295 secs
lola: 9264640 markings, 53667410 edges, 22153 markings/sec, 300 secs
lola: 9414628 markings, 54449767 edges, 29998 markings/sec, 305 secs
lola: 9530163 markings, 55160257 edges, 23107 markings/sec, 310 secs
lola: 9664301 markings, 55925456 edges, 26828 markings/sec, 315 secs
lola: 9786459 markings, 56621020 edges, 24432 markings/sec, 320 secs
lola: 9898604 markings, 57343867 edges, 22429 markings/sec, 325 secs
lola: 10041590 markings, 58090721 edges, 28597 markings/sec, 330 secs
lola: 10152171 markings, 58788957 edges, 22116 markings/sec, 335 secs
lola: 10290925 markings, 59551192 edges, 27751 markings/sec, 340 secs
lola: 10406545 markings, 60224913 edges, 23124 markings/sec, 345 secs
lola: 10517199 markings, 60931151 edges, 22131 markings/sec, 350 secs
lola: 10653771 markings, 61648465 edges, 27314 markings/sec, 355 secs
lola: 10761842 markings, 62332835 edges, 21614 markings/sec, 360 secs
lola: 10897946 markings, 63080350 edges, 27221 markings/sec, 365 secs
lola: 11010917 markings, 63737434 edges, 22594 markings/sec, 370 secs
lola: 11116473 markings, 64420347 edges, 21111 markings/sec, 375 secs
lola: 11254457 markings, 65140392 edges, 27597 markings/sec, 380 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572))))
lola: processed formula: A (((p971 <= 1) U ((2 <= p363) AND (p725 + 1 <= p1572))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 8 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: 98 markings, 98 edges
lola: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p980) U E (G ((p47 <= p258)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p980) U NOT(A(TRUE U (p258 + 1 <= p47))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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: 65 markings, 66 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((p748 + 1 <= p461)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (p748 + 1 <= p461)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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: 108 markings, 314 edges
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1084 <= p1796) AND (NOT(A (G ((p223 <= p1962)))) OR NOT(A (F ((p686 <= p914))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1084 <= p1796)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1084 <= p1796)
lola: processed formula length: 16
lola: 6 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-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 12 will run for 779 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1962 + 1 <= p223)))
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 248 bytes per marking, with 10 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 FlexibleBarrier-PT-12b-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((3 <= p880))) U E (G ((p771 <= p1060)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p880 <= 2))) U NOT(A(TRUE U (p1060 + 1 <= p771))))
lola: processed formula length: 66
lola: 5 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 65 markings, 66 edges
lola: ========================================
lola: subprocess 13 will run for 1038 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p367 <= p880))) OR ((1 <= p1343) OR (p1264 <= p782) OR ((p608 <= p1208) AND (2 <= p1753))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (p367 <= p880))) AND ((p1343 <= 0) AND (p782 + 1 <= p1264) AND ((p1208 + 1 <= p608) OR (p1753 <= 1))))))
lola: processed formula length: 132
lola: 4 rewrites
lola: formula mentions 0 of 1988 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-12b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 10 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: 65 markings, 130 edges
lola: ========================================
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (G ((p1251 <= p2))))) AND E (X (E (G ((p1164 <= p1049))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1251 <= p2)))
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 248 bytes per marking, with 10 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 FlexibleBarrier-PT-12b-CTLCardinality-14.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: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((2 <= p710))))
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 248 bytes per marking, with 10 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 FlexibleBarrier-PT-12b-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no unknown no yes yes yes yes yes no yes
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-12b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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-structural"
echo " Input is FlexibleBarrier-PT-12b, 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 r095-blw7-152650007100164"
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 ;