About the Execution of LoLA for AirplaneLD-PT-0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
170.720 | 21137.00 | 13045.00 | 4735.60 | TFFTFFFFTFTTTTFF | normal |
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 lola
Input is AirplaneLD-PT-0010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-qhx2-152646133800075
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-01
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-02
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-03
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-04
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-05
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-06
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-07
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-08
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-09
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-10
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-11
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-12
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-13
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-14
FORMULA_NAME AirplaneLD-PT-0010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526578200031
info: Time: 3600 - MCC
===========================================================================================
prep: translating AirplaneLD-PT-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating AirplaneLD-PT-0010 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ AirplaneLD-PT-0010 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 2848
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-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (2 <= WeightPossibleVal_on + WeightPossibleVal_off)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= stp2)
lola: LP says that atomic proposition is always false: (3 <= P2)
lola: LP says that atomic proposition is always false: (3 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)
lola: LP says that atomic proposition is always false: (2 <= stp1)
lola: LP says that atomic proposition is always false: (2 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)
lola: place invariant simplifies atomic proposition
lola: before: (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 <= WeightPossibleVal_on + WeightPossibleVal_off)
lola: after: (18 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P6 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10)
lola: after: (P6 <= 10)
lola: LP says that atomic proposition is always true: (P6 <= 10)
lola: place invariant simplifies atomic proposition
lola: before: (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 <= stp1)
lola: after: (20 <= stp1)
lola: LP says that atomic proposition is always false: (20 <= stp1)
lola: place invariant simplifies atomic proposition
lola: before: (WeightPossibleVal_on + WeightPossibleVal_off <= P5)
lola: after: (2 <= P5)
lola: LP says that atomic proposition is always false: (2 <= P5)
lola: LP says that atomic proposition is always false: (2 <= stp1)
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10 <= P3)
lola: after: (10 <= P3)
lola: LP says that atomic proposition is always false: (10 <= P3)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= P4)
lola: LP says that atomic proposition is always false: (3 <= P3)
lola: LP says that atomic proposition is always false: (2 <= P4)
lola: LP says that atomic proposition is always false: (3 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)
lola: LP says that atomic proposition is always false: (2 <= P4)
lola: LP says that atomic proposition is always false: (3 <= P1)
lola: place invariant simplifies atomic proposition
lola: before: (P4 <= WeightPossibleVal_on + WeightPossibleVal_off)
lola: after: (P4 <= 2)
lola: LP says that atomic proposition is always true: (P4 <= 2)
lola: LP says that atomic proposition is always false: (3 <= 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)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= SpeedPossibleVal_8)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_4 <= Speed_Right_Wheel_7)
lola: after: (1 <= Speed_Right_Wheel_7)
lola: LP says that atomic proposition is always false: (2 <= TheAltitude_4)
lola: place invariant simplifies atomic proposition
lola: before: (WeightPossibleVal_on <= Weight_Left_Wheel_off)
lola: after: (1 <= Weight_Left_Wheel_off)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= AltitudePossibleVal_13)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= TheAltitude_15)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= SpeedPossibleVal_1)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_14 <= TheAltitude_19)
lola: after: (1 <= TheAltitude_19)
lola: LP says that atomic proposition is always false: (2 <= stp1)
lola: place invariant simplifies atomic proposition
lola: before: (WeightPossibleVal_off <= stp1)
lola: after: (1 <= stp1)
lola: place invariant simplifies atomic proposition
lola: before: (stp1 <= AltitudePossibleVal_11)
lola: after: (stp1 <= 1)
lola: LP says that atomic proposition is always true: (stp1 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_4 <= Speed_Right_Wheel_2)
lola: after: (1 <= Speed_Right_Wheel_2)
lola: LP says that atomic proposition is always false: (3 <= Speed_Left_Wheel_8)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= AltitudePossibleVal_12)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= SpeedPossibleVal_1)
lola: after: (1 <= 0)
lola: always false
lola: A (G (TRUE)) : E (F (())) : E (F (FALSE)) : A (G (())) : E (F (())) : E (F (())) : E (F (())) : E (F ((((1 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)) AND ((P6 <= stp1))))) : A (G (TRUE)) : E (F (())) : A (G (TRUE)) : A (G (())) : E (F (((1 <= Plane_On_Ground_Signal_no_F) AND (stp1 <= 0)))) : A (G (TRUE)) : E (F (())) : E (F (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 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: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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-0010-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= Plane_On_Ground_Signal_no_F) AND (stp1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= Plane_On_Ground_Signal_no_F) AND (stp1 <= 0))))
lola: processed formula length: 60
lola: 43 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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:625
lola: formula 0: ((1 <= Plane_On_Ground_Signal_no_F) AND (stp1 <= 0))
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: 11 markings, 10 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)) AND ((P6 <= stp1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((1 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)) AND ((P6 <= stp1)))))
lola: processed formula length: 95
lola: 43 rewrites
lola: closed formula file AirplaneLD-PT-0010-ReachabilityCardinality.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:625
lola: formula 0: (((1 <= Plane_On_Ground_Signal_no_F + Plane_On_Ground_Signal_no_T)) AND ((P6 <= stp1)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-PT-0010-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file AirplaneLD-PT-0010-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA AirplaneLD-PT-0010-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no no no no yes no yes yes yes yes no no
lola:
preliminary result: yes no no yes no no no no yes no yes yes yes yes no no
lola: memory consumption: 21252 KB
lola: time consumption: 1 seconds
BK_STOP 1526578221168
--------------------
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-0010"
export BK_EXAMINATION="ReachabilityCardinality"
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-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 lola"
echo " Input is AirplaneLD-PT-0010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-qhx2-152646133800075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
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 ;