Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r011-smll-155225030100098.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
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 r011-smll-155225030100098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 35K Feb 9 05:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 9 05:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 5 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 5 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 9.4K Feb 4 22:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 4 22:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 4 22:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 1 23:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 1 23:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jan 29 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Jan 29 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 22:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Feb 4 22:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 383K Mar 10 17:31 model.pnml

--------------------
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 1552339077966

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 @ 3569 seconds
lola: LoLA will run for 3569 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: place invariant simplifies atomic proposition
lola: before: (P2 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10 + SpeedPossibleVal_11 + SpeedPossibleVal_12 + SpeedPossibleVal_13 + SpeedPossibleVal_14 + SpeedPossibleVal_15 + SpeedPossibleVal_16 + SpeedPossibleVal_17 + SpeedPossibleVal_18 + SpeedPossibleVal_19 + SpeedPossibleVal_20 + SpeedPossibleVal_21 + SpeedPossibleVal_22 + SpeedPossibleVal_23 + SpeedPossibleVal_24 + SpeedPossibleVal_25 + SpeedPossibleVal_26 + SpeedPossibleVal_27 + SpeedPossibleVal_28 + SpeedPossibleVal_29 + SpeedPossibleVal_30 + SpeedPossibleVal_31 + SpeedPossibleVal_32 + SpeedPossibleVal_33 + SpeedPossibleVal_34 + SpeedPossibleVal_35 + SpeedPossibleVal_36 + SpeedPossibleVal_37 + SpeedPossibleVal_38 + SpeedPossibleVal_39 + SpeedPossibleVal_40 + SpeedPossibleVal_41 + SpeedPossibleVal_42 + SpeedPossibleVal_43 + SpeedPossibleVal_44 + SpeedPossibleVal_45 + SpeedPossibleVal_46 + SpeedPossibleVal_47 + SpeedPossibleVal_48 + SpeedPossibleVal_49 + SpeedPossibleVal_50)
lola: after: (P2 <= 50)
lola: LP says that atomic proposition is always true: (P2 <= 50)
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 <= TheAltitude_100 + TheAltitude_10 + TheAltitude_11 + TheAltitude_12 + TheAltitude_13 + TheAltitude_14 + TheAltitude_15 + TheAltitude_16 + TheAltitude_17 + TheAltitude_18 + TheAltitude_19 + TheAltitude_20 + TheAltitude_21 + TheAltitude_22 + TheAltitude_23 + TheAltitude_24 + TheAltitude_25 + TheAltitude_26 + TheAltitude_27 + TheAltitude_28 + TheAltitude_29 + TheAltitude_30 + TheAltitude_31 + TheAltitude_32 + TheAltitude_33 + TheAltitude_34 + TheAltitude_35 + TheAltitude_36 + TheAltitude_37 + TheAltitude_38 + TheAltitude_39 + TheAltitude_40 + TheAltitude_41 + TheAltitude_42 + TheAltitude_43 + TheAltitude_44 + TheAltitude_45 + TheAltitude_46 + TheAltitude_47 + TheAltitude_48 + TheAltitude_49 + TheAltitude_50 + TheAltitude_51 + TheAltitude_52 + TheAltitude_53 + TheAltitude_54 + TheAltitude_55 + TheAltitude_56 + TheAltitude_57 + TheAltitude_58 + TheAltitude_59 + TheAltitude_60 + TheAltitude_61 + TheAltitude_62 + TheAltitude_63 + TheAltitude_64 + TheAltitude_65 + TheAltitude_66 + TheAltitude_67 + TheAltitude_68 + TheAltitude_69 + TheAltitude_70 + TheAltitude_71 + TheAltitude_72 + TheAltitude_73 + TheAltitude_74 + TheAltitude_75 + TheAltitude_76 + TheAltitude_77 + TheAltitude_78 + TheAltitude_79 + TheAltitude_80 + TheAltitude_81 + TheAltitude_82 + TheAltitude_83 + TheAltitude_84 + TheAltitude_85 + TheAltitude_86 + TheAltitude_87 + TheAltitude_88 + TheAltitude_89 + TheAltitude_90 + TheAltitude_91 + TheAltitude_92 + TheAltitude_93 + TheAltitude_94 + TheAltitude_95 + TheAltitude_96 + TheAltitude_97 + TheAltitude_98 + TheAltitude_99 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_10 + Speed_Left_Wheel_11 + Speed_Left_Wheel_12 + Speed_Left_Wheel_13 + Speed_Left_Wheel_14 + Speed_Left_Wheel_15 + Speed_Left_Wheel_16 + Speed_Left_Wheel_17 + Speed_Left_Wheel_18 + Speed_Left_Wheel_19 + Speed_Left_Wheel_20 + Speed_Left_Wheel_21 + Speed_Left_Wheel_22 + Speed_Left_Wheel_23 + Speed_Left_Wheel_24 + Speed_Left_Wheel_25 + Speed_Left_Wheel_26 + Speed_Left_Wheel_27 + Speed_Left_Wheel_28 + Speed_Left_Wheel_29 + Speed_Left_Wheel_30 + Speed_Left_Wheel_31 + Speed_Left_Wheel_32 + Speed_Left_Wheel_33 + Speed_Left_Wheel_34 + Speed_Left_Wheel_35 + Speed_Left_Wheel_36 + Speed_Left_Wheel_37 + Speed_Left_Wheel_38 + Speed_Left_Wheel_39 + Speed_Left_Wheel_40 + Speed_Left_Wheel_41 + Speed_Left_Wheel_42 + Speed_Left_Wheel_43 + Speed_Left_Wheel_44 + Speed_Left_Wheel_45 + Speed_Left_Wheel_46 + Speed_Left_Wheel_47 + Speed_Left_Wheel_48 + Speed_Left_Wheel_49 + Speed_Left_Wheel_50 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10 + SpeedPossibleVal_11 + SpeedPossibleVal_12 + SpeedPossibleVal_13 + SpeedPossibleVal_14 + SpeedPossibleVal_15 + SpeedPossibleVal_16 + SpeedPossibleVal_17 + SpeedPossibleVal_18 + SpeedPossibleVal_19 + SpeedPossibleVal_20 + SpeedPossibleVal_21 + SpeedPossibleVal_22 + SpeedPossibleVal_23 + SpeedPossibleVal_24 + SpeedPossibleVal_25 + SpeedPossibleVal_26 + SpeedPossibleVal_27 + SpeedPossibleVal_28 + SpeedPossibleVal_29 + SpeedPossibleVal_30 + SpeedPossibleVal_31 + SpeedPossibleVal_32 + SpeedPossibleVal_33 + SpeedPossibleVal_34 + SpeedPossibleVal_35 + SpeedPossibleVal_36 + SpeedPossibleVal_37 + SpeedPossibleVal_38 + SpeedPossibleVal_39 + SpeedPossibleVal_40 + SpeedPossibleVal_41 + SpeedPossibleVal_42 + SpeedPossibleVal_43 + SpeedPossibleVal_44 + SpeedPossibleVal_45 + SpeedPossibleVal_46 + SpeedPossibleVal_47 + SpeedPossibleVal_48 + SpeedPossibleVal_49 + SpeedPossibleVal_50)
lola: after: (Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_10 + Speed_Left_Wheel_11 + Speed_Left_Wheel_12 + Speed_Left_Wheel_13 + Speed_Left_Wheel_14 + Speed_Left_Wheel_15 + Speed_Left_Wheel_16 + Speed_Left_Wheel_17 + Speed_Left_Wheel_18 + Speed_Left_Wheel_19 + Speed_Left_Wheel_20 + Speed_Left_Wheel_21 + Speed_Left_Wheel_22 + Speed_Left_Wheel_23 + Speed_Left_Wheel_24 + Speed_Left_Wheel_25 + Speed_Left_Wheel_26 + Speed_Left_Wheel_27 + Speed_Left_Wheel_28 + Speed_Left_Wheel_29 + Speed_Left_Wheel_30 + Speed_Left_Wheel_31 + Speed_Left_Wheel_32 + Speed_Left_Wheel_33 + Speed_Left_Wheel_34 + Speed_Left_Wheel_35 + Speed_Left_Wheel_36 + Speed_Left_Wheel_37 + Speed_Left_Wheel_38 + Speed_Left_Wheel_39 + Speed_Left_Wheel_40 + Speed_Left_Wheel_41 + Speed_Left_Wheel_42 + Speed_Left_Wheel_43 + Speed_Left_Wheel_44 + Speed_Left_Wheel_45 + Speed_Left_Wheel_46 + Speed_Left_Wheel_47 + Speed_Left_Wheel_48 + Speed_Left_Wheel_49 + Speed_Left_Wheel_50 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= 50)
lola: LP says that atomic proposition is always true: (Speed_Left_Wheel_9 + Speed_Left_Wheel_8 + Speed_Left_Wheel_10 + Speed_Left_Wheel_11 + Speed_Left_Wheel_12 + Speed_Left_Wheel_13 + Speed_Left_Wheel_14 + Speed_Left_Wheel_15 + Speed_Left_Wheel_16 + Speed_Left_Wheel_17 + Speed_Left_Wheel_18 + Speed_Left_Wheel_19 + Speed_Left_Wheel_20 + Speed_Left_Wheel_21 + Speed_Left_Wheel_22 + Speed_Left_Wheel_23 + Speed_Left_Wheel_24 + Speed_Left_Wheel_25 + Speed_Left_Wheel_26 + Speed_Left_Wheel_27 + Speed_Left_Wheel_28 + Speed_Left_Wheel_29 + Speed_Left_Wheel_30 + Speed_Left_Wheel_31 + Speed_Left_Wheel_32 + Speed_Left_Wheel_33 + Speed_Left_Wheel_34 + Speed_Left_Wheel_35 + Speed_Left_Wheel_36 + Speed_Left_Wheel_37 + Speed_Left_Wheel_38 + Speed_Left_Wheel_39 + Speed_Left_Wheel_40 + Speed_Left_Wheel_41 + Speed_Left_Wheel_42 + Speed_Left_Wheel_43 + Speed_Left_Wheel_44 + Speed_Left_Wheel_45 + Speed_Left_Wheel_46 + Speed_Left_Wheel_47 + Speed_Left_Wheel_48 + Speed_Left_Wheel_49 + Speed_Left_Wheel_50 + Speed_Left_Wheel_7 + Speed_Left_Wheel_6 + Speed_Left_Wheel_5 + Speed_Left_Wheel_4 + Speed_Left_Wheel_3 + Speed_Left_Wheel_2 + Speed_Left_Wheel_1 <= 50)
lola: LP says that atomic proposition is always false: (2 <= stp5)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Right_Wheel_6 <= AltitudePossibleVal_3)
lola: after: (Speed_Right_Wheel_6 <= 1)
lola: LP says that atomic proposition is always true: (Speed_Right_Wheel_6 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (TheAltitude_36 <= SpeedPossibleVal_13)
lola: after: (TheAltitude_36 <= 1)
lola: LP says that atomic proposition is always true: (TheAltitude_36 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_3 <= Speed_Right_Wheel_31)
lola: after: (1 <= Speed_Right_Wheel_31)
lola: place invariant simplifies atomic proposition
lola: before: (TheAltitude_25 <= AltitudePossibleVal_53)
lola: after: (TheAltitude_25 <= 1)
lola: LP says that atomic proposition is always true: (TheAltitude_25 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_93 <= AltitudePossibleVal_19)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_33 <= AltitudePossibleVal_84)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_41 <= AltitudePossibleVal_64)
lola: after: (0 <= 0)
lola: always true
lola: A (F (F (F (G ((1 <= P5)))))) : A (TRUE) : A (F (G (F (G ((stp3 <= P4)))))) : A (F (G (FALSE))) : A (X (F (((1 <= stp4) U (P1 <= TheAltitude_100 + TheAltitude_10 + TheAltitude_11 + TheAltitude_12 + TheAltitude_13 + TheAltitude_14 + TheAltitude_15 + TheAltitude_16 + TheAltitude_17 + TheAltitude_18 + TheAltitude_19 + TheAltitude_20 + TheAltitude_21 + TheAltitude_22 + TheAltitude_23 + TheAltitude_24 + TheAltitude_25 + TheAltitude_26 + TheAltitude_27 + TheAltitude_28 + TheAltitude_29 + TheAltitude_30 + TheAltitude_31 + TheAltitude_32 + TheAltitude_33 + TheAltitude_34 + TheAltitude_35 + TheAltitude_36 + TheAltitude_37 + TheAltitude_38 + TheAltitude_39 + TheAltitude_40 + TheAltitude_41 + TheAltitude_42 + TheAltitude_43 + TheAltitude_44 + TheAltitude_45 + TheAltitude_46 + TheAltitude_47 + TheAltitude_48 + TheAltitude_49 + TheAltitude_50 + TheAltitude_51 + TheAltitude_52 + TheAltitude_53 + TheAltitude_54 + TheAltitude_55 + TheAltitude_56 + TheAltitude_57 + TheAltitude_58 + TheAltitude_59 + TheAltitude_60 + TheAltitude_61 + TheAltitude_62 + TheAltitude_63 + TheAltitude_64 + TheAltitude_65 + TheAltitude_66 + TheAltitude_67 + TheAltitude_68 + TheAltitude_69 + TheAltitude_70 + TheAltitude_71 + TheAltitude_72 + TheAltitude_73 + TheAltitude_74 + TheAltitude_75 + TheAltitude_76 + TheAltitude_77 + TheAltitude_78 + TheAltitude_79 + TheAltitude_80 + TheAltitude_81 + TheAltitude_82 + TheAltitude_83 + TheAltitude_84 + TheAltitude_85 + TheAltitude_86 + TheAltitude_87 + TheAltitude_88 + TheAltitude_89 + TheAltitude_90 + TheAltitude_91 + TheAltitude_92 + TheAltitude_93 + TheAltitude_94 + TheAltitude_95 + TheAltitude_96 + TheAltitude_97 + TheAltitude_98 + TheAltitude_99 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9))))) : A (G (G (G (X (FALSE))))) : A (G (F (X (TRUE)))) : A (G (F (FALSE))) : A (X (X (TRUE))) : A (F (X (TRUE))) : A (F ((Speed_Right_Wheel_20 <= Speed_Left_Wheel_14))) : A (G ((X ((1 <= Speed_Right_Wheel_31)) U F ((Speed_Left_Wheel_43 <= Speed_Right_Wheel_1))))) : A (X (F (TRUE))) : A (TRUE) : A ((TRUE U F (X (TRUE)))) : A (G (X (X ((TheAltitude_43 <= Speed_Right_Wheel_14)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: 45 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-1 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 45 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 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: 45 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 3 will run for 274 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: 45 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 4 will run for 297 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: 45 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-13 TRUE 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: A (X (F ((P1 <= TheAltitude_100 + TheAltitude_10 + TheAltitude_11 + TheAltitude_12 + TheAltitude_13 + TheAltitude_14 + TheAltitude_15 + TheAltitude_16 + TheAltitude_17 + TheAltitude_18 + TheAltitude_19 + TheAltitude_20 + TheAltitude_21 + TheAltitude_22 + TheAltitude_23 + TheAltitude_24 + TheAltitude_25 + TheAltitude_26 + TheAltitude_27 + TheAltitude_28 + TheAltitude_29 + TheAltitude_30 + TheAltitu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P1 <= TheAltitude_100 + TheAltitude_10 + TheAltitude_11 + TheAltitude_12 + TheAltitude_13 + TheAltitude_14 + TheAltitude_15 + TheAltitude_16 + TheAltitude_17 + TheAltitude_18 + TheAltitude_19 + TheAltitude_20 + TheAltitude_21 + TheAltitude_22 + TheAltitude_23 + TheAltitude_24 + TheAltitude_25 + TheAltitude_26 + TheAltitude_27 + TheAltitude_28 + TheAltitude_29 + TheAltitude_30 + TheAltitu... (shortened)
lola: processed formula length: 1709
lola: 45 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: 1082361 markings, 1096861 edges, 216472 markings/sec, 0 secs
lola: 2156168 markings, 2196341 edges, 214761 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2379915 markings, 2433618 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-4 TRUE 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: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 45 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 205 markings, 204 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: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 45 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 205 markings, 204 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-9 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 (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 45 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 205 markings, 204 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 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 45 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 205 markings, 204 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 45 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 205 markings, 204 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((TheAltitude_43 <= Speed_Right_Wheel_14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((TheAltitude_43 <= Speed_Right_Wheel_14)))))
lola: processed formula length: 56
lola: 45 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: 506462 markings, 1800828 edges, 101292 markings/sec, 0 secs
lola: 1032450 markings, 3616078 edges, 105198 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: 1274497 markings, 4453898 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Speed_Right_Wheel_20 <= Speed_Left_Wheel_14)))
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_14 + 1 <= Speed_Right_Wheel_20)
lola: processed formula length: 49
lola: 47 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-10 TRUE 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 (F (G ((1 <= P5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= P5))))
lola: processed formula length: 21
lola: 45 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: 9 markings, 10 edges
lola: ========================================

FORMULA AirplaneLD-PT-0050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((stp3 <= P4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((stp3 <= P4))))
lola: processed formula length: 24
lola: 45 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: 525009 markings, 1579420 edges, 105002 markings/sec, 0 secs
lola: 1015317 markings, 3055195 edges, 98062 markings/sec, 5 secs
lola: 1402087 markings, 4205145 edges, 77354 markings/sec, 10 secs
lola: 1879761 markings, 5640846 edges, 95535 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2025935 markings, 6086774 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 15 will run for 3524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Speed_Left_Wheel_43 <= Speed_Right_Wheel_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Speed_Left_Wheel_43 <= Speed_Right_Wheel_1))))
lola: processed formula length: 56
lola: 45 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: 25 markings, 41 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 yes yes no yes no yes no yes yes yes no yes yes yes no
lola:
preliminary result: no yes yes no yes no yes no yes yes yes no yes yes yes no
lola: memory consumption: 18008 KB
lola: time consumption: 45 seconds

BK_STOP 1552339123835

--------------------
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="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
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 r011-smll-155225030100098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0050.tgz
mv AirplaneLD-PT-0050 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;