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 2.1M
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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 7.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K 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 15K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732262000399
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527440809564


BK_STOP 1527441312851

--------------------
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-S02J06T10 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 214761, 'Memory': 15933.73, 'Tool': 'lola'}, {'Time': 222963, 'Memory': 15940.76, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-PT-S02J06T10...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S02J06T10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-PT-S02J06T10 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2656/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: A (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716))))) : A (G ((2 <= Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9))) : A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10))) : A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1))) U G (G ((DataOnSrc_2 + DataOnSrc_1 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10))))) : A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring))))) : A ((IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)) : A (G (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1)))))) : A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_10_0 + NotifyEventJobQueuedB_10_1 + NotifyEventJobQueuedB_10_2 + NotifyEventJobQueuedB_10_3 + NotifyEventJobQueuedB_10_4 + NotifyEventJobQueuedB_10_5 + NotifyEventJobQueuedB_10_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_5_5 + NotifyEventJobQueuedB_5_6 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_6_5 + NotifyEventJobQueuedB_6_6 + NotifyEventJobQueuedB_7_0 + NotifyEventJobQueuedB_7_1 + NotifyEventJobQueuedB_7_2 + NotifyEventJobQueuedB_7_3 + NotifyEventJobQueuedB_7_4 + NotifyEventJobQueuedB_7_5 + NotifyEventJobQueuedB_7_6 + NotifyEventJobQueuedB_8_0 + NotifyEventJobQueuedB_8_1 + NotifyEventJobQueuedB_8_2 + NotifyEventJobQueuedB_8_3 + NotifyEventJobQueuedB_8_4 + NotifyEventJobQueuedB_8_5 + NotifyEventJobQueuedB_8_6 + NotifyEventJobQueuedB_9_0 + NotifyEventJobQueuedB_9_1 + NotifyEventJobQueuedB_9_2 + NotifyEventJobQueuedB_9_3 + NotifyEventJobQueuedB_9_4 + NotifyEventJobQueuedB_9_5 + NotifyEventJobQueuedB_9_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6)) U F ((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))))) : A (G ((NotifyEventJobQueuedB_5_3 <= FetchJobB_3))) : A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2))) : A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6))))) : A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1)))) : A ((EnablePollingE_10 <= AwakeTasks_4)) : A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9)))) : A (X (G (F (F ((FetchJobB_1 <= RunE_10)))))) : A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716)))))
lola: processed formula: A (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716)))))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 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: 405 markings, 406 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)))
lola: processed formula: A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 71429 markings, 108579 edges, 14286 markings/sec, 0 secs
lola: 141613 markings, 222169 edges, 14037 markings/sec, 5 secs
lola: 214093 markings, 334086 edges, 14496 markings/sec, 10 secs
lola: 286337 markings, 445878 edges, 14449 markings/sec, 15 secs
lola: 354208 markings, 551117 edges, 13574 markings/sec, 20 secs
lola: 419870 markings, 653631 edges, 13132 markings/sec, 25 secs
lola: 487868 markings, 758280 edges, 13600 markings/sec, 30 secs
lola: 553469 markings, 861603 edges, 13120 markings/sec, 35 secs
lola: 627055 markings, 975411 edges, 14717 markings/sec, 40 secs
lola: 700580 markings, 1089249 edges, 14705 markings/sec, 45 secs
lola: 768994 markings, 1200386 edges, 13683 markings/sec, 50 secs
lola: 839324 markings, 1312602 edges, 14066 markings/sec, 55 secs
lola: 912138 markings, 1425272 edges, 14563 markings/sec, 60 secs
lola: 982915 markings, 1537018 edges, 14155 markings/sec, 65 secs
lola: 1050619 markings, 1647181 edges, 13541 markings/sec, 70 secs
lola: 1126309 markings, 1763319 edges, 15138 markings/sec, 75 secs
lola: 1197357 markings, 1877498 edges, 14210 markings/sec, 80 secs
lola: 1271215 markings, 1991774 edges, 14772 markings/sec, 85 secs
lola: 1343057 markings, 2102775 edges, 14368 markings/sec, 90 secs
lola: 1409918 markings, 2206377 edges, 13372 markings/sec, 95 secs
lola: 1474701 markings, 2307450 edges, 12957 markings/sec, 100 secs
lola: 1541354 markings, 2410906 edges, 13331 markings/sec, 105 secs
lola: 1606617 markings, 2512966 edges, 13053 markings/sec, 110 secs
lola: 1677122 markings, 2623789 edges, 14101 markings/sec, 115 secs
lola: 1743369 markings, 2734054 edges, 13249 markings/sec, 120 secs
lola: 1810096 markings, 2843998 edges, 13345 markings/sec, 125 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1857354 markings, 2921023 edges
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePoll... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1))) U G (G ((DataOnSrc_2 + DataOnSrc_1 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10)))))
lola: processed formula: A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePoll... (shortened)
lola: processed formula length: 797
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 29 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: 629 markings, 629 edges
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring)))))
lola: processed formula: A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring)))))
lola: processed formula length: 374
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)
lola: processed formula length: 252
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.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 6 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + Dis... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1)))))
lola: processed formula: A (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + Disabl... (shortened)
lola: processed formula length: 462
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 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: 630 markings, 631 edges
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_10_0 + NotifyEventJobQueuedB_10_1 + NotifyEventJobQueuedB_10_2 + NotifyEventJobQueuedB_10_3 + NotifyEventJobQueuedB_10_4 + NotifyEventJobQueuedB_10_5 + NotifyEventJobQueuedB_10_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_5_5 + NotifyEventJobQueuedB_5_6 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_6_5 + NotifyEventJobQueuedB_6_6 + NotifyEventJobQueuedB_7_0 + NotifyEventJobQueuedB_7_1 + NotifyEventJobQueuedB_7_2 + NotifyEventJobQueuedB_7_3 + NotifyEventJobQueuedB_7_4 + NotifyEventJobQueuedB_7_5 + NotifyEventJobQueuedB_7_6 + NotifyEventJobQueuedB_8_0 + NotifyEventJobQueuedB_8_1 + NotifyEventJobQueuedB_8_2 + NotifyEventJobQueuedB_8_3 + NotifyEventJobQueuedB_8_4 + NotifyEventJobQueuedB_8_5 + NotifyEventJobQueuedB_8_6 + NotifyEventJobQueuedB_9_0 + NotifyEventJobQueuedB_9_1 + NotifyEventJobQueuedB_9_2 + NotifyEventJobQueuedB_9_3 + NotifyEventJobQueuedB_9_4 + NotifyEventJobQueuedB_9_5 + NotifyEventJobQueuedB_9_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6)) U F ((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10)))))
lola: processed formula: A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2... (shortened)
lola: processed formula length: 2701
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventJobQueuedB_5_3 <= FetchJobB_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31314 markings, 35842 edges
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2)))
lola: processed formula: A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6)))))
lola: processed formula: A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 613030 markings, 735749 edges, 122606 markings/sec, 0 secs
lola: 1198497 markings, 1482463 edges, 117093 markings/sec, 5 secs
lola: 1729213 markings, 2176218 edges, 106143 markings/sec, 10 secs
lola: 2238312 markings, 2847003 edges, 101820 markings/sec, 15 secs
lola: 2731016 markings, 3513846 edges, 98541 markings/sec, 20 secs
lola: 3215518 markings, 4173394 edges, 96900 markings/sec, 25 secs
lola: 3695853 markings, 4833463 edges, 96067 markings/sec, 30 secs
lola: 4170753 markings, 5491208 edges, 94980 markings/sec, 35 secs
lola: 4645940 markings, 6145254 edges, 95037 markings/sec, 40 secs
lola: 5116443 markings, 6803167 edges, 94101 markings/sec, 45 secs
lola: 5583096 markings, 7462043 edges, 93331 markings/sec, 50 secs
lola: 6043607 markings, 8123626 edges, 92102 markings/sec, 55 secs
lola: 6504952 markings, 8780270 edges, 92269 markings/sec, 60 secs
lola: 6964312 markings, 9439011 edges, 91872 markings/sec, 65 secs
lola: 7420094 markings, 10095388 edges, 91156 markings/sec, 70 secs
lola: 7876149 markings, 10750972 edges, 91211 markings/sec, 75 secs
lola: 8329203 markings, 11401963 edges, 90611 markings/sec, 80 secs
lola: 8775915 markings, 12051625 edges, 89342 markings/sec, 85 secs
lola: 9213355 markings, 12692489 edges, 87488 markings/sec, 90 secs
lola: 9650529 markings, 13334720 edges, 87435 markings/sec, 95 secs
lola: 10084472 markings, 13975773 edges, 86789 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1))))
lola: processed formula: A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 29 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 824 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((EnablePollingE_10 <= AwakeTasks_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (EnablePollingE_10 <= AwakeTasks_4)
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1098 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9))))
lola: processed formula: A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1583 markings, 1583 edges
lola: ========================================
lola: subprocess 14 will run for 1648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((FetchJobB_1 <= RunE_10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((FetchJobB_1 <= RunE_10)))))
lola: processed formula: A (X (G (F ((FetchJobB_1 <= RunE_10)))))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 608931 markings, 730712 edges, 121786 markings/sec, 0 secs
lola: 1163597 markings, 1437240 edges, 110933 markings/sec, 5 secs
lola: 1700713 markings, 2138232 edges, 107423 markings/sec, 10 secs
lola: 2226105 markings, 2830081 edges, 105078 markings/sec, 15 secs
lola: 2736136 markings, 3519825 edges, 102006 markings/sec, 20 secs
lola: 3241489 markings, 4208503 edges, 101071 markings/sec, 25 secs
lola: 3741873 markings, 4897875 edges, 100077 markings/sec, 30 secs
lola: 4238822 markings, 5583557 edges, 99390 markings/sec, 35 secs
lola: 4731299 markings, 6265191 edges, 98495 markings/sec, 40 secs
lola: 5216967 markings, 6946609 edges, 97134 markings/sec, 45 secs
lola: 5699003 markings, 7626780 edges, 96407 markings/sec, 50 secs
lola: 6174704 markings, 8311525 edges, 95140 markings/sec, 55 secs
lola: 6651382 markings, 8985699 edges, 95336 markings/sec, 60 secs
lola: 7119615 markings, 9662461 edges, 93647 markings/sec, 65 secs
lola: 7589874 markings, 10339989 edges, 94052 markings/sec, 70 secs
lola: 8061810 markings, 11016307 edges, 94387 markings/sec, 75 secs
lola: 8528514 markings, 11688756 edges, 93341 markings/sec, 80 secs
lola: 8989583 markings, 12366630 edges, 92214 markings/sec, 85 secs
lola: 9450798 markings, 13038585 edges, 92243 markings/sec, 90 secs
lola: 9911516 markings, 13717431 edges, 92144 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3191 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
lola: processed formula: A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 574296 markings, 685626 edges, 114859 markings/sec, 0 secs
lola: 1147448 markings, 1416757 edges, 114630 markings/sec, 5 secs
lola: 1673986 markings, 2101863 edges, 105308 markings/sec, 10 secs
lola: 2185595 markings, 2777693 edges, 102322 markings/sec, 15 secs
lola: 2697454 markings, 3467804 edges, 102372 markings/sec, 20 secs
lola: 3197267 markings, 4148920 edges, 99963 markings/sec, 25 secs
lola: 3689016 markings, 4824747 edges, 98350 markings/sec, 30 secs
lola: 4173079 markings, 5494168 edges, 96813 markings/sec, 35 secs
lola: 4653808 markings, 6156327 edges, 96146 markings/sec, 40 secs
lola: 5125545 markings, 6817127 edges, 94347 markings/sec, 45 secs
lola: 5593246 markings, 7476478 edges, 93540 markings/sec, 50 secs
lola: 6053441 markings, 8138432 edges, 92039 markings/sec, 55 secs
lola: 6513207 markings, 8792106 edges, 91953 markings/sec, 60 secs
lola: 6968285 markings, 9445182 edges, 91016 markings/sec, 65 secs
lola: 7422034 markings, 10098791 edges, 90750 markings/sec, 70 secs
lola: 7879862 markings, 10755521 edges, 91566 markings/sec, 75 secs
lola: 8332038 markings, 11405742 edges, 90435 markings/sec, 80 secs
lola: 8779551 markings, 12057231 edges, 89503 markings/sec, 85 secs
lola: 9224515 markings, 12708571 edges, 88993 markings/sec, 90 secs
lola: 9666368 markings, 13358831 edges, 88371 markings/sec, 95 secs
lola: 10105493 markings, 14006967 edges, 87825 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes no yes unknown yes yes no unknown unknown
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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