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 304K
-rw-r--r-- 1 mcc users 6.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 85K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is AirplaneLD-PT-0010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-qhx2-152646140300077
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526718342967


BK_STOP 1526718399588

--------------------
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 AirplaneLD-PT-0010 as instance name.
Using AirplaneLD as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 133, 'Memory': 101.01, 'Tool': 'gspn'}, {'Time': 236, 'Memory': 112.13, 'Tool': 'lola'}, {'Time': 382, 'Memory': 111.06, 'Tool': 'lola'}, {'Time': 1825, 'Memory': 165.02, 'Tool': 'gspn'}, {'Time': 1909, 'Memory': 1777.69, 'Tool': 'marcie'}, {'Time': 1989, 'Memory': 1805.75, 'Tool': 'marcie'}, {'Time': 3035, 'Memory': 307.16, 'Tool': 'itstools'}, {'Time': 3256, 'Memory': 274.59, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.7744360902255638x far from the best tool gspn.
ReachabilityFireability lola AirplaneLD-PT-0010...

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


checking for too many tokens
===========================================================================================
AirplaneLD-PT-0010: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ AirplaneLD-PT-0010 @ 3537 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 177/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 89 places, 88 transitions, 54 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 75 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-PT-0010-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t2_2_off) AND NOT FIREABLE(t2_1_on) AND ((NOT FIREABLE(SampleLW_on) AND NOT FIREABLE(SampleLW_off)) OR NOT FIREABLE(t2_1_on) OR (NOT FIREABLE(t3_2_10) AND NOT FIREABLE(t3_2_11) AND NOT FIREABLE(t3_2_12) AND NOT FIREABLE(t3_2_13) AND NOT FIREABLE(t3_2_14) AND NOT FIREABLE(t3_2_15) AND NOT FIREABLE(t3_2_16) AND NOT FIREABLE(t3_2_17) AND NOT FIREABLE(t3_2_18) AND NOT FIREABLE(t3_2_19) AND NOT FIREABLE(t3_2_20) AND NOT FIREABLE(t1_2_off)))))) : E (F ((FIREABLE(t3_1_1) OR FIREABLE(t3_1_2) OR FIREABLE(t3_1_3) OR FIREABLE(t3_1_4) OR FIREABLE(t3_1_5) OR FIREABLE(t3_1_6) OR FIREABLE(t3_1_7) OR FIREABLE(t3_1_8) OR FIREABLE(t3_1_9)))) : E (F ((FIREABLE(t3_1_1) OR FIREABLE(t3_1_2) OR FIREABLE(t3_1_3) OR FIREABLE(t3_1_4) OR FIREABLE(t3_1_5) OR FIREABLE(t3_1_6) OR FIREABLE(t3_1_7) OR FIREABLE(t3_1_8) OR FIREABLE(t3_1_9)))) : A (G (((NOT FIREABLE(t4_1_6) AND NOT FIREABLE(t4_1_7) AND NOT FIREABLE(t4_1_8) AND NOT FIREABLE(t4_1_9)) OR ((FIREABLE(t5_2_1) OR FIREABLE(t5_2_2) OR FIREABLE(t5_2_3) OR FIREABLE(t5_2_4) OR FIREABLE(t5_2_5) OR FIREABLE(t5_2_10)) AND FIREABLE(t1_1_on)) OR ((FIREABLE(t1_2_off)) AND (FIREABLE(t5_2_1) OR FIREABLE(t5_2_2) OR FIREABLE(t5_2_3) OR FIREABLE(t5_2_4) OR FIREABLE(t5_2_5) OR FIREABLE(t5_2_10) OR FIREABLE(SampleRW_on) OR FIREABLE(SampleRW_off))) OR ((FIREABLE(SpeedLW_1) OR FIREABLE(SpeedLW_2) OR FIREABLE(SpeedLW_3) OR FIREABLE(SpeedLW_4) OR FIREABLE(SpeedLW_5) OR FIREABLE(SpeedLW_6) OR FIREABLE(SpeedLW_7) OR FIREABLE(SpeedLW_8) OR FIREABLE(SpeedLW_9) OR FIREABLE(SpeedLW_10)) AND (((FIREABLE(t3_2_10) OR FIREABLE(t3_2_11) OR FIREABLE(t3_2_12) OR FIREABLE(t3_2_13) OR FIREABLE(t3_2_14) OR FIREABLE(t3_2_15) OR FIREABLE(t3_2_16) OR FIREABLE(t3_2_17) OR FIREABLE(t3_2_18) OR FIREABLE(t3_2_19) OR FIREABLE(t3_2_20)) AND (FIREABLE(t4_1_6) OR FIREABLE(t4_1_7) OR FIREABLE(t4_1_8) OR FIREABLE(t4_1_9))) OR ((FIREABLE(SpeedLW_1) OR FIREABLE(SpeedLW_2) OR FIREABLE(SpeedLW_3) OR FIREABLE(SpeedLW_4) OR FIREABLE(SpeedLW_5) OR FIREABLE(SpeedLW_6) OR FIREABLE(SpeedLW_7) OR FIREABLE(SpeedLW_8) OR FIREABLE(SpeedLW_9) OR FIREABLE(SpeedLW_10)) AND FIREABLE(t2_1_on))))))) : E (F ((FIREABLE(t2_1_on) AND (FIREABLE(t5_1_6) OR FIREABLE(t5_1_7) OR FIREABLE(t5_1_8) OR FIREABLE(t5_1_9)) AND (FIREABLE(t4_1_6) OR FIREABLE(t4_1_7) OR FIREABLE(t4_1_8) OR FIREABLE(t4_1_9) OR FIREABLE(t1_1_on))))) : A (G ((NOT FIREABLE(t2_1_on) OR (NOT FIREABLE(SampleLW_on) AND NOT FIREABLE(SampleLW_off))))) : A (G ((FIREABLE(t4_1_6) OR FIREABLE(t4_1_7) OR FIREABLE(t4_1_8) OR FIREABLE(t4_1_9) OR (NOT FIREABLE(t4_1_6) AND NOT FIREABLE(t4_1_7) AND NOT FIREABLE(t4_1_8) AND NOT FIREABLE(t4_1_9) AND NOT FIREABLE(SampleRW_on) AND NOT FIREABLE(SampleRW_off)) OR (((NOT FIREABLE(t3_2_10) AND NOT FIREABLE(t3_2_11) AND NOT FIREABLE(t3_2_12) AND NOT FIREABLE(t3_2_13) AND NOT FIREABLE(t3_2_14) AND NOT FIREABLE(t3_2_15) AND NOT FIREABLE(t3_2_16) AND NOT FIREABLE(t3_2_17) AND NOT FIREABLE(t3_2_18) AND NOT FIREABLE(t3_2_19) AND NOT FIREABLE(t3_2_20)) OR (NOT FIREABLE(getAlt_1) AND NOT FIREABLE(getAlt_2) AND NOT FIREABLE(getAlt_3) AND NOT FIREABLE(getAlt_4) AND NOT FIREABLE(getAlt_5) AND NOT FIREABLE(getAlt_6) AND NOT FIREABLE(getAlt_7) AND NOT FIREABLE(getAlt_8) AND NOT FIREABLE(getAlt_9) AND NOT FIREABLE(getAlt_10) AND NOT FIREABLE(getAlt_11) AND NOT FIREABLE(getAlt_12) AND NOT FIREABLE(getAlt_13) AND NOT FIREABLE(getAlt_14) AND NOT FIREABLE(getAlt_15) AND NOT FIREABLE(getAlt_16) AND NOT FIREABLE(getAlt_17) AND NOT FIREABLE(getAlt_18) AND NOT FIREABLE(getAlt_19) AND NOT FIREABLE(getAlt_20))) AND ((NOT FIREABLE(t3_2_10) AND NOT FIREABLE(t3_2_11) AND NOT FIREABLE(t3_2_12) AND NOT FIREABLE(t3_2_13) AND NOT FIREABLE(t3_2_14) AND NOT FIREABLE(t3_2_15) AND NOT FIREABLE(t3_2_16) AND NOT FIREABLE(t3_2_17) AND NOT FIREABLE(t3_2_18) AND NOT FIREABLE(t3_2_19) AND NOT FIREABLE(t3_2_20)) OR (NOT FIREABLE(SpeedLW_1) AND NOT FIREABLE(SpeedLW_2) AND NOT FIREABLE(SpeedLW_3) AND NOT FIREABLE(SpeedLW_4) AND NOT FIREABLE(SpeedLW_5) AND NOT FIREABLE(SpeedLW_6) AND NOT FIREABLE(SpeedLW_7) AND NOT FIREABLE(SpeedLW_8) AND NOT FIREABLE(SpeedLW_9) AND NOT FIREABLE(SpeedLW_10))))))) : E (F ((FIREABLE(t4_2_1) OR FIREABLE(t4_2_2) OR FIREABLE(t4_2_3) OR FIREABLE(t4_2_4) OR FIREABLE(t4_2_5) OR FIREABLE(t4_2_10)))) : E (F ((((FIREABLE(getAlt_6) OR FIREABLE(SpeedRW_1)) AND NOT FIREABLE(t5_2_10) AND FIREABLE(t3_1_2)) OR FIREABLE(t3_2_11)))) : A (G (((FIREABLE(t3_1_2) AND NOT FIREABLE(t4_2_3) AND (FIREABLE(SpeedLW_8) OR FIREABLE(t4_1_6) OR FIREABLE(t5_2_5) OR FIREABLE(t5_1_8))) OR (NOT FIREABLE(t3_2_14) AND NOT FIREABLE(t3_1_5) AND (NOT FIREABLE(getAlt_13) OR NOT FIREABLE(t3_1_2)))))) : A (G ((NOT FIREABLE(t4_2_3) OR (FIREABLE(t3_2_15) AND FIREABLE(getAlt_7) AND NOT FIREABLE(SpeedRW_2))))) : E (F ((NOT FIREABLE(getAlt_4) AND FIREABLE(t3_1_6) AND (FIREABLE(getAlt_20) OR FIREABLE(t2_2_off) OR FIREABLE(t5_2_4) OR FIREABLE(t4_1_8) OR FIREABLE(t4_2_10))))) : A (G (NOT FIREABLE(t4_2_2))) : E (F (FIREABLE(t2_2_off))) : A (G (NOT FIREABLE(t4_2_3))) : A (G ((((NOT FIREABLE(t3_2_19) OR NOT FIREABLE(t4_2_3)) AND (NOT FIREABLE(SampleRW_off) OR NOT FIREABLE(getAlt_16))) OR NOT FIREABLE(t5_2_2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2_2_off) AND NOT FIREABLE(t2_1_on) AND ((NOT FIREABLE(SampleLW_on) AND NOT FIREABLE(SampleLW_off)) OR NOT FIREABLE(t2_1_on) OR (NOT FIREABLE(t3_2_10) AND NOT FIREABLE(t3_2_11) AND NOT FIREABLE(t3_2_12) AND NOT FIREABLE(t3_2_13) AND NOT FIREABLE(t3_2_14) AND NOT FIREABLE(t3_2_15) AND NOT FIREABLE(t3_2_16) AND NOT FIREABLE(t3_2_17) AND NOT FIREABLE(t3_2_18) AND NOT FIREABLE(t3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 148 literals and 26 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3_1_1) OR FIREABLE(t3_1_2) OR FIREABLE(t3_1_3) OR FIREABLE(t3_1_4) OR FIREABLE(t3_1_5) OR FIREABLE(t3_1_6) OR FIREABLE(t3_1_7) OR FIREABLE(t3_1_8) OR FIREABLE(t3_1_9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3_1_1) OR FIREABLE(t3_1_2) OR FIREABLE(t3_1_3) OR FIREABLE(t3_1_4) OR FIREABLE(t3_1_5) OR FIREABLE(t3_1_6) OR FIREABLE(t3_1_7) OR FIREABLE(t3_1_8) OR FIREABLE(t3_1_9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t4_1_6) AND NOT FIREABLE(t4_1_7) AND NOT FIREABLE(t4_1_8) AND NOT FIREABLE(t4_1_9)) OR ((FIREABLE(t5_2_1) OR FIREABLE(t5_2_2) OR FIREABLE(t5_2_3) OR FIREABLE(t5_2_4) OR FIREABLE(t5_2_5) OR FIREABLE(t5_2_10)) AND FIREABLE(t1_1_on)) OR ((FIREABLE(t1_2_off)) AND (FIREABLE(t5_2_1) OR FIREABLE(t5_2_2) OR FIREABLE(t5_2_3) OR FIREABLE(t5_2_4) OR FIREABLE(t5_2_5) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: lola: state equation: calling and running sara
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2_1_on) AND (FIREABLE(t5_1_6) OR FIREABLE(t5_1_7) OR FIREABLE(t5_1_8) OR FIREABLE(t5_1_9)) AND (FIREABLE(t4_1_6) OR FIREABLE(t4_1_7) OR FIREABLE(t4_1_8) OR FIREABLE(t4_1_9) OR FIREABLE(t1_1_on)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 120 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-4.sara
sara: try reading problem file AirplaneLD-PT-0010-ReachabilityFireability-2.sara.
lola: state equation: calling and running sara
sara: sara: try reading problem file AirplaneLD-PT-0010-ReachabilityFireability-4.sara.place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 7313 markings, 9162 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2_1_on) OR (NOT FIREABLE(SampleLW_on) AND NOT FIREABLE(SampleLW_off)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-5.sara
lola: state equation: calling and running sara

sara: try reading problem file AirplaneLD-PT-0010-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4_1_6) OR FIREABLE(t4_1_7) OR FIREABLE(t4_1_8) OR FIREABLE(t4_1_9) OR (NOT FIREABLE(t4_1_6) AND NOT FIREABLE(t4_1_7) AND NOT FIREABLE(t4_1_8) AND NOT FIREABLE(t4_1_9) AND NOT FIREABLE(SampleRW_on) AND NOT FIREABLE(SampleRW_off)) OR (((NOT FIREABLE(t3_2_10) AND NOT FIREABLE(t3_2_11) AND NOT FIREABLE(t3_2_12) AND NOT FIREABLE(t3_2_13) AND NOT FIREABLE(t3_2_14) AND NOT FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 154 markings, 185 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4_2_1) OR FIREABLE(t4_2_2) OR FIREABLE(t4_2_3) OR FIREABLE(t4_2_4) OR FIREABLE(t4_2_5) OR FIREABLE(t4_2_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-7.sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(getAlt_6) OR FIREABLE(SpeedRW_1)) AND NOT FIREABLE(t5_2_10) AND FIREABLE(t3_1_2)) OR FIREABLE(t3_2_11))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 22 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t3_1_2) AND NOT FIREABLE(t4_2_3) AND (FIREABLE(SpeedLW_8) OR FIREABLE(t4_1_6) OR FIREABLE(t5_2_5) OR FIREABLE(t5_1_8))) OR (NOT FIREABLE(t3_2_14) AND NOT FIREABLE(t3_1_5) AND (NOT FIREABLE(getAlt_13) OR NOT FIREABLE(t3_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: 6 markings, 5 edges
lola: state equation: Generated DNF with 340 literals and 53 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t4_2_3) OR (FIREABLE(t3_2_15) AND FIREABLE(getAlt_7) AND NOT FIREABLE(SpeedRW_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 16 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(getAlt_4) AND FIREABLE(t3_1_6) AND (FIREABLE(getAlt_20) OR FIREABLE(t2_2_off) OR FIREABLE(t5_2_4) OR FIREABLE(t4_1_8) OR FIREABLE(t4_2_10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 45 literals and 9 conjunctive subformulas
sara: try reading problem file AirplaneLD-PT-0010-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file AirplaneLD-PT-0010-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 29162 markings, 58121 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t4_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2_2_off)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t4_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t3_2_19) OR NOT FIREABLE(t4_2_3)) AND (NOT FIREABLE(SampleRW_off) OR NOT FIREABLE(getAlt_16))) OR NOT FIREABLE(t5_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 474 markings, 505 edges
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes yes yes no no no no yes no yes
lola: ========================================
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="AirplaneLD-PT-0010"
export BK_EXAMINATION="ReachabilityFireability"
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/AirplaneLD-PT-0010.tgz
mv AirplaneLD-PT-0010 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 AirplaneLD-PT-0010, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-qhx2-152646140300077"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;