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-040204, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464000129
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496562302957


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


checking for too many tokens
===========================================================================================
S_SquareGrid-PT-040204: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SquareGrid-PT-040204 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 512/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 240 places, 272 transitions, 143 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 368 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-040204-CTLCardinality.task
lola: A (F ((E (G ((2 <= p4il_3_4))) AND A (G ((3 <= p1i_4_1)))))) : A ((E (G ((p4i_4_1 <= pbl_2_2))) U ((1 <= p4i_2_2) AND (p4il_2_4 <= p4i_4_5) AND (p4ol_3_3 + 1 <= p4i_4_3)))) : E (G ((2 <= pb4_4_3))) : A (F ((((2 <= p1ol_3_2) OR (p1o_2_2 <= p1o_3_2) OR (p1o_3_2 <= p1o_2_4) OR (3 <= pb4_3_4)) AND A (X ((2 <= p1ol_1_2)))))) : E (F (((2 <= pb4_1_4) AND (p1il_3_1 <= pb3_3_1) AND (2 <= p1i_1_3) AND ((1 <= p1o_5_2) OR (1 <= pb2_1_3))))) : E (G (A (F ((p1i_1_3 <= 1))))) : E (G ((3 <= pbl_1_2))) : (E (G (((p1o_2_3 + 1 <= pbl_2_4) OR (p4o_1_4 <= p1i_5_4)))) AND E (F ((((p1ol_3_4 <= p1il_3_4) OR (pb2_4_3 <= p4ol_1_4)) AND ((p4o_4_3 <= p4ol_2_5) OR (p4o_3_5 <= pb3_3_3)))))) : E (G (A (X ((p4i_2_1 <= 0))))) : A (G (E (X (((p4il_4_2 <= pb4_1_3) OR (p4i_3_2 <= p1ol_3_2)))))) : (E (X (((pb3_2_2 <= p1i_1_3) AND (pb1_3_1 + 1 <= p4il_2_5)))) OR NOT(((((2 <= p1ol_5_2) OR (3 <= p4i_2_1)) AND ((3 <= p4il_2_2) OR (2 <= pbl_4_1))) OR E (G ((p1i_4_1 <= p1il_3_1)))))) : A (F (E (G ((pbl_2_4 <= p1o_3_1))))) : (A ((((3 <= pb2_1_3) OR (p4o_1_1 <= p4ol_2_5)) U (pb2_1_1 + 1 <= p4o_1_3))) AND A (G (E (G ((p1i_4_4 <= pb1_3_3)))))) : A (((p1il_5_3 <= pb3_3_3) U A (X ((pb4_2_2 <= p4o_2_2))))) : A (F ((1 <= p4o_4_4))) : E (G ((p4i_1_2 <= p4i_2_3)))
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 ((E (G ((2 <= p4il_3_4))) AND A (G ((3 <= p1i_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (p4il_3_4 <= 1))) AND NOT(E(TRUE U (p1i_4_1 <= 2)))))
lola: processed formula length: 76
lola: 5 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 3 significant temporal operators and needs 13 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: A ((E (G ((p4i_4_1 <= pbl_2_2))) U ((1 <= p4i_2_2) AND (p4il_2_4 <= p4i_4_5) AND (p4ol_3_3 + 1 <= p4i_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (pbl_2_2 + 1 <= p4i_4_1))) U ((1 <= p4i_2_2) AND (p4il_2_4 <= p4i_4_5) AND (p4ol_3_3 + 1 <= p4i_4_3)))
lola: processed formula length: 117
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: E (G ((2 <= pb4_4_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pb4_4_3 <= 1)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: A (F ((((2 <= p1ol_3_2) OR (p1o_2_2 <= p1o_3_2) OR (p1o_3_2 <= p1o_2_4) OR (3 <= pb4_3_4)) AND A (X ((2 <= p1ol_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((2 <= p1ol_3_2) OR (p1o_2_2 <= p1o_3_2) OR (p1o_3_2 <= p1o_2_4) OR (3 <= pb4_3_4)) AND AX((2 <= p1ol_1_2))))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pb4_1_4) AND (p1il_3_1 <= pb3_3_1) AND (2 <= p1i_1_3) AND ((1 <= p1o_5_2) OR (1 <= pb2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-040204-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-040204-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p1i_1_3 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p1i_1_3 <= 1)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: E (G ((3 <= pbl_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pbl_1_2 <= 2)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p1o_2_3 + 1 <= pbl_2_4) OR (p4o_1_4 <= p1i_5_4)))) AND E (F ((((p1ol_3_4 <= p1il_3_4) OR (pb2_4_3 <= p4ol_1_4)) AND ((p4o_4_3 <= p4ol_2_5) OR (p4o_3_5 <= pb3_3_3))))))
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: E (G (((p1o_2_3 + 1 <= pbl_2_4) OR (p4o_1_4 <= p1i_5_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pbl_2_4 <= p1o_2_3) AND (p1i_5_4 + 1 <= p4o_1_4))))
lola: processed formula length: 66
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1ol_3_4 <= p1il_3_4) OR (pb2_4_3 <= p4ol_1_4)) AND ((p4o_4_3 <= p4ol_2_5) OR (p4o_3_5 <= pb3_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: state equation: write sara problem file to SquareGrid-PT-040204-CTLCardinality-8.sara
SUBRESULT
lola: result: yes
lola: lola: ========================================
The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((p4i_2_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX((p4i_2_1 <= 0)))))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p4il_4_2 <= pb4_1_3) OR (p4i_3_2 <= p1ol_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((p4il_4_2 <= pb4_1_3) OR (p4i_3_2 <= p1ol_3_2))))))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((pb3_2_2 <= p1i_1_3) AND (pb1_3_1 + 1 <= p4il_2_5)))) OR NOT(((((2 <= p1ol_5_2) OR (3 <= p4i_2_1)) AND ((3 <= p4il_2_2) OR (2 <= pbl_4_1))) OR E (G ((p1i_4_1 <= p1il_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((pb3_2_2 <= p1i_1_3) AND (pb1_3_1 + 1 <= p4il_2_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((pb3_2_2 <= p1i_1_3) AND (pb1_3_1 + 1 <= p4il_2_5)))
lola: processed formula length: 56
lola: 6 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p1ol_5_2 <= 1) AND (p4i_2_1 <= 2)) OR ((p4il_2_2 <= 2) AND (pbl_4_1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1ol_5_2 <= 1) AND (p4i_2_1 <= 2)) OR ((p4il_2_2 <= 2) AND (pbl_4_1 <= 1)))
lola: processed formula length: 79
lola: 5 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-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: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p1il_3_1 + 1 <= p1i_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p1il_3_1 + 1 <= p1i_4_1))
lola: processed formula length: 35
lola: 6 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((pbl_2_4 <= p1o_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p1o_3_1 + 1 <= pbl_2_4))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((3 <= pb2_1_3) OR (p4o_1_1 <= p4ol_2_5)) U (pb2_1_1 + 1 <= p4o_1_3))) AND A (G (E (G ((p1i_4_4 <= pb1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= pb2_1_3) OR (p4o_1_1 <= p4ol_2_5)) U (pb2_1_1 + 1 <= p4o_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= pb2_1_3) OR (p4o_1_1 <= p4ol_2_5)) U (pb2_1_1 + 1 <= p4o_1_3))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: lola: ========================================result: no

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1il_5_3 <= pb3_3_3) U A (X ((pb4_2_2 <= p4o_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p1il_5_3 <= pb3_3_3) U AX((pb4_2_2 <= p4o_2_2)))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p4o_4_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= p4o_4_4))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p4i_1_2 <= p4i_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p4i_2_3 + 1 <= p4i_1_2)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: no no yes no no yes yes yes yes no no no no no no yes
FORMULA SquareGrid-PT-040204-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496562303576

--------------------
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-040204"
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-040204.tgz
mv S_SquareGrid-PT-040204 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-040204, 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-149443464000129"
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 ;