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 224K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 29K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DatabaseWithMutex-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949200038
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527403019902


BK_STOP 1527403062636

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DatabaseWithMutex-PT-02 as instance name.
Using DatabaseWithMutex as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 129, 'Memory': 101.45, 'Tool': 'gspn'}, {'Time': 235, 'Memory': 106.61, 'Tool': 'lola'}, {'Time': 438, 'Memory': 104.93, 'Tool': 'lola'}, {'Time': 3627, 'Memory': 160.93, 'Tool': 'gspn'}, {'Time': 4333, 'Memory': 2205.68, 'Tool': 'marcie'}, {'Time': 4687, 'Memory': 2205.31, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.821705426356589x far from the best tool gspn.
CTLCardinality lola DatabaseWithMutex-PT-02...

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


checking for too many tokens
===========================================================================================
DatabaseWithMutex-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DatabaseWithMutex-PT-02 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-PT-02-CTLCardinality.task
lola: A ((E (X ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))) U (2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2))) : (Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) : (2 <= Mutex_1 + Mutex_2) : A (F (NOT(A (G ((3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)))))) : ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 0) AND A (X (A (X ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)))))) : A (F ((((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) AND (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND ((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2) OR (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2))) OR A (X ((RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)))))) : A (X ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 + 1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2))) : (RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 0) : (WaitMutex_2_1 <= RecBuff_2_2) : ((3 <= updating_2_2) OR (() OR A (F ((Mutex_1 <= Modify_1_1))))) : E (F (((all_active_1 <= 1) OR (RecBuff_2_2 <= 2)))) : NOT(NOT(((MesBuffReply_2_2 + 1 <= updating_1_2) AND E (X ((2 <= WaitMutex_2_1)))))) : (Modify_1_2 <= RecBuff_1_1) : ((((3 <= Mutex_1) OR (3 <= Acknowledge_2_1) OR ((MesBuffReply_2_1 <= Mutex_1) AND (1 <= RecBuff_2_1)) OR (all_passive_1 + 1 <= RecBuff_2_1)) AND E (F ((2 <= all_active_2)))) AND E (F (E (G (TRUE))))) : E ((A (G ((updating_2_2 <= Message_1_2))) U (2 <= MesBuffReply_1_2))) : NOT((((1 <= Active_1_1) AND ((Message_1_1 + 1 <= Modify_1_1) OR (Message_2_2 <= 2))) AND E (((2 <= Active_1_2) U (2 <= WaitMutex_1_1)))))
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 ((E (X ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))) U (2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)) U (2 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2))
lola: processed formula length: 206
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)
lola: processed formula length: 108
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= Mutex_1 + Mutex_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Mutex_1 + Mutex_2)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (G ((3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= 2)))
lola: processed formula length: 88
lola: 5 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 0) AND A (X (A (X ((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 a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 <= 0)
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (X ((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(AX((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: 148
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) AND (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND ((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2) OR (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2))) OR A (X (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2 <= Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2) AND (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2) AND ((Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2) OR (3 <= Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2))) OR AX(... (shortened)
lola: processed formula length: 523
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 + 1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 + 1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)))
lola: processed formula: A (X ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 + 1 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2)))
lola: processed formula length: 140
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2 <= 0)
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (WaitMutex_2_1 <= RecBuff_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (WaitMutex_2_1 <= RecBuff_2_2)
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= updating_2_2) OR (() OR A (F ((Mutex_1 <= Modify_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((all_active_1 <= 1) OR (RecBuff_2_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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(((MesBuffReply_2_2 + 1 <= updating_1_2) AND E (X ((2 <= WaitMutex_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (MesBuffReply_2_2 + 1 <= updating_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MesBuffReply_2_2 + 1 <= updating_1_2)
lola: processed formula length: 38
lola: 10 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Modify_1_2 <= RecBuff_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Modify_1_2 <= RecBuff_1_1)
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= Mutex_1) OR (3 <= Acknowledge_2_1) OR ((MesBuffReply_2_1 <= Mutex_1) AND (1 <= RecBuff_2_1)) OR (all_passive_1 + 1 <= RecBuff_2_1)) AND E (F ((2 <= all_active_2)))) AND E (F (E (G (TRUE)))))
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: ((3 <= Mutex_1) OR (3 <= Acknowledge_2_1) OR ((MesBuffReply_2_1 <= Mutex_1) AND (1 <= RecBuff_2_1)) OR (all_passive_1 + 1 <= RecBuff_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= Mutex_1) OR (3 <= Acknowledge_2_1) OR ((MesBuffReply_2_1 <= Mutex_1) AND (1 <= RecBuff_2_1)) OR (all_passive_1 + 1 <= RecBuff_2_1))
lola: processed formula length: 141
lola: 7 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLCardinality.task
lola: processed formula with 5 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((updating_2_2 <= Message_1_2))) U (2 <= MesBuffReply_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (Message_1_2 + 1 <= updating_2_2))) U (2 <= MesBuffReply_1_2))
lola: processed formula length: 77
lola: 3 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((1 <= Active_1_1) AND ((Message_1_1 + 1 <= Modify_1_1) OR (Message_2_2 <= 2))) AND E (((2 <= Active_1_2) U (2 <= WaitMutex_1_1)))))
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: ((Active_1_1 <= 0) OR ((Modify_1_1 <= Message_1_1) AND (3 <= Message_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Active_1_1 <= 0) OR ((Modify_1_1 <= Message_1_1) AND (3 <= Message_2_2)))
lola: processed formula length: 76
lola: 6 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes no yes yes yes yes no yes no no yes
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-02.tgz
mv DatabaseWithMutex-PT-02 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 mcc4mcc-full"
echo " Input is 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 r082-blw3-152649949200038"
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 ;