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 16M
-rw-r--r-- 1 mcc users 6.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 193K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 580K 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 22K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 164K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 514K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 15M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBLF-PT-S06J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266800421
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527485374367


BK_STOP 1527485654734

--------------------
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-S06J06T06 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': 269767, 'Memory': 15920.39, 'Tool': 'lola'}, {'Time': 270692, 'Memory': 15950.25, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-PT-S06J06T06...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J06T06: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-PT-S06J06T06 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 11440/65536 symbol table entries, 6628 collisions
lola: preprocessing...
lola: finding significant places
lola: 700 places, 10740 transitions, 642 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3155 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: A (G (G (X (F ((3 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6)))))) : A (G (F (G (F ((3 <= cPollingAbort)))))) : A ((3 <= cIsMonitoring)) : A (F (G (((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1) U (3 <= ORB_Lock))))) : A ((((P_1095 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6) U (DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6)) U G (X ((3 <= MarkerRead))))) : A (F (((3 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6) U X ((AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6))))) : A (G (((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) U (2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6)))) : A ((NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_5_5 + NotifyEventJobQueuedB_5_6 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_6_5 + NotifyEventJobQueuedB_6_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6)) : A (X (F ((DisablePollingE_3_3 <= Abort_Check_Sources_E_6)))) : A ((P_2579_3_3 <= FetchJobE_6_6)) : A ((NotifyEventJobCompletedE_3 <= CreatedJobs_0_4)) : A ((CreatedJobs_4_6 <= P_1725_5)) : A (X (X ((NotifyEventEndOfCheckSourcesB_3 <= Check_Sources_E_6)))) : A (X (G (F (F ((NotifyEventJobQueuedB_3_0 <= NotifyEventJobQueuedB_5_3)))))) : A (G (X (G (X ((NotifyEventSourceAddedE_1 <= nyo_6)))))) : A (G ((QueueJobB_1_4 <= NotifyEventJobQueuedE_3)))
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 (G (G (X (F ((3 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F ((3 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6))))))
lola: processed formula: A (G (G (X (F ((3 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6))))))
lola: processed formula length: 198
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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: 205 markings, 205 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (F ((3 <= cPollingAbort))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F ((3 <= cPollingAbort)))))
lola: processed formula: A (G (G (F ((3 <= cPollingAbort)))))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= cIsMonitoring))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= cIsMonitoring)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePol... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1) U (3 <= ORB_Lock)))))
lola: processed formula: A (F (G (((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePol... (shortened)
lola: processed formula length: 828
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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: 38 markings, 39 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((P_1095 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((P_1095 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6) U (DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6)) U G (X ((3 <= MarkerRead)))))
lola: processed formula: A ((((P_1095 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + ... (shortened)
lola: processed formula length: 2184
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 28 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: 212 markings, 213 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6) U X ((AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6) U X ((AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))))
lola: processed formula: A (F (((3 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6) U X ((AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))))
lola: processed formula length: 375
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((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) U (2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((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) U (2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6))))
lola: processed formula: A (G (((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) U (2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6))))
lola: processed formula length: 285
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((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 + Noti... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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 + NotifyE... (shortened)
lola: processed formula length: 1230
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((DisablePollingE_3_3 <= Abort_Check_Sources_E_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((DisablePollingE_3_3 <= Abort_Check_Sources_E_6))))
lola: processed formula: A (X (F ((DisablePollingE_3_3 <= Abort_Check_Sources_E_6))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P_2579_3_3 <= FetchJobE_6_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_2579_3_3 <= FetchJobE_6_6)
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NotifyEventJobCompletedE_3 <= CreatedJobs_0_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventJobCompletedE_3 <= CreatedJobs_0_4)
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((CreatedJobs_4_6 <= P_1725_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CreatedJobs_4_6 <= P_1725_5)
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((NotifyEventEndOfCheckSourcesB_3 <= Check_Sources_E_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((NotifyEventEndOfCheckSourcesB_3 <= Check_Sources_E_6))))
lola: processed formula: A (X (X ((NotifyEventEndOfCheckSourcesB_3 <= Check_Sources_E_6))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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: 28 markings, 42 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((NotifyEventJobQueuedB_3_0 <= NotifyEventJobQueuedB_5_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((NotifyEventJobQueuedB_3_0 <= NotifyEventJobQueuedB_5_3)))))
lola: processed formula: A (X (G (F ((NotifyEventJobQueuedB_3_0 <= NotifyEventJobQueuedB_5_3)))))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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: 219380 markings, 853828 edges, 43876 markings/sec, 0 secs
lola: 523225 markings, 1626076 edges, 60769 markings/sec, 5 secs
lola: 827614 markings, 2373497 edges, 60878 markings/sec, 10 secs
lola: 1150196 markings, 3076250 edges, 64516 markings/sec, 15 secs
lola: 1488032 markings, 3736527 edges, 67567 markings/sec, 20 secs
lola: 1707026 markings, 4609677 edges, 43799 markings/sec, 25 secs
lola: 1917264 markings, 5474958 edges, 42048 markings/sec, 30 secs
lola: 2161408 markings, 6307371 edges, 48829 markings/sec, 35 secs
lola: 2479108 markings, 7012575 edges, 63540 markings/sec, 40 secs
lola: 2805411 markings, 7701877 edges, 65261 markings/sec, 45 secs
lola: 3147936 markings, 8366207 edges, 68505 markings/sec, 50 secs
lola: 3459719 markings, 9089053 edges, 62357 markings/sec, 55 secs
lola: 3802371 markings, 9731576 edges, 68530 markings/sec, 60 secs
lola: 4141249 markings, 10375122 edges, 67776 markings/sec, 65 secs
lola: 4439825 markings, 11116197 edges, 59715 markings/sec, 70 secs
lola: 4687799 markings, 11899462 edges, 49595 markings/sec, 75 secs
lola: 5011342 markings, 12585146 edges, 64709 markings/sec, 80 secs
lola: 5358630 markings, 13236651 edges, 69458 markings/sec, 85 secs
lola: 5646812 markings, 13955657 edges, 57636 markings/sec, 90 secs
lola: 5885245 markings, 14763650 edges, 47687 markings/sec, 95 secs
lola: 6180235 markings, 15459929 edges, 58998 markings/sec, 100 secs
lola: 6475888 markings, 16160839 edges, 59131 markings/sec, 105 secs
lola: 6682145 markings, 17040381 edges, 41251 markings/sec, 110 secs
lola: 6977062 markings, 17732579 edges, 58983 markings/sec, 115 secs
lola: 7243049 markings, 18482797 edges, 53197 markings/sec, 120 secs
lola: 7580885 markings, 19129827 edges, 67567 markings/sec, 125 secs
lola: 7870441 markings, 19823921 edges, 57911 markings/sec, 130 secs
lola: 8098334 markings, 20604634 edges, 45579 markings/sec, 135 secs
lola: 8386258 markings, 21313132 edges, 57585 markings/sec, 140 secs
lola: 8628318 markings, 22061206 edges, 48412 markings/sec, 145 secs
lola: 8891919 markings, 22788961 edges, 52720 markings/sec, 150 secs
lola: 9097577 markings, 23625031 edges, 41132 markings/sec, 155 secs
lola: 9424232 markings, 24270394 edges, 65331 markings/sec, 160 secs
lola: 9760322 markings, 24901367 edges, 67218 markings/sec, 165 secs
lola: 10086684 markings, 25546224 edges, 65272 markings/sec, 170 secs
lola: 10392871 markings, 26207111 edges, 61237 markings/sec, 175 secs
lola: 10725210 markings, 26836541 edges, 66468 markings/sec, 180 secs
lola: 11051733 markings, 27467089 edges, 65305 markings/sec, 185 secs
lola: 11378083 markings, 28094531 edges, 65270 markings/sec, 190 secs
lola: 11666765 markings, 28823208 edges, 57736 markings/sec, 195 secs
lola: 11996274 markings, 29436698 edges, 65902 markings/sec, 200 secs
lola: 12317877 markings, 30077778 edges, 64321 markings/sec, 205 secs
lola: 12657228 markings, 30714326 edges, 67870 markings/sec, 210 secs
lola: 12995072 markings, 31347962 edges, 67569 markings/sec, 215 secs
lola: 13307975 markings, 32024900 edges, 62581 markings/sec, 220 secs
lola: 13564701 markings, 32774303 edges, 51345 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((NotifyEventSourceAddedE_1 <= nyo_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (X ((NotifyEventSourceAddedE_1 <= nyo_6))))))
lola: processed formula: A (G (X (G (X ((NotifyEventSourceAddedE_1 <= nyo_6))))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 304 markings, 304 edges
lola: ========================================
lola: subprocess 15 will run for 3305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((QueueJobB_1_4 <= NotifyEventJobQueuedE_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 2568 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: 9 markings, 8 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes yes yes yes yes yes unknown no no
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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-S06J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T06.tgz
mv PolyORBLF-PT-S06J06T06 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is PolyORBLF-PT-S06J06T06, 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 r215-smll-152732266800421"
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 ;