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 215M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13M May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 34M 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 6.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2M May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5M May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K 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 6.5M May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.1K 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 134M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DrinkVendingMachine-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r238-blw3-152732478300107
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528025888154


BK_STOP 1528026397465

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DrinkVendingMachine-PT-10 as instance name.
Using DrinkVendingMachine as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Extended Free Choice': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 518862, 'Memory': 10566.37, 'Tool': 'lola'}, {'Time': 547826, 'Memory': 10642.64, 'Tool': 'lola'}, {'Time': 3536390, 'Memory': 11451.27, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DrinkVendingMachine-PT-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DrinkVendingMachine-PT-10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DrinkVendingMachine-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ DrinkVendingMachine-PT-10 @ 3537 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 111280/65536 symbol table entries, 66439 collisions
lola: preprocessing...
lola: finding significant places
lola: 120 places, 111160 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48320 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-PT-10-LTLCardinality.task
lola: A ((1 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)) : A (F (F (X ((optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40))))) : A (X ((G ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) U X ((1 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1))))) : A (((3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) U F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))))) : A (G ((3 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1))) : A (X (X (((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40) U (ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10))))) : A ((F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) U F (F ((2 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40))))) : A ((1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)) : A (F ((ready_10 <= wait_26))) : A (G ((theOptions_2 <= wait_26))) : A (G (F ((optionSlots_5 <= ready_29)))) : A (F ((wait_14 <= wait_6))) : A (F (G (X (X ((wait_26 <= wait_40)))))) : A (G ((wait_24 <= theProducts_9))) : A (F ((X ((ready_14 <= optionSlots_8)) U F ((theOptions_8 <= wait_4))))) : A (F ((ready_10 <= optionSlots_9)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)
lola: processed formula length: 395
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + rea... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40))))
lola: processed formula: A (F (X ((optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_... (shortened)
lola: processed formula length: 604
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 2 unused bits
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: 105 markings, 105 edges
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) U X ((1 <= productSlots_10 + productSlots_9 + productSlots_8 + pro... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) U X ((1 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)))))
lola: processed formula: A (X ((G ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) U X ((1 <= productSlots_10 + productSlots_9 + productSlots_8 + pro... (shortened)
lola: processed formula length: 518
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2672 markings, 2761 edges, 534 markings/sec, 0 secs
lola: 5143 markings, 5355 edges, 494 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5732 markings, 6002 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) U F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) U F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)))))
lola: processed formula: A (((3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) U F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)))))
lola: processed formula length: 327
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 2 unused bits
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: 16 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40) U (ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10)))))
lola: processed formula: A (X (X (((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 ... (shortened)
lola: processed formula length: 1431
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2175 markings, 2324 edges, 435 markings/sec, 0 secs
lola: 4388 markings, 5705 edges, 443 markings/sec, 5 secs
lola: 7438 markings, 19423 edges, 610 markings/sec, 10 secs
lola: 10370 markings, 38033 edges, 586 markings/sec, 15 secs
lola: 13164 markings, 42958 edges, 559 markings/sec, 20 secs
lola: 16353 markings, 71561 edges, 638 markings/sec, 25 secs
lola: 19150 markings, 74894 edges, 559 markings/sec, 30 secs
lola: 21678 markings, 80754 edges, 506 markings/sec, 35 secs
lola: 24887 markings, 108174 edges, 642 markings/sec, 40 secs
lola: 27727 markings, 112429 edges, 568 markings/sec, 45 secs
lola: 30833 markings, 135785 edges, 621 markings/sec, 50 secs
lola: 33668 markings, 145536 edges, 567 markings/sec, 55 secs
lola: 36513 markings, 152383 edges, 569 markings/sec, 60 secs
lola: 39576 markings, 179644 edges, 613 markings/sec, 65 secs
lola: 42562 markings, 184819 edges, 597 markings/sec, 70 secs
lola: 45832 markings, 214544 edges, 654 markings/sec, 75 secs
lola: 48794 markings, 219099 edges, 592 markings/sec, 80 secs
lola: 52037 markings, 249681 edges, 649 markings/sec, 85 secs
lola: 54959 markings, 253762 edges, 584 markings/sec, 90 secs
lola: 58165 markings, 285013 edges, 641 markings/sec, 95 secs
lola: 61046 markings, 288929 edges, 576 markings/sec, 100 secs
lola: 64171 markings, 320472 edges, 625 markings/sec, 105 secs
lola: 66949 markings, 323707 edges, 556 markings/sec, 110 secs
lola: 69660 markings, 329370 edges, 542 markings/sec, 115 secs
lola: 72625 markings, 356422 edges, 593 markings/sec, 120 secs
lola: 75285 markings, 359793 edges, 532 markings/sec, 125 secs
lola: 77959 markings, 366582 edges, 535 markings/sec, 130 secs
lola: 81019 markings, 392610 edges, 612 markings/sec, 135 secs
lola: 84247 markings, 399597 edges, 646 markings/sec, 140 secs
lola: 87596 markings, 415555 edges, 670 markings/sec, 145 secs
lola: 90675 markings, 422062 edges, 616 markings/sec, 150 secs
lola: 94172 markings, 450020 edges, 699 markings/sec, 155 secs
lola: 97884 markings, 465019 edges, 742 markings/sec, 160 secs
lola: 100944 markings, 473668 edges, 612 markings/sec, 165 secs
lola: 104068 markings, 482743 edges, 625 markings/sec, 170 secs
lola: 107560 markings, 508941 edges, 698 markings/sec, 175 secs
lola: 110851 markings, 527868 edges, 658 markings/sec, 180 secs
lola: 113328 markings, 531226 edges, 495 markings/sec, 185 secs
lola: 116364 markings, 541476 edges, 607 markings/sec, 190 secs
lola: 119925 markings, 568078 edges, 712 markings/sec, 195 secs
lola: 123404 markings, 586153 edges, 696 markings/sec, 200 secs
lola: 126395 markings, 592241 edges, 598 markings/sec, 205 secs
lola: 129796 markings, 621792 edges, 680 markings/sec, 210 secs
lola: 133466 markings, 642102 edges, 734 markings/sec, 215 secs
lola: 136417 markings, 646705 edges, 590 markings/sec, 220 secs
lola: 139734 markings, 677494 edges, 663 markings/sec, 225 secs
lola: 143410 markings, 698634 edges, 735 markings/sec, 230 secs
lola: 146059 markings, 702238 edges, 530 markings/sec, 235 secs
lola: 148807 markings, 711742 edges, 550 markings/sec, 240 secs
lola: 152179 markings, 742665 edges, 674 markings/sec, 245 secs
lola: 155084 markings, 757998 edges, 581 markings/sec, 250 secs
lola: 157778 markings, 764644 edges, 539 markings/sec, 255 secs
lola: 161040 markings, 797386 edges, 652 markings/sec, 260 secs
lola: 164239 markings, 814834 edges, 640 markings/sec, 265 secs
lola: 166892 markings, 821361 edges, 531 markings/sec, 270 secs
lola: 170154 markings, 856021 edges, 652 markings/sec, 275 secs
lola: 173237 markings, 871965 edges, 617 markings/sec, 280 secs
lola: 175990 markings, 877195 edges, 551 markings/sec, 285 secs
lola: 179203 markings, 905549 edges, 643 markings/sec, 290 secs
lola: 183147 markings, 922283 edges, 789 markings/sec, 295 secs
lola: 186877 markings, 933010 edges, 746 markings/sec, 300 secs
lola: 190736 markings, 951347 edges, 772 markings/sec, 305 secs
lola: 194696 markings, 971150 edges, 792 markings/sec, 310 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) U F (F ((2 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) U F ((2 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40))))
lola: processed formula: A ((F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) U F ((2 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 +... (shortened)
lola: processed formula length: 611
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2856 markings, 3115 edges, 571 markings/sec, 0 secs
lola: 5879 markings, 8525 edges, 605 markings/sec, 5 secs
lola: 9014 markings, 22495 edges, 627 markings/sec, 10 secs
lola: 11779 markings, 25520 edges, 553 markings/sec, 15 secs
lola: 14529 markings, 29259 edges, 550 markings/sec, 20 secs
lola: 17148 markings, 35785 edges, 524 markings/sec, 25 secs
lola: 19790 markings, 52057 edges, 528 markings/sec, 30 secs
lola: 22106 markings, 55644 edges, 463 markings/sec, 35 secs
lola: 24571 markings, 58369 edges, 493 markings/sec, 40 secs
lola: 27121 markings, 61723 edges, 510 markings/sec, 45 secs
lola: 29672 markings, 66531 edges, 510 markings/sec, 50 secs
lola: 32271 markings, 73534 edges, 520 markings/sec, 55 secs
lola: 34919 markings, 85708 edges, 530 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36735 markings, 118509 edges
lola: ========================================
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)
lola: processed formula length: 165
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ready_10 <= wait_26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ready_10 <= wait_26)))
lola: processed formula: A (F ((ready_10 <= wait_26)))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
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: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((theOptions_2 <= wait_26)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((optionSlots_5 <= ready_29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((optionSlots_5 <= ready_29))))
lola: processed formula: A (G (F ((optionSlots_5 <= ready_29))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3177 markings, 5983 edges, 635 markings/sec, 0 secs
lola: 6204 markings, 12561 edges, 605 markings/sec, 5 secs
lola: 9256 markings, 22166 edges, 610 markings/sec, 10 secs
lola: 12865 markings, 44615 edges, 722 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13687 markings, 60074 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((wait_14 <= wait_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((wait_14 <= wait_6)))
lola: processed formula: A (F ((wait_14 <= wait_6)))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 1 markings, 0 edges, 0 markings/sec, 10 secs
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: ========================================
lola: subprocess 12 will run for 769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((wait_26 <= wait_40))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((wait_26 <= wait_40))))))
lola: processed formula: A (F (G (X (X ((wait_26 <= wait_40))))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 1 unused bits
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: 671 markings, 684 edges
lola: ========================================
lola: subprocess 13 will run for 1026 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((wait_24 <= theProducts_9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((ready_14 <= optionSlots_8)) U F ((theOptions_8 <= wait_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((ready_14 <= optionSlots_8)) U F ((theOptions_8 <= wait_4)))))
lola: processed formula: A (F ((X ((ready_14 <= optionSlots_8)) U F ((theOptions_8 <= wait_4)))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
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: ========================================
lola: subprocess 15 will run for 3074 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ready_10 <= optionSlots_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ready_10 <= optionSlots_9)))
lola: processed formula: A (F ((ready_10 <= optionSlots_9)))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
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: RESULT
lola:
SUMMARY: yes no no no no unknown no no yes no no yes no no yes yes
lola: ========================================
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-10.tgz
mv DrinkVendingMachine-PT-10 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 mcc4mcc-full"
echo " Input is DrinkVendingMachine-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r238-blw3-152732478300107"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;