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-3253
Executing tool lola
Input is S_SquareGrid-PT-100510, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464000147
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496563273574


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


checking for too many tokens
===========================================================================================
S_SquareGrid-PT-100510: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SquareGrid-PT-100510 @ 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: 3020/65536 symbol table entries, 416 collisions
lola: preprocessing...
lola: finding significant places
lola: 1380 places, 1640 transitions, 839 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2180 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-100510-CTLCardinality.task
lola: E (X (E (G ((p1ol_8_1 + 1 <= pb1_2_10))))) : A (F (((2 <= p4i_7_8) OR (p1il_11_7 <= 0) OR (2 <= p4ol_5_10)))) : (A (G ((p4i_7_4 <= pbl_9_7))) AND E (X (((3 <= pb3_2_3) AND (p4il_8_3 <= 0))))) : A (F (E (G (((pb3_5_5 <= p4o_8_3) AND (2 <= pb3_6_1)))))) : E (G ((A (F ((p1ol_5_5 <= pb4_3_9))) OR (3 <= p4i_9_10)))) : NOT(E (G (A (F ((pb4_3_7 <= p4il_1_11)))))) : NOT(E (F (((p4ol_1_2 <= pbl_10_4) AND (2 <= p4o_1_4) AND (p4i_4_4 <= p1i_9_4))))) : (A (G (((p1i_2_5 <= p1o_4_3) AND (p1il_11_2 <= pb3_5_10) AND ((3 <= p4il_4_9) OR (p1o_11_1 <= pb2_3_2))))) OR A (F ((2 <= p4ol_4_5)))) : NOT(NOT((E (F ((2 <= p1ol_5_7))) AND ((2 <= pb4_2_4) OR (p1ol_8_6 <= p1ol_7_1) OR (p4ol_10_11 <= p4il_4_7))))) : E (G (NOT(E (G ((2 <= pbl_1_8)))))) : E (G (((p4il_5_10 <= pbl_1_3) OR A (F ((1 <= p4ol_3_10)))))) : E (F (E (X ((pb3_3_8 <= 0))))) : (E (((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1))) AND A (F (((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10)))))) : ((p4il_4_5 <= pbl_9_10) AND E (X (A (F ((pb3_6_7 <= p4il_9_7)))))) : (NOT(E (G ((2 <= pb1_10_3)))) AND ((((p1ol_3_1 + 1 <= pb2_3_10) AND (3 <= p1i_3_4)) OR ((1 <= p4ol_2_4) AND (1 <= pbl_4_9) AND (p1il_4_8 <= p1il_6_7) AND (p4ol_1_9 <= pb4_10_3))) OR (((1 <= p1il_10_8) OR (pb4_6_10 <= 0)) OR A (X ((1 <= pb2_10_3)))))) : E ((((p4ol_6_11 <= 0) AND (pb1_2_7 + 1 <= p4il_7_7)) U E (G ((p1il_7_6 <= p1il_7_5)))))
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 (X (E (G ((p1ol_8_1 + 1 <= pb1_2_10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (pb1_2_10 <= p1ol_8_1))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p4i_7_8) OR (p1il_11_7 <= 0) OR (2 <= p4ol_5_10))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= p4i_7_8) OR (p1il_11_7 <= 0) OR (2 <= p4ol_5_10)))
lola: processed formula length: 68
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p4i_7_4 <= pbl_9_7))) AND E (X (((3 <= pb3_2_3) AND (p4il_8_3 <= 0)))))
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: A (G ((p4i_7_4 <= pbl_9_7)))
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 3356 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((pb3_5_5 <= p4o_8_3) AND (2 <= pb3_6_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p4o_8_3 + 1 <= pb3_5_5) OR (pb3_6_1 <= 1)))))
lola: processed formula length: 70
lola: 3 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p1ol_5_5 <= pb4_3_9))) OR (3 <= p4i_9_10))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (p1ol_5_5 <= pb4_3_9))) AND (p4i_9_10 <= 2))))
lola: processed formula length: 73
lola: 4 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((pb4_3_7 <= p4il_1_11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pb4_3_7 <= p4il_1_11))))
lola: processed formula length: 47
lola: 8 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((p4ol_1_2 <= pbl_10_4) AND (2 <= p4o_1_4) AND (p4i_4_4 <= p1i_9_4)))))
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 3356 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-100510-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-100510-CTLCardinality-6.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p1i_2_5 <= p1o_4_3) AND (p1il_11_2 <= pb3_5_10) AND ((3 <= p4il_4_9) OR (p1o_11_1 <= pb2_3_2))))) OR A (F ((2 <= p4ol_4_5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1i_2_5 <= p1o_4_3) AND (p1il_11_2 <= pb3_5_10) AND ((3 <= p4il_4_9) OR (p1o_11_1 <= pb2_3_2)))))
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 3356 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 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to SquareGrid-PT-100510-CTLCardinality-7.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p4ol_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p4ol_4_5))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (F ((2 <= p1ol_5_7))) AND ((2 <= pb4_2_4) OR (p1ol_8_6 <= p1ol_7_1) OR (p4ol_10_11 <= p4il_4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1ol_5_7)))
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 3356 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 SquareGrid-PT-100510-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-100510-CTLCardinality-8.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((2 <= pbl_1_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (pbl_1_8 <= 1)))))
lola: processed formula length: 44
lola: 5 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p4il_5_10 <= pbl_1_3) OR A (F ((1 <= p4ol_3_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pbl_1_3 + 1 <= p4il_5_10) AND NOT(A(TRUE U (1 <= p4ol_3_10))))))
lola: processed formula length: 79
lola: 4 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((pb3_3_8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((pb3_3_8 <= 0)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1))) AND A (F (((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p4il_8_7 <= pb1_10_6) U (pb3_3_7 <= p1ol_4_1))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: 232811 markings, 539600 edges, 46562 markings/sec, 0 secs
lola: 426919 markings, 1049829 edges, 38822 markings/sec, 5 secs
lola: 590477 markings, 1535594 edges, 32712 markings/sec, 10 secs
lola: 735720 markings, 1974657 edges, 29049 markings/sec, 15 secs
lola: 880153 markings, 2396483 edges, 28887 markings/sec, 20 secs
lola: 1048902 markings, 2817521 edges, 33750 markings/sec, 25 secs
lola: 1199405 markings, 3248230 edges, 30101 markings/sec, 30 secs
lola: 1353427 markings, 3665517 edges, 30804 markings/sec, 35 secs
lola: 1512446 markings, 4080320 edges, 31804 markings/sec, 40 secs
lola: 1641656 markings, 4454903 edges, 25842 markings/sec, 45 secs
lola: 1785662 markings, 4840931 edges, 28801 markings/sec, 50 secs
lola: 1998697 markings, 5233475 edges, 42607 markings/sec, 55 secs
lola: 2197963 markings, 5613699 edges, 39853 markings/sec, 60 secs
lola: 2386549 markings, 5982080 edges, 37717 markings/sec, 65 secs
lola: 2570045 markings, 6346205 edges, 36699 markings/sec, 70 secs
lola: 2748527 markings, 6705328 edges, 35696 markings/sec, 75 secs
lola: 2924477 markings, 7062467 edges, 35190 markings/sec, 80 secs
lola: 3098817 markings, 7423105 edges, 34868 markings/sec, 85 secs
lola: 3270012 markings, 7780952 edges, 34239 markings/sec, 90 secs
lola: 3437945 markings, 8140244 edges, 33587 markings/sec, 95 secs
lola: 3600549 markings, 8522199 edges, 32521 markings/sec, 100 secs
lola: 3704546 markings, 8858988 edges, 20799 markings/sec, 105 secs
lola: 3763902 markings, 9146938 edges, 11871 markings/sec, 110 secs
lola: 3817253 markings, 9430831 edges, 10670 markings/sec, 115 secs
lola: 3868164 markings, 9711306 edges, 10182 markings/sec, 120 secs
lola: 3916836 markings, 9989376 edges, 9734 markings/sec, 125 secs
lola: 3965576 markings, 10269515 edges, 9748 markings/sec, 130 secs
lola: 4012440 markings, 10550053 edges, 9373 markings/sec, 135 secs
lola: 4059252 markings, 10831405 edges, 9362 markings/sec, 140 secs
lola: 4107164 markings, 11116511 edges, 9582 markings/sec, 145 secs
lola: 4153101 markings, 11404642 edges, 9187 markings/sec, 150 secs
lola: 4197911 markings, 11699180 edges, 8962 markings/sec, 155 secs
lola: 4288081 markings, 12054743 edges, 18034 markings/sec, 160 secs
lola: 4484156 markings, 12534825 edges, 39215 markings/sec, 165 secs
lola: 4651396 markings, 13004932 edges, 33448 markings/sec, 170 secs
lola: 4799858 markings, 13453409 edges, 29692 markings/sec, 175 secs
lola: 4937269 markings, 13868561 edges, 27482 markings/sec, 180 secs
lola: 5089823 markings, 14282201 edges, 30511 markings/sec, 185 secs
lola: 5255453 markings, 14689577 edges, 33126 markings/sec, 190 secs
lola: 5395126 markings, 15113498 edges, 27935 markings/sec, 195 secs
lola: 5546306 markings, 15503127 edges, 30236 markings/sec, 200 secs
lola: 5694599 markings, 15896641 edges, 29659 markings/sec, 205 secs
lola: 5814199 markings, 16263774 edges, 23920 markings/sec, 210 secs
lola: 5963470 markings, 16640246 edges, 29854 markings/sec, 215 secs
lola: 6170801 markings, 17022804 edges, 41466 markings/sec, 220 secs
lola: 6364095 markings, 17391796 edges, 38659 markings/sec, 225 secs
lola: 6547526 markings, 17749937 edges, 36686 markings/sec, 230 secs
lola: 6725986 markings, 18103736 edges, 35692 markings/sec, 235 secs
lola: 6899983 markings, 18452926 edges, 34799 markings/sec, 240 secs
lola: 7070277 markings, 18798957 edges, 34059 markings/sec, 245 secs
lola: 7236396 markings, 19142020 edges, 33224 markings/sec, 250 secs
lola: 7400085 markings, 19482693 edges, 32738 markings/sec, 255 secs
lola: 7560772 markings, 19824246 edges, 32137 markings/sec, 260 secs
lola: 7720426 markings, 20188440 edges, 31931 markings/sec, 265 secs
lola: 7848481 markings, 20539332 edges, 25611 markings/sec, 270 secs
lola: 7910110 markings, 20824681 edges, 12326 markings/sec, 275 secs
lola: 7963944 markings, 21100239 edges, 10767 markings/sec, 280 secs
lola: 8013316 markings, 21371947 edges, 9874 markings/sec, 285 secs
lola: 8061853 markings, 21642928 edges, 9707 markings/sec, 290 secs
lola: 8110016 markings, 21913558 edges, 9633 markings/sec, 295 secs
lola: 8155031 markings, 22184624 edges, 9003 markings/sec, 300 secs
lola: 8201148 markings, 22456894 edges, 9223 markings/sec, 305 secs
lola: 8246699 markings, 22731633 edges, 9110 markings/sec, 310 secs
lola: 8292047 markings, 23008542 edges, 9070 markings/sec, 315 secs
lola: 8336564 markings, 23289144 edges, 8903 markings/sec, 320 secs
lola: 8378428 markings, 23576063 edges, 8373 markings/sec, 325 secs
lola: 8472034 markings, 23865141 edges, 18721 markings/sec, 330 secs
lola: 8624348 markings, 24236579 edges, 30463 markings/sec, 335 secs
lola: 8764126 markings, 24633898 edges, 27956 markings/sec, 340 secs
lola: 8885653 markings, 25011377 edges, 24305 markings/sec, 345 secs
lola: 9012474 markings, 25379711 edges, 25364 markings/sec, 350 secs
lola: 9118884 markings, 25709382 edges, 21282 markings/sec, 355 secs
lola: 9234126 markings, 26003317 edges, 23048 markings/sec, 360 secs
lola: 9338103 markings, 26279426 edges, 20795 markings/sec, 365 secs
lola: 9454226 markings, 26575712 edges, 23225 markings/sec, 370 secs
lola: 9553020 markings, 26877312 edges, 19759 markings/sec, 375 secs
lola: 9663032 markings, 27160445 edges, 22002 markings/sec, 380 secs
lola: 9771244 markings, 27442325 edges, 21642 markings/sec, 385 secs
lola: 9871548 markings, 27712003 edges, 20061 markings/sec, 390 secs
lola: 9955555 markings, 28013606 edges, 16801 markings/sec, 395 secs
lola: 10079880 markings, 28297119 edges, 24865 markings/sec, 400 secs
lola: 10241091 markings, 28593591 edges, 32242 markings/sec, 405 secs
lola: 10394524 markings, 28882807 edges, 30687 markings/sec, 410 secs
lola: 10541745 markings, 29167527 edges, 29444 markings/sec, 415 secs
lola: 10685993 markings, 29450277 edges, 28850 markings/sec, 420 secs
lola: 10828354 markings, 29732382 edges, 28472 markings/sec, 425 secs
lola: 10969497 markings, 30014315 edges, 28229 markings/sec, 430 secs
lola: 11108233 markings, 30296147 edges, 27747 markings/sec, 435 secs
lola: 11247291 markings, 30580192 edges, 27812 markings/sec, 440 secs
lola: 11385331 markings, 30865624 edges, 27608 markings/sec, 445 secs
lola: 11523141 markings, 31153008 edges, 27562 markings/sec, 450 secs
lola: 11661025 markings, 31445441 edges, 27577 markings/sec, 455 secs
lola: 11802455 markings, 31759034 edges, 28286 markings/sec, 460 secs
lola: 11934585 markings, 32092641 edges, 26426 markings/sec, 465 secs
lola: 12006289 markings, 32374685 edges, 14341 markings/sec, 470 secs
lola: 12058864 markings, 32635854 edges, 10515 markings/sec, 475 secs
lola: 12106879 markings, 32895920 edges, 9603 markings/sec, 480 secs
lola: 12154046 markings, 33154026 edges, 9433 markings/sec, 485 secs
lola: 12198878 markings, 33411293 edges, 8966 markings/sec, 490 secs
lola: 12245055 markings, 33671826 edges, 9235 markings/sec, 495 secs
lola: 12288694 markings, 33932492 edges, 8728 markings/sec, 500 secs
lola: 12332037 markings, 34194379 edges, 8669 markings/sec, 505 secs
lola: 12376419 markings, 34459220 edges, 8876 markings/sec, 510 secs
lola: 12419810 markings, 34727619 edges, 8678 markings/sec, 515 secs
lola: 12463063 markings, 35001236 edges, 8651 markings/sec, 520 secs
lola: 12503470 markings, 35284046 edges, 8081 markings/sec, 525 secs
lola: 12627361 markings, 35623439 edges, 24778 markings/sec, 530 secs
lola: 12771914 markings, 36003636 edges, 28911 markings/sec, 535 secs
lola: 12911584 markings, 36394234 edges, 27934 markings/sec, 540 secs
lola: 13032654 markings, 36770321 edges, 24214 markings/sec, 545 secs
lola: 13141990 markings, 37118944 edges, 21867 markings/sec, 550 secs
lola: 13262393 markings, 37439752 edges, 24081 markings/sec, 555 secs
lola: 13383060 markings, 37746304 edges, 24133 markings/sec, 560 secs
lola: 13500668 markings, 38055229 edges, 23522 markings/sec, 565 secs
lola: 13605778 markings, 38384742 edges, 21022 markings/sec, 570 secs
lola: 13721567 markings, 38681128 edges, 23158 markings/sec, 575 secs
lola: 13837274 markings, 38976577 edges, 23141 markings/sec, 580 secs
lola: 13943397 markings, 39258049 edges, 21225 markings/sec, 585 secs
lola: 14031148 markings, 39565485 edges, 17550 markings/sec, 590 secs
lola: 14163138 markings, 39862860 edges, 26398 markings/sec, 595 secs
lola: 14328080 markings, 40166318 edges, 32988 markings/sec, 600 secs
lola: 14484243 markings, 40462005 edges, 31233 markings/sec, 605 secs
lola: 14635174 markings, 40754481 edges, 30186 markings/sec, 610 secs
lola: 14782044 markings, 41043237 edges, 29374 markings/sec, 615 secs
lola: 14927112 markings, 41331058 edges, 29014 markings/sec, 620 secs
lola: 15070472 markings, 41618192 edges, 28672 markings/sec, 625 secs
lola: 15211943 markings, 41905925 edges, 28294 markings/sec, 630 secs
lola: 15353118 markings, 42195236 edges, 28235 markings/sec, 635 secs
lola: 15484618 markings, 42467343 edges, 26300 markings/sec, 640 secs
lola: 15623641 markings, 42758725 edges, 27805 markings/sec, 645 secs
lola: 15763551 markings, 43056810 edges, 27982 markings/sec, 650 secs
lola: 15905028 markings, 43380452 edges, 28295 markings/sec, 655 secs
lola: 16027522 markings, 43705287 edges, 24499 markings/sec, 660 secs
lola: 16088388 markings, 43976021 edges, 12173 markings/sec, 665 secs
lola: 16139567 markings, 44233325 edges, 10236 markings/sec, 670 secs
lola: 16186217 markings, 44489088 edges, 9330 markings/sec, 675 secs
lola: 16233177 markings, 44744786 edges, 9392 markings/sec, 680 secs
lola: 16277960 markings, 45000280 edges, 8957 markings/sec, 685 secs
lola: 16322159 markings, 45257148 edges, 8840 markings/sec, 690 secs
lola: 16365286 markings, 45514645 edges, 8625 markings/sec, 695 secs
lola: 16408522 markings, 45773793 edges, 8647 markings/sec, 700 secs
lola: 16452336 markings, 46036358 edges, 8763 markings/sec, 705 secs
lola: 16495141 markings, 46302670 edges, 8561 markings/sec, 710 secs
lola: 16537954 markings, 46574459 edges, 8563 markings/sec, 715 secs
lola: 16578207 markings, 46857516 edges, 8051 markings/sec, 720 secs
lola: 16737841 markings, 47269057 edges, 31927 markings/sec, 725 secs
lola: 16906034 markings, 47740690 edges, 33639 markings/sec, 730 secs
lola: 17046284 markings, 48163038 edges, 28050 markings/sec, 735 secs
lola: 17180715 markings, 48555262 edges, 26886 markings/sec, 740 secs
lola: 17334508 markings, 48951450 edges, 30759 markings/sec, 745 secs
lola: 17491277 markings, 49354349 edges, 31354 markings/sec, 750 secs
lola: 17588709 markings, 49653743 edges, 19486 markings/sec, 755 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 924 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= p4il_7_7) AND (pb1_4_5 <= p1o_7_7) AND ((1 <= p4i_7_1) OR (3 <= pb4_4_10))))
lola: processed formula length: 93
lola: 1 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 13 will run for 924 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ========================================
lola: ...considering subproblem: ((p4il_4_5 <= pbl_9_10) AND E (X (A (F ((pb3_6_7 <= p4il_9_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 924 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p4il_4_5 <= pbl_9_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4il_4_5 <= pbl_9_10)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-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: ========================================
lola: subprocess 14 will run for 1386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((pb3_6_7 <= p4il_9_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (pb3_6_7 <= p4il_9_7)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: 485026 markings, 485369 edges, 97005 markings/sec, 0 secs
lola: 964175 markings, 964620 edges, 95830 markings/sec, 5 secs
lola: 1487578 markings, 1488297 edges, 104681 markings/sec, 10 secs
lola: 1999870 markings, 2000698 edges, 102458 markings/sec, 15 secs
lola: 2397359 markings, 2398334 edges, 79498 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G ((2 <= pb1_10_3)))) AND ((((p1ol_3_1 + 1 <= pb2_3_10) AND (3 <= p1i_3_4)) OR ((1 <= p4ol_2_4) AND (1 <= pbl_4_9) AND (p1il_4_8 <= p1il_6_7) AND (p4ol_1_9 <= pb4_10_3))) OR (((1 <= p1il_10_8) OR (pb4_6_10 <= 0)) OR A (X ((1 <= pb2_10_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 14 will run for 1373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb1_10_3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb1_10_3 <= 1))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2747 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p4ol_6_11 <= 0) AND (pb1_2_7 + 1 <= p4il_7_7)) U E (G ((p1il_7_6 <= p1il_7_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p4ol_6_11 <= 0) AND (pb1_2_7 + 1 <= p4il_7_7)) U NOT(A(TRUE U (p1il_7_5 + 1 <= p1il_7_6))))
lola: processed formula length: 95
lola: 3 rewrites
lola: formula mentions 0 of 1380 places; total mentions: 0
lola: closed formula file SquareGrid-PT-100510-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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: RESULT
lola:
SUMMARY: yes no no no yes yes yes no no no yes yes no no no yes
lola: ========================================
FORMULA SquareGrid-PT-100510-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496564066434

--------------------
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="S_SquareGrid-PT-100510"
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/S_SquareGrid-PT-100510.tgz
mv S_SquareGrid-PT-100510 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SquareGrid-PT-100510, 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 r158-ebro-149443464000147"
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 ;