fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r280-csrt-152749170300689
Last Updated
June 26, 2018

About the Execution of LoLA for RefineWMG-PT-010011

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.260 473150.00 490195.00 2990.70 FFFF?TTFFFFFFF?F normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......................................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.5K May 30 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 30 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 29 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 11:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 11:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 28 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 27 05:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 27 05:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 24K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-010011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300689

=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-010-011-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527823537115

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-010011 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-010011 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RefineWMG-PT-010011 @ 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: 97/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-010-011-LTLCardinality.task
lola: A (F ((3 <= p15))) : A ((1 <= p47)) : A (G (X (G (F ((1 <= p27)))))) : A ((G (X ((3 <= p21))) U F ((3 <= p)))) : A (G (X (X ((2 <= p8))))) : A ((p22 <= p1)) : A (((p28 <= p9) U ((p13 <= p43) U (1 <= p8)))) : A ((((p16 <= p11) U (3 <= p12)) U ((2 <= p32) U (1 <= p6)))) : A (F (G ((1 <= p6)))) : A ((((p46 <= p1) U (p12 <= p21)) U G (G ((1 <= p32))))) : A ((X (F ((3 <= p16))) U G ((3 <= p31)))) : A (X (F (((p33 <= p29) U (p18 <= p35))))) : A (F (G (G (X ((1 <= p36)))))) : A ((p23 <= p17)) : A (F (G ((pterce <= p22)))) : A ((F (X ((p35 <= p9))) U X ((2 <= p31))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p47)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p47)
lola: processed formula length: 10
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-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: (p22 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p1)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-5 TRUE 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: (p23 <= p17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p23 <= p17)
lola: processed formula length: 12
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA RefineWMG-PT-010-011-LTLCardinality-13 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: A ((X (F ((3 <= p16))) U G ((3 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((3 <= p16))) U G ((3 <= p31))))
lola: processed formula length: 41
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.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: 14 markings, 14 edges
lola:
FORMULA RefineWMG-PT-010-011-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p18 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p18 <= p35))))
lola: processed formula length: 24
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= p8)))))
lola: processed formula length: 25
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.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: 3657192 markings, 5651410 edges, 731438 markings/sec, 0 secs
lola: 7280651 markings, 11250707 edges, 724692 markings/sec, 5 secs
lola: 10941591 markings, 16907913 edges, 732188 markings/sec, 10 secs
lola: 14289249 markings, 22081016 edges, 669532 markings/sec, 15 secs
lola: 17726536 markings, 27392622 edges, 687457 markings/sec, 20 secs
lola: 21045094 markings, 32520762 edges, 663712 markings/sec, 25 secs
lola: 24380696 markings, 37675232 edges, 667120 markings/sec, 30 secs
lola: 27721931 markings, 42838407 edges, 668247 markings/sec, 35 secs
lola: 31122332 markings, 48093012 edges, 680080 markings/sec, 40 secs
lola: 34347067 markings, 53076157 edges, 644947 markings/sec, 45 secs
lola: 37517223 markings, 57974970 edges, 634031 markings/sec, 50 secs
lola: 40624403 markings, 62776467 edges, 621436 markings/sec, 55 secs
lola: 44273134 markings, 68414812 edges, 729746 markings/sec, 60 secs
lola: 47819922 markings, 73895625 edges, 709358 markings/sec, 65 secs
lola: 51403673 markings, 79433561 edges, 716750 markings/sec, 70 secs
lola: 55057777 markings, 85080215 edges, 730821 markings/sec, 75 secs
lola: 58759544 markings, 90800516 edges, 740353 markings/sec, 80 secs
lola: 62403424 markings, 96431359 edges, 728776 markings/sec, 85 secs
lola: 66005714 markings, 101997949 edges, 720458 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p35 <= p9)) U (2 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p35 <= p9)) U (2 <= p31))))
lola: processed formula length: 38
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p15)))
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: (p15 <= 2)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 25 markings, 25 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p)))
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: (p <= 2)
lola: processed formula length: 8
lola: 20 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p36))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p36))))
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 27
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================
FORMULA RefineWMG-PT-010-011-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola:
========================================
lola: ...considering subproblem: A (G (F ((1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p27))))
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges

FORMULA RefineWMG-PT-010-011-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p6))))
lola: processed formula length: 21
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 19
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 27 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((pterce <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pterce <= p22))))
lola: processed formula length: 27
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 4004521 markings, 5005651 edges, 800904 markings/sec, 0 secs
lola: 7922769 markings, 9903461 edges, 783650 markings/sec, 5 secs
lola: 11786910 markings, 14733638 edges, 772828 markings/sec, 10 secs
lola: 15590222 markings, 19487777 edges, 760662 markings/sec, 15 secs
lola: 19390815 markings, 24238519 edges, 760119 markings/sec, 20 secs
lola: 23146254 markings, 28932817 edges, 751088 markings/sec, 25 secs
lola: 27181766 markings, 33977206 edges, 807102 markings/sec, 30 secs
lola: 31074793 markings, 38843491 edges, 778605 markings/sec, 35 secs
lola: 35087961 markings, 43859951 edges, 802634 markings/sec, 40 secs
lola: 39001978 markings, 48752473 edges, 782803 markings/sec, 45 secs
lola: 42939246 markings, 53674057 edges, 787454 markings/sec, 50 secs
lola: 46738541 markings, 58423177 edges, 759859 markings/sec, 55 secs
lola: 50562472 markings, 63203090 edges, 764786 markings/sec, 60 secs
lola: 54431914 markings, 68039893 edges, 773888 markings/sec, 65 secs
lola: 58272049 markings, 72840060 edges, 768027 markings/sec, 70 secs
lola: 62082552 markings, 77603190 edges, 762101 markings/sec, 75 secs
lola: 65898089 markings, 82372611 edges, 763107 markings/sec, 80 secs
lola: 69718583 markings, 87148228 edges, 764099 markings/sec, 85 secs
lola: 73182114 markings, 91477643 edges, 692706 markings/sec, 90 secs
lola: 76511798 markings, 95639746 edges, 665937 markings/sec, 95 secs
lola: 79823521 markings, 99779400 edges, 662345 markings/sec, 100 secs
lola: 83152214 markings, 103940267 edges, 665739 markings/sec, 105 secs
lola: 86454941 markings, 108068675 edges, 660545 markings/sec, 110 secs
lola: 89757015 markings, 112196268 edges, 660415 markings/sec, 115 secs
lola: 93037718 markings, 116297147 edges, 656141 markings/sec, 120 secs
lola: 95008163 markings, 118760208 edges, 394089 markings/sec, 125 secs
lola: 95084601 markings, 118855750 edges, 15288 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p16 <= p11) U (3 <= p12)) U ((2 <= p32) U (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p16 <= p11) U (3 <= p12)) U ((2 <= p32) U (1 <= p6))))
lola: processed formula length: 60
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p28 <= p9) U ((p13 <= p43) U (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p28 <= p9) U ((p13 <= p43) U (1 <= p8))))
lola: processed formula length: 46
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p46 <= p1) U (p12 <= p21)) U G ((1 <= p32))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p46 <= p1) U (p12 <= p21)) U G ((1 <= p32))))
lola: processed formula length: 51
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 27
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 27 edges
lola: ========================================

FORMULA RefineWMG-PT-010-011-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= p8)))))
lola: processed formula length: 25
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.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: 3630538 markings, 5610226 edges, 726108 markings/sec, 0 secs
lola: 7091065 markings, 10957743 edges, 692105 markings/sec, 5 secs
lola: 10519742 markings, 16256040 edges, 685735 markings/sec, 10 secs
lola: 13850473 markings, 21402988 edges, 666146 markings/sec, 15 secs
lola: 17120774 markings, 26456547 edges, 654060 markings/sec, 20 secs
lola: 20362981 markings, 31466696 edges, 648441 markings/sec, 25 secs
lola: 23625240 markings, 36507839 edges, 652452 markings/sec, 30 secs
lola: 27191496 markings, 42018736 edges, 713251 markings/sec, 35 secs
lola: 30984712 markings, 47880348 edges, 758643 markings/sec, 40 secs
lola: 34685055 markings, 53598449 edges, 740069 markings/sec, 45 secs
lola: 38378862 markings, 59306457 edges, 738761 markings/sec, 50 secs
lola: 42057789 markings, 64991463 edges, 735785 markings/sec, 55 secs
lola: 45730398 markings, 70666710 edges, 734522 markings/sec, 60 secs
lola: 49397013 markings, 76332689 edges, 733323 markings/sec, 65 secs
lola: 52999337 markings, 81899324 edges, 720465 markings/sec, 70 secs
lola: 56691401 markings, 87604637 edges, 738413 markings/sec, 75 secs
lola: 60358414 markings, 93271236 edges, 733403 markings/sec, 80 secs
lola: 64023744 markings, 98935232 edges, 733066 markings/sec, 85 secs
lola: 67648049 markings, 104535835 edges, 724861 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-010-011-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (F (G ((pterce <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pterce <= p22))))
lola: processed formula length: 27
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-010-011-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 4390473 markings, 5488090 edges, 878095 markings/sec, 0 secs
lola: 8506272 markings, 10632840 edges, 823160 markings/sec, 5 secs
lola: 12261187 markings, 15326484 edges, 750983 markings/sec, 10 secs
lola: 15766533 markings, 19708166 edges, 701069 markings/sec, 15 secs
lola: 19262423 markings, 24078029 edges, 699178 markings/sec, 20 secs
lola: 22714822 markings, 28393528 edges, 690480 markings/sec, 25 secs
lola: 26732805 markings, 33416006 edges, 803597 markings/sec, 30 secs
lola: 30739022 markings, 38423777 edges, 801243 markings/sec, 35 secs
lola: 34820213 markings, 43525265 edges, 816238 markings/sec, 40 secs
lola: 38826678 markings, 48533346 edges, 801293 markings/sec, 45 secs
lola: 42883782 markings, 53604726 edges, 811421 markings/sec, 50 secs
lola: 46923152 markings, 58653955 edges, 807874 markings/sec, 55 secs
lola: 50880199 markings, 63600249 edges, 791409 markings/sec, 60 secs
lola: 54817762 markings, 68522203 edges, 787513 markings/sec, 65 secs
lola: 58500362 markings, 73125452 edges, 736520 markings/sec, 70 secs
lola: 61937808 markings, 77422260 edges, 687489 markings/sec, 75 secs
lola: 65354140 markings, 81692675 edges, 683266 markings/sec, 80 secs
lola: 68802846 markings, 86003557 edges, 689741 markings/sec, 85 secs
lola: 72246832 markings, 90308540 edges, 688797 markings/sec, 90 secs
lola: 75664119 markings, 94580149 edges, 683457 markings/sec, 95 secs
lola: 79250658 markings, 99063323 edges, 717308 markings/sec, 100 secs
lola: 82586982 markings, 103233728 edges, 667265 markings/sec, 105 secs
lola: 85892360 markings, 107365450 edges, 661076 markings/sec, 110 secs
lola: 89389869 markings, 111737336 edges, 699502 markings/sec, 115 secs
lola: 93298114 markings, 116622642 edges, 781649 markings/sec, 120 secs
lola: 95027014 markings, 118783798 edges, 345780 markings/sec, 125 secs
lola: 95063894 markings, 118829868 edges, 7376 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-010-011-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no unknown yes yes no no no no no no no unknown no
lola:
preliminary result: no no no no unknown yes yes no no no no no no no unknown no
lola: memory consumption: 17740 KB
lola: time consumption: 473 seconds

BK_STOP 1527824010265

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-010011"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-010011.tgz
mv RefineWMG-PT-010011 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is RefineWMG-PT-010011, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r280-csrt-152749170300689"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;