Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r077-smll-155234766300003.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is DrinkVendingMachine-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r077-smll-155234766300003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.4K Feb 10 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 10 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 6 19:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 6 19:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 23:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 3 07:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 3 07:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Jan 31 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 22K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552400777807

info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-COL-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating DrinkVendingMachine-COL-02 formula LTLFireability into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLFireability @ DrinkVendingMachine-COL-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-COL-02-LTLFireability.task
lola: A (X (G (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))) : A (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)) U G (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))) : A (F (X (G (((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48)) U (FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))))))) : A (((X ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64))) U F ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) U ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64)) U X ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48)))))) : A (F (F (G ((FIREABLE(t15) OR FIREABLE(t14)))))) : A ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64))) : A ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))) : A (F (G ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64))))) : A (F (X (F (((FIREABLE(t15) OR FIREABLE(t14)) U (FIREABLE(t13) OR FIREABLE(t12))))))) : A (F ((F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))) U X (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))))) : A (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (G ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))) : A ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))) : A (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)) U F (X (G ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64))))))) : A ((FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))) : A (F (G (G (((FIREABLE(t13) OR FIREABLE(t12)) U (FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))))) : A ((X (X ((FIREABLE(t13) OR FIREABLE(t12)))) U (X ((FIREABLE(t13) OR FIREABLE(t12))) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: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(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64))
lola: processed formula length: 141
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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-COL-02-LTLFireability-5 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))
lola: processed formula length: 67
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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-COL-02-LTLFireability-6 TRUE 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(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))
lola: processed formula length: 285
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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-COL-02-LTLFireability-11 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(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIR... (shortened)
lola: processed formula length: 573
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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-COL-02-LTLFireability-13 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 (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)) U X (G ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)) U X (G ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))))
lola: processed formula length: 151
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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: 7 markings, 7 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-1 FALSE 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(t13) OR FIREABLE(t12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(t13) OR FIREABLE(t12)))))
lola: processed formula length: 45
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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: 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-COL-02-LTLFireability-8 TRUE 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 (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))))
lola: processed formula length: 83
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: 121 markings, 179 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-9 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 ((F ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) U ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64)) U X ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) U ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64)) U X ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR ... (shortened)
lola: processed formula length: 581
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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: 103 markings, 178 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-3 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 (X (G ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8))))))
lola: processed formula length: 83
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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: 8 markings, 8 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-0 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 ((FIREABLE(t13) OR FIREABLE(t12)))) U (X ((FIREABLE(t13) OR FIREABLE(t12))) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((FIREABLE(t13) OR FIREABLE(t12)))) U (X ((FIREABLE(t13) OR FIREABLE(t12))) U (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))
lola: processed formula length: 159
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-LTLFireability.task
lola: the resulting Büchi automaton has 10 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: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-15 TRUE 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 (F (G ((FIREABLE(t15) OR FIREABLE(t14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(t15) OR FIREABLE(t14)))))
lola: processed formula length: 45
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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: 4 markings, 5 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-4 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 (G ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64)))))
lola: processed formula length: 153
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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: 7 markings, 8 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-7 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 (G ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64)))))
lola: processed formula length: 153
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-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: 7 markings, 8 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-12 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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) AND ((FIREABLE(t13) OR FIREABLE(t12)) OR (FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) AND ((FIREABLE(t13) OR FIREABLE(t12)) OR (FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))))))
lola: processed formula length: 328
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: add low 61
lola: add low 5
lola: add low 65
lola: add low 2
lola: add low 71
lola: add low 2
lola: add low 70
lola: add low 63
lola: add low 3
lola: add low 61
lola: add low 5
lola: add low 3
lola: add low 62
lola: add low 60
lola: add low 5
lola: add low 65
lola: add low 3
lola: add low 52
lola: add low 4
lola: add low 5
lola: add low 64
lola: add low 3
lola: add low 61
lola: add low 5
lola: add low 3
lola: add low 60
lola: add low 5
lola: add low 3
lola: add low 67
lola: add low 48
lola: add low 4
lola: add low 5
lola: add low 65
lola: add low 64
lola: add low 3
lola: add low 61
lola: add low 5
lola: add low 3
lola: add low 52
lola: add low 4
lola: add low 5
lola: add low 65
lola: add low 3
lola: add low 60
lola: add low 5
lola: add low 3
lola: add low 67
lola: add low 2
lola: add low 71
lola: add low 66
lola: add low 61
lola: add low 5
lola: add low 65
lola: add low 2
lola: add low 70
lola: add low 63
lola: add low 3
lola: add low 61
lola: add low 5
lola: add low 3
lola: add low 52
lola: add low 4
lola: add low 5
lola: add low 65
lola: add low 64
lola: add low 3
lola: add low 61
lola: add low 5
lola: add low 3
lola: add low 48
lola: add low 4
lola: add low 5
lola: add low 67
lola: add low 65
lola: add low 3
lola: add low 60
lola: add low 5
lola: add low 3
lola: add low 61
lola: add low 5
lola: add low 3
lola: add low 64
lola: add low 2
lola: add low 71
lola: add low 66
lola: add low 65
lola: add low 61
lola: add low 5
lola: add low 62
lola: add low 3
lola: add low 52
lola: add low 4
lola: add low 5
lola: add low 65
lola: add low 3
lola: add low 60
lola: add low 5
lola: add low 3
lola: add low 63
lola: add low 2
lola: add low 70
lola: add low 48
lola: add low 4
lola: add low 5
lola: add low 64
lola: add low 3
lola: add low 2
lola: add low 71
lola: add low 67
lola: add low 62
lola: add low 61
lola: add low 5
lola: add low 65
lola: add low 2
lola: add low 70
lola: add low 2
lola: add low 66
lola: add low 63
lola: add low 3
lola: add low 62
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: 736 markings, 2785 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-14 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 (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)) OR (G ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) AND F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)) OR (G ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) AND F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREA... (shortened)
lola: processed formula length: 430
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: 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: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-LTLFireability-10 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 ((F ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))) AND ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))) AND ((FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIRE... (shortened)
lola: processed formula length: 884
lola: 27 rewrites
lola: closed formula file DrinkVendingMachine-COL-02-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: 7 markings, 8 edges
lola: ========================================

FORMULA DrinkVendingMachine-COL-02-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 yes yes no yes no yes yes no no no yes
lola:
preliminary result: no no no no no yes yes no yes no yes yes no no no yes
lola: memory consumption: 14768 KB
lola: time consumption: 0 seconds

BK_STOP 1552400778157

--------------------
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-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is DrinkVendingMachine-COL-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 r077-smll-155234766300003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-02.tgz
mv DrinkVendingMachine-COL-02 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;