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 4.1K May 30 21:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 30 21:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 15:59 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.3K May 28 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 28 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 28 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:16 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:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:46 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.5K May 27 04:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-8, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170000447
=====================================================================

--------------------
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 1527798387908

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb113-PT-8 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb113-PT-8 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ RERS17pb113-PT-8 @ 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 (F ((X (FIREABLE(t_20167_a20_SIGLOST)) U FIREABLE(t_15623_a6_SIGUSR2))))) : A (F ((F (G (FIREABLE(t_23404_a11_SIGINFO))) U G (G (FIREABLE(t_1385_a71_SIGPOLL)))))) : A (G (((FIREABLE(t_31093_a52_SIGFPE) U FIREABLE(t_13356_a36_SIGDEADLK)) U FIREABLE(t_26866_a12_SIGPIPE)))) : A (G ((F (G (FIREABLE(t_12396_a46_SIGHUP))) U F (G (FIREABLE(t_3661_a76_SIGTTIN)))))) : A (F (X (X (G (G (FIREABLE(t_25579_a28_SIGPWR))))))) : A ((FIREABLE(t_11131_a14_SIGLOST) U X (F (FIREABLE(t_13937_a54_SIGFPE))))) : A (FIREABLE(t_30811_a52_SIGFPE)) : A ((G (FIREABLE(t_11605_a17_SIGCONT)) U G (G (FIREABLE(t_14565_a9_SIGCONT))))) : A (F (X (X (F (X (FIREABLE(t_17872_a59_SIGPIPE))))))) : A ((FIREABLE(t_18232_a59_SIGPIPE) U FIREABLE(t_29291_a26_SIGPWR))) : A ((FIREABLE(t_799_a79_SIGKILL) U G ((FIREABLE(t_10742_a40_SIGTRAP) U FIREABLE(t_30321_a7_SIGSTOP))))) : A (X (F (F ((FIREABLE(t_5329_a43_SIGDEADLK) U FIREABLE(t_29774_a77_SIGTTIN)))))) : A (((X (FIREABLE(t_10534_a40_SIGTRAP)) U G (FIREABLE(t_9647_a45_SIGTSTP))) U G (F (FIREABLE(t_20395_a20_SIGLOST))))) : A (X (G (G (G (X (FIREABLE(t_1795_a71_SIGPOLL))))))) : A (G (F (F (G (X (FIREABLE(t_29402_a38_SIGCHLD))))))) : A (FIREABLE(t_1146_a79_SIGKILL))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:374
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_30811_a52_SIGFPE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_30811_a52_SIGFPE)
lola: processed formula length: 28
lola: 37 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-6 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_1146_a79_SIGKILL)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_1146_a79_SIGKILL)
lola: processed formula length: 28
lola: 37 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F (FIREABLE(t_17872_a59_SIGPIPE))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F (FIREABLE(t_17872_a59_SIGPIPE))))))
lola: processed formula length: 49
lola: 37 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: 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-8 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: A (X (F (FIREABLE(t_29774_a77_SIGTTIN))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t_29774_a77_SIGTTIN))))
lola: processed formula length: 41
lola: 37 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: 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-11 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: A (X (X (G (FIREABLE(t_1795_a71_SIGPOLL)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (FIREABLE(t_1795_a71_SIGPOLL)))))
lola: processed formula length: 44
lola: 37 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: 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-13 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 ((FIREABLE(t_11131_a14_SIGLOST) U X (F (FIREABLE(t_13937_a54_SIGFPE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(t_11131_a14_SIGLOST) U X (F (FIREABLE(t_13937_a54_SIGFPE)))))
lola: processed formula length: 74
lola: 37 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-5 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 (G (F (FIREABLE(t_20395_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_20395_a20_SIGLOST))))
lola: processed formula length: 41
lola: 37 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: 263 markings, 262 edges, 53 markings/sec, 0 secs
lola: 547 markings, 546 edges, 57 markings/sec, 5 secs
lola: 826 markings, 825 edges, 56 markings/sec, 10 secs
lola: 1113 markings, 1112 edges, 57 markings/sec, 15 secs
lola: 1394 markings, 1393 edges, 56 markings/sec, 20 secs
lola: 1677 markings, 1676 edges, 57 markings/sec, 25 secs
lola: 1960 markings, 1959 edges, 57 markings/sec, 30 secs
lola: 2237 markings, 2236 edges, 55 markings/sec, 35 secs
lola: 2512 markings, 2511 edges, 55 markings/sec, 40 secs
lola: 2791 markings, 2790 edges, 56 markings/sec, 45 secs
lola: 3078 markings, 3077 edges, 57 markings/sec, 50 secs
lola: 3358 markings, 3357 edges, 56 markings/sec, 55 secs
lola: 3633 markings, 3632 edges, 55 markings/sec, 60 secs
lola: 3912 markings, 3911 edges, 56 markings/sec, 65 secs
lola: 4186 markings, 4185 edges, 55 markings/sec, 70 secs
lola: 4462 markings, 4461 edges, 55 markings/sec, 75 secs
lola: 4745 markings, 4744 edges, 57 markings/sec, 80 secs
lola: 5026 markings, 5025 edges, 56 markings/sec, 85 secs
lola: 5317 markings, 5316 edges, 58 markings/sec, 90 secs
lola: 5600 markings, 5599 edges, 57 markings/sec, 95 secs
lola: 5876 markings, 5875 edges, 55 markings/sec, 100 secs
lola: 6156 markings, 6155 edges, 56 markings/sec, 105 secs
lola: 6435 markings, 6434 edges, 56 markings/sec, 110 secs
lola: 6720 markings, 6719 edges, 57 markings/sec, 115 secs
lola: 6997 markings, 6996 edges, 55 markings/sec, 120 secs
lola: 7273 markings, 7272 edges, 55 markings/sec, 125 secs
lola: 7546 markings, 7545 edges, 55 markings/sec, 130 secs
lola: 7824 markings, 7823 edges, 56 markings/sec, 135 secs
lola: 8097 markings, 8096 edges, 55 markings/sec, 140 secs
lola: 8370 markings, 8369 edges, 55 markings/sec, 145 secs
lola: 8656 markings, 8655 edges, 57 markings/sec, 150 secs
lola: 8943 markings, 8942 edges, 57 markings/sec, 155 secs
lola: 9227 markings, 9226 edges, 57 markings/sec, 160 secs
lola: 9514 markings, 9513 edges, 57 markings/sec, 165 secs
lola: 9787 markings, 9786 edges, 55 markings/sec, 170 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: 9882 markings, 9882 edges

FORMULA RERS17pb113-PT-1-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_15623_a6_SIGUSR2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_15623_a6_SIGUSR2))))
lola: processed formula length: 40
lola: 37 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: 294 markings, 293 edges, 59 markings/sec, 0 secs
lola: 573 markings, 572 edges, 56 markings/sec, 5 secs
lola: 849 markings, 848 edges, 55 markings/sec, 10 secs
lola: 1122 markings, 1121 edges, 55 markings/sec, 15 secs
lola: 1398 markings, 1397 edges, 55 markings/sec, 20 secs
lola: 1668 markings, 1667 edges, 54 markings/sec, 25 secs
lola: 1940 markings, 1939 edges, 54 markings/sec, 30 secs
lola: 2205 markings, 2204 edges, 53 markings/sec, 35 secs
lola: 2470 markings, 2469 edges, 53 markings/sec, 40 secs
lola: 2737 markings, 2736 edges, 53 markings/sec, 45 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: 2819 markings, 2819 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 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_29402_a38_SIGCHLD))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_29402_a38_SIGCHLD))))
lola: processed formula length: 41
lola: 37 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: 287 markings, 286 edges, 57 markings/sec, 0 secs
lola: 565 markings, 564 edges, 56 markings/sec, 5 secs
lola: 836 markings, 835 edges, 54 markings/sec, 10 secs
lola: 1099 markings, 1098 edges, 53 markings/sec, 15 secs
lola: 1373 markings, 1372 edges, 55 markings/sec, 20 secs
lola: 1677 markings, 1676 edges, 61 markings/sec, 25 secs
lola: 1966 markings, 1965 edges, 58 markings/sec, 30 secs
lola: 2236 markings, 2235 edges, 54 markings/sec, 35 secs
lola: 2506 markings, 2505 edges, 54 markings/sec, 40 secs
lola: 2780 markings, 2779 edges, 55 markings/sec, 45 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: 2820 markings, 2821 edges

FORMULA RERS17pb113-PT-1-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t_25579_a28_SIGPWR))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t_25579_a28_SIGPWR))))
lola: processed formula length: 40
lola: 37 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: 270 markings, 269 edges, 54 markings/sec, 0 secs
lola: 545 markings, 544 edges, 55 markings/sec, 5 secs
lola: 822 markings, 821 edges, 55 markings/sec, 10 secs
lola: 1090 markings, 1089 edges, 54 markings/sec, 15 secs
lola: 1360 markings, 1359 edges, 54 markings/sec, 20 secs
lola: 1630 markings, 1629 edges, 54 markings/sec, 25 secs
lola: 1899 markings, 1898 edges, 54 markings/sec, 30 secs
lola: 2173 markings, 2172 edges, 55 markings/sec, 35 secs
lola: 2445 markings, 2444 edges, 54 markings/sec, 40 secs
lola: 2724 markings, 2723 edges, 56 markings/sec, 45 secs
lola: 3000 markings, 2999 edges, 55 markings/sec, 50 secs
lola: 3275 markings, 3274 edges, 55 markings/sec, 55 secs
lola: 3549 markings, 3548 edges, 55 markings/sec, 60 secs
lola: 3821 markings, 3820 edges, 54 markings/sec, 65 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: 3829 markings, 3830 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 10 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F (G (FIREABLE(t_3661_a76_SIGTTIN))) OR (F (G (FIREABLE(t_3661_a76_SIGTTIN))) AND F (G (FIREABLE(t_12396_a46_SIGHUP)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F (G (FIREABLE(t_3661_a76_SIGTTIN))) OR (F (G (FIREABLE(t_3661_a76_SIGTTIN))) AND F (G (FIREABLE(t_12396_a46_SIGHUP)))))))
lola: processed formula length: 129
lola: 37 rewrites
lola: closed formula file RERS17pb113-PT-1-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 271 markings, 270 edges, 54 markings/sec, 0 secs
lola: 560 markings, 559 edges, 58 markings/sec, 5 secs
lola: 875 markings, 874 edges, 63 markings/sec, 10 secs
lola: 1192 markings, 1191 edges, 63 markings/sec, 15 secs
lola: 1514 markings, 1513 edges, 64 markings/sec, 20 secs
lola: 1847 markings, 1846 edges, 67 markings/sec, 25 secs
lola: 2203 markings, 2202 edges, 71 markings/sec, 30 secs
lola: 2546 markings, 2545 edges, 69 markings/sec, 35 secs
lola: 2888 markings, 2887 edges, 68 markings/sec, 40 secs
lola: 3200 markings, 3199 edges, 62 markings/sec, 45 secs
lola: 3577 markings, 3576 edges, 75 markings/sec, 50 secs
lola: 3908 markings, 3907 edges, 66 markings/sec, 55 secs
lola: 4215 markings, 4214 edges, 61 markings/sec, 60 secs
lola: 4569 markings, 4568 edges, 71 markings/sec, 65 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: 4837 markings, 4837 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 11 will run for 626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G (FIREABLE(t_1385_a71_SIGPOLL)) OR (F (G (FIREABLE(t_1385_a71_SIGPOLL))) AND F (G (FIREABLE(t_23404_a11_SIGINFO)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (FIREABLE(t_1385_a71_SIGPOLL)) OR (F (G (FIREABLE(t_1385_a71_SIGPOLL))) AND F (G (FIREABLE(t_23404_a11_SIGINFO)))))))
lola: processed formula length: 126
lola: 37 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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 280 markings, 279 edges, 56 markings/sec, 0 secs
lola: 560 markings, 559 edges, 56 markings/sec, 5 secs
lola: 838 markings, 837 edges, 56 markings/sec, 10 secs
lola: 1110 markings, 1109 edges, 54 markings/sec, 15 secs
lola: 1387 markings, 1386 edges, 55 markings/sec, 20 secs
lola: 1670 markings, 1669 edges, 57 markings/sec, 25 secs
lola: 1946 markings, 1945 edges, 55 markings/sec, 30 secs
lola: 2233 markings, 2232 edges, 57 markings/sec, 35 secs
lola: 2499 markings, 2498 edges, 53 markings/sec, 40 secs
lola: 2766 markings, 2765 edges, 53 markings/sec, 45 secs
lola: 3049 markings, 3048 edges, 57 markings/sec, 50 secs
lola: 3327 markings, 3326 edges, 56 markings/sec, 55 secs
lola: 3588 markings, 3587 edges, 52 markings/sec, 60 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: 3829 markings, 3830 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 12 will run for 765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(t_14565_a9_SIGCONT)) OR (G (FIREABLE(t_11605_a17_SIGCONT)) AND F (G (FIREABLE(t_14565_a9_SIGCONT))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (FIREABLE(t_14565_a9_SIGCONT)) OR (G (FIREABLE(t_11605_a17_SIGCONT)) AND F (G (FIREABLE(t_14565_a9_SIGCONT))))))
lola: processed formula length: 118
lola: 37 rewrites
lola: closed formula file RERS17pb113-PT-1-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 257 markings, 256 edges, 51 markings/sec, 0 secs
lola: 519 markings, 518 edges, 52 markings/sec, 5 secs
lola: 791 markings, 790 edges, 54 markings/sec, 10 secs
lola: 1058 markings, 1057 edges, 53 markings/sec, 15 secs
lola: 1331 markings, 1330 edges, 55 markings/sec, 20 secs
lola: 1597 markings, 1596 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: 1810 markings, 1810 edges

FORMULA RERS17pb113-PT-1-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1009 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t_799_a79_SIGKILL) U G ((F (FIREABLE(t_30321_a7_SIGSTOP)) AND (FIREABLE(t_10742_a40_SIGTRAP) OR FIREABLE(t_30321_a7_SIGSTOP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(t_799_a79_SIGKILL) U G ((F (FIREABLE(t_30321_a7_SIGSTOP)) AND (FIREABLE(t_10742_a40_SIGTRAP) OR FIREABLE(t_30321_a7_SIGSTOP))))))
lola: processed formula length: 142
lola: 37 rewrites
lola: closed formula file RERS17pb113-PT-1-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: 273 markings, 272 edges, 55 markings/sec, 0 secs
lola: 534 markings, 533 edges, 52 markings/sec, 5 secs
lola: 803 markings, 802 edges, 54 markings/sec, 10 secs
lola: 1070 markings, 1069 edges, 53 markings/sec, 15 secs
lola: 1328 markings, 1327 edges, 52 markings/sec, 20 secs
lola: 1590 markings, 1589 edges, 52 markings/sec, 25 secs
lola: 1848 markings, 1847 edges, 52 markings/sec, 30 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: 1959 markings, 1959 edges

FORMULA RERS17pb113-PT-1-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t_18232_a59_SIGPIPE) U FIREABLE(t_29291_a26_SIGPWR)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((FIREABLE(t_18232_a59_SIGPIPE) U FIREABLE(t_29291_a26_SIGPWR)))
lola: processed formula length: 66
lola: 41 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges

FORMULA RERS17pb113-PT-1-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 2992 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(t_26866_a12_SIGPIPE)))) AND A (G (((FIREABLE(t_31093_a52_SIGFPE) U FIREABLE(t_13356_a36_SIGDEADLK)) OR FIREABLE(t_26866_a12_SIGPIPE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2992 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(t_26866_a12_SIGPIPE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t_26866_a12_SIGPIPE))))
lola: processed formula length: 41
lola: 37 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: 527 markings, 526 edges, 53 markings/sec, 5 secs
lola: 802 markings, 801 edges, 55 markings/sec, 10 secs
lola: 1098 markings, 1097 edges, 59 markings/sec, 15 secs
lola: 1381 markings, 1380 edges, 57 markings/sec, 20 secs
lola: 1672 markings, 1671 edges, 58 markings/sec, 25 secs
lola: 1944 markings, 1943 edges, 54 markings/sec, 30 secs
lola: 2220 markings, 2219 edges, 55 markings/sec, 35 secs
lola: 2507 markings, 2506 edges, 57 markings/sec, 40 secs
lola: 2811 markings, 2810 edges, 61 markings/sec, 45 secs
lola: 3090 markings, 3089 edges, 56 markings/sec, 50 secs
lola: 3444 markings, 3443 edges, 71 markings/sec, 55 secs
lola: 3721 markings, 3720 edges, 55 markings/sec, 60 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: 3922 markings, 3922 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RERS17pb113-PT-1-LTLFireability-2 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: 86516 KB
lola: time consumption: 645 seconds

BK_STOP 1527799033839

--------------------
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-8"
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-8.tgz
mv RERS17pb113-PT-8 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-8, 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-152749170000447"
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 ;