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 724K
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 6.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K 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 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K 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 383K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AirplaneLD-PT-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-qhx2-152732127300025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528181117532

info: Time: 3600 - MCC
===========================================================================================
prep: translating AirplaneLD-PT-0050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating AirplaneLD-PT-0050 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ AirplaneLD-PT-0050 @ 3556 seconds
lola: LoLA will run for 3556 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 777/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11808
lola: finding significant places
lola: 369 places, 408 transitions, 214 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 315 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-PT-0050-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= stp4)
lola: place invariant simplifies atomic proposition
lola: before: (P6 <= AltitudePossibleVal_100 + 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 + AltitudePossibleVal_21 + AltitudePossibleVal_22 + AltitudePossibleVal_23 + AltitudePossibleVal_24 + AltitudePossibleVal_25 + AltitudePossibleVal_26 + AltitudePossibleVal_27 + AltitudePossibleVal_28 + AltitudePossibleVal_29 + AltitudePossibleVal_30 + AltitudePossibleVal_31 + AltitudePossibleVal_32 + AltitudePossibleVal_33 + AltitudePossibleVal_34 + AltitudePossibleVal_35 + AltitudePossibleVal_36 + AltitudePossibleVal_37 + AltitudePossibleVal_38 + AltitudePossibleVal_39 + AltitudePossibleVal_40 + AltitudePossibleVal_41 + AltitudePossibleVal_42 + AltitudePossibleVal_43 + AltitudePossibleVal_44 + AltitudePossibleVal_45 + AltitudePossibleVal_46 + AltitudePossibleVal_47 + AltitudePossibleVal_48 + AltitudePossibleVal_49 + AltitudePossibleVal_50 + AltitudePossibleVal_51 + AltitudePossibleVal_52 + AltitudePossibleVal_53 + AltitudePossibleVal_54 + AltitudePossibleVal_55 + AltitudePossibleVal_56 + AltitudePossibleVal_57 + AltitudePossibleVal_58 + AltitudePossibleVal_59 + AltitudePossibleVal_60 + AltitudePossibleVal_61 + AltitudePossibleVal_62 + AltitudePossibleVal_63 + AltitudePossibleVal_64 + AltitudePossibleVal_65 + AltitudePossibleVal_66 + AltitudePossibleVal_67 + AltitudePossibleVal_68 + AltitudePossibleVal_69 + AltitudePossibleVal_70 + AltitudePossibleVal_71 + AltitudePossibleVal_72 + AltitudePossibleVal_73 + AltitudePossibleVal_74 + AltitudePossibleVal_75 + AltitudePossibleVal_76 + AltitudePossibleVal_77 + AltitudePossibleVal_78 + AltitudePossibleVal_79 + AltitudePossibleVal_80 + AltitudePossibleVal_81 + AltitudePossibleVal_82 + AltitudePossibleVal_83 + AltitudePossibleVal_84 + AltitudePossibleVal_85 + AltitudePossibleVal_86 + AltitudePossibleVal_87 + AltitudePossibleVal_88 + AltitudePossibleVal_89 + AltitudePossibleVal_90 + AltitudePossibleVal_91 + AltitudePossibleVal_92 + AltitudePossibleVal_93 + AltitudePossibleVal_94 + AltitudePossibleVal_95 + AltitudePossibleVal_96 + AltitudePossibleVal_97 + AltitudePossibleVal_98 + AltitudePossibleVal_99)
lola: after: (P6 <= 100)
lola: LP says that atomic proposition is always true: (P6 <= 100)
lola: LP says that atomic proposition is always false: (2 <= P3)
lola: LP says that atomic proposition is always false: (2 <= P2)
lola: LP says that atomic proposition is always false: (2 <= stp4)
lola: LP says that atomic proposition is always false: (2 <= P5)
lola: LP says that atomic proposition is always false: (2 <= P3)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Right_Wheel_50 <= AltitudePossibleVal_39)
lola: after: (Speed_Right_Wheel_50 <= 1)
lola: LP says that atomic proposition is always true: (Speed_Right_Wheel_50 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_4 <= TheAltitude_64)
lola: after: (1 <= TheAltitude_64)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_79 <= TheAltitude_89)
lola: after: (1 <= TheAltitude_89)
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_6 <= TheAltitude_34)
lola: after: (1 <= TheAltitude_34)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Left_Wheel_48 <= AltitudePossibleVal_46)
lola: after: (Speed_Left_Wheel_48 <= 1)
lola: LP says that atomic proposition is always true: (Speed_Left_Wheel_48 <= 1)
lola: A (G ((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= stp2))) : A (F (F (F (F (FALSE))))) : A (TRUE) : A (F (G (((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= stp1) U FALSE)))) : A (G ((X (FALSE) U (P2 <= stp5)))) : A ((F (F ((Speed_Right_Wheel_10 + Speed_Right_Wheel_11 + Speed_Right_Wheel_12 + Speed_Right_Wheel_13 + Speed_Right_Wheel_14 + Speed_Right_Wheel_15 + Speed_Right_Wheel_16 + Speed_Right_Wheel_17 + Speed_Right_Wheel_18 + Speed_Right_Wheel_19 + Speed_Right_Wheel_20 + Speed_Right_Wheel_21 + Speed_Right_Wheel_22 + Speed_Right_Wheel_23 + Speed_Right_Wheel_24 + Speed_Right_Wheel_25 + Speed_Right_Wheel_26 + Speed_Right_Wheel_27 + Speed_Right_Wheel_28 + Speed_Right_Wheel_29 + Speed_Right_Wheel_30 + Speed_Right_Wheel_31 + Speed_Right_Wheel_32 + Speed_Right_Wheel_33 + Speed_Right_Wheel_34 + Speed_Right_Wheel_35 + Speed_Right_Wheel_36 + Speed_Right_Wheel_37 + Speed_Right_Wheel_38 + Speed_Right_Wheel_39 + Speed_Right_Wheel_40 + Speed_Right_Wheel_41 + Speed_Right_Wheel_42 + Speed_Right_Wheel_43 + Speed_Right_Wheel_44 + Speed_Right_Wheel_45 + Speed_Right_Wheel_46 + Speed_Right_Wheel_47 + Speed_Right_Wheel_48 + Speed_Right_Wheel_49 + Speed_Right_Wheel_50 + 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 <= P5))) U X (G (FALSE)))) : A (F (FALSE)) : A ((G (G ((stp2 <= P5))) U X (X (FALSE)))) : A (G (G (G (F (TRUE))))) : A (X ((1 <= TheAltitude_64))) : A (X (G (((1 <= TheAltitude_89) U (TheAltitude_50 <= TheAltitude_15))))) : A (X (F (X (G ((TheAltitude_61 <= Speed_Right_Wheel_2)))))) : A (F ((TheAltitude_79 <= Speed_Left_Wheel_32))) : A (G ((1 <= TheAltitude_34))) : A (F (F (X ((Speed_Left_Wheel_7 <= TheAltitude_15))))) : A (G (F (F (G (TRUE)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((TheAltitude_50 <= TheAltitude_15)) AND ((1 <= TheAltitude_89) OR (TheAltitude_50 <= TheAltitude_15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((TheAltitude_50 <= TheAltitude_15)) AND ((1 <= TheAltitude_89) OR (TheAltitude_50 <= TheAltitude_15))))))
lola: processed formula length: 118
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 466089 markings, 1663016 edges, 93218 markings/sec, 0 secs
lola: 946706 markings, 3322052 edges, 96123 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: 1165255 markings, 4077242 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Speed_Left_Wheel_7 <= TheAltitude_15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Speed_Left_Wheel_7 <= TheAltitude_15))))
lola: processed formula length: 50
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 152 markings, 152 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= TheAltitude_64)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= TheAltitude_64)))
lola: processed formula length: 29
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= TheAltitude_34)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= TheAltitude_34)))
lola: processed formula length: 29
lola: 56 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (TheAltitude_34 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P2 <= stp5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((P2 <= stp5)))
lola: processed formula length: 20
lola: 56 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (stp5 + 1 <= P2)
lola: state equation: Generated DNF with 1 literals and 1 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-0050-LTLCardinality-12-0.sara

FORMULA AirplaneLD-PT-0050-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= stp2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((Weight_Right_Wheel_off + Weight_Right_Wheel_on <= stp2)))
lola: processed formula length: 64
lola: 56 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (stp2 + 1 <= Weight_Right_Wheel_off + Weight_Right_Wheel_on)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-PT-0050-LTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges

FORMULA AirplaneLD-PT-0050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((TheAltitude_79 <= Speed_Left_Wheel_32)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Speed_Left_Wheel_32 + 1 <= TheAltitude_79)
lola: processed formula length: 43
lola: 56 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((TheAltitude_61 <= Speed_Right_Wheel_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((TheAltitude_61 <= Speed_Right_Wheel_2))))
lola: processed formula length: 51
lola: 54 rewrites
lola: closed formula file AirplaneLD-PT-0050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 122256 markings, 357257 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no no no yes no no no yes no no yes
lola:
preliminary result: no no yes no no no no no yes no no no yes no no yes
lola: memory consumption: 18980 KB
lola: time consumption: 14 seconds

BK_STOP 1528181166911

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AirplaneLD-PT-0050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0050.tgz
mv AirplaneLD-PT-0050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is AirplaneLD-PT-0050, 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 r184-qhx2-152732127300025"
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 ;