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-structural
Input is AirplaneLD-PT-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-qhx2-152646141500073
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526738390629


BK_STOP 1526738445941

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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 bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 227, 'Memory': 102.15, 'Tool': 'gspn'}, {'Time': 1384, 'Memory': 120.64, 'Tool': 'lola'}, {'Time': 1652, 'Memory': 123.52, 'Tool': 'lola'}, {'Time': 1913, 'Memory': 160.38, 'Tool': 'gspn'}, {'Time': 2308, 'Memory': 2205.45, 'Tool': 'marcie'}, {'Time': 2384, 'Memory': 2205.73, 'Tool': 'marcie'}, {'Time': 2578, 'Memory': 216.64, 'Tool': 'itstools'}, {'Time': 2622, 'Memory': 214.16, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 6.096916299559472x far from the best tool gspn.
CTLCardinality 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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ AirplaneLD-PT-0010 @ 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: 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-CTLCardinality.task
lola: NOT(A (G (((stp3 + 1 <= AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + AltitudePossibleVal_13 + AltitudePossibleVal_14 + AltitudePossibleVal_15 + AltitudePossibleVal_16 + AltitudePossibleVal_17 + AltitudePossibleVal_18 + AltitudePossibleVal_19 + AltitudePossibleVal_20) OR (P5 + 1 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9))))) : A ((((stp4 + 1 <= P3) OR (Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T + 1 <= P5)) U E (G ((P4 <= WeightPossibleVal_on + WeightPossibleVal_off))))) : A (F ((A (G ((2 <= WeightPossibleVal_on + WeightPossibleVal_off))) AND ((Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_10 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= P3) AND (3 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10))))) : NOT(((A (G ((P5 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))) OR (1 <= P1)) AND (((1 <= P4) AND (3 <= AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + AltitudePossibleVal_13 + AltitudePossibleVal_14 + AltitudePossibleVal_15 + AltitudePossibleVal_16 + AltitudePossibleVal_17 + AltitudePossibleVal_18 + AltitudePossibleVal_19 + AltitudePossibleVal_20) AND (SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9)) OR A (G ((P4 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)))))) : (A (G (E (X (TRUE)))) OR (E (((Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10) U (1 <= stp5))) AND NOT(A (G (TRUE))))) : NOT(A ((((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= P3) OR (stp2 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10)) U ((stp3 <= Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_10 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1) AND (Weight_Left_Wheel_on + Weight_Left_Wheel_off <= stp5))))) : A (X (E (G ((P3 + 1 <= P1))))) : E (G (A (F ((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= 1))))) : A (F ((SpeedPossibleVal_10 <= P2))) : E (F (A (X ((2 <= AltitudePossibleVal_19))))) : NOT(E (G ((P4 <= 2)))) : A (F (A (G (((3 <= Speed_Left_Wheel_7) OR (Speed_Right_Wheel_5 <= P2)))))) : E (G (E (G (((1 <= TheAltitude_16) OR (TheAltitude_15 <= Speed_Left_Wheel_1)))))) : A (G (NOT(E (G ((1 <= TheAltitude_8)))))) : NOT(((2 <= TheAltitude_17) OR E (((1 <= AltitudePossibleVal_1) U (2 <= stp1))))) : A (G (A (F (((3 <= P4) OR (Speed_Right_Wheel_4 <= SpeedPossibleVal_10))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((stp3 + 1 <= AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + AltitudePossibleVal_13 + AltitudePossibleVal_14 + AltitudePossibleVal_15 + AltitudePo... (shortened)
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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((stp4 + 1 <= P3) OR (Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T + 1 <= P5)) U E (G ((P4 <= WeightPossibleVal_on + WeightPossibleVal_off)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((stp4 + 1 <= P3) OR (Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T + 1 <= P5)) U NOT(A(TRUE U (WeightPossibleVal_on + WeightPossibleVal_off + 1 <= P4))))
lola: processed formula length: 169
lola: 3 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= WeightPossibleVal_on + WeightPossibleVal_off))) AND ((Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_10 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= P3) AND (3 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= WeightPossibleVal_on + WeightPossibleVal_off))) AND ((Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_10 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= P3) AND (3 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10)))))
lola: processed formula: A (F ((A (G ((2 <= WeightPossibleVal_on + WeightPossibleVal_off))) AND ((Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_10 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= P3) AND (3 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_... (shortened)
lola: processed formula length: 512
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 30 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: 41407 markings, 101532 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (G ((P5 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off))) OR (1 <= P1)) AND (((1 <= P4) AND (3 <= AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + Al... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Weight_Left_Wheel_on + Weight_Left_Wheel_off + 1 <= P5)))
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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-CTLCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P1 <= 0)
lola: processed formula length: 9
lola: 11 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P4 <= 0) OR (AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + AltitudePossibleVal_13 + AltitudePossibleVal_14 + AltitudePossibleVal_15 + AltitudePossibleVa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P4 <= 0) OR (AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + AltitudePossibleVal_13 + AltitudePossibleVal_14 + AltitudePossibleVal_15 + AltitudePossibleVa... (shortened)
lola: processed formula length: 952
lola: 11 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
lola: processed formula with 3 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T + 1 <= P4)))
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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to AirplaneLD-PT-0010-CTLCardinality-6.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (TRUE)))) OR (E (((Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10) U (1 <= stp5))) AND NOT(A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 11 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= P3) OR (stp2 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10)) U ((stp3 <= Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_10 + Speed_Left_Whee... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= P3) OR (stp2 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10)) U ((stp3 <= Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_7 + Speed_Left_Wheel_10 + Speed_Left_Wheel_... (shortened)
lola: processed formula length: 569
lola: 7 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 29797 markings, 53044 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((P3 + 1 <= P1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (P1 <= P3))))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1815 markings, 4158 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (Weight_Right_Wheel_off + Weight_Right_Wheel_on <= 1)))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((SpeedPossibleVal_10 <= P2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((SpeedPossibleVal_10 <= P2)))
lola: processed formula: A (F ((SpeedPossibleVal_10 <= P2)))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 31 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: 4848 markings, 6848 edges
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((2 <= AltitudePossibleVal_19)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((2 <= AltitudePossibleVal_19)))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((P4 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= P4)))
lola: processed formula: A (F ((3 <= P4)))
lola: processed formula length: 17
lola: 3 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 31 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= Speed_Left_Wheel_7) OR (Speed_Right_Wheel_5 <= P2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((3 <= Speed_Left_Wheel_7) OR (Speed_Right_Wheel_5 <= P2))))))
lola: processed formula: A (F (A (G (((3 <= Speed_Left_Wheel_7) OR (Speed_Right_Wheel_5 <= P2))))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 30 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: 54 markings, 90 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (((1 <= TheAltitude_16) OR (TheAltitude_15 <= Speed_Left_Wheel_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U ((TheAltitude_16 <= 0) AND (Speed_Left_Wheel_1 + 1 <= TheAltitude_15)))))
lola: processed formula length: 95
lola: 4 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 19 edges
lola: ========================================
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((1 <= TheAltitude_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (TheAltitude_8 <= 0)))))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2185 markings, 9172 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((2 <= TheAltitude_17) OR E (((1 <= AltitudePossibleVal_1) U (2 <= stp1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (TheAltitude_17 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TheAltitude_17 <= 1)
lola: processed formula length: 21
lola: 6 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.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 15 will run for 3536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((AltitudePossibleVal_1 <= 0) R (stp1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((AltitudePossibleVal_1 <= 0) R (stp1 <= 1)))
lola: processed formula: A (((AltitudePossibleVal_1 <= 0) R (stp1 <= 1)))
lola: processed formula length: 48
lola: 6 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 30 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: 35943 markings, 64442 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((3 <= P4) OR (Speed_Right_Wheel_4 <= SpeedPossibleVal_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((3 <= P4) OR (Speed_Right_Wheel_4 <= SpeedPossibleVal_10))))))
lola: processed formula length: 90
lola: 2 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-PT-0010-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 43463 markings, 227127 edges
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no yes no yes no no yes no yes yes
lola: ========================================
----- Kill lola and sara stderr -----
FORMULA AirplaneLD-PT-0010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-PT-0010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-structural"
echo " Input is AirplaneLD-PT-0010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-qhx2-152646141500073"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;