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.r143-smll-155284920900138.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 RefineWMG-PT-100101, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-155284920900138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 3.8K Feb 12 14:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 14:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 16:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 8 16:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 217K 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 RefineWMG-PT-100-101-LTLFireability-00
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-01
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-02
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-03
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-04
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-05
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-06
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-07
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-08
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-09
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-10
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-11
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-12
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-13
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-14
FORMULA_NAME RefineWMG-PT-100-101-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553026602855

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-100101 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-100101 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RefineWMG-PT-100101 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 907/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-100-101-LTLFireability.task
lola: A ((X (X (X (FIREABLE(t328)))) U FIREABLE(t206))) : A ((F (X (G (FIREABLE(t187)))) U X (FIREABLE(t188)))) : A (FIREABLE(t248)) : A (X ((F (F (FIREABLE(t34))) U G (F (FIREABLE(t232)))))) : A (F (X (G ((FIREABLE(t233) U FIREABLE(t88)))))) : A (F (FIREABLE(t93))) : A (X (F ((F (FIREABLE(t277)) U FIREABLE(t354))))) : A (FIREABLE(t282)) : A (G (F (FIREABLE(t372)))) : A (G (G ((F (FIREABLE(t296)) U FIREABLE(t75))))) : A (FIREABLE(t232)) : A (G (FIREABLE(t356))) : A (G (F (G (G (X (FIREABLE(t391))))))) : A (X (X ((X (FIREABLE(t163)) U G (FIREABLE(t220)))))) : A (G (X (F (F (G (FIREABLE(t157))))))) : A (F ((F (F (FIREABLE(t202))) U F (G (FIREABLE(t106))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t248)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t248)
lola: processed formula length: 14
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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 RefineWMG-PT-100-101-LTLFireability-2 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: FIREABLE(t282)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t282)
lola: processed formula length: 14
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-7 FALSE 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: FIREABLE(t232)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t232)
lola: processed formula length: 14
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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 RefineWMG-PT-100-101-LTLFireability-10 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 (F (FIREABLE(t354))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t354))))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: 104 markings, 104 edges

FORMULA RefineWMG-PT-100-101-LTLFireability-6 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 (FIREABLE(t188)) OR (X (F (FIREABLE(t188))) AND F (G (FIREABLE(t187))))))
lola: lola: ========================================
========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(t188)) OR (X (F (FIREABLE(t188))) AND F (G (FIREABLE(t187))))))
lola: processed formula length: 79
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.task
lola: the resulting Büchi automaton has 6 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: 203 markings, 202 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-1 TRUE 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 (X (X (FIREABLE(t328)))) U FIREABLE(t206)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (X (FIREABLE(t328)))) U FIREABLE(t206)))
lola: processed formula length: 49
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.task
lola: the resulting Büchi automaton has 5 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: 468238 markings, 934016 edges, 93648 markings/sec, 0 secs
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: 551772 markings, 1102722 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-0 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 (X ((X (FIREABLE(t163)) U G (FIREABLE(t220))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((X (FIREABLE(t163)) U G (FIREABLE(t220))))))
lola: processed formula length: 53
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 602166 markings, 906171 edges, 120433 markings/sec, 0 secs
lola: 1231925 markings, 1853900 edges, 125952 markings/sec, 5 secs
lola: 1814703 markings, 2730953 edges, 116556 markings/sec, 10 secs
lola: 2406133 markings, 3621033 edges, 118286 markings/sec, 15 secs
lola: 3021511 markings, 4547124 edges, 123076 markings/sec, 20 secs
lola: 3620698 markings, 5448881 edges, 119837 markings/sec, 25 secs
lola: 4182367 markings, 6294219 edges, 112334 markings/sec, 30 secs
lola: 4784082 markings, 7199726 edges, 120343 markings/sec, 35 secs
lola: 5394689 markings, 8118614 edges, 122121 markings/sec, 40 secs
lola: 5961591 markings, 8971769 edges, 113380 markings/sec, 45 secs
lola: 6527753 markings, 9823881 edges, 113232 markings/sec, 50 secs
lola: 7141664 markings, 10747771 edges, 122782 markings/sec, 55 secs
lola: 7748271 markings, 11660655 edges, 121321 markings/sec, 60 secs
lola: 8310247 markings, 12506405 edges, 112395 markings/sec, 65 secs
lola: 8899473 markings, 13393195 edges, 117845 markings/sec, 70 secs
lola: 9507673 markings, 14308487 edges, 121640 markings/sec, 75 secs
lola: 10085521 markings, 15178123 edges, 115570 markings/sec, 80 secs
lola: 10638800 markings, 16010829 edges, 110656 markings/sec, 85 secs
lola: 11180344 markings, 16825762 edges, 108309 markings/sec, 90 secs
lola: 11738368 markings, 17665590 edges, 111605 markings/sec, 95 secs
lola: 12284407 markings, 18487324 edges, 109208 markings/sec, 100 secs
lola: 12818570 markings, 19291285 edges, 106833 markings/sec, 105 secs
lola: 13353022 markings, 20095569 edges, 106890 markings/sec, 110 secs
lola: 13907641 markings, 20930188 edges, 110924 markings/sec, 115 secs
lola: 14447674 markings, 21742964 edges, 108007 markings/sec, 120 secs
lola: 14979047 markings, 22542663 edges, 106275 markings/sec, 125 secs
lola: 15502829 markings, 23330921 edges, 104756 markings/sec, 130 secs
lola: 16048731 markings, 24152435 edges, 109180 markings/sec, 135 secs
lola: 16579690 markings, 24951557 edges, 106192 markings/sec, 140 secs
lola: 17104725 markings, 25741718 edges, 105007 markings/sec, 145 secs
lola: 17638776 markings, 26545368 edges, 106810 markings/sec, 150 secs
lola: 18193213 markings, 27379751 edges, 110887 markings/sec, 155 secs
lola: 18725525 markings, 28180924 edges, 106462 markings/sec, 160 secs
lola: 19250050 markings, 28970344 edges, 104905 markings/sec, 165 secs
lola: 19768615 markings, 29750739 edges, 103713 markings/sec, 170 secs
lola: 20306452 markings, 30560087 edges, 107567 markings/sec, 175 secs
lola: 20830312 markings, 31348510 edges, 104772 markings/sec, 180 secs
lola: 21347693 markings, 32127149 edges, 103476 markings/sec, 185 secs
lola: 21865034 markings, 32905682 edges, 103468 markings/sec, 190 secs
lola: 22401700 markings, 33713317 edges, 107333 markings/sec, 195 secs
lola: 22923429 markings, 34498528 edges, 104346 markings/sec, 200 secs
lola: 23433530 markings, 35266244 edges, 102020 markings/sec, 205 secs
lola: 23940331 markings, 36028877 edges, 101360 markings/sec, 210 secs
lola: 24413640 markings, 36742592 edges, 94662 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t356)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t356)))
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t356)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to RefineWMG-PT-100-101-LTLFireability-7-0.sara
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola:
FORMULA RefineWMG-PT-100-101-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t93)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t93)
lola: processed formula length: 17
lola: 33 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola:
========================================FORMULA RefineWMG-PT-100-101-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t372))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t372))))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: 984 markings, 1733 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t391))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t391))))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: add low 400
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: 8 markings, 9 edges
lola: ========================================
FORMULA RefineWMG-PT-100-101-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 11 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t232))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t232))))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: 5359 markings, 9853 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t157))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t157))))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: add low 400
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: 8 markings, 9 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t106))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t106))))
lola: processed formula length: 26
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: add low 400
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: 8 markings, 9 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (FIREABLE(t88)) AND (FIREABLE(t233) OR FIREABLE(t88))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (FIREABLE(t88)) AND (FIREABLE(t233) OR FIREABLE(t88))))))
lola: processed formula length: 69
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: 424062 markings, 841740 edges, 84812 markings/sec, 0 secs
lola: add low 400
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: 489625 markings, 972050 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(t75)))) AND A (G ((F (FIREABLE(t296)) OR FIREABLE(t75)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t75))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t75))))
lola: processed formula length: 25
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RefineWMG-PT-100-101-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X ((X (FIREABLE(t163)) U G (FIREABLE(t220))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((X (FIREABLE(t163)) U G (FIREABLE(t220))))))
lola: processed formula length: 53
lola: 31 rewrites
lola: closed formula file RefineWMG-PT-100-101-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 600564 markings, 903767 edges, 120113 markings/sec, 0 secs
lola: 1227419 markings, 1847124 edges, 125371 markings/sec, 5 secs
lola: 1803692 markings, 2714370 edges, 115255 markings/sec, 10 secs
lola: 2387167 markings, 3592503 edges, 116695 markings/sec, 15 secs
lola: 3001914 markings, 4517634 edges, 122949 markings/sec, 20 secs
lola: 3603225 markings, 5422605 edges, 120262 markings/sec, 25 secs
lola: 4163947 markings, 6266459 edges, 112144 markings/sec, 30 secs
lola: 4763831 markings, 7169281 edges, 119977 markings/sec, 35 secs
lola: 5374259 markings, 8087868 edges, 122086 markings/sec, 40 secs
lola: 5941334 markings, 8941313 edges, 113415 markings/sec, 45 secs
lola: 6504597 markings, 9789012 edges, 112653 markings/sec, 50 secs
lola: 7119172 markings, 10713940 edges, 122915 markings/sec, 55 secs
lola: 7728041 markings, 11630188 edges, 121774 markings/sec, 60 secs
lola: 8289790 markings, 12475641 edges, 112350 markings/sec, 65 secs
lola: 8876116 markings, 13358005 edges, 117265 markings/sec, 70 secs
lola: 9484257 markings, 14273213 edges, 121628 markings/sec, 75 secs
lola: 10064507 markings, 15146495 edges, 116050 markings/sec, 80 secs
lola: 10615865 markings, 15976280 edges, 110272 markings/sec, 85 secs
lola: 11157485 markings, 16791366 edges, 108324 markings/sec, 90 secs
lola: 11712255 markings, 17626287 edges, 110954 markings/sec, 95 secs
lola: 12259230 markings, 18449458 edges, 109395 markings/sec, 100 secs
lola: 12790849 markings, 19249527 edges, 106324 markings/sec, 105 secs
lola: 13324441 markings, 20052544 edges, 106718 markings/sec, 110 secs
lola: 13876250 markings, 20882978 edges, 110362 markings/sec, 115 secs
lola: 14415825 markings, 21695027 edges, 107915 markings/sec, 120 secs
lola: 14946320 markings, 22493402 edges, 106099 markings/sec, 125 secs
lola: 15471092 markings, 23283107 edges, 104954 markings/sec, 130 secs
lola: 16015212 markings, 24102000 edges, 108824 markings/sec, 135 secs
lola: 16546785 markings, 24902008 edges, 106315 markings/sec, 140 secs
lola: 17069968 markings, 25689376 edges, 104637 markings/sec, 145 secs
lola: 17603392 markings, 26492176 edges, 106685 markings/sec, 150 secs
lola: 18156882 markings, 27325071 edges, 110698 markings/sec, 155 secs
lola: 18690277 markings, 28127885 edges, 106679 markings/sec, 160 secs
lola: 19213802 markings, 28915735 edges, 104705 markings/sec, 165 secs
lola: 19731381 markings, 29694639 edges, 103516 markings/sec, 170 secs
lola: 20266158 markings, 30499488 edges, 106955 markings/sec, 175 secs
lola: 20790181 markings, 31288110 edges, 104805 markings/sec, 180 secs
lola: 21305773 markings, 32064100 edges, 103118 markings/sec, 185 secs
lola: 21822845 markings, 32842208 edges, 103414 markings/sec, 190 secs
lola: 22346042 markings, 33629567 edges, 104639 markings/sec, 195 secs
lola: 22827936 markings, 34354832 edges, 96379 markings/sec, 200 secs
lola: 23315893 markings, 35089156 edges, 97591 markings/sec, 205 secs
lola: 23776880 markings, 35782924 edges, 92197 markings/sec, 210 secs
lola: 24266832 markings, 36520296 edges, 97990 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-101-LTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no no no no no yes no no unknown no no
lola:
preliminary result: no yes yes no no no no no no no yes no no unknown no no
lola: memory consumption: 13784 KB
lola: time consumption: 454 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="RefineWMG-PT-100101"
export BK_EXAMINATION="LTLFireability"
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 RefineWMG-PT-100101, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-smll-155284920900138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;