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 220K
-rw-r--r-- 1 mcc users 3.0K May 30 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 30 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 11:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 28 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 28 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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: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 55K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-025025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300717
=====================================================================

--------------------
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-025-025-LTLFireability-00
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-01
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-02
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-03
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-04
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-05
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-06
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-07
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-08
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-09
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-10
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-11
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-12
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-13
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-14
FORMULA_NAME RefineWMG-PT-025-025-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527824944640

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-025025 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-025025 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RefineWMG-PT-025025 @ 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: 232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 129 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-025-025-LTLFireability.task
lola: A (((F (FIREABLE(t43)) U FIREABLE(t87)) U G ((FIREABLE(t54) U FIREABLE(t46))))) : A ((X (F (F (FIREABLE(t8)))) U FIREABLE(t97))) : A (FIREABLE(t47)) : A (F (X (G (G (G (FIREABLE(t74))))))) : A (X ((G (F (FIREABLE(t36))) U G (F (FIREABLE(t77)))))) : A (F ((F (G (FIREABLE(t76))) U (FIREABLE(t81) U FIREABLE(t64))))) : A (FIREABLE(t25)) : A (G ((X (FIREABLE(t73)) U X (G (FIREABLE(t27)))))) : A (G (FIREABLE(t16))) : A (((F (FIREABLE(t99)) U F (FIREABLE(t1))) U F (G (F (FIREABLE(t83)))))) : A (F (X (G (F (FIREABLE(t50)))))) : A ((F (F (F (FIREABLE(t59)))) U F (G (F (FIREABLE(t53)))))) : A (FIREABLE(t43)) : A (X (X (G (G (X (FIREABLE(t68))))))) : A (X ((X (X (FIREABLE(t11))) U G (F (FIREABLE(t66)))))) : A (FIREABLE(t55))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t47)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t47)
lola: processed formula length: 13
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t25)
lola: processed formula length: 13
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA RefineWMG-PT-025-025-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t43)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t43)
lola: processed formula length: 13
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t55)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t55)
lola: processed formula length: 13
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-LTLFireability-15 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 (F (G (FIREABLE(t27)))) AND A (X (G ((FIREABLE(t73) OR G (FIREABLE(t27)))))))
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 (F (G (FIREABLE(t27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t27))))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 75
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA RefineWMG-PT-025-025-LTLFireability-7 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 ((G (F (FIREABLE(t77))) OR G ((F (FIREABLE(t36)) AND F (FIREABLE(t77)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G (F (FIREABLE(t77))) OR G ((F (FIREABLE(t36)) AND F (FIREABLE(t77)))))))
lola: processed formula length: 80
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
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: 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: 53 markings, 53 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G (FIREABLE(t68))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (FIREABLE(t68))))))
lola: processed formula length: 33
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1812043 markings, 4491794 edges, 362409 markings/sec, 0 secs
lola: 3695141 markings, 9160517 edges, 376620 markings/sec, 5 secs
lola: 5578368 markings, 13829554 edges, 376645 markings/sec, 10 secs
lola: 7461826 markings, 18499164 edges, 376692 markings/sec, 15 secs
lola: 9327147 markings, 23123800 edges, 373064 markings/sec, 20 secs
lola: 11169947 markings, 27692394 edges, 368560 markings/sec, 25 secs
lola: 12827748 markings, 31802675 edges, 331560 markings/sec, 30 secs
lola: 14457469 markings, 35842914 edges, 325944 markings/sec, 35 secs
lola: 16050331 markings, 39791688 edges, 318572 markings/sec, 40 secs
lola: 17783703 markings, 44089548 edges, 346674 markings/sec, 45 secs
lola: 19611507 markings, 48621071 edges, 365561 markings/sec, 50 secs
lola: 21405907 markings, 53069852 edges, 358880 markings/sec, 55 secs
lola: 23187570 markings, 57486523 edges, 356333 markings/sec, 60 secs
lola: 24955273 markings, 61869472 edges, 353541 markings/sec, 65 secs
lola: 26700183 markings, 66194961 edges, 348982 markings/sec, 70 secs
lola: 28478979 markings, 70605132 edges, 355759 markings/sec, 75 secs
lola: 30242242 markings, 74976865 edges, 352653 markings/sec, 80 secs
lola: 32003629 markings, 79343890 edges, 352277 markings/sec, 85 secs
lola: 33690076 markings, 83524936 edges, 337289 markings/sec, 90 secs
lola: 35273603 markings, 87450913 edges, 316705 markings/sec, 95 secs
lola: 36860262 markings, 91384057 edges, 317332 markings/sec, 100 secs
lola: 38436519 markings, 95292439 edges, 315251 markings/sec, 105 secs
lola: 40015017 markings, 99205742 edges, 315700 markings/sec, 110 secs
lola: 41621762 markings, 103188802 edges, 321349 markings/sec, 115 secs
lola: 43348616 markings, 107470229 edges, 345371 markings/sec, 120 secs
lola: 45107730 markings, 111831527 edges, 351823 markings/sec, 125 secs
lola: 46850558 markings, 116152492 edges, 348566 markings/sec, 130 secs
lola: 48593275 markings, 120473176 edges, 348543 markings/sec, 135 secs
lola: 50285207 markings, 124667746 edges, 338386 markings/sec, 140 secs
lola: 51977074 markings, 128862003 edges, 338373 markings/sec, 145 secs
lola: 51997670 markings, 128913199 edges, 4119 markings/sec, 150 secs
lola: 52011107 markings, 128946346 edges, 2687 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F (FIREABLE(t8))) U FIREABLE(t97)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F (FIREABLE(t8))) U FIREABLE(t97)))
lola: processed formula length: 42
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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-025-025-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t16)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t16)))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t16)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================

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

FORMULA RefineWMG-PT-025-025-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t74))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t74))))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 75
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-025-025-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t83))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t83))))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

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

FORMULA RefineWMG-PT-025-025-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t50))))
lola: processed formula length: 25
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(t81) U FIREABLE(t64)) OR (F (FIREABLE(t64)) AND F (G (FIREABLE(t76)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((FIREABLE(t81) U FIREABLE(t64)) OR (F (FIREABLE(t64)) AND F (G (FIREABLE(t76)))))))
lola: processed formula length: 90
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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-025-025-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F (FIREABLE(t43)) U FIREABLE(t87)) U G ((F (FIREABLE(t46)) AND (FIREABLE(t54) OR FIREABLE(t46))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (FIREABLE(t43)) U FIREABLE(t87)) U G ((F (FIREABLE(t46)) AND (FIREABLE(t54) OR FIREABLE(t46))))))
lola: processed formula length: 104
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G (FIREABLE(t68))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (FIREABLE(t68))))))
lola: processed formula length: 33
lola: 36 rewrites
lola: closed formula file RefineWMG-PT-025-025-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1878800 markings, 4657864 edges, 375760 markings/sec, 0 secs
lola: 3760988 markings, 9324288 edges, 376438 markings/sec, 5 secs
lola: 5661593 markings, 14035681 edges, 380121 markings/sec, 10 secs
lola: 7538411 markings, 18689284 edges, 375364 markings/sec, 15 secs
lola: 9444704 markings, 23415015 edges, 381259 markings/sec, 20 secs
lola: 11300030 markings, 28015191 edges, 371065 markings/sec, 25 secs
lola: 13131886 markings, 32556210 edges, 366371 markings/sec, 30 secs
lola: 14967212 markings, 37106684 edges, 367065 markings/sec, 35 secs
lola: 16789649 markings, 41624672 edges, 364487 markings/sec, 40 secs
lola: 18614928 markings, 46149839 edges, 365056 markings/sec, 45 secs
lola: 20412285 markings, 50606056 edges, 359471 markings/sec, 50 secs
lola: 22194785 markings, 55025566 edges, 356500 markings/sec, 55 secs
lola: 23996181 markings, 59491249 edges, 360279 markings/sec, 60 secs
lola: 25771310 markings, 63892185 edges, 355026 markings/sec, 65 secs
lola: 27551638 markings, 68306223 edges, 356066 markings/sec, 70 secs
lola: 29345332 markings, 72753228 edges, 358739 markings/sec, 75 secs
lola: 31123090 markings, 77160784 edges, 355552 markings/sec, 80 secs
lola: 32895178 markings, 81554048 edges, 354418 markings/sec, 85 secs
lola: 34656716 markings, 85921442 edges, 352308 markings/sec, 90 secs
lola: 36426776 markings, 90309609 edges, 354012 markings/sec, 95 secs
lola: 38213414 markings, 94738819 edges, 357328 markings/sec, 100 secs
lola: 39973631 markings, 99102886 edges, 352043 markings/sec, 105 secs
lola: 41706236 markings, 103398812 edges, 346521 markings/sec, 110 secs
lola: 43474420 markings, 107782235 edges, 353637 markings/sec, 115 secs
lola: 45219798 markings, 112109619 edges, 349076 markings/sec, 120 secs
lola: 46988035 markings, 116493189 edges, 353647 markings/sec, 125 secs
lola: 48737962 markings, 120832042 edges, 349985 markings/sec, 130 secs
lola: 50453871 markings, 125085897 edges, 343182 markings/sec, 135 secs
lola: 51993321 markings, 128902236 edges, 307890 markings/sec, 140 secs
lola: 52039879 markings, 129018135 edges, 9312 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process

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

BK_STOP 1527825260008

--------------------
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-025025"
export BK_EXAMINATION="LTLFireability"
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-025025.tgz
mv RefineWMG-PT-025025 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-025025, 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 r280-csrt-152749170300717"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;