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_Philosophers-COL-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681200156
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496308612204


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Philosophers-COL-000005: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_Philosophers-COL-000005: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_Philosophers-COL-000005 @ 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000005-CTLCardinality.task
lola: NOT(NOT(A (X (FALSE)))) : (2 <= p15 + p16 + p17 + p18 + p19) : A (F (((p5 + p6 + p7 + p8 + p9 <= 0) OR ((3 <= p20 + p21 + p22 + p23 + p24) AND (2 <= p0 + p1 + p2 + p3 + p4)) OR (p10 + p11 + p12 + p13 + p14 <= p20 + p21 + p22 + p23 + p24)))) : (NOT(E (G (((p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2 + p3 + p4) OR (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19))))) OR (A (G ((p5 + p6 + p7 + p8 + p9 <= 0))) AND A (F ((p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14))))) : (p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14) : (((p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24) AND (p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9) AND (p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)) OR (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19)) : (1 <= p0 + p1 + p2 + p3 + p4) : E ((((p15 + p16 + p17 + p18 + p19 <= 0) OR ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p15 + p16 + p17 + p18 + p19))) U ((p20 + p21 + p22 + p23 + p24 <= 2) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9)))) : (A (G (E (G ((1 <= p0 + p1 + p2 + p3 + p4))))) AND E (X ((((p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14) OR (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19)) AND (2 <= p5 + p6 + p7 + p8 + p9))))) : E (X ((((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24) AND (p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24)) OR ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)) OR ((p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9))))) : NOT((E (X ((p20 + p21 + p22 + p23 + p24 <= p5 + p6 + p7 + p8 + p9))) OR (p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14))) : A (G (NOT(E (X ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)))))) : (((p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4) OR (A (G ((p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14))) OR ((3 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p10 + p11 + p12 + p13 + p14) OR (p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9)))) AND (NOT(A (F ((p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14)))) AND (E (F ((1 <= p15 + p16 + p17 + p18 + p19))) OR ((p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p10 + p11 + p12 + p13 + p14) OR (1 <= p15 + p16 + p17 + p18 + p19) OR (3 <= p10 + p11 + p12 + p13 + p14))))) : (E (X (E (F ((1 <= p20 + p21 + p22 + p23 + p24))))) OR ((p10 + p11 + p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4))) : (NOT((E (X ((1 <= p0 + p1 + p2 + p3 + p4))) AND ())) AND A (F (((3 <= p5 + p6 + p7 + p8 + p9) AND (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND (p20 + p21 + p22 + p23 + p24 <= 0))))) : E (G (E (G (((p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9) OR (2 <= p20 + p21 + p22 + p23 + p24))))))
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(NOT(A (X (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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: (2 <= p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p5 + p6 + p7 + p8 + p9 <= 0) OR ((3 <= p20 + p21 + p22 + p23 + p24) AND (2 <= p0 + p1 + p2 + p3 + p4)) OR (p10 + p11 + p12 + p13 + p14 <= p20 + p21 + p22 + p23 + p24))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p5 + p6 + p7 + p8 + p9 <= 0) OR ((3 <= p20 + p21 + p22 + p23 + p24) AND (2 <= p0 + p1 + p2 + p3 + p4)) OR (p10 + p11 + p12 + p13 + p14 <= p20 + p21 + p22 + p23 + p24)))
lola: processed formula length: 181
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: (NOT(E (G (((p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2 + p3 + p4) OR (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19))))) OR (A (G ((p5 + p6 + p7 + p8 + p9 <= 0))) AND A (F ((p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14)))))
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: A (F (((p0 + p1 + p2 + p3 + p4 + 1 <= p10 + p11 + p12 + p13 + p14) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p0 + p1 + p2 + p3 + p4 + 1 <= p10 + p11 + p12 + p13 + p14) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24)))
lola: processed formula length: 140
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p5 + p6 + p7 + p8 + p9 <= 0)))
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 60 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: state equation: write sara problem file to Philosophers-COL-000005-CTLCardinality-4.sara
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: (p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14)
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24) AND (p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9) AND (p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)) OR (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24) AND (p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9) AND (p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)) OR (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19))
lola: processed formula length: 253
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p15 + p16 + p17 + p18 + p19 <= 0) OR ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p15 + p16 + p17 + p18 + p19))) U ((p20 + p21 + p22 + p23 + p24 <= 2) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p15 + p16 + p17 + p18 + p19 <= 0) OR ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p15 + p16 + p17 + p18 + p19))) U ((p20 + p21 + p22 + p23 + p24 <= 2) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9)))
lola: processed formula length: 243
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: (A (G (E (G ((1 <= p0 + p1 + p2 + p3 + p4))))) AND E (X ((((p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14) OR (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19)) AND (2 <= p5 + p6 + p7 + p8 + p9)))))
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: A (G (E (G ((1 <= p0 + p1 + p2 + p3 + p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (p0 + p1 + p2 + p3 + p4 <= 0))))
lola: processed formula length: 54
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24) AND (p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24)) OR ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)) OR ((p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24) AND (p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24)) OR ((p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4)) OR ((p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 380
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((p20 + p21 + p22 + p23 + p24 <= p5 + p6 + p7 + p8 + p9))) OR (p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p5 + p6 + p7 + p8 + p9 + 1 <= p20 + p21 + p22 + p23 + p24)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p5 + p6 + p7 + p8 + p9 + 1 <= p20 + p21 + p22 + p23 + p24))
lola: processed formula length: 63
lola: 6 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 59
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (X ((p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((p0 + p1 + p2 + p3 + p4 + 1 <= p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 78
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4) OR (A (G ((p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14))) OR ((3 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p10 + p11 + p12 + p13 + p14) OR (p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9)))) AND (NOT(A (F ((p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14)))) AND (E (F ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 <= p10 + p11 + p12 + p13 + p14)))
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 60 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: state equation: write sara problem file to Philosophers-COL-000005-CTLCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p10 + p11 + p12 + p13 + p14) OR (p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p15 + p16 + p17 + p18 + p19) OR (2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p10 + p11 + p12 + p13 + p14) OR (p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9))
lola: processed formula length: 174
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p10 + p11 + p12 + p13 + p14 + 1 <= p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14)))
lola: processed formula length: 70
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((1 <= p20 + p21 + p22 + p23 + p24))))) OR ((p10 + p11 + p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((1 <= p20 + p21 + p22 + p23 + p24)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (1 <= p20 + p21 + p22 + p23 + p24)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (X ((1 <= p0 + p1 + p2 + p3 + p4))) AND ())) AND A (F (((3 <= p5 + p6 + p7 + p8 + p9) AND (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND (p20 + p21 + p22 + p23 + p24 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= p5 + p6 + p7 + p8 + p9) AND (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND (p20 + p21 + p22 + p23 + p24 <= 0)))
lola: processed formula length: 140
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (((p10 + p11 + p12 + p13 + p14 <= p5 + p6 + p7 + p8 + p9) OR (2 <= p20 + p21 + p22 + p23 + p24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U ((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (p20 + p21 + p22 + p23 + p24 <= 1)))))
lola: processed formula length: 125
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: RESULT========================================

lola:
SUMMARY: no yes yes no no yes no yes no yes no no no yes no yes
FORMULA Philosophers-COL-000005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496308612378

--------------------
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_Philosophers-COL-000005"
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_Philosophers-COL-000005.tgz
mv S_Philosophers-COL-000005 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_Philosophers-COL-000005, 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 r128-smll-149441681200156"
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 ;