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 HexagonalGrid-PT-816, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034600237
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496504692793


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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-816: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ HexagonalGrid-PT-816 @ 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: 9565/65536 symbol table entries, 1336 collisions
lola: preprocessing...
lola: finding significant places
lola: 3391 places, 6174 transitions, 2117 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7447 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-816-CTLCardinality.task
lola: (A (F (A (X ((pol1_11_11 <= po1_8_13))))) OR (E (((po2_13_5 <= pb5_13_3) U (pb6_12_5 <= pil2_10_2))) AND (E (G ((1 <= pbl_10_5))) AND ((po1_1_5 + 1 <= pol2_1_4) OR (pi3_9_5 + 1 <= po2_8_10))))) : A ((((1 <= pb6_10_4) AND (pi3_4_3 <= pi4_13_1) AND (1 <= pil3_3_2) AND (3 <= pol3_5_8)) U A (F ((2 <= po2_8_4))))) : A (G ((pil1_15_8 <= pbl_13_8))) : E ((((3 <= po1_11_3) OR (pol3_14_8 <= po1_13_7) OR ((2 <= po2_6_13) AND (pol3_4_11 <= pb6_14_1))) U E (G ((pil1_6_1 <= pil3_8_7))))) : E (X (A (X (((pb3_9_9 <= pil2_1_6) AND (1 <= po1_12_4)))))) : A (X (((po3_5_1 <= pi2_5_4) OR (po1_3_9 <= pbl_4_6) OR (1 <= pbl_6_8) OR ((2 <= pil1_14_7) AND (3 <= pi3_9_9) AND ((pi1_4_10 <= pb5_2_3) OR (3 <= pil2_14_7)))))) : A ((E (X ((2 <= po2_15_6))) U ((pb3_11_10 <= 0) OR (pil1_12_10 + 1 <= pol1_8_1)))) : A (F ((2 <= pil3_12_7))) : E (G (((pil3_3_1 <= 2) OR (po1_13_6 <= po3_15_1)))) : A (F (E (G (((pil1_10_1 <= pol3_7_12) AND (pb6_8_12 <= pol2_10_8)))))) : A ((E (F ((po1_4_7 <= pil4_8_1))) U (((2 <= pb5_4_9) AND (3 <= pil2_8_7)) OR ((pi2_7_7 <= pb2_6_13) AND (3 <= pb1_4_6))))) : ((NOT(E (G ((2 <= po4_15_8)))) AND ((pb1_13_4 <= po2_3_9) AND ((pb1_6_2 <= 1) OR (pb1_9_7 + 1 <= pb3_1_3)))) OR NOT((E (G ((pi2_8_8 <= pb3_10_4))) OR (3 <= pb5_7_11)))) : E (G ((pb5_13_1 <= pb4_5_1))) : (E ((((pb4_5_12 <= pol3_4_11) OR (1 <= pb4_13_4)) U (1 <= pb6_1_4))) AND ((A (X ((pil2_6_5 <= pi3_10_10))) OR E (F ((3 <= pil3_12_5)))) AND A (F ((po2_6_6 <= po3_7_5))))) : (((((pi1_5_7 <= pi1_13_7) AND (pi3_7_4 <= pil4_12_1) AND (pb4_10_3 <= 1)) OR A (G ((pbl_8_11 <= po2_3_1)))) OR ((2 <= po1_5_4) AND ((2 <= pb1_12_6) OR ((1 <= pol3_3_3) AND (1 <= pil3_3_1))))) AND (NOT(A (F ((pbl_15_7 <= pil1_4_10)))) OR A (X ((pb4_8_2 + 1 <= pb1_9_8))))) : E (F (E (G (((pil1_1_3 <= pi3_7_1) AND (pi1_13_1 <= pb1_5_7))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((pol1_11_11 <= po1_8_13))))) OR (E (((po2_13_5 <= pb5_13_3) U (pb6_12_5 <= pil2_10_2))) AND (E (G ((1 <= pbl_10_5))) AND ((po1_1_5 + 1 <= pol2_1_4) OR (pi3_9_5 + 1 <= po2_8_10)))))
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: A (F (A (X ((pol1_11_11 <= po1_8_13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((pol1_11_11 <= po1_8_13)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((po2_13_5 <= pb5_13_3) U (pb6_12_5 <= pil2_10_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((po2_13_5 <= pb5_13_3) U (pb6_12_5 <= pil2_10_2))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= pbl_10_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pbl_10_5 <= 0)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((po1_1_5 + 1 <= pol2_1_4) OR (pi3_9_5 + 1 <= po2_8_10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((po1_1_5 + 1 <= pol2_1_4) OR (pi3_9_5 + 1 <= po2_8_10))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= pb6_10_4) AND (pi3_4_3 <= pi4_13_1) AND (1 <= pil3_3_2) AND (3 <= pol3_5_8)) U A (F ((2 <= po2_8_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= pb6_10_4) AND (pi3_4_3 <= pi4_13_1) AND (1 <= pil3_3_2) AND (3 <= pol3_5_8)) U A(TRUE U (2 <= po2_8_4)))
lola: processed formula length: 113
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pil1_15_8 <= pbl_13_8)))
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 8468 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 HexagonalGrid-PT-816-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= po1_11_3) OR (pol3_14_8 <= po1_13_7) OR ((2 <= po2_6_13) AND (pol3_4_11 <= pb6_14_1))) U E (G ((pil1_6_1 <= pil3_8_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= po1_11_3) OR (pol3_14_8 <= po1_13_7) OR ((2 <= po2_6_13) AND (pol3_4_11 <= pb6_14_1))) U NOT(A(TRUE U (pil3_8_7 + 1 <= pil1_6_1))))
lola: processed formula length: 142
lola: 3 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (((pb3_9_9 <= pil2_1_6) AND (1 <= po1_12_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(((pb3_9_9 <= pil2_1_6) AND (1 <= po1_12_4))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((po3_5_1 <= pi2_5_4) OR (po1_3_9 <= pbl_4_6) OR (1 <= pbl_6_8) OR ((2 <= pil1_14_7) AND (3 <= pi3_9_9) AND ((pi1_4_10 <= pb5_2_3) OR (3 <= pil2_14_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((po3_5_1 <= pi2_5_4) OR (po1_3_9 <= pbl_4_6) OR (1 <= pbl_6_8) OR ((2 <= pil1_14_7) AND (3 <= pi3_9_9) AND ((pi1_4_10 <= pb5_2_3) OR (3 <= pil2_14_7)))))
lola: processed formula length: 161
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((2 <= po2_15_6))) U ((pb3_11_10 <= 0) OR (pil1_12_10 + 1 <= pol1_8_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((2 <= po2_15_6)) U ((pb3_11_10 <= 0) OR (pil1_12_10 + 1 <= pol1_8_1)))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= pil3_12_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= pil3_12_7))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((pil3_3_1 <= 2) OR (po1_13_6 <= po3_15_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= pil3_3_1) AND (po3_15_1 + 1 <= po1_13_6))))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((pil1_10_1 <= pol3_7_12) AND (pb6_8_12 <= pol2_10_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((pol3_7_12 + 1 <= pil1_10_1) OR (pol2_10_8 + 1 <= pb6_8_12)))))
lola: processed formula length: 87
lola: 3 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((po1_4_7 <= pil4_8_1))) U (((2 <= pb5_4_9) AND (3 <= pil2_8_7)) OR ((pi2_7_7 <= pb2_6_13) AND (3 <= pb1_4_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (po1_4_7 <= pil4_8_1)) U (((2 <= pb5_4_9) AND (3 <= pil2_8_7)) OR ((pi2_7_7 <= pb2_6_13) AND (3 <= pb1_4_6))))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((2 <= po4_15_8)))) AND ((pb1_13_4 <= po2_3_9) AND ((pb1_6_2 <= 1) OR (pb1_9_7 + 1 <= pb3_1_3)))) OR NOT((E (G ((pi2_8_8 <= pb3_10_4))) OR (3 <= pb5_7_11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((po4_15_8 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (po4_15_8 <= 1))
lola: processed formula length: 25
lola: 9 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb1_13_4 <= po2_3_9) AND ((pb1_6_2 <= 1) OR (pb1_9_7 + 1 <= pb3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb1_13_4 <= po2_3_9) AND ((pb1_6_2 <= 1) OR (pb1_9_7 + 1 <= pb3_1_3)))
lola: processed formula length: 73
lola: 8 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb3_10_4 + 1 <= pi2_8_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb3_10_4 + 1 <= pi2_8_8))
lola: processed formula length: 35
lola: 9 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb5_13_1 <= pb4_5_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pb4_5_1 + 1 <= pb5_13_1)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((pb4_5_12 <= pol3_4_11) OR (1 <= pb4_13_4)) U (1 <= pb6_1_4))) AND ((A (X ((pil2_6_5 <= pi3_10_10))) OR E (F ((3 <= pil3_12_5)))) AND A (F ((po2_6_6 <= po3_7_5)))))
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 ((((pb4_5_12 <= pol3_4_11) OR (1 <= pb4_13_4)) U (1 <= pb6_1_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((pb4_5_12 <= pol3_4_11) OR (1 <= pb4_13_4)) U (1 <= pb6_1_4))
lola: processed formula length: 65
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pil2_6_5 <= pi3_10_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((pil2_6_5 <= pi3_10_10))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pil3_12_5)))
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 8468 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 HexagonalGrid-PT-816-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file HexagonalGrid-PT-816-CTLCardinality-15.sara.
lola: sara is running 0 secs || 132645 markings, 166420 edges, 26529 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((pi1_5_7 <= pi1_13_7) AND (pi3_7_4 <= pil4_12_1) AND (pb4_10_3 <= 1)) OR A (G ((pbl_8_11 <= po2_3_1)))) OR ((2 <= po1_5_4) AND ((2 <= pb1_12_6) OR ((1 <= pol3_3_3) AND (1 <= pil3_3_1))))) AND (NOT(A (F ((pbl_15_7 <= pil1_4_10)))) OR A (X ((pb4_8_2 + 1 <= pb1_9_8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pi1_5_7 <= pi1_13_7) AND (pi3_7_4 <= pil4_12_1) AND (pb4_10_3 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi1_5_7 <= pi1_13_7) AND (pi3_7_4 <= pil4_12_1) AND (pb4_10_3 <= 1))
lola: processed formula length: 70
lola: 4 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-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 15 will run for 3530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pil1_4_10 + 1 <= pbl_15_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pbl_15_7 <= pil1_4_10)))
lola: processed formula length: 38
lola: 6 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((pil1_1_3 <= pi3_7_1) AND (pi1_13_1 <= pb1_5_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((pi3_7_1 + 1 <= pil1_1_3) OR (pb1_5_7 + 1 <= pi1_13_1)))))
lola: processed formula length: 82
lola: 3 rewrites
lola: formula mentions 0 of 3391 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-816-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8468 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 yes no yes no no yes yes no no yes no yes yes
lola: ========================================
FORMULA HexagonalGrid-PT-816-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496504703740

--------------------
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="HexagonalGrid-PT-816"
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/HexagonalGrid-PT-816.tgz
mv HexagonalGrid-PT-816 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 HexagonalGrid-PT-816, 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 r188-blw3-149581034600237"
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 ;