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)
..............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172200030
=====================================================================

--------------------
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 NeighborGrid-PT-d4n3m2c23-CTLCardinality-0
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-1
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-15
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-2
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-3
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-4
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-5
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-6
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-7
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-8
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496295709851


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


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d4n3m2c23: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ NeighborGrid-PT-d4n3m2c23 @ 3540 seconds
----- 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: 1713/65536 symbol table entries, 509 collisions
lola: preprocessing...
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 81 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: A (X (E (F ((3 <= p_1_1_2_1))))) : NOT(E (G (((1 <= p_1_2_0_1) OR (2 <= p_1_2_2_1) OR (2 <= p_1_2_1_2))))) : E (G (A (G (((1 <= p_1_0_1_0) AND (1 <= p_0_1_0_1)))))) : E (G (((p_2_0_2_1 + 1 <= p_1_2_2_1) OR (p_2_2_1_1 <= 2) OR (p_0_2_1_1 <= 0)))) : NOT(A (F ((p_0_0_2_2 + 1 <= p_1_2_0_0)))) : E (G (A (F ((p_2_2_1_2 + 1 <= p_2_1_1_2))))) : E (G ((((p_0_1_1_0 <= p_1_1_0_0) AND ((3 <= p_2_0_2_0) OR (2 <= p_0_1_2_1))) AND E (X ((1 <= p_1_0_1_1)))))) : E (F (((p_1_0_0_0 <= p_2_2_2_0) AND (p_0_1_2_1 <= 0)))) : (E (G (((1 <= p_2_2_1_0) AND ((2 <= p_0_2_0_1) OR (1 <= p_2_0_1_1))))) AND ((A (F ((3 <= p_1_1_0_2))) AND ((p_0_2_2_2 <= 2) AND (p_2_2_0_2 + 1 <= p_2_1_0_2))) OR ((1 <= p_0_1_0_1) OR (p_2_1_0_0 + 1 <= p_0_1_0_2) OR ((p_2_1_1_1 + 1 <= p_0_0_1_1) AND (p_2_2_0_1 <= 2))))) : ((((p_2_0_0_0 <= 0) AND (p_1_0_0_1 + 1 <= p_1_1_0_0) AND (p_0_1_0_0 <= 0)) OR A (F ((p_0_0_2_1 <= 0)))) OR A (((2 <= p_1_2_1_1) U (p_2_1_1_1 + 1 <= p_2_0_1_0)))) : ((((p_2_1_0_0 <= p_2_0_2_0) OR (p_2_2_0_2 <= p_0_2_2_1)) AND (p_1_2_1_0 <= p_2_1_2_2) AND (2 <= p_1_2_1_0) AND (p_2_2_1_0 <= p_1_2_2_0) AND (p_1_1_2_2 <= p_0_0_1_2) AND ((p_2_2_1_2 <= p_0_1_2_2) OR (p_1_2_2_2 <= p_2_2_0_1)) AND (p_1_1_0_0 + 1 <= p_2_2_0_0)) OR (((((p_1_0_2_0 <= p_0_2_2_2) AND (3 <= p_0_1_2_1)) OR (p_0_1_2_1 <= p_1_0_2_0)) AND A (X ((1 <= p_0_0_0_1)))) AND A (F (((p_2_2_1_0 <= p_2_1_1_2) OR (p_1_1_1_0 <= p_2_2_2_0)))))) : NOT(A (X (A (F ((3 <= p_1_1_1_2)))))) : E (F (NOT(E (X ((p_1_0_0_1 <= p_1_0_1_2)))))) : (E (X (A (G ((p_2_0_2_1 <= p_1_1_0_0))))) OR (3 <= p_1_1_2_2)) : NOT(E (F (E (G ((p_1_1_1_1 <= p_2_0_1_1)))))) : E (G (((p_2_0_0_1 + 1 <= p_0_0_0_0) OR (p_1_1_1_1 <= p_1_2_2_1) OR (2 <= p_2_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 (X (E (F ((3 <= p_1_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= p_1_1_2_1)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 845483 markings, 1358590 edges, 168335 markings/sec, 0 secs
lola: 1589788 markings, 2564572 edges, 148861 markings/sec, 5 secs
lola: 2284835 markings, 3702569 edges, 139009 markings/sec, 10 secs
lola: 3041749 markings, 4939390 edges, 151383 markings/sec, 15 secs
lola: 3790313 markings, 6162121 edges, 149713 markings/sec, 20 secs
lola: 4508953 markings, 7366126 edges, 143728 markings/sec, 25 secs
lola: 5250302 markings, 8611000 edges, 148270 markings/sec, 30 secs
lola: 5957918 markings, 9762613 edges, 141523 markings/sec, 35 secs
lola: 6647848 markings, 10919262 edges, 137986 markings/sec, 40 secs
lola: 7374452 markings, 12146237 edges, 145321 markings/sec, 45 secs
lola: 8070629 markings, 13277088 edges, 139235 markings/sec, 50 secs
lola: 8746479 markings, 14427745 edges, 135170 markings/sec, 55 secs
lola: 9444745 markings, 15583981 edges, 139653 markings/sec, 60 secs
lola: 10132213 markings, 16712953 edges, 137494 markings/sec, 65 secs
lola: 10807623 markings, 17873606 edges, 135082 markings/sec, 70 secs
lola: 11480140 markings, 18980192 edges, 134503 markings/sec, 75 secs
lola: 12134542 markings, 20103656 edges, 130880 markings/sec, 80 secs
lola: 12793353 markings, 21192357 edges, 131762 markings/sec, 85 secs
lola: 13425507 markings, 22283194 edges, 126431 markings/sec, 90 secs
lola: 14053971 markings, 23360639 edges, 125693 markings/sec, 95 secs
lola: 14688491 markings, 24428963 edges, 126904 markings/sec, 100 secs
lola: 15283806 markings, 25471745 edges, 119063 markings/sec, 105 secs
lola: 15865260 markings, 26496597 edges, 116291 markings/sec, 110 secs
lola: 16427777 markings, 27509624 edges, 112503 markings/sec, 115 secs
lola: 16963039 markings, 28513371 edges, 107052 markings/sec, 120 secs
lola: 17439404 markings, 29490896 edges, 95273 markings/sec, 125 secs
lola: 17877112 markings, 30436964 edges, 87542 markings/sec, 130 secs
lola: 18264213 markings, 31341446 edges, 77420 markings/sec, 135 secs
lola: 18644833 markings, 32205831 edges, 76124 markings/sec, 140 secs
lola: 19026911 markings, 33043201 edges, 76416 markings/sec, 145 secs
lola: 19447716 markings, 33941132 edges, 84161 markings/sec, 150 secs
lola: 19825580 markings, 34832750 edges, 75573 markings/sec, 155 secs
lola: 20332153 markings, 35827754 edges, 101315 markings/sec, 160 secs
lola: 21229928 markings, 37205591 edges, 179555 markings/sec, 165 secs
lola: 22067209 markings, 38586951 edges, 167456 markings/sec, 170 secs
lola: 22885059 markings, 39935021 edges, 163570 markings/sec, 175 secs
lola: 23434557 markings, 40858192 edges, 109900 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((1 <= p_1_2_0_1) OR (2 <= p_1_2_2_1) OR (2 <= p_1_2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p_1_2_0_1 <= 0) AND (p_1_2_2_1 <= 1) AND (p_1_2_1_2 <= 1)))
lola: processed formula length: 70
lola: 4 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (((1 <= p_1_0_1_0) AND (1 <= p_0_1_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U ((p_1_0_1_0 <= 0) OR (p_0_1_0_1 <= 0)))))
lola: processed formula length: 64
lola: 4 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_2_0_2_1 + 1 <= p_1_2_2_1) OR (p_2_2_1_1 <= 2) OR (p_0_2_1_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_1_2_2_1 <= p_2_0_2_1) AND (3 <= p_2_2_1_1) AND (1 <= p_0_2_1_1))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((p_0_0_2_2 + 1 <= p_1_2_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_0_0_2_2 + 1 <= p_1_2_0_0)))
lola: processed formula length: 43
lola: 5 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p_2_2_1_2 + 1 <= p_2_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p_2_2_1_2 + 1 <= p_2_1_1_2)))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p_0_1_1_0 <= p_1_1_0_0) AND ((3 <= p_2_0_2_0) OR (2 <= p_0_1_2_1))) AND E (X ((1 <= p_1_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p_1_1_0_0 + 1 <= p_0_1_1_0) OR ((p_2_0_2_0 <= 2) AND (p_0_1_2_1 <= 1))) OR NOT(EX((1 <= p_1_0_1_1))))))
lola: processed formula length: 120
lola: 4 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p_1_0_0_0 <= p_2_2_2_0) AND (p_0_1_2_1 <= 0))))
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 320 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p_2_2_1_0) AND ((2 <= p_0_2_0_1) OR (1 <= p_2_0_1_1))))) AND ((A (F ((3 <= p_1_1_0_2))) AND ((p_0_2_2_2 <= 2) AND (p_2_2_0_2 + 1 <= p_2_1_0_2))) OR ((1 <= p_0_1_0_1) OR (p_2_1_0_0 + 1 <= p_0_1_0_2) OR ((p_2_1_1_1 + 1 <= p_0_0_1_1) AND (p_2_2_0_1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p_2_2_1_0) AND ((2 <= p_0_2_0_1) OR (1 <= p_2_0_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_2_2_1_0 <= 0) OR ((p_0_2_0_1 <= 1) AND (p_2_0_1_1 <= 0)))))
lola: processed formula length: 77
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p_1_1_0_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= p_1_1_0_2))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p_0_1_0_1) OR (p_2_1_0_0 + 1 <= p_0_1_0_2) OR ((p_2_1_1_1 + 1 <= p_0_0_1_1) AND (p_2_2_0_1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p_0_1_0_1) OR (p_2_1_0_0 + 1 <= p_0_1_0_2) OR ((p_2_1_1_1 + 1 <= p_0_0_1_1) AND (p_2_2_0_1 <= 2)))
lola: processed formula length: 107
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p_2_0_0_0 <= 0) AND (p_1_0_0_1 + 1 <= p_1_1_0_0) AND (p_0_1_0_0 <= 0)) OR A (F ((p_0_0_2_1 <= 0)))) OR A (((2 <= p_1_2_1_1) U (p_2_1_1_1 + 1 <= p_2_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_2_0_0_0 <= 0) AND (p_1_0_0_1 + 1 <= p_1_1_0_0) AND (p_0_1_0_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_2_0_0_0 <= 0) AND (p_1_0_0_1 + 1 <= p_1_1_0_0) AND (p_0_1_0_0 <= 0))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_0_0_2_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p_0_0_2_1 <= 0))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 11 will run for 670 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p_1_2_1_1) U (p_2_1_1_1 + 1 <= p_2_0_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= p_1_2_1_1) U (p_2_1_1_1 + 1 <= p_2_0_1_0))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p_2_1_0_0 <= p_2_0_2_0) OR (p_2_2_0_2 <= p_0_2_2_1)) AND (p_1_2_1_0 <= p_2_1_2_2) AND (2 <= p_1_2_1_0) AND (p_2_2_1_0 <= p_1_2_2_0) AND (p_1_1_2_2 <= p_0_0_1_2) AND ((p_2_2_1_2 <= p_0_1_2_2) OR (p_1_2_2_2 <= p_2_2_0_1)) AND (p_1_1_0_0 + 1 <= p_2_2_0_0)) OR (((((p_1_0_2_0 <= p_0_2_2_2) AND (3 <= p_0_1_2_1)) OR (p_0_1_2_1 <= p_1_0_2_0)) AND A (X ((1 <= p_0_0_0_1)))) AND A (F (((p_2_2_1_0 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p_2_1_0_0 <= p_2_0_2_0) OR (p_2_2_0_2 <= p_0_2_2_1)) AND (p_1_2_1_0 <= p_2_1_2_2) AND (2 <= p_1_2_1_0) AND (p_2_2_1_0 <= p_1_2_2_0) AND (p_1_1_2_2 <= p_0_0_1_2) AND ((p_2_2_1_2 <= p_0_1_2_2) OR (p_1_2_2_2 <= p_2_2_0_1)) AND (p_1_1_0_0 + 1 <= p_2_2_0_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p_2_1_0_0 <= p_2_0_2_0) OR (p_2_2_0_2 <= p_0_2_2_1)) AND (p_1_2_1_0 <= p_2_1_2_2) AND (2 <= p_1_2_1_0) AND (p_2_2_1_0 <= p_1_2_2_0) AND (p_1_1_2_2 <= p_0_0_1_2) AND ((p_2_2_1_2 <= p_0_1_2_2) OR (p_1_2_2_2 <= p_2_2_0_1)) AND (p_1_1_0_0 + 1 <= p_2_2_0_0))
lola: processed formula length: 258
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: processed formula with 9 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: ========================================
lola: subprocess 11 will run for 670 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p_1_0_2_0 <= p_0_2_2_2) AND (3 <= p_0_1_2_1)) OR (p_0_1_2_1 <= p_1_0_2_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p_1_0_2_0 <= p_0_2_2_2) AND (3 <= p_0_1_2_1)) OR (p_0_1_2_1 <= p_1_0_2_0))
lola: processed formula length: 78
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-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: ========================================
lola: subprocess 12 will run for 838 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p_0_0_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((1 <= p_0_0_0_1))
lola: processed formula length: 20
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 13 will run for 1118 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p_2_2_1_0 <= p_2_1_1_2) OR (p_1_1_1_0 <= p_2_2_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p_2_2_1_0 <= p_2_1_1_2) OR (p_1_1_1_0 <= p_2_2_2_0)))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: lola: SUBRESULT========================================

lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 11 will run for 670 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (F ((3 <= p_1_1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: EX(NOT(A(TRUE U (3 <= p_1_1_1_2))))
lola: processed formula length: 35
lola: 8 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 12 will run for 838 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (X ((p_1_0_0_1 <= p_1_0_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p_1_0_1_2 + 1 <= p_1_0_0_1)))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 501877 markings, 808590 edges, 100375 markings/sec, 0 secs
lola: 974533 markings, 1556932 edges, 94531 markings/sec, 5 secs
lola: 1431901 markings, 2296423 edges, 91474 markings/sec, 10 secs
lola: 1847470 markings, 2968842 edges, 83114 markings/sec, 15 secs
lola: 2286868 markings, 3706110 edges, 87880 markings/sec, 20 secs
lola: 2744831 markings, 4465485 edges, 91593 markings/sec, 25 secs
lola: 3177588 markings, 5150651 edges, 86551 markings/sec, 30 secs
lola: 3623191 markings, 5886127 edges, 89121 markings/sec, 35 secs
lola: 4075950 markings, 6635273 edges, 90552 markings/sec, 40 secs
lola: 4527147 markings, 7398735 edges, 90239 markings/sec, 45 secs
lola: 4979652 markings, 8164423 edges, 90501 markings/sec, 50 secs
lola: 5427132 markings, 8904391 edges, 89496 markings/sec, 55 secs
lola: 5862493 markings, 9610608 edges, 87072 markings/sec, 60 secs
lola: 6313474 markings, 10352914 edges, 90196 markings/sec, 65 secs
lola: 6736990 markings, 11067538 edges, 84703 markings/sec, 70 secs
lola: 7171834 markings, 11807108 edges, 86969 markings/sec, 75 secs
lola: 7608840 markings, 12524048 edges, 87401 markings/sec, 80 secs
lola: 8047877 markings, 13239849 edges, 87807 markings/sec, 85 secs
lola: 8470599 markings, 13943289 edges, 84544 markings/sec, 90 secs
lola: 8897446 markings, 14686322 edges, 85369 markings/sec, 95 secs
lola: 9340601 markings, 15414887 edges, 88631 markings/sec, 100 secs
lola: 9764059 markings, 16105033 edges, 84692 markings/sec, 105 secs
lola: 10186076 markings, 16810317 edges, 84403 markings/sec, 110 secs
lola: 10612719 markings, 17551825 edges, 85329 markings/sec, 115 secs
lola: 11037241 markings, 18244623 edges, 84904 markings/sec, 120 secs
lola: 11467255 markings, 18958779 edges, 86003 markings/sec, 125 secs
lola: 11871983 markings, 19667699 edges, 80946 markings/sec, 130 secs
lola: 12299671 markings, 20378539 edges, 85538 markings/sec, 135 secs
lola: 12719976 markings, 21071059 edges, 84061 markings/sec, 140 secs
lola: 13120219 markings, 21777510 edges, 80049 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1066 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((p_2_0_2_1 <= p_1_1_0_0))))) OR (3 <= p_1_1_2_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1066 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p_2_0_2_1 <= p_1_1_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (p_1_1_0_0 + 1 <= p_2_0_2_1))))
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: subprocess 14 will run for 1600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p_1_1_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p_1_1_2_2)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 14 will run for 1600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (G ((p_1_1_1_1 <= p_2_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================
checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p_2_0_1_1 + 1 <= p_1_1_1_1)))))
lola: processed formula length: 58
lola: 7 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: subprocess 15 will run for 3200 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_2_0_0_1 + 1 <= p_0_0_0_0) OR (p_1_1_1_1 <= p_1_2_2_1) OR (2 <= p_2_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_0_0_0_0 <= p_2_0_0_1) AND (p_1_2_2_1 + 1 <= p_1_1_1_1) AND (p_2_1_2_2 <= 1))))
lola: processed formula length: 95
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no yes yes no yes yes yes no yes yes unknown no no yes
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496296050637

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is NeighborGrid-PT-d4n3m2c23, 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 r208-smll-149581172200030"
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 ;