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 S_HypertorusGrid-PT-d5k3p2b10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649800057
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496351010266


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


checking for too many tokens
===========================================================================================
S_HypertorusGrid-PT-d5k3p2b10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_HypertorusGrid-PT-d5k3p2b10 @ 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: 31833/65536 symbol table entries, 17230 collisions
lola: preprocessing...
lola: finding significant places
lola: 7533 places, 24300 transitions, 4859 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26973 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: (NOT((A (F ((3 <= pb_d2_n2_1_1_3_1_3))) OR A (X ((2 <= po_d4_n1_2_2_1_3_3))))) AND (A (G ((pb_d4_n1_3_2_1_3_2 + 1 <= pi_d3_n1_2_3_2_1_1))) OR ((pb_d4_n2_3_2_1_2_3 <= pb_d4_n1_2_1_2_2_3) OR (pbl_2_3_1_3_2 <= pil_d1_n1_2_1_1_2_1)))) : E (X (E (X (((3 <= pb_d3_n1_2_3_3_3_1) AND (pol_d5_n1_3_2_3_3_3 <= po_d3_n1_2_1_1_2_1)))))) : NOT((E (F ((pb_d2_n1_3_3_1_2_3 <= 1))) AND E (F ((po_d2_n1_2_2_2_1_1 <= 2))))) : E (F (NOT(E (F ((3 <= pol_d4_n1_1_1_1_1_3)))))) : A (X ((E (G ((pi_d2_n1_1_1_2_3_2 <= pil_d4_n1_3_3_2_3_1))) OR ((pb_d1_n1_2_2_1_2_2 <= 0) AND ((pil_d2_n1_3_3_3_2_2 <= pol_d5_n1_3_1_2_1_2) OR (pi_d2_n1_2_3_1_1_3 <= po_d2_n1_2_1_3_2_1)))))) : (A (X ((((pi_d2_n1_1_3_2_2_3 <= pb_d2_n2_3_3_3_1_3) AND (2 <= pol_d2_n1_2_2_3_1_3)) OR (1 <= pil_d2_n1_2_3_1_2_1)))) OR ((pb_d2_n1_1_3_1_3_3 + 1 <= pol_d5_n1_3_3_1_2_1) AND (po_d5_n1_3_1_1_1_2 <= 0))) : E (X ((po_d4_n1_2_1_1_1_2 + 1 <= po_d4_n1_1_1_1_1_1))) : A (G ((E (F ((pb_d3_n2_3_2_2_2_1 <= pb_d5_n1_2_2_2_1_1))) OR A (X ((3 <= pi_d1_n1_1_3_3_1_1)))))) : E (X (NOT(E (F ((po_d2_n1_2_1_1_3_3 <= po_d2_n1_1_2_2_1_1)))))) : ((A (G ((2 <= pol_d5_n1_2_2_1_1_3))) OR ((pb_d4_n1_2_2_2_1_3 + 1 <= po_d5_n1_3_2_1_2_2) OR (pil_d1_n1_1_2_3_2_2 + 1 <= pb_d4_n2_2_3_2_2_1))) AND A (G (E (F ((po_d4_n1_3_2_1_3_3 <= pil_d1_n1_2_1_2_1_1)))))) : (((pb_d4_n1_2_2_2_1_1 <= pol_d5_n1_3_3_1_1_2) AND A (((pb_d5_n2_2_1_3_1_1 <= pil_d2_n1_1_2_1_3_1) U (pb_d5_n1_2_1_1_3_3 <= po_d5_n1_2_2_1_1_1)))) OR A (G (((3 <= pb_d4_n1_2_2_2_3_2) OR ((po_d4_n1_2_3_1_3_2 <= pb_d3_n2_2_2_3_1_1) AND (pil_d5_n1_3_3_3_1_3 <= pol_d2_n1_1_3_3_2_3)))))) : E (X (NOT(A (X ((pol_d3_n1_2_3_1_3_1 <= pb_d5_n1_1_2_1_2_2)))))) : (A (((pil_d3_n1_1_1_3_2_3 <= pil_d1_n1_1_1_3_3_3) U (pb_d4_n1_3_3_3_1_1 + 1 <= pb_d1_n1_3_3_1_1_1))) OR (2 <= pi_d3_n1_2_3_2_2_3)) : A (G (A (((po_d2_n1_3_3_1_3_1 <= pol_d5_n1_3_2_2_2_1) U (3 <= pil_d2_n1_1_1_2_1_3))))) : NOT((E (G ((po_d3_n1_3_2_1_3_2 + 1 <= pb_d2_n1_1_1_2_3_3))) OR (pol_d5_n1_2_3_2_2_1 + 1 <= pol_d3_n1_2_3_2_3_3))) : A (F ((E (G ((pi_d1_n1_2_1_2_3_3 <= po_d2_n1_1_3_1_3_3))) AND ((pb_d1_n1_2_2_3_1_2 <= pb_d3_n2_1_2_1_2_1) AND (1 <= pil_d2_n1_3_3_1_3_2) AND (pi_d3_n1_2_2_3_1_2 + 1 <= po_d3_n1_2_3_1_3_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: (NOT((A (F ((3 <= pb_d2_n2_1_1_3_1_3))) OR A (X ((2 <= po_d4_n1_2_2_1_3_3))))) AND (A (G ((pb_d4_n1_3_2_1_3_2 + 1 <= pi_d3_n1_2_3_2_1_1))) OR ((pb_d4_n2_3_2_1_2_3 <= pb_d4_n1_2_1_2_2_3) OR (pbl_2_3_1_3_2 <= pil_d1_n1_2_1_1_2_1))))
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: E (G ((pb_d2_n2_1_1_3_1_3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= pb_d2_n2_1_1_3_1_3)))
lola: processed formula length: 40
lola: 10 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((po_d4_n1_2_2_1_3_3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((po_d4_n1_2_2_1_3_3 <= 1))
lola: processed formula length: 29
lola: 9 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pb_d4_n1_3_2_1_3_2 + 1 <= pi_d3_n1_2_3_2_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 19436 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb_d4_n2_3_2_1_2_3 <= pb_d4_n1_2_1_2_2_3) OR (pbl_2_3_1_3_2 <= pil_d1_n1_2_1_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb_d4_n2_3_2_1_2_3 <= pb_d4_n1_2_1_2_2_3) OR (pbl_2_3_1_3_2 <= pil_d1_n1_2_1_1_2_1))
lola: processed formula length: 87
lola: 8 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (((3 <= pb_d3_n1_2_3_3_3_1) AND (pol_d5_n1_3_2_3_3_3 <= po_d3_n1_2_1_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX(((3 <= pb_d3_n1_2_3_3_3_1) AND (pol_d5_n1_3_2_3_3_3 <= po_d3_n1_2_1_1_2_1))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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: 0 markings, 0 edges, 0 markings/sec, 0 secs
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: NOT((E (F ((pb_d2_n1_3_3_1_2_3 <= 1))) AND E (F ((po_d2_n1_2_2_2_1_1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= pb_d2_n1_3_3_1_2_3)))
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 19436 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-d5k3p2b10-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 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= po_d2_n1_2_2_2_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 19436 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((3 <= pol_d4_n1_1_1_1_1_3))))))
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 (3 <= pol_d4_n1_1_1_1_1_3))))
lola: processed formula length: 51
lola: 6 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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: 125175 markings, 161702 edges, 3689348869717491712 markings/sec, 0 secs
lola: 243880 markings, 316722 edges, 23741 markings/sec, 5 secs
lola: 367050 markings, 477577 edges, 24634 markings/sec, 10 secs
lola: 489919 markings, 638035 edges, 24574 markings/sec, 15 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G ((pi_d2_n1_1_1_2_3_2 <= pil_d4_n1_3_3_2_3_1))) OR ((pb_d1_n1_2_2_1_2_2 <= 0) AND ((pil_d2_n1_3_3_3_2_2 <= pol_d5_n1_3_1_2_1_2) OR (pi_d2_n1_2_3_1_1_3 <= po_d2_n1_2_1_3_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((NOT(A(TRUE U (pil_d4_n1_3_3_2_3_1 + 1 <= pi_d2_n1_1_1_2_3_2))) OR ((pb_d1_n1_2_2_1_2_2 <= 0) AND ((pil_d2_n1_3_3_3_2_2 <= pol_d5_n1_3_1_2_1_2) OR (pi_d2_n1_2_3_1_1_3 <= po_d2_n1_2_1_3_2_1)))))
lola: processed formula length: 197
lola: 3 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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: 108013 markings, 108299 edges, 2317362592537903104 markings/sec, 0 secs
lola: 208960 markings, 209345 edges, 20189 markings/sec, 5 secs
lola: 311805 markings, 312291 edges, 20569 markings/sec, 10 secs
lola: 396056 markings, 396623 edges, 16850 markings/sec, 15 secs
lola: 493207 markings, 493868 edges, 19430 markings/sec, 20 secs
lola: 566666 markings, 567399 edges, 14692 markings/sec, 25 secs
lola: 658860 markings, 659682 edges, 18439 markings/sec, 30 secs
lola: 737177 markings, 738076 edges, 15663 markings/sec, 35 secs
lola: 831179 markings, 832170 edges, 18800 markings/sec, 40 secs
lola: 912450 markings, 913519 edges, 16254 markings/sec, 45 secs
lola: 1002902 markings, 1004058 edges, 18090 markings/sec, 50 secs
lola: 1095925 markings, 1097172 edges, 18605 markings/sec, 55 secs
lola: 1196341 markings, 1197686 edges, 20083 markings/sec, 60 secs
lola: 1306339 markings, 1307790 edges, 22000 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((((pi_d2_n1_1_3_2_2_3 <= pb_d2_n2_3_3_3_1_3) AND (2 <= pol_d2_n1_2_2_3_1_3)) OR (1 <= pil_d2_n1_2_3_1_2_1)))) OR ((pb_d2_n1_1_3_1_3_3 + 1 <= pol_d5_n1_3_3_1_2_1) AND (po_d5_n1_3_1_1_1_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((pi_d2_n1_1_3_2_2_3 <= pb_d2_n2_3_3_3_1_3) AND (2 <= pol_d2_n1_2_2_3_1_3)) OR (1 <= pil_d2_n1_2_3_1_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((pi_d2_n1_1_3_2_2_3 <= pb_d2_n2_3_3_3_1_3) AND (2 <= pol_d2_n1_2_2_3_1_3)) OR (1 <= pil_d2_n1_2_3_1_2_1)))
lola: processed formula length: 112
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb_d2_n1_1_3_1_3_3 + 1 <= pol_d5_n1_3_3_1_2_1) AND (po_d5_n1_3_1_1_1_2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb_d2_n1_1_3_1_3_3 + 1 <= pol_d5_n1_3_3_1_2_1) AND (po_d5_n1_3_1_1_1_2 <= 0))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((po_d4_n1_2_1_1_1_2 + 1 <= po_d4_n1_1_1_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((po_d4_n1_2_1_1_1_2 + 1 <= po_d4_n1_1_1_1_1_1))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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 7 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((pb_d3_n2_3_2_2_2_1 <= pb_d5_n1_2_2_2_1_1))) OR A (X ((3 <= pi_d1_n1_1_3_3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (pb_d3_n2_3_2_2_2_1 <= pb_d5_n1_2_2_2_1_1))) AND NOT(AX((3 <= pi_d1_n1_1_3_3_1_1))))))
lola: processed formula length: 113
lola: 4 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 88276 markings, 238796 edges, 3689320832170983424 markings/sec, 0 secs
lola: 175208 markings, 464552 edges, 17386 markings/sec, 5 secs
lola: 297698 markings, 746049 edges, 24498 markings/sec, 10 secs
lola: 433368 markings, 1080651 edges, 27134 markings/sec, 15 secs
lola: 562722 markings, 1407270 edges, 25871 markings/sec, 20 secs
lola: 673494 markings, 1699398 edges, 22154 markings/sec, 25 secs
lola: 718088 markings, 1907091 edges, 8919 markings/sec, 30 secs
lola: 759163 markings, 2102564 edges, 8215 markings/sec, 35 secs
lola: 798534 markings, 2295976 edges, 7874 markings/sec, 40 secs
lola: 839673 markings, 2498183 edges, 8228 markings/sec, 45 secs
lola: 878187 markings, 2689547 edges, 7703 markings/sec, 50 secs
lola: 914547 markings, 2877660 edges, 7272 markings/sec, 55 secs
lola: 950233 markings, 3054263 edges, 7137 markings/sec, 60 secs
lola: 986863 markings, 3237336 edges, 7326 markings/sec, 65 secs
lola: 1023009 markings, 3418278 edges, 7229 markings/sec, 70 secs
lola: 1060364 markings, 3607497 edges, 7471 markings/sec, 75 secs
lola: 1092304 markings, 3773392 edges, 6388 markings/sec, 80 secs
lola: 1124673 markings, 3941843 edges, 6474 markings/sec, 85 secs
lola: 1152328 markings, 4085527 edges, 5531 markings/sec, 90 secs
lola: 1178981 markings, 4224540 edges, 5331 markings/sec, 95 secs
lola: 1205418 markings, 4358689 edges, 5287 markings/sec, 100 secs
lola: 1229596 markings, 4481603 edges, 4836 markings/sec, 105 secs
lola: 1252140 markings, 4599020 edges, 4509 markings/sec, 110 secs
lola: 1280931 markings, 4748517 edges, 5758 markings/sec, 115 secs
lola: 1303384 markings, 4868428 edges, 4491 markings/sec, 120 secs
lola: 1336125 markings, 5040552 edges, 6548 markings/sec, 125 secs
lola: 1364231 markings, 5187026 edges, 5621 markings/sec, 130 secs
lola: 1392586 markings, 5335851 edges, 5671 markings/sec, 135 secs
lola: 1423633 markings, 5502421 edges, 6209 markings/sec, 140 secs
lola: 1450996 markings, 5649912 edges, 5473 markings/sec, 145 secs
lola: 1481960 markings, 5815798 edges, 6193 markings/sec, 150 secs
lola: 1504270 markings, 5934140 edges, 4462 markings/sec, 155 secs
lola: 1527887 markings, 6068121 edges, 4723 markings/sec, 160 secs
lola: 1555779 markings, 6222429 edges, 5578 markings/sec, 165 secs
lola: 1582203 markings, 6366958 edges, 5285 markings/sec, 170 secs
lola: 1610988 markings, 6526566 edges, 5757 markings/sec, 175 secs
lola: 1632616 markings, 6646411 edges, 4326 markings/sec, 180 secs
lola: 1660121 markings, 6790738 edges, 5501 markings/sec, 185 secs
lola: 1687133 markings, 6940286 edges, 5402 markings/sec, 190 secs
lola: 1709597 markings, 7064200 edges, 4493 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (F ((po_d2_n1_2_1_1_3_3 <= po_d2_n1_1_2_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (po_d2_n1_2_1_1_3_3 <= po_d2_n1_1_2_2_1_1))))
lola: processed formula length: 61
lola: 6 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 9 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================lola: ========================================

lola: ...considering subproblem: ((A (G ((2 <= pol_d5_n1_2_2_1_1_3))) OR ((pb_d4_n1_2_2_2_1_3 + 1 <= po_d5_n1_3_2_1_2_2) OR (pil_d1_n1_1_2_3_2_2 + 1 <= pb_d4_n2_2_3_2_2_1))) AND A (G (E (F ((po_d4_n1_3_2_1_3_3 <= pil_d1_n1_2_1_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= pol_d5_n1_2_2_1_1_3)))
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 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb_d4_n1_2_2_2_1_3 + 1 <= po_d5_n1_3_2_1_2_2) OR (pil_d1_n1_1_2_3_2_2 + 1 <= pb_d4_n2_2_3_2_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb_d4_n1_2_2_2_1_3 + 1 <= po_d5_n1_3_2_1_2_2) OR (pil_d1_n1_1_2_3_2_2 + 1 <= pb_d4_n2_2_3_2_2_1))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-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: ========================================
lola: subprocess 11 will run for 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((po_d4_n1_3_2_1_3_3 <= pil_d1_n1_2_1_2_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 (po_d4_n1_3_2_1_3_3 <= pil_d1_n1_2_1_2_1_1)))))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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: 105542 markings, 241609 edges, 21108 markings/sec, 0 secs
lola: 205809 markings, 472802 edges, 20053 markings/sec, 5 secs
lola: 311974 markings, 717619 edges, 21233 markings/sec, 10 secs
lola: 414996 markings, 955187 edges, 20604 markings/sec, 15 secs
lola: 518442 markings, 1193732 edges, 20689 markings/sec, 20 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pb_d4_n1_2_2_2_1_1 <= pol_d5_n1_3_3_1_1_2) AND A (((pb_d5_n2_2_1_3_1_1 <= pil_d2_n1_1_2_1_3_1) U (pb_d5_n1_2_1_1_3_3 <= po_d5_n1_2_2_1_1_1)))) OR A (G (((3 <= pb_d4_n1_2_2_2_3_2) OR ((po_d4_n1_2_3_1_3_2 <= pb_d3_n2_2_2_3_1_1) AND (pil_d5_n1_3_3_3_1_3 <= pol_d2_n1_1_3_3_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pb_d4_n1_2_2_2_1_1 <= pol_d5_n1_3_3_1_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula: (pb_d4_n1_2_2_2_1_1 <= pol_d5_n1_3_3_1_1_2)
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= pb_d4_n1_2_2_2_3_2) OR ((po_d4_n1_2_3_1_3_2 <= pb_d3_n2_2_2_3_1_1) AND (pil_d5_n1_3_3_3_1_3 <= pol_d2_n1_1_3_3_2_3)))))
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 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (X ((pol_d3_n1_2_3_1_3_1 <= pb_d5_n1_1_2_1_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((pb_d5_n1_1_2_1_2_2 + 1 <= pol_d3_n1_2_3_1_3_1)))
lola: processed formula length: 55
lola: 5 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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: 0 markings, 0 edges, 3689320832170983424 markings/sec, 0 secs
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 798 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((pil_d3_n1_1_1_3_2_3 <= pil_d1_n1_1_1_3_3_3) U (pb_d4_n1_3_3_3_1_1 + 1 <= pb_d1_n1_3_3_1_1_1))) OR (2 <= pi_d3_n1_2_3_2_2_3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 798 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pil_d3_n1_1_1_3_2_3 <= pil_d1_n1_1_1_3_3_3) U (pb_d4_n1_3_3_3_1_1 + 1 <= pb_d1_n1_3_3_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((pil_d3_n1_1_1_3_2_3 <= pil_d1_n1_1_1_3_3_3) U (pb_d4_n1_3_3_3_1_1 + 1 <= pb_d1_n1_3_3_1_1_1))
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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 13 will run for 1065 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= pi_d3_n1_2_3_2_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pi_d3_n1_2_3_2_2_3)
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1065 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((po_d2_n1_3_3_1_3_1 <= pol_d5_n1_3_2_2_2_1) U (3 <= pil_d2_n1_1_1_2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((po_d2_n1_3_3_1_3_1 <= pol_d5_n1_3_2_2_2_1) U (3 <= pil_d2_n1_1_1_2_1_3)))))
lola: processed formula length: 95
lola: 2 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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 14 will run for 1597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((po_d3_n1_3_2_1_3_2 + 1 <= pb_d2_n1_1_1_2_3_3))) OR (pol_d5_n1_2_3_2_2_1 + 1 <= pol_d3_n1_2_3_2_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d2_n1_1_1_2_3_3 <= po_d3_n1_3_2_1_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb_d2_n1_1_1_2_3_3 <= po_d3_n1_3_2_1_3_2))
lola: processed formula length: 52
lola: 6 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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: subprocess 15 will run for 3194 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((pi_d1_n1_2_1_2_3_3 <= po_d2_n1_1_3_1_3_3))) AND ((pb_d1_n1_2_2_3_1_2 <= pb_d3_n2_1_2_1_2_1) AND (1 <= pil_d2_n1_3_3_1_3_2) AND (pi_d3_n1_2_2_3_1_2 + 1 <= po_d3_n1_2_3_1_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U (NOT(A(TRUE U (po_d2_n1_1_3_1_3_3 + 1 <= pi_d1_n1_2_1_2_3_3))) AND ((pb_d1_n1_2_2_3_1_2 <= pb_d3_n2_1_2_1_2_1) AND (1 <= pil_d2_n1_3_3_1_3_2) AND (pi_d3_n1_2_2_3_1_2 + 1 <= po_d3_n1_2_3_1_3_3))))
lola: processed formula length: 204
lola: 3 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19436 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: RESULT
lola:
SUMMARY: yes no no unknown unknown no yes unknown no unknown no no no no no no
lola: ========================================
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496351356736

--------------------
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_HypertorusGrid-PT-d5k3p2b10"
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_HypertorusGrid-PT-d5k3p2b10.tgz
mv S_HypertorusGrid-PT-d5k3p2b10 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 S_HypertorusGrid-PT-d5k3p2b10, 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 r118-blw7-149441649800057"
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 ;