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_PhilosophersDyn-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681400264
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496368336198


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


checking for too many tokens
===========================================================================================
S_PhilosophersDyn-PT-03: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PhilosophersDyn-PT-03 @ 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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-CTLCardinality.task
lola: A (F (E (G ((HasRight_1 + HasRight_2 + HasRight_3 <= 0))))) : A ((((3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) OR (1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR (Think_1 + Think_2 + Think_3 <= 1)) U (1 <= HasLeft_1 + HasLeft_2 + HasLeft_3))) : A (((WaitRight_1 + WaitRight_2 + WaitRight_3 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) U E (G ((1 <= WaitRight_1 + WaitRight_2 + WaitRight_3))))) : A (((HasLeft_1 + HasLeft_2 + HasLeft_3 <= HasRight_1 + HasRight_2 + HasRight_3) U ((HasRight_1 + HasRight_2 + HasRight_3 <= 2) OR (Think_1 + Think_2 + Think_3 <= 2)))) : A (G (((3 <= Forks_3 + Forks_2 + Forks_1) OR A (F ((2 <= WaitRight_1 + WaitRight_2 + WaitRight_3)))))) : (1 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) : A ((A (X ((2 <= HasLeft_1 + HasLeft_2 + HasLeft_3))) U ((Outside_3 + Outside_2 + Outside_1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR (Think_1 + Think_2 + Think_3 <= 1)))) : ((E (G (((2 <= HasRight_1 + HasRight_2 + HasRight_3) OR (3 <= Forks_3 + Forks_2 + Forks_1)))) AND (Outside_3 + Outside_2 + Outside_1 <= HasRight_1 + HasRight_2 + HasRight_3)) OR E (((Outside_3 + Outside_2 + Outside_1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasLeft_1 + HasLeft_2 + HasLeft_3) AND (HasLeft_1 + HasLeft_2 + HasLeft_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3))))) : ((((2 <= Forks_3 + Forks_2 + Forks_1) OR (3 <= HasRight_1 + HasRight_2 + HasRight_3)) AND A (((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) U (1 <= Think_1 + Think_2 + Think_3)))) OR (1 <= Forks_3 + Forks_2 + Forks_1)) : E (X ((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= Outside_3 + Outside_2 + Outside_1))) : A ((A (G ((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3))) U E (G ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= Forks_3 + Forks_2 + Forks_1))))) : E (X (NOT(A (F (TRUE))))) : E ((((3 <= Forks_3 + Forks_2 + Forks_1) OR (3 <= WaitRight_1 + WaitRight_2 + WaitRight_3) OR (1 <= Forks_3 + Forks_2 + Forks_1)) U A (F ((2 <= HasRight_1 + HasRight_2 + HasRight_3))))) : A (G ((HasLeft_1 + HasLeft_2 + HasLeft_3 <= 1))) : ((Think_1 + Think_2 + Think_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) OR (NOT(A (F ((HasRight_1 + HasRight_2 + HasRight_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3)))) AND (Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 <= Outside_3 + Outside_2 + Outside_1))) : (E (F (())) OR (NOT(E (G ((1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1)))) OR ((2 <= Forks_3 + Forks_2 + Forks_1) AND ((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) OR (Outside_3 + Outside_2 + Outside_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) OR ((3 <= Forks_3 + Forks_2 + Forks_1) AND (1 <= HasRight_1 + HasRight_2 + HasRight_3))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((HasRight_1 + HasRight_2 + HasRight_3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= HasRight_1 + HasRight_2 + HasRight_3))))
lola: processed formula length: 68
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) OR (1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR (Think_1 + Think_2 + Think_3 <= 1)) U (1 <= HasLeft_1 + HasLeft_2 + HasLeft_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) OR (1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR (Think_1 + Think_2 + Think_3 <= 1)) U (1 <= HasLeft_1 + HasLeft_2 + HasLeft_3))
lola: processed formula length: 319
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((WaitRight_1 + WaitRight_2 + WaitRight_3 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) U E (G ((1 <= WaitRight_1 + WaitRight_2 + WaitRight_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((WaitRight_1 + WaitRight_2 + WaitRight_3 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) U NOT(A(TRUE U (WaitRight_1 + WaitRight_2 + WaitRight_3 <= 0))))
lola: processed formula length: 289
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((HasLeft_1 + HasLeft_2 + HasLeft_3 <= HasRight_1 + HasRight_2 + HasRight_3) U ((HasRight_1 + HasRight_2 + HasRight_3 <= 2) OR (Think_1 + Think_2 + Think_3 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((HasLeft_1 + HasLeft_2 + HasLeft_3 <= HasRight_1 + HasRight_2 + HasRight_3) U ((HasRight_1 + HasRight_2 + HasRight_3 <= 2) OR (Think_1 + Think_2 + Think_3 <= 2)))
lola: processed formula length: 165
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Forks_3 + Forks_2 + Forks_1) OR A (F ((2 <= WaitRight_1 + WaitRight_2 + WaitRight_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((Forks_3 + Forks_2 + Forks_1 <= 2) AND NOT(A(TRUE U (2 <= WaitRight_1 + WaitRight_2 + WaitRight_3))))))
lola: processed formula length: 117
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1)
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((2 <= HasLeft_1 + HasLeft_2 + HasLeft_3))) U ((Outside_3 + Outside_2 + Outside_1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR (Think_1 + Think_2 + Think_3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((2 <= HasLeft_1 + HasLeft_2 + HasLeft_3)) U ((Outside_3 + Outside_2 + Outside_1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR (Think_1 + Think_2 + Think_3 <= 1)))
lola: processed formula length: 307
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((2 <= HasRight_1 + HasRight_2 + HasRight_3) OR (3 <= Forks_3 + Forks_2 + Forks_1)))) AND (Outside_3 + Outside_2 + Outside_1 <= HasRight_1 + HasRight_2 + HasRight_3)) OR E (((Outside_3 + Outside_2 + Outside_1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasLeft_1 + HasLeft_2 + HasLeft_3) AND (HasLeft_1 + HasLeft_2 + HasLeft_3 <= WaitRight_1 + WaitRight_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= HasRight_1 + HasRight_2 + HasRight_3) OR (3 <= Forks_3 + Forks_2 + Forks_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((HasRight_1 + HasRight_2 + HasRight_3 <= 1) AND (Forks_3 + Forks_2 + Forks_1 <= 2))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((Outside_3 + Outside_2 + Outside_1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasLeft_1 + HasLeft_2 + HasLeft_3) AND (HasLeft_1 + HasLeft_2 + HasLeft_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Outside_3 + Outside_2 + Outside_1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasLeft_1 + HasLeft_2 + HasLeft_3) AND (HasLeft_1 + HasLeft_2 + HasLeft_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3)))
lola: processed formula length: 235
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= Forks_3 + Forks_2 + Forks_1) OR (3 <= HasRight_1 + HasRight_2 + HasRight_3)) AND A (((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) U (1 <= Think_1 + Think_2 + Think_3)))) OR (1 <= Forks_3 + Forks_2 + Forks_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: ((2 <= Forks_3 + Forks_2 + Forks_1) OR (3 <= HasRight_1 + HasRight_2 + HasRight_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= Forks_3 + Forks_2 + Forks_1) OR (3 <= HasRight_1 + HasRight_2 + HasRight_3))
lola: processed formula length: 84
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= Forks_3 + Forks_2 + Forks_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Forks_3 + Forks_2 + Forks_1)
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= Outside_3 + Outside_2 + Outside_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= Outside_3 + Outside_2 + Outside_1))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: A ((A (G ((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= WaitRight_1 + WaitRight_2 + WaitRight_3))) U E (G ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= Forks_3 + Forks_2 + Forks_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (WaitRight_1 + WaitRight_2 + WaitRight_3 + 1 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1))) U NOT(A(TRUE U (Forks_3 + Forks_2 + Forks_1 + 1 <= WaitRight_1 + WaitRight_2 + WaitRight_3))))
lola: processed formula length: 197
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: 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: E (X (NOT(A (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= Forks_3 + Forks_2 + Forks_1) OR (3 <= WaitRight_1 + WaitRight_2 + WaitRight_3) OR (1 <= Forks_3 + Forks_2 + Forks_1)) U A (F ((2 <= HasRight_1 + HasRight_2 + HasRight_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= Forks_3 + Forks_2 + Forks_1) OR (3 <= WaitRight_1 + WaitRight_2 + WaitRight_3) OR (1 <= Forks_3 + Forks_2 + Forks_1)) U A(TRUE U (2 <= HasRight_1 + HasRight_2 + HasRight_3)))
lola: processed formula length: 185
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((HasLeft_1 + HasLeft_2 + HasLeft_3 <= 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 76 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 PhilosophersDyn-COL-03-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Think_1 + Think_2 + Think_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) OR (NOT(A (F ((HasRight_1 + HasRight_2 + HasRight_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3)))) AND (Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 <= Outside_3 + Outside_2 + Outside_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Think_1 + Think_2 + Think_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Think_1 + Think_2 + Think_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1)
lola: processed formula length: 69
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (())) OR (NOT(E (G ((1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1)))) OR ((2 <= Forks_3 + Forks_2 + Forks_1) AND ((WaitLeft_3 + WaitLeft_2 + WaitLeft_1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) OR (Outside_3 + Outside_2 + Outside_1 <= HasLeft_1 + HasLeft_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 7 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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: RESULT
lola:
SUMMARY: yes no yes yes no no yes yes no yes yes no no no yes yes
FORMULA PhilosophersDyn-COL-03-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496368336490

--------------------
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_PhilosophersDyn-PT-03"
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_PhilosophersDyn-PT-03.tgz
mv S_PhilosophersDyn-PT-03 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_PhilosophersDyn-PT-03, 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-149441681400264"
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 ;