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 irma4mcc-full
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 r126-smll-152673528500234
=====================================================================

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


BK_STOP 1526847634839

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
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: 276890 markings, 681652 edges, 3689341722891911168 markings/sec, 0 secs
lola: 513767 markings, 1334843 edges, 47375 markings/sec, 5 secs
lola: 782849 markings, 2043280 edges, 53816 markings/sec, 10 secs
lola: 1005395 markings, 2632964 edges, 44509 markings/sec, 15 secs
lola: 1235729 markings, 3237399 edges, 46067 markings/sec, 20 secs
lola: 1474510 markings, 3867809 edges, 47756 markings/sec, 25 secs
lola: 1702770 markings, 4457016 edges, 45652 markings/sec, 30 secs
lola: 1943573 markings, 5137826 edges, 48161 markings/sec, 35 secs
lola: 2179148 markings, 5779638 edges, 47115 markings/sec, 40 secs
lola: 2422900 markings, 6410729 edges, 48750 markings/sec, 45 secs
lola: 2666897 markings, 7053564 edges, 48799 markings/sec, 50 secs
lola: 2888752 markings, 7647487 edges, 44371 markings/sec, 55 secs
lola: 3112552 markings, 8272713 edges, 44760 markings/sec, 60 secs
lola: 3339777 markings, 8856682 edges, 45445 markings/sec, 65 secs
lola: 3565169 markings, 9457682 edges, 45078 markings/sec, 70 secs
lola: 3788044 markings, 10037113 edges, 44575 markings/sec, 75 secs
lola: 4005506 markings, 10653908 edges, 43492 markings/sec, 80 secs
lola: 4222132 markings, 11278302 edges, 43325 markings/sec, 85 secs
lola: 4429780 markings, 11903027 edges, 41530 markings/sec, 90 secs
lola: 4641678 markings, 12558014 edges, 42380 markings/sec, 95 secs
lola: 4850525 markings, 13195473 edges, 41769 markings/sec, 100 secs
lola: 5075577 markings, 13770483 edges, 45010 markings/sec, 105 secs
lola: 5286830 markings, 14381779 edges, 42251 markings/sec, 110 secs
lola: 5502740 markings, 14991821 edges, 43182 markings/sec, 115 secs
lola: 5743118 markings, 15668285 edges, 48076 markings/sec, 120 secs
lola: 5957771 markings, 16327070 edges, 42931 markings/sec, 125 secs
lola: 6173964 markings, 16922484 edges, 43239 markings/sec, 130 secs
lola: 6391186 markings, 17555413 edges, 43444 markings/sec, 135 secs
lola: 6578841 markings, 18171616 edges, 37531 markings/sec, 140 secs
lola: 6802223 markings, 18829967 edges, 44676 markings/sec, 145 secs
lola: 6993634 markings, 19466326 edges, 38282 markings/sec, 150 secs
lola: 7215903 markings, 20054703 edges, 44454 markings/sec, 155 secs
lola: 7438647 markings, 20674270 edges, 44549 markings/sec, 160 secs
lola: 7631977 markings, 21337904 edges, 38666 markings/sec, 165 secs
lola: 7846469 markings, 21953336 edges, 42898 markings/sec, 170 secs
lola: 8046545 markings, 22572845 edges, 40015 markings/sec, 175 secs
lola: 8251464 markings, 23138162 edges, 40984 markings/sec, 180 secs
lola: 8473932 markings, 23737223 edges, 44494 markings/sec, 185 secs
lola: 8657927 markings, 24377178 edges, 36799 markings/sec, 190 secs
lola: 8887810 markings, 25004531 edges, 45977 markings/sec, 195 secs
lola: 9122943 markings, 25615833 edges, 47027 markings/sec, 200 secs
lola: 9328214 markings, 26226688 edges, 41054 markings/sec, 205 secs
lola: 9524208 markings, 26857483 edges, 39199 markings/sec, 210 secs
lola: 9708202 markings, 27502146 edges, 36799 markings/sec, 215 secs
lola: 9914845 markings, 28143073 edges, 41329 markings/sec, 220 secs
lola: 10103973 markings, 28798726 edges, 37826 markings/sec, 225 secs
lola: 10286708 markings, 29454605 edges, 36547 markings/sec, 230 secs
lola: 10471143 markings, 30119619 edges, 36887 markings/sec, 235 secs
lola: 10683645 markings, 30749048 edges, 42500 markings/sec, 240 secs
lola: 10896442 markings, 31349411 edges, 42559 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 || 3437 markings, 11909 edges, 687 markings/sec, 0 secs
lola: sara is running 5 secs || 6674 markings, 23564 edges, 647 markings/sec, 5 secs
lola: sara is running 10 secs || 9911 markings, 35265 edges, 647 markings/sec, 10 secs
lola: sara is running 15 secs || 13152 markings, 47031 edges, 648 markings/sec, 15 secs
lola: sara is running 20 secs || 16404 markings, 58753 edges, 650 markings/sec, 20 secs
lola: sara is running 25 secs || 19652 markings, 70493 edges, 650 markings/sec, 25 secs
lola: sara is running 30 secs || 22932 markings, 82334 edges, 656 markings/sec, 30 secs
lola: sara is running 35 secs || 26156 markings, 94003 edges, 645 markings/sec, 35 secs
lola: sara is running 40 secs || 29573 markings, 106314 edges, 683 markings/sec, 40 secs
lola: sara is running 45 secs || 32681 markings, 117557 edges, 622 markings/sec, 45 secs
lola: sara is running 50 secs || 36125 markings, 130073 edges, 689 markings/sec, 50 secs
lola: sara is running 55 secs || 39569 markings, 142448 edges, 689 markings/sec, 55 secs
lola: sara is running 60 secs || 43007 markings, 154841 edges, 688 markings/sec, 60 secs
lola: sara is running 65 secs || 46427 markings, 167197 edges, 684 markings/sec, 65 secs
lola: sara is running 70 secs || 49851 markings, 179617 edges, 685 markings/sec, 70 secs
lola: sara is running 75 secs || 53292 markings, 192060 edges, 688 markings/sec, 75 secs
lola: sara is running 80 secs || 56818 markings, 204422 edges, 705 markings/sec, 80 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 85 secs || 60142 markings, 216294 edges, 665 markings/sec, 85 secs
lola: sara is running 90 secs || 63443 markings, 228134 edges, 660 markings/sec, 90 secs
lola: sara is running 95 secs || 66742 markings, 239918 edges, 660 markings/sec, 95 secs
lola: sara is running 100 secs || 70040 markings, 251726 edges, 660 markings/sec, 100 secs
lola: sara is running 105 secs || 73410 markings, 263844 edges, 674 markings/sec, 105 secs
lola: sara is running 110 secs || 76853 markings, 276244 edges, 689 markings/sec, 110 secs
lola: sara is running 115 secs || 80296 markings, 288753 edges, 689 markings/sec, 115 secs
lola: sara is running 120 secs || 83741 markings, 301291 edges, 689 markings/sec, 120 secs
lola: sara is running 125 secs || 87184 markings, 313847 edges, 689 markings/sec, 125 secs
lola: sara is running 130 secs || 90629 markings, 326296 edges, 689 markings/sec, 130 secs
lola: sara is running 135 secs || 94076 markings, 338914 edges, 689 markings/sec, 135 secs
lola: sara is running 140 secs || 97523 markings, 351629 edges, 689 markings/sec, 140 secs
lola: sara is running 145 secs || 100965 markings, 364068 edges, 688 markings/sec, 145 secs
lola: sara is running 150 secs || 104400 markings, 376351 edges, 687 markings/sec, 150 secs
lola: sara is running 155 secs || 107834 markings, 388648 edges, 687 markings/sec, 155 secs
lola: sara is running 160 secs || 111274 markings, 400938 edges, 688 markings/sec, 160 secs
lola: sara is running 165 secs || 114671 markings, 413119 edges, 679 markings/sec, 165 secs
lola: sara is running 170 secs || 117962 markings, 424973 edges, 658 markings/sec, 170 secs
lola: sara is running 175 secs || 121272 markings, 436889 edges, 662 markings/sec, 175 secs
lola: sara is running 180 secs || 124578 markings, 448926 edges, 661 markings/sec, 180 secs
lola: sara is running 185 secs || 127881 markings, 460954 edges, 661 markings/sec, 185 secs
lola: sara is running 190 secs || 131184 markings, 472991 edges, 661 markings/sec, 190 secs
lola: sara is running 195 secs || 134483 markings, 484912 edges, 660 markings/sec, 195 secs
lola: sara is running 200 secs || 137775 markings, 496962 edges, 658 markings/sec, 200 secs
lola: sara is running 205 secs || 141070 markings, 509089 edges, 659 markings/sec, 205 secs
lola: sara is running 210 secs || 144389 markings, 521140 edges, 664 markings/sec, 210 secs
lola: sara is running 215 secs || 147722 markings, 533041 edges, 667 markings/sec, 215 secs
lola: sara is running 220 secs || 151062 markings, 545017 edges, 668 markings/sec, 220 secs
lola: sara is running 225 secs || 154464 markings, 557169 edges, 680 markings/sec, 225 secs
lola: sara is running 230 secs || 157931 markings, 569588 edges, 693 markings/sec, 230 secs
lola: sara is running 235 secs || 161399 markings, 582065 edges, 694 markings/sec, 235 secs
lola: sara is running 240 secs || 164762 markings, 594184 edges, 673 markings/sec, 240 secs
lola: sara is running 245 secs || 168101 markings, 606315 edges, 668 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: 285949 markings, 703687 edges, 57190 markings/sec, 0 secs
lola: 546088 markings, 1425867 edges, 52028 markings/sec, 5 secs
lola: 835413 markings, 2183132 edges, 57865 markings/sec, 10 secs
lola: 1086711 markings, 2846699 edges, 50260 markings/sec, 15 secs
lola: 1343357 markings, 3519334 edges, 51329 markings/sec, 20 secs
lola: 1601838 markings, 4197663 edges, 51696 markings/sec, 25 secs
lola: 1862576 markings, 4905296 edges, 52148 markings/sec, 30 secs
lola: 2101774 markings, 5575005 edges, 47840 markings/sec, 35 secs
lola: 2365382 markings, 6257401 edges, 52722 markings/sec, 40 secs
lola: 2632559 markings, 6962023 edges, 53435 markings/sec, 45 secs
lola: 2876101 markings, 7615107 edges, 48708 markings/sec, 50 secs
lola: 3112359 markings, 8274018 edges, 47252 markings/sec, 55 secs
lola: 3351593 markings, 8897063 edges, 47847 markings/sec, 60 secs
lola: 3607049 markings, 9571374 edges, 51091 markings/sec, 65 secs
lola: 3851344 markings, 10227130 edges, 48859 markings/sec, 70 secs
lola: 4101627 markings, 10902644 edges, 50057 markings/sec, 75 secs
lola: 4291926 markings, 11493322 edges, 38060 markings/sec, 80 secs
lola: 4504455 markings, 12162141 edges, 42506 markings/sec, 85 secs
lola: 4740791 markings, 12854016 edges, 47267 markings/sec, 90 secs
lola: 4975272 markings, 13518310 edges, 46896 markings/sec, 95 secs
lola: 5208759 markings, 14170966 edges, 46697 markings/sec, 100 secs
lola: 5455181 markings, 14843585 edges, 49284 markings/sec, 105 secs
lola: 5710193 markings, 15584183 edges, 51002 markings/sec, 110 secs
lola: 5931294 markings, 16255058 edges, 44220 markings/sec, 115 secs
lola: 6168545 markings, 16913380 edges, 47450 markings/sec, 120 secs
lola: 6399979 markings, 17590460 edges, 46287 markings/sec, 125 secs
lola: 6594492 markings, 18225773 edges, 38903 markings/sec, 130 secs
lola: 6823782 markings, 18912768 edges, 45858 markings/sec, 135 secs
lola: 7028400 markings, 19563257 edges, 40924 markings/sec, 140 secs
lola: 7284682 markings, 20239470 edges, 51256 markings/sec, 145 secs
lola: 7503483 markings, 20906490 edges, 43760 markings/sec, 150 secs
lola: 7714359 markings, 21585616 edges, 42175 markings/sec, 155 secs
lola: 7923156 markings, 22209955 edges, 41759 markings/sec, 160 secs
lola: 8135697 markings, 22836590 edges, 42508 markings/sec, 165 secs
lola: 8359175 markings, 23447108 edges, 44696 markings/sec, 170 secs
lola: 8579397 markings, 24102070 edges, 44044 markings/sec, 175 secs
lola: 8802454 markings, 24774938 edges, 44611 markings/sec, 180 secs
lola: 9034974 markings, 25402835 edges, 46504 markings/sec, 185 secs
lola: 9266872 markings, 26037702 edges, 46380 markings/sec, 190 secs
lola: 9470723 markings, 26677352 edges, 40770 markings/sec, 195 secs
lola: 9657562 markings, 27314514 edges, 37368 markings/sec, 200 secs
lola: 9856140 markings, 27959640 edges, 39716 markings/sec, 205 secs
lola: 10045364 markings, 28607789 edges, 37845 markings/sec, 210 secs
lola: 10229313 markings, 29262955 edges, 36790 markings/sec, 215 secs
lola: 10412010 markings, 29916087 edges, 36539 markings/sec, 220 secs
lola: 10616425 markings, 30579164 edges, 40883 markings/sec, 225 secs
lola: 10847660 markings, 31209061 edges, 46247 markings/sec, 230 secs
lola: 11054436 markings, 31842476 edges, 41355 markings/sec, 235 secs
lola: 11278498 markings, 32506143 edges, 44812 markings/sec, 240 secs
lola: 11454791 markings, 33147396 edges, 35259 markings/sec, 245 secs
lola: 11628997 markings, 33789048 edges, 34841 markings/sec, 250 secs
lola: 11804279 markings, 34430245 edges, 35056 markings/sec, 255 secs
lola: 12002865 markings, 35050622 edges, 39717 markings/sec, 260 secs
lola: 12189366 markings, 35686288 edges, 37300 markings/sec, 265 secs
lola: 12393890 markings, 36353632 edges, 40905 markings/sec, 270 secs
lola: 12606133 markings, 36974422 edges, 42449 markings/sec, 275 secs
lola: 12826476 markings, 37604052 edges, 44069 markings/sec, 280 secs
lola: 13003794 markings, 38226872 edges, 35464 markings/sec, 285 secs
lola: 13181407 markings, 38854785 edges, 35523 markings/sec, 290 secs
lola: 13398180 markings, 39442750 edges, 43355 markings/sec, 295 secs
lola: 13614492 markings, 40035536 edges, 43262 markings/sec, 300 secs
lola: 13840516 markings, 40661655 edges, 45205 markings/sec, 305 secs
lola: 14052255 markings, 41308362 edges, 42348 markings/sec, 310 secs
lola: 14245641 markings, 41903095 edges, 38677 markings/sec, 315 secs
lola: 14255002 markings, 41935199 edges, 1872 markings/sec, 320 secs
lola: 14256267 markings, 41939206 edges, 253 markings/sec, 325 secs
lola: 14256693 markings, 41940683 edges, 85 markings/sec, 330 secs
lola: 14256713 markings, 41940721 edges, 4 markings/sec, 335 secs
lola: 14257194 markings, 41942278 edges, 96 markings/sec, 340 secs
lola: 14257212 markings, 41942347 edges, 4 markings/sec, 345 secs
lola: 14257515 markings, 41943308 edges, 61 markings/sec, 350 secs
lola: 14257526 markings, 41943327 edges, 2 markings/sec, 355 secs
lola: 14257538 markings, 41943391 edges, 2 markings/sec, 360 secs
lola: 14258001 markings, 41944896 edges, 93 markings/sec, 365 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 875 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 1313 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 2626 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 stdout -----
----- Kill lola and sara stderr -----
----- 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="irma4mcc-full"
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 irma4mcc-full"
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 r126-smll-152673528500234"
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 ;