About the Execution of LoLA for HypertorusGrid-PT-d2k1p8b00
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
120.560 | 1904.00 | 1007.00 | 10.10 | FFFFTTTFTFFFFTFT | normal |
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 HypertorusGrid-PT-d2k1p8b00, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500030
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-0
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-1
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-10
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-11
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-12
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-13
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-14
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-15
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-2
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-3
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-4
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-5
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-6
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-7
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-8
FORMULA_NAME HypertorusGrid-PT-d2k1p8b00-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494615883049
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ HypertorusGrid-PT-d2k1p8b00 @ 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: 29/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 13 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: NOT(A (G (TRUE))) : (NOT(E (X (((2 <= pil_d1_n1_1_1) OR (3 <= pb_d2_n1_1_1))))) OR E ((((pb_d2_n1_1_1 <= pb_d2_n2_1_1) OR (3 <= pi_d1_n1_1_1)) U ((3 <= pi_d2_n1_1_1) AND (pi_d2_n1_1_1 <= pol_d2_n1_1_1))))) : E ((((po_d2_n1_1_1 <= pb_d2_n1_1_1) OR (3 <= pb_d1_n2_1_1) OR (pb_d2_n2_1_1 + 1 <= po_d1_n1_1_1)) U (((3 <= pil_d2_n1_1_1) OR (pb_d1_n2_1_1 <= pi_d2_n1_1_1)) AND (po_d2_n1_1_1 + 1 <= pol_d1_n1_1_1)))) : ((pi_d2_n1_1_1 <= pb_d1_n2_1_1) AND A (G ((pbl_1_1 + 1 <= pb_d1_n2_1_1)))) : E (X (E (((pol_d1_n1_1_1 <= pbl_1_1) U (3 <= pol_d2_n1_1_1))))) : (E (F ((2 <= pil_d1_n1_1_1))) AND ((((1 <= pb_d2_n1_1_1) OR (pi_d2_n1_1_1 <= po_d2_n1_1_1) OR (pb_d1_n1_1_1 <= pb_d2_n1_1_1)) OR A (G ((pb_d1_n1_1_1 <= pb_d1_n2_1_1)))) OR (pil_d2_n1_1_1 <= pb_d1_n2_1_1))) : E (F ((2 <= pi_d1_n1_1_1))) : E (X (NOT(A (G ((1 <= pb_d1_n1_1_1)))))) : (E (F (A (G ((2 <= pbl_1_1))))) AND (1 <= pb_d1_n1_1_1)) : NOT(E (F (A (G ((pb_d2_n1_1_1 <= pol_d1_n1_1_1)))))) : A (G (NOT(E (G ((pb_d1_n1_1_1 <= pil_d2_n1_1_1)))))) : E ((E (F ((2 <= pol_d2_n1_1_1))) U ((1 <= pi_d2_n1_1_1) AND (pb_d2_n1_1_1 <= pi_d1_n1_1_1) AND (2 <= pil_d2_n1_1_1)))) : E (X (A (G (((po_d2_n1_1_1 <= pb_d1_n1_1_1) OR (pb_d1_n1_1_1 <= po_d1_n1_1_1)))))) : A (G ((((pi_d2_n1_1_1 <= pb_d2_n2_1_1) OR (po_d1_n1_1_1 <= 2))))) : A (G (())) : E ((((pol_d2_n1_1_1 <= pb_d1_n2_1_1) OR (1 <= pb_d2_n2_1_1) OR (pil_d1_n1_1_1 <= 2)) U ((1 <= pb_d1_n1_1_1) AND (2 <= pil_d2_n1_1_1) AND (pi_d2_n1_1_1 + 1 <= pbl_1_1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 4 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: processed formula with 0 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (X (((2 <= pil_d1_n1_1_1) OR (3 <= pb_d2_n1_1_1))))) OR E ((((pb_d2_n1_1_1 <= pb_d2_n2_1_1) OR (3 <= pi_d1_n1_1_1)) U ((3 <= pi_d2_n1_1_1) AND (pi_d2_n1_1_1 <= pol_d2_n1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((pil_d1_n1_1_1 <= 1) AND (pb_d2_n1_1_1 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((pil_d1_n1_1_1 <= 1) AND (pb_d2_n1_1_1 <= 2)))
lola: processed formula length: 50
lola: 4 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((pb_d2_n1_1_1 <= pb_d2_n2_1_1) OR (3 <= pi_d1_n1_1_1)) U ((3 <= pi_d2_n1_1_1) AND (pi_d2_n1_1_1 <= pol_d2_n1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((pb_d2_n1_1_1 <= pb_d2_n2_1_1) OR (3 <= pi_d1_n1_1_1)) U ((3 <= pi_d2_n1_1_1) AND (pi_d2_n1_1_1 <= pol_d2_n1_1_1)))
lola: processed formula length: 119
lola: 4 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((po_d2_n1_1_1 <= pb_d2_n1_1_1) OR (3 <= pb_d1_n2_1_1) OR (pb_d2_n2_1_1 + 1 <= po_d1_n1_1_1)) U (((3 <= pil_d2_n1_1_1) OR (pb_d1_n2_1_1 <= pi_d2_n1_1_1)) AND (po_d2_n1_1_1 + 1 <= pol_d1_n1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((po_d2_n1_1_1 <= pb_d2_n1_1_1) OR (3 <= pb_d1_n2_1_1) OR (pb_d2_n2_1_1 + 1 <= po_d1_n1_1_1)) U (((3 <= pil_d2_n1_1_1) OR (pb_d1_n2_1_1 <= pi_d2_n1_1_1)) AND (po_d2_n1_1_1 + 1 <= pol_d1_n1_1_1)))
lola: processed formula length: 200
lola: 1 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: ((pi_d2_n1_1_1 <= pb_d1_n2_1_1) AND A (G ((pbl_1_1 + 1 <= pb_d1_n2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pi_d2_n1_1_1 <= pb_d1_n2_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pi_d2_n1_1_1 <= pb_d1_n2_1_1)
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pbl_1_1 + 1 <= pb_d1_n2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d2k1p8b00-CTLCardinality-4.sara
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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((pol_d1_n1_1_1 <= pbl_1_1) U (3 <= pol_d2_n1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((pol_d1_n1_1_1 <= pbl_1_1) U (3 <= pol_d2_n1_1_1)))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= pil_d1_n1_1_1))) AND ((((1 <= pb_d2_n1_1_1) OR (pi_d2_n1_1_1 <= po_d2_n1_1_1) OR (pb_d1_n1_1_1 <= pb_d2_n1_1_1)) OR A (G ((pb_d1_n1_1_1 <= pb_d1_n2_1_1)))) OR (pil_d2_n1_1_1 <= pb_d1_n2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pil_d1_n1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d2k1p8b00-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d2k1p8b00-CTLCardinality-5.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pi_d1_n1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d2k1p8b00-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d2k1p8b00-CTLCardinality-6.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (G ((1 <= pb_d1_n1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (pb_d1_n1_1_1 <= 0)))
lola: processed formula length: 33
lola: 5 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((2 <= pbl_1_1))))) AND (1 <= pb_d1_n1_1_1))
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 (A (G ((2 <= pbl_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (pbl_1_1 <= 1))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 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: NOT(E (F (A (G ((pb_d2_n1_1_1 <= pol_d1_n1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (pol_d1_n1_1_1 + 1 <= pb_d2_n1_1_1)))))
lola: processed formula length: 65
lola: 7 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 (G (NOT(E (G ((pb_d1_n1_1_1 <= pil_d2_n1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (pil_d2_n1_1_1 + 1 <= pb_d1_n1_1_1)))))
lola: processed formula length: 65
lola: 5 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: E ((E (F ((2 <= pol_d2_n1_1_1))) U ((1 <= pi_d2_n1_1_1) AND (pb_d2_n1_1_1 <= pi_d1_n1_1_1) AND (2 <= pil_d2_n1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (2 <= pol_d2_n1_1_1)) U ((1 <= pi_d2_n1_1_1) AND (pb_d2_n1_1_1 <= pi_d1_n1_1_1) AND (2 <= pil_d2_n1_1_1)))
lola: processed formula length: 117
lola: 2 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: E (X (A (G (((po_d2_n1_1_1 <= pb_d1_n1_1_1) OR (pb_d1_n1_1_1 <= po_d1_n1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((pb_d1_n1_1_1 + 1 <= po_d2_n1_1_1) AND (po_d1_n1_1_1 + 1 <= pb_d1_n1_1_1)))))
lola: processed formula length: 94
lola: 3 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pi_d2_n1_1_1 <= pb_d2_n2_1_1) OR (po_d1_n1_1_1 <= 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 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d2k1p8b00-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d2k1p8b00-CTLCardinality-13.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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: processed formula with 0 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 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((pol_d2_n1_1_1 <= pb_d1_n2_1_1) OR (1 <= pb_d2_n2_1_1) OR (pil_d1_n1_1_1 <= 2)) U ((1 <= pb_d1_n1_1_1) AND (2 <= pil_d2_n1_1_1) AND (pi_d2_n1_1_1 + 1 <= pbl_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((pol_d2_n1_1_1 <= pb_d1_n2_1_1) OR (1 <= pb_d2_n2_1_1) OR (pil_d1_n1_1_1 <= 2)) U ((1 <= pb_d1_n1_1_1) AND (2 <= pil_d2_n1_1_1) AND (pi_d2_n1_1_1 + 1 <= pbl_1_1)))
lola: processed formula length: 168
lola: 1 rewrites
lola: formula mentions 0 of 13 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d2k1p8b00-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: RESULT
lola:
SUMMARY: no no yes no no no no yes no yes no no yes yes yes no
lola: ========================================
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d2k1p8b00-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494615884953
--------------------
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="HypertorusGrid-PT-d2k1p8b00"
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/HypertorusGrid-PT-d2k1p8b00.tgz
mv HypertorusGrid-PT-d2k1p8b00 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 HypertorusGrid-PT-d2k1p8b00, 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 r038-blw7-149440484500030"
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 '
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 ;