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 1.3M
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 4.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 7.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K 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 983K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBLF-PT-S02J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673526900157
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526992191772

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-PT-S02J06T06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-PT-S02J06T06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ PolyORBLF-PT-S02J06T06 @ 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: 1600/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: Size of bit vector: 17152
lola: finding significant places
lola: 536 places, 1064 transitions, 486 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1483 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: LP says that atomic proposition is always false: (cJobCnt <= BlockedTasks)
lola: LP says that atomic proposition is always true: (1 <= cBlockedTasks)
lola: LP says that atomic proposition is always false: (3 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)
lola: LP says that atomic proposition is always true: (2 <= cJobCnt)
lola: LP says that atomic proposition is always true: (1 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)
lola: LP says that atomic proposition is always false: (2 <= 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: (3 <= NotifyEventJobQueuedB_2_2)
lola: LP says that atomic proposition is always false: (3 <= QueueJobB_1_5)
lola: LP says that atomic proposition is always false: (2 <= FetchJobE_5_3)
lola: LP says that atomic proposition is always false: (2 <= FetchJobE_4_1)
lola: LP says that atomic proposition is always false: (2 <= ScheduleTaskE_Check_4)
lola: LP says that atomic proposition is always false: (3 <= Try_Check_Sources_B_2)
lola: NOT((E (F (())) OR (((CanInjectEvent <= 0)) AND (NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + 1 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6)))) : (E (G (A (X ((P_1717 <= cSources))))) AND A (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1) U (P_1095 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_6_1 + Insert_Source_B_6_2)))) : A (G (((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6) OR (1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6) OR (RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + 1 <= SigAbort) OR (P_1099 + 1 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_6_1 + CreatedJobs_6_2) OR (P_1727 + 1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6)))) : (E (G (())) AND E (G (E (X ((P_1095 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6)))))) : E (F (E (G ((SigAbort + 1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6))))) : (A (G (((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) OR (1 <= cSources) OR (1 <= P_1726)))) OR A ((() U (NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_5_5 + NotifyEventJobQueuedB_5_6 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_6_5 + NotifyEventJobQueuedB_6_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + 1 <= P_1727)))) : E (F (E (((ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 <= FetchJobB_5 + FetchJobB_4 + FetchJobB_3 + FetchJobB_2 + FetchJobB_1 + FetchJobB_6) U FALSE)))) : NOT(E (F (A (G ((1 <= CanInjectEvent)))))) : (A (G (A (F ((CreatedJobs_4_2 <= QueueJobB_5_4))))) OR NOT(E (F ((1 <= ScheduleTaskE_Work_3_1))))) : ((E (((DisablePollingB_1_2 <= EnablePollingB_4) U (DisablePollingB_6_1 <= QueueJobE_5))) AND A (X ((DisablePollingE_3_2 <= 0)))) AND A (F (A (F ((2 <= P_1159_6)))))) : E (G ((E (X ((QueueJobB_4_4 <= QueueJobB_1_5))) OR ((FetchJobE_2_4 + 1 <= SigAbort))))) : NOT((A (F (TRUE)) AND A (G ((Perform_Work_E_6 <= Check_Sources_B_6))))) : NOT(E (F (A (X (FALSE))))) : NOT(A (F (()))) : A (F (E (X (())))) : A (F ((1 <= QueueJobB_2_4)))
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= CanInjectEvent)) OR (NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobComple... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= CanInjectEvent)) OR (NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobComple... (shortened)
lola: processed formula length: 408
lola: 46 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: processed formula with 2 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

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 46 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.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-S02J06T06-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 238 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: 46 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 256 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: 46 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.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-S02J06T06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((DisablePollingB_1_2 <= EnablePollingB_4) U (DisablePollingB_6_1 <= QueueJobE_5))) AND (A (X ((DisablePollingE_3_2 <= 0))) AND A (F ((2 <= P_1159_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= P_1159_6)))
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: (P_1159_6 <= 1)
lola: processed formula length: 15
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 355 markings, 355 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((QueueJobB_4_4 <= QueueJobB_1_5))) OR ((FetchJobE_2_4 + 1 <= SigAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(EX((QueueJobB_4_4 <= QueueJobB_1_5))) AND ((SigAbort <= FetchJobE_2_4)))))
lola: processed formula length: 92
lola: 50 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 390 markings, 390 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((P_1095 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((P_1095 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6)))))
lola: processed formula length: 110
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 35019 markings, 82180 edges
lola:
========================================
FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((P_1717 <= cSources))))) AND A (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_... (shortened)
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 (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_... (shortened)
lola: processed formula length: 724
lola: 50 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.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: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((P_1717 <= cSources)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX((P_1717 <= cSources)))))
lola: processed formula length: 44
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 257197 markings, 715737 edges, 51439 markings/sec, 0 secs
lola: 602568 markings, 1412130 edges, 69074 markings/sec, 5 secs
lola: 915704 markings, 2151582 edges, 62627 markings/sec, 10 secs
lola: 1304718 markings, 2871992 edges, 77803 markings/sec, 15 secs
lola: 1725213 markings, 3601898 edges, 84099 markings/sec, 20 secs
lola: 2085706 markings, 4359476 edges, 72099 markings/sec, 25 secs
lola: 2363474 markings, 5164209 edges, 55554 markings/sec, 30 secs
lola: 2643636 markings, 5939554 edges, 56032 markings/sec, 35 secs
lola: 3032234 markings, 6654574 edges, 77720 markings/sec, 40 secs
lola: 3376917 markings, 7384793 edges, 68937 markings/sec, 45 secs
lola: 3655617 markings, 8165487 edges, 55740 markings/sec, 50 secs
lola: 3959927 markings, 8903366 edges, 60862 markings/sec, 55 secs
lola: 4347099 markings, 9608553 edges, 77434 markings/sec, 60 secs
lola: 4648878 markings, 10366885 edges, 60356 markings/sec, 65 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4881691 markings, 11039016 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net is not deadlock-free.
lola: 1312 markings, 1319 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Check_Sources_B_6 + 1 <= Perform_Work_E_6)))
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 ((Check_Sources_B_6 + 1 <= Perform_Work_E_6)))
lola: processed formula length: 51
lola: 47 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.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: (Check_Sources_B_6 + 1 <= Perform_Work_E_6)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T06-CTLCardinality-9-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 207 markings, 206 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6) OR (1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6) OR (1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTa... (shortened)
lola: processed formula length: 1491
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + 1 <= ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6) AND (TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= 0) AND (SigAbort <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6) AND (CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_6_1 + CreatedJobs_6_2 <= P_1099) AND (QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6 <= P_1727))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T06-CTLCardinality-10-0.sara
lola: state equation: calling and running saralola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 59 markings, 58 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((CanInjectEvent <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (CanInjectEvent <= 0)
lola: processed formula length: 21
lola: 47 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 109222 markings, 127683 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= QueueJobB_2_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: (QueueJobB_2_4 <= 0)
lola: processed formula length: 20
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 355 markings, 355 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((SigAbort + 1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (SigAbort + 1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)
lola: processed formula length: 92
lola: 47 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 140635 markings, 163600 edges, 28127 markings/sec, 0 secs
lola: 287767 markings, 338587 edges, 29426 markings/sec, 5 secs
lola: 431469 markings, 507463 edges, 28740 markings/sec, 10 secs
lola: 576031 markings, 679361 edges, 28912 markings/sec, 15 secs
lola: 718243 markings, 844472 edges, 28442 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 720478 markings, 846930 edges

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) OR (1 <= cSources) OR (1 <= P_1726)))) OR A (F ((NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + No... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) OR (1 <= cSources) OR (1 <= P_1726))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) OR (1 <= cSources) OR (1 <= P_1726))))
lola: processed formula length: 106
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= 2) AND (cSources <= 0) AND (P_1726 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T06-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T06-CTLCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 142 markings, 141 edges
lola: ========================================
lola: subprocess 15 will run for 3235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + N... (shortened)
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: (P_1727 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6... (shortened)
lola: processed formula length: 1185
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.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: 2085 markings, 2255 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((CreatedJobs_4_2 <= QueueJobB_5_4))))) OR A (G ((ScheduleTaskE_Work_3_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ScheduleTaskE_Work_3_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((ScheduleTaskE_Work_3_1 <= 0)))
lola: processed formula length: 37
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (1 <= ScheduleTaskE_Work_3_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T06-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T06-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2726 markings, 3004 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((CreatedJobs_4_2 <= QueueJobB_5_4))))) OR A (G ((ScheduleTaskE_Work_3_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((ScheduleTaskE_Work_3_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((ScheduleTaskE_Work_3_1 <= 0)))
lola: processed formula length: 37
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (1 <= ScheduleTaskE_Work_3_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T06-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T06-CTLCardinality-16-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2726 markings, 3004 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((CreatedJobs_4_2 <= QueueJobB_5_4)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (QueueJobB_5_4 + 1 <= CreatedJobs_4_2)
lola: processed formula length: 38
lola: 48 rewrites
lola: closed formula file PolyORBLF-PT-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 135947 markings, 152430 edges, 27189 markings/sec, 0 secs
lola: 271974 markings, 310944 edges, 27205 markings/sec, 5 secs
lola: 407556 markings, 470298 edges, 27116 markings/sec, 10 secs
lola: 542762 markings, 630749 edges, 27041 markings/sec, 15 secs
lola: 677078 markings, 789486 edges, 26863 markings/sec, 20 secs
lola: 808369 markings, 945702 edges, 26258 markings/sec, 25 secs
lola: 938982 markings, 1102943 edges, 26123 markings/sec, 30 secs
lola: 1069179 markings, 1257548 edges, 26039 markings/sec, 35 secs
lola: 1199285 markings, 1413527 edges, 26021 markings/sec, 40 secs
lola: 1329060 markings, 1569193 edges, 25955 markings/sec, 45 secs
lola: 1458675 markings, 1725471 edges, 25923 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 1496786 markings, 1770755 edges
lola: lola: SUBRESULT
lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBLF-PT-S02J06T06-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no no no no yes yes no yes no no
lola:
preliminary result: yes yes no yes yes yes no no no no yes yes no yes no no
lola: memory consumption: 27236 KB
lola: time consumption: 392 seconds

BK_STOP 1526992584610

--------------------
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-S02J06T06"
export BK_EXAMINATION="CTLCardinality"
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-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 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-S02J06T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r124-smll-152673526900157"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;