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

About the Execution of LoLA for SharedMemory-PT-000005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
148.540 337.00 60.00 2.50 FTTFFFFFFFFFFFFF 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 380K
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 82K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SharedMemory-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258000568
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528162321896

info: Time: 3600 - MCC
===========================================================================================
prep: translating SharedMemory-PT-000005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating SharedMemory-PT-000005 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ SharedMemory-PT-000005 @ 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: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 41
lola: finding significant places
lola: 41 places, 55 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-PT-000005-LTLFireability.task
lola: A ((((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FIREABLE(Begin_Ext_Acc_1_3) OR FIREABLE(Begin_Ext_Acc_2_3) OR FIREABLE(Begin_Ext_Acc_4_3) OR FIREABLE(Begin_Ext_Acc_5_3) OR FIREABLE(Begin_Ext_Acc_2_5) OR FIREABLE(Begin_Ext_Acc_1_5) OR FIREABLE(Begin_Ext_Acc_4_5) OR FIREABLE(Begin_Ext_Acc_3_5)) U F ((FIREABLE(Begin_Own_Acc_2) OR FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_5) OR FIREABLE(Begin_Own_Acc_3) OR FIREABLE(Begin_Own_Acc_4)))) U X (((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FIREABLE(Begin_Ext_Acc_1_3) OR FIREABLE(Begin_Ext_Acc_2_3) OR FIREABLE(Begin_Ext_Acc_4_3) OR FIREABLE(Begin_Ext_Acc_5_3) OR FIREABLE(Begin_Ext_Acc_2_5) OR FIREABLE(Begin_Ext_Acc_1_5) OR FIREABLE(Begin_Ext_Acc_4_5) OR FIREABLE(Begin_Ext_Acc_3_5)) U (FIREABLE(End_Own_Acc_5_5) OR FIREABLE(End_Own_Acc_4_4) OR FIREABLE(End_Own_Acc_1_1) OR FIREABLE(End_Own_Acc_3_3) OR FIREABLE(End_Own_Acc_2_2)))))) : A (X (X (X ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5)))))) : A (X (F (G (F (F ((FIREABLE(Begin_Own_Acc_2) OR FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_5) OR FIREABLE(Begin_Own_Acc_3) OR FIREABLE(Begin_Own_Acc_4)))))))) : A (X (F ((G ((FIREABLE(End_Ext_Acc_4_1) OR FIREABLE(End_Ext_Acc_5_1) OR FIREABLE(End_Ext_Acc_2_1) OR FIREABLE(End_Ext_Acc_3_1) OR FIREABLE(End_Ext_Acc_5_2) OR FIREABLE(End_Ext_Acc_4_2) OR FIREABLE(End_Ext_Acc_3_2) OR FIREABLE(End_Ext_Acc_1_2) OR FIREABLE(End_Ext_Acc_5_3) OR FIREABLE(End_Ext_Acc_4_3) OR FIREABLE(End_Ext_Acc_2_3) OR FIREABLE(End_Ext_Acc_1_3) OR FIREABLE(End_Ext_Acc_5_4) OR FIREABLE(End_Ext_Acc_3_4) OR FIREABLE(End_Ext_Acc_2_4) OR FIREABLE(End_Ext_Acc_1_4) OR FIREABLE(End_Ext_Acc_4_5) OR FIREABLE(End_Ext_Acc_3_5) OR FIREABLE(End_Ext_Acc_2_5) OR FIREABLE(End_Ext_Acc_1_5))) U F ((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FIREABLE(Begin_Ext_Acc_1_3) OR FIREABLE(Begin_Ext_Acc_2_3) OR FIREABLE(Begin_Ext_Acc_4_3) OR FIREABLE(Begin_Ext_Acc_5_3) OR FIREABLE(Begin_Ext_Acc_2_5) OR FIREABLE(Begin_Ext_Acc_1_5) OR FIREABLE(Begin_Ext_Acc_4_5) OR FIREABLE(Begin_Ext_Acc_3_5))))))) : A (F (X (G (X ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5))))))) : A (X (X (F (((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5)) U (FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FIREABLE(Begin_Ext_Acc_1_3) OR FIREABLE(Begin_Ext_Acc_2_3) OR FIREABLE(Begin_Ext_Acc_4_3) OR FIREABLE(Begin_Ext_Acc_5_3) OR FIREABLE(Begin_Ext_Acc_2_5) OR FIREABLE(Begin_Ext_Acc_1_5) OR FIREABLE(Begin_Ext_Acc_4_5) OR FIREABLE(Begin_Ext_Acc_3_5))))))) : A ((FIREABLE(End_Own_Acc_5_5) OR FIREABLE(End_Own_Acc_4_4) OR FIREABLE(End_Own_Acc_1_1) OR FIREABLE(End_Own_Acc_3_3) OR FIREABLE(End_Own_Acc_2_2))) : A (F (F (G (((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5)) U (FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5))))))) : A (G (FIREABLE(Begin_Ext_Acc_5_4))) : A ((G (F (G (FIREABLE(End_Ext_Acc_4_2)))) U X (FIREABLE(Begin_Ext_Acc_5_4)))) : A ((X (X (FIREABLE(End_Ext_Acc_1_2))) U FIREABLE(Begin_Ext_Acc_4_5))) : A (F (FIREABLE(Begin_Ext_Acc_3_5))) : A (FIREABLE(Begin_Ext_Acc_5_4)) : A (F (G ((X (FIREABLE(End_Ext_Acc_3_4)) U F (FIREABLE(End_Own_Acc_4_4)))))) : A (FIREABLE(End_Ext_Acc_5_3)) : A (X (X (G (X (G (FIREABLE(End_Ext_Acc_3_2)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(End_Own_Acc_5_5) OR FIREABLE(End_Own_Acc_4_4) OR FIREABLE(End_Own_Acc_1_1) OR FIREABLE(End_Own_Acc_3_3) OR FIREABLE(End_Own_Acc_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(End_Own_Acc_5_5) OR FIREABLE(End_Own_Acc_4_4) OR FIREABLE(End_Own_Acc_1_1) OR FIREABLE(End_Own_Acc_3_3) OR FIREABLE(End_Own_Acc_2_2))
lola: processed formula length: 147
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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 SharedMemory-PT-000005-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(Begin_Ext_Acc_5_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Begin_Ext_Acc_5_4)
lola: processed formula length: 27
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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 SharedMemory-PT-000005-LTLFireability-12 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: FIREABLE(End_Ext_Acc_5_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(End_Ext_Acc_5_3)
lola: processed formula length: 25
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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 SharedMemory-PT-000005-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FIR... (shortened)
lola: processed formula length: 653
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 15 markings, 15 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((FIREABLE(Begin_Own_Acc_2) OR FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_5) OR FIREABLE(Begin_Own_Acc_3) OR FIREABLE(Begin_Own_Acc_4))) U X (((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((FIREABLE(Begin_Own_Acc_2) OR FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_5) OR FIREABLE(Begin_Own_Acc_3) OR FIREABLE(Begin_Own_Acc_4))) U X (((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begi... (shortened)
lola: processed formula length: 953
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 11 markings, 12 edges

FORMULA SharedMemory-PT-000005-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (FIREABLE(Begin_Ext_Acc_5_4)) OR (X (F (FIREABLE(Begin_Ext_Acc_5_4))) AND F (G (FIREABLE(End_Ext_Acc_4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(Begin_Ext_Acc_5_4)) OR (X (F (FIREABLE(Begin_Ext_Acc_5_4))) AND F (G (FIREABLE(End_Ext_Acc_4_2))))))
lola: processed formula length: 116
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 15 markings, 16 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (FIREABLE(End_Ext_Acc_1_2))) U FIREABLE(Begin_Ext_Acc_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (FIREABLE(End_Ext_Acc_1_2))) U FIREABLE(Begin_Ext_Acc_4_5)))
lola: processed formula length: 69
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 8 markings, 8 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5))))))
lola: processed formula length: 153
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 323 markings, 745 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((F ((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((F ((FIREABLE(Begin_Ext_Acc_1_2) OR FIREABLE(Begin_Ext_Acc_3_2) OR FIREABLE(Begin_Ext_Acc_4_2) OR FIREABLE(Begin_Ext_Acc_5_2) OR FIREABLE(Begin_Ext_Acc_2_1) OR FIREABLE(Begin_Ext_Acc_3_1) OR FIREABLE(Begin_Ext_Acc_4_1) OR FIREABLE(Begin_Ext_Acc_5_1) OR FIREABLE(Begin_Ext_Acc_1_4) OR FIREABLE(Begin_Ext_Acc_2_4) OR FIREABLE(Begin_Ext_Acc_3_4) OR FIREABLE(Begin_Ext_Acc_5_4) OR FI... (shortened)
lola: processed formula length: 1908
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 25 markings, 30 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G (FIREABLE(End_Ext_Acc_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (FIREABLE(End_Ext_Acc_3_2))))))
lola: processed formula length: 45
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 8 markings, 8 edges
lola: ========================================

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

FORMULA SharedMemory-PT-000005-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(Begin_Ext_Acc_3_5)))
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(Begin_Ext_Acc_3_5)
lola: processed formula length: 31
lola: 27 rewrites
lola: closed formula file SharedMemory-PT-000005-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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(End_Own_Acc_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(End_Own_Acc_4_4))))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 8 markings, 8 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5))) AND ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5)) OR (FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5))) AND ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5)) OR (FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_... (shortened)
lola: processed formula length: 440
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(Begin_Own_Acc_2) OR FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_5) OR FIREABLE(Begin_Own_Acc_3) OR FIREABLE(Begin_Own_Acc_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(Begin_Own_Acc_2) OR FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_5) OR FIREABLE(Begin_Own_Acc_3) OR FIREABLE(Begin_Own_Acc_4)))))
lola: processed formula length: 159
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2743 markings, 12395 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1) OR FIREABLE(Req_Ext_Acc_4) OR FIREABLE(Req_Ext_Acc_3) OR FIREABLE(Req_Ext_Acc_5)))))
lola: processed formula length: 149
lola: 25 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 8 markings, 9 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no no no no no no no no no no no
lola:
preliminary result: no yes yes no no no no no no no no no no no no no
lola: memory consumption: 14820 KB
lola: time consumption: 0 seconds

BK_STOP 1528162322233

--------------------
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="SharedMemory-PT-000005"
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/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 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 SharedMemory-PT-000005, 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-152732258000568"
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 ;