Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r176-oct2-155297760700039.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is SwimmingPool-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-oct2-155297760700039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 160K
-rw-r--r-- 1 mcc users 3.1K Feb 12 19:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 12 19:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 9 02:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 9 02:55 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 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K Feb 4 22:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 21:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 21:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 21:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 21:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-08-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553296442321

info: Time: 3600 - MCC
===========================================================================================
prep: translating SwimmingPool-PT-08 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SwimmingPool-PT-08 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ SwimmingPool-PT-08 @ 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-08-LTLFireability.task
lola: A (G (F (F (FIREABLE(GetB))))) : A (FIREABLE(RBag)) : A (G ((G (F (FIREABLE(RKey))) U FIREABLE(GetK2)))) : A (G (FIREABLE(RelK))) : A (FIREABLE(GetK)) : A (X (FIREABLE(RelK))) : A ((FIREABLE(RKey) U F (G (F (FIREABLE(GetK)))))) : A (FIREABLE(RelK)) : A (((X (FIREABLE(RelK)) U F (FIREABLE(GetK2))) U F (FIREABLE(RBag)))) : A ((FIREABLE(RKey) U FIREABLE(RBag))) : A ((X ((FIREABLE(GetK) U FIREABLE(Enter))) U X ((FIREABLE(RKey) U FIREABLE(Enter))))) : A (X (X (G (G (G (FIREABLE(RBag))))))) : A (G (FIREABLE(GetK2))) : A ((F (X (X (FIREABLE(GetB)))) U F (G (FIREABLE(RelK))))) : A (FIREABLE(GetK)) : A (G ((F (FIREABLE(RBag)) U FIREABLE(GetB))))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:545
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(RBag)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(RBag)
lola: processed formula length: 14
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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 SwimmingPool-PT-08-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(GetK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(GetK)
lola: processed formula length: 14
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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 SwimmingPool-PT-08-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(RelK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(RelK)
lola: processed formula length: 14
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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

FORMULA SwimmingPool-PT-08-LTLFireability-7 FALSE 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: FIREABLE(GetK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(GetK)
lola: processed formula length: 14
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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 SwimmingPool-PT-08-LTLFireability-14 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(GetK) U FIREABLE(Enter)) U (FIREABLE(RKey) U FIREABLE(Enter)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((FIREABLE(GetK) U FIREABLE(Enter)) U (FIREABLE(RKey) U FIREABLE(Enter)))))
lola: processed formula length: 81
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-LTLFireability.task
lola: ========================================
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: 2 markings, 1 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-10 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 (G (FIREABLE(RBag)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (FIREABLE(RBag)))))
lola: processed formula length: 30
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 4 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: 326 markings, 326 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(RelK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(RelK)))
lola: processed formula length: 22
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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: 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: 326 markings, 326 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-5 FALSE 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 (G (FIREABLE(GetK2)))
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(GetK2)))
lola: processed formula length: 23
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-08-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(GetK2)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-08-LTLFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola:
FORMULA SwimmingPool-PT-08-LTLFireability-12 FALSE 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 (G (FIREABLE(RelK)))
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(RelK)))
lola: processed formula length: 22
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-08-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: NOT FIREABLE(RelK)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(RBag)))
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(RBag)
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-08-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 561 markings, 560 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(GetB))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(GetB))))
lola: processed formula length: 26
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1211220 markings, 2140137 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-0 TRUE 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 (FIREABLE(RelK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(RelK))))
lola: processed formula length: 26
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
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: 762 markings, 802 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-13 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 (G (F (FIREABLE(GetK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(GetK))))
lola: processed formula length: 26
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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: 4014773 markings, 7198242 edges, 802955 markings/sec, 0 secs
lola: 7592631 markings, 13758196 edges, 715572 markings/sec, 5 secs
lola: 11085494 markings, 20202366 edges, 698573 markings/sec, 10 secs
lola: 14492718 markings, 26522146 edges, 681445 markings/sec, 15 secs
lola: 17835974 markings, 32750757 edges, 668651 markings/sec, 20 secs
lola: 21186217 markings, 39005544 edges, 670049 markings/sec, 25 secs
lola: 24511272 markings, 45228864 edges, 665011 markings/sec, 30 secs
lola: 27855852 markings, 51485195 edges, 668916 markings/sec, 35 secs
lola: 31195578 markings, 57731244 edges, 667945 markings/sec, 40 secs
lola: 34485750 markings, 63883851 edges, 658034 markings/sec, 45 secs
lola: 37810911 markings, 70098805 edges, 665032 markings/sec, 50 secs
lola: 41177584 markings, 76372299 edges, 673335 markings/sec, 55 secs
lola: 44560077 markings, 82692003 edges, 676499 markings/sec, 60 secs
lola: 48054127 markings, 89237433 edges, 698810 markings/sec, 65 secs
lola: 49729544 markings, 94932491 edges, 335083 markings/sec, 70 secs
lola: 50638275 markings, 99375833 edges, 181746 markings/sec, 75 secs
lola: 51553927 markings, 103632721 edges, 183130 markings/sec, 80 secs
lola: 52462261 markings, 107756283 edges, 181667 markings/sec, 85 secs
lola: 53370881 markings, 111822866 edges, 181724 markings/sec, 90 secs
lola: 54280006 markings, 115866566 edges, 181825 markings/sec, 95 secs
lola: 55187762 markings, 119897111 edges, 181551 markings/sec, 100 secs
lola: 56091114 markings, 123896451 edges, 180670 markings/sec, 105 secs
lola: 56991583 markings, 127871865 edges, 180094 markings/sec, 110 secs
lola: 57871626 markings, 131738999 edges, 176009 markings/sec, 115 secs
lola: 58766372 markings, 135636426 edges, 178949 markings/sec, 120 secs
lola: 59710456 markings, 139705916 edges, 188817 markings/sec, 125 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: 60050812 markings, 141152351 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(GetK2) OR (G (F (FIREABLE(RKey))) AND F (FIREABLE(GetK2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((FIREABLE(GetK2) OR (G (F (FIREABLE(RKey))) AND F (FIREABLE(GetK2))))))
lola: processed formula length: 77
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 4 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: 6065590 markings, 7984952 edges, 1213118 markings/sec, 0 secs
lola: 10219934 markings, 14254493 edges, 830869 markings/sec, 5 secs
lola: 13892330 markings, 19971270 edges, 734479 markings/sec, 10 secs
lola: 17455662 markings, 25484325 edges, 712666 markings/sec, 15 secs
lola: 20824390 markings, 30722869 edges, 673746 markings/sec, 20 secs
lola: 24419247 markings, 36253551 edges, 718971 markings/sec, 25 secs
lola: 28093923 markings, 41810765 edges, 734935 markings/sec, 30 secs
lola: 31707106 markings, 47269004 edges, 722637 markings/sec, 35 secs
lola: 35077990 markings, 52509447 edges, 674177 markings/sec, 40 secs
lola: 37515858 markings, 57681526 edges, 487574 markings/sec, 45 secs
lola: 38775147 markings, 61998098 edges, 251858 markings/sec, 50 secs
lola: 40308876 markings, 66344593 edges, 306746 markings/sec, 55 secs
lola: 41897599 markings, 70701355 edges, 317745 markings/sec, 60 secs
lola: 43489029 markings, 75056948 edges, 318286 markings/sec, 65 secs
lola: 45173383 markings, 79529227 edges, 336871 markings/sec, 70 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: 46928566 markings, 83123198 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(RKey) U FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((FIREABLE(RKey) U FIREABLE(RBag)))
lola: processed formula length: 37
lola: 23 rewrites
lola: closed formula file SwimmingPool-PT-08-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(GetB)))) AND A (G ((F (FIREABLE(RBag)) OR FIREABLE(GetB)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(GetB))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(GetB))))
lola: processed formula length: 26
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1211220 markings, 2140137 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(GetB)))) AND A (G ((F (FIREABLE(RBag)) OR FIREABLE(GetB)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(GetB))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(GetB))))
lola: processed formula length: 26
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1211220 markings, 2140137 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((F (FIREABLE(RBag)) OR FIREABLE(GetB))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F (FIREABLE(RBag)) OR FIREABLE(GetB))))
lola: processed formula length: 46
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-08-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1181259 markings, 2054036 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA SwimmingPool-PT-08-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes no yes no yes no no no no yes
lola:
preliminary result: yes no yes no no no yes no yes no yes no no no no yes
lola: memory consumption: 14616 KB
lola: time consumption: 215 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="SwimmingPool-PT-08"
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-3954"
echo " Executing tool win2018"
echo " Input is SwimmingPool-PT-08, 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 r176-oct2-155297760700039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-08.tgz
mv SwimmingPool-PT-08 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 ;