Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r099-smll-155246598300068.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is LamportFastMutEx-PT-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.1K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 11 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 7 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.6K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Jan 31 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jan 31 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 110K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552779187588

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-PT-4 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-PT-4 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-PT-4 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 365/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 135
lola: finding significant places
lola: 135 places, 230 transitions, 98 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 327 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-4-LTLCardinality.task
lola: LP says that atomic proposition is always true: (P-done_4_0 <= P-await_13_4)
lola: LP says that atomic proposition is always true: (P-wait_0_3 <= x_2)
lola: LP says that atomic proposition is always true: (P-wait_0_2 <= P-wait_2_1)
lola: LP says that atomic proposition is always true: (P-wait_0_4 <= P-done_1_2)
lola: A ((((P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4) U (1 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4)) U (2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4))) : A (X (F ((2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_0_3 + P-done_0_4 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4)))) : A (F (X (X ((P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4))))) : A (X ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4))) : A ((G (F ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4))) U X ((3 <= P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4)))) : A (G ((F ((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4)) U G ((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4))))) : A ((F (X ((3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4))) U (3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4))) : A (G (F (G (F ((1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4)))))) : A (F (X (G (G ((P-wait_3_4 <= P-setbi_5_1)))))) : A (TRUE) : A (X (TRUE)) : A ((F (X ((P-setbi_24_3 <= x_0))) U G (F ((P-b_3_true <= P-CS_21_2))))) : A ((P-done_4_2 <= P-setbi_5_3)) : A (X (F ((P-b_1_false <= P-await_13_2)))) : A ((G (F (TRUE)) U X ((P-b_2_false <= P-wait_3_3)))) : A (G ((G (TRUE) U G ((P-setbi_5_3 <= P-done_4_0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P-done_4_2 <= P-setbi_5_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-done_4_2 <= P-setbi_5_3)
lola: processed formula length: 27
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-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: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wai... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wai... (shortened)
lola: processed formula length: 408
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4)) OR (G (F ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setb... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4)) OR (G (F ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setb... (shortened)
lola: processed formula length: 845
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 26 markings, 26 edges
lola:
FORMULA LamportFastMutEx-PT-4-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4))) U (3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4))) U (3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4)))
lola: processed formula length: 165
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 26 markings, 26 edges
lola:
FORMULA LamportFastMutEx-PT-4-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_0_3 + P-done_0_4 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_0_3 + P-done_0_4 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4))))
lola: processed formula length: 341
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 26 markings, 26 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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:
FORMULA LamportFastMutEx-PT-4-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((P-wait_4_4 + P-wait_4_3 + P-wait_4_2 + P-wait_4_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_4_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P... (shortened)
lola: processed formula length: 416
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 15 markings, 20 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((P-b_1_false <= P-await_13_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P-b_1_false <= P-await_13_2))))
lola: processed formula length: 41
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 41 markings, 41 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((P-b_2_false <= P-wait_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P-b_2_false <= P-wait_3_3))))
lola: processed formula length: 39
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 42 markings, 42 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((P-b_3_true <= P-CS_21_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((P-b_3_true <= P-CS_21_2))))
lola: processed formula length: 37
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1651 markings, 3075 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P-wait_3_4 <= P-setbi_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P-wait_3_4 <= P-setbi_5_1))))
lola: processed formula length: 39
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 241 markings, 323 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P-setbi_5_3 <= P-done_4_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P-setbi_5_3 <= P-done_4_0))))
lola: processed formula length: 39
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 319 markings, 412 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4))))
lola: processed formula length: 81
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 232283 markings, 713402 edges, 46457 markings/sec, 0 secs
lola: 451991 markings, 1528431 edges, 43942 markings/sec, 5 secs
lola: 663696 markings, 2401770 edges, 42341 markings/sec, 10 secs
lola: 863460 markings, 3330369 edges, 39953 markings/sec, 15 secs
lola: 1055238 markings, 4333384 edges, 38356 markings/sec, 20 secs
lola: 1238987 markings, 5425922 edges, 36750 markings/sec, 25 secs
lola: 1419496 markings, 6565497 edges, 36102 markings/sec, 30 secs
lola: 1596608 markings, 7737384 edges, 35422 markings/sec, 35 secs
lola: 1778263 markings, 8931791 edges, 36331 markings/sec, 40 secs
lola: 1953142 markings, 10151286 edges, 34976 markings/sec, 45 secs
lola: 2134549 markings, 11351509 edges, 36281 markings/sec, 50 secs
lola: 2325159 markings, 12486903 edges, 38122 markings/sec, 55 secs
lola: 2535434 markings, 13536727 edges, 42055 markings/sec, 60 secs
lola: 2761169 markings, 14570851 edges, 45147 markings/sec, 65 secs
lola: 2988579 markings, 15614591 edges, 45482 markings/sec, 70 secs
lola: 3212265 markings, 16805347 edges, 44737 markings/sec, 75 secs
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: 3291738 markings, 17602932 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4) U (1 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4)) U (2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4) U (1 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4)) U (2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4)))
lola: processed formula length: 302
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 71 markings, 71 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4)))) AND A (G ((F ((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4)) OR G ((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 <= P-ify0_4_0 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4))))
lola: processed formula length: 152
lola: 28 rewrites
lola: closed formula file LamportFastMutEx-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 144 markings, 153 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA LamportFastMutEx-PT-4-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no no yes no yes yes no yes no no no
lola:
preliminary result: no no yes yes no no no yes no yes yes no yes no no no
lola: memory consumption: 20036 KB
lola: time consumption: 83 seconds

BK_STOP 1552779270603

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-4"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is LamportFastMutEx-PT-4, 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 r099-smll-155246598300068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 '' LTLCardinality.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 ;