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 700K
-rw-r--r-- 1 mcc users 4.3K 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.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 522K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is HypertorusGrid-PT-d3k3p2b06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-smll-152658633600150
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526729994901


BK_STOP 1526730003647

--------------------
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 HypertorusGrid-PT-d3k3p2b06 as instance name.
Using HypertorusGrid 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': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 848956, 'Memory': 15951.05, 'Tool': 'lola'}, {'Time': 908800, 'Memory': 15949.08, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola HypertorusGrid-PT-d3k3p2b06...

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


checking for too many tokens
===========================================================================================
HypertorusGrid-PT-d3k3p2b06: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ HypertorusGrid-PT-d3k3p2b06 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- 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: 1485/65536 symbol table entries, 20 collisions
lola: preprocessing...
lola: finding significant places
lola: 513 places, 972 transitions, 323 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1161 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: (E (F (E (F ((2 <= po_d2_n1_1_3_1))))) OR NOT(A (F ((pi_d2_n1_1_2_1 <= 1))))) : A (F ((((pil_d1_n1_1_3_2 <= 0) OR (pbl_1_2_1 + 1 <= pb_d1_n2_3_2_3)) AND ((pil_d1_n1_1_2_3 <= pol_d3_n1_3_1_1) OR ((2 <= pi_d1_n1_3_1_3) AND (2 <= pil_d2_n1_3_3_3)))))) : NOT(A (X (E (X ((pil_d3_n1_3_3_3 <= pil_d3_n1_1_2_1)))))) : E (X (A (((1 <= pbl_1_2_1) U (2 <= pil_d1_n1_1_2_2))))) : ((A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2))) AND A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1)))) AND (pbl_2_3_1 <= pbl_1_2_1)) : ((po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2) AND (E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3))) AND (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2) OR ((2 <= pil_d3_n1_3_2_3) AND (2 <= pb_d2_n1_1_2_2))) AND (pi_d2_n1_1_1_1 <= 2)))) : E (F (((pil_d1_n1_1_1_3 <= 1) AND (pb_d3_n2_2_3_3 <= 0) AND ((pol_d1_n1_3_1_3 <= 0) OR (pb_d1_n2_2_2_2 + 1 <= pi_d3_n1_2_3_1))))) : A (F ((pb_d2_n1_2_1_3 <= pil_d3_n1_1_2_1))) : E (F ((pb_d2_n2_3_1_2 <= po_d3_n1_3_1_3))) : E (G (E (G ((pil_d2_n1_1_2_2 <= pil_d2_n1_2_1_1))))) : NOT(A (((pi_d3_n1_3_2_1 <= 1) U ((2 <= pil_d2_n1_2_3_2) OR (2 <= pi_d1_n1_2_3_1))))) : A (((pb_d1_n2_2_2_3 <= pbl_2_2_3) U A (F ((1 <= pi_d2_n1_2_3_2))))) : (NOT((E (F ((2 <= pol_d3_n1_2_1_2))) OR ((pi_d1_n1_1_1_3 <= 1) AND ((3 <= pb_d1_n1_1_2_3) OR (2 <= pi_d3_n1_2_3_3))))) AND A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2))))) : ((E (X ((1 <= pb_d2_n1_1_3_2))) AND (E (G ((2 <= pil_d1_n1_3_2_2))) OR E (F ((2 <= pi_d2_n1_3_3_3))))) OR A (X (A (G ((pil_d1_n1_2_3_2 <= pil_d1_n1_2_1_3)))))) : E (G (A (((3 <= pol_d3_n1_1_2_1) U (po_d2_n1_3_2_2 <= pbl_1_1_2))))) : E (F (((pil_d2_n1_2_1_3 + 1 <= pi_d1_n1_2_3_2) AND (po_d2_n1_3_3_2 + 1 <= pi_d3_n1_2_3_3) AND (pb_d1_n1_3_2_1 <= pb_d1_n1_2_1_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: (E (F (E (F ((2 <= po_d2_n1_1_3_1))))) OR NOT(A (F ((pi_d2_n1_1_2_1 <= 1)))))
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: E (F ((2 <= po_d2_n1_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.sara.
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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= pi_d2_n1_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pi_d2_n1_1_2_1 <= 1)))
lola: processed formula length: 36
lola: 6 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((pil_d1_n1_1_3_2 <= 0) OR (pbl_1_2_1 + 1 <= pb_d1_n2_3_2_3)) AND ((pil_d1_n1_1_2_3 <= pol_d3_n1_3_1_1) OR ((2 <= pi_d1_n1_3_1_3) AND (2 <= pil_d2_n1_3_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((pil_d1_n1_1_3_2 <= 0) OR (pbl_1_2_1 + 1 <= pb_d1_n2_3_2_3)) AND ((pil_d1_n1_1_2_3 <= pol_d3_n1_3_1_1) OR ((2 <= pi_d1_n1_3_1_3) AND (2 <= pil_d2_n1_3_3_3))))))
lola: processed formula: A (F ((((pil_d1_n1_1_3_2 <= 0) OR (pbl_1_2_1 + 1 <= pb_d1_n2_3_2_3)) AND ((pil_d1_n1_1_2_3 <= pol_d3_n1_3_1_1) OR ((2 <= pi_d1_n1_3_1_3) AND (2 <= pil_d2_n1_3_3_3))))))
lola: processed formula length: 170
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 359 markings, 359 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (X ((pil_d3_n1_3_3_3 <= pil_d3_n1_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((pil_d3_n1_1_2_1 + 1 <= pil_d3_n1_3_3_3)))
lola: processed formula length: 48
lola: 7 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((1 <= pbl_1_2_1) U (2 <= pil_d1_n1_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((1 <= pbl_1_2_1) U (2 <= pil_d1_n1_1_2_2)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 38911 markings, 39072 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2))) AND A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1)))) AND (pbl_2_3_1 <= pbl_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2)))
lola: processed formula: A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2)))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1)))
lola: processed formula: A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1)))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 402 markings, 402 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2) AND (E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3))) AND (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2) OR ((2 <= pil_d3_n1_3_2_3) AND (2 <= pb_d2_n1_1_2_2))) AND (pi_d2_n1_1_1_1 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2)
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil_d2_n1_1_2_3 <= po_d2_n1_1_2_1)))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 269 markings, 269 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2) OR ((2 <= pil_d3_n1_3_2_3) AND (2 <= pb_d2_n1_1_2_2))) AND (pi_d2_n1_1_1_1 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2) OR ((2 <= pil_d3_n1_3_2_3) AND (2 <= pb_d2_n1_1_2_2))) AND (pi_d2_n1_1_1_1 <= 2))
lola: processed formula length: 160
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: processed formula with 5 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d1_n1_1_1_3 <= 1) AND (pb_d3_n2_2_3_3 <= 0) AND ((pol_d1_n1_3_1_3 <= 0) OR (pb_d1_n2_2_2_2 + 1 <= pi_d3_n1_2_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: A (F ((pb_d2_n1_2_1_3 <= pil_d3_n1_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pb_d2_n1_2_1_3 <= pil_d3_n1_1_2_1)))
lola: processed formula: A (F ((pb_d2_n1_2_1_3 <= pil_d3_n1_1_2_1)))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 403 markings, 403 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d2_n2_3_1_2 <= po_d3_n1_3_1_3)))
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 1292 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((pil_d2_n1_1_2_2 <= pil_d2_n1_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (pil_d2_n1_2_1_1 + 1 <= pil_d2_n1_1_2_2))))
lola: processed formula length: 65
lola: 4 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 273 markings, 819 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((pi_d3_n1_3_2_1 <= 1) U ((2 <= pil_d2_n1_2_3_2) OR (2 <= pi_d1_n1_2_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((pi_d3_n1_3_2_1 <= 1) U ((2 <= pil_d2_n1_2_3_2) OR (2 <= pi_d1_n1_2_3_1))))
lola: processed formula length: 82
lola: 7 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: 268 markings, 268 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pb_d1_n2_2_2_3 <= pbl_2_2_3) U A (F ((1 <= pi_d2_n1_2_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((pb_d1_n2_2_2_3 <= pbl_2_2_3) U A(TRUE U (1 <= pi_d2_n1_2_3_2)))
lola: processed formula length: 66
lola: 2 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 258 markings, 774 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((2 <= pol_d3_n1_2_1_2))) OR ((pi_d1_n1_1_1_3 <= 1) AND ((3 <= pb_d1_n1_1_2_3) OR (2 <= pi_d3_n1_2_3_3))))) AND A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pol_d3_n1_2_1_2 <= 1)))
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 1292 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d3k3p2b06-CTLCardinality-12.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: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= pi_d1_n1_1_1_3) OR ((pb_d1_n1_1_2_3 <= 2) AND (pi_d3_n1_2_3_3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= pi_d1_n1_1_1_3) OR ((pb_d1_n1_1_2_3 <= 2) AND (pi_d3_n1_2_3_3 <= 1)))
lola: processed formula length: 77
lola: 6 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2))))
lola: processed formula: A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2))))
lola: processed formula length: 94
lola: 6 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1296 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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (X ((1 <= pb_d2_n1_1_3_2))) AND (E (G ((2 <= pil_d1_n1_3_2_2))) OR E (F ((2 <= pi_d2_n1_3_3_3))))) OR A (X (A (G ((pil_d1_n1_2_3_2 <= pil_d1_n1_2_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= pb_d2_n1_1_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= pb_d2_n1_1_3_2))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= pil_d1_n1_3_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil_d1_n1_3_2_2 <= 1)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 513 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1292 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 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pi_d2_n1_3_3_3)))
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 1292 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d3k3p2b06-CTLCardinality-15.sara.
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: 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: '
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 HypertorusGrid-PT-d3k3p2b06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypertorusGrid-PT-d3k3p2b06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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/HypertorusGrid-PT-d3k3p2b06.tgz
mv HypertorusGrid-PT-d3k3p2b06 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is HypertorusGrid-PT-d3k3p2b06, 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 r103-smll-152658633600150"
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 ;