About the Execution of M4M.full for LamportFastMutEx-PT-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
424.420 | 45258.00 | 10388.00 | 200.30 | FFFFFTFFTTTFTTTT | normal |
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 248K
-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 3.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 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-full
Input is LamportFastMutEx-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r262-csrt-152732586700031
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527525102679
BK_STOP 1527525147937
--------------------
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 LamportFastMutEx-PT-2 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 121, 'Memory': 111.36, 'Tool': 'lola'}, {'Time': 227, 'Memory': 109.71, 'Tool': 'lola'}, {'Time': 2455, 'Memory': 266.99, 'Tool': 'itstools'}, {'Time': 2777, 'Memory': 229.84, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality 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 LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ LamportFastMutEx-PT-2 @ 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: 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-LTLCardinality.task
lola: A (((1 <= x_0 + x_1 + x_2) U G (F ((P-await_13_0 + P-await_13_1 + P-await_13_2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2))))) : A (F (G (X ((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2))))) : A ((1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)) : A (X (F (X (G ((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)))))) : A (G (X (G (X ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2)))))) : A (F ((X ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2)) U X ((P-awaity_0 + P-awaity_1 + P-awaity_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))))) : A ((X (G ((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0))) U (3 <= P-start_1_0 + P-start_1_1 + P-start_1_2))) : A ((2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)) : A (F (((P-wait_0_1 <= P-setx_3_1) U X ((P-b_0_false <= P-done_0_0))))) : A ((P-awaity_2 <= y_0)) : A ((P-setbi_5_0 <= P-b_0_false)) : A (G (F ((P-wait_1_1 <= P-setbi_5_1)))) : A (((P-setbi_24_1 <= P-setbi_11_1) U ((P-wait_2_2 <= P-wait_1_1) U (P-ifyi_15_0 <= P-wait_0_2)))) : A (X (F (((P-done_1_1 <= y_2) U (P-CS_21_2 <= P-b_0_false))))) : A ((P-ifxi_10_1 <= P-sety_9_2)) : A ((P-done_2_1 <= P-ify0_4_2))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= x_0 + x_1 + x_2) U G (F ((P-await_13_0 + P-await_13_1 + P-await_13_2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= x_0 + x_1 + x_2) U G (F ((P-await_13_0 + P-await_13_1 + P-await_13_2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)))))
lola: processed formula: A (((1 <= x_0 + x_1 + x_2) U G (F ((P-await_13_0 + P-await_13_1 + P-await_13_2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)))))
lola: processed formula length: 201
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 9 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: 179 markings, 289 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X ((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)))))
lola: processed formula: A (F (G (X ((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)))))
lola: processed formula length: 137
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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: 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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (G ((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (G ((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0))))))
lola: processed formula: A (X (F (X (G ((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0))))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 9 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (X ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2))))))
lola: processed formula: A (G (X (G (X ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2))))))
lola: processed formula length: 101
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 9 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: 36 markings, 36 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2)) U X ((P-awaity_0 + P-awaity_1 + P-awaity_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 (X (((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2) U (P-awaity_0 + P-awaity_1 + P-awaity_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 (X (((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2) U (P-awaity_0 + P-awaity_1 + P-awaity_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: 221
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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: 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0))) U (3 <= P-start_1_0 + P-start_1_1 + P-start_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0))) U (3 <= P-start_1_0 + P-start_1_1 + P-start_1_2)))
lola: processed formula: A ((X (G ((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0))) U (3 <= P-start_1_0 + P-start_1_1 + P-start_1_2)))
lola: processed formula length: 216
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= 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-LTLCardinality.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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((P-wait_0_1 <= P-setx_3_1) U X ((P-b_0_false <= P-done_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((P-wait_0_1 <= P-setx_3_1) U X ((P-b_0_false <= P-done_0_0)))))
lola: processed formula: A (F (((P-wait_0_1 <= P-setx_3_1) U X ((P-b_0_false <= P-done_0_0)))))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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: 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P-awaity_2 <= y_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-awaity_2 <= y_0)
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P-setbi_5_0 <= P-b_0_false))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-setbi_5_0 <= P-b_0_false)
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((P-wait_1_1 <= P-setbi_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((P-wait_1_1 <= P-setbi_5_1))))
lola: processed formula: A (G (F ((P-wait_1_1 <= P-setbi_5_1))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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: 111 markings, 173 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((P-setbi_24_1 <= P-setbi_11_1) U ((P-wait_2_2 <= P-wait_1_1) U (P-ifyi_15_0 <= P-wait_0_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((P-setbi_24_1 <= P-setbi_11_1) U ((P-wait_2_2 <= P-wait_1_1) U (P-ifyi_15_0 <= P-wait_0_2))))
lola: processed formula: A (((P-setbi_24_1 <= P-setbi_11_1) U ((P-wait_2_2 <= P-wait_1_1) U (P-ifyi_15_0 <= P-wait_0_2))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((P-done_1_1 <= y_2) U (P-CS_21_2 <= P-b_0_false)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((P-done_1_1 <= y_2) U (P-CS_21_2 <= P-b_0_false)))))
lola: processed formula: A (X (F (((P-done_1_1 <= y_2) U (P-CS_21_2 <= P-b_0_false)))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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: 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P-ifxi_10_1 <= P-sety_9_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-ifxi_10_1 <= P-sety_9_2)
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P-done_2_1 <= P-ify0_4_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-done_2_1 <= P-ify0_4_2)
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.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: RESULT
lola:
SUMMARY: no no no no no yes no no yes yes yes no yes yes yes yes
----- Kill lola and sara stderr -----
FORMULA LamportFastMutEx-PT-2-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="LamportFastMutEx-PT-2"
export BK_EXAMINATION="LTLCardinality"
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/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-full"
echo " Input is LamportFastMutEx-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r262-csrt-152732586700031"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;