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)
................
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 114K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DatabaseWithMutex-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936700045
=====================================================================

--------------------
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-PT-04-CTLCardinality-00
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-01
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-02
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-03
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-04
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-05
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-06
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-07
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-08
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-09
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-10
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-11
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-12
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-13
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-14
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526609476687

info: Time: 3600 - MCC
===========================================================================================
prep: translating DatabaseWithMutex-PT-04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DatabaseWithMutex-PT-04 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ DatabaseWithMutex-PT-04 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 268/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4480
lola: finding significant places
lola: 140 places, 128 transitions, 112 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 176 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-PT-04-CTLCardinality.task
lola: LP says that atomic proposition is always true: (all_active_4 + all_active_3 + all_active_2 + all_active_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)
lola: LP says that atomic proposition is always true: (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)
lola: LP says that atomic proposition is always false: (3 <= Active_3_1)
lola: LP says that atomic proposition is always false: (2 <= Message_2_3)
lola: LP says that atomic proposition is always false: (3 <= updating_3_1)
lola: LP says that atomic proposition is always false: (2 <= Acknowledge_3_4)
lola: LP says that atomic proposition is always false: (3 <= WaitMutex_1_4)
lola: NOT(E (F (E (X ((2 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)))))) : A ((((all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= 2) OR (RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 <= 1)) U (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + 1 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4))) : A (G ((((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= 2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= 1)) OR E (F (TRUE))))) : (A (F (((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4 + 1 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4) OR ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4) AND (3 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4))))) OR A ((((3 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) OR (1 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4)) U ((all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4) AND (Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4))))) : E (G ((A (X ((1 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4))) OR (RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 <= 0)))) : NOT(E (G ((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + 1 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)))) : A (F (((all_active_4 + all_active_3 + all_active_2 + all_active_1 <= 2) AND (Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 <= 1) AND ((RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 <= 2) OR (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 + 1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4))))) : (A (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4))) OR ((A (G (TRUE)) AND ((Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 <= 2) AND (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= 0))) AND (E (X ((2 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4))) OR E (X ((all_active_4 + all_active_3 + all_active_2 + all_active_1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)))))) : A (G (NOT(A (F (FALSE))))) : E (G (((WaitMutex_3_3 <= updating_1_3) AND (RecBuff_2_2 <= WaitMutex_1_3)))) : E (X (E (F (FALSE)))) : E (F (())) : E (((Message_4_2 <= MesBuffReply_3_3) U ((1 <= WaitMutex_1_4) AND (1 <= Acknowledge_1_3) AND (MesBuffReply_2_4 <= 0)))) : E (F (FALSE)) : E ((A (F ((RecBuff_4_3 <= Active_3_2))) U A (G (FALSE)))) : E (X (NOT(A (G ((Acknowledge_1_4 <= WaitMutex_4_1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4))) OR (((Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 <= 2) AND (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 <= 2) AND (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 +... (shortened)
lola: processed formula length: 431
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)))
lola: processed formula length: 288
lola: 45 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 + 1 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((2 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4))
lola: processed formula length: 232
lola: 44 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((all_active_4 + all_active_3 + all_active_2 + all_active_1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((all_active_4 + all_active_3 + all_active_2 + all_active_1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4))
lola: processed formula length: 288
lola: 44 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (2 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)
lola: processed formula length: 244
lola: 45 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((1 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4))) OR (RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(AX((1 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4))) AND (1 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + ... (shortened)
lola: processed formula length: 471
lola: 47 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 126 markings, 138 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((WaitMutex_4_1 + 1 <= Acknowledge_1_4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (WaitMutex_4_1 + 1 <= Acknowledge_1_4)
lola: processed formula length: 38
lola: 44 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((WaitMutex_3_3 <= updating_1_3) AND (RecBuff_2_2 <= WaitMutex_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((WaitMutex_3_3 <= updating_1_3) AND (RecBuff_2_2 <= WaitMutex_1_3))))
lola: processed formula length: 76
lola: 43 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 62 markings, 62 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + 1 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)
lola: processed formula length: 276
lola: 45 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 20 markings, 20 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((all_active_4 + all_active_3 + all_active_2 + all_active_1 <= 2) AND (Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 <= 1) AND ((RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((3 <= all_active_4 + all_active_3 + all_active_2 + all_active_1) OR (2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) OR ((3 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_... (shortened)
lola: processed formula length: 867
lola: 45 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 16 markings, 16 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((Message_4_2 <= MesBuffReply_3_3) U ((1 <= WaitMutex_1_4) AND (1 <= Acknowledge_1_3) AND (MesBuffReply_2_4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((Message_4_2 <= MesBuffReply_3_3) U ((1 <= WaitMutex_1_4) AND (1 <= Acknowledge_1_3) AND (MesBuffReply_2_4 <= 0))))
lola: processed formula length: 119
lola: 46 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((1 <= WaitMutex_1_4) AND (1 <= Acknowledge_1_3) AND (MesBuffReply_2_4 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 67 markings, 67 edges

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= 2) OR (RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 <= 1)) U (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= 2) OR (RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 <= 1)) U (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 ... (shortened)
lola: processed formula length: 748
lola: 47 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 55 markings, 55 edges

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4 + 1 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4 + 1 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2... (shortened)
lola: processed formula length: 1302
lola: 45 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 1341256 markings, 3565029 edges, 268251 markings/sec, 0 secs
lola: 2727731 markings, 7058738 edges, 277295 markings/sec, 5 secs
lola: 4166584 markings, 10667881 edges, 287771 markings/sec, 10 secs
lola: 5644852 markings, 14379255 edges, 295654 markings/sec, 15 secs
lola: 7285992 markings, 18034099 edges, 328228 markings/sec, 20 secs
lola: 8711960 markings, 21645512 edges, 285194 markings/sec, 25 secs
lola: 10047445 markings, 25176352 edges, 267097 markings/sec, 30 secs
lola: 11446829 markings, 28655128 edges, 279877 markings/sec, 35 secs
lola: 12887222 markings, 32176652 edges, 288079 markings/sec, 40 secs
lola: 14367993 markings, 35653897 edges, 296154 markings/sec, 45 secs
lola: 15764427 markings, 39184842 edges, 279287 markings/sec, 50 secs
lola: 17172775 markings, 42727665 edges, 281670 markings/sec, 55 secs
lola: 18554227 markings, 46202628 edges, 276290 markings/sec, 60 secs
lola: 19910646 markings, 49698662 edges, 271284 markings/sec, 65 secs
lola: 21351807 markings, 53099122 edges, 288232 markings/sec, 70 secs
lola: 22805423 markings, 56563894 edges, 290723 markings/sec, 75 secs
lola: 24224155 markings, 60120396 edges, 283746 markings/sec, 80 secs
lola: 25629177 markings, 63613127 edges, 281004 markings/sec, 85 secs
lola: 26948257 markings, 67068143 edges, 263816 markings/sec, 90 secs
lola: 28401047 markings, 70442957 edges, 290558 markings/sec, 95 secs
lola: 29725219 markings, 73810531 edges, 264834 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 30154273 markings, 75653376 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no no yes yes no no yes no no yes
lola:
preliminary result: no no yes yes yes no no no yes yes no no yes no no yes
lola: memory consumption: 23232 KB
lola: time consumption: 108 seconds

BK_STOP 1526609584610

--------------------
content from 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="DatabaseWithMutex-PT-04"
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/DatabaseWithMutex-PT-04.tgz
mv DatabaseWithMutex-PT-04 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is DatabaseWithMutex-PT-04, 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 r076-blw3-152649936700045"
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 ;