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 312K
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DrinkVendingMachine-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-blw3-152732474200106
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527871224929

info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-PT-02 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 DrinkVendingMachine-PT-02 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ DrinkVendingMachine-PT-02 @ 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: 24
lola: finding significant places
lola: 24 places, 72 transitions, 12 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 90 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-PT-02-LTLFireability.task
lola: A ((FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate2_1_1_5_2) OR FIREABLE(elaborate2_2_1_6_2) OR FIREABLE(elaborate2_1_2_6_2) OR FIREABLE(elaborate2_2_2_6_2))) : A ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) : A ((G (F (G ((FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate2_1_1_5_2) OR FIREABLE(elaborate2_2_1_6_2) OR FIREABLE(elaborate2_1_2_6_2) OR FIREABLE(elaborate2_2_2_6_2))))) U F ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))))) : A (F ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)))) : A (F (F (X (((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) U (FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))))))) : A (F (X ((G ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2))) U X ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))))))) : A (F (X ((G ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))) U (FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)))))) : A (F (X ((X ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) U F ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))))))) : A (X (X ((FIREABLE(elaborate3_2_2_7_2_2) U X (FIREABLE(elaborate2_1_1_5_1)))))) : A (FIREABLE(elaborate1_2_3_2)) : A (FIREABLE(elaborate2_1_1_6_2)) : A (F (G ((X (FIREABLE(addOption_2)) U F (FIREABLE(elaborate3_1_1_7_2_1)))))) : A (G (X (X ((FIREABLE(elaborate3_1_1_8_1_1) U FIREABLE(elaborate3_1_2_7_1_1)))))) : A (G ((FIREABLE(addOption_2) U FIREABLE(elaborate2_2_1_6_2)))) : A ((X (G (X (FIREABLE(elaborate3_2_2_7_1_2)))) U X (FIREABLE(elaborate2_1_2_5_2)))) : A (G (X (G ((FIREABLE(elaborate2_2_2_6_1) U FIREABLE(elaborate0_2_2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1) OR FIREABLE(elaborate2_2_2_5_1) OR FIREABLE(elaborate2_1_2_5_1) OR FIREABLE(elaborate2_2_1_5_1) OR FIREABLE(elaborate2_2_1_5_2) OR FIREABLE(elaborate2_1_2_5_2) OR FIREABLE(elaborate2_2_2_5_2) OR FIREABLE(elaborate2_1_1_6_2) OR FIREABLE(elaborate2_2_1_6_1) OR FIREABLE(elaborate2_1_2_6_1) OR FIREABLE(elaborate2_2_2_6_1) OR FIR... (shortened)
lola: processed formula length: 525
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-0 TRUE 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(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))
lola: processed formula length: 173
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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 DrinkVendingMachine-PT-02-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(elaborate1_2_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(elaborate1_2_3_2)
lola: processed formula length: 26
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(elaborate2_1_1_6_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(elaborate2_1_1_6_2)
lola: processed formula length: 28
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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 DrinkVendingMachine-PT-02-LTLFireability-10 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 (X (F (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) OR (G ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))) AND F ((FIREABLE(elabo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((FIREABLE(elaborate0_1_2) OR FIREABLE(elaborate0_2_1) OR FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)) OR (G ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2))) AND F ((FIREABLE(elabo... (shortened)
lola: processed formula length: 504
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-LTLFireability.task
lola: ========================================
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: 17 markings, 20 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)))))
lola: processed formula length: 257
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: 24 markings, 24 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-7 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(elaborate3_2_2_7_2_2) U X (FIREABLE(elaborate2_1_1_5_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((FIREABLE(elaborate3_2_2_7_2_2) U X (FIREABLE(elaborate2_1_1_5_1))))))
lola: processed formula length: 79
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: 23 markings, 23 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-8 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 (F ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(elaborate1_2_3_1) OR FIREABLE(elaborate1_1_4_1) OR FIREABLE(elaborate1_2_4_1) OR FIREABLE(elaborate1_1_3_2) OR FIREABLE(elaborate1_1_3_1) OR FIREABLE(elaborate1_1_4_2) OR FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)))))
lola: processed formula length: 257
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: 24 markings, 24 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-4 FALSE 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 ((X ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) OR (G ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2))) AND X (F ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((X ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) OR (G ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2))) AND X (F ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(... (shortened)
lola: processed formula length: 438
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 298 markings, 844 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-5 TRUE 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 (G ((F (FIREABLE(elaborate3_1_2_7_1_1)) AND (FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_1_2_7_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((F (FIREABLE(elaborate3_1_2_7_1_1)) AND (FIREABLE(elaborate3_1_1_8_1_1) OR FIREABLE(elaborate3_1_2_7_1_1)))))))
lola: processed formula length: 123
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: 23 markings, 23 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-12 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 (X ((X (G (FIREABLE(elaborate3_2_2_7_1_2))) U FIREABLE(elaborate2_1_2_5_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (G (FIREABLE(elaborate3_2_2_7_1_2))) U FIREABLE(elaborate2_1_2_5_2))))
lola: processed formula length: 79
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: 23 markings, 23 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-14 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 (X (G ((F (FIREABLE(elaborate0_2_2)) AND (FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate0_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F (FIREABLE(elaborate0_2_2)) AND (FIREABLE(elaborate2_2_2_6_1) OR FIREABLE(elaborate0_2_2))))))
lola: processed formula length: 105
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: 24 markings, 24 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-15 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 (F ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2))))
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(addProduct_1) AND NOT FIREABLE(addProduct_2))
lola: processed formula length: 59
lola: 36 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-3 TRUE 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 (G (F (FIREABLE(elaborate3_1_1_7_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(elaborate3_1_1_7_2_1))))
lola: processed formula length: 42
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-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: 5 markings, 5 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-11 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 ((F ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) OR (F ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) AND F (G ((FIREABLE(elaborate2_1_1_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) OR (F ((FIREABLE(serve_3) OR FIREABLE(serve_2) OR FIREABLE(serve_5) OR FIREABLE(serve_4) OR FIREABLE(serve_1) OR FIREABLE(serve_7) OR FIREABLE(serve_6) OR FIREABLE(serve_8))) AND F (G ((FIREABLE(elaborate2_1_1_5... (shortened)
lola: processed formula length: 904
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 33 markings, 40 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-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 (G (F (FIREABLE(elaborate2_2_1_6_2)))) AND A (G ((FIREABLE(addOption_2) OR FIREABLE(elaborate2_2_1_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(addOption_2) OR FIREABLE(elaborate2_2_1_6_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G ((FIREABLE(addOption_2) OR FIREABLE(elaborate2_2_1_6_2))))
lola: processed formula length: 63
lola: 39 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(addOption_2) AND NOT FIREABLE(elaborate2_2_1_6_2))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes no yes yes no no yes no no no no no no
lola:
preliminary result: yes no yes yes no yes yes no no yes no no no no no no
lola: memory consumption: 14748 KB
lola: time consumption: 0 seconds

BK_STOP 1527871225128

--------------------
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="DrinkVendingMachine-PT-02"
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/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 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 DrinkVendingMachine-PT-02, 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 r232-blw3-152732474200106"
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 ;