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

About the Execution of LoLA for RERS17pb113-PT-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
324.610 311045.00 325415.00 92.00 FFFFFFFFFFFFFFFF 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 15M
-rw-r--r-- 1 mcc users 3.8K May 30 21:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 30 21:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 29 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.4K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 28 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 28 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.4K May 28 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:30 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:30 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 27 04:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 04:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 2 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 15M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RERS17pb113-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169900438

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

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

=== Now, execution of the tool begins

BK_START 1527797718630

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-7 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-7 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RERS17pb113-PT-7 @ 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: 31992/65536 symbol table entries, 6831 collisions
lola: preprocessing...
lola: Size of bit vector: 639
lola: finding significant places
lola: 639 places, 31353 transitions, 614 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 47274 transition conflict sets
lola: TASK
lola: reading formula from RERS17pb113-PT-1-LTLFireability.task
lola: A (G (G (F (X (G (FIREABLE(t_10220_a40_SIGTRAP))))))) : A (FIREABLE(t_26710_a35_SIGUSR2)) : A (G (F (G (F (G (FIREABLE(t_272_a79_SIGKILL))))))) : A (X (F (X ((FIREABLE(t_9423_a45_SIGTSTP) U FIREABLE(t_21410_a44_SIGINFO)))))) : A (FIREABLE(t_9890_a40_SIGTRAP)) : A (G (F (X ((FIREABLE(t_18079_a59_SIGPIPE) U FIREABLE(t_19760_a20_SIGLOST)))))) : A (G (FIREABLE(t_5674_a32_SIGWINCH))) : A (F ((G (G (FIREABLE(t_26697_a35_SIGUSR2))) U FIREABLE(t_23230_a11_SIGINFO)))) : A (F (G ((G (FIREABLE(t_1827_a71_SIGPOLL)) U X (FIREABLE(t_13583_a54_SIGFPE)))))) : A (G (FIREABLE(t_611_a79_SIGKILL))) : A (X (F (G (FIREABLE(t_7283_a72_SIGFPE))))) : A (G (G (FIREABLE(t_6934_a72_SIGFPE)))) : A (FIREABLE(t_20660_a64_SIGINFO)) : A ((X (F (X (FIREABLE(t_4121_a29_SIGCHLD)))) U (F (FIREABLE(t_30301_a7_SIGSTOP)) U F (FIREABLE(t_8594_a55_SIGPROF))))) : A (FIREABLE(t_26486_a60_SIGTERM)) : A (FIREABLE(t_2887_a76_SIGTTIN))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_26710_a35_SIGUSR2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_26710_a35_SIGUSR2)
lola: processed formula length: 29
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-LTLFireability-1 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: FIREABLE(t_9890_a40_SIGTRAP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_9890_a40_SIGTRAP)
lola: processed formula length: 28
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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

FORMULA RERS17pb113-PT-1-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_20660_a64_SIGINFO)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_20660_a64_SIGINFO)
lola: processed formula length: 29
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_26486_a60_SIGTERM)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_26486_a60_SIGTERM)
lola: processed formula length: 29
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_2887_a76_SIGTTIN)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_2887_a76_SIGTTIN)
lola: processed formula length: 28
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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 RERS17pb113-PT-1-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((X (FIREABLE(t_13583_a54_SIGFPE)) OR (G (FIREABLE(t_1827_a71_SIGPOLL)) AND X (F (FIREABLE(t_13583_a54_SIGFPE))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((X (FIREABLE(t_13583_a54_SIGFPE)) OR (G (FIREABLE(t_1827_a71_SIGPOLL)) AND X (F (FIREABLE(t_13583_a54_SIGFPE))))))))
lola: processed formula length: 125
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 11 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: 1813 markings, 1814 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (FIREABLE(t_21410_a44_SIGINFO)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (FIREABLE(t_21410_a44_SIGINFO)))))
lola: processed formula length: 45
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 1810 markings, 1810 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t_5674_a32_SIGWINCH)))
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(t_5674_a32_SIGWINCH)))
lola: processed formula length: 37
lola: 29 rewrites
lola: closed formula file RERS17pb113-PT-1-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(t_5674_a32_SIGWINCH)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t_611_a79_SIGKILL)))
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(t_611_a79_SIGKILL)))
lola: processed formula length: 35
lola: 29 rewrites
lola: closed formula file RERS17pb113-PT-1-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(t_611_a79_SIGKILL)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RERS17pb113-PT-1-LTLFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t_6934_a72_SIGFPE)))
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(t_6934_a72_SIGFPE)))
lola: processed formula length: 35
lola: 29 rewrites
lola: closed formula file RERS17pb113-PT-1-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA RERS17pb113-PT-1-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_8594_a55_SIGPROF)))
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: NOT FIREABLE(t_8594_a55_SIGPROF)
lola: processed formula length: 32
lola: 29 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.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: 276 markings, 275 edges, 55 markings/sec, 0 secs
lola: 550 markings, 549 edges, 55 markings/sec, 5 secs
lola: 817 markings, 816 edges, 53 markings/sec, 10 secs
lola: 1083 markings, 1082 edges, 53 markings/sec, 15 secs
lola: 1353 markings, 1352 edges, 54 markings/sec, 20 secs
lola: 1619 markings, 1618 edges, 53 markings/sec, 25 secs
lola: 1887 markings, 1886 edges, 54 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2067 markings, 2067 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_272_a79_SIGKILL))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_272_a79_SIGKILL))))
lola: processed formula length: 39
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 269 markings, 268 edges, 54 markings/sec, 0 secs
lola: 535 markings, 534 edges, 53 markings/sec, 5 secs
lola: 804 markings, 803 edges, 54 markings/sec, 10 secs
lola: 1076 markings, 1075 edges, 54 markings/sec, 15 secs
lola: 1341 markings, 1340 edges, 53 markings/sec, 20 secs
lola: 1609 markings, 1608 edges, 54 markings/sec, 25 secs
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: 1811 markings, 1812 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_19760_a20_SIGLOST))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_19760_a20_SIGLOST))))
lola: processed formula length: 41
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 262 markings, 261 edges, 52 markings/sec, 0 secs
lola: 528 markings, 527 edges, 53 markings/sec, 5 secs
lola: 802 markings, 801 edges, 55 markings/sec, 10 secs
lola: 1068 markings, 1067 edges, 53 markings/sec, 15 secs
lola: 1334 markings, 1333 edges, 53 markings/sec, 20 secs
lola: 1602 markings, 1601 edges, 54 markings/sec, 25 secs
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: 1810 markings, 1810 edges

FORMULA RERS17pb113-PT-1-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1150 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_7283_a72_SIGFPE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_7283_a72_SIGFPE))))
lola: processed formula length: 39
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 289 markings, 288 edges, 58 markings/sec, 0 secs
lola: 555 markings, 554 edges, 53 markings/sec, 5 secs
lola: 833 markings, 832 edges, 56 markings/sec, 10 secs
lola: 1112 markings, 1111 edges, 56 markings/sec, 15 secs
lola: 1371 markings, 1370 edges, 52 markings/sec, 20 secs
lola: 1625 markings, 1624 edges, 51 markings/sec, 25 secs
lola: 1895 markings, 1894 edges, 54 markings/sec, 30 secs
lola: 2159 markings, 2158 edges, 53 markings/sec, 35 secs
lola: 2424 markings, 2423 edges, 53 markings/sec, 40 secs
lola: 2693 markings, 2692 edges, 54 markings/sec, 45 secs
lola: 2972 markings, 2971 edges, 56 markings/sec, 50 secs
lola: 3242 markings, 3241 edges, 54 markings/sec, 55 secs
lola: 3514 markings, 3513 edges, 54 markings/sec, 60 secs
lola: 3774 markings, 3773 edges, 52 markings/sec, 65 secs
lola: 4037 markings, 4036 edges, 53 markings/sec, 70 secs
lola: 4295 markings, 4294 edges, 52 markings/sec, 75 secs
lola: 4560 markings, 4559 edges, 53 markings/sec, 80 secs
lola: 4827 markings, 4826 edges, 53 markings/sec, 85 secs
lola: 5093 markings, 5092 edges, 53 markings/sec, 90 secs
lola: 5364 markings, 5363 edges, 54 markings/sec, 95 secs
lola: 5635 markings, 5634 edges, 54 markings/sec, 100 secs
lola: 5894 markings, 5893 edges, 52 markings/sec, 105 secs
lola: 6154 markings, 6153 edges, 52 markings/sec, 110 secs
lola: 6422 markings, 6421 edges, 54 markings/sec, 115 secs
lola: 6699 markings, 6698 edges, 55 markings/sec, 120 secs
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: 6856 markings, 6857 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_10220_a40_SIGTRAP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_10220_a40_SIGTRAP))))
lola: processed formula length: 41
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 267 markings, 266 edges, 53 markings/sec, 0 secs
lola: 540 markings, 539 edges, 55 markings/sec, 5 secs
lola: 812 markings, 811 edges, 54 markings/sec, 10 secs
lola: 1079 markings, 1078 edges, 53 markings/sec, 15 secs
lola: 1348 markings, 1347 edges, 54 markings/sec, 20 secs
lola: 1615 markings, 1614 edges, 53 markings/sec, 25 secs
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: 1811 markings, 1812 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t_23230_a11_SIGINFO) OR (G (FIREABLE(t_26697_a35_SIGUSR2)) AND F (FIREABLE(t_23230_a11_SIGINFO))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((FIREABLE(t_23230_a11_SIGINFO) OR (G (FIREABLE(t_26697_a35_SIGUSR2)) AND F (FIREABLE(t_23230_a11_SIGINFO))))))
lola: processed formula length: 116
lola: 27 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 344 markings, 343 edges, 69 markings/sec, 0 secs
lola: 658 markings, 657 edges, 63 markings/sec, 5 secs
lola: 945 markings, 944 edges, 57 markings/sec, 10 secs
lola: 1259 markings, 1258 edges, 63 markings/sec, 15 secs
lola: 1555 markings, 1554 edges, 59 markings/sec, 20 secs
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: 1811 markings, 1811 edges
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no no no no
lola: memory consumption: 86432 KB
lola: time consumption: 310 seconds

BK_STOP 1527798029675

--------------------
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="RERS17pb113-PT-7"
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/RERS17pb113-PT-7.tgz
mv RERS17pb113-PT-7 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 RERS17pb113-PT-7, 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-152749169900438"
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 ;