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 244K
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 46K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is LamportFastMutEx-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-csrt-152666479500108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527319072555


BK_STOP 1527319116316

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using LamportFastMutEx-PT-2 as instance name.
Using LamportFastMutEx 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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 116, 'Memory': 110.62, 'Tool': 'lola'}, {'Time': 223, 'Memory': 111.51, 'Tool': 'lola'}, {'Time': 299, 'Memory': 102.63, 'Tool': 'gspn'}, {'Time': 1939, 'Memory': 168.3, 'Tool': 'gspn'}, {'Time': 2499, 'Memory': 2206.33, 'Tool': 'marcie'}, {'Time': 2578, 'Memory': 2206.45, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola LamportFastMutEx-PT-2...

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


checking for too many tokens
===========================================================================================
LamportFastMutEx-PT-2: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ LamportFastMutEx-PT-2 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-2-CTLCardinality.task
lola: A (F ((1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2))) : (NOT(NOT(A (F ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true))))) OR (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + 1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2)) : (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true) : ((3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) AND (E (G ((x_0 + x_1 + x_2 <= 1))) OR E (F (((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 <= y_0 + y_1 + y_2) OR (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)))))) : ((3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2) OR (((2 <= y_0 + y_1 + y_2) OR E (X ((3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)))) OR (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-await_13_0 + P-await_13_1 + P-await_13_2))) : (2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2) : NOT(E (F (A (X ((P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)))))) : A (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2))) : ((NOT(A (F ((P-wait_0_1 <= P-wait_0_2)))) OR ((P-setbi_11_0 <= 1) OR (P-setx_3_0 + 1 <= y_2) OR (P-wait_2_0 <= 2))) OR ((P-fordo_12_2 + 1 <= P-setbi_11_0) AND (P-b_0_false + 1 <= P-done_1_1))) : NOT(E (((3 <= P-done_2_2) U (P-wait_0_1 <= 2)))) : (P-done_0_0 + 1 <= P-ifxi_10_0) : ((x_2 + 1 <= P-done_0_2) AND (P-ifxi_10_2 <= P-done_0_0) AND (((P-CS_21_0 <= 1) AND (P-setbi_5_1 <= 1))) AND (P-ifyi_15_2 + 1 <= P-setbi_5_0)) : E (((P-setx_3_0 <= y_0) U E (F ((P-wait_1_1 <= P-done_0_1))))) : E (G (E (G (((2 <= P-b_1_false) OR (1 <= P-setbi_11_1)))))) : (((y_0 + 1 <= P-done_1_0) AND (P-awaity_0 <= P-done_0_1) AND ((P-setbi_11_2 <= 1) OR (P-wait_2_1 <= 1) OR (P-CS_21_2 + 1 <= P-done_1_0))) AND ((A (X ((P-fordo_12_0 <= P-done_1_2))) AND (1 <= P-setbi_11_1)) OR (((P-b_2_true <= P-ify0_4_1) AND (P-CS_21_0 <= P-done_0_0) AND (P-wait_1_2 + 1 <= P-awaity_0)) OR (P-awaity_2 <= P-sety_9_0)))) : E (((P-wait_1_1 <= y_0) U A (X ((P-ifyi_15_0 <= P-ifxi_10_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 (F ((1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)))
lola: processed formula: A (F ((1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 11 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (F ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true))))) OR (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + 1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2))
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 (F ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)))
lola: processed formula: A (F ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)))
lola: processed formula length: 134
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 11 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)
lola: processed formula length: 130
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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: ((3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) AND (E (G ((x_0 + x_1 + x_2 <= 1))) OR E (F (((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 <= y_0 + y_1 + y_2) OR (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_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: (3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2)
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2) OR (((2 <= y_0 + y_1 + y_2) OR E (X ((3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)))) OR (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-await_13_0 + P-await_13_1 + P-await_13_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= y_0 + y_1 + y_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= y_0 + y_1 + y_2)
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-await_13_0 + P-await_13_1 + P-await_13_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-await_13_0 + P-await_13_1 + P-await_13_2)
lola: processed formula length: 90
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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: 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: (2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)))))
lola: processed formula length: 154
lola: 7 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 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: 380 markings, 716 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)))
lola: processed formula: A (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)))
lola: processed formula length: 89
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 11 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((P-wait_0_1 <= P-wait_0_2)))) OR ((P-setbi_11_0 <= 1) OR (P-setx_3_0 + 1 <= y_2) OR (P-wait_2_0 <= 2))) OR ((P-fordo_12_2 + 1 <= P-setbi_11_0) AND (P-b_0_false + 1 <= P-done_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P-wait_0_2 + 1 <= P-wait_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (P-wait_0_1 <= P-wait_0_2)))
lola: processed formula length: 41
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P-setbi_11_0 <= 1) OR (P-setx_3_0 + 1 <= y_2) OR (P-wait_2_0 <= 2)) OR ((P-fordo_12_2 + 1 <= P-setbi_11_0) AND (P-b_0_false + 1 <= P-done_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((P-setbi_11_0 <= 1) OR (P-setx_3_0 + 1 <= y_2) OR (P-wait_2_0 <= 2)) OR ((P-fordo_12_2 + 1 <= P-setbi_11_0) AND (P-b_0_false + 1 <= P-done_1_1)))
lola: processed formula length: 149
lola: 5 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: processed formula with 5 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: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((3 <= P-done_2_2) U (P-wait_0_1 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((P-done_2_2 <= 2) R (3 <= P-wait_0_1)))
lola: processed formula: A (((P-done_2_2 <= 2) R (3 <= P-wait_0_1)))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 10 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-done_0_0 + 1 <= P-ifxi_10_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-done_0_0 + 1 <= P-ifxi_10_0)
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((x_2 + 1 <= P-done_0_2) AND (P-ifxi_10_2 <= P-done_0_0) AND (((P-CS_21_0 <= 1) AND (P-setbi_5_1 <= 1))) AND (P-ifyi_15_2 + 1 <= P-setbi_5_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((x_2 + 1 <= P-done_0_2) AND (P-ifxi_10_2 <= P-done_0_0) AND (((P-CS_21_0 <= 1) AND (P-setbi_5_1 <= 1))) AND (P-ifyi_15_2 + 1 <= P-setbi_5_0))
lola: processed formula length: 142
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P-setx_3_0 <= y_0) U E (F ((P-wait_1_1 <= P-done_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P-setx_3_0 <= y_0) U E(TRUE U (P-wait_1_1 <= P-done_0_1)))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (((2 <= P-b_1_false) OR (1 <= P-setbi_11_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U ((P-b_1_false <= 1) AND (P-setbi_11_1 <= 0)))))
lola: processed formula length: 69
lola: 4 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((y_0 + 1 <= P-done_1_0) AND (P-awaity_0 <= P-done_0_1) AND ((P-setbi_11_2 <= 1) OR (P-wait_2_1 <= 1) OR (P-CS_21_2 + 1 <= P-done_1_0))) AND ((A (X ((P-fordo_12_0 <= P-done_1_2))) AND (1 <= P-setbi_11_1)) OR (((P-b_2_true <= P-ify0_4_1) AND (P-CS_21_0 <= P-done_0_0) AND (P-wait_1_2 + 1 <= P-awaity_0)) OR (P-awaity_2 <= P-sety_9_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((y_0 + 1 <= P-done_1_0) AND (P-awaity_0 <= P-done_0_1) AND ((P-setbi_11_2 <= 1) OR (P-wait_2_1 <= 1) OR (P-CS_21_2 + 1 <= P-done_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((y_0 + 1 <= P-done_1_0) AND (P-awaity_0 <= P-done_0_1) AND ((P-setbi_11_2 <= 1) OR (P-wait_2_1 <= 1) OR (P-CS_21_2 + 1 <= P-done_1_0)))
lola: processed formula length: 138
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((P-wait_1_1 <= y_0) U A (X ((P-ifyi_15_0 <= P-ifxi_10_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P-wait_1_1 <= y_0) U AX((P-ifyi_15_0 <= P-ifxi_10_1)))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 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: RESULT
lola:
SUMMARY: yes yes yes no yes no yes yes yes no no no yes no no yes
FORMULA LamportFastMutEx-PT-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-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 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="LamportFastMutEx-PT-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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-structural"
echo " Input is LamportFastMutEx-PT-2, 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 r119-csrt-152666479500108"
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 ;