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 24M
-rw-r--r-- 1 mcc users 9.8K 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 239K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 732K 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 9.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K 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 825K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.6M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18: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 19M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBLF-PT-S06J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534200234
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526983260576


BK_STOP 1526984148559

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S06J04T08 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1656597, 'Memory': 15951.12, 'Tool': 'lola'}, {'Time': 1660186, 'Memory': 15950.56, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S06J04T08...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBLF-PT-S06J04T08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J04T08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-PT-S06J04T08 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 14824/65536 symbol table entries, 9110 collisions
lola: preprocessing...
lola: finding significant places
lola: 810 places, 14014 transitions, 752 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3639 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: E (F ((CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + 1 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8))) : A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8))) : E ((A (G ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= cIdleTasks))) U E (F ((2 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8))))) : (A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8))) AND E (F (((2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_7_5 + DisablePollingB_7_6 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_8_5 + DisablePollingB_8_6 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_3_6 + DisablePollingB_3_5 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_4_6) AND (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + 1 <= 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))))) : ((((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + 1 <= 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) OR ((1 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8) AND (2 <= 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) AND ((Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8) OR (1 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6))) OR (P_1093 <= P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)) AND (E (G ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= 2))) AND E (X (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) OR (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))))) : E (F (E (G ((P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8 <= IsMonitoring))))) : E (G ((SigAbort <= 1))) : A (F ((cJobCnt <= P_1716))) : ((((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6))) AND A (F ((3 <= P_2318_6)))) OR (3 <= P_2318_5)) : E (X (NOT(E (G ((NotifyEventJobCompletedE_1 <= AwakeTasks_1)))))) : NOT(((A (X ((1 <= ScheduleTaskE_Idle_8))) OR (DisablePollingE_3_1 <= 1)) AND E (G (((3 <= P_1725_3) OR (DisablePollingE_8_1 <= NotifyEventJobQueuedB_2_3)))))) : E (G (E (G ((ProcessingEvt_3 <= P_1617_7))))) : E (F ((E (F ((3 <= Insert_Source_E_7))) AND ((QueueJobB_2_1 <= QueueJobB_4_3) AND (1 <= P_2579_4_6) AND (P_2579_4_6 <= Insert_Source_B_6_5))))) : E (G (((Insert_Source_B_8_4 <= DisablePollingE_3_5) OR (Abort_Check_Sources_B_4 <= QueueJobB_4_0)))) : NOT(A (F (E (G ((FetchJobE_4_3 <= P_2318_8)))))) : A (F ((2 <= NotifyEventEndOfCheckSourcesB_6)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J04T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T08-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 86 markings, 85 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: processed formula: A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: processed formula length: 244
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 unused bits
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: 87 markings, 87 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= cIdleTasks))) U E (F ((2 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (cIdleTasks + 1 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8))) U E(TRUE U (2 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8)))
lola: processed formula length: 356
lola: 4 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 251530 markings, 618481 edges, 3689341722891911168 markings/sec, 0 secs
lola: 496066 markings, 1276317 edges, 48907 markings/sec, 5 secs
lola: 765433 markings, 1998841 edges, 53873 markings/sec, 10 secs
lola: 986891 markings, 2584197 edges, 44292 markings/sec, 15 secs
lola: 1215854 markings, 3185817 edges, 45793 markings/sec, 20 secs
lola: 1453528 markings, 3808451 edges, 47535 markings/sec, 25 secs
lola: 1674309 markings, 4384192 edges, 44156 markings/sec, 30 secs
lola: 1906018 markings, 5024699 edges, 46342 markings/sec, 35 secs
lola: 2126197 markings, 5639759 edges, 44036 markings/sec, 40 secs
lola: 2360470 markings, 6242496 edges, 46855 markings/sec, 45 secs
lola: 2597547 markings, 6867738 edges, 47415 markings/sec, 50 secs
lola: 2813055 markings, 7443499 edges, 43102 markings/sec, 55 secs
lola: 3025706 markings, 8040520 edges, 42530 markings/sec, 60 secs
lola: 3248972 markings, 8612041 edges, 44653 markings/sec, 65 secs
lola: 3470931 markings, 9207710 edges, 44392 markings/sec, 70 secs
lola: 3690046 markings, 9785282 edges, 43823 markings/sec, 75 secs
lola: 3914621 markings, 10396193 edges, 44915 markings/sec, 80 secs
lola: 4144618 markings, 11038140 edges, 45999 markings/sec, 85 secs
lola: 4348279 markings, 11665961 edges, 40732 markings/sec, 90 secs
lola: 4559097 markings, 12323360 edges, 42164 markings/sec, 95 secs
lola: 4779396 markings, 12969713 edges, 44060 markings/sec, 100 secs
lola: 5002197 markings, 13582386 edges, 44560 markings/sec, 105 secs
lola: 5222521 markings, 14205263 edges, 44065 markings/sec, 110 secs
lola: 5440538 markings, 14794954 edges, 43603 markings/sec, 115 secs
lola: 5681745 markings, 15500209 edges, 48241 markings/sec, 120 secs
lola: 5899945 markings, 16151922 edges, 43640 markings/sec, 125 secs
lola: 6124059 markings, 16791981 edges, 44823 markings/sec, 130 secs
lola: 6345494 markings, 17430081 edges, 44287 markings/sec, 135 secs
lola: 6539730 markings, 18046037 edges, 38847 markings/sec, 140 secs
lola: 6762151 markings, 18719177 edges, 44484 markings/sec, 145 secs
lola: 6948402 markings, 19339939 edges, 37250 markings/sec, 150 secs
lola: 7156549 markings, 19897326 edges, 41629 markings/sec, 155 secs
lola: 7368286 markings, 20475029 edges, 42347 markings/sec, 160 secs
lola: 7561193 markings, 21099442 edges, 38581 markings/sec, 165 secs
lola: 7761692 markings, 21730345 edges, 40100 markings/sec, 170 secs
lola: 7956701 markings, 22301814 edges, 39002 markings/sec, 175 secs
lola: 8151716 markings, 22877484 edges, 39003 markings/sec, 180 secs
lola: 8353796 markings, 23425938 edges, 40416 markings/sec, 185 secs
lola: 8559052 markings, 24022177 edges, 41051 markings/sec, 190 secs
lola: 8749433 markings, 24630115 edges, 38076 markings/sec, 195 secs
lola: 8975547 markings, 25238208 edges, 45223 markings/sec, 200 secs
lola: 9205053 markings, 25854877 edges, 45901 markings/sec, 205 secs
lola: 9406329 markings, 26468334 edges, 40255 markings/sec, 210 secs
lola: 9595963 markings, 27097734 edges, 37927 markings/sec, 215 secs
lola: 9785814 markings, 27743626 edges, 37970 markings/sec, 220 secs
lola: 9983099 markings, 28377063 edges, 39457 markings/sec, 225 secs
lola: 10170270 markings, 29035738 edges, 37434 markings/sec, 230 secs
lola: 10357122 markings, 29702496 edges, 37370 markings/sec, 235 secs
lola: 10538262 markings, 30357695 edges, 36228 markings/sec, 240 secs
lola: 10758959 markings, 30968421 edges, 44139 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8))) AND E (F (((2 <= DisablePollingB_5_1 + DisablePollingB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)))
lola: processed formula: A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)))
lola: processed formula length: 344
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 30 unused bits
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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J04T08-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T08-CTLCardinality-4.sara.
lola: sara is running 0 secs || 3333 markings, 11526 edges, 667 markings/sec, 0 secs
lola: sara is running 5 secs || 6552 markings, 23124 edges, 644 markings/sec, 5 secs
lola: sara is running 10 secs || 9776 markings, 34779 edges, 645 markings/sec, 10 secs
lola: sara is running 15 secs || 13000 markings, 46487 edges, 645 markings/sec, 15 secs
lola: sara is running 20 secs || 16231 markings, 58130 edges, 646 markings/sec, 20 secs
lola: sara is running 25 secs || 19458 markings, 69803 edges, 645 markings/sec, 25 secs
lola: sara is running 30 secs || 22673 markings, 81409 edges, 643 markings/sec, 30 secs
lola: sara is running 35 secs || 25941 markings, 93210 edges, 654 markings/sec, 35 secs
lola: sara is running 40 secs || 29147 markings, 104762 edges, 641 markings/sec, 40 secs
lola: sara is running 45 secs || 32351 markings, 116374 edges, 641 markings/sec, 45 secs
lola: sara is running 50 secs || 35729 markings, 128613 edges, 676 markings/sec, 50 secs
lola: sara is running 55 secs || 39138 markings, 140890 edges, 682 markings/sec, 55 secs
lola: sara is running 60 secs || 42537 markings, 153133 edges, 680 markings/sec, 60 secs
lola: sara is running 65 secs || 45929 markings, 165411 edges, 678 markings/sec, 65 secs
lola: sara is running 70 secs || 49328 markings, 177744 edges, 680 markings/sec, 70 secs
lola: sara is running 75 secs || 52724 markings, 189987 edges, 679 markings/sec, 75 secs
lola: sara is running 80 secs || 56232 markings, 202319 edges, 702 markings/sec, 80 secs
lola: sara is running 85 secs || 59684 markings, 214647 edges, 690 markings/sec, 85 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 90 secs || 62981 markings, 226487 edges, 659 markings/sec, 90 secs
lola: sara is running 95 secs || 66266 markings, 238220 edges, 657 markings/sec, 95 secs
lola: sara is running 100 secs || 69564 markings, 250019 edges, 660 markings/sec, 100 secs
lola: sara is running 105 secs || 72868 markings, 261901 edges, 661 markings/sec, 105 secs
lola: sara is running 110 secs || 76168 markings, 273768 edges, 660 markings/sec, 110 secs
lola: sara is running 115 secs || 79469 markings, 285748 edges, 660 markings/sec, 115 secs
lola: sara is running 120 secs || 82771 markings, 297737 edges, 660 markings/sec, 120 secs
lola: sara is running 125 secs || 86076 markings, 309829 edges, 661 markings/sec, 125 secs
lola: sara is running 130 secs || 89382 markings, 321775 edges, 661 markings/sec, 130 secs
lola: sara is running 135 secs || 92685 markings, 333801 edges, 661 markings/sec, 135 secs
lola: sara is running 140 secs || 95994 markings, 345957 edges, 662 markings/sec, 140 secs
lola: sara is running 145 secs || 99302 markings, 358129 edges, 662 markings/sec, 145 secs
lola: sara is running 150 secs || 102603 markings, 369904 edges, 660 markings/sec, 150 secs
lola: sara is running 155 secs || 105905 markings, 381781 edges, 660 markings/sec, 155 secs
lola: sara is running 160 secs || 109202 markings, 393546 edges, 659 markings/sec, 160 secs
lola: sara is running 165 secs || 112497 markings, 405318 edges, 659 markings/sec, 165 secs
lola: sara is running 170 secs || 115791 markings, 417157 edges, 659 markings/sec, 170 secs
lola: sara is running 175 secs || 119079 markings, 428999 edges, 658 markings/sec, 175 secs
lola: sara is running 180 secs || 122365 markings, 440856 edges, 657 markings/sec, 180 secs
lola: sara is running 185 secs || 125652 markings, 452825 edges, 657 markings/sec, 185 secs
lola: sara is running 190 secs || 128932 markings, 464832 edges, 656 markings/sec, 190 secs
lola: sara is running 195 secs || 132201 markings, 476661 edges, 654 markings/sec, 195 secs
lola: sara is running 200 secs || 135468 markings, 488498 edges, 653 markings/sec, 200 secs
lola: sara is running 205 secs || 138735 markings, 500521 edges, 653 markings/sec, 205 secs
lola: sara is running 210 secs || 142003 markings, 512575 edges, 654 markings/sec, 210 secs
lola: sara is running 215 secs || 145309 markings, 524411 edges, 661 markings/sec, 215 secs
lola: sara is running 220 secs || 148615 markings, 536247 edges, 661 markings/sec, 220 secs
lola: sara is running 225 secs || 151925 markings, 548097 edges, 662 markings/sec, 225 secs
lola: sara is running 230 secs || 155234 markings, 559919 edges, 662 markings/sec, 230 secs
lola: sara is running 235 secs || 158552 markings, 571818 edges, 664 markings/sec, 235 secs
lola: sara is running 240 secs || 161841 markings, 583682 edges, 658 markings/sec, 240 secs
lola: sara is running 245 secs || 165153 markings, 595597 edges, 662 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTas... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTask... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTask... (shortened)
lola: processed formula length: 2348
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: processed formula with 8 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: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8)))
lola: processed formula length: 227
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) OR (AbourtToModifySrc_1 + AbourtToModif... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) OR (AbourtToModifySrc_1 + AbourtToModifySr... (shortened)
lola: processed formula length: 727
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8 <= IsMonitoring)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (IsMonitoring + 1 <= P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8))))
lola: processed formula length: 132
lola: 3 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 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: 62 markings, 62 edges
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SigAbort <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= SigAbort)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((cJobCnt <= P_1716)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((cJobCnt <= P_1716)))
lola: processed formula: A (F ((cJobCnt <= P_1716)))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 unused bits
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: 101 markings, 101 edges
lola: ========================================
lola: subprocess 8 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6))) AND A (F ((3 <= P_2318_6)))) OR (3 <= P_2318_5))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6)))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: subprocess 9 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= P_2318_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= P_2318_6)))
lola: processed formula: A (F ((3 <= P_2318_6)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 unused bits
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: 101 markings, 101 edges
lola: ========================================
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P_2318_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P_2318_5)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (G ((NotifyEventJobCompletedE_1 <= AwakeTasks_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (AwakeTasks_1 + 1 <= NotifyEventJobCompletedE_1)))
lola: processed formula length: 62
lola: 5 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 294 markings, 293 edges
lola: ========================================
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (X ((1 <= ScheduleTaskE_Idle_8))) OR (DisablePollingE_3_1 <= 1)) AND E (G (((3 <= P_1725_3) OR (DisablePollingE_8_1 <= NotifyEventJobQueuedB_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((ScheduleTaskE_Idle_8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((ScheduleTaskE_Idle_8 <= 0))
lola: processed formula length: 31
lola: 10 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= DisablePollingE_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= DisablePollingE_3_1)
lola: processed formula length: 26
lola: 9 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((P_1725_3 <= 2) AND (NotifyEventJobQueuedB_2_3 + 1 <= DisablePollingE_8_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((P_1725_3 <= 2) AND (NotifyEventJobQueuedB_2_3 + 1 <= DisablePollingE_8_1))))
lola: processed formula: A (F (((P_1725_3 <= 2) AND (NotifyEventJobQueuedB_2_3 + 1 <= DisablePollingE_8_1))))
lola: processed formula length: 84
lola: 9 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 unused bits
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: 101 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((ProcessingEvt_3 <= P_1617_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (P_1617_7 + 1 <= ProcessingEvt_3))))
lola: processed formula length: 58
lola: 4 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 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: 61 markings, 181 edges
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((3 <= Insert_Source_E_7))) AND ((QueueJobB_2_1 <= QueueJobB_4_3) AND (1 <= P_2579_4_6) AND (P_2579_4_6 <= Insert_Source_B_6_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U (3 <= Insert_Source_E_7)) AND ((QueueJobB_2_1 <= QueueJobB_4_3) AND (1 <= P_2579_4_6) AND (P_2579_4_6 <= Insert_Source_B_6_5))))
lola: processed formula length: 147
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 279201 markings, 687624 edges, 55840 markings/sec, 0 secs
lola: 527626 markings, 1378046 edges, 49685 markings/sec, 5 secs
lola: 814580 markings, 2127627 edges, 57391 markings/sec, 10 secs
lola: 1058570 markings, 2773475 edges, 48798 markings/sec, 15 secs
lola: 1304583 markings, 3418545 edges, 49203 markings/sec, 20 secs
lola: 1553726 markings, 4082388 edges, 49829 markings/sec, 25 secs
lola: 1813667 markings, 4763365 edges, 51988 markings/sec, 30 secs
lola: 2053785 markings, 5423836 edges, 48024 markings/sec, 35 secs
lola: 2303020 markings, 6095594 edges, 49847 markings/sec, 40 secs
lola: 2564903 markings, 6783632 edges, 52377 markings/sec, 45 secs
lola: 2811032 markings, 7440178 edges, 49226 markings/sec, 50 secs
lola: 3039660 markings, 8086519 edges, 45726 markings/sec, 55 secs
lola: 3287183 markings, 8710195 edges, 49505 markings/sec, 60 secs
lola: 3529350 markings, 9365944 edges, 48433 markings/sec, 65 secs
lola: 3779269 markings, 10016562 edges, 49984 markings/sec, 70 secs
lola: 4007849 markings, 10661185 edges, 45716 markings/sec, 75 secs
lola: 4228385 markings, 11304496 edges, 44107 markings/sec, 80 secs
lola: 4437471 markings, 11934596 edges, 41817 markings/sec, 85 secs
lola: 4650599 markings, 12591058 edges, 42626 markings/sec, 90 secs
lola: 4863661 markings, 13234361 edges, 42612 markings/sec, 95 secs
lola: 5101145 markings, 13844891 edges, 47497 markings/sec, 100 secs
lola: 5325682 markings, 14490726 edges, 44907 markings/sec, 105 secs
lola: 5555567 markings, 15154554 edges, 45977 markings/sec, 110 secs
lola: 5795150 markings, 15823061 edges, 47917 markings/sec, 115 secs
lola: 6002330 markings, 16472500 edges, 41436 markings/sec, 120 secs
lola: 6234192 markings, 17093233 edges, 46372 markings/sec, 125 secs
lola: 6444369 markings, 17737813 edges, 42035 markings/sec, 130 secs
lola: 6638598 markings, 18350328 edges, 38846 markings/sec, 135 secs
lola: 6846730 markings, 18994093 edges, 41626 markings/sec, 140 secs
lola: 7047663 markings, 19614167 edges, 40187 markings/sec, 145 secs
lola: 7290906 markings, 20255837 edges, 48649 markings/sec, 150 secs
lola: 7496579 markings, 20882772 edges, 41135 markings/sec, 155 secs
lola: 7693946 markings, 21518893 edges, 39473 markings/sec, 160 secs
lola: 7892874 markings, 22115110 edges, 39786 markings/sec, 165 secs
lola: 8095171 markings, 22711746 edges, 40459 markings/sec, 170 secs
lola: 8304458 markings, 23292484 edges, 41857 markings/sec, 175 secs
lola: 8530064 markings, 23922749 edges, 45121 markings/sec, 180 secs
lola: 8707749 markings, 24523050 edges, 35537 markings/sec, 185 secs
lola: 8950499 markings, 25166661 edges, 48550 markings/sec, 190 secs
lola: 9183363 markings, 25789722 edges, 46573 markings/sec, 195 secs
lola: 9376366 markings, 26383492 edges, 38601 markings/sec, 200 secs
lola: 9562846 markings, 26994934 edges, 37296 markings/sec, 205 secs
lola: 9740090 markings, 27617757 edges, 35449 markings/sec, 210 secs
lola: 9936418 markings, 28222109 edges, 39266 markings/sec, 215 secs
lola: 10117703 markings, 28856721 edges, 36257 markings/sec, 220 secs
lola: 10290476 markings, 29478096 edges, 34555 markings/sec, 225 secs
lola: 10465861 markings, 30109806 edges, 35077 markings/sec, 230 secs
lola: 10684580 markings, 30748365 edges, 43744 markings/sec, 235 secs
lola: 10894190 markings, 31348210 edges, 41922 markings/sec, 240 secs
lola: 11090154 markings, 31949915 edges, 39193 markings/sec, 245 secs
lola: 11297447 markings, 32580481 edges, 41459 markings/sec, 250 secs
lola: 11467911 markings, 33200964 edges, 34093 markings/sec, 255 secs
lola: 11635589 markings, 33811806 edges, 33536 markings/sec, 260 secs
lola: 11803280 markings, 34426556 edges, 33538 markings/sec, 265 secs
lola: 11993160 markings, 35021592 edges, 37976 markings/sec, 270 secs
lola: 12170900 markings, 35626949 edges, 35548 markings/sec, 275 secs
lola: 12358272 markings, 36255286 edges, 37474 markings/sec, 280 secs
lola: 12560729 markings, 36817076 edges, 40491 markings/sec, 285 secs
lola: 12764644 markings, 37427097 edges, 40783 markings/sec, 290 secs
lola: 12956980 markings, 38053902 edges, 38467 markings/sec, 295 secs
lola: 13125693 markings, 38678770 edges, 33743 markings/sec, 300 secs
lola: 13336322 markings, 39266268 edges, 42126 markings/sec, 305 secs
lola: 13545885 markings, 39848838 edges, 41913 markings/sec, 310 secs
lola: 13775690 markings, 40456882 edges, 45961 markings/sec, 315 secs
lola: 13986089 markings, 41089768 edges, 42080 markings/sec, 320 secs
lola: 14188965 markings, 41711297 edges, 40575 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 899 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((Insert_Source_B_8_4 <= DisablePollingE_3_5) OR (Abort_Check_Sources_B_4 <= QueueJobB_4_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((DisablePollingE_3_5 + 1 <= Insert_Source_B_8_4) AND (QueueJobB_4_0 + 1 <= Abort_Check_Sources_B_4))))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 14 will run for 1349 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (G ((FetchJobE_4_3 <= P_2318_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (P_2318_8 + 1 <= FetchJobE_4_3)))))
lola: processed formula length: 61
lola: 7 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 61 markings, 61 edges
lola: ========================================
lola: subprocess 15 will run for 2699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= NotifyEventEndOfCheckSourcesB_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= NotifyEventEndOfCheckSourcesB_6)))
lola: processed formula: A (F ((2 <= NotifyEventEndOfCheckSourcesB_6)))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 unused bits
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: 101 markings, 101 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown unknown yes yes yes no no no no yes unknown yes no no
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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-S06J04T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-S06J04T08.tgz
mv PolyORBLF-PT-S06J04T08 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 mcc4mcc-structural"
echo " Input is PolyORBLF-PT-S06J04T08, 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 r131-smll-152673534200234"
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 ;