Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_DatabaseWithMutex-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455600174
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496447569905


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


checking for too many tokens
===========================================================================================
S_DatabaseWithMutex-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_DatabaseWithMutex-PT-02 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 70/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 38 places, 32 transitions, 28 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 46 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-COL-02-CTLCardinality.task
lola: A (X (((2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)))) : (((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2) AND E (G (((3 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2))))) AND (((all_active_1 + all_active_2 <= 1) AND E (G ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2)))) AND E (((1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) U (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2))))) : A (G (E (G (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= all_active_1 + all_active_2) OR (2 <= Mutex_1 + Mutex_2)))))) : (3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2) : A (F (((((2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND (2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2)) OR (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= Mutex_1 + Mutex_2)) OR A (X ((1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)))))) : E (G ((((Mutex_1 + Mutex_2 <= 2) OR (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 + 1 <= all_passive_1 + all_passive_2)) OR E (X ((Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= all_passive_1 + all_passive_2)))))) : ((2 <= all_passive_1 + all_passive_2) AND (2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) AND ((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 2) OR (2 <= all_passive_1 + all_passive_2))) : NOT(A (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= 0) U (2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)))) : NOT(A (G (E (F ((all_passive_1 + all_passive_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2)))))) : (Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) : A (X (((((3 <= all_active_1 + all_active_2) AND (all_passive_1 + all_passive_2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2)) OR (RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 + 1 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)) OR E (G ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2)))))) : (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) : ((((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 + 1 <= Mutex_1 + Mutex_2) AND (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)) OR (3 <= all_active_1 + all_active_2)) AND E (G ((((Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND (3 <= Mutex_1 + Mutex_2)) OR ((1 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2) AND (Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2)))))) : NOT(((E (G ((2 <= all_passive_1 + all_passive_2))) OR E (F ((3 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2)))) OR (A (G ((3 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2))) OR E (G ((1 <= all_active_1 + all_active_2)))))) : A (F (A (G (())))) : ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) AND NOT((E (G ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= all_active_1 + all_active_2))) AND A (X ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Mutex_1 + Mutex_2))))))
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 (X (((2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)))
lola: processed formula length: 215
lola: 1 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2) AND E (G (((3 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2))))) AND (((all_active_1 + all_active_2 <= 1) AND E (G ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Mod... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-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: E (G (((3 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 2) AND (updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 0))))
lola: processed formula length: 150
lola: 4 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= all_active_1 + all_active_2) OR (2 <= Mutex_1 + Mutex_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U ((all_active_1 + all_active_2 + 1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2) AND (Mutex_1 + Mutex_2 <= 1)))))
lola: processed formula length: 166
lola: 4 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((((2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND (2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2)) OR (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= Mutex_1 + Mutex_2)) OR A (X ((1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((((2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND (2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2)) OR (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= Mutex_1 + Mutex_2)) OR AX((1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))))
lola: processed formula length: 330
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((Mutex_1 + Mutex_2 <= 2) OR (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 + 1 <= all_passive_1 + all_passive_2)) OR E (X ((Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= all_passive_1 + all_passive_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((3 <= Mutex_1 + Mutex_2) AND (all_passive_1 + all_passive_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)) AND NOT(EX((Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= all_passive_1 + all_passive_2))))))
lola: processed formula length: 242
lola: 4 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= all_passive_1 + all_passive_2) AND (2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) AND ((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 2) OR (2 <= all_passive_1 + all_passive_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= all_passive_1 + all_passive_2) AND (2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) AND ((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 2) OR (2 <= all_passive_1 + all_passive_2)))
lola: processed formula length: 211
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: processed formula with 4 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: NOT(A (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= 0) U (2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= 0) U (2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)))
lola: processed formula length: 151
lola: 7 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: NOT(A (G (E (F ((all_passive_1 + all_passive_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2))))))
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 (all_passive_1 + all_passive_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2))))
lola: processed formula length: 117
lola: 8 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2)
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((((3 <= all_active_1 + all_active_2) AND (all_passive_1 + all_passive_2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2)) OR (RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 + 1 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)) OR E (G ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((((3 <= all_active_1 + all_active_2) AND (all_passive_1 + all_passive_2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2)) OR (RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 + 1 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)) OR NOT(A(TRUE U (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 + 1 <= updating_1_1 + updating_2_1 +... (shortened)
lola: processed formula length: 433
lola: 3 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2)
lola: processed formula length: 116
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 + 1 <= Mutex_1 + Mutex_2) AND (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)) OR (3 <= all_active_1 + all_active_2)) AND E (G ((((Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND (3 <= Mutex_1 + Mutex_2)) OR ((1 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 + 1 <= Mutex_1 + Mutex_2) AND (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)) OR (3 <= all_active_1 + all_active_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 + 1 <= Mutex_1 + Mutex_2) AND (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)) OR (3 <= all_active_1 + all_active_2))
lola: processed formula length: 188
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: processed formula with 3 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((2 <= all_passive_1 + all_passive_2))) OR E (F ((3 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2)))) OR (A (G ((3 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2))) OR E (G ((1 <= all_active_1 + all_active_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((all_passive_1 + all_passive_2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (all_passive_1 + all_passive_2 <= 1))
lola: processed formula length: 46
lola: 17 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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 DatabaseWithMutex-COL-02-CTLCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
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: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) AND NOT((E (G ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= all_active_1 + all_active_2))) AND A (X ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Mutex_1 + Mutex_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2)
lola: processed formula length: 128
lola: 7 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-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: Child process aborted or communication problem between parent and child process
sara: try reading problem file DatabaseWithMutex-COL-02-CTLCardinality-14.sara.
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((Mutex_1 + Mutex_2 + 1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Mutex_1 + Mutex_2 + 1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2))
lola: processed formula length: 104
lola: 8 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: SUBRESULT
lola: ========================================
result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no yes no yes no yes no unknown yes unknown
sara: place or transition ordering is non-deterministic

FORMULA DatabaseWithMutex-COL-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-COL-02-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496447570343

--------------------
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_DatabaseWithMutex-PT-02"
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_DatabaseWithMutex-PT-02.tgz
mv S_DatabaseWithMutex-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DatabaseWithMutex-PT-02, 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 r098-ebro-149488455600174"
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 ;