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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949200039
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527403056911


BK_STOP 1527403099809

--------------------
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 voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', '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}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 107, 'Memory': 101.79, 'Tool': 'gspn'}, {'Time': 293, 'Memory': 105.16, 'Tool': 'lola'}, {'Time': 432, 'Memory': 106.99, 'Tool': 'lola'}, {'Time': 3393, 'Memory': 2204.89, 'Tool': 'marcie'}, {'Time': 3614, 'Memory': 160.18, 'Tool': 'gspn'}, {'Time': 3726, 'Memory': 2204.79, 'Tool': 'marcie'}, {'Time': 3931, 'Memory': 221.96, 'Tool': 'itstools'}, {'Time': 4028, 'Memory': 236, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.7383177570093458x far from the best tool gspn.
CTLFireability 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 CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ DatabaseWithMutex-PT-02 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-CTLFireability.task
lola: (NOT(((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) AND A (G (((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1)) AND (FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))))))) AND E (((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2) OR ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1)) AND (FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))) U (NOT FIREABLE(Update_1_2) AND NOT FIREABLE(Update_2_2) AND NOT FIREABLE(Update_1_1) AND NOT FIREABLE(Update_2_1) AND NOT FIREABLE(Update_1_2) AND NOT FIREABLE(Update_2_2) AND NOT FIREABLE(Update_1_1) AND NOT FIREABLE(Update_2_1))))) : ((((A (X ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))) OR (NOT FIREABLE(end_update_2_1) AND NOT FIREABLE(end_update_1_1) AND NOT FIREABLE(end_update_1_2) AND NOT FIREABLE(end_update_2_2) AND (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) AND (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)))) AND A (F ((NOT FIREABLE(SendReply_2_2) AND NOT FIREABLE(SendReply_1_2) AND NOT FIREABLE(SendReply_2_1) AND NOT FIREABLE(SendReply_1_1))))) AND E (F (A (G ((FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1))))))) OR (FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1))) : (((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)) OR NOT((E (X ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))) AND ((NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREABLE(Start_2_2) AND NOT FIREABLE(Start_1_2)) OR (NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREABLE(Start_2_2) AND NOT FIREABLE(Start_1_2)))))) AND NOT(NOT((A (F ((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)))) AND (FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1)))))) : ((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) OR ((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) AND E (X ((NOT FIREABLE(SendMsg_1_1) AND NOT FIREABLE(SendMsg_2_1) AND NOT FIREABLE(SendMsg_2_2) AND NOT FIREABLE(SendMsg_1_2)))))) : (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)) : A (X (NOT(A (F ((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1))))))) : A (X ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1)))) : (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)) : E (X (A ((FIREABLE(Update_2_2) U NOT FIREABLE(Acquire_2_1))))) : NOT(((FIREABLE(Acquire_1_1) AND FIREABLE(Release_2_1) AND (NOT FIREABLE(Acquire_2_1) OR NOT FIREABLE(SendMsg_2_1) OR NOT FIREABLE(SendReply_1_2))) OR (((NOT FIREABLE(SendMsg_1_2) AND (FIREABLE(Start_1_1))) AND E (F (FIREABLE(Change_1_1)))) OR (FIREABLE(SendReply_1_2) OR FIREABLE(Change_2_1) OR NOT FIREABLE(end_update_2_2) OR (FIREABLE(Release_2_2) AND FIREABLE(SendReply_2_2)))))) : FIREABLE(Start_1_1) : FIREABLE(Start_1_1) : NOT(A (G ((E (X (FIREABLE(SendMsg_1_1))) AND FIREABLE(SendMsg_1_1))))) : NOT(E (((FIREABLE(Start_1_2) AND FIREABLE(Change_2_1) AND (FIREABLE(end_update_1_2) OR FIREABLE(Start_2_2))) U (NOT FIREABLE(Acquire_2_1) OR NOT FIREABLE(Start_1_2))))) : E (G (FIREABLE(Update_2_2))) : A ((E ((FIREABLE(Change_2_2) U FIREABLE(Update_2_2))) U (NOT FIREABLE(SendReply_2_2) OR NOT FIREABLE(Change_2_2) OR NOT FIREABLE(Acquire_1_2) OR NOT FIREABLE(Release_2_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: (NOT(((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) AND A (G (((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1)) AND (FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))))))) AND E (((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(Update_1_2) AND NOT FIREABLE(Update_2_2) AND NOT FIREABLE(Update_1_1) AND NOT FIREABLE(Update_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(Update_1_2) AND NOT FIREABLE(Update_2_2) AND NOT FIREABLE(Update_1_1) AND NOT FIREABLE(Update_2_1))
lola: processed formula length: 113
lola: 5 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2) OR ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1)) AND (FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))) U (NOT FIREABLE(Update_1_2) AND NOT FIREABLE(Update_2_2) AND NOT FIREABLE(Update_1_1) AND NO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2) OR ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1)) AND (FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))) U (NOT FIREABLE(Update_1_2) AND NOT FIREABLE(Update_2_2) AND NOT FIREABLE(Update_1_1) AND NOT ... (shortened)
lola: processed formula length: 538
lola: 6 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((A (X ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))) OR (NOT FIREABLE(end_update_2_1) AND NOT FIREABLE(end_update_1_1) AND NOT FIREABLE(end_update_1_2) AND NOT FIREABLE(end_update_2_2) AND (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) AND (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2))))
lola: processed formula: A (X ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2))))
lola: processed formula length: 101
lola: 1 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(SendReply_2_2) AND NOT FIREABLE(SendReply_1_2) AND NOT FIREABLE(SendReply_2_1) AND NOT FIREABLE(SendReply_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(SendReply_2_2) AND NOT FIREABLE(SendReply_1_2) AND NOT FIREABLE(SendReply_2_1) AND NOT FIREABLE(SendReply_1_1))))
lola: processed formula: A (F ((NOT FIREABLE(SendReply_2_2) AND NOT FIREABLE(SendReply_1_2) AND NOT FIREABLE(SendReply_2_1) AND NOT FIREABLE(SendReply_1_1))))
lola: processed formula length: 133
lola: 1 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1))))))
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 (NOT FIREABLE(SendReply_2_2) AND NOT FIREABLE(SendReply_1_2) AND NOT FIREABLE(SendReply_2_1) AND NOT FIREABLE(SendReply_1_1)))))
lola: processed formula length: 150
lola: 4 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: 135 markings, 374 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1))
lola: processed formula length: 101
lola: 1 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
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: (((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)) OR NOT((E (X ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))) AND ((NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREABLE(Start_2_2) AND NOT FIREABLE(Start_1_2)) OR (NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))
lola: processed formula length: 101
lola: 15 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREABLE(Start_2_2) AND NOT FIREABLE(Start_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREABLE(Start_2_2) AND NOT FIREABLE(Start_1_2))))
lola: processed formula: A (X ((NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREABLE(Start_2_2) AND NOT FIREABLE(Start_1_2))))
lola: processed formula length: 117
lola: 15 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)) AND (FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)) AND (FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))
lola: processed formula length: 193
lola: 15 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))))
lola: processed formula: A (F ((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))))
lola: processed formula length: 109
lola: 15 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1))
lola: processed formula length: 109
lola: 15 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) OR ((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) AND E (X ((NOT FIREABLE(SendMsg_1_1) AND NOT FIREABLE(SendMsg_2_1) AND NOT FIREABLE(SendMsg_2_2) AND NOT FIREABLE(SendMsg_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))
lola: processed formula length: 101
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (F ((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1)))))
lola: processed formula length: 120
lola: 6 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: 68 markings, 102 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1))))
lola: processed formula: A (X ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1))))
lola: processed formula length: 105
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2))
lola: processed formula length: 101
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A ((FIREABLE(Update_2_2) U NOT FIREABLE(Acquire_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(FIREABLE(Update_2_2) U NOT FIREABLE(Acquire_2_1)))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(Acquire_1_1) AND FIREABLE(Release_2_1) AND (NOT FIREABLE(Acquire_2_1) OR NOT FIREABLE(SendMsg_2_1) OR NOT FIREABLE(SendReply_1_2))) OR (((NOT FIREABLE(SendMsg_1_2) AND (FIREABLE(Start_1_1))) AND E (F (FIREABLE(Change_1_1)))) OR (FIREABLE(SendReply_1_2) OR FIREABLE(Change_2_1) OR NOT FIREABLE(end_update_2_2) OR (FIREABLE(Release_2_2) AND FIREABLE(SendReply_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(Acquire_1_1) OR NOT FIREABLE(Release_2_1) OR (FIREABLE(Acquire_2_1) AND FIREABLE(SendMsg_2_1) AND FIREABLE(SendReply_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(Acquire_1_1) OR NOT FIREABLE(Release_2_1) OR (FIREABLE(Acquire_2_1) AND FIREABLE(SendMsg_2_1) AND FIREABLE(SendReply_1_2)))
lola: processed formula length: 139
lola: 9 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(SendMsg_1_2) OR (NOT FIREABLE(Start_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(SendMsg_1_2) OR (NOT FIREABLE(Start_1_1)))
lola: processed formula length: 53
lola: 9 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(Change_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Start_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Start_1_1)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Start_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Start_1_1)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((E (X (FIREABLE(SendMsg_1_1))) AND FIREABLE(SendMsg_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (NOT FIREABLE(SendMsg_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(NOT FIREABLE(SendMsg_1_1)))
lola: processed formula length: 39
lola: 12 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((FIREABLE(Start_1_2) AND FIREABLE(Change_2_1) AND (FIREABLE(end_update_1_2) OR FIREABLE(Start_2_2))) U (NOT FIREABLE(Acquire_2_1) OR NOT FIREABLE(Start_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((NOT FIREABLE(Start_1_2) OR NOT FIREABLE(Change_2_1) OR (NOT FIREABLE(end_update_1_2) AND NOT FIREABLE(Start_2_2))) R (FIREABLE(Acquire_2_1) AND FIREABLE(Start_1_2))))
lola: processed formula: A (((NOT FIREABLE(Start_1_2) OR NOT FIREABLE(Change_2_1) OR (NOT FIREABLE(end_update_1_2) AND NOT FIREABLE(Start_2_2))) R (FIREABLE(Acquire_2_1) AND FIREABLE(Start_1_2))))
lola: processed formula length: 173
lola: 4 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 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: using ltl preserving stubborn set method (--stubborn)
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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(Update_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(Update_2_2)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E ((FIREABLE(Change_2_2) U FIREABLE(Update_2_2))) U (NOT FIREABLE(SendReply_2_2) OR NOT FIREABLE(Change_2_2) OR NOT FIREABLE(Acquire_1_2) OR NOT FIREABLE(Release_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(FIREABLE(Change_2_2) U FIREABLE(Update_2_2)) U (NOT FIREABLE(SendReply_2_2) OR NOT FIREABLE(Change_2_2) OR NOT FIREABLE(Acquire_1_2) OR NOT FIREABLE(Release_2_1)))
lola: processed formula length: 170
lola: 2 rewrites
lola: formula mentions 0 of 38 places; total mentions: 0
lola: closed formula file DatabaseWithMutex-PT-02-CTLFireability.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, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no yes no yes yes yes no no yes
FORMULA DatabaseWithMutex-PT-02-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- 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="DatabaseWithMutex-PT-02"
export BK_EXAMINATION="CTLFireability"
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 CTLFireability"
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-152649949200039"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;