About the Execution of LoLA for PolyORBLF-PT-S04J04T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
196.960 | 224551.00 | 226605.00 | 514.60 | FFFFFFFTFTTTFTFT | 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 6.0M
-rw-r--r-- 1 mcc users 6.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 180K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 578K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 55K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 174K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 4.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBLF-PT-S04J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257700403
=====================================================================
--------------------
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 PolyORBLF-PT-S04J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1528036814562
info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-PT-S04J04T08 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-PT-S04J04T08 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S04J04T08 @ 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: 4724/65536 symbol table entries, 1248 collisions
lola: preprocessing...
lola: Size of bit vector: 22784
lola: finding significant places
lola: 712 places, 4012 transitions, 658 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2451 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= PollingAbort)
lola: LP says that atomic proposition is always false: (2 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4)
lola: LP says that atomic proposition is always false: (2 <= P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)
lola: LP says that atomic proposition is always false: (2 <= P_1727)
lola: A (((1 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8) U (2 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4))) : A (X ((G ((1 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8)) U F (FALSE)))) : A (X ((X ((FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8 <= P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8)) U F ((3 <= P_1093))))) : A (F (G (X (F ((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8 <= CanInjectEvent)))))) : A ((F (F ((1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8))) U ((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_8 <= Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8) U FALSE))) : A ((F (G ((2 <= cSources))) U ((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8) U (2 <= cIdleTasks)))) : A ((G (F ((1 <= IsMonitoring))) U X (G ((3 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_8_2 + P_1119_8_3 + P_1119_8_4))))) : A ((F (X (FALSE)) U (P_1097 <= ORB_Lock))) : A (X (G ((Perform_Work_E_7 <= ScheduleTaskE_Work_2_3)))) : A ((G (X ((NotifyEventJobQueuedB_6_3 <= Insert_Source_B_8_3))) U F (X ((Check_Sources_E_4 <= DisablePollingB_7_4))))) : A ((DisablePollingB_7_2 <= PlaceSources_3)) : A ((DisablePollingB_6_4 <= TryAllocateOneTaskE_5)) : A (X (FALSE)) : A ((Try_Check_Sources_E_7 <= P_1155_1)) : A (F (G ((P_2318_2 <= CreatedJobs_4_3)))) : A (F ((P_1119_4_1 <= DisablePollingE_4_4)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 209 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: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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: ========================================
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R40 = 0 is above its equality of -1
check_solution: Constraint R84 = 0 is above its equality of -1
check_solution: Constraint R85 = 0 is above its equality of -1
check_solution: Constraint R86 = 0 is above its equality of -1
check_solution: Constraint R87 = 0 is above its equality of -1
check_solution: Constraint R102 = 0 is above its equality of -1
check_solution: Constraint R103 = 0 is above its equality of -1
check_solution: Constraint R104 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 1)
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 223 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: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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 PolyORBLF-PT-S04J04T08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P_1097 <= ORB_Lock)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_1097 <= ORB_Lock)
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DisablePollingB_7_2 <= PlaceSources_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DisablePollingB_7_2 <= PlaceSources_3)
lola: processed formula length: 39
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DisablePollingB_6_4 <= TryAllocateOneTaskE_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DisablePollingB_6_4 <= TryAllocateOneTaskE_5)
lola: processed formula length: 46
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 304 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: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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 PolyORBLF-PT-S04J04T08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Try_Check_Sources_E_7 <= P_1155_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Try_Check_Sources_E_7 <= P_1155_1)
lola: processed formula length: 35
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((3 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((3 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_... (shortened)
lola: processed formula length: 900
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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: 403 markings, 404 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= P_1093))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= P_1093))))
lola: processed formula length: 25
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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: 402 markings, 402 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Perform_Work_E_7 <= ScheduleTaskE_Work_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Perform_Work_E_7 <= ScheduleTaskE_Work_2_3))))
lola: processed formula length: 56
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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: 2889 markings, 2910 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((Check_Sources_E_4 <= DisablePollingB_7_4)) OR (G ((NotifyEventJobQueuedB_6_3 <= Insert_Source_B_8_3)) AND F ((Check_Sources_E_4 <= DisablePollingB_7_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((Check_Sources_E_4 <= DisablePollingB_7_4)) OR (G ((NotifyEventJobQueuedB_6_3 <= Insert_Source_B_8_3)) AND F ((Check_Sources_E_4 <= DisablePollingB_7_4))))))
lola: processed formula length: 167
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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: 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: 9 markings, 8 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P_1119_4_1 <= DisablePollingE_4_4)))
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: (DisablePollingE_4_4 + 1 <= P_1119_4_1)
lola: processed formula length: 39
lola: 40 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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 PolyORBLF-PT-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 837 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P_2318_2 <= CreatedJobs_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P_2318_2 <= CreatedJobs_4_3))))
lola: processed formula length: 41
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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: add low 3924
lola: add low 1356
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: 3687 markings, 3713 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8 <= CanInjectEvent))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8 <= CanInjectEvent))))
lola: processed formula length: 101
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-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: 628 markings, 628 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8) U (2 <= cIdleTasks)) OR (F ((2 <= cIdleTasks)) AND F (G ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8) U (2 <= cIdleTasks)) OR (F ((2 <= cIdleTasks)) AND F (G ((... (shortened)
lola: processed formula length: 419
lola: 38 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 330 markings, 330 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8) U (2 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8) U (2 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4)))
lola: processed formula length: 184
lola: 42 rewrites
lola: closed formula file PolyORBLF-PT-S04J04T08-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no yes yes yes no yes no yes
lola:
preliminary result: no no no no no no no yes no yes yes yes no yes no yes
lola: memory consumption: 30332 KB
lola: time consumption: 224 seconds
BK_STOP 1528037039113
--------------------
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="PolyORBLF-PT-S04J04T08"
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/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 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 PolyORBLF-PT-S04J04T08, 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 r208-smll-152732257700403"
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 '
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 ;