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 180K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K 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.5K 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 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SharedMemory-COL-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-smll-152708748700003
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527189275353


BK_STOP 1527189321674

--------------------
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 SharedMemory-COL-000005 as instance name.
Using SharedMemory as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, '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': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 116, 'Memory': 100.88, 'Tool': 'gspn'}, {'Time': 247, 'Memory': 111.07, 'Tool': 'lola'}, {'Time': 299, 'Memory': 111.96, 'Tool': 'lola'}, {'Time': 1840, 'Memory': 169.02, 'Tool': 'gspn'}, {'Time': 87058, 'Memory': 2229.94, 'Tool': 'marcie'}, {'Time': 88691, 'Memory': 2229.82, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.1293103448275863x far from the best tool gspn.
CTLCardinality lola SharedMemory-COL-000005...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
SharedMemory-COL-000005: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
SharedMemory-COL-000005: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SharedMemory-COL-000005 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 106/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 46 places, 60 transitions, 35 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000005-CTLCardinality.task
lola: A (G (((3 <= p5 + p6 + p7 + p8 + p9) OR (p10 + p11 + p12 + p13 + p14 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (p0 + p1 + p2 + p3 + p4 <= 1) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p45) OR (p0 + p1 + p2 + p3 + p4 + 1 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))) : (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4) : (p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14) : (((p45 <= 2) OR A (X (((1 <= p45) OR (p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2 + p3 + p4))))) OR E (F (((p45 + 1 <= p5 + p6 + p7 + p8 + p9) OR (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + 1 <= p45))))) : A ((((p15 + p16 + p17 + p18 + p19 <= 2) OR (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + 1 <= p0 + p1 + p2 + p3 + p4)) U A (F ((3 <= p15 + p16 + p17 + p18 + p19))))) : (E (((3 <= p10 + p11 + p12 + p13 + p14) U TRUE)) AND A ((TRUE U ((p0 + p1 + p2 + p3 + p4 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (p10 + p11 + p12 + p13 + p14 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))) : (p15 + p16 + p17 + p18 + p19 + 1 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) : ((1 <= p15 + p16 + p17 + p18 + p19) OR ((E (X ((3 <= p5 + p6 + p7 + p8 + p9))) OR (p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)) OR ((1 <= p5 + p6 + p7 + p8 + p9) OR A (X ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19)))))) : NOT(E (X (E (F ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))))) : ((1 <= p45) AND A (G (A (X ((2 <= p10 + p11 + p12 + p13 + p14)))))) : E (X (((p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45) OR (2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (2 <= p0 + p1 + p2 + p3 + p4) OR (1 <= p0 + p1 + p2 + p3 + p4) OR ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) AND (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p10 + p11 + p12 + p13 + p14))))) : ((((p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND A (G ((p45 <= p15 + p16 + p17 + p18 + p19)))) AND ((p45 <= p5 + p6 + p7 + p8 + p9) OR (p5 + p6 + p7 + p8 + p9 + 1 <= p45) OR (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19))) OR E (G (E (G (TRUE))))) : A (F ((A (G ((2 <= p45))) AND (p5 + p6 + p7 + p8 + p9 <= p45)))) : ((A (((1 <= p0 + p1 + p2 + p3 + p4) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45))) AND E (((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p10 + p11 + p12 + p13 + p14)))) OR NOT(E (((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) U (3 <= p10 + p11 + p12 + p13 + p14))))) : A (G ((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14))) : (2 <= p0 + p1 + p2 + p3 + p4)
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 (((3 <= p5 + p6 + p7 + p8 + p9) OR (p10 + p11 + p12 + p13 + p14 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (p0 + p1 + p2 + p3 + p4 <= 1) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p45) OR (p0 + p1 + p2 + p3 + p4 + 1 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 ... (shortened)
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 8 bytes per marking, with 29 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 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14)
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-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: (((p45 <= 2) OR A (X (((1 <= p45) OR (p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2 + p3 + p4))))) OR E (F (((p45 + 1 <= p5 + p6 + p7 + p8 + p9) OR (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + 1 <= p45)))))
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: (p45 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p45 <= 2)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p15 + p16 + p17 + p18 + p19 <= 2) OR (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + 1 <= p0 + p1 + p2 + p3 + p4)) U A (F ((3 <= p15 + p16 + p17 + p18 + p19)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p15 + p16 + p17 + p18 + p19 <= 2) OR (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + 1 <= p0 + p1 + p2 + p3 + p4)) U A(TRUE U (3 <= p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 270
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 29 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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((3 <= p10 + p11 + p12 + p13 + p14) U TRUE)) AND A ((TRUE U ((p0 + p1 + p2 + p3 + p4 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (p10 + p11 + p12 + p13 + p14 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p0 + p1 + p2 + p3 + p4 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (p10 + p11 + p12 + p13 + p14 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))
lola: processed formula: A (F (((p0 + p1 + p2 + p3 + p4 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (p10 + p11 + p12 + p13 + p14 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))
lola: processed formula length: 370
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 28 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p15 + p16 + p17 + p18 + p19 + 1 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 + p16 + p17 + p18 + p19 + 1 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)
lola: processed formula length: 184
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p15 + p16 + p17 + p18 + p19) OR ((E (X ((3 <= p5 + p6 + p7 + p8 + p9))) OR (p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)) OR ((1 <= p5 + p6 + p7 + p8 + p9) OR A (X ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19))))))
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: (1 <= p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (E (F ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + 1 <= p45)))))
lola: processed formula: A (X (A (G ((p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 + 1 <= p45)))))
lola: processed formula length: 176
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p45) AND A (G (A (X ((2 <= p10 + p11 + p12 + p13 + p14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p45)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p45)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((2 <= p10 + p11 + p12 + p13 + p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((2 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 29 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: 1863 markings, 10395 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45) OR (2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (2 <= p0 + p1 + p2 + p3 + p4) OR (1 <= p0 + p1 + p2 + p3 + p4) OR ((p45... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45) OR (2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) OR (2 <= p0 + p1 + p2 + p3 + p4) OR (1 <= p0 + p1 + p2 + p3 + p4) OR ((p45 <=... (shortened)
lola: processed formula length: 681
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 29 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND A (G ((p45 <= p15 + p16 + p17 + p18 + p19)))) AND ((p45 <= p5 + p6 + p7 + p8 + p9) OR (p5 + p6 + p7 + p8 + p9 + 1 <= p45) OR (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19))) OR E (G (E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 7 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 0 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 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= p45))) AND (p5 + p6 + p7 + p8 + p9 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= p45))) AND (p5 + p6 + p7 + p8 + p9 <= p45))))
lola: processed formula: A (F ((A (G ((2 <= p45))) AND (p5 + p6 + p7 + p8 + p9 <= p45))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= p0 + p1 + p2 + p3 + p4) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45))) AND E (((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) U (p38 + p20 + p21 + p22 + p23 + p37 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p0 + p1 + p2 + p3 + p4) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= p0 + p1 + p2 + p3 + p4) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45)))
lola: processed formula: A (((1 <= p0 + p1 + p2 + p3 + p4) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p45)))
lola: processed formula length: 194
lola: 4 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p10 + p11 + p12 + p13 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44) U (p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p10 + p11 + p12 + p13 + p14))
lola: processed formula length: 342
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14)))
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 8 bytes per marking, with 29 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: 6 markings, 5 edges
lola: state equation: write sara problem file to SharedMemory-COL-000005-CTLCardinality-14.sara
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no yes no yes yes yes no yes no no
FORMULA SharedMemory-COL-000005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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="SharedMemory-COL-000005"
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/SharedMemory-COL-000005.tgz
mv SharedMemory-COL-000005 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 SharedMemory-COL-000005, 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 r179-smll-152708748700003"
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 ;