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 384K
-rw-r--r-- 1 mcc users 3.3K May 30 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 16:52 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:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 11:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 09:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.8K May 28 09:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 07:31 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.5K May 27 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 05:06 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 217K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-100100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170400752
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1527826553391

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-100100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-100100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RefineWMG-PT-100100 @ 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: 907/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-100-100-LTLCardinality.task
lola: A (X (F (((p347 <= p222) U (p406 <= p250))))) : A (X ((G ((p495 <= p436)) U (p329 <= p291)))) : A ((p143 <= p418)) : A (F ((F ((1 <= p119)) U (p248 <= p90)))) : A (F ((3 <= p121))) : A (G (G (F (F ((3 <= p444)))))) : A (X (X (X (G ((p172 <= p469)))))) : A ((X (F ((1 <= p49))) U X (X ((p41 <= p176))))) : A (((p202 <= p146) U G (G ((1 <= p398))))) : A ((2 <= p356)) : A (X ((p118 <= p392))) : A (X (X (F (F ((1 <= p258)))))) : A (X ((3 <= p45))) : A (((p196 <= p246) U (p64 <= p135))) : A (G ((p375 <= p125))) : A ((((p259 <= p483) U (p500 <= p122)) U G ((1 <= p230))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p143 <= p418)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p143 <= p418)
lola: processed formula length: 14
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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-100-100-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p356)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p356)
lola: processed formula length: 11
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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-100-100-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p406 <= p250))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p406 <= p250))))
lola: processed formula length: 26
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 102 markings, 101 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((p172 <= p469))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((p172 <= p469))))))
lola: processed formula length: 34
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 993697 markings, 1495401 edges, 198739 markings/sec, 0 secs
lola: 2055713 markings, 3093790 edges, 212403 markings/sec, 5 secs
lola: 3181270 markings, 4787732 edges, 225111 markings/sec, 10 secs
lola: 4227478 markings, 6362315 edges, 209242 markings/sec, 15 secs
lola: 5337277 markings, 8032490 edges, 221960 markings/sec, 20 secs
lola: 6323521 markings, 9516837 edges, 197249 markings/sec, 25 secs
lola: 7447884 markings, 11208984 edges, 224873 markings/sec, 30 secs
lola: 8502906 markings, 12796789 edges, 211004 markings/sec, 35 secs
lola: 9616208 markings, 14472316 edges, 222660 markings/sec, 40 secs
lola: 10622774 markings, 15987217 edges, 201313 markings/sec, 45 secs
lola: 11582192 markings, 17431076 edges, 191884 markings/sec, 50 secs
lola: 12460033 markings, 18752272 edges, 175568 markings/sec, 55 secs
lola: 13367359 markings, 20117795 edges, 181465 markings/sec, 60 secs
lola: 14265950 markings, 21470163 edges, 179718 markings/sec, 65 secs
lola: 15154007 markings, 22806695 edges, 177611 markings/sec, 70 secs
lola: 16130855 markings, 24276841 edges, 195370 markings/sec, 75 secs
lola: 17082488 markings, 25709056 edges, 190327 markings/sec, 80 secs
lola: 18057905 markings, 27177058 edges, 195083 markings/sec, 85 secs
lola: 18949668 markings, 28519174 edges, 178353 markings/sec, 90 secs
lola: 19891099 markings, 29936026 edges, 188286 markings/sec, 95 secs
lola: 20800774 markings, 31305082 edges, 181935 markings/sec, 100 secs
lola: 21679329 markings, 32627242 edges, 175711 markings/sec, 105 secs
lola: 22526939 markings, 33902957 edges, 169522 markings/sec, 110 secs
lola: 23335890 markings, 35120425 edges, 161790 markings/sec, 115 secs
lola: 24229300 markings, 36465008 edges, 178682 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= p49)) U X ((p41 <= p176)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= p49)) U X ((p41 <= p176)))))
lola: processed formula length: 44
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 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: 5255 markings, 10403 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p329 <= p291) OR (G ((p495 <= p436)) AND F ((p329 <= p291))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p329 <= p291) OR (G ((p495 <= p436)) AND F ((p329 <= p291))))))
lola: processed formula length: 71
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 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: 103 markings, 103 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p118 <= p392)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p118 <= p392)))
lola: processed formula length: 22
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 103 markings, 103 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= p258)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= p258)))))
lola: processed formula length: 27
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5255 markings, 10403 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p45)))
lola: processed formula length: 18
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 103 markings, 103 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p375 <= p125)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p375 <= p125)))
lola: processed formula length: 22
lola: 12 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p121)))
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: (p121 <= 2)
lola: processed formula length: 11
lola: 12 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 7 markings, 7 edges

FORMULA RefineWMG-PT-100-100-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p248 <= p90)))
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: (p90 + 1 <= p248)
lola: processed formula length: 17
lola: 12 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 7 markings, 7 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p444))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p444))))
lola: processed formula length: 23
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 1448 markings, 2592 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p202 <= p146) U G ((1 <= p398))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p202 <= p146) U G ((1 <= p398))))
lola: processed formula length: 38
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 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: 642488 markings, 817959 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p259 <= p483) U (p500 <= p122)) U G ((1 <= p230))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p259 <= p483) U (p500 <= p122)) U G ((1 <= p230))))
lola: processed formula length: 57
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: 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: 106 markings, 106 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p196 <= p246) U (p64 <= p135)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((p196 <= p246) U (p64 <= p135)))
lola: processed formula length: 36
lola: 14 rewrites
lola: closed formula file RefineWMG-PT-100-100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 7 edges
lola: ========================================

FORMULA RefineWMG-PT-100-100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((p172 <= p469))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((p172 <= p469))))))
lola: processed formula length: 34
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-100-100-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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1091778 markings, 1643005 edges, 218356 markings/sec, 0 secs
lola: 2135056 markings, 3213174 edges, 208656 markings/sec, 5 secs
lola: 3294139 markings, 4957544 edges, 231817 markings/sec, 10 secs
lola: 4342959 markings, 6536103 edges, 209764 markings/sec, 15 secs
lola: 5452748 markings, 8206296 edges, 221958 markings/sec, 20 secs
lola: 6487686 markings, 9763918 edges, 206988 markings/sec, 25 secs
lola: 7603589 markings, 11443280 edges, 223181 markings/sec, 30 secs
lola: 8664910 markings, 13040591 edges, 212264 markings/sec, 35 secs
lola: 9765047 markings, 14696302 edges, 220027 markings/sec, 40 secs
lola: 10750968 markings, 16180134 edges, 197184 markings/sec, 45 secs
lola: 11732450 markings, 17657246 edges, 196296 markings/sec, 50 secs
lola: 12648755 markings, 19036310 edges, 183261 markings/sec, 55 secs
lola: 13590688 markings, 20453884 edges, 188387 markings/sec, 60 secs
lola: 14498084 markings, 21819533 edges, 181479 markings/sec, 65 secs
lola: 15384227 markings, 23153156 edges, 177229 markings/sec, 70 secs
lola: 16344605 markings, 24598588 edges, 192076 markings/sec, 75 secs
lola: 17257911 markings, 25973074 edges, 182661 markings/sec, 80 secs
lola: 18204264 markings, 27397346 edges, 189271 markings/sec, 85 secs
lola: 19076235 markings, 28709678 edges, 174394 markings/sec, 90 secs
lola: 19899858 markings, 29949183 edges, 164725 markings/sec, 95 secs
lola: 20660740 markings, 31094355 edges, 152176 markings/sec, 100 secs
lola: 21404910 markings, 32214316 edges, 148834 markings/sec, 105 secs
lola: 22193839 markings, 33401617 edges, 157786 markings/sec, 110 secs
lola: 22896852 markings, 34459688 edges, 140603 markings/sec, 115 secs
lola: 23599965 markings, 35517811 edges, 140623 markings/sec, 120 secs
lola: 24400824 markings, 36723289 edges, 160172 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-100-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no unknown yes no no no yes no no no no
lola:
preliminary result: yes no yes no no no unknown yes no no no yes no no no no
lola: memory consumption: 18088 KB
lola: time consumption: 264 seconds

BK_STOP 1527826817628

--------------------
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-100100"
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-100100.tgz
mv RefineWMG-PT-100100 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-100100, 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-152749170400752"
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 ;