fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r208-smll-152732257600348
Last Updated
June 26, 2018

About the Execution of LoLA for JoinFreeModules-PT-2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.300 506603.00 501599.00 4196.50 FFF?FFFFFFFFFFFF 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 12M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-2000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257600348
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527963296649

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-2000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-2000 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ JoinFreeModules-PT-2000 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 26002/65536 symbol table entries, 10032 collisions
lola: preprocessing...
lola: Size of bit vector: 320032
lola: finding significant places
lola: 10001 places, 16001 transitions, 8000 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18001 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-2000-LTLFireability.task
lola: A (X (X (X (FIREABLE(t8035))))) : A (F (F (X (X (FIREABLE(t8977)))))) : A (G (G (G ((FIREABLE(t8847) U FIREABLE(t14897)))))) : A (X (X (FIREABLE(t10124)))) : A (((G (FIREABLE(t9581)) U FIREABLE(t4657)) U X (G (F (FIREABLE(t15408)))))) : A ((G (FIREABLE(t15155)) U F (FIREABLE(t6590)))) : A (X (((FIREABLE(t6116) U FIREABLE(t13037)) U F (F (FIREABLE(t8422)))))) : A ((F (X (F (FIREABLE(t4796)))) U F (X (FIREABLE(t15814))))) : A (G (G (G (FIREABLE(t562))))) : A (X ((X (F (FIREABLE(t6627))) U X (X (FIREABLE(t192)))))) : A (G (X (F (G (FIREABLE(t13573)))))) : A (G ((F (G (FIREABLE(t653))) U X (G (FIREABLE(t8821)))))) : A (X ((F (F (FIREABLE(t6104))) U F (F (FIREABLE(t9613)))))) : A ((G (FIREABLE(t8385)) U (F (FIREABLE(t10726)) U G (FIREABLE(t3614))))) : A (F (F (X (FIREABLE(t15240))))) : A (X (F (F (G (X (FIREABLE(t4608)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (FIREABLE(t8035)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (FIREABLE(t8035)))))
lola: processed formula length: 31
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 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: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-0 FALSE 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: A (X (X (F (FIREABLE(t8977)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (FIREABLE(t8977)))))
lola: processed formula length: 31
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-1 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 (X (FIREABLE(t10124))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(t10124))))
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 18932 markings, 18941 edges, 3786 markings/sec, 0 secs
lola: 38846 markings, 38891 edges, 3983 markings/sec, 5 secs
lola: 58056 markings, 58161 edges, 3842 markings/sec, 10 secs
lola: 77878 markings, 78068 edges, 3964 markings/sec, 15 secs
lola: 97556 markings, 97856 edges, 3936 markings/sec, 20 secs
lola: 116985 markings, 117420 edges, 3886 markings/sec, 25 secs
lola: 137447 markings, 138041 edges, 4092 markings/sec, 30 secs
lola: 157238 markings, 158018 edges, 3958 markings/sec, 35 secs
lola: 177954 markings, 178944 edges, 4143 markings/sec, 40 secs
lola: 197769 markings, 198994 edges, 3963 markings/sec, 45 secs
lola: 217941 markings, 219426 edges, 4034 markings/sec, 50 secs
lola: 238055 markings, 239825 edges, 4023 markings/sec, 55 secs
lola: 257644 markings, 259724 edges, 3918 markings/sec, 60 secs
lola: 276960 markings, 279375 edges, 3863 markings/sec, 65 secs
lola: 296631 markings, 299405 edges, 3934 markings/sec, 70 secs
lola: 315841 markings, 319001 edges, 3842 markings/sec, 75 secs
lola: 334803 markings, 338372 edges, 3792 markings/sec, 80 secs
lola: 354054 markings, 358059 edges, 3850 markings/sec, 85 secs
lola: 373840 markings, 378304 edges, 3957 markings/sec, 90 secs
lola: 393022 markings, 397972 edges, 3836 markings/sec, 95 secs
lola: 412055 markings, 417514 edges, 3807 markings/sec, 100 secs
lola: 431631 markings, 437626 edges, 3915 markings/sec, 105 secs
lola: 450640 markings, 457195 edges, 3802 markings/sec, 110 secs
lola: 469414 markings, 476554 edges, 3755 markings/sec, 115 secs
lola: 488648 markings, 496398 edges, 3847 markings/sec, 120 secs
lola: 507261 markings, 515517 edges, 3723 markings/sec, 125 secs
lola: 526188 markings, 535099 edges, 3785 markings/sec, 130 secs
lola: 545436 markings, 555027 edges, 3850 markings/sec, 135 secs
lola: 563544 markings, 573840 edges, 3622 markings/sec, 140 secs
lola: 581677 markings, 592703 edges, 3627 markings/sec, 145 secs
lola: 600605 markings, 612273 edges, 3786 markings/sec, 150 secs
lola: 619356 markings, 631759 edges, 3750 markings/sec, 155 secs
lola: 637596 markings, 650799 edges, 3648 markings/sec, 160 secs
lola: 656482 markings, 670510 edges, 3777 markings/sec, 165 secs
lola: 674377 markings, 689255 edges, 3579 markings/sec, 170 secs
lola: 692781 markings, 708534 edges, 3681 markings/sec, 175 secs
lola: 710657 markings, 727128 edges, 3575 markings/sec, 180 secs
lola: 727995 markings, 745385 edges, 3468 markings/sec, 185 secs
lola: 745041 markings, 763186 edges, 3409 markings/sec, 190 secs
lola: 762099 markings, 781209 edges, 3412 markings/sec, 195 secs
lola: 779487 markings, 799387 edges, 3478 markings/sec, 200 secs
lola: 796355 markings, 817265 edges, 3374 markings/sec, 205 secs
lola: 813114 markings, 834850 edges, 3352 markings/sec, 210 secs
lola: 829566 markings, 852144 edges, 3290 markings/sec, 215 secs
lola: 845687 markings, 869340 edges, 3224 markings/sec, 220 secs
lola: 862003 markings, 886533 edges, 3263 markings/sec, 225 secs
lola: 878776 markings, 904201 edges, 3355 markings/sec, 230 secs
lola: 886018 markings, 911895 edges, 1448 markings/sec, 235 secs
lola: 886434 markings, 912312 edges, 83 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t8422))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t8422))))
lola: processed formula length: 27
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t15814))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t15814))))
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F (FIREABLE(t6627)) U X (FIREABLE(t192))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F (FIREABLE(t6627)) U X (FIREABLE(t192))))))
lola: processed formula length: 54
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 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: 6002 markings, 6002 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X (G (FIREABLE(t8821))) OR (F (G (FIREABLE(t8821))) AND F (G (FIREABLE(t653)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (G (FIREABLE(t8821))) OR (F (G (FIREABLE(t8821))) AND F (G (FIREABLE(t653)))))))
lola: processed formula length: 89
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6003 markings, 6004 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t9613))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t9613))))
lola: processed formula length: 27
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges

lola: ========================================
FORMULA JoinFreeModules-PT-2000-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t15240))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t15240))))
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola:
========================================
FORMULA JoinFreeModules-PT-2000-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t562)))
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(t562)))
lola: processed formula length: 22
lola: 45 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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(t562)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-2000-LTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-2000-LTLFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2001 markings, 2001 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t13573))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t13573))))
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 215 markings, 216 edges

FORMULA JoinFreeModules-PT-2000-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t15408))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t15408))))
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 214 markings, 214 edges

FORMULA JoinFreeModules-PT-2000-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t4608))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t4608))))
lola: processed formula length: 27
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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: 215 markings, 216 edges

FORMULA JoinFreeModules-PT-2000-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1103 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(t6590)) OR (G (FIREABLE(t15155)) AND F (FIREABLE(t6590)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(t6590)) OR (G (FIREABLE(t15155)) AND F (FIREABLE(t6590)))))
lola: processed formula length: 75
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: 12 markings, 12 edges

FORMULA JoinFreeModules-PT-2000-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F (FIREABLE(t10726)) U G (FIREABLE(t3614))) OR (G (FIREABLE(t8385)) AND F (G (FIREABLE(t3614))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (FIREABLE(t10726)) U G (FIREABLE(t3614))) OR (G (FIREABLE(t8385)) AND F (G (FIREABLE(t3614))))))
lola: processed formula length: 103
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 15 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: 12 markings, 12 edges
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(t14897)))) AND A (G ((FIREABLE(t8847) OR FIREABLE(t14897)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t8847) OR FIREABLE(t14897))))
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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G ((FIREABLE(t8847) OR FIREABLE(t14897))))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file JoinFreeModules-PT-2000-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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t8847) AND NOT FIREABLE(t14897))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-2000-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(t10124))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (FIREABLE(t10124))))
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file JoinFreeModules-PT-2000-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 19309 markings, 19319 edges, 3862 markings/sec, 0 secs
lola: 39174 markings, 39219 edges, 3973 markings/sec, 5 secs
lola: 58324 markings, 58428 edges, 3830 markings/sec, 10 secs
lola: 78388 markings, 78577 edges, 4013 markings/sec, 15 secs
lola: 98114 markings, 98414 edges, 3945 markings/sec, 20 secs
lola: 117344 markings, 117779 edges, 3846 markings/sec, 25 secs
lola: 137640 markings, 138234 edges, 4059 markings/sec, 30 secs
lola: 157123 markings, 157903 edges, 3897 markings/sec, 35 secs
lola: 177707 markings, 178697 edges, 4117 markings/sec, 40 secs
lola: 197405 markings, 198629 edges, 3940 markings/sec, 45 secs
lola: 217548 markings, 219033 edges, 4029 markings/sec, 50 secs
lola: 237485 markings, 239255 edges, 3987 markings/sec, 55 secs
lola: 256686 markings, 258765 edges, 3840 markings/sec, 60 secs
lola: 275777 markings, 278191 edges, 3818 markings/sec, 65 secs
lola: 295540 markings, 298314 edges, 3953 markings/sec, 70 secs
lola: 314503 markings, 317662 edges, 3793 markings/sec, 75 secs
lola: 333537 markings, 337107 edges, 3807 markings/sec, 80 secs
lola: 352235 markings, 356239 edges, 3740 markings/sec, 85 secs
lola: 372363 markings, 376827 edges, 4026 markings/sec, 90 secs
lola: 391335 markings, 396285 edges, 3794 markings/sec, 95 secs
lola: 409986 markings, 415342 edges, 3730 markings/sec, 100 secs
lola: 429636 markings, 435522 edges, 3930 markings/sec, 105 secs
lola: 448462 markings, 454903 edges, 3765 markings/sec, 110 secs
lola: 467197 markings, 474218 edges, 3747 markings/sec, 115 secs
lola: 486399 markings, 494025 edges, 3840 markings/sec, 120 secs
lola: 504413 markings, 512669 edges, 3603 markings/sec, 125 secs
lola: 523598 markings, 532508 edges, 3837 markings/sec, 130 secs
lola: 542703 markings, 552156 edges, 3821 markings/sec, 135 secs
lola: 561292 markings, 571445 edges, 3718 markings/sec, 140 secs
lola: 579438 markings, 590316 edges, 3629 markings/sec, 145 secs
lola: 598451 markings, 610078 edges, 3803 markings/sec, 150 secs
lola: 617258 markings, 629660 edges, 3761 markings/sec, 155 secs
lola: 635517 markings, 648719 edges, 3652 markings/sec, 160 secs
lola: 654699 markings, 668727 edges, 3836 markings/sec, 165 secs
lola: 672996 markings, 687702 edges, 3659 markings/sec, 170 secs
lola: 691686 markings, 707261 edges, 3738 markings/sec, 175 secs
lola: 709773 markings, 726244 edges, 3617 markings/sec, 180 secs
lola: 727290 markings, 744681 edges, 3503 markings/sec, 185 secs
lola: 744609 markings, 762753 edges, 3464 markings/sec, 190 secs
lola: 761681 markings, 780790 edges, 3414 markings/sec, 195 secs
lola: 779235 markings, 799135 edges, 3511 markings/sec, 200 secs
lola: 796274 markings, 817183 edges, 3408 markings/sec, 205 secs
lola: 813076 markings, 834811 edges, 3360 markings/sec, 210 secs
lola: 829505 markings, 852083 edges, 3286 markings/sec, 215 secs
lola: 845680 markings, 869333 edges, 3235 markings/sec, 220 secs
lola: 862111 markings, 886642 edges, 3286 markings/sec, 225 secs
lola: 878856 markings, 904281 edges, 3349 markings/sec, 230 secs
lola: 885953 markings, 911830 edges, 1419 markings/sec, 235 secs
lola: 886283 markings, 912161 edges, 66 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-2000-LTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no unknown no no no no no no no no no no no no
lola:
preliminary result: no no no unknown no no no no no no no no no no no no
lola: memory consumption: 278364 KB
lola: time consumption: 506 seconds

BK_STOP 1527963803252

--------------------
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="JoinFreeModules-PT-2000"
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/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 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 JoinFreeModules-PT-2000, 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 r208-smll-152732257600348"
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 ;