fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r106-smll-152658636700115
Last Updated
June 26, 2018

About the Execution of M4M.full for HypercubeGrid-PT-C4K3P3B12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.970 182858.00 185407.00 2018.70 ???????????????? normal

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 3.1M
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K 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.7K 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 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 3.0M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HypercubeGrid-PT-C4K3P3B12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636700115
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526763741207


BK_STOP 1526763924065

--------------------
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 HypercubeGrid-PT-C4K3P3B12 as instance name.
Using HypercubeGrid 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': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 161779, 'Memory': 15942.33, 'Tool': 'lola'}, {'Time': 1784367, 'Memory': 15945.07, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola HypercubeGrid-PT-C4K3P3B12...

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


checking for too many tokens
===========================================================================================
HypercubeGrid-PT-C4K3P3B12: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ HypercubeGrid-PT-C4K3P3B12 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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: 7857/65536 symbol table entries, 1827 collisions
lola: preprocessing...
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6345 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: A (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1)))) : A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2))))) : (E (F (((3 <= pol_d2_n1_1_1_1_3) AND ((2 <= po_d1_n1_1_2_2_2) OR (3 <= pbl_3_1_1_2))))) OR (NOT(A (F ((pil_d3_n1_2_3_3_1 <= po_d4_n1_1_3_2_1)))) AND (A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3))) OR ((pb_d1_n2_2_1_2_1 <= po_d4_n1_3_2_1_1) OR (pil_d4_n1_3_3_3_2 <= pol_d1_n1_1_2_1_3) OR ((3 <= po_d1_n1_1_2_3_2) AND (1 <= pol_d3_n1_1_2_2_2)))))) : E (F (A (X (((3 <= po_d2_n1_2_1_3_3) OR (1 <= pil_d3_n1_2_1_3_2)))))) : A (G (E (F (((3 <= po_d3_n1_3_2_4_1) OR (pb_d3_n1_2_3_2_2 <= pil_d2_n1_3_4_2_2)))))) : (E (((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1)))) AND E (F (E (G ((1 <= pil_d4_n1_2_2_3_2)))))) : NOT(E (G (A (F ((1 <= pi_d1_n1_2_3_1_2)))))) : A (X (E (F (((2 <= pi_d2_n1_1_1_1_1) OR (pol_d1_n1_2_3_3_2 <= pi_d1_n1_2_3_2_3)))))) : NOT(A (F (((pb_d3_n1_1_1_1_2 <= po_d4_n1_3_1_2_3) AND (1 <= pb_d2_n2_1_3_3_1) AND ((pol_d4_n1_2_2_2_2 <= pi_d2_n1_2_2_1_2) OR (1 <= po_d4_n1_1_2_2_1)))))) : (((E (G ((pb_d2_n2_3_3_1_1 <= pil_d4_n1_3_2_2_2))) AND A (X ((pil_d1_n1_1_1_1_3 <= po_d2_n1_2_2_3_1)))) OR ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))) AND (((3 <= pil_d2_n1_2_1_3_2) OR A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))) OR A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3))))) : E (((((1 <= pil_d3_n1_3_1_4_3) OR (2 <= po_d4_n1_3_3_1_1)) AND (1 <= pil_d3_n1_1_3_2_3)) U ((pb_d3_n2_3_1_3_3 <= 0) OR (pb_d2_n1_2_3_1_1 <= 0)))) : E (G ((1 <= pil_d1_n1_4_2_1_1))) : E (F ((3 <= pol_d2_n1_3_3_2_1))) : A ((E (F ((3 <= pol_d2_n1_3_3_1_3))) U E (G ((pi_d2_n1_2_4_2_2 <= pi_d3_n1_1_1_3_2))))) : E (G ((((pil_d2_n1_3_1_2_3 <= 2) AND (pi_d3_n1_3_1_3_2 <= 0)) OR ((pol_d2_n1_3_2_3_2 <= 1) AND (pb_d2_n2_1_3_3_1 <= 1))))) : (A (F (A (F ((1 <= pi_d1_n1_1_1_2_2))))) OR A (F ((2 <= pil_d4_n1_1_1_2_2))))
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 (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1))))
lola: processed formula: A (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1))))
lola: processed formula length: 166
lola: 0 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1079 markings, 1079 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2)))))
lola: processed formula: A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2)))))
lola: processed formula length: 139
lola: 0 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1080 markings, 1080 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= pol_d2_n1_1_1_1_3) AND ((2 <= po_d1_n1_1_2_2_2) OR (3 <= pbl_3_1_1_2))))) OR (NOT(A (F ((pil_d3_n1_2_3_3_1 <= po_d4_n1_1_3_2_1)))) AND (A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3))) OR ((pb_d1_n2_2_1_2_1 <= po_d4_n1_3_2_1_1) OR (pil_d4_n1_3_3_3_2 <= pol_d1_n1_1_2_1_3) OR ((3 <= po_d1_n1_1_2_3_2) AND (1 <= pol_d3_n1_1_2_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pol_d2_n1_1_1_1_3) AND ((2 <= po_d1_n1_1_2_2_2) OR (3 <= pbl_3_1_1_2)))))
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 6044 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-CTLCardinality-2.sara.
lola: sara is running 0 secs || 152536 markings, 160659 edges, 30507 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((po_d4_n1_1_3_2_1 + 1 <= pil_d3_n1_2_3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil_d3_n1_2_3_3_1 <= po_d4_n1_1_3_2_1)))
lola: processed formula length: 54
lola: 5 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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 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: 2485 markings, 2485 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3)))
lola: processed formula: A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3)))
lola: processed formula length: 46
lola: 3 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 649 markings, 648 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((3 <= po_d2_n1_2_1_3_3) OR (1 <= pil_d3_n1_2_1_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((3 <= po_d2_n1_2_1_3_3) OR (1 <= pil_d3_n1_2_1_3_2))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 21303 markings, 22546 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= po_d3_n1_3_2_4_1) OR (pb_d3_n1_2_3_2_2 <= pil_d2_n1_3_4_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((3 <= po_d3_n1_3_2_4_1) OR (pb_d3_n1_2_3_2_2 <= pil_d2_n1_3_4_2_2))))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 309676 markings, 387805 edges, 2963413634786525184 markings/sec, 0 secs
lola: 636245 markings, 797407 edges, 65314 markings/sec, 5 secs
lola: 968501 markings, 1217543 edges, 66451 markings/sec, 10 secs
lola: 1297711 markings, 1659061 edges, 65842 markings/sec, 15 secs
lola: 1637767 markings, 2113234 edges, 68011 markings/sec, 20 secs
lola: 1974841 markings, 2573941 edges, 67415 markings/sec, 25 secs
lola: 2334803 markings, 3060775 edges, 71992 markings/sec, 30 secs
lola: 2712298 markings, 3570141 edges, 75499 markings/sec, 35 secs
lola: 3123442 markings, 4098029 edges, 82229 markings/sec, 40 secs
lola: 3523935 markings, 4620284 edges, 80099 markings/sec, 45 secs
lola: 3928612 markings, 5147720 edges, 80935 markings/sec, 50 secs
lola: 4329136 markings, 5669667 edges, 80105 markings/sec, 55 secs
lola: 4723223 markings, 6183147 edges, 78817 markings/sec, 60 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1)))) AND E (F (E (G ((1 <= pil_d4_n1_2_2_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1)))
lola: processed formula length: 133
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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 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: subprocess 6 will run for 345 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= pil_d4_n1_2_2_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (pil_d4_n1_2_2_3_2 <= 0))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 2494 markings, 2495 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((1 <= pi_d1_n1_2_3_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= pi_d1_n1_2_3_1_2))))
lola: processed formula length: 48
lola: 8 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 2483 markings, 2484 edges
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((2 <= pi_d2_n1_1_1_1_1) OR (pol_d1_n1_2_3_3_2 <= pi_d1_n1_2_3_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U ((2 <= pi_d2_n1_1_1_1_1) OR (pol_d1_n1_2_3_3_2 <= pi_d1_n1_2_3_2_3))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 229375 markings, 229523 edges, 2963413634786525184 markings/sec, 0 secs
lola: 396054 markings, 396203 edges, 33336 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 434527 markings, 434675 edges
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((pb_d3_n1_1_1_1_2 <= po_d4_n1_3_1_2_3) AND (1 <= pb_d2_n2_1_3_3_1) AND ((pol_d4_n1_2_2_2_2 <= pi_d2_n1_2_2_1_2) OR (1 <= po_d4_n1_1_2_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pb_d3_n1_1_1_1_2 <= po_d4_n1_3_1_2_3) AND (1 <= pb_d2_n2_1_3_3_1) AND ((pol_d4_n1_2_2_2_2 <= pi_d2_n1_2_2_1_2) OR (1 <= po_d4_n1_1_2_2_1)))))
lola: processed formula length: 157
lola: 5 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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 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: 2483 markings, 2483 edges
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((pb_d2_n2_3_3_1_1 <= pil_d4_n1_3_2_2_2))) AND A (X ((pil_d1_n1_1_1_1_3 <= po_d2_n1_2_2_3_1)))) OR ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))) AND (((3 <= pil_d2_n1_2_1_3_2) OR A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))) OR A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb_d2_n2_3_3_1_1 <= pil_d4_n1_3_2_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil_d4_n1_3_2_2_2 + 1 <= pb_d2_n2_3_3_1_1)))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 574 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))
lola: processed formula length: 84
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 689 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= pil_d2_n1_2_1_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pil_d2_n1_2_1_3_2)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-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 12 will run for 861 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))
lola: processed formula: A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 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: 6551 markings, 6551 edges
lola: ========================================
lola: subprocess 13 will run for 1148 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))
lola: processed formula: A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 bytes per marking, with 30 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: 1085 markings, 1085 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 574 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= pil_d3_n1_3_1_4_3) OR (2 <= po_d4_n1_3_3_1_1)) AND (1 <= pil_d3_n1_1_3_2_3)) U ((pb_d3_n2_3_1_3_3 <= 0) OR (pb_d2_n1_2_3_1_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((1 <= pil_d3_n1_3_1_4_3) OR (2 <= po_d4_n1_3_3_1_1)) AND (1 <= pil_d3_n1_1_3_2_3)) U ((pb_d3_n2_3_1_3_3 <= 0) OR (pb_d2_n1_2_3_1_1 <= 0)))
lola: processed formula length: 144
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 309946 markings, 390007 edges, 2963413634786525184 markings/sec, 0 secs
lola: 621261 markings, 782438 edges, 62263 markings/sec, 5 secs
lola: 929269 markings, 1176323 edges, 61602 markings/sec, 10 secs
lola: 1273120 markings, 1617359 edges, 68770 markings/sec, 15 secs
lola: 1669668 markings, 2120040 edges, 79310 markings/sec, 20 secs
lola: 2063241 markings, 2622193 edges, 78715 markings/sec, 25 secs
lola: 2460957 markings, 3129253 edges, 79543 markings/sec, 30 secs
lola: 2850300 markings, 3624739 edges, 77869 markings/sec, 35 secs
lola: 3230756 markings, 4111014 edges, 76091 markings/sec, 40 secs
lola: 3614971 markings, 4599434 edges, 76843 markings/sec, 45 secs
lola: 4024205 markings, 5120203 edges, 81847 markings/sec, 50 secs
lola: 4446899 markings, 5659480 edges, 84539 markings/sec, 55 secs
lola: 4867274 markings, 6195032 edges, 84075 markings/sec, 60 secs
lola: 5277883 markings, 6718004 edges, 82122 markings/sec, 65 secs
lola: 5497251 markings, 6997234 edges, 43874 markings/sec, 70 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: '
'
Aborted (core dumped)
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="HypercubeGrid-PT-C4K3P3B12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/HypercubeGrid-PT-C4K3P3B12.tgz
mv HypercubeGrid-PT-C4K3P3B12 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is HypercubeGrid-PT-C4K3P3B12, 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 r106-smll-152658636700115"
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 ;