fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r204-csrt-159033411700070
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for SwimmingPool-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.300 882247.00 920370.00 1436.40 TFFFTTTF?FTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r204-csrt-159033411700070.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is SwimmingPool-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411700070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 4.2K Apr 12 18:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 12 18:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 21:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 21:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 24 05:38 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-05-00
FORMULA_NAME SwimmingPool-PT-05-01
FORMULA_NAME SwimmingPool-PT-05-02
FORMULA_NAME SwimmingPool-PT-05-03
FORMULA_NAME SwimmingPool-PT-05-04
FORMULA_NAME SwimmingPool-PT-05-05
FORMULA_NAME SwimmingPool-PT-05-06
FORMULA_NAME SwimmingPool-PT-05-07
FORMULA_NAME SwimmingPool-PT-05-08
FORMULA_NAME SwimmingPool-PT-05-09
FORMULA_NAME SwimmingPool-PT-05-10
FORMULA_NAME SwimmingPool-PT-05-11
FORMULA_NAME SwimmingPool-PT-05-12
FORMULA_NAME SwimmingPool-PT-05-13
FORMULA_NAME SwimmingPool-PT-05-14
FORMULA_NAME SwimmingPool-PT-05-15

=== Now, execution of the tool begins

BK_START 1590644718630

info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SwimmingPool-PT-05 @ 3570 seconds

FORMULA SwimmingPool-PT-05-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 2688
rslt: Output for LTLFireability @ SwimmingPool-PT-05
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16/268435456 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: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: A (NOT(((FIREABLE(RBag) OR FIREABLE(GetK)) AND F (((NOT FIREABLE(RelK) AND G (FIREABLE(RKey))) OR X (X (FIREABLE(RKey)))))))) : A ((F (G (FIREABLE(RKey))) U X (X (FIREABLE(GetB))))) : A (NOT((G ((FIREABLE(GetK2) AND FIREABLE(RBag))) U (FIREABLE(RelK) OR NOT(X (FIREABLE(RBag))))))) : A ((FIREABLE(GetK) OR NOT((X (FIREABLE(Enter)) U G (F (FIREABLE(Enter))))))) : A (F (X (G (F (FIREABLE(RBag)))))) : A (F ((NOT FIREABLE(RelK) OR F (X (F ((FIREABLE(Enter) AND FIREABLE(RelK)))))))) : A (F (NOT FIREABLE(GetK2))) : A (((F ((FIREABLE(GetB) U F (FIREABLE(Enter)))) U X ((FIREABLE(GetK) AND F (FIREABLE(GetK2))))) AND G (FIREABLE(GetK)))) : A ((F (G (F (X (F ((FIREABLE(GetK2) OR X (FIREABLE(Enter)))))))) OR X (X (NOT FIREABLE(Enter))))) : A (F (X ((FIREABLE(Enter) AND FIREABLE(RelK))))) : A (((G (F (G ((FIREABLE(GetK) OR X (FIREABLE(GetK)))))) U F (G (X (FIREABLE(GetK))))) U FIREABLE(Enter))) : A (G (X (FIREABLE(GetB)))) : A ((FIREABLE(GetK) U (X (NOT((X (FIREABLE(GetB)) U F ((FIREABLE(GetK) OR FIREABLE(Enter)))))) OR F (FIREABLE(Enter))))) : A ((FIREABLE(GetK2) OR NOT(F (FIREABLE(RBag))))) : A (F (G ((FIREABLE(GetK2) AND G ((NOT(G (X (G (FIREABLE(RelK))))) U X (FIREABLE(RelK)))))))) : A (X (G (X (X (NOT(X (G (NOT(F (G ((F (G (FIREABLE(GetB))) U FIREABLE(GetK2)))))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(RBag) AND NOT FIREABLE(GetK)) OR G (((FIREABLE(RelK) OR F (NOT FIREABLE(RKey))) AND X (X (NOT FIREABLE(RKey)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((NOT FIREABLE(RBag) AND NOT FIREABLE(GetK)) OR G (((FIREABLE(RelK) OR F (NOT FIREABLE(RKey))) AND X (X (NOT FIREABLE(RKey)))))))
lola: processed formula length: 132
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (FIREABLE(GetB))) OR (X (X (F (FIREABLE(GetB)))) AND F (G (FIREABLE(RKey))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (FIREABLE(GetB))) OR (X (X (F (FIREABLE(GetB)))) AND F (G (FIREABLE(RKey))))))
lola: processed formula length: 87
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 221 markings, 221 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(RelK) AND (A (X (FIREABLE(RBag))) AND A ((F ((NOT FIREABLE(GetK2) OR NOT FIREABLE(RBag))) OR G ((NOT FIREABLE(RelK) AND X (FIREABLE(RBag))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(RelK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(RelK)
lola: processed formula length: 18
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(RBag)))
lola: processed formula length: 22
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(RelK) OR X (F ((FIREABLE(Enter) AND FIREABLE(RelK)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(RelK) OR X (F ((FIREABLE(Enter) AND FIREABLE(RelK)))))))
lola: processed formula length: 76
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((F (FIREABLE(Enter)) U X ((FIREABLE(GetK) AND F (FIREABLE(GetK2)))))) AND A (G (FIREABLE(GetK))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(GetK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (FIREABLE(GetK)))
lola: processed formula length: 22
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(GetK)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to LTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((FIREABLE(GetK2) OR X (FIREABLE(Enter))))) OR X (X (NOT FIREABLE(Enter)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((FIREABLE(GetK2) OR X (FIREABLE(Enter))))) OR X (X (NOT FIREABLE(Enter)))))
lola: processed formula length: 85
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
sara: try reading problem file LTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1800755 markings, 5435247 edges, 360151 markings/sec, 0 secs
lola: 3094387 markings, 9555629 edges, 258726 markings/sec, 5 secs
lola: 4263021 markings, 13329179 edges, 233727 markings/sec, 10 secs
lola: 5366295 markings, 16924981 edges, 220655 markings/sec, 15 secs
lola: 6412519 markings, 20356968 edges, 209245 markings/sec, 20 secs
lola: 7486601 markings, 23905921 edges, 214816 markings/sec, 25 secs
lola: 8554938 markings, 27446914 edges, 213667 markings/sec, 30 secs
lola: 9622167 markings, 30999088 edges, 213446 markings/sec, 35 secs
lola: 10643924 markings, 34410967 edges, 204351 markings/sec, 40 secs
lola: 11688830 markings, 37902493 edges, 208981 markings/sec, 45 secs
lola: 12725360 markings, 41371653 edges, 207306 markings/sec, 50 secs
lola: 13725194 markings, 44726645 edges, 199967 markings/sec, 55 secs
lola: 14717605 markings, 48060965 edges, 198482 markings/sec, 60 secs
lola: 15689415 markings, 51319217 edges, 194362 markings/sec, 65 secs
lola: 16645752 markings, 54542607 edges, 191267 markings/sec, 70 secs
lola: 17634441 markings, 57876516 edges, 197738 markings/sec, 75 secs
lola: 18623617 markings, 61212478 edges, 197835 markings/sec, 80 secs
lola: 19607662 markings, 64532268 edges, 196809 markings/sec, 85 secs
lola: 20583724 markings, 67814710 edges, 195212 markings/sec, 90 secs
lola: 21538330 markings, 71047670 edges, 190921 markings/sec, 95 secs
lola: 22479565 markings, 74232087 edges, 188247 markings/sec, 100 secs
lola: 23423209 markings, 77422059 edges, 188729 markings/sec, 105 secs
lola: 24362009 markings, 80599624 edges, 187760 markings/sec, 110 secs
lola: 25297568 markings, 83781698 edges, 187112 markings/sec, 115 secs
lola: 26179737 markings, 86778097 edges, 176434 markings/sec, 120 secs
lola: 27047907 markings, 89726359 edges, 173634 markings/sec, 125 secs
lola: 27848582 markings, 92442634 edges, 160135 markings/sec, 130 secs
lola: 28714427 markings, 95382838 edges, 173169 markings/sec, 135 secs
lola: 29595246 markings, 98388011 edges, 176164 markings/sec, 140 secs
lola: 30480491 markings, 101402321 edges, 177049 markings/sec, 145 secs
lola: 31353857 markings, 104379744 edges, 174673 markings/sec, 150 secs
lola: 32218701 markings, 107328006 edges, 172969 markings/sec, 155 secs
lola: 33083339 markings, 110278950 edges, 172928 markings/sec, 160 secs
lola: 33943028 markings, 113205399 edges, 171938 markings/sec, 165 secs
lola: 34802838 markings, 116127660 edges, 171962 markings/sec, 170 secs
lola: 35626436 markings, 118936777 edges, 164720 markings/sec, 175 secs
lola: 36459753 markings, 121783317 edges, 166663 markings/sec, 180 secs
lola: 37298493 markings, 124636674 edges, 167748 markings/sec, 185 secs
lola: 38135813 markings, 127488307 edges, 167464 markings/sec, 190 secs
lola: 38971159 markings, 130327368 edges, 167069 markings/sec, 195 secs
lola: 39799615 markings, 133153548 edges, 165691 markings/sec, 200 secs
lola: 40632106 markings, 135998609 edges, 166498 markings/sec, 205 secs
lola: 41472509 markings, 138855613 edges, 168081 markings/sec, 210 secs
lola: 42295403 markings, 141666086 edges, 164579 markings/sec, 215 secs
lola: 43104757 markings, 144431193 edges, 161871 markings/sec, 220 secs
lola: 43928362 markings, 147242474 edges, 164721 markings/sec, 225 secs
lola: 44747186 markings, 150041625 edges, 163765 markings/sec, 230 secs
lola: 45558046 markings, 152796417 edges, 162172 markings/sec, 235 secs
lola: 46352190 markings, 155510125 edges, 158829 markings/sec, 240 secs
lola: 47153439 markings, 158251717 edges, 160250 markings/sec, 245 secs
lola: 47936243 markings, 160926239 edges, 156561 markings/sec, 250 secs
lola: 48727187 markings, 163629538 edges, 158189 markings/sec, 255 secs
lola: 49517734 markings, 166336245 edges, 158109 markings/sec, 260 secs
lola: 50307536 markings, 169031132 edges, 157960 markings/sec, 265 secs
lola: 51086826 markings, 171695249 edges, 155858 markings/sec, 270 secs
lola: 51860688 markings, 174347359 edges, 154772 markings/sec, 275 secs
lola: 52631376 markings, 176983286 edges, 154138 markings/sec, 280 secs
lola: 53404276 markings, 179626171 edges, 154580 markings/sec, 285 secs
lola: 54171607 markings, 182257445 edges, 153466 markings/sec, 290 secs
lola: 54938441 markings, 184876868 edges, 153367 markings/sec, 295 secs
lola: 55689943 markings, 187455432 edges, 150300 markings/sec, 300 secs
lola: 56451636 markings, 190063248 edges, 152339 markings/sec, 305 secs
lola: 57210726 markings, 192662927 edges, 151818 markings/sec, 310 secs
lola: 57967206 markings, 195253508 edges, 151296 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes no no unknown unknown yes unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((FIREABLE(Enter) AND FIREABLE(RelK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(Enter) AND FIREABLE(RelK)))))
lola: processed formula length: 48
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 597 markings, 597 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F (G (FIREABLE(GetK))) OR (F (G (FIREABLE(GetK))) AND F (G ((FIREABLE(GetK) OR X (FIREABLE(GetK))))))) U FIREABLE(Enter)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (G (FIREABLE(GetK))) OR (F (G (FIREABLE(GetK))) AND F (G ((FIREABLE(GetK) OR X (FIREABLE(GetK))))))) U FIREABLE(Enter)))
lola: processed formula length: 127
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (FIREABLE(GetB))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (FIREABLE(GetB))))
lola: processed formula length: 26
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(GetK) U (X (G ((NOT FIREABLE(GetK) AND NOT FIREABLE(Enter)))) OR F (FIREABLE(Enter)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(GetK) U (X (G ((NOT FIREABLE(GetK) AND NOT FIREABLE(Enter)))) OR F (FIREABLE(Enter)))))
lola: processed formula length: 100
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: 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: 1 markings, 0 edges
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(GetK2) AND X (G ((F (FIREABLE(RelK)) AND (F (NOT FIREABLE(RelK)) OR FIREABLE(RelK)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(GetK2) AND X (G ((F (FIREABLE(RelK)) AND (F (NOT FIREABLE(RelK)) OR FIREABLE(RelK)))))))))
lola: processed formula length: 109
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 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: 9 markings, 10 edges
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(GetK2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: FIREABLE(GetK2)
lola: processed formula length: 15
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(RBag))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(RBag))))
lola: processed formula length: 26
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 309227 markings, 815095 edges
lola: ========================================
lola: subprocess 13 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(GetK2) OR G (NOT FIREABLE(RBag))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(GetK2) OR G (NOT FIREABLE(RBag))))
lola: processed formula length: 47
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 363 markings, 363 edges
lola: ========================================
lola: subprocess 14 will run for 1620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(GetK) OR F (G (NOT FIREABLE(Enter)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(GetK) OR F (G (NOT FIREABLE(Enter)))))
lola: processed formula length: 51
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 15 will run for 3240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(GetK2) OR (F (FIREABLE(GetK2)) AND F (G (FIREABLE(GetB))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(GetK2) OR (F (FIREABLE(GetK2)) AND F (G (FIREABLE(GetB))))))))
lola: processed formula length: 81
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 314 markings, 316 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((G (F ((FIREABLE(GetK2) OR X (FIREABLE(Enter))))) OR X (X (NOT FIREABLE(Enter)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((FIREABLE(GetK2) OR X (FIREABLE(Enter))))) OR X (X (NOT FIREABLE(Enter)))))
lola: processed formula length: 85
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1836902 markings, 5549110 edges, 367380 markings/sec, 0 secs
lola: 3256685 markings, 10075158 edges, 283957 markings/sec, 5 secs
lola: 4487610 markings, 14058597 edges, 246185 markings/sec, 10 secs
lola: 5656782 markings, 17876993 edges, 233834 markings/sec, 15 secs
lola: 6743164 markings, 21447914 edges, 217276 markings/sec, 20 secs
lola: 7810191 markings, 24974287 edges, 213405 markings/sec, 25 secs
lola: 8870982 markings, 28492884 edges, 212158 markings/sec, 30 secs
lola: 9935288 markings, 32045265 edges, 212861 markings/sec, 35 secs
lola: 10991504 markings, 35573312 edges, 211243 markings/sec, 40 secs
lola: 12039817 markings, 39076674 edges, 209663 markings/sec, 45 secs
lola: 13072854 markings, 42535531 edges, 206607 markings/sec, 50 secs
lola: 14088550 markings, 45947133 edges, 203139 markings/sec, 55 secs
lola: 15095368 markings, 49323207 edges, 201364 markings/sec, 60 secs
lola: 16082742 markings, 52647506 edges, 197475 markings/sec, 65 secs
lola: 17027617 markings, 55831809 edges, 188975 markings/sec, 70 secs
lola: 17966483 markings, 58993233 edges, 187773 markings/sec, 75 secs
lola: 18901020 markings, 62141630 edges, 186907 markings/sec, 80 secs
lola: 19829733 markings, 65272454 edges, 185743 markings/sec, 85 secs
lola: 20735018 markings, 68327014 edges, 181057 markings/sec, 90 secs
lola: 21625264 markings, 71340163 edges, 178049 markings/sec, 95 secs
lola: 22488609 markings, 74262300 edges, 172669 markings/sec, 100 secs
lola: 23358765 markings, 77204148 edges, 174031 markings/sec, 105 secs
lola: 24241860 markings, 80196738 edges, 176619 markings/sec, 110 secs
lola: 25137719 markings, 83240949 edges, 179172 markings/sec, 115 secs
lola: 26045785 markings, 86321993 edges, 181613 markings/sec, 120 secs
lola: 26962085 markings, 89434773 edges, 183260 markings/sec, 125 secs
lola: 27861132 markings, 92485143 edges, 179809 markings/sec, 130 secs
lola: 28738264 markings, 95465215 edges, 175426 markings/sec, 135 secs
lola: 29604184 markings, 98418755 edges, 173184 markings/sec, 140 secs
lola: 30477349 markings, 101391681 edges, 174633 markings/sec, 145 secs
lola: 31321575 markings, 104269825 edges, 168845 markings/sec, 150 secs
lola: 32179148 markings, 107192767 edges, 171515 markings/sec, 155 secs
lola: 33042676 markings, 110139559 edges, 172706 markings/sec, 160 secs
lola: 33900131 markings, 113059952 edges, 171491 markings/sec, 165 secs
lola: 34755617 markings, 115967311 edges, 171097 markings/sec, 170 secs
lola: 35603407 markings, 118857095 edges, 169558 markings/sec, 175 secs
lola: 36431342 markings, 121689445 edges, 165587 markings/sec, 180 secs
lola: 37202698 markings, 124309164 edges, 154271 markings/sec, 185 secs
lola: 37865313 markings, 126571468 edges, 132523 markings/sec, 190 secs
lola: 38534951 markings, 128845611 edges, 133928 markings/sec, 195 secs
lola: 39215253 markings, 131153234 edges, 136060 markings/sec, 200 secs
lola: 39885963 markings, 133448411 edges, 134142 markings/sec, 205 secs
lola: 40550037 markings, 135717665 edges, 132815 markings/sec, 210 secs
lola: 41363095 markings, 138480149 edges, 162612 markings/sec, 215 secs
lola: 42213295 markings, 141384433 edges, 170040 markings/sec, 220 secs
lola: 43058684 markings, 144271577 edges, 169078 markings/sec, 225 secs
lola: 43867278 markings, 147031460 edges, 161719 markings/sec, 230 secs
lola: 44617682 markings, 149597411 edges, 150081 markings/sec, 235 secs
lola: 45392373 markings, 152232017 edges, 154938 markings/sec, 240 secs
lola: 46145096 markings, 154803199 edges, 150545 markings/sec, 245 secs
lola: 46895121 markings, 157368327 edges, 150005 markings/sec, 250 secs
lola: 47657656 markings, 159970991 edges, 152507 markings/sec, 255 secs
lola: 48413402 markings, 162551468 edges, 151149 markings/sec, 260 secs
lola: 49161542 markings, 165114235 edges, 149628 markings/sec, 265 secs
lola: 49918649 markings, 167698045 edges, 151421 markings/sec, 270 secs
lola: 50699358 markings, 170368888 edges, 156142 markings/sec, 275 secs
lola: 51447208 markings, 172930136 edges, 149570 markings/sec, 280 secs
lola: 52214560 markings, 175557620 edges, 153470 markings/sec, 285 secs
lola: 52993357 markings, 178224990 edges, 155759 markings/sec, 290 secs
lola: 53745066 markings, 180793054 edges, 150342 markings/sec, 295 secs
lola: 54548382 markings, 183543868 edges, 160663 markings/sec, 300 secs
lola: 55339522 markings, 186254025 edges, 158228 markings/sec, 305 secs
lola: 56138217 markings, 188990666 edges, 159739 markings/sec, 310 secs
lola: 56932174 markings, 191711865 edges, 158791 markings/sec, 315 secs
lola: 57736416 markings, 194465825 edges, 160848 markings/sec, 320 secs
lola: 58537206 markings, 197208392 edges, 160158 markings/sec, 325 secs
lola: 59321870 markings, 199885481 edges, 156933 markings/sec, 330 secs
lola: 60123450 markings, 202629408 edges, 160316 markings/sec, 335 secs
lola: 60919991 markings, 205358981 edges, 159308 markings/sec, 340 secs
lola: 61709822 markings, 208060019 edges, 157966 markings/sec, 345 secs
lola: 62414338 markings, 210468483 edges, 140903 markings/sec, 350 secs
lola: 63199452 markings, 213153895 edges, 157023 markings/sec, 355 secs
lola: 63990474 markings, 215869333 edges, 158204 markings/sec, 360 secs
lola: 64786513 markings, 218593341 edges, 159208 markings/sec, 365 secs
lola: 65582465 markings, 221319959 edges, 159190 markings/sec, 370 secs
lola: 66363480 markings, 223985843 edges, 156203 markings/sec, 375 secs
lola: 67151619 markings, 226703450 edges, 157628 markings/sec, 380 secs
lola: 67948741 markings, 229436006 edges, 159424 markings/sec, 385 secs
lola: 68752276 markings, 232186819 edges, 160707 markings/sec, 390 secs
lola: 69556325 markings, 234934806 edges, 160810 markings/sec, 395 secs
lola: 70355787 markings, 237675089 edges, 159892 markings/sec, 400 secs
lola: 71153674 markings, 240415831 edges, 159577 markings/sec, 405 secs
lola: 71961473 markings, 243183936 edges, 161560 markings/sec, 410 secs
lola: 72760095 markings, 245919739 edges, 159724 markings/sec, 415 secs
lola: 73560911 markings, 248661048 edges, 160163 markings/sec, 420 secs
lola: 74354646 markings, 251383987 edges, 158747 markings/sec, 425 secs
lola: 75142131 markings, 254092218 edges, 157497 markings/sec, 430 secs
lola: 75939619 markings, 256822521 edges, 159498 markings/sec, 435 secs
lola: 76727173 markings, 259510702 edges, 157511 markings/sec, 440 secs
lola: 77511710 markings, 262200212 edges, 156907 markings/sec, 445 secs
lola: 78291364 markings, 264882104 edges, 155931 markings/sec, 450 secs
lola: 79078452 markings, 267579292 edges, 157418 markings/sec, 455 secs
lola: 79860478 markings, 270253528 edges, 156405 markings/sec, 460 secs
lola: 80628495 markings, 272889067 edges, 153603 markings/sec, 465 secs
lola: 81407443 markings, 275557660 edges, 155790 markings/sec, 470 secs
lola: 82160632 markings, 278144570 edges, 150638 markings/sec, 475 secs
lola: 82932201 markings, 280785420 edges, 154314 markings/sec, 480 secs
lola: 83710494 markings, 283443395 edges, 155659 markings/sec, 485 secs
lola: 84488339 markings, 286103093 edges, 155569 markings/sec, 490 secs
lola: 85092419 markings, 288167715 edges, 120816 markings/sec, 495 secs
lola: 85758948 markings, 290447862 edges, 133306 markings/sec, 500 secs
lola: 86450340 markings, 292809275 edges, 138278 markings/sec, 505 secs
lola: 87172726 markings, 295292244 edges, 144477 markings/sec, 510 secs
lola: 87890025 markings, 297753411 edges, 143460 markings/sec, 515 secs
lola: 88628437 markings, 300273379 edges, 147682 markings/sec, 520 secs
lola: 89375173 markings, 302836525 edges, 149347 markings/sec, 525 secs
lola: 90130711 markings, 305419966 edges, 151108 markings/sec, 530 secs
lola: 90797382 markings, 307699031 edges, 133334 markings/sec, 535 secs
lola: 90984419 markings, 308339257 edges, 37407 markings/sec, 540 secs
lola: 90993940 markings, 308371378 edges, 1904 markings/sec, 545 secs
Killed
rslt: finished

BK_STOP 1590645600877

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

make: [verify] Error 137 (ignored)

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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is SwimmingPool-PT-05, 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 r204-csrt-159033411700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-05.tgz
mv SwimmingPool-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;